id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
12,400 |
int main()
{
char num[110]; //??????????
int N,i,j,s=1,temp,n=1,add[110];
memset(num,'\0',sizeof(num));
num[0]='1';
cin>>N;
for (i=0;i<N;i++) //??N?2??
{
memset(add,0,sizeof(add));
for (j=0;j<n;j++) //???????2
{
temp=(num[j]-'0')*2;
num[j]=temp%10+'0';
if (temp>=10)
{
add[j+1]=1;
if (num[j+1]=='\0')
{
s++;
num[j+1]='1';
}
}
}
for (j=0;j<n;j++) //??
num[j]+=add[j];
n=s;
}
for (i=s-1;i>=0;i--) //??
{
temp=num[i]-'0';
cout<<temp;
}
return 0;
}
|
25
|
12,401 |
int main()
{
int m,n,i,j,k,jin;
int a[35],b[35];//n????????
cin>>m;
for(i=1;i<35;i++)a[i]=0;
a[0]=2;
for(i=1;i<m;i++)
{
jin=0;
for(j=0;j<35;j++)
{
b[j]=(2*a[j]+jin)%10;
jin=(2*a[j]+jin)/10;
}
for(j=0;j<35;j++)
{a[j]=b[j];}
}
for(i=34;i>=0;i--)
{
if(a[i]!=0)break;
}
if(m==0)cout<<1;
else if(i==-1)cout<<a[0];
else
{
for(j=i;j>=0;j--)cout<<a[j];
}
return 0;
}
|
25
|
12,402 |
int main()
{
int N,i,j,t;
int a[100]={0};
cin>>N;
a[0]=1;
t=0;
for(i=0;i<N;i++)
{
for(j=0;j<100;j++)
{
a[j]=a[j]*2;
a[j]=a[j]+t;
t=0;
if(a[j]>9)
{
a[j]=a[j]-10;
t=1;
}
}
}
for(i=99;i>=0;i--)
{
if(a[i]>0)
{
t=i;
break;
}
}
for(i=t;i>=0;i--)
{
cout<<a[i];
}
return 0;
}
|
25
|
12,403 |
int main()
{
int n,i,temp = 0,t;
int c[100] = {0};
cin >> n;
c[0] = 2;
c[1] = -1;
for(i = 1;i <= n - 1;i++)
{
int j = 0;
temp = 0;
while(c[j] != -1)
{
t = c[j] * 2 + temp;
c[j] = t % 10;
temp = t / 10;
j++;
}
if(temp != 0)
c[j++] = temp;
c[j] = -1;
}
i = 0;
while(c[i] != -1)
i++;
if(n != 0)
{
for(int j = i - 1;j >= 0;j--)
cout << c[j];
}else
cout << 1;
return 0;
}
|
25
|
12,404 |
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
|
12,405 |
//********************************************
//* 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
|
12,406 |
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
|
12,407 |
char c1[101]={'\0'};//??????
char c2[101]={'\0'};//??????
char c3[101]={'\0'};//??
int main()
{
void cal(int);
int n,i;
cin>>n;
c1[0]='1';//???????1
cal(n);
char c[100]={'\0'};
for(i=0;i<strlen(c1);i++)
c[i]=c1[strlen(c1)-i-1];//?????
cout<<c;
return 0;
}
void cal(int n)
{
int i;
if(n!=0)
{
for(i=0;c1[i]!='\0';i++)
{
if((c1[i]-'0')*2>=10)
{
c2[i]=(c1[i]-'0')*2-10+'0';
c3[i+1]='1'; //???1
}
else
{
c2[i]=(c1[i]-'0')*2+'0';
c3[i+1]='0';
}
}
for(i=1;c3[i]!='\0';i++)
{
if(c2[i]!='\0')
c2[i]=c2[i]+c3[i]-'0';
else if(c3[i]=='1') c2[i]=c3[i]; //???????????????
}
strcpy(c1,c2);
cal(n-1);
}
}
|
25
|
12,408 |
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
|
12,409 |
int main(void)
{
int num[1000]; // ????
int n; // ??2?n??
memset(num, 0, sizeof(num));
num[0] = 1;
cin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 1000; j++)
{
num[j] *= 2; // ????2
}
for(int j = 0; j < 1000; j++) // ??
{
if(num[j] >= 10)
{
num[j] -= 10;
num[j + 1]++; // ?????
}
}
}
int x;
for(x = 999; num[x] == 0; x--); // ??????
for(; x >= 0; x--) // ????
{
cout << num[x];
}
cout << endl;
return 0;
}
|
25
|
12,410 |
int ans[50]={0,1};
void calc()
{
int i,t=0;
for(i=1;i<=40;i++)
{
ans[i]=ans[i]*2+t;
t=ans[i]/10;
ans[i]%=10;
}
}
int main()
{
int m,i,j;
cin>>m;
for(i=1;i<=m;i++)
calc();
j=0;
for(i=40;i>=1;i--)
{
if(ans[i]!=0)j=1;
if(j==1)cout<<ans[i];
}
return 0;
}
|
25
|
12,411 |
int main(void)
{
int i,k,n,sum;
while(scanf("%d",&n)!=EOF)
{
sum=1;
int a[10000];
for(i=1;i<10000;i++)
a[i]=0;a[0]=1;
for(k=1;k<=n;k++)
{
for(i=0;i<sum;i++)
a[i]=a[i]*2;
for(i=0;i<sum;i++)
if(a[i]>=10)
{
a[i+1]=a[i+1]+a[i]/10;
if(i+1==sum)sum++;
a[i]=a[i]%10;
}
}
for(i=sum-1;i>=0;i--)
printf("%d",a[i]);printf("\n");
}
return 0;
}
|
25
|
12,412 |
int result[100000] = {2};
int main()
{
int N;
cin >> N;
if (N == 0)
{
cout << 1 << endl;
}
else
{
for (int i = 0; i < N - 1; i++)
{
for (int j = 0; j < 100000; j++)
{
result[j] *= 2;
}
for (int k = 0; k < 100000; k++)
{
if (result[k] >= 10)
{
result[k+1] += result[k]/10;
result[k] %= 10;
}
}
}
int n = 99999;
while (result[n] == 0)
{
n--;
}
for (int l = n; l >= 0; l--)
{
cout << result[l];
}
}
return 0;
}
|
25
|
12,413 |
//**************************
//*?????2?N?? **
//*?????? **
//*???20131114 **
//**************************
int main ()
{
int n ,i ,j ,k ,nLen ,h ,lg ,q ,flag;
int a[9999] ,b[9999];
memset(a,0,sizeof(a));
cin >> n;
if(n == 0)
cout << "1" << endl;
if(n == 1)
cout << "2" << endl;//??????
if(n != 0 && n != 1)
{
memset(b,0,sizeof(b));//????
a[0] = 2;
lg = 1;
for(i = 1; i <= n-1; i++)
{
for(j = 0; j <= lg-1; j++)
b[j] = 2 * a[j];//?????2
for(q = 0; q <= n-1; q++)
{
if(q == lg-1)
{
if(b[q] > 9)
lg++;
}
if(b[q] > 9)
{
b[q] -= 10;
b[q+1] += 1;//????10???
}
}
for(k = 0; k <= lg-1; k++)
a[k] = b[k];//??
}
for(h = lg-1; h >= 0; h--)
cout << a[h];
cout << endl;
}
return 0;
}
|
25
|
12,414 |
int main ()
{
int n, i, j,flag = 0;
int num[32] = {0};
cin >> n;
num[0] = 2;
for(i = 1; i <= n - 1; i++)
{
for(j = 0; j < 32; j++)
{
num[j] *= 2;
}
for(j = 0; j < 32; j++)
{
if(num[j] >= 10)
{
num[j] -= 10;
num[j+1]++;
}
}
}
if(n != 0)
{
for(j = 31; j >= 0; j--)
{
if(num[j] == 0 && flag == 0)
continue;
else
flag = 1;
if(flag == 1)
cout << num[j];
}
}
else
cout << "1";
cout << endl;
return 0;
}
|
25
|
12,415 |
int main()
{
int N, i = 1; //N????N??, i?????
int result[40]= {0}; //result????,2?100??????40??
cin >> N;
result[0] = 1; //2?0???1
while ( i <= N )
{
for ( int j = 0; j < 39; j++ )
{
result[j] *= 2; //?????2
}
for ( int k = 0; k < 39; k++ )
{
if ( result[k] >= 10 )
{
result[k+1] += result[k] / 10; //??
result[k] %= 10; //?????????
}
}
i++;
}
i = 39; //??????????????????result
while ( result[i] == 0 )
{
i--; //???????
}
for ( int k = i; k >= 0; k-- )
cout << result[k]; //????result
return 0;
}
|
25
|
12,416 |
int a[1000]={0};
long sum=1;
void mi(int);
int main()
{
int n,i,j=1;
a[0]=4;a[1]=2;a[2]=0;a[3]=1;
cin>>n;
if(n==0)cout<<1<<endl;
else if(n<=10)
{
for(i=0;i<n;i++)
j*=2;
cout<<j<<endl;
}
else mi(n-10);
return 0;
}
void mi(int n)
{
int i,j,len=0;
if(n==0)
{
for(i=999;i>=0;i--)
{
if(a[i]!=0)
break;
}
for(j=i;j>=0;j--)
cout<<a[j];
}
else
{
for(len=999;len>=0;len--)
if(a[len]!=0)break;
for(i=0;i<=len;i++)
a[i]*=2;
for(i=0;i<=len;i++) //????????????????
if(a[i]>9)
{
a[i+1]++;
a[i]-=10;
}
mi(n-1);
}
}
|
25
|
12,417 |
void exponent(int a[], int n);
int main()
{
int n;
int a[200];
int i;
memset(a, 0, sizeof(a));
a[0] = 1;
cin >> n;
exponent(a, n);
for(i = 199; a[i] == 0; i--);
for(;i >= 0;i--)
{
cout << a[i];
}
return 0;
}
void exponent(int a[], int n)
{
if(n == 0)
return;
else
{
int i, k;
for(i = 199; a[i] == 0; i--);
for(k = 0; k <= i; k++)
{
a[k] = a[k] * 2;
}
for(k = 0; k <= i; k++)
{
a[k + 1] = a[k] / 10 + a[k + 1];
a[k] = a[k] % 10;
}
exponent(a, n - 1);
return;
}
}
|
25
|
12,418 |
int main(){
int n,i,c=0,j;
int B[300]={0};
B[1]=1;
scanf("%d",&n);
for(i=1;i<=n;i++){
for(j=1;j<300;j++){
B[j]=B[j]*2+c;
c=0;
if(B[j]>=10){
B[j]-=10;
c=1;
}
}
}
for(i=288;i>0;i--){
if(B[i]!=0){
break;
}
}
for(j=i;j>0;j--){
printf("%d",B[j]);
}
return 0;
}
|
25
|
12,419 |
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
|
12,420 |
/********************************************
*@file 5.cpp *
*@author ?? *
*@date 2013-11-20 *
*@description *
*??????8???2?N?? *
********************************************
*/
int main()
{
int n, a[50] = {0}, l, j; // 2?100??????32??l???
a[1] = l = 1;
for (cin >> n; n; n--) // ?????n=0?????false??
{
for (j = 1; j <= l; j++)
a[j] = a[j] * 2; // ?????2????????????????
for (j = 1; j <= l; j++)
{
a[j+1] += a[j] / 10;
if (a[l+1])
l++;
a[j] %= 10;
}
}
for ( ; l; l--)
cout<<a[l];
return 0;
}
//??????????????
/*???
a1=2?a2=0?l=1 2
a1=4?a2=0?l=1 4
a1=8?a2=0?l=1 8
a1=16?a2=1?l=2?a1=6 16
a1=12?a2=2?a2=3?l=2?a1=2 32
a1=4, a2=6?l=2 64
a1=8?a2=12?a3=1?l=3?a2=2 128
a1=16?a2=4?a3=2?a2=5?l=3?a1=6 256
??????
*/
|
25
|
12,421 |
int main()
{
int N;
cin >> N;
if( N == 0 )
{ cout << "1" ;return 0; }
char a[1000] = "2";
for( int i = 0; i< N - 1; i++ )
{
char b[1000];
int yushu = 0, j;
for( j = 0; j < strlen( a ); j++ )
{
b[j] = ( a[j] - '0' ) * 2 + yushu;
yushu = b[j] / 10;
b[j] = b[j] % 10 + '0';
}
if( yushu != 0 )
{ b[j] = yushu + '0';b[j + 1] = '\0';}
else
{ b[j] = '\0'; }
strcpy( a, b );
}
for( int i = strlen( a ) - 1 ; i >= 0; i-- )
cout << a[i];
}
|
25
|
12,422 |
/*
* 3.cpp
*
* Created on: 2013-1-13
* Author: i
*/
int main(){
int num[40]={1},temp[40]={1},n,i;
cin>>n;
while(n--){
for(i=0;i<40;i++){
if(num[i]==0&&num[i+1]==0&&num[i+2]==0)break;
if(num[i]+temp[i]>9){
temp[i+1]++;
temp[i]=num[i]+temp[i]-10;
}
else{
temp[i]=num[i]+temp[i];
}
}
for(i=0;i<40;i++){
num[i]=temp[i];
}
}
n=0;
for(i=39;i>=0;i--){
if(n)cout<<num[i];
else if(num[i]!=0){
cout<<num[i];
n++;
}
}
cout<<endl;
return 0;
}
|
25
|
12,423 |
int main()
{
int n,i,j,k;
cin>>n;
int num[50]={0};
num[1]=2;
for(i=1;i<n;i++)
{
k=49;
while(num[k]==0)
k--;
for(j=1;j<=k+1;j++)
{
num[j]*=2;
if(num[j-1]>=10)
{
num[j-1]-=10;
num[j]++;
}
}
}
if(n==0)
cout<<1<<endl;
else
{
k=49;
while(num[k]==0)
k--;
for(i=k;i>0;i--)
cout<<num[i];
cout<<endl;
}
return 0;
}
|
25
|
12,424 |
int main()
{
int n,i,j;
int re[100];
for(int x=0;x<100;x++)
re[x]=0;
cin>>n;
if(n==0)
cout<<"1"<<endl;
else if(n==1)
cout<<"2"<<endl;
else
{
re[99]=2;
for(i=1;i<n;i++)
{
j=99;
while(j!=0)
{
re[j]=re[j]*2;
j--;
}
j=99;
while(j!=0)
{
if(re[j]>=10)
{
re[j-1]+=re[j]/10;
re[j]=re[j]%10;
}
j--;
}
}
j=0;
while(re[j]==0)
j++;
for(;j<=99;j++)
cout<<re[j];
cout<<endl;
}
return 0;
}
|
25
|
12,425 |
int main ( )
{
int N, i, j, t = 0, exp[1000] = {2, 0};
cin >> N;
if(N==0)
cout <<1<<endl;
else
{
for(i = 1;i < N;i++)
{
t = 0;
for(j = 0;;j++)
{
if(exp[j+1]==0 && exp[j+2]==0 && exp[j+3]==0)
{
exp[j] = 2*exp[j]+t;
t = exp[j]/10;
exp[j] = exp[j] - 10*t;
exp[j+1] = t;
break;
}
else
{
if(j==0)
{
t = 2*exp[j]/10;
exp[j] = 2*exp[j] - 10*t;
}
else
{
exp[j] = 2*exp[j]+t;
t = exp[j]/10;
exp[j] = exp[j] - 10*t;
}
}
}
}
for(i = 999;i >= 0;i--)
{
if(exp[i]!=0)
break;
}
for(;i >=0;i--)
{
cout << exp[i];
}
}
return 0;
}
|
25
|
12,426 |
/**********************************
?? ???1300017667
?? 20131114
?? 2?n?????????
**********************************/
int main()
{
int n, i, j, flag = 0; //flag???????????
cin >> n;
short int num[35] = {1, 0}; //100 * log2 < 35
for(i = 1; i <= n; i ++) //n????????2?n??
{
for(j = 0; j <= 34; j ++)
{
num[j] = num[j] * 2 + flag; //???????????????????????
if(num[j] >= 10) //?????????????????????????????1
{
num[j] = num[j] - 10;
flag = 1;
}
else
flag = 0; //???????????????0
}
}
for(j = 34; num[j] == 0; j --); //?????????????????????????
for(; j >= 0; j --) //????????????????????????????
cout << num[j];
return 0;
}
|
25
|
12,427 |
//* * * * * * * * * * * * * * * * * * * * * * * *
//*??????2?N?? *
//*??????2?N?? .cpp *
//*????? 1000012839 *
//*???2010.12.15 *
//* * * * * * * * * * * * * * * * * * * * * * * *
int main()
{
int N; // ??2?N???
int i, j, k; // ?????
int num[100]; // ???????
int result[100]; // ???????
cin >> N;
memset(num, 0, sizeof(num)); // ???
memset(result, 0, sizeof(result)); // ???
result[0] = 1; // 2?0???1?
for (i = 0; i < N; i++) // ???????2?
{
j = 0;
for (k = 0; k < 100; k++)
num[j++] = result[k]; // ????????????num?
memset(result, 0, sizeof(result)); // result????????????
for (j = 0; j < 100; j++)
result[j] = 2 * num[j];
for (j = 0; j < 100; j++)
{
if (result[j] >= 10)
{
result[j + 1] += result[j] / 10;
result[j] %= 10; // ??10????
}
}
}
j = 99;
while (result[j] == 0)
j--; // ???????????
for ( ; j >= 0; j--)
cout << result[j]; // ???????
cout << endl;
return 0;
}
|
25
|
12,428 |
int main()
{
int N, i, j, l, a[32];
for(i=0; i<32; i++)
{
a[i]=0;
}
cin >> N;
a[31]=1;
if(N == 0)
cout << 1 << endl;
else
{
for(i=1; i <= N; i++)
{
j=0;
while(a[j] == 0)
{
j++;
}
l=32-j;
for(j=31; j >= 32-l; j--)
{
a[j] *= 2;
}
for(j=31; j >= 32-l; j--)
{
if(a[j] >= 10)
{
a[j-1] += a[j]/10;
a[j]=a[j]%10;
}
}
}
i=0;
while(a[i] == 0)
{
i++;
}
for( ; i<32; i++)
cout << a[i];
return 0;
}
}
|
25
|
12,429 |
//********************************
//*???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
|
12,430 |
int main () {
int n,i;
scanf ("%d",&n);
double s=1;
for (i=0;i<n;i++){
s=s*2;
}
printf ("%.0lf",s);
return 0;
}
|
25
|
12,431 |
//**************************
//*?????2?N?? **
//*?????? 1200012888 **
//*???2013.11.15**
//**************************
int main()
{
int n;
cin >> n;
int buf[Max_Size] = {1};
while(n)
{
for(int i = 0;i < Max_Size ; i++)
{
buf[i] = 2 * buf[i] ;
}
for(int i = 0 ; i < Max_Size ; i++)
{
buf[i + 1] = buf[i] / 10 + buf[i + 1];
buf[i] = buf[i] % 10;
}
n --;
}
int flag = 0;
for (int i = Max_Size - 1 ; i >= 0 ; i--)
{
if(flag)
{
cout << buf[i];
}
else if(buf[i] != 0)
{
cout << buf[i];
flag = 1;
}
}
return 0;
}
|
25
|
12,432 |
int main()
{
int n,num1,num2,s=0;;
char a[110];
for(int i=1;i<=109;i++)
a[i]='*';
cin>>n;
int t=1;
int sig;
a[1]='2';
if(n==1)
cout<<2<<endl;
else
{
if(n==0)
cout<<1;
else
{
for(int i=1;i<=n-1;i++)
{
sig=t;
for(int j=1;j<=sig;j++)
{
num1=a[j]-48;
num1=num1*2+s;
s=0;
if(num1<10)
a[j]=num1+48;
else
{
a[j]=num1+38;
if(a[j+1]=='*')
{
a[j+1]='1';
t++;
}
else
{
s=1;
}
}
}
}
for(int i=109;i>=1;i--)
{
if(a[i]!='*')
{
cout<<a[i];
}
}
}
}
return 0;
}
|
25
|
12,433 |
int main()
{
int i,j,k,b;
int m[10000]={0};
int n;
cin>>n;
if(n==0)
cout<<1;
if(n==1)
cout<<2;
if(n>1){
m[0]=2;
for(i=1;i<=n-1;i++)
{for(j=0;j<9999;j++)
m[j]=m[j]*2;
for(j=0;j<9999;j++)
if(m[j]>9)
{
m[j]=m[j]%10;
m[j+1]++;
}
}
for(i=9999;i>=0;i--)
if(m[i]!=0)
{k=i;break;}
for(b=k;b>=0;b--)
cout<<m[b];}
return 0;
}
|
25
|
12,434 |
char number[100];
char transnum[100];
void inttochar(int num)
{
int i = 0;
char temp[100];
do
{
temp[i] = num % 10 + '0';
num = num / 10;
i++;
}while(num != 0);
for (int j = i - 1; j >= 0; j--)
{
number[i - 1 - j] = temp[j];
}
return;
}
void multiply(char number[], int k)
{
int t = 0;
for(int j = strlen(number) - 1; j >= 0; j--)
{
transnum[j + 1] = ((number[j] - '0') * k + t)% 10 + '0';
t = ((number[j] - '0') * k + t)/ 10;
}
transnum[0] = t + '0';
strcpy(number, transnum);
return;
}
int main()
{
int n;
cin >> n;
if (n < 31)
{
cout << (int)pow((double)2, n) << endl;
}
else
{
int num = (int)pow((double)2, 30);
inttochar(num);
n = n - 30;
while (n != 0)
{
if (n <= 3)
{
int k = (int)pow((double)2, n);
multiply(number, k);
n = 0;
}
else
{
multiply(number, 8);
n = n - 3;
}
};
int i = 0;
do
{
if(number[i] != '0')
break;
else
i++;
}while(1);
for (int j = i; j < strlen(number); j++)
{
cout << number[j];
}
cout << endl;
}
return 0;
}
|
25
|
12,435 |
int N;
void chenger(int depth,char *a)
{
if(depth==N) //??N???
{
int len=strlen(a)-1;
for(int i=len;i>=0;i--)
cout<<a[i];
}
else
{
char b[100]={'\0'};
int len=strlen(a);
int temp[100]={0};//??
for(int i=0;i<len;i++)//??
{
b[i]=((a[i]-'0')*2)%10+temp[i]+'0';
temp[i+1]=((a[i]-'0')*2)/10;
}
if(temp[len]!=0) b[len]=temp[len]+'0';
chenger(depth+1,b);
}
}
int main()
{
cin>>N;
char num[100]={'\0'};
num[0]='1';//2?0??
chenger(0,num);
return 0;
}
|
25
|
12,436 |
/*
* 3.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
void times2(char *a,int length){
int i,carry=0;
for(i=0;i<length;i++){
a[i]=a[i]*2+carry-'0';
if(a[i]>'9'){
a[i]=a[i]-10;
carry=1;
}
else carry=0;
}
if(carry==1){
a[length]='1';
}
}
int main(){
int n,i,length;
cin>>n;
char answer[100]="1";
for(i=1;i<=n;i++){
length=strlen(answer);
times2(answer,length);
}
length=strlen(answer);
for(i=length-1;i>=0;i--){
cout<<answer[i];
}
cout<<endl;
return 0;
}
|
25
|
12,437 |
void multiple(char a[],char b[])
{
char c[1500]={0};
int i,j,alen,blen;
for(i=0;i<700;i++)
for(j=0;j<700;j++)
{
c[i+j]+=a[i]*b[j];
c[i+j+1]+=(c[i+j])/10;
c[i+j]=c[i+j]%10;
}
for(i=0;i<1499;i++) a[i]=c[i];
}
int main()
{
int n,len,i;
char tep[1500]={0},out[1500]={0};
tep[0]=2;
out[0]=1;
cin>>n;
while(n>0)
{
if(n%2==1) multiple(out,tep);
multiple(tep,tep);
n=(n)/2;
}
i=1499;
while(out[i]==0)i--;
for(;i>=0;i--)
cout<<(int)out[i];
return 0;
}
|
25
|
12,438 |
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
|
12,439 |
void cheng(int a[100], const int n, int flag);
int main()
{
int n;
int a[100] = {2};
cin >> n;
if(n == 0)
cout << "1" << endl;
else
cheng(a, n, 0);
return 0;
}
void cheng(int a[100], const int n, int flag)
{
int i = 0, j = 0, count = 0, l = 0, k = 0;
int b[100] = {0};
count = 99;
while(a[count] == 0)
count --;
if(flag == n - 1)
{
for(i = 0; i <= count; i++)
cout << a[i];
}
else
{
for(i = count; i >= 0; i--)
{
b[j++] = a[i];
}
for(i = 0; i <= count; i++)
b[i] = b[i] * 2;
for(i = 0; i <= count; i++)
{
if(b[i] >= 10)
{
b[i] = b[i] - 10;
b[i + 1]++;
}
}
l = count + 1;
while(b[l] == 0)
l--;
for(i = l; i >= 0; i--)
{
a[k++] = b[i];
}
flag++;
cheng(a, n, flag);
}
}
|
25
|
12,440 |
//*********************************
//* ??? 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
|
12,441 |
/************************************************
**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
|
12,442 |
int main()
{
int n, a[32] = {1}, compute[32] = {0}, k;
cin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 32; j++)
compute[j] += a[j] * 2;
for(int j = 0; j < 32; j++)
{
compute[j + 1] += compute[j] / 10;
compute[j] %= 10;
}
for(int j = 0; j < 32; j++)
a[j] = compute[j];
memset(compute, 0, sizeof(compute));
}
for(k = 31; k >= 0; k--)
if(a[k])
break;
for(int i = k; i >= 0; i--)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12,443 |
/***************************??2?N??**********************
??
??????????N(N<=100)???2?N?????
????
??????????N?
????
??2?N?????
????
5
????
32
??
?????
***********************************************************
programmer Qiu HEzi
version 1.0
creat time 2012.12.21 1:14
***********************************************************/
void c (char *temp , int num)
{
*temp = '0' +num;
}
int fun (char a[110] , int w)
{
int plu =0 ; //????????1
for (int i=0 ; i<w ; i++)
{
int temp = (a[i]-'0')*2 +plu;
if (temp>=10)
{
plu=1;
temp-=10;
}
else
plu=0;
a[i]=temp+'0';
}
if (plu==1)
{
w++;
a[w-1]='1';
}
return w;
}
int main()
{
int n;
cin>>n;
char a[110]={0};
a[0]='1';
int w=1 ;//???????
for (int i=0 ; i<n ; i++)
w = fun (a , w);
for (int i=w-1 ; i>=0 ; i--)
cout<<a[i];
return 0;
}
|
25
|
12,444 |
int result[ 50 ] = { 1 } ;
void power2( int n ) ;
int main()
{
int n ;
cin >> n ;
power2( n ) ;
return 0 ;
}
void power2( int n )
{
int i , j = 0 ;
for( i = 0 ; i < 50 ; i ++ )
result[ i ] = result[ i ] * 2 ;
for( i = 0 ; i < 50 ; i ++ )
if( result[ i ] >= 10 )
{
result[ i + 1 ] = result[ i + 1 ] + result[ i ] / 10 ;
result[ i ] = result[ i ] % 10 ;
}
if( n == 1 )
{
i = 50 - 1 ;
while( result[ i ] == 0 )
i -- ; //???????0??
for( ; i >= 0 ; i -- )
cout << result[ i ] ; //??????
cout << endl ;
return ;
}
else
{
if( n == 0 )
{
cout << 1 ;
return ;
}
else
power2( n - 1 ) ;
}
}
|
25
|
12,445 |
int main()
{
int n, i, j, temp[100] = {0}, tag[100] = {0};
cin >> n;
temp[0] = 1;
for (i = 0; i < n; i ++)
{
for (j = 0; j < 99; j ++)
{
if (temp[j] * 2 + tag[j] < 10)
{
temp[j] = temp[j] * 2 + tag[j];
tag[j] = 0;
}
else
{
temp[j] = temp[j] * 2 + tag[j] - 10;
tag[j] = 0;
tag[j + 1] = 1;
}
}
}
for (i = 99; i >= 0; i --)
{
if (temp[i] != 0)
break;
}
for (j = i; j >= 0; j --)
cout << temp[j];
cout << endl;
return 0;
}
|
25
|
12,446 |
//*****************************
//* ??????2?N?? **
//* ?????? 1300012948 **
//* ???2013.11.15 **
//*****************************
int main()
{
int a[32] = {0}, n, p;
cin >> n;
a[0] = 1;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 32; j++) // ????????????
{
a[j] = a[j] * 2;
}
for(int k = 0; k < 32; k++) // ????????????,??????,?????,????????
{
if(a[k] >= 10)
{
a[k] -= 10;
a[k + 1]++;
}
}
}
p = 31;
while(a[p] == 0) // ?????????
{
p--;
}
for( ; p >= 0; p--) // ????????
{
cout << a[p];
}
cout << endl;
return 0;
}
|
25
|
12,447 |
// ??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
|
12,448 |
void bigmulti(char a[],char b[],char c[])
{
int i,tem[400],j,k,la=strlen(a),lb=strlen(b);
int sum[800],num1[400],num2[400];
memset(sum,0,sizeof(sum));
memset(num1,0,sizeof(num1));
memset(num2,0,sizeof(num2));
for(i=0;i<la;i++)
num1[i]=a[la-1-i]-'0';
for(i=0;i<lb;i++)
num2[i]=b[lb-1-i]-'0';
for(i=0;i<lb;i++)
{
memset(tem,0,sizeof(tem));
tem[0]=num1[0]*num2[i];
for(j=1;j<=la;j++)
{
tem[j]=num1[j]*num2[i]+tem[j-1]/10;
tem[j-1]%=10;
}
for(j=0;j<=200;j++)
{
if(j==0&&i==0)
sum[0]=tem[0];
else
{
sum[i+j]=sum[i+j]+tem[j]+sum[i+j-1]/10;
sum[i+j-1]%=10;
}
}
}
for(i=la+lb;i>=0&&sum[i]==0;i--);
c[i+1]='\0';
for(j=0;j<=i;j++)
c[i-j]=sum[j]+'0';
}
int main()
{
int n,i;
char s[1000]="1",a[1000];
scanf("%d",&n);
for(i=1;i<=n;i++){
bigmulti(s,"2",a);
strcpy(s,a);
}
printf("%s",s);
return 0;
}
|
25
|
12,449 |
/*???????2?N??
*??????
*???2010/12/16
*???1000010449
*/
void multiply(char *p) //?2
{
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 > 0; i--) //??
{
num[i - 1] += num[i] / 10;
num[i] %= 10;
}
if (num[0] == 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); //?n?
cout << result << endl;
return 0;
}
|
25
|
12,450 |
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
|
12,451 |
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
|
12,452 |
//********************************
//*???2?n??
//*??? ?? 1300012814 **
//*???2013.11,14 **
//********************************
int main()
{
int n, a[100] = {1};
cin >>n;
for (int i = 1; i<=n;i++)
{
for (int j = 0;j < 100;j++)
{
a[j] = 2 * a[j];
}
for (int j = 0; j<100;j++)
{
if (a[j] >= 10)
{
a[j+1]++;
a[j] = a[j]%10;
}
}
}
int j = 99;
while (a[j]==0)
{
j--;
}
for (;j>=0;j--)
{
cout << a[j];
}
return 0;
}
|
25
|
12,453 |
int main()
{
int n,i,num[150]={0},len,k,m,j;
char str[150]={'\0'};
cin>>m;
str[0]='1';
for(j=1;j<=m;j++)
{
len=strlen(str);
k=0;
for(i=len-1;i>=0;i--)
{
n=str[i]-'0';
num[k]=n*2;
k++;
}
for(i=0;i<120;i++)
{
// cout<<num[i]<<' '<<num[i+1]<<' ';
num[i+1]=num[i+1]+num[i]/10;
num[i]=num[i]%10;
// cout<<num[i]<<' '<<num[i+1]<<endl;
}
i=140;
while(num[i]==0) i--;
k=0;
for(;i>=0;i--)
{
str[k]=num[i]+'0';
k++;
}
}
i=140;
while(num[i]==0) i--;
for(;i>=0;i--)
cout<<num[i];
if(m==0) cout<<1;
return 0;
}
|
25
|
12,454 |
/*************************************************************************************************************
* @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
|
12,455 |
int main()
{
int x, length = 1, i;
char result[51];
for (i = 1; i < 51; i++)
result[i] = '0';
result[0] = '1';
for (cin >> x; x > 0; x--)
{
for (i = 0; i < length; i++)
result[i] = result[i] * 2 - '0';
for (i = 0; i < length - 1; i++)
if (result[i] > '9')
{
result[i] -= 10;
result[i + 1]++;
}
if (result[i] > '9')
{
result[i] -= 10;
result[i + 1]++;
length++;
}
}
for (length--; length >= 0; length--)
cout << result[length];
return 0;
}
|
25
|
12,456 |
int main(){
int n,i;
double f;
scanf("%d",&n);
f=pow(2.0,(double)n);
printf("%.0lf",f);
return 0;
}
|
25
|
12,457 |
int main()
{
int a[100] , n , h , j , i ;
cin >> n ;
memset(a , 0 , sizeof(a)) ;
a[1] = 1 ;
h = 1 ;
for (i = 1 ; i <= n ; i ++ )
{
for (j = 1 ; j <= h ; j ++ )
a[j] += a[j] ;
for (j = 1 ; j <= h ; j ++ )
if (a[j] >= 10)
{
a[j] = a[j] - 10 ;
a[j + 1] += 1 ;
}
if (a[h + 1] != 0)
h ++ ;
}
for (i = h ; i >= 1 ; i -- )
cout << a[i] ;
cout << endl ;
return 0 ;
}
|
25
|
12,458 |
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
|
12,459 |
//***************************
//*?????2?N?? **
//*?????? **
//*???2013.11.15 **
//***************************
int main()
{
int i,j,k,n;
cin>>n;
int a[52];
if(n==0)
{
cout<<"1"<<endl;
}
else
{
for(i=0;i<=50;i++)
{
a[i]=0;
}
a[51]=1;
for(i=0;i<n;i++)
{
for(j=51;j>=0;j--)
{
a[j]=a[j]*2;
}
for(k=51;k>=0;k--)
{
if(a[k]>=10)
{
a[k-1]+=a[k]/10;
a[k]=a[k]%10;
}
}
}
for(i=0;i<=51;i++)
{
if(a[i]!=0)
{
k=i;
break;
}
}
for(j=k;j<=51;j++)
{
cout<<a[j];
}
cout<<endl;
}
return 0;
}
|
25
|
12,460 |
int main()
{
int n,i;
double result=1;
scanf("%d",&n);
result=pow(2.0,1.0*n);
printf("%.0lf",result);
return 0;
}
|
25
|
12,461 |
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
|
12,462 |
//********************************
//*à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
|
12,463 |
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
|
12,464 |
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
|
12,465 |
int main(){
int n;
double m;
scanf("%d",&n);
if(n==0){
printf("1");
}
else{
m=pow(2,n);
printf("%.lf",m);
}
return 0;
}
|
25
|
12,466 |
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;
}
|
25
|
12,467 |
int main()
{
int n, ans[101], len, t;
memset(ans, 0, sizeof(ans));
ans[0] = 1;
len = 0;
cin >> n;
for (int i = 1; i <= n; ++i)
{
t = 0;
for (int j = 0; j <= len; ++j)
{
ans[j] *= 2;
ans[j] += t;
if (ans[j] >= 10)
{
t = 1;
ans[j] -= 10;
}
else
{
t = 0;
}
}
ans[len + 1] += t;
if (ans[len + 1] != 0) ++len;
}
for (int i = len; i >= 0; --i)
cout << ans[i];
return 0;
}
|
25
|
12,468 |
int a[35],b[35],c[35],d[35];
void jiaziji();
int main ()
{
int n=0;
cin>>n;
for (int i=0;i<35;i++)
{
a[i]=0;
b[i]=0;
c[i]=0;
d[i]=0;
}
a[34]=1;b[34]=1;
for (int i=0;i<n;i++) jiaziji();
if (n==0) cout<<'1'<<endl;
else//?????????????
{
int p=0;
for (int i=0;i<35;i++)
{
if (c[i]!=0)
{
p=i;
break;
}
}
for (int i=p;i<35;i++)
{
cout<<c[i];
}
}
return 0;
}
void jiaziji()//?????????????????
{
for (int i=34;i>0;i--)//c????????d???????a?b?????????????
{
c[i]=a[i]+b[i]+d[i];
if (c[i]>9) //????
{
c[i]-=10;
d[i-1]+=1;
}
}
for (int i=0;i<35;i++)//????????????????????a?b???d????
{
a[i]=c[i];
b[i]=c[i];
d[i]=0;
}
}
|
25
|
12,469 |
int main()
{
int s=1,n,len1,len2,i,j,num1[100],num2[100],num3[40000]={0},flag;
char str1[100]={0};
cin>>n;
if(n<32){
for( i=0;i<n;i++)
s*=2;
cout<<s;
}
else if(n>=32&&n<=60)
{
num1[9]=1,num1[8]=0,num1[7]=7,num1[6]=3,num1[5]=7,num1[4]=4,num1[3]=1,num1[2]=8,num1[1]=2,num1[0]=4;
j=0;
n=n-30;s=1;
for(i=0;i<n;i++)
s*=2;
while(s>0){
num2[j++]=s%10;//cout<<num2[j-1]<<endl;
s/=10;
}int len2=j;
for(i=0;i<10;i++)
{ for(j=0;j<len2;j++)
{
num3[i+j]=num3[i+j]+num1[i]*num2[j];
while(num3[i+j]>=10)
{
num3[i+j]-=10;
num3[i+j+1]++;
}
}
}
for(i=30000;i>=0;i--)
{
if(num3[i]!=0)
{ flag=i;break;
}
}
for(i=flag;i>=0;i--)
{
cout<<num3[i];
}
}
else if(n>60&&n<=90)
{
num1[18]=1,num1[17]=1,num1[16]=5,num1[15]=2,num1[14]=9,num1[13]=2,num1[12]=1,num1[11]=5,num1[10]=0,num1[9]=4,num1[8]=6,num1[7]=0,num1[6]=6,num1[5]=8,num1[4]=4,num1[3]=6,num1[2]=9,num1[1]=7,num1[0]=6;
j=0;
n=n-60;s=1;
for(i=0;i<n;i++)
s*=2;
while(s>0){
num2[j++]=s%10;//cout<<num2[j-1]<<endl;
s/=10;
}int len2=j;
for(i=0;i<19;i++)
{ for(j=0;j<len2;j++)
{
num3[i+j]=num3[i+j]+num1[i]*num2[j];
while(num3[i+j]>=10)
{
num3[i+j]-=10;
num3[i+j+1]++;
}
}
}
for(i=30000;i>=0;i--)
{
if(num3[i]!=0)
{ flag=i;break;
}
}
for(i=flag;i>=0;i--)
{
cout<<num3[i];
}
}
else if(n>90)
{
num1[22]=3,num1[21]=7,num1[20]=7,num1[19]=7,num1[18]=8,num1[17]=9,num1[16]=3,num1[15]=1,num1[14]=8,num1[13]=6,num1[12]=2,num1[11]=9,num1[10]=5,num1[9]=7,num1[8]=1,num1[7]=6,num1[6]=1,num1[5]=7,num1[4]=0,num1[3]=9,num1[2]=5,num1[1]=6,num1[0]=8;
j=0;
n=n-75;s=1;
for(i=0;i<n;i++)
s*=2;
while(s>0){
num2[j++]=s%10;//cout<<num2[j-1]<<endl;
s/=10;
}int len2=j;
for(i=0;i<23;i++)
{ for(j=0;j<len2;j++)
{
num3[i+j]=num3[i+j]+num1[i]*num2[j];
while(num3[i+j]>=10)
{
num3[i+j]-=10;
num3[i+j+1]++;
}
}
}
for(i=30000;i>=0;i--)
{
if(num3[i]!=0)
{ flag=i;break;
}
}
for(i=flag;i>=0;i--)
{
cout<<num3[i];
}
}
// 4294967296
return 0;
}
|
25
|
12,470 |
int main()
{
char a[1000000];
int N, i, j;
cin >> N;
for(i = 0;i < 1000000;i++)
a[i] = '0';
a[0] = '2';
int count = 1;
if(N == 0)
cout << 1;
else
{
for(i = 0;i < N-1;i++)
{
for(j = 0;j < 1000000;j++)
{
a[j] = (a[j] - '0')* 2;
}
for(j = 0;j < 1000000;j++)
{
if(a[j] > 9)
{
a[j] = a[j] - 10 + '0';
a[j+1]++;
}
else
{
a[j] = a[j] + '0';
}
}
}
int first = 0;
for(i = 999999;i>=0;i--)
{
if(a[i] != '0' || first == 1)
{
first = 1;
cout << a[i];
}
}
}
return 0;
}
|
25
|
12,471 |
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
|
12,472 |
char r[101];
int main()
{
int N,i,j,k,num;
cin>>N;
r[0]='1';
if(N==0)
{
cout<<1;
return 0;
}
else
{
for(i=1;i<=N;i++)
{
k=0;
for(j=0;j<strlen(r);j++)
{
if (r[j]>='0'&&r[j]<='4')
{
r[j]='0'+2*(r[j]-'0')+k;
k=0;
}
else
{
r[j]='0'+2*(r[j]-'5')+k;
k=1;
}
}
if(k==1) r[j]='1';
}
}
for (i=strlen(r)-1;i>=0;i--)
cout << r[i];
return 0;
}
|
25
|
12,473 |
double f(double a);
int main(){
double n,m;
scanf("%lf",&n);
m=f(n);
printf("%.0lf",m);
return 0;
}
double f(double a)
{
double b;
if(a==0) b=1.0;
else if(a==1) b=2,0;
else b=f(a-1)*2.0;
return b;
}
|
25
|
12,474 |
int a[10000],b[10000],c[10000],ans[10000];
void cheng(int a[10000])
{
int i,j,m;
memset(c,0,sizeof(c));
for (i=1;i<=a[0];i++)
{
c[i]=c[i]+a[i]*2;
c[i+1]=c[i+1]+c[i]/10;
c[i]=c[i]%10;
}
j=a[0]+10;
while (j>0&&c[j]==0) j--;
a[0]=j;
for (i=1;i<=j;i++) a[i]=c[i];
}
int main()
{
int i,j,k,m,n;
cin >>k;
memset(ans,0,sizeof(ans));
memset(a,0,sizeof(a));
ans[0]=1;ans[1]=1;
for (i=1;i<=k;i++)
cheng(ans);
for (i=ans[0];i>0;i--) cout <<ans[i];
return 0;
}
|
25
|
12,475 |
int main()
{
int n, i, j, a[35] = {0};
a[1] = 1;
cin >> n;
if(n == 0) cout << a[1] <<endl;
else
{
for(i = 1;i <= n;i++)
{
int flag[35] = {0};
for(j = 1; ;j++)
{
if(a[j]*2 <= 8)
{
a[j] = a[j]*2 + flag[j-1];
if(a[j+1] == 0 && a[j+2] ==0 &&a[j+3] == 0) break;
}
else if(a[j]*2 >= 10)
{
a[j] = a[j]*2 - 10 + flag[j-1];
flag[j] = 1;
if(a[j+1] == 0 && a[j+2] == 0 && a[j+3] == 0)
{
flag[j] = 0;
a[j+1] = 1;
break;
}
}
}
}
if(a[j+1] == 1) cout << a[j+1];
for(i = j;i >= 1;i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
25
|
12,476 |
int main()
{
double n;
cin >> n;
if(n < 20)
{
cout << pow(2 , n);
}
if(n == 20) cout << "1048576";
if(n == 21) cout << "2097152";
if(n == 22) cout << "4194304";
if(n == 23) cout << "8388608";
if(n == 24) cout << "16777216";
if(n == 25) cout << "33554432";
if(n == 26) cout << "67108864";
if(n == 27) cout << "134217728";
if(n == 28) cout << "268435456";
if(n == 29) cout << "536870912";
if(n == 30) cout << "1073741824";
if(n == 31) cout << "2147483648";
if(n == 32) cout << "4294967296";
if(n == 33) cout << "8589934592";
if(n == 34) cout << "17179869184";
if(n == 35) cout << "34359738368";
if(n == 36) cout << "68719476736";
if(n == 37) cout << "137438953472";
if(n == 38) cout << "274877906944";
if(n == 39) cout << "549755813888";
if(n == 40) cout << "1099511627776";
if(n == 41) cout << "2199023255552";
if(n == 42) cout << "4398046511104";
if(n == 43) cout << "8796093022208";
if(n == 44) cout << "17592186044416";
if(n == 45) cout << "35184372088832";
if(n == 46) cout << "70368744177664";
if(n == 47) cout << "140737488355328";
if(n == 48) cout << "281474976710656";
if(n == 49) cout << "562949953421312";
if(n == 50) cout << "1125899906842624";
if(n == 51) cout << "2251799813685248";
if(n == 52) cout << "4503599627370496";
if(n == 53) cout << "9007199254740992";
if(n == 54) cout << "18014398509481984";
if(n == 55) cout << "36028797018963968";
if(n == 56) cout << "72057594037927936";
if(n == 57) cout << "144115188075855872";
if(n == 58) cout << "288230376151711744";
if(n == 59) cout << "576460752303423488";
if(n == 60) cout << "1152921504606846976";
if(n == 61) cout << "2305843009213693952";
if(n == 62) cout << "4611686018427387904";
if(n == 63) cout << "9223372036854775808";
if(n == 64) cout << "18446744073709551616";
if(n == 65) cout << "36893488147419103232";
if(n == 66) cout << "73786976294838206464";
if(n == 67) cout << "147573952589676412928";
if(n == 68) cout << "295147905179352825856";
if(n == 69) cout << "590295810358705651712";
if(n == 70) cout << "1180591620717411303424";
if(n == 71) cout << "2361183241434822606848";
if(n == 72) cout << "4722366482869645213696";
if(n == 73) cout << "9444732965739290427392";
if(n == 74) cout << "18889465931478580854784";
if(n == 75) cout << "37778931862957161709568";
if(n == 76) cout << "75557863725914323419136";
if(n == 77) cout << "151115727451828646838272";
if(n == 78) cout << "302231454903657293676544";
if(n == 79) cout << "604462909807314587353088";
if(n == 80) cout << "1208925819614629174706176";
if(n == 81) cout << "2417851639229258349412352";
if(n == 82) cout << "4835703278458516698824704";
if(n == 83) cout << "9671406556917033397649408";
if(n == 84) cout << "19342813113834066795298816";
if(n == 85) cout << "38685626227668133590597632";
if(n == 86) cout << "77371252455336267181195264";
if(n == 87) cout << "154742504910672534362390528";
if(n == 88) cout << "309485009821345068724781056";
if(n == 89) cout << "618970019642690137449562112";
if(n == 90) cout << "1237940039285380274899124224";
if(n == 91) cout << "2475880078570760549798248448";
if(n == 92) cout << "4951760157141521099596496896";
if(n == 93) cout << "9903520314283042199192993792";
if(n == 94) cout << "19807040628566084398385987584";
if(n == 95) cout << "39614081257132168796771975168";
if(n == 96) cout << "79228162514264337593543950336";
if(n == 97) cout << "158456325028528675187087900672";
if(n == 98) cout << "316912650057057350374175801344";
if(n == 99) cout << "633825300114114700748351602688";
if(n == 100)cout << "1267650600228229401496703205376";
return 0;
}
|
25
|
12,477 |
//
// main.cpp
// ??
//
// Created by ? ? on 12-12-15.
// Copyright (c) 2012? ? ?. All rights reserved.
//
void output(int *S)
{
int k=0;
for (; S[k]==0; k++) {
;
}
for (int i=k; i<41; i++) {
cout<<S[i];
}
}
void muti(int n)
{
int S[41]={0};
S[40]=1;
for(int i=0;i<n;i++){
for (int i=40; i>0; i--) {
S[i]=S[i]*2;
}
for (int i=40; i>0; i--) {
while (S[i]>9) {
int x;
x=S[i]/10;
S[i]-=10*x;
S[i-1]+=x;
}
}
}
output(S);
}
int main()
{
int n;
cin>>n;
muti(n);
return 0;
}
|
25
|
12,478 |
//**********************************
//* ????homework_5.cpp *
//* ??????1200012884 *
//* ?????2012?12?17? *
//* ???????2?N??
//**********************************
int main()
{
int n, temp, len;
cin >> n;
int i, j;
int a[100] = {0};
a[0] = 1;
len = 1;
for (i = 0;i < n;i++)
{
temp = 0;
for (j = 0;j < len;j++)
{
a[j] = a[j] * 2 + temp;
temp = floor(a[j] / 10);
a[j] = a[j] % 10;
}
if (temp > 0)
{
a[j] = temp;
len++;
}
}
for (i = len - 1;i >= 0;i--)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12,479 |
//?????????100?????
int main()
{
int result[80]={0}; //????
//???????????????????????????OTZ?
int l=1; //??
int c; //????????
int n; //??
int i,j;
scanf("%d",&n);
if(n<=30)
{
c=(int)pow(2,n);
printf("%d",c);
return 0; //????????????=u=+
}
//if(n==100)
//{
// printf("1267650600228229401496703205376");
// return 0;
// }
result[0]=1; //2?0??
for(i=0;i<n;i++) //???2
{
c=0; //??????
for(j=0;j<l;j++) //??????
{
result[j]=result[j]*2+c;
c=result[j]/1000; //??
if(result[j]>=1000) //????
{
result[j]=result[j]%1000; //??
if(j==l-1) //?????
{
l++; //?+1
}
}
}
}
for(i=l-1;i>=0;i--) //??
{
if(i!=l-1) //??
{
printf("%.3d",result[i]);
continue;
}
printf("%d",result[i]);
}
printf("\n");
return 0;
}
|
25
|
12,480 |
int main()
{
int i, n, a[102]={0}, b[102]={1}, j; //a????????b????????n????
cin >> n; //??n
if (n==0) //??n?0
cout << "1" << endl; //??1
else //??n????
{
for (j=1;j<=n;j++) //???n?
{
for (i=0;i<101;i++) //?????????
{
a[i] = 2 * b[i];
}
for (i = 0; i < 101; i++) //????????????10???1
{
if (a[i]>=10)
{
a[i+1] += a[i]/10;
a[i] %= 10;
}
}
while (a[i]==0) //???????0??
i--;
for (; i>=0; i--) //???????????????b
{
b[i] = a[i];
if (j == n) //?????n?
cout << a[i]; //????
}
}
cout << endl;
}
return 0;
}
|
25
|
12,481 |
int a[500] = {0};
void f(int c)
{
int i;
if (c == 0)
{
return ;
}
if (c == 1)
{
for (i = 0 ; i <= 499 ; i++)
{
a[i] *= 2;
}
for (i = 499 ; i >= 1 ; i--)
{
a[i - 1] += a[i] / 10;
a[i] %= 10;
}
a[0] %= 10;
return ;
}
if (c % 2 == 0)
{
f(c / 2);
f(c / 2);
return ;
}
else
{
f(1);
f(c / 2);
f(c / 2);
return ;
}
}
int main()
{
int n , i , flag = 0;
cin >> n;
a[499] = 1;
f(n);
for (i = 0 ; i <= 499 ; i++)
{
if (flag == 0)
{
if (a[i] != 0)
{
flag = 1;
cout << a[i];
}
}
else
{
cout << a[i];
}
}
cout << endl;
return 0;
}
|
25
|
12,482 |
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
|
12,483 |
/*
*@file 5.cpp
*@author ???
*@date 11.15
*@description ??2?n??
*/
int main ()
{
int a[1000]={0}; //????????????????????
int i,n,temp=0;
int N;
a[0]=1; //???????1
cin >> N;
for(n = 1; n <= N; n++)
{
for(i = 0; i < 1000; i++)
a[i]*=2; //??????????2
for(i = 0; i < 1000; i++)
{
if(a[i] > 9)
{
a[i] = a[i] % 10; //?????2???9????
a[i+1]+=1;
}
}
}
for(i = 999; i >= 0; i--)
{
if(a[i]!=0)
{
temp=i; //????????????0???
break;
}
}
for(i = temp; i >= 0; i--)
cout << a[i];
return 0;
}
|
25
|
12,484 |
void f(int n,int a[100])
{ if(n==0) return ;
else
{ int b[100]={0};
int i;
for(i=1;i<100;i++)
{ b[i]=(2*a[i])/10;
a[i]=(2*a[i])%10+b[i-1];
}
f(n-1,a);
}
}
int main()
{ int n;
cin>>n;
int a[100]={0};
a[1]=1;
f(n,a);
int i;
int t=0;
for(i=99;i>=1;i--)
{ if(a[i]!=0) t=1;
if(t==1) cout<<a[i];
}
return 0;
}
|
25
|
12,485 |
//********************************
//*???2?N?? **
//*?????? 1300012773 **
//*???2013.11.13 **
//********************************
int main()
{
int N;
int num[10000] = {0}; //?????????0
int result;
int k;
cin >> N;
if(N == 0) //??N?????????????1?
cout << 1;
else //??N?????????
{
k = 0; //?k???????????
num[0] = 1;
//????????????????????
for(int i = 1; i <= N; i++)
{
for(int j = 0; j <= k; j++)
{
num[j] *= 2;
}
for(int j = 0; j <= k; j++)
{
if(num[j] >= 10)
{
num[j] -= 10;
num[j+1]++;
}
}
//??????????????k?1
if(num[k+1] != 0)k++;
}
//????
for(int j = k; j >= 0 ;j--)
cout << num[j];
}
return 0;
}
|
25
|
12,486 |
int main ()
{
int N ;
cin >> N ;
int num[1000] = {0} ;
num[999] = 1 ;
for (int i = 1 ; i <= N ; i ++)
{
for (int j = 999 ; j >= 1 ; j --)
{
num[j] *= 2 ;
}
for (int j = 999 ; j >= 1 ; j --)
{
num[j - 1] += num[j] / 10 ;
num[j] = num[j] % 10 ;
}
}
int b = 0 ;
while (num[b] == 0)
b ++ ;
for ( ; b <= 999 ; b ++)
cout << num[b] ;
return 0 ;
}
|
25
|
12,487 |
int main()
{
int a[110]={0};
int n ;
cin>>n;
a[0]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<100;j++)
{
a[j]=a[j]*2;
}
//for(int j=0;j<20;j++)
//{cout<<a[j]<<endl ;}
for(int j=0;j<100;j++)
{
if(a[j]>9)
{
//cout<<a[j]<<endl;
a[j+1]=a[j+1]+(a[j]/10);
a[j]=a[j]%10;
//cout<<a[j+1]<<",,,"<<endl;
}
}
}
//cout<<a[0]<<endl;
for(int i=99;i>=0;i--)
{
if(a[i]!=0)
{
for(int j=i;j>=0;j--)
{
cout<<a[j];
}
break;
}
}
return 0;
}
|
25
|
12,488 |
int main()
{
int n;
cin>>n;
int i=0,j=0;;
int a[100]={0};
a[1]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<100;j++)
a[j]=a[j]*2;
for(j=1;j<100;j++)
if(a[j]>=10)
{
a[j+1]=a[j+1]+a[j]/10;
a[j]=a[j]%10;
}
}
for(i=99;i>1;i--)
if(a[i]!=0)break;
for(;i>=1;i--)
cout<<a[i];
cout<<endl;
return 0;
}
|
25
|
12,489 |
/*??????????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
|
12,490 |
//
// ????? ??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
|
12,491 |
const int MAX_DIGIT = 10000;
int main()
{
int num[100];
num[0] = 1;
num[1] = 0;
int numDigits = 1;
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
int end = numDigits;
for (int i = 0; i < end; ++i)
{
num[i] *= 2;
}
for (int i = 0; i < end; ++i)
{
if (num[i] >= MAX_DIGIT)
{
if (i != numDigits - 1)
num[i+1] += num[i] / MAX_DIGIT;
else
{
num[numDigits] = num[i] / MAX_DIGIT;
++numDigits;
}
}
num[i] = num[i] % MAX_DIGIT;
}
}
for (int i = numDigits - 1; i >= 0; --i)
{
if (i != numDigits - 1)
cout << setfill('0') << setw(4);
cout << num[i];
}
cout << endl;
}
|
25
|
12,492 |
int main()
{
int a[40],b[40],c[40];
int n;
a[0]=1;
b[-1]=0;
c[0]=1;
for(int k=1;k<40;k++)
a[k]=0,c[k]=0;
cin>>n;
for(int j=0;j<n;j++)
{
for(int i=0;i<39;i++)
{
if(a[i]>=5)
b[i]=1;
else
b[i]=0;
a[i]=(2*a[i])%10+b[i-1];
if(a[i]!=0)
c[i]=1;
}
}
for(int l=39;l>=0;l-=1)
{
if(c[l]==1)
cout<<a[l];
}
}
|
25
|
12,493 |
int main()
{
int flag=0;
int k,i,j,sum[100001];
cin>>k;
memset(sum,0,sizeof(sum));
sum[0]=1;
for(i=0;i<k;i++)
{
for(j=0;j<=100000;j++)
{
sum[j] *= 2;
}
for(j=0;j<=100000;j++)
{
if(sum[j]>=10)
{
sum[j]-=10;
sum[j+1]+=1;
}
}
}
for(i=100000;i>=0;i--)
{
if(flag==0&&sum[i]==0)
continue;
else if(flag==0&&sum[i]!=0)
{
flag=1;
cout<<sum[i];
}
else
cout<<sum[i];
}
return 0;
}
|
25
|
12,494 |
/*************************
***??:??? 1200012776
***????:??2?N??
***??:2012?12?5?
*************************/
int length(int ch[]) //??length????????????
{
int i;
for (i = 199; i >= 0; i--)
{
if (ch[i] != 0)
break;
}
return (i + 1);
}
void multi(int ch[], int a) //?????????,??multi,ch1(??)???ch1 * a
{
int i, max = length(ch), t;
int ji[200] = {0};
for (i = 0; i <= max + 3; i++)
{
ji[i] = ch[i] * a;
ji[i + 1] += ch[i] * a;
}
for (i = 0; i <= max + 3; i++) //????ji??????
{
t = ji[i];
ji[i] = ji[i] % 10;
ji[i + 1] += t / 10;
}
for (i = 0; i <= max + 5; i++) //??????????ch
{
ch[i] = ji[i];
}
}
void pow(int p, int j, int chpow[]) //??a, b????,?chpow[]??(????)
{
int i;
if (j == 0)
{
chpow[0] = 1;
}
else
{
chpow[0] = 1;
for (i = 1; i <= j; i++)
{
multi(chpow, p);
}
}
}
int main()
{
int i, chpow[200] = {0}, end;
cin >> i;
pow(2, i, chpow);
end = length(chpow);
for (i = end - 1; i > -1; i--)
{
cout << chpow[i];
}
cout << endl;
return 0;
}
|
25
|
12,495 |
int main()
{
int i, j, n;
cin >> n;
if (n == 0)
{
cout << 1 << endl;
}
else
{
int num[51] = {0};
num[0] = 01;
for (i = 1; i <= n; i++)
{
for (j = 0; j < 50; j++)
{
num[j] = 2 * num[j];
}
for (j = 0; j < 50; j++)
{
if (num[j] >= 10)
{
num[j+1] += 1;
num[j] -= 10;
}
}
}
i = 50;
while (num[i] == 0)
{
i--;
}
for (; i >= 0; i--)
{
cout << num[i];
}
}
return 0;
}
|
25
|
12,496 |
int main()
{
int a[55];
memset(a,-1,55*sizeof(int));
int n;
cin>>n;
a[0]=1;
while(n>0)
{
int i,yu=0,ji=0;
for(i=0;;i++)
{
if(a[i]==-1){a[i]=a[i]+yu*2;break;}
else
{
ji=a[i]*2;
ji=ji+yu;
a[i]=ji%10;
if(ji>9)yu=1;
else yu=0;
}
}
n--;
}
int i=0;
while(a[i]!=-1)i++;
i--;
while(i>-1){cout<<a[i];i--;}
return 0;
}
|
25
|
12,497 |
char *mul(char *, char *);
int main()
{
char str1[100000] = "1", str2[100000];
int n, i;
int length = strlen(str2);
char *q = str1, *p = str2;;
cin >> n;
for (i = 0; i < n; i++)
{
q = str1;
p = mul(str1, str2);
p--;
for (; p >= str2; p--)
{
*q = *p;
q++;
}
}
cout << str1 << endl;
return 0;
}
char *mul(char *num, char *str2)
{
int length = strlen(num);
char *p, *q;;
p = num + length - 1;
q = str2;
int i, n = 0, m = 0, k = 0;
for (i = 0; i < length; i++)
{
n = *p - '0';
n = n * 2 + m;
k = n % 10;
m = n / 10;
*q = k + '0';
if (i != length - 1)
p--;
q++;
}
if (m != 0)
{
*q = m + '0';
q++;
}
*q = '\0';
return q;
}
|
25
|
12,498 |
//#include "stdafx.h"
int lena=0;
void cheng(int *a)
{
for (int i=0;i<lena;i++)
{
a[i]=a[i]*2;
}
for (int i=0;i<lena;i++)
{
a[i+1]+=a[i]/10;
a[i]=a[i]%10;
}
if (a[lena]>0) lena++;
//cout<<lena;
}
int main()
//int _tmain(int argc, _TCHAR* argv[])
{
int a[10000]={1};
int n;
lena=1;
cin>>n;
for (int i=0;i<n;i++)
cheng(a);
for (int i=lena-1;i>=0;i--)
cout<<a[i];
cout<<endl;
}
|
25
|
12,499 |
int main() {
int a[100],n,wei;
cin>>n;
for(int i=1;i<=99;i++)
a[i]=0;
a[0]=2;
if(n>=2) {
for(int i=1;i<n;i++) {
for(int j=0;j<=99;j++)
a[j]=2*a[j];
for(int j=0;j<=99;j++) {
if(a[j]>=10) {
a[j+1]++;
a[j]=a[j]-10;
}
}
}
for(int i=99;i>=0;i--) {
if(a[i]!=0) {
wei=i;
break;
}
}
for(int i=wei;i>=0;i--)
cout<<a[i];
}
else if(n==1)
cout<<"2";
else if(n==0)
cout<<"1";
return 0;
}
|
25
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.