発展課題集

・発展1

#include <stdio.h>
int main()
{
    int M,N,m,n,tmpn;
    printf("[Computing GCD] Please input two integers : ");
    scanf("%d%d",&M,&N);
    
    if(M >= N)m = M,n = N;
    else n = M,m = N;
    
    while(n){
        tmpn = n;
        n = m % n;
        m = tmpn;
    }
    
    printf("GCD of %d and %d : %d\n",M,N,m);
    
    return 0;
}

発展2

#include <stdio.h>

int main()
{
    long long int n,r,p = 1,c = 1,i;
    printf("Please input two integers as n and r : ");
    scanf("%lld%lld",&n,&r);
    
    for(i = 0;i < r;i++){
        p *= (n - i);
        c *= (i + 1);
    }
    
    printf("Number of Permutation : %lld    Number of Combination : %lld\n",p,p/c);
    
    return 0;
}

発展3

#include <stdio.h>

int main()
{
    int N,i = 2,n,zyou;
    printf("Please input a positive integer for prime factorization : ");
    scanf("%d",&N),n = N;
    
    printf("Prime factorization of %d :",N);
    
    if(N == 1){
        puts(" 1");
        return 0;
    }
    
    while(i <= n){
        if(n % i != 0){
            i++;
            continue;
        }
        printf(" %d",i);
        zyou = 0;
        while(n % i == 0)zyou++,n /= i;
        if(zyou > 1)printf("^%d",zyou);
        i++;
    }
    
    printf("\n");
    
    return 0;
}