Submission

Score: 100

User: Jokul

Problemset: แปลงเลขฐาน

Language: c

Time: 0.002 second

Submitted On: 2025-05-23 15:16:50

#include<stdio.h>
int main(){
long long int ten=0,mod2=0,mod8=0,mul=1,len,multen=1,ten1;
char s[4];
gets(s);
 len=strlen(s);
long long int sum[len],j=0;
for(long long int i=len-1;i>=0;i--)
{
    if(s[i]=='0')
    {
        sum[i]=0;
    }
    if(s[i]=='1')
    {
        sum[i]=1;
    }
    if(s[i]=='2')
    {
        sum[i]=2;
    }
    if(s[i]=='3')
    {
        sum[i]=3;
    }
    if(s[i]=='4')
    {
        sum[i]=4;
    }
    if(s[i]=='5')
    {
        sum[i]=5;
    }
    if(s[i]=='6')
    {
        sum[i]=6;
    }
    if(s[i]=='7')
    {
        sum[i]=7;
    }
    if(s[i]=='8')
    {
        sum[i]=8;
    }
    if(s[i]=='9')
    {
        sum[i]=9;
    }
    if(s[i]=='A')
    {
        sum[i]=10;
    }
    if(s[i]=='B')
    {
        sum[i]=11;
    }
    if(s[i]=='C')
    {
        sum[i]=12;
    } if(s[i]=='D')
    {
        sum[i]=13;
    }
    if(s[i]=='E')
    {
        sum[i]=14;
    }
    if(s[i]=='F')
    {
        sum[i]=15;
    }
}
    for(long long int i=len-1;i>=0;i--)
    {
        ten=ten+(sum[i]*mul);
        mul=mul*16;
    }
    ten1=ten;
    for(long long int i=0;i<17;i++)
    {
        mod2=mod2+((ten%2)*multen);
        multen=multen*10;
        ten=ten/2;
    }
      multen=1;
    for(long long int i=0;i<17;i++)
    {

        mod8=mod8+((ten1%8)*multen);
        multen=multen*10;
        ten1=ten1/8;
    }
    printf("%lld\n",mod2);
    printf("%lld",mod8);


}