label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
25
|
12000
|
int main()
{
int u=0,b=0,n,i,d=0,j,c[1000]={0};
char a[1000],w[1000];
scanf("%d",&n);
for (i=0;i<n;i++)
{
if (i==0)
{
a[0]='2';
continue;
}
for (j=0;j<=0.4*n;j++)
{
if ( (a[j]-'0'<0)||(a[j]-'0'>9) )
a[j]='0';
b=a[j]-'0';
if (b*2>=10)
{
c[j+1]=1;
a[j]=(b*2)%10+'0'+c[j];
c[j]=0;
}
if (b*2<10)
{
a[j]=b*2+'0'+c[j];
c[j]=0;
}
}
}
for (int t=strlen(a);t>=0;t--)
{
if ( (a[t]-'0'>=0) && (a[t]-'0'<=9) )
{
w[d]=a[t];
d++;
}
}
for (i=0;i<strlen(w);i++)
{
if (w[i]!='0')
{
u=i;
break;
}
}
for (i=u;i<strlen(w);i++)
{
if ( (w[i]-'0'>=0) && (w[i]-'0'<=9) )
printf("%c",w[i]);
}
if (n==0)
printf("1");
}
|
25
|
12001
|
int a[40] = {0}, b[40] = {0};
void f()
{
int i, y;
for (i = 0; i < 40; i++)
b[i] = 0;
for (i = 39; i > 0; i--)
{
y = a[i] * 2;
b[i - 1] += y / 10;
b[i] += y % 10;
if (b[i] > 9)
{
b[i - 1]++;
b[i] -= 10;
}
}
for (i = 0; i < 40; i++)
a[i] = b[i];
}
int main()
{
int n, i, j;
cin >> n;
a[39] = 2;
if (n == 0)
cout << "1" << endl;
else
{
for (i = 1; i < n; i++)
f();
for (i = 0; ;i++)
if (a[i] != 0)
break;
for (j = i; j < 40; j++)
cout << a[j];
cout << endl;
}
return 0;
}
|
25
|
12002
|
int main()
{
int n ;
cin>> n ;
char a[100] = {0};
a[0] = 1 ;
int length = 1 ;
for (int i = 0 ; i< n ; i++)
{
int add = 0 ;
for (int j = 0 ; j<length ; j++)
{
a[j] *= 2 ;
a[j] += add ;
if (a[j] > 9)
{
int temp = a[j] ;
add = temp /10 ;
a[j] = temp % 10 ;
}
else
{
add = 0 ;
}
}
if (add > 0)
{
a[length] = add ;
length ++ ;
}
}
for (int i = 0 ; i< length ; i++ )
a[i] += '0' ;
for (int i = length-1 ; i>= 0 ;i--)
cout<<a[i] ;
return 0;
}
|
25
|
12003
|
void main()
{
int n,i,l,a[100]={0},k=0;
scanf("%d",&n);
a[0]=1;
for (l=0;l<n;l++)
{
for (i=0;i<=k;i++)
a[i]*=2;
for (i=0;i<=k;i++)
{
a[i+1]+=a[i]/10;
a[i]=a[i]%10;
}
if (a[k+1]!=0) k++;
}
for (i=k;i>=0;i--)
printf("%d",a[i]);
printf("\n");
}
|
25
|
12004
|
char an[1000000];
void Re(char a[], char *a0)
{
int len = strlen(a), i;
for (i = 0; i < len; i++)
*(a0 + len - i - 1) = a[i];
*(a0 + len) = '\0';
}
void Mul( char *a)
{
char a0[10000], re0[10000], re[10000];
Re(a, a0);
int len = strlen(a), t = 0, i, p;
for (i = 0; i < len; i++)
{
p = t + (a0[i] - '0') * 2;
re0[i] = (p % 10) + '0';
t = p / 10;
}
re0[len] = t + '0';
re0[len + 1] = '\0';
if (re0[len] == '0')
re0[len] = '\0';
//cout<< "*" << re0 << endl;
Re(re0, re);
//cout<< "**" << re << endl;
strcpy(an, re);
//cout<< "***" << an << endl;
}
int main()
{
char a[10000] = {'2'}, a0[10000];
int lena, n, i;
cin >> n;
lena = strlen(a);
if (n == 0)
{
cout << 1 << endl;
return 0;
}
for (i = 1; i < n; i++)
{
Mul(a);
strcpy(a, an);
//cout << a << endl;
}
//cout <<
cout << a << endl;
//for (i = 0; i < strlen(an); i++)
// if (a[i] != '0')
// cout << a[i] ;
return 0;
}
|
25
|
12005
|
/**
* ???2?n??
* ?????
* ???10.12.20
**/
int a[100];
int n,i;
int main()
{
cin>>n;
a[0]=1;
while(n--)
{
for(i=0;i<100;i++)
a[i]*=2;
for(i=0;i<99;i++)
{
a[i+1]+=a[i]/10;
a[i]%=10;
}
}
for(i=50;i>0&&a[i]==0;i--);//????? ?????????
for(;i>=0;i--)
cout<<a[i];
cout<<endl;
return 0;
}
|
25
|
12006
|
//********************************
//*???5.??2?N?? **
//*?????? 1300017623 **
//*???2013.11.13 **
//********************************
int main()
{
int n, flag = 0, tag = 0;
int a[100] = {1};
cin >> n;
for (; n > 0; n--)
for (int i = 0; i < 100; i++)
{
a[i] *= 2;
if (flag)
a[i]++;
flag = 0;
if (a[i] > 9)
{
flag = 1;
a[i] -= 10;
}
}
for (int i = 99; i >= 0; i--)
{
if (a[i] != 0 || tag)
{
tag = 1;
cout << a[i];
}
}
return 0;
}
|
25
|
12007
|
int main()
{
int a[MAXLEN]={0};
int i,n,count=1;
void multiply2(int a[MAXLEN]);
cin >> n;
a[0]=1;
for (i=0;i<n;i++) //calculate 2^n;
multiply2(a);
for (i=MAXLEN-1;i>=0;i--) //find the highest bit
if (a[i]!=0)
break;
for (;i>=0;i--) //print result
cout << a[i];
cout << endl;
return 0;
}
void multiply2(int a[MAXLEN]) //calculate a*2,and store the result in array a[]
{
int i,l;
for (l=MAXLEN-1;l>=0;l--)
if (a[l]!=0)
break;
for (i=0;i<=l;i++)
a[i] *= 2;
for (i=0;i<l+2;i++)
if ( a[i]>=10 )
{
a[i] -= 10;
a[i+1]++;
}
}
|
25
|
12008
|
//********************************************
//* file : 1000012912_002.cpp *
//* author : ??? *
//* data : 2010.12.15 *
//* function : ??2?N?? *
//********************************************
int main()
{
int n, i, j, ans[101]; //ans???????100?
cin >> n;
memset(ans,0,sizeof(ans)); //??????1
ans[0] = 1;
for ( i = 0; i < n; i++ )
{
for ( j = 0; j < n; j++ )
ans[j] = ans[j]* 2; //???2
for ( j = 0; j < n; j++ )
if ( ans[j] >= 10 )
{
ans[j+1] += ans[j] / 10; //??
ans[j] %= 10;
}
}
while ( ans[i] == 0 )
i--;
for(; i >= 0; i-- )
cout << ans[i];
cout << endl;
return 0;
}
|
25
|
12009
|
int main()
{
//??n???????num???????????add???????flag?????????????????
int n, num[50], add = 0, flag = 0;
//?num????
memset( num, 0, sizeof(num) );
//?num[0]??1
num[0] = 1;
cin >> n;
for ( int i = 0; i < n; i++ )//i????????????
{
for ( int j = 0; j < 50; j++ )//???????????????
{
num[j] = num[j] * 2;
num[j]+=add;
add = num[j] / 10;
num[j] = num[j] % 10;
}
}
for ( int i = 49; i >= 0; i-- )
//??????????????flag?????0??????????????????
if ( num[i] != 0 && flag == 0 )
{
cout << num[i];
flag++;
}
//??????????????
else
if ( flag )
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12010
|
int calculate(int);
int main()
{
int n, i, j = 0;
int flag = 0, a;
int str1[100000];
int str2[100000];
cin >> n;
if(n == 0)
{
cout << "1" << endl;
return 0;
}
else
{
if(n == 1)
{
cout << "2" << endl;
return 0;
}
memset(str1, -1, sizeof(str1));
memset(str2, 0, sizeof(str2));
str1[0] = 2;
for(i = 1; i < n; i++)
{
while(str1[j] != -1)
{
str2[j] = str1[j] * 2 + str2[j];
if(str2[j] >= 10)
{
str2[j] = str2[j] - 10;
str2[j + 1]++;
}
j++;
}
if(i == n - 1)
break;
for(j = 0; j < 1000; j++)
{
str1[j] = str2[j];
str2[j] = 0;
}
j = 0;
}
j = 100000 - 1;
while(str2[j] == 0)
j--;
for(i = j; i >= 0; i--)
{
cout << str2[i];
}
}
return 0;
}
|
25
|
12011
|
int main()
{
int a[50],n;
memset(a,0,sizeof(a));
a[0]=1;
cin>>n;
while (n--)
{
for (int i=0;i<49;i++)
{
a[i] *= 2;
}
for (int i=0;i<49;i++)
{
while (a[i]>9)
{
a[i] -= 10;
a[i+1]++;
}
}
}
n=49;
while (a[n]==0)
n--;
for (int i=n; i>=0;i--)
cout<<a[i];
return 0;
}
|
25
|
12012
|
char a[100];
int n, i, j, k, times = 0;
int ex[100] = {0};
int main()
{
cin >> n;
if (n == 0)
{
cout << '1';
return 0;
}
for (i = 0; i != 100; i++)
{
if (i == 0)
a[i] = '1';
else
a[i] = '0';
} //???a???1
for (i = 1; i != n + 1; i++)
{
for (j = 0; j != i; j++)
{
if (a[j] <= '4')
a[j] = (a[j] - '0') * 2 + '0';
else
{
a[j] = (a[j] - '0') * 2 + '0' - 10;
ex[j + 1] = 1;
}
}
for (k = 0; k != n; k++)
{
if (ex[k] == 1)
{
a[k]++;
ex[k] = 0;
}
}
}
for (i = n - 1; i != -1; i--)
{
if (a[i] == '0' && times == 0)
continue;
else
{
cout << a[i];
times++;
}
}
cout << endl;
return 0;
}
|
25
|
12013
|
int main()
{
int i, j, len = 1, n;
int ans[50] = {0};
cin >> n;
ans[0] = 1;
for (i = 0; i < n; i++)
{
for (j = 0; j < len; j++)
{
ans[j] = ans[j] * 2;
}
for (j = 0; j < len; j++)
{
if (ans[j] > 9)
{
ans[j] -= 10;
ans[j + 1] += 1;
if (j == len - 1)
{
len++;
break;
}
}
}
}
for (i = 0; i < len; i++)
{
cout << ans[len - i - 1];
}
return 0;
}
|
25
|
12014
|
int a[100] = {0}, len = 1;
void cal(int);
void print();
int main()
{
int n;
cin >> n;
a[0] = 2;
if(n > 0)
{
cal(n);
print();
}
else
{
cout << "1" << endl;
}
return 0;
}
void cal(int x)
{
int i;
if(x != 1)
{
for(i = 0; i < len; i++)
{
a[i] *= 2;
}
for(i = 0; i < len; i++)
{
if(a[i] >= 10)
{
a[i] -= 10;
a[i+1] += 1;
if(i == len - 1)
{
len++;
}
}
}
cal(x - 1);
}
}
void print()
{
int i;
for(i = len - 1; i >= 0; i--)
{
cout << a[i];
}
cout << endl;
}
|
25
|
12015
|
//*****************************************
//* ?????2?N?? **
//* ?????? 1300012741 **
//* ???2013.10.30 **
//*****************************************
int main()
{
char number[50] = { 2 }; // ????
int i, j, N; // ??????????
cin >> N;
if ( N == 0 ) // ???????
{
cout << 1;
return 0;
}
for ( i = 0; i < N - 1; i++ )
{
for ( j = 0; j < 50; j++ ) // ????
number[j] *= 2;
for ( j = 0; j < 50; j++ ) // ????
{
number[j + 1] += number[j] / 10;
number[j] -= number[j] / 10 * 10;
}
}
for ( j = 49; j >= 0; j-- ) // ??????
{
if ( number[j] != 0 )
break;
}
for ( i = j; i >= 0; i-- ) // ??????????
printf( "%d", number[i] );
return 0;
}
|
25
|
12016
|
// ?????? ???1000010500
// ??2?N??
// 2010-12-15
int main()
{
int a[32],i,j,N;
cin >> N; // N??
memset(a,0,sizeof(a)); // ???
if (N == 1) // 1??????2
cout << "2" << endl;
else if (N == 0)
cout << "1" << endl;
else
{
a[0] = 2;
for (i = 1;i < N;i++)
{
for (j = 0;j < 32;j++) // ????2
a[j] *= 2;
for (j = 0;j < 32;j++)
if (a[j] > 9) // ??
{
a[j] -= 10;
a[j + 1] ++;
}
}
for (i = 31;i >= 0;i--) // ?????0???
if (a[i] != 0)
break;
for (i = i;i >= 0;i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
25
|
12017
|
int main()
{
char a[40]={0};
int b[40]={0};
int i,j,k;
a[0]='1';
int n;
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<40;j++)
{
if(a[j]==0)
break;
b[j]=(a[j]-'0')*2;
}
for(k=j-1;k>0;k--)
{
if(b[k]>=10)
{b[k]=b[k]-10;
b[k-1]=b[k-1]+1;}
}
if(b[0]<10)
for(k=0;k<j;k++)
a[k]=b[k]+'0';
else
{a[0]='1';a[1]=b[0]-10+'0';
for(k=1;k<j;k++)
a[k+1]=b[k]+'0';}
}
cout<<a;
return 0;
}
|
25
|
12018
|
/*???????2?N??
*??????
*???2010/12/16
*???1000010449
*/
void multiply(char *p)
{
int num[70], i = 0, end;
num[0] = 0;
while (*(p + i) != '\0')
{
num[i + 1] = 2 * (*(p + i) - '0');
i++;
}
end = i;
for (i = end; i > 0; i--)
{
num[i - 1] += num[i] / 10;
num[i] %= 10;
}
if (num[0] == 0)
i = 1;
else
i = 0;
while (i <= end)
*p++ = num[i++] + '0';
*p = '\0';
return;
}
int main()
{
char result[71] = "1";
int n, i;
cin >> n;
for (i = 0; i < n; i++)
multiply(result);
cout << result << endl;
return 0;
}
|
25
|
12019
|
int main ()
{
int n;
cin>>n;
if(n==0) cout<<"1"<<endl;
int k=99;
int a[100]={2};
for(int i=0;i<n-1&&n!=0;i++)
{
for(int j=0;j<n;j++)
{
a[j]=a[j]*2;
}
for(int j=0;j<n;j++)
{
if(a[j]>=10)
{
a[j+1]=a[j+1]+a[j]/10;
a[j]=a[j]%10;
}
}
}
while(a[k]==0)
k--;
for(int j=k;j>=0&&n!=0;j--)
cout<<a[j];
cout<<endl;
return 0;
}
|
25
|
12020
|
int main()
{
int n=0,i=0,x=0,y=0,a[100]={1},j=0,jin=0,s=0;//????,???????1,??????
cin>>n;
for(i=0;i<n;i++)
{
for(x=0;x<100;x++)
{
if(j==1)//????????????
jin=1;
else
jin=0;
if(a[x]<5)//???,????
{
a[x]=a[x]*2;
j=0;
}
else//??,????,j=1
{
a[x]=a[x]*2-10;
j=1;
}
if(jin==1)
a[x]=a[x]+1;
}
}
for(i=99;i>=0;i--)//???????????????,?????
{
if(a[i]!=0)
{
s=i;
break;
}
}
for(;s>=0;s--)//????
cout<<a[s];
return 0;
}
|
25
|
12021
|
int main()
{
int b[100] = {0};
int n,i,count = 0,k = 1,j,flag = 0;
cin >> n;
b[0] = 1;
for (j = 1;j <= n;j++)
{
for (i = 0;i < k;i++)
b[i] = b[i] * 2;
for (i = 0;i < k;i++)
{
if (i == k - 1 && b[i] >= 10)
k++;
if (b[i] >= 10)
{
b[i] = b[i] - 10;
b[i + 1]++;
}
}
}
for (i = 99;i >= 0;i--)
{
if (b[i] != 0)
count = 1;
if (count)
cout << b[i];
}
return 0;
}
|
25
|
12022
|
//**************************
//* ??????2?N?? *
//* ? ????? *
//* ? ??1000012738 *
//* ? ??2010.12.21 *
//**************************
int main()
{
int product[33] = {0}, i, j, n; // ?????????????
cin >> n; // ????
product[0] = 1; // ??????1
for(i = 0; i < n; i++) // ????
{
for(j = 0; j < 33; j++) // ????2
{
product[j] *= 2;
}
for(j = 0; j < 33; j++) // ???????
{
if(product[j] >= 10) // ???10
{
product[j] -= 10; // ???10
product[j + 1] += 1; // ????1
}
}
}
for(i = 32; i >= 0; i--) // ????????????????????
if(product[i] != 0)
break;
for( ; i >= 0; i--) // ????
{
cout << product[i];
}
return 0;
}
|
25
|
12023
|
//???
int main()
{
char a[1001];
char p = NULL;
a[0] = '2';
int n, i, j, k = 0, k1 = 0;
for (i = 1; i < 1001; i++)
a[i] = '0';
cin >> n;
if (n == 0)
cout << 1 << endl;
else
{
for (i = 1; i < n; i++)
for (j = 0; j < 1001; j++)
{
k1 = ((a[j] - '0') * 2 + k) / 10;
a[j] = ((a[j] - '0') * 2 + k) % 10 + '0';
k = k1;
}
for (i = 1000; i >= 0; i--)
if (a[i] != '0')
break;
for (; i >= 0; i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
25
|
12024
|
/************************************************
**authour: ??? *
**number: 1000012905 *
**descripition: ??2?N?? *
************************************************/
int result[101] = {0}; //????????????0
void yiwei(int); //???????????
int main()
{
int n;
result[100] = 1; //?????????????1
cin >> n;
//? n ???
for (int i = 0; i < n; i ++)
{
//??????????2
for (int j = 0; j < 101; j ++)
{result[j] = result[j] * 2;}
//??10???????????????????
if(i % 10 == 0)
{yiwei(100);}
}
yiwei(100); //????????????
//??????
int *p = result;
while(*p == 0)
{p ++;}
//??????
for (;p < result + 101; p ++)
{cout << *p;}
cout << endl;
return 0;
}
void yiwei(int n)
{
//?????????????????
if(n == 0)
{return;}
//??? n ????????10?????????????
if(result[n] >= 10)
{
int k = result[n] % 10;
result[n - 1] += (int)(result[n] / 10);
result[n] = k;
}
//?????????????????
yiwei(n - 1);
return;
}
|
25
|
12025
|
int main()
{
int num, temp, up = 0, flag = 0;
char m[100];
for (int i = 1; i < 100;i++)
{
m[i] = '0';
}
m[0] = '1';
cin >> num;
for (int k = 0; k < num; k++)
{
for (int p = 0; p < 100;p++)
{
temp = (m[p] - '0') * 2;
m[p] = temp % 10 + up + '0';
up = temp /10 ;
}
}
for (int r = 99; r >= 0; r--)
{
if ((m[r] == '0')&&(flag == 0))
continue;
cout << m[r];
flag = 1;
}
return 0;
}
|
25
|
12026
|
int num[500]={4,2,8,1,4,7,3,7,0,1};
void cul(int num[],int t)
{
int s[500]={0},k=0;
for (int j=0;j<500;j++)
{
s[j]=t*num[j]+k;
num[j]=s[j]%10;
k=s[j]/10;
}
}
void out(int num[])
{
int sum,i,j,k;
for (i=0;i<500;i++)
{
sum=0;
for (j=i;j<500;j++)
{
sum+=num[j];
if (sum>0)
break;
}
if (sum==0)
break;
}
for (k=i-1;k>=0;k--)
cout << num[k];
}
int main()
{
int n,sum=1;
cin >> n;
if (n<=30)
{
for (int i=0;i<n;i++)
sum=2*sum;
cout << sum <<endl;
}
else
{
n=n-30;
do
{
if (n>=3)
{
cul(num,8);
n-=3;
}
if (n==2)
{
cul(num,4);
n-=2;
}
if (n==1)
{
cul(num,2);
n--;
}
}
while (n!=0);
out(num);
}
return 0;
}
|
25
|
12027
|
int a[100]={0},l;
void count(int);
int main()
{
int n;
cin>>n;
if(n==0)
cout<<"1"<<endl;
else
if(n==1)
cout<<"2"<<endl;
else
{
a[0]=2;
count(n-1);
l=99;
while(a[l]==0)
l--;
for(;l>=0;l--)
cout<<a[l];
cout<<endl;
}
return 0;
}
void count(int n)
{
int i;
if(n==0)
return;
else
{
for(i=0;i<99;i++)
a[i]=a[i]*2;
for(i=0;i<99;i++)
if(a[i]>=10)
{
a[i+1]+=a[i]/10;
a[i]=a[i]%10;
}
}
count(n-1);
}
|
25
|
12028
|
int main()
{
int n,flag =0;
cin >> n;
int a[100] ={0};
a[0] = 1;
int i,j;
for (i = 1;i <=n; i++)
{
for(j =0;j<=99;j++)
a[j] = a[j]*2;
for(j = 0; j<=99;j++)
{
if (a[j] >=10)
{
a[j+1] = a[j+1]+(a[j]-a[j]%10)/10;
a[j] = a[j]%10;
}
}
}
for(i =99; i>=0;i--)
{
if(a[i]!=0 ||flag)
{
flag =1;
cout <<a[i];
}
}
return 0;
}
|
25
|
12029
|
int main()
{
char a[100];
int j, n, i, k = 0;
a[0] = 2;
for(i = 1; i < 100; i++)
a[i] = 0;
cin >> n;
if(n == 0)
cout << "1" <<endl;
else
{for(j = 0; j < n - 1;j++)
{
int flag = 1;
for(i = 0; i < 100; i++)
{
if(flag)
{
if((a[i] - 0) * 2 < 10)
a[i] = (a[i] - 0) * 2;
else
{
a[i] = ((a[i] - 0) * 2) % 10 ;
flag = 0;
}
}
else
{
if(((a[i] - 0) * 2 + 1) < 10)
{
a[i] = (a[i] - 0) * 2 + 1;
flag = 1;
}
else
{
a[i] = ((a[i] - 0) * 2 )% 10 + 1;
flag = 0;
}
}
}
}
for(i = 99; i >= 0; i--)
{
if(a[i] != 0)
k = 1;
if(k)
cout << a[i] - '0' + 48;
}
}
return 0;
}
|
25
|
12030
|
int num[101] = {0};
void fun()
{
int temp = 0, j = 100;
do
{
if (num[j] < 5)
{
num[j] = num[j] * 2 + temp;
temp = 0;
}
else
{
num[j] = num[j] * 2 - 10 + temp;
temp = 1;
}
j--;
} while(j >= 0);
return;
}
int main()
{
num[100] = 1;
int N, i, flag = 0;
cin >> N;
for (i = 0; i< N; i++)
fun();
for (i = 0; i < 101; i++)
{
if (flag == 0 && num[i] == 0)
continue;
cout << num[i];
flag = 1;
}
return 0;
}
|
25
|
12031
|
//Name: ??2?N??.#
//Author: ?? #
//Number:1000062710 #
//Date:2010?12?15?#
//####################
int main()
{
int N,i;
cin >> N;
int a[400] = {0};
a[399] = 1;
for(i = 0; i < N; i++)
{
for(int j = 0; j < 400; j++)
{
a[j] = a[j] * 2;
}
for(int k = 399; k >= 0; k--)
{
if(a[k] >= 10)
{
a[k] = a[k] - 10;
a[k - 1]++;
}
}
}
for(i = 0; i < 400; i++)
{
if(a[i] != 0)
break;
}
for(int j = i; j < 400; j++)
{
cout << a[j];
}
cout << endl;
return 0;
}
|
25
|
12032
|
int main()
{
int n;
cin >> n;
char num[100];
int add[100] ={0};
int i, j, flag[100] ={0};
num[99] = '1';
flag[99] = 1;
for (i = 0; i < 99; i ++)
num[i] ='0';
if ( n == 0 )
cout << num[99];
for (i = 1; i <= n; i ++)
{
for (j = 99; flag[j] == 1; j -- )
{
if ((num[j] - '0') * 2 < 10 )
num[j] = (num[j] - '0') * 2 + '0';
else
{
add[j - 1] = (num[j] - '0') * 2 / 10;
num[j] = ((num[j] - '0') * 2) %10 + '0';
}
}
if ( add[j] == 1 )
flag[j] = 1;
for ( j = 0; j < 100; j ++ )
{
num[j] = add[j] + num[j];
add[j] = 0;
}
}
if ( n != 0 )
{
for (i = 0; i < 100; i ++ )
if (flag[i])
cout << num[i];
}
return 0;
}
|
25
|
12033
|
int a[100][300]={0};
void cheng(int t);
int main()
{
int n;
cin>>n;
a[0][1]=1;
int i,start;
for(i=1;i<=n;i++) cheng(i);
for(i=200;i>0;i--)
{
if(a[n][i]!=0) {start=i;break;}
}
for(i=start;i>0;i--) cout<<a[n][i];
return 0;
}
void cheng(int t)
{
int i;
for(i=1;i<200;i++)
{
a[t][i]=a[t][i]+a[t-1][i]*2;
if(a[t][i]>9) {a[t][i]=a[t][i]-10;a[t][i+1]++;}
if(a[t][i+1]>9) {a[t][i+1]=a[t][i+1]-10;a[t][i+2]++;}
}
}
|
25
|
12034
|
int main()
{
int i,n,t,len,ans[100];
cin >> n;
len=1;ans[0]=1; // ???
while (n--)
{
t=0; // ??
for (i=0;i<len;i++)
{
ans[i]=ans[i]*2+t; // ??+??
t=ans[i]/10; // ??
ans[i]%=10;
}
if (t>0) ans[len++]=t; // ????
}
for (i=len-1;i>=0;i--)
cout << ans[i]; // ??
cout << endl;
return 0;
}
|
25
|
12035
|
char answer[1000000]={'1'};
int temp[1000000]={0};
int main()
{
int n;
cin>>n;
if (n==0)
cout<<'1';
else{
int i,j;
for (j=0;answer[j]!='\0';j++)
temp[j]= answer[j]-'0';
for (int k=1;k<=n;k++)
{
for (i=0;i<j;i++)
temp[i]=temp[i]*2;
for (i=0;i<j;i++)
{
if (temp[i]>=10)
{
temp[i+1] += temp[i]/10;
temp[i]=temp[i]%10;
}
}
while (temp[i]==0)
i--;
j=i+1;
}
for ( j=i;j>=0;j--)
cout<<temp[j];
}
return 0;
}
|
25
|
12036
|
int main ()
{
int i,j,k,n, remain = 0, index;
int ans[100000] = {1,0};
cin >> n;
for (i = 0; i < n; i++)
{
remain = 0;
for (j = 0; j < 100000; j++)
{
ans[j] = 2*ans[j] + remain;
remain = ans[j] /10;
ans[j] = ans[j] %10;
}
}
index = 99999;
while (ans[index] == 0)
index--;
for (i = index; i >= 0; i--)
cout << ans[i];
cout << endl;
}
|
25
|
12037
|
//********************************
//*ày3ì?o¼ÆËã2?ÄN?η½ **
//*×÷Õß?oíõÅô·é 1300013007 **
//*ê±¼ä?o2013.11.15 **
//********************************
int main()
{
int n, i, j, k, l, len;
int num[110] = {0};
cin >> n;
if(n == 0)
cout << "1";
else
{
num[0] = 1; len = 1;
for(i = 1; i <= n; i++)
{
for(k = 0; k < len; k++)
{
num[k] *= 2;
}
for(l = 0; l < len; l++)
{
if(num[l] >= 10)
{
num[l+1] += num[l] / 10;
num[l] %= 10;
}
}
if ( num[len]!=0 ) len++ ;
}
for( j=len-1 ;j >= 0; j--)
cout << num[j];
}
return 0;
}
|
25
|
12038
|
int main(){
int n,i,c,j;
scanf("%d",&n);
int sz[100]={1,0};
c=0;
for(j=0;j<n;j++){
for(i=0;i<100;i++){
sz[i]=sz[i]*2+c;
if(sz[i]>=10){
sz[i]-=10;
c=1;
}else{
c=0;
}
}
}
i=99;
while(sz[i]==0){
i--;
}
for(;i>=0;i--){
printf("%d",sz[i]);
}
return 0;
}
|
25
|
12039
|
int line[99999]={0},temp[99999]={0};
void cal(int line[99999])
{
int i;
for(i=0;i<9999;i++)
{
temp[i]=line[i]*2;
}
for(i=0;i<9999;i++)
{
if(temp[i]>=10)
{
temp[i]=temp[i]-10;
temp[i+1]=temp[i+1]+1;
}
}
for(i=0;i<9999;i++)
{
line[i]=temp[i];
}
}
int main()
{
int n,p=0,j,i;
cin>>n;
if(n==0)cout<<"1"<<endl;
else
{
line[0]=1;
while(p<n)
{
cal(line);
p++;
}
j=9998;
while(temp[j]==0)j--;
for(i=j;i>=0;i--)
cout <<temp[i];
cout <<endl;
}
return 0;
}
|
25
|
12040
|
int main()
{
int n,a[100] = {0},i,ii = 0,b[100] = {0};
cin >> n; //??n
a[0] = 1;
for (i = 0;i < n;i++) //??n?
{
for (ii = 0;ii < 100;ii++)
b[ii] = 0;
for (ii = 0;ii < 100;ii++) //????2
{
a[ii] = a[ii] * 2;
if (a[ii] >= 10) //??????
{
b[ii + 1] = 1;
a[ii]-= 10;
}
}
for (ii = 0;ii < 100;ii++) //????
a[ii]+= b[ii];
}
for (i = 99;a[i] == 0;i--); //??????????
while (i >= 0) //????
{
cout << a[i];
i--;
}
return 0;
}
|
25
|
12041
|
int a[510],b[510];
void function();
int main()
{
a[0]=2;b[0]=-1;
for(int i=1;i<=500;i++){
a[i]=-1;b[i]=-1;
}
int n;
cin>>n;
if(n==0)cout<<"1";
else if(n==1)cout<<"2";
else {
for(int j=1;j<n;j++)
{function();}
int lena;
for(int i=0;i<=500;i++)
if(a[i]==-1)
{lena=i-1;break;}
for(int i=lena;i>=0;i--)
cout<<a[i];
}
return 0;
}
void function()
{ int lena;
for(int i=0;i<=500;i++)
if(a[i]==-1){
lena=i-1;break;
}
//???a[],??0-lena
for(int i=500;i>=500-lena;i--)
{a[i]=a[500-i];b[i]=a[500-i];}
//??a[],????b[]
for(int i=500-lena;i<=500;i++){
a[i]=2*a[i];
if(a[i]>=10){
a[i]=a[i]-10;
a[i-1]++;
if(a[i-1]==0){a[i-1]++;lena++;}//?????????????
}
}
for(int i=0;i<=lena;i++)
{a[i]=a[500-i];b[i]=-1;}
//??a[]????b[]
}
|
25
|
12042
|
int main()
{
int a[42] = {0}, N, i, j, k; //?????????0
cin >> N;
a[41] = 1; //??????????2
if (N == 0)
{
cout << "1" << endl;
return 0;
}
for (k = 1; k <= N; k++) //????N??2
{
for (i = 41; i >= 0; i--) //??????2
a[i] = a[i] * 2;
for (j = 41; j >= 0; j--) //?????
if (a[j] >= 10)
{
a[j-1] += a[j] / 10;
a[j] = a[j] % 10; //??
}
}
i = 0; //?i???
while(a[i]==0) //???????0??
i++;
for (; i <= 41; i++) //????
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12043
|
int main()
{
int num[50]={0};
int n,k,i,j,flag=0;
cin>>n;
num[1]=2;
for(k=0;k<n-1;k++)
{
i=49;
while(num[i]==0)
i--;
for(j=1;j<=i+1;j++)
{
num[j]*=2;
if(num[j-1]>=10)
{
num[j-1]-=10;
num[j]+=1;
}
}
}
if(n==0)
cout<<1<<endl;
else
{i=49;
while(num[i]== 0)
i--; //???????0??
for (; i > 0; i--)
cout << num[i]; //??????
cout << endl;
}
return 0;
}
|
25
|
12044
|
int main()
{
int n;
cin >> n;
int num[50] = {0};
int num0[50] = {0};
int i, j;
int k = 1;
num[0] = 1;
for (i = 1; i <= n; i++)
{
for (j = 0; j < k; j++)
{
num[j] = num[j] * 2;
num0[j] = num[j] / 10;
num[j] = num[j] % 10;
}
for (j = 0; j < k; j++)
num[j + 1] += num0[j];
if (num[k] != 0)
k++;
}
for (i = k - 1; i >= 0; i--)
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12045
|
int a[31] = {0};
void double_()
{
int i;
for (i = 0; i < 31; i++)
a[i] = a[i] * 2;
for (i = 0; i < 31; i++)
{
a[i + 1] += a[i] / 10;
a[i] = a[i] % 10;
}
}
int main()
{
a[0] = 1;
int n, i, j;
cin >> n;
for (i = 1; i <= n; i++)
double_();
for (i = 31; i >= 0; i--)
if (a[i] != 0)
break;
for (j = i; j >= 0; j--)
cout << a[j];
cout << endl;
return 0;
}
|
25
|
12046
|
/*
* ????main.cpp
* ??????
* ?????2012-12-17
* ?????????????N(N<=100)???2?N?????
*/
int main ()
{
int N,i,j,k;//??????N??????N???????i,j,k
char a[50];//????a????????
memset(a,0,sizeof(a));//???
cin >> N;
if ( N >= 1 )//???
a[0] = '2';
else
a[0] = '1';
j = 0;
for ( i = 2; i <= N; i++ ) //?N >= 2??????????
{
k = 0;//??????????
for ( j = 0; a[j]; j++ )//?????????????a[0]????
{
a[j] = ((a[j] - '0') * 2) + k + '0';
k = 0;//???
if ( a[j] > '9' )//??????
{
a[j] -= 10;
k = 1;
}
}
if ( k == 1 )//??????
a[j] = '1';
}
if ( a[j] )//??a[j]?????
cout << a[j];
for ( j -= 1; j >= 0; j-- )//????????
cout << a[j];
cout << endl;
return 0;
}
|
25
|
12047
|
int main()
{
char a[101];
memset(a, 0 , sizeof(a));
int i, j, n, flag = 0;
cin >> n;
a[100] = 1;
for(i = 0 ; i < n ; i++)
{
j = 100;
do
{
a[j] = 2 * a[j];
j--;
}while(!(a[j] == 0 && a[j - 1] == 0 && a[j - 2] == 0 ));
j = 100;
do
{
if(a[j] >= 10)
{
a[j] = (int)a[j] % 10;
a[j - 1] += 1;
}
j--;
}while(!(a[j] == 0 && a[j - 1] == 0 && a[j - 2] == 0 ));
}
for(i = 0 ; i <= 100 ; i++)
{
if(a[i] == 0 && flag == 0)
{
continue;
}
else
{
flag = 1;
cout << (int)a[i];
}
}
return 0;
}
|
25
|
12048
|
int a[10001],len=1;
void cal()
{
int i;
a[len]*=2;
i=len-1;
if (a[len]>=10)
{
a[len]-=10;
a[++len]=1;
}
for (;i>=1;i--)
{
a[i]*=2;
if (a[i]>=10)
{
a[i]-=10;
a[i+1]+=1;
}
}
};
int main()
{
int n,j;
cin>>n;
for (j=1;j<=10000;j++)
a[j]=-1;
a[1]=1;
for (j=1;j<=n;j++)
cal();
for (j=len;j>=1;j--)
cout<<a[j];
cout<<endl;
return 0;
}
|
25
|
12049
|
int main()
{
int sz[200]={0},carry=0,i,k,n;
scanf("%d",&n);
if(n==0)
{
printf("1");
return 0;
}
sz[0]=2;
for(i=1;i<n;i++)
{
for(k=0;k<199;k++)
{
sz[k]=sz[k]*2+carry;
carry=0;
while(sz[k]>=10)
{
sz[k]-=10;
carry++;
}
}
}
for(i=199;i>=0;i--)
{
if(sz[i]!=0)
{
for(i=i;i>=0;i--)
{
printf("%d",sz[i]);
}
break;
}
}
return 0;
}
|
25
|
12050
|
int main()
{
char a[100];
int n, c, len, j, i, k;
cin >> n;
a[0] = '1';
a[1] = '\0';
for(i = 1; i <= n; i ++)
{
c = 0;
len = strlen(a);
for(j = 0; j <= len - 1; j ++)
{
if(a[j] - '0' < 5)
{
a[j] = (a[j] - '0') * 2 + '0' + c;
c = 0;
}
else
{
a[j] = (a[j] - '0') * 2 + '0' + c - 10;
c = 1;
}
}
a[j] = c + '0';
if(a[j] != '0')
a[j + 1] = '\0';
else
a[j] = '\0';
}
len = strlen(a);
for(k = len - 1; k >= 0; k--)
cout << a[k];
return 0;
}
|
25
|
12051
|
/*************************************************************************************************************
* @file .cpp
* @author ????
* @date
* @description
*
*/
int main()
{
int n, i, j, s;
int a[40] = {0};
cin >> n;
a[0] = 1;
for(i = 0; i < n; i++)
{
for(j = 0; j < 40; j++)
a[j] = 2 * a[j];
for(s = 39;a[s] == 0; s--);
for(j = 0; j <= s; j++)
{
a[j + 1] += a[j] / 10;
a[j] = a[j] % 10;
}
}
for(s = 39;a[s] == 0; s--);
for(i = s; i >=0; i--)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12052
|
int a[100];
int main()
{
a[0]=1;
int k=1,i,n;
scanf("%d",&n);
while(n--)
{
for(i=0;i<k;i++)
a[i]*=2;
for(i=0;i<k;i++)
if(a[i]>=10)
{
a[i+1]+=a[i]/10;
a[i]%=10;
if(i==k-1)
k++;
}
}
for(i=k-1;i>=0;i--)
printf("%d",a[i]);
return 0;
}
|
25
|
12053
|
// ??2?N??
int main()
{
int i, j, n, a[100]; // i,j?????n?2????
cin >> n;
memset(a, 0, sizeof(a)); // ????
a[0] = 1; // ???????1
for (i = 0; i < n; i++) // n??2
{
for (j = 0; j < i + 1; j++) // ???2
a[j] = a[j] * 2;
for (j = 0; j < i + 1; j++) // ??
{
a[j + 1] += a[j] / 10;
a[j] = a[j] % 10;
}
}
i = 99; // ????????
while (a[i] == 0) // ??????
i--;
for (j = i; j >= 0; j--) // ????
cout << a[j];
return 0;
}
|
25
|
12054
|
int main()
{
int a[201] = {0};
int i, j;
a[1] = a[0] = 1;
int n;
cin >> n;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= a[0]; j++)
a[j] = a[j] * 2;
for (j = 1; j <= a[0]; j++)
{
a[j + 1] += a[j] / 10;
a[j] = a[j] % 10;
}
if (a[a[0] + 1] > 0) a[0]++;
}
for (i = a[0]; i >= 1; i--)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12055
|
int r[100]={0};
int main()
{
int n;
cin>>n;
r[0]=2;
if (n==0)
cout<<'1';
else
if (n==1)
cout<<'2';
else
{
for (int i=2;i<=n;i++)
{
for (int i=0;i<100;i++)
{
r[i]=r[i]*2;
}
for (int i=0;i<100;i++)
{
r[i+1]+=r[i]/10;
r[i]=r[i]%10;
}
}
int start=0;
for (int i=0;i<100;i++)
{
if (r[100-i-1]!=0)
{
start=100-i-1;
break;
}
}
for (int i=start;i>=0;i--)
{
cout<<r[i];
}
}
return 0;
}
|
25
|
12056
|
int main()
{
int a[101]={0};
int b[101];
int n,i,j;
cin >>n;
a[0]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<i;j++)
{
if(j==0)
{
b[j]=(a[j]*2)/10;
a[j]=(a[j]*2)%10;
}
else
{
b[j]=(a[j]*2+b[j-1])/10;
a[j]=(a[j]*2+b[j-1])%10;
}
}
}
for(i=100;i>=0;i--)
{
if(a[i]!=0)
{
for(j=i;j>=0;j--)
{
cout <<a[j];
}
break;
}
}
return 0;
}
|
25
|
12057
|
int main()
{
int n,i;
cin>>n;
int ans[1000]={0};
if(n==0)cout<<"1";
else if(n==1)cout<<"2";
else{
ans[0]=2;
for(i=1;i<n;i++){
for(int j=0;j<1000;j++)
if(ans[j]==0 && ans[j+1]==0 && ans[j+2]==0){ //???0-(j-1)
for(int k=0;k<=j-1;k++){
if(ans[k]>9)
{ans[k+1]++;ans[k]=ans[k]%10;}
}
break;
}
else
{ans[j]=ans[j]+ans[j];}
}
int len;
for(int j=0;j<1000;j++)
if(ans[j]==0 && ans[j+1]==0 && ans[j+2]==0)
{len=j-1;break;}
for(i=len;i>=0;i--)
cout<<ans[i];
}
return 0;
}
|
25
|
12058
|
//********************************
//*???5.cpp **
//*?????2?N?? **
//*?????? 1300012838 **
//*???2013.11.18 **
//********************************
int main()
{
int a[10000], n, len = 1, up;
cin >> n;
a[1] = 1;
for (int i = 1; i <= n; i++)
{
up = 0;
for (int j = 1; j <= len; j++)
{
a[j] *= 2;
a[j] += up;
if (a[j] >= 10)
{
a[j] = a[j] - 10;
up = 1;
}
else
up = 0;
}
if (up == 1)
{
a[len + 1] = 1;
len++;
}
}
for (int i = len; i >= 1; i--)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12059
|
/*
*@ title:??2?N??
*@ date:2010-12-15
*@ author:1000012899 ???
*@ description: ?????
*/
int main()
{
int n, i, j;
unsigned s;
int sum[40] = {8, 4, 6, 3, 8, 4, 7, 4, 1, 2};
cin >> n;
if (n <= 31)
{
s = 1;
for (i = 1; i <= n; i++) s = s * 2;
cout << s;
}
else
{
for (i = 1; i <= n - 31; i++)
{
for (j = 0; j < 39; j++) sum[j] = sum[j] * 2;
for (j = 0; j <= 39; j++)
{
sum[j+1] = sum[j] / 10 + sum[j+1];
sum[j] = sum[j] % 10;
}
}
i = 39;
while(sum[i] == 0) { i--;}
for (j = i; j >= 0; j--) cout << sum[j];
}
return 0;
}
|
25
|
12060
|
/**
* @file 5.cpp
* @author ???
* @date 2013-11-15
* @description
* ?????????(11-12) ??2?N??
*/
int main()
{
int N, k, i, j = 0, a[100] = {1}, b[100]; // i, j, k?????????
cin >> N;
for (k = 1; k <= N; ++k)
for (i = 0; i <= j; ++i) // ??????
{
if (!i) b[0] = a[0];
b[i + 1] = a[i + 1];
a[i] += b[i];
if (a[i] >= 10)
{
a[i] -= 10;
++a[i + 1];
if (a[i + 1] == 1 && i == j)
{
++j;
break;
}
}
}
i = 99;
while (a[--i] == 0);
for (; i >= 0; --i)
cout << a[i];
return 0;
}
|
25
|
12061
|
int main()
{
int n,i;
double result=1;
scanf("%d",&n);
result=pow(2.0,1.0*n);
printf("%.0lf",result);
return 0;
}
|
25
|
12062
|
int main()
{
int n, sum[100000], i, j, l = 1, m;
memset(sum, 0, sizeof(sum));
sum[0] = 2;
cin >> n;
if(n == 0) cout << 1 << endl;
else
{
for(i = 1; i < n; i++)
{
for(j = 0; j < l; j++)
{
sum[j] = sum[j] * 2;
}
for(j = 0; j < l; j++)
{
if(sum[j] > 9)
{
sum[j] = sum[j] % 10;
sum[j + 1]++;
}
}
l++;
}
for(i = l; sum[i] == 0; i--)
{
m = i;
}
for(i = m - 1; i >= 0; i--)
{
cout << sum[i];
}
cout << endl;
}
return 0;
}
|
25
|
12063
|
int ss(char a[100])
{
int i=0,b[100],s=0,m,n;
while(a[i]!='a')
{
i++;
}
if(i==1)
{
b[0]=a[0]-48;
b[0]=2*b[0];
if(b[0]>9)
{
a[1]=b[0]%10+48;
a[0]=b[0]/10+48;
return 1;
}
else
{
a[0]=b[0]+48;
return 0;
}
}
else
{
b[0]=a[0]-48;
if(b[0]>=5)
{
for(m=(i-1);m>=0;m--)
{
if(m>0)
{
b[m]=a[m]-48;
b[m]=b[m]+b[m];
}
else
{
b[0]=b[0]*2;
}
if(b[m]>9)
{
a[m+1]=b[m]%10+48+s;
s=1;
}
else
{
a[m+1]=b[m]+48+s;
s=0;
}
a[0]=49;
}
return 1;
}
else
{
s=0;
for(m=(i-1);m>=0;m--)
{
b[m]=a[m]-48;
b[m]=b[m]*2;
if(b[m]>9)
{
a[m]=b[m]%10+48+s;
s=1;
}
else
{
a[m]=b[m]+48+s;
s=0;
}
}
return 0;
}
}
}
int main()
{
int N,i=0,o,n=1;
cin>>N;
char a[100];
for(o=0;o<100;o++)
{
a[o]='a';
}
if(N==0)
cout<<"1";
else
{
a[0]=49;
while(i<N)
{
n=n+ss(a);
i++;
}
for(o=0;o<n;o++)
{
cout<<a[o];
}
}
return 0;
}
|
25
|
12064
|
int main()
{
int x[50];
int m;
cin>>m;
int n=40;
int i;
x[0]=1;
for(i=1;i<n;i++)
{
x[i]=0;
}//????
for(int r=0;r<m;r++)
{
for(i=0;i<n;i++)
{
x[i]*=2;
}
/*==================================*/
for(i=0;i<n;i++)
{
if(x[i]>=10)
{
x[i+1]+=x[i]/10;
x[i]=x[i]%10;
}//??
}
}
int max;//????????
for(max=n-1;max>0;max--)
{
if(x[max]!=0)
break;
}
for (i=max;i>=0;i--)
{
cout<<x[i];
}
return 0;
}
|
25
|
12065
|
void func(char* a)
{
int lena=strlen(a),i,flag=0;
for(i=0;i<lena;i++)
{
if(flag==0)
a[i]=a[i]+a[i]-'0';
else
a[i]=a[i]+a[i]+1-'0';
if(a[i]>'9')
{
a[i]-=10; flag=1;
}
else flag=0;
}
if(flag==1)
{
a[i]='1';
a[i+1]='\0';
}
}
int main()
{
char a[N];
int n,i,len;
a[0]='1';
a[1]='\0';
scanf("%d",&n);
for(i=0;i<n;i++)
func(a);
len=strlen(a);
for(i=len-1;i>=0;i--)
printf("%c",a[i]);
}
|
25
|
12066
|
int main()
{
int a[200] = {0}, i, flag = 0;
a[199] = 1;
int n;
cin >> n;
while (n != 0)
{
flag = 0;
for (i = 199; i >= 0; i--)
{
if (a[i] * 2 >= 10)
{
a[i] = a[i] * 2 - 10 + flag;
flag = 1;
}
else
{
a[i] = a[i] * 2 + flag;
flag = 0;
}
}
n--;
}
for (i = 0; a[i] == 0; i++)
{}
for (;i <= 199; i++)
{
cout << a[i];
}
return 0;
}
|
25
|
12067
|
//
// ????? ??2?N??
// ????? ??2?N????
// ????? ? ? ? ? ?? 1000012733 ?
// ????? 2010 ? 12 ? 18 ?
//
int main()
{
int n, i, j, k, len, temp, l; /*??????????????n??2?????????2??????i?j?k?l????????len??
?????result????temp??????????????2?????????????????*/
char result[1000]; //???????result????2???????
int t[1000]; //??????t?????????2?????????????????
memset ( result, 0, 1000 );
memset ( t, 0, sizeof ( t )); //?????result?t??????
cin >> n; //?????????2????
result[0] = '2'; //????result?????2
for ( i = 1; i < n; i++ ) //??2?n?????? n - 1 ? ?????? n = 0 ? n = 1 ??????? ?
{
len = strlen ( result ); //???????result???
k = 0; //k???0
memset ( t, 0, sizeof ( t )); //?t????????
for ( j = len - 1; j >=0; j-- ) //?????result??????????????
{
temp = result[j] - '0'; //??temp????????result?????????
t[k] += temp * 2; //??????????temp??2
if ( t[k] >= 10 )
{
t[k + 1] += 1;
t[k] = t[k] - 10;
} //????????????????10???????
k++; //?????k??????1
}
if ( t[k] == 0 ) //???????????????????k??1?????????????
k = k - 1;
memset ( result, 0, 1000 ); //??result???????result??????
for ( l = 0; l <= k; l++ )
{
result[k - l] = '0' + t[l]; //??????????????result???
}
}
if ( n == 1 )
cout << 2 << endl; //??????2?1???????2
else if ( n == 0)
cout << 1 << endl; //??????2?0???????1
else
cout << result << endl; //???????2??????1????????result
return 0;
}
|
25
|
12068
|
int i,k,num[50]={0},temp[50]={0};
int mul()
{
int m;
for(m=0;m<50;m++)
{
temp[m]=temp[m]+num[m]*2;
if(temp[m]>=10)
{
temp[m+1]++;
temp[m]=temp[m]%10;
}
}
for(m=0;m<50;m++)
num[m]=temp[m];
for(m=0;m<50;m++)
temp[m]=0;
return 0;
}
int main()
{
cin>>k;
num[0]=2;
if(k!=0)
{for(i=0;i<k-1;i++)
mul();
for(i=1;num[50-i]==0;i++);
for(;i<=50;i++)
cout<<num[50-i];}
else
cout<<1;
return 0;
}
|
25
|
12069
|
// 2011???.cpp : ??????????????
int num[100000];
void plu()
{
int sub[100000];
for(int i=0;i<110;i++) sub[i]=0;
int k=0;
while(num[k]!=-1)
{
sub[k]=num[k]*2%10+sub[k];
sub[k+1]=num[k]*2/10;
k++;
}
int j=60;
while(sub[j]==0)
{
j--;
}
for(int m=j;m>-1;m--)
num[m]=sub[m];
}
int main()
{
int n;
cin>>n;
if(n==1) {cout<<2;return 0;}
if(n==0) {cout<<1;return 0;}
for(int i=0;i<n;i++)
num[i]=-1;
num[0]=1;
for(int j=0;j<n;j++)
plu();
int k=0;
while(num[k]!=-1)
k++;
for(int l=k-1;l>-1;l--)
cout<<num[l];
return 0;
}
|
25
|
12070
|
int c[100];
int f(int a[],int b[])
{
int i,d[100];
for(i=0;i<100;i++)
{d[i]=0;}
for(i=0;i<100;i++)
{
if(a[i]+b[i]+d[i]>=10)
{
c[i]=(a[i]+b[i]+d[i])%10;
d[i+1]=1;
}
else
c[i]=a[i]+b[i]+d[i];
}
return 0;
}
int main()
{
int a[100],m,i,j;
for(i=0;i<100;i++)
{a[i]=0;}
a[1]=2;
cin>>m;
if(m==0)
cout<<"1"<<endl;
else
{
for(i=1;i<m;i++)
{
f(a,a);
for(j=0;j<100;j++)
{a[j]=c[j];}
}
for(i=99;i>=0;i--)
{if(a[i]!=0) break;}
for(j=i;j>0;j--)
{cout<<a[j];}
}
return 0;
}
|
25
|
12071
|
/**
* @file 5.cpp
* @author ???
* @date 2013-11-15
* @description
* ?????????(11-12) ??2?N??
*/
int main()
{
int N, k, i, j = 0, a[100] = {1}; // i, j, k?????????
cin >> N;
for (k = 1; k <= N; ++k)
{
for (i = 0; i <= j; ++i)
a[i] += a[i];
for (i = 0; i <= j; ++i)
{
if (a[i] >= 10)
{
a[i] -= 10;
++a[i + 1];
if (a[i + 1] == 1 && i == j)
{
++j;
break;
}
}
}
}
i = 99; // ??
while (a[--i] == 0);
for (; i >= 0; --i)
cout << a[i];
return 0;
}
|
25
|
12072
|
int main()
{
int a[35]={1};
int i,j,n,t;
cin>>n;
for (i=0; i<n; i++)
{
t=0; //??
for (j=0; j<35; j++) //?????
{
a[j]=a[j]+a[j]+t;
t=a[j] / 10;
a[j]=a[j] % 10;
}
}
for (i=34; a[i]==0; i--);
for (; i>=0; i--) cout<<a[i];
cout<<endl;
return 0;
}
|
25
|
12073
|
int a[102]={0},ans[102]={0};
int j;
void mult(int a[])
{
for(j=0;j<101;j++)
{
a[j]=a[j]*2;}
for(j=0;j<101;j++){
a[j+1]=a[j+1]+a[j]/10;
a[j]=a[j]%10;}
}
int main()
{
int n,i;
cin>>n;
a[0]=1;
for(i=0;i<n;i++)
{
mult(a);
}
int k=100;
while(a[k]==0) k--;
for(i=k;i>=0;i--) cout<<a[i];
return 0;
}
|
25
|
12074
|
int main()
{
int n, i, j, k;
int sum[31] = {0};
sum[0] = 1;
cin >> n;
for(i = 1; i <= n; i ++)
{
for(j = 30; j >= 0; j --)
{
if(sum[j] != 0)
break;
}
for(k = 0; k <= j; k ++)
{
sum[k] = sum[k] * 2;
}
for(k = 0; k <= j; k ++)
{
if(sum[k] > 9)
{
sum[k] = sum[k] - 10;
sum[k + 1] ++;
}
}
}
for(i = 30; i >= 0; i --)
{
if(sum[i] != 0)
break;
}
for(j = i; j >= 0; j --)
cout << sum[j];
cout << endl;
return 0;
}
|
25
|
12075
|
/*??????????N(N<=100)???2?N?????
????
??????????N?
????
??2?N?????
????
5
????
32
??
?????
*/
int main()
{
int n,m,a[100]={0},l=1,i,j;
a[1]=1;
cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=l;j++)
a[j]=2*a[j];
for(j=1;j<l;j++)
{
if(a[j]>=10)
{
a[j+1]=a[j+1]+1;
a[j]=a[j]-10;
}
}
if(a[l]>=10)
{
a[l]=a[l]-10;
a[l+1]=1;
l++;
}
}
for(i=l;i>=1;i--) cout<<a[i];
return 0;
}
|
25
|
12076
|
int main()
{
int num[105] , N , j , i ;
cin >> N ;
//memset( num, 0 , 105) ;
num[0] = 1 ;
for ( i = 1; i <= 104 ; i++)
num[i] = 0;
for ( i = 1; i <= N ; i++)
{
for ( j = 0 ; j <= 104 ; j++)
num[j] = num[j] * 2;
for ( j = 0 ; j <= 104 ; j++)
{
if ( num[j] >= 10 )
{
num[j + 1] += num[j] / 10 ;
num[j] = num[j] % 10 ;
}
}
}
i = 104 ;
while ( num[i] == 0)
i-- ;
for ( ; i >= 0; i--)
cout << num[i] ;
return 0 ;
}
|
25
|
12077
|
int main()
{
int a[100]={2},b[100]={0},n,m=0,j,count=1;
cin>>n;
if(n==0)
{
cout<<"1"<<endl;
}
else if(n==1)
{
cout<<"2"<<endl;
}
else
{
for(int i=1;i<n;i++)
{
m=0;
for(j=0;j<count;j++)
{
b[j]=a[j]*2;
if(m==1)
{
b[j]++;
}
if(b[j]>=10)
{
b[j]=b[j]-10;
m=1;
}
else
{
m=0;
}
}
if(m==1)
{
a[j]=1;count++;
}
for(int i=0;i<j;i++)
{
a[i]=b[i];
}
}
if(a[j]!=0)
{
for(int i=j;i>=0;i--)
{
cout<<a[i];
}
}
else
{
for(int i=j-1;i>=0;i--)
{
cout<<a[i];
}
}
}
return 0;
}
|
25
|
12078
|
int main()
{
int n,i;
int a[1000];
memset(a,0,sizeof(a));
a[0]=1;
cin >> n;
for(i=0;i<n;i++)
{
int j;
for(j=0;j<n;j++)
a[j]=a[j]*2;
for(j=0;j<n;j++)
if(a[j]>9)
{
a[j]=a[j]%10;
a[j+1]++;
}
}
for(i=n;i>=0;i--)
if(a[i]!=0)
break;
int s;
for(s=i;s>=0;s--)
cout << a[s];
cout << endl;
return 0;
}
|
25
|
12079
|
char a[2000];
int result[2000];
int temp[2000];
void calculate()
{
memset(result,0,sizeof(result));
int i = 0, j = 0;
for(i = 0; i <= 1900; i++)
{
result[i] = temp[i] * 2 + result[i];
if(result[i] >= 10)
{
result[i+1] = result[i] / 10 + result[i+1];
result[i] = result[i] % 10;
}
}
for(i = 0; i <= 1900; i++)
{
temp[i] = result[i];
}
}
int main()
{
memset(result,0,sizeof(result));
memset(temp,0,sizeof(temp));
temp[0] = 1;
int n = 0, i = 0, j = 0;
cin >> n;
if(n == 0)
cout << 1 << endl;
else
{
for(i = 1; i <= n; i++)
{
calculate();
}
for(i = 1900; i >= 0; i--)
{
if(result[i] != 0)
break;
}
for(j = i; j >= 0; j--)
{
cout << result[j];
}
cout << endl;
}
return 0;
}
|
25
|
12080
|
int main()
{
int ans[100]={0},flag=0;
ans[0]=1;
int n,i,j;
cin>>n;
for(j=1;j<=n;j++)
for(i=0;i<100;i++)
{
ans[i]=ans[i]*2+flag;
if(ans[i]>=10)
{
flag=1;
ans[i]=ans[i]%10;
}
else
flag=0;
}
for(i=99;i>=0;i--)
if(ans[i]!=0)
break;
for(j=i;j>=0;j--)
cout<<ans[j];
cout<<endl;
return 0;
}
|
25
|
12081
|
int main()
{
int a[1000] = {0}, n, i, j,flag = 0;
cin >> n;
a[0] = 1;
if (n == 0)
{ cout <<"1";
exit(0);
}
for (i = 1; i <= n; i++)
{
for (j = 0; j < 100;j++)
{
a[j] = a[j] * 2;
}
for (j = 0; j < 100; j++)
{
if(a[j] > 9)
{
a[j + 1] += a[j] / 10;
a[j] = a[j]%10;
}
}
}
for (i = 99; i >=0; i--)
{
if (flag == 0)
{
if (a[i] != 0)
{
flag = 1;
cout << a[i];
}
}
else
cout << a[i];
}
return 0;
}
|
25
|
12082
|
/*
* 2Npower.cpp
* ?????2?N??
* Created on: 2013-1-11
* Author: ???
*/
void operate(int N);
int main()
{
int N; //?????
cin>>N; //?????
operate(N); //????operate
return 0;
}
void operate(int N)
{
int i,j;
int num=0;
int result[51]; //????
memset(result,0,sizeof(result));//???
if(N==0){
cout<<'1';
return ;}
result[50]=2; //????
for(i=2;i<=N;i++)
{
for(j=50;j>=0;j--)
{
result[j]=result[j]*2+num;
if(result[j]>=10){
result[j]=result[j]-10;
num=1;
}
else
num=0;
}
}
for(i=0;i<=50;i++) //?????
if(result[i]!=0)
break;
for(j=i;j<=50;j++) //??
cout<<result[j];
return ;
}
|
25
|
12083
|
int main()
{
int a[45] = {0};
int n;
cin >> n;
a[0] = 1;
for(int i = 0; i < n; i ++)
{
int bit = 0;
int p;
for(int j = 0; j <= 40; j ++)
{
p = a[j] * 2 + bit;
a[j] = p % 10;
bit = p / 10;
}
}
int start;
for(int i = 40; i >= 0; i --)
if(a[i] != 0)
{
start = i;
break;
}
for(int i = start; i >= 0; i --)
cout << a[i];
return 0;
}
|
25
|
12084
|
/**
* ????1000012815_2.cpp
* ?????2?N??
* ??????
* ???2010.12.15
*/
int main()
{
int n;
cin >> n; //??2?N??????
//number???????????flag???????????????
int number[101], flag[101] = {0};
memset(number, -1, sizeof(number)); //?number?????-1
number[100] = 1; //?????????1
int i, j;
for (j = 1; j <= n; j++) //?????
{
for (i = 100; number[i] != -1; i--) //????????2
if (number[i] * 2 > 9) //????????
{
number[i] = number[i] * 2 - 10;
flag[i - 1] = 1; //??????????????1
}
else
number[i] *= 2;
for (i = 99; number[i + 1] != -1; i--) //?????????
if (flag[i] == 1)
if (number[i] != -1) //??????????????1
number[i]++;
else
number[i] = 1; //?????????1
memset(flag, 0, sizeof(flag)); //???????
}
int noZero = 0;
while (number[noZero] == -1) //????????
noZero++;
for (j = noZero; j <= 100; j++) //???????
cout << number[j];
cout << endl;
return 0;
}
|
25
|
12085
|
//*********************************
//* ??? 2?N?? *
//* ??? ?? *
//* ??? 2013.11.15 *
//*********************************
int main()
{
int N;
int a[50] = {0}, len = 1;
a[0] = 1;
cin >> N;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < len; j++)
{
a[j] *= 2;
}
for (int m = 0; m < len; m++)
{
if (a[m] > 9)
{
a[m] -= 10;
a[m+1] += 1;
if (m == len - 1) len++;
}
}
}
for (int k = len - 1; k >= 0; k--) cout << a[k];
return 0;
}
|
25
|
12086
|
int main(){
int ai[100];
int i,j,n;
scanf("%d",&n);
ai[99]=1;
for(i=0;i<99;i++){
ai[i]=0;
}
for(j=0;j<n;j++){
for(i=0;i<100;i++){
ai[i]*=2;
if(ai[i]>9){
ai[i]=ai[i]-10;
ai[i-1]+=1;
}
}
}
for(i=0;i<100;i++){
if(ai[i]!=0){
for(j=i;j<100;j++){
printf("%d",ai[j]);
}
break;
}
}
return 0;
}
|
25
|
12087
|
int main()
{
int n,i,j,sz[100];
scanf("%d",&n);
for(i=0;i<99;i++){
sz[i]=0;
}
sz[99]=1;
for(j=1;j<=n;j++){
for(i=0;i<100;i++){
sz[i]=sz[i]*2;
}
for(i=0;i<100;i++){
if(sz[i]>=10){
sz[i]=sz[i]-10;
sz[i-1]=sz[i-1]+1;
}
}
}
for(i=0;i<100;i++){
if(sz[i]!=0){
for(j=i;j<100;j++){
printf("%d",sz[j]);
}
break;
}
}
return 0;
}
|
25
|
12088
|
int main()
{
int i,j,k,n,e=0,a[50]={0};
scanf("%d",&n);
a[0]=1;
for(i=1;i<=n;i++){
for(j=0;j<50;j++){
a[j]*=2;}
for(k=0;k<50;k++){
if(a[k]>9){
a[k]=a[k]%10;
a[k+1]+=1;
}
}
}
for(i=49;i>=0;i--){if(e==1){
printf("%d",a[i]);
}
if(a[i]!=0){
if(e==0){
printf("%d",a[i]);
e=1;
}
}
}
return 0;
}
|
25
|
12089
|
int main ()
{
int b[10000]={2};
int c=0,d=0,n=0;
cin>>n;
if(n==0)
{
cout<<"1";
}
else
{
for (int i=1;i<n;i++)
{
for(int j=1;j<=10000;j++)
{
b[j-1]=b[j-1]+b[j-1]+c;
if(b[j-1]>9)
{
c=1;
b[j-1]=b[j-1]-10;
}
else
{
c=0;
}
}
}
for(int i=10000;i>0;i--)
{
if(b[i-1]!=0)
{
d=i;
break;
}
}
for(int i=d;i>0;i--)
{
cout<<b[i-1];
}
}
return 0;
}
|
25
|
12090
|
int main()
{
char num[101][200];
int temp[200];
int n,i,j=1,k,t;
for ( i=0;i<200;i++ )
{
temp[i]=0;
}
cin>>n;
num[0][0]='1';
num[0][1]='\0';
for ( i=1;i<n+1;i++ )
{
for ( t=0;t<200;t++ )
{
temp[t]=0;
}
for (j=0;num[i-1][j]!='\0';j++ )
{
temp[j]=(num[i-1][j]-'0')*2;
}
for ( k=0;num[i-1][k]!='\0';k++ )
{
if ( temp[k]>=10 )
{
temp[k+1]+=temp[k]/10;
temp[k]=temp[k]%10;
}
}
num[i][0]=temp[0]+'0';
for ( j=1;( num[i-1][j]!='\0') && j<200 ;j++ )
{
num[i][j]=temp[j]+'0';
}
if ( temp[j] != 0 )
{
num[i][j]=temp[j]+'0';
j++;
}
num[i][j]='\0';
}
for ( j=j-1;j>=0;j-- )
{
cout<<num[n][j];
}
cout<<endl;
return 0;
}
|
25
|
12091
|
int main()
{
int n,i,j,point,p;
char str1[50],str2[50];
cin>>n;
if(n==0)
cout<<'1'<<endl;
else
{
for(i=0;i<50;i++)
{
str1[i]='0';
str2[i]='0';
}
str1[0]='1';
//???
for(i=1;i<=n;i++)
{
for(p=49;p>=0;p--)
if(str1[p]!='0'||str2[p]!='0')
{
point=p+1;
break;
}//?????
for(j=0;j<=point;j++)
{
str2[j+1]=((str1[j]-'0')*2+(str2[j]-'0'))/10+'0';//???????
str1[j]=((str1[j]-'0')*2+(str2[j]-'0'))%10+'0';
}
}
for(j=49;j>=0;j--)
{
if(str1[j]!='0')
{
point=j;
break;
}
}
for(j=point;j>=0;j--)
cout<<str1[j];
cout<<endl;
}
return 0;
}
|
25
|
12092
|
int main()
{
int n,i,j,jinwei,a[50]={0};
cin>>n;
a[0]=1;
for(i=1;i<=n;i++)
{
jinwei=0;
for(j=0;j<49;j++)
{
a[j]=a[j]*2+jinwei;
if(a[j]>=10)
{
a[j]=a[j]-10;
jinwei=1;
}
else
jinwei=0;
}
}
i=49;
while(a[i]==0)
i--;
for(;i>=0;i--)
cout<<a[i];
return 0;
}
|
25
|
12093
|
char result[30] = {0};
void mul();
int main()
{
int n;
result[0] = '1';
cin >> n;
int i;
if(n == 0) cout << result << endl;
else
{
for(i = 1; i <= n; i++)
mul();
for(i = strlen(result) - 1; i >= 0; i--)
cout << result[i] ;
}
return 0;
}
void mul()
{
int k;
int div = 0;
k = strlen(result);
for(int i = 0; i < k; i++)
{
int t;
t = result[i] - '0';
t = t * 2;
result[i] = t % 10 + div + '0';
div = t / 10;
if(i == k - 1 && div != 0)
result[i + 1] = div + '0';
}
}
|
25
|
12094
|
int main(){
int i,j,n;
int b[15]={0};
int t=100000000;
cin>>n;
if(n==0) cout<<1;
else{
b[0]=2;
for(i=1;i<n;i++)
{
for(j=0;j<15;j++){
b[j]*=2;
}
for(j=0;j<14;j++)
if(b[j]>=t) {b[j+1]++; b[j]-=t;}
}
for(i=14;b[i]==0;i--);
for(j=i;j>=0;j--) {
if(i!=j&&b[j]<t/10) cout<<'0';
cout<<b[j];
}
}
return 0;
}
|
25
|
12095
|
int main()
{
int n, i, j, k = 0;
int a[100];
cin >> n;
memset(a, 0, sizeof(a));
a[0] = 1;
if (n == 0)
cout << "1" << endl;
else
{for (i = 1; i <= n; i++)
{
for (j = 0; j< 100; j++)
{
a[j] = 2* a[j];
}
for (j = 0;j< 100; j++)
{
if (a[j] > 9)
{a[j] = a[j] - 10;
a[j+1]++;}
}
}
for (i = 99; i >= 0;i--)
{
if (a[i] ==0)
k++;
else
break;
}
for (i = 99 - k; i>=0; i--)
{
cout << a[i];
}
cout << endl;}
return 0;
}
|
25
|
12096
|
int main()
{
int num[10000] = {0};
int n = 0;
cin >> n;
num[0] = 1; num[1] = 1;
for (; n > 0; n--)
{
for (int i = 1; i <= num[0]; i++) num[i] *= 2;
for (int i = 1; i <= num[0]; i++)
{
num[i+1] += num[i] / 10;
num[i] = num[i] % 10;
}
if (num[num[0]+1] > 0) num[0] ++;
}
for (int i = num[0]; i > 0; i--) cout << num[i];
return 0;
}
|
25
|
12097
|
//***********************************************************************
//*???8-5.cpp
//*?????2?N??
//*??????
//*???2013?11?19?
//***********************************************************************
int main()
{
int i, j, N, index = 0, temp, jinwei; //index????????????temp??????
int result[100];
cin >> N;
if(N == 0) //N?0??
cout << "1" << endl;
else
{
result[0] = 2; //??????2
for(i = 1; i < N ; i++)
{
jinwei = 0; //??????????????0
for(j = 0; j <= index; j++) //?????????????
{
temp = 1; //?????? ???????
if(j == 0)
{
temp = result[j] * 2;
if(temp >= 10) //?????????????????
jinwei = 1;
}
else
{
temp = result[j] * 2;
if(jinwei == 1)
temp ++; //?????????????1
if(temp >= 10)
jinwei = 1;
else
jinwei = 0;
}
result[j] = temp % 10; //????????10???
}
if(jinwei == 1) // ?????????????????????
{
index ++;
result[index] = 1; //?????????1
} }
for(i = index; i >= 0; i--) //??????????
cout << result[i];
}
return 0;
}
|
25
|
12098
|
int main()
{
int n,p;
cin >> n;
if (n>0)
{
p=ceil(log10(2)*n);
char a[p];
for (int i=0;i<p;i++)
{
a[i]='0';
}
a[p-1]='1';
for (int i=1;i<=n;i++)
{
for (int j=0;j<p;j++)
{
if (a[j]<'5')
a[j]=(a[j]-'0')*2+'0';
else if (a[j]>='5')
{
a[j]=(a[j]-'0')*2-10+'0';
a[j-1]++;
}
}
}
for (int i=0;i<p;i++)
{
cout << a[i];
}
cout << endl;
}
if (n==0)
cout << 1 << endl;
return 0;
}
|
25
|
12099
|
int main(){
int n,i,p;
int an1[500]={0},an2[500]={0},sum[500]={0};
an1[0]=1;
an2[0]=1;
scanf("%d",&n);
if(n==0){
printf("1");
}
else{
for(p=0;p<n;p++){
int carry = 0; //???
for (i = 0; i < 500; i++){
sum[i] = an1[i] + an2[i] + carry;
if(sum[i] >= 10){
sum[i] -= 10;
carry = 1;
} else {
carry = 0;
}
}
for(i=0;i<500;i++){
an1[i]=an2[i]=sum[i];
}
}
i = 500-1;
while(sum[i]==0) { //???????0??
i--;
}
for(;i>=0;i--){ //??????0?
printf("%d", sum[i]); //??????
}
printf("\n");
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.