Project_euler_1/36.c at master · Hanuu/Project_euler_1 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <stdio.h>
#include <math.h>

int digit(int number){
    int out=0;
    while(number>=1){
        number/=10;
        out++;
    }
    return out;
}

int function2(int number, int binarydigit[20]){
    int k=0;
    while(number!=1){
        int temp=number/2;
        int RestTemp=number%2;
        number=number/2;
        *binarydigit[k]=RestTemp;
        k++;
    }
}

int main(){
    int sum=0;
    for(int number=1;number<1000000;number+=2){

        int numberofdigit[6];
        for(int i=0;i<digit(number);i++){
            numberofdigit[i]=number/pow(10,i);
        }

        int binarydigit[20]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};

        if(digit(number)==1){
            sum+=number;
        }
        else if(digit(number)==2){
            if(numberofdigit[0]==numberofdigit[1]){
                function2(number,&binarydigit[]);

            }
        }
        else if(digit(number)==3){

        }
        else if(digit(number)==4){

        }
        else if(digit(number)==5){

        }
        else if(digit(number)==6){

        }

    }
    printf("%d",sum);
}