id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
12,200 |
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
|
12,201 |
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
|
12,202 |
int main()
{
int k , i ,j ,len;
int str[100];
memset( str , 0 ,sizeof( str ) );
scanf("%d",&k);
str[0] = 2;
len =1;
for( i = 2 ;i <= k; i ++ )
{
for( j = 0 ; j < len ;j++ )
str[j] = str[j]*2;
for( j = 0 ;j < len ;j++ )
{
if( str[j] >= 10 )
{str[j]-=10;
str[j+1] += 1;
}
}
if( str[len] != 0 )
len ++;
}
if( k == 0 )printf("1");
else
{
for( i = len-1;i >= 0 ;i-- )
printf("%d",str[i]);
}
}
|
25
|
12,203 |
int main()
{
int num[101][100];
int i, j, n;
for (i = 0; i < 100; i ++)
for (j = 0; j < 101; j ++)
num[j][i] = 0;
num[0][0] = 1;
cin >> n;
for (i = 1; i <= n; i ++)
{
for (j = 0; j < 90; j ++)
{
num[i][j] += 2 * num[i - 1][j];
if (num[i][j] > 9)
{
num[i][j + 1] += num[i][j] / 10;
num[i][j] = num[i][j] % 10;
}
}
}
i = 90;
while (num[n][i] == 0)
i --;
for (j = i; j >= 0; j --)
cout << num[n][j];
cout << endl;
return 0;
}
|
25
|
12,204 |
/*
* 12.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
/*
* 13.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
char a[1000] ;
int b[1000] ;
void chen() ;
int main()
{
int n ,i,j;
cin >> n ;
a[0] = '1' ;
for (i = 1 ; i<1000 ;i++)
a[i] = '#' ;
if (n == 0)
cout << "1" ;
else
{ for (i = 1 ; i <= n ; i++)
chen() ;
for (i = 0 ; a[i] !='#' ; i++);
for(j = i - 1 ; j>=0 ;j--)
cout <<a[j] ;}
return 0 ;
}
void chen()
{
int carry = 0 ;
int i ;
for (i = 0 ;a[i]!= '#' ;i++)
{
b[i] =(a[i]-'0')* 2 + carry ;
carry = b[i] / 10 ;
b[i] = b[i] %10;
a[i] =b[i] + '0' ;
}
if (carry)
a[i] = carry + '0' ;
}
|
25
|
12,205 |
//**********************
//* 2.cpp
int main()
{
int a[35] = {0}, m, i, j, p = 0;
int b[35] = {0};
cin >> m;
a[34] = 1;
for (j = 1; j <= m; j++)
{
for (i = 34; i >= 1; i--)
{
b[i] = a[i] * 2 % 10 + b[i];
b[i - 1] = a[i] * 2 / 10 + b[i - 1];
}
for (i = 0; i <= 34; i++)
{
a[i] = b[i];
b[i] = 0;
}
}
for (i = 0; i <= 34; i++)
{
if (a[i] != 0)
p = 1;
if (p == 1)
cout << a[i];
}
return 0;
}
|
25
|
12,206 |
void compute (int x, int time);
char num[100];
int ad[100];
int N, len = 1;
int main()
{
int j, k;
cin >> N;
for (k = 0; k < 100; k++)
{
num[k] = '0';
ad[k] = 0;
}
if (N == 0)
{
cout << '1';
return 0;
}
num[0] = '2';
compute(1, N);
for (j = len - 1; j >= 0; j--) // ????
{
cout << num[j];
}
return 0;
}
void compute (int x, int time)
{
int i, number;
if (time == 1)
{
return;
}
else if (x == time) // ?x???????x + 1
{
return;
}
x++; // ?x??????????2^2
for (i = 0; i < len; i++)
{
if (num[i] != '0')
{
number = num[i] - '0'; // ?num[i]??i??????
number = number * 2;
if (number >= 10)
{
num[i] = number - 10 + '0';
ad[i + 1] = ad[i + 1] + 1;
}
else
{
num[i] = number + '0';
}
}
}
for (int s = 0; s < 100; s++)
{
num[s] = num[s] + ad[s];
}
while (num[len] != '0')
{
len++;
}
for (int r = 0; r < 100; r++)
{
ad[r] = 0;
}
compute(x, N);
}
|
25
|
12,207 |
int main()
{
int n,i,j,k;
int a[50]={1},b[50]={0};
cin>>n;
for(j=1;j<=n;j++)
{
for(i=0;i<=31;i++)
{
if(a[i]*2<10)
{
a[i]=a[i]*2+b[i];
b[i+1]=0;
}
else
{
a[i]=a[i]*2-10+b[i];
b[i+1]=1;
}
}
}
for(i=31;i>=0;i--)
{
if(a[i]!=0)
{
k=i;
break;
}
}
for(i=k;i>=0;i--)
cout<<a[i];
}
|
25
|
12,208 |
//******************************************************
/* ? ? ? ???2?n???????
/* ? ? ????
/* ? ? ? ??2010 ? 12 ? 15 ?
/* ? ? ? ????2?n???n????100?
/* ? ? ?1000012752
*******************************************************/
void chengfang(int result[],int n)
{
int i;
if(n==0) //????
return;
else
{
for(i=32 ; i>=0 ; i--)
{
result[i] = result[i] * 2; //???2
}
for(i=32 ; i>0 ; i--) //??
{
if(result[i] >= 10)
{
result[i-1] += result[i] / 10;
result[i] %= 10;
}
}
chengfang(result,n-1); //???????n=0???????n??
}
}
int main()
{
int result[33],*p;
int n;
cin >> n;
memset(result,0,sizeof(result));
result[32] = 1; //???????1
chengfang(result,n);
p = result; //????????0??
while(*p == 0) p++;
for( ; p<=result+32 ; p++) //???????
cout << *p;
return 0;
}
|
25
|
12,209 |
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
|
12,210 |
//***************************************************
//* name: 5.cpp *
//* author:?? *
//* date: 2013-11-16 *
//* description: ??2?N?? *
//***************************************************
int main ()
{
int n , i , j , num[100] ={0};
cin >>n ;
num[0] = 1 ;//?1???
for(i = 0 ; i < n ; i++)
{
for (j = 0 ; j < 100 ; j++)
num[j] = num[j] * 2 ;//
for (j = 0 ; j < 100 ; j++)
{
if(num[j] >= 10)
{
num [j]= num[j]-10;
num [j+1]++ ;
}
}
}
for(j = 99 ; j >= 0 ; j--)
{
if(num[j] == 0)
continue ;
break ;
}
while (j >= 0)
{
cout << num [j];
if(j % 50==0)
cout << endl;
j-- ;
}
return 0 ;
}
|
25
|
12,211 |
int main()
{
int str[31]={0};
int n,m=0,i,k =0,l;
cin >>n;
str[30] = 1;
for(i =0;i<n;i++)
for(int j =30;j>=0;j--)
{
l=2*str[j]+m;
str[j]= l%10;
m=l/10;
}
while(str[k]==0)
k++;
for(i =k;i<31;i++)
cout<<str[i];
cout<<endl;
return 0;
}
|
25
|
12,212 |
int main ()
{
unsigned long sum = 1;
int num[1000] = {0};
int n, i, k = 0, j;
cin >> n;
num[0] = 1;
if (n == 0)
cout << 1;
else
{
for (i = 0; i < n; i++)
{
k = 0;
while (num[k] != 0 || num[k + 1] != 0 || num[k + 2] != 0 || num[k + 3] != 0)
{
num[k] *= 2;
k++;
}
for (j = 0; j < k; j++)
{
if (num[j] >= 10)
{
num[j + 1] += num[j] / 10;
num[j] = num[j] % 10;
}
}
}
k = 40;
while (num[k] == 0) k--;
for (;k >= 0; k--)
cout << num[k];
}
return 0;
}
|
25
|
12,213 |
int main()
{
int n,i,j,num[40]={0},len=1,plus[40]={0};
num[1]=1;
cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=len+1;j++)
{
plus[j+1]=num[j]*2/10;
num[j]=(num[j]*2+plus[j])%10;
}
if(num[len+1]>0)
len++;
}
for(i=len;i>=1;i--)
cout<<num[i];
return 0;
}
|
25
|
12,214 |
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
|
12,215 |
int main(int argc, char* argv[])
{
double n,i,k=1;
scanf("%lf",&n);
if(n==0){
printf("1");
}else{
for(i=0;i<n;i++){
k=2*k;
}
printf("%.0lf",k);
}
return 0;
}
|
25
|
12,216 |
int main()
{
int N, i, j, t = 0, result[1000] = {0};
cin >> N;
result[0] = 1;
for (i = 0; i < N; i++)
{
result[0] = result[0] * 2;
for (j = 0; j < 100; j++)
{
if (result[j] > 9)
{
result[j + 1] = result[j + 1] * 2 + 1;
result[j] = result[j] - 10;
}
else
{
result[j + 1] = result[j + 1] * 2;
}
}
}
for (i = 90; i > 0; i--)
if(result[i] != 0)
{
t = i;
break;
}
for (i = t; i >= 0; i--)
cout << result[i];
return 0;
}
|
25
|
12,217 |
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
double sum=1;
for(int i=1;i<=n;i++)
{
sum=sum*2;
}
printf("%.lf",sum);
return 0;
}
|
25
|
12,218 |
//
// main.cpp
// ??2?N??
//
// Created by ? ?? on 12-12-10.
// Copyright (c) 2012? ? ??. All rights reserved.
//
int n, sum = 5;
char a[999999999];
char b[999999999];
int p = 0;
int l = 2;
void cheng(int m)
{
p = 0;
int i;
for (i = l; i >= 1; i--)
{
b[i] = ((a[i - 1] - '0') * 2 % 10 + p) % 10 + '0';
p = ((a[i - 1] - '0') * 2 + p) / 10;
}
b[0] = p + '0';
if (b[0] != '0') l++;
if (b[0] == '0')
for (i = 0; i < l; i++)
b[i] = b[i + 1];
strcpy(a, b);
if (sum < n)
cheng(sum++);
}
int main()
{
cin >> n;
if (n == 0) cout << 1;
if (n == 1) cout << 2;
if (n == 2) cout << 4;
if (n == 3) cout << 8;
if (n == 4) cout << 16;
a[0] = '1';a[1] = '6';
if (n > 4)
{
cheng(sum);
for (int i = 0; i < l; i++) cout << a[i];
}
return 0;
}
|
25
|
12,219 |
int main(){
int n,i,j,k=0,t;
int sum[100]={0};
sum[99]=1;
cin>>n;
for(i=1;i<=n;i++)
{
for(j=99;j>=0;j--)
{
t=sum[j]*2+k;
if(t<10)
{
sum[j]=t;
k=0;
}
else
{
sum[j]=t-10;
k=1;
}
}
}
for(i=0;sum[i]==0;i++)
;
for(j=i;j<=99;j++)
cout<<sum[j];
cout<<endl;
return 0;
}
|
25
|
12,220 |
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
|
12,221 |
/* ???:2?N??
???:1000012896 leo
??:2010.12.17
????:??2?N??
*/
int main()
{
int num[31]={0}, N, i, j, flag;
num[30] = 1;
cin >> N;
for (i = 1; i <= N; i++)
{
flag = 0;
for (j = 30; j >= 0; j--)
{
if (num[j] * 2 + flag >= 10)
{
num[j] = num[j] * 2 + flag - 10;
flag = 1;
}
else
{
num[j] = num[j] * 2 + flag;
flag = 0;
}
}
}
for (i = 0; i <= 30; i++)
if (num[i] != 0)
break;
for (; i <= 30; i++)
cout << num[i];
return 0;
}
|
25
|
12,222 |
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
|
12,223 |
/*
* final_07.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int sum[1000]={1};
int len=1;
void cheng(void){
int i=0;
for(i=0;i<len;i++)
sum[i]=sum[i]*2;
for(i=0;i<len-1;i++){
if(sum[i]>=10){
sum[i]=sum[i]-10;
sum[i+1]++;
}
}
if(sum[len-1]>=10){
sum[i]=sum[i]-10;
sum[i+1]++;
len++;
}
return;
}
int main(){
int n,i=0;
cin>>n;
for(i=0;i<n;i++)
cheng();
for(i=len-1;i>=0;i--)
cout<<sum[i];
return 0;
}
|
25
|
12,224 |
int main()
{
int N, i, j, count, flag;
char num[1000];
for (i = 0; i < 1000; i++)
{
num[i] = '0';
}
num[0] = '1';
cin >> N;
for (i = 1; i <= N; i++)
{
count = 999;
while (num[count] == '0')
count--;
count++;
j = 0;
flag = 0;
while (j <= count)
{
num[j] = 2 * num[j] - '0';
if (flag == 1)
{
num[j]++;
}
if (num[j] > '9')
{
num[j] -= 10;
flag = 1;
}
else flag = 0;
j++;
}
}
count = 100;
while (num[count] == '0')
count--;
for (i = count; i >= 0; i--)
{
cout << num[i];
}
cout << endl;
return 0;
}
|
25
|
12,225 |
int a[MAXN];
int n,i;
int main()
{
cin>>n;
a[0]=1;
while(n--)
{
for(i=0;i<MAXN;i++)
a[i]*=2;
for(i=0;i<MAXN-1;i++)
{
a[i+1]+=a[i]/10;
a[i]%=10;
}
}
for(i=MAXN-1;i>0&&a[i]==0;i--);//????? ?????????
for(;i>=0;i--)
cout<<a[i];
cout<<endl;
return 0;
}
|
25
|
12,226 |
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
|
12,227 |
char a[110]={0};
void temp()//????a??
{
int yushu=0;
for(int j=100;j>0;j--)
{
char c=a[j]+a[j]-'0'+yushu;
if(c<='9')
{
a[j]=c;
yushu=0;
}
else
{
a[j]=c-10;
yushu=1;
}
}
}
int main()
{
int n;
cin>>n;
for(int i=0;i<110;i++)
{
a[i]='0';
}
a[100]='1';
for(int i=0;i<n;i++)//??n???
{
temp();
}
int x=0;
for(int i=0;i<110;i++)//?????
{
if(a[i]!='0')
{
x=i;
break;
}
}
for(int i=x;i<101;i++)//??
{
cout<<a[i];
}
return 0;
}
|
25
|
12,228 |
/*
* 3.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main(){
int n,m;
cin>>n;
int i,carry=0,lenx=1;
int y[405]={0};
int x[405]={0};
x[0]=1;
for(m=1;m<=n;m++)
{
carry=0;
for(i=0;i<lenx;i++)
y[i]=0;
for(i=0;i<lenx;i++){
if(x[i]*2>=10){
y[i]=x[i]*2-10+carry;
carry=1;
}
else{
y[i]=x[i]*2+carry;
carry=0;
}
}
if(carry==1){
y[lenx]=1;
lenx++;
}
for(i=0;i<lenx;i++)
x[i]=y[i];
}
if(n==0)
cout<<'1';
else
for(m=lenx-1;m>=0;m--)
cout<<y[m];
return 0;
}
|
25
|
12,229 |
int main()
{
int N;
cin>>N;
int a[40],b[40];
a[0]=1,b[0]=1;
for (int i=1;i<40;i++)
a[i]=0,b[i]=0;
for (int i=0;i<N;i++)
{
for (int k=0;k<39;k++)
{
a[k]=a[k]*2;
}
for (int k=0;k<39;k++)
b[k]=a[k];
for (int k=0;k<39;k++)
if (b[k]>=10)
{
b[k+1]++;
b[k]=b[k]-10;
}
for (int k=0;k<39;k++)
a[k]=b[k];
}
int m;
for (int i=39;i>=0;i--)
if (b[i]!=0)
{
m=i;
break;
}
for (int i=m;i>=0;i--)
cout<<b[i];
return 0;
}
|
25
|
12,230 |
/*?????????????N(N<=100)???2?N?????
*????: 2012-12-10
*??: ??
*/
int main() {
int N, i, j, res[40] = { 1 }, len = 1;
cin >> N;
for (i = 0; i < N; i++) {
for (j = 0; j < len; j++) {
res[j] = res[j] * 2 + res[len];
if (res[j] > 9) {
res[j] -= 10;
res[len] = 1;
}
else
res[len] = 0;
}
if (res[len])
len++;
}
for (i = len - 1; i >= 0; i--)
cout << res[i];
return 0;
}
|
25
|
12,231 |
int main()
{
int n, i, j, m, l, k;
char s[300];
cin >> n;
s[0] = '1';
k = 1;
for(i = 0; i < n; i++)
{
l = 0;
for(j = 0; j < k; j++)
{
m = s[j] - '0';
m = 2 * m + l;
l = m / 10;
m = m % 10;
s[j] = m + '0';
}
if(l != 0)
{
s[j] = l + '0';
k++;
}
}
for(i = k - 1; i >= 0; i--)
cout << s[i];
return 0;
}
|
25
|
12,232 |
int main()
{
int n,i,j;
int a[100]={0};
scanf("%d",&n);
a[0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<100;j++)
a[j]=a[j]*2;
for(j=0;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>=0;i--)
if(a[i]!=0) break;
for(j=i;j>=0;j--)
printf("%d",a[j]);
return 0;
}
|
25
|
12,233 |
int main()
{
int m[100] = {0};
m[0] = 2;
int N,i,j,temp = 0,t = 0,count = 0;
cin >> N;
if(N == 0)
cout << 1 << endl;
else
{
for(i = 1 ; i < N ; i++)
{
for(j = 0 ; j <= count + 1 ; j++)
{
t = m[j] * 2 + temp;
temp = t / 10;
m[j] = t % 10;
}
for(j = 100 ; j >= 0 ; j--)
{
if(m[j]==0 && m[j-1] != 0)
{
count = j;
break;
}
}
}
for(i = 99 ; m[i] == 0 ; i--);
for(j = i ; j >= 0 ; j--)
{
cout << m[j];
}
}
return 0;
}
|
25
|
12,234 |
int num[40]={0};
int jinwei[40]={0};
void square() //?2
{
for (int i=39;i>0;i--)
{
int a=num[i]*2;
jinwei[i-1]=a/10;
num[i]=a%10+jinwei[i];
}
}
int main ()
{
num[39]=1; //???2?0??=1
int n;
cin>>n;
for (int i=0;i<n;i++) //?n?2
square();
int head;
for (int i=0;i<40;i++)
if (num[i]!=0)
{
head=i;
break;
}
for (int i=head;i<40;i++)
cout<<num[i];
return 0;
}
|
25
|
12,235 |
int main()
{
int n, i , k, te, a[100], yu=0, io=0;
cin >> n;
memset(a, 0 , sizeof(a));
a[0] = 1;
if(n==0)
cout << a[0] << endl;
else
{
for(i = 1; i <= n; i++)
for(k = 0; k < 100; k++)
{
io = yu; //io?????, yu????
te = a[k] * 2;
if(te > 9)
{
yu = 1;
a[k] = te - 10 + io;
}
else
{
a[k] = te + io;
yu = 0;
}
}
for(k = 99; a[k] == 0; k--);
for(i = k; i >= 0; i--)
cout << a[i] ;
}
return 0;
}
|
25
|
12,236 |
int num[200]={0};
int len=0;
int plusbig()
{
int i;
for (i=0;i<len;i++)num[i]+=num[i];
for (i=0;i<len-1;i++)
{
if(num[i]>=10)
{
num[i+1]++;
num[i]=num[i]%10;
}
}
if(num[len-1]>=10)
{
num[len-1]=num[len-1]%10;
num[len]=1;
len++;
}
return 0;
}
int main()
{
int i,n;
cin>>n;
len=1;
num[0]=1;
for(i=0;i<n;i++) plusbig();
for(i=len-1;i>=0;i--)cout<<num[i];
return 0;
}
|
25
|
12,237 |
int main()
{
int N,i,j,b;
int a[100]={0};
scanf("%d",&N);
a[0]=1;
for(i=0;i<N;i++)
{
for(j=0;j<100;j++)
{
a[j]*=2;
}
for(j=0;j<100;j++)
{
if(a[j]>9)
{
a[j+1]++;
a[j]%=10;
}
}
}
for(j=99;j>=0;j--)
{
if(a[j]!=0)
{
b=j;
break;
}
}
for(j=b;j>=0;j--)
{
printf("%d",a[j]);
}
return 0;
}
|
25
|
12,238 |
int main()
{
const int max = 200;
int result[max+1];
memset(result, 0, sizeof(result));
int n, i, j;
cin >> n;
int size=1;
result[0]= 1;
int c = 0;
for (i=0;i<n;i++)
{
for (j=0;j < size;j++)
{
result[j] = result[j] * 2 + c ;//??????????????
if (result[j] >= 10)
{
result[j] -= 10;
c = 1;
if (j == size-1)
{
size++;
}
}
else
{
c=0;
}
}
}
i=max;
while (result[i] == 0)
{
i--;
}
for (;i>=0;i--)
{
cout << result[i] ;
}
cout << endl;
return 0;
}
|
25
|
12,239 |
int main()
{
int N,i,j;
int b[100]={1,0},jin[100]={0},liu[100]={0};
cin>>N;
if(N==0)
cout<<'1'<<endl;//0???1
else{
for(i=0;i<N;i++)//??? N ?2
{
for(j=0;j<100;j++)
b[j]=b[j]*2;
for(j=0;j<100;j++)
if(b[j]>=10)
{
b[j+1]=b[j+1]+b[j]/10;
b[j]=b[j]%10;
}
}
for(i=99;i>=0;i--)
if(b[i]!=0)break;
for(j=i;j>=0;j--)//??
cout<<b[j];
}
return 0;
}
|
25
|
12,240 |
//********************************
//*?????2?N?? **
//*????? 1300012845 **
//*???2013.11.15 **
//********************************
int main ()
{
int n, i, p, j, k;
int flag = 0;
int num[51]= {0};
cin >> n;
num[1] = 1;
flag = 0;
if ( n==1 )//n==1?????
{
cout << "2" ;
return 0;
}
for ( i = 1; i <= n; i++ )
{
for ( j=1; j <= 40; j++ )
num [j] = num[j] * 2;//????*2
for ( k = 2; k <=50; k++ )
{
num[k]+= num[k-1]/10;//??
num[k-1] = num[k-1] % 10;//???????10
}
}
for ( j = 50; j >= 1; j-- )
{
if ( num[j] != 0)//???0???2?n??????0
flag = 1;
if ( flag == 1 )
cout << num[j] ;//??
}
cout<< endl;
return 0;
}
|
25
|
12,241 |
int main()
{
int n , i , j;
int start;
cin >> n;
int num[101] = {0}; //??num????????
num[100] = 1;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= 100; j++)//?????????2
{
num[j] = num[j] * 2;
}
for(j = 1; j <= 100; j++)//????10??????????-10
{
if(num[j] >= 10)
{
num[j] = num[j] - 10;
num[j - 1]++;
}
}
}
//?????????
for(i = 1; ; i++)
{
if(num[i] != 0)
{
start = i;
break;
}
}
// ????
for(i = start; i <= 100; i++)
cout << num[i];
return 0;
}
|
25
|
12,242 |
int main()
{
double m = 1;
int n, i;
cin >> n;
for (i = 1; i <= n; i++)
m = m * 2;
cout << setprecision(0) << fixed;
cout << m;
}
|
25
|
12,243 |
//********************************
//*?????(11-12) ??2?N?? **
//*?????? 1300012745 **
//*???2013.11.19 **
//********************************
int main()
{
int num[100] = {0}, N, i, j, wei = 1;
cin >> N;
if (N == 0)
cout << 1;
if (N == 1)
cout <<2;
if (N > 1)
{
num[0] = 2;
for (i = 2; i <= N; i++)
{
for (j = 0; j <= 99; j++)
{
num[j]*=2;
}
for (j = 0; j <= 99; j++)
{
if (num[j] >= 10)
{
num[j]-=10;
num[j + 1]++;
}
}
}
j = 99;
while (num[j] == 0)
j--;
for (i = j; i >= 0; i--)
cout <<num[i];
}
return 0;
}
|
25
|
12,244 |
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
|
12,245 |
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
|
12,246 |
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
|
12,247 |
void once(int a[1000])
{
for(int i=0;i<=999;i++)
a[i]*=2;
for(int i=0;i<=999-1;i++)
{
if(a[i]>=10)
{
a[i+1]=a[i]/10+a[i+1];
a[i]=a[i]%10;
}
}
}
int main()
{
int a[1000]={0};
a[0]=1;
int n;
cin>>n;
for(;n>=1;n--)
once(a);
int end;
for(int i=999;i>=0;i--)
if(a[i]!=0){end=i;break;}
for(int i=end;i>=0;i--)
cout<<a[i];
cout<<endl;
}
|
25
|
12,248 |
int main()
{
int n,i,j;
cin >>n;
int re[100]={0};
re[0]=1;
for (i=0;i<n;i++)
{
for (j=0;j<100;j++)
{
re[j]=re[j]*2;
}
for (j=0;j<100;j++)
{
if (re[j]>=10)
{
re[j+1]+=re[j]/10;
re[j]=re[j]%10;
}
}
}
for (i=50;i>=0;i--)
{
if (re[i]!=0)
{
j=i+1;
break;
}
}
while (j--)
{
cout <<re[j];
}
return 0;
}
|
25
|
12,249 |
/**
????5.cpp
? ?????
? ??11.16
? ????2?N??
*/
int main()
{
int N, i, j ,flag = 0;
int ans[32] = {0}; // ???2^100?31???????????32
ans[31] = 1;
cin >> N;
if(N == 0)
cout << "1" << endl;
else
{
for(i = 0 ; i < N ; i++)
{
for(j = 31 ; j >= 0 ; j--)
{
ans[j] = 2 * ans[j] + flag;
if(ans[j] >= 10)
{
ans[j] -= 10;
flag = 1;
}
else
flag = 0;
}
}
i = 0;
while(ans[i] == 0)
i++;
for(; i < 32 ; i++)
cout << ans[i];
cout << endl;
}
return 0;
}
|
25
|
12,250 |
/**
* @file ??2?N?? .cpp
* @author ???
* @date 2013-11-16
* @description
* ??????: ??2?N??
*/
int main()
{
int N;
double a[500]={0};
cin>>N;
a[0]=1;
for(int i=1;i<=N;i++)
{
for(int j=0;;j++)
{
if(a[j]==0&&a[j+1]==0&&a[j+2]==0)
break;
a[j]=a[j]*2;
if(a[j]>=10)
{
a[j]=a[j]-10;
a[j+1]=a[j+1]+0.5;
}
}
}
for(int i=499;i>=0;i--)
{
if(a[i]!=0)
{
for(int j=i;j>=0;j--)
cout<<a[j];
break;
}
}
return 0;
}
|
25
|
12,251 |
// *********************************
// **** file ??2?N??.cpp ****
// **** ID:1000012895 ****
// **** Author ??? ****
// **** 2010/12/15 ****
// *********************************
int main()
{
int i, j, n, num[40], *p = NULL; // num???????????????num[0]????????
memset(num,0,160); // ??num???
num[0] = 1; // ????????????000
01?????
cin >> n;
for(i = 0; i < n; i++)
{
for(j = 0; j < 40; j++) // ??????
num[j] *= 2;
for(j = 0; j < 40; j++) // ????
{
if(num[j] > 9)
{
num[j+1]++;
num[j] -= 10;
}
}
}
p = num + 38; // ????????
while(*(--p) == 0); // ???????????????
while(p >= num) // ????????????????
{
cout << *p;
p--;
}
cout << endl;
return 0;
}
|
25
|
12,252 |
void add(int []);
int main()
{
int n, a[100] = {0}, i, j;
a[0] = 1;
cin >> n;
for(i = 0; i < n; i++)
add(a);
i = 99;
while(a[i] == 0)
i--;
for(j = i; j >= 0; j--)
cout << a[j];
cout << endl;
return 0;
}
void add(int a[])
{
int i = 99, j;
while(a[i] != 0)
i--;
for(j = i; j >= 0; j--)
{
a[j] = 2 * a[j];
if(a[j] >= 10)
{
a[j + 1]++;
a[j] -= 10;
}
}
}
|
25
|
12,253 |
int main()
{
int a[1000], i, num, N;
cin >> N;
for(i = 0; i < 999; i++)
a[i] = 0;
a[999] = 1;
for(; N > 0; N--)
{
for(i = 999, num = 0; i > 0; i--)
{
num = a[i] * 2 + num/ 10;
a[i] = num % 10;
}
}
for(i = 0; a[i] == 0; i++);
for(; i < 1000; i++)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12,254 |
//********************************
//*????5.cpp **
//*?????? 1300012966 **
//*???2013.11.14 **
//*?????2?N?? **
//********************************
int main()
{
int N, i, j, a[32] = {1}, b[32];
cin >> N;
for (i = 1; i <= N; i++)
{
for (j = 0; j < 32; j++)
{
b[j] = a[j] * 2;
}
a[0] = b[0] % 10;
for (j = 1; j < 32; j++)
{
a[j] = b[j] % 10 + b[j - 1] / 10;
}
}
j = 31;
while (a[j] == 0)
{
j--;
}
for (i = j; i >= 0; i--)
{
cout << a[i];
}
return 0;
}
|
25
|
12,255 |
//*************************************
//*???Nov 13, 2013 - ??2?N?? **
//*?????? 1300012719 **
//*???2013.11.16 **
//*************************************
int main()
{
int i, j, len, N, num[40] = {0}; //N???,??[num]????????????,??2^100<8^34<10^34,??????????35?
num[0] = 1; //??????????,??????????1
cin >> N; //????N
for (i = 1; i <= N; i++)
{
for (j = 0; j < 40; j++) //????,???????2
num[j] = 2 * num[j];
for (j = 0; j < 40; j++)
{
num[j + 1] = num[j + 1] + (num[j] - num[j] % 10) / 10;
num[j] = num[j] % 10; //??????????,???????????????
} //????????????????+???"0"
}
for (i = 39; i >= 0; i--)
{
if (num[i])
{
len = i; //????????????0???
break;
}
}
for (i = len; i >= 0; i--) //??????????????????
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12,256 |
/* title: */
/* author: ??? */
/* time: 2011.12.31*/
int main()
{
int n;
cin >> n;
int a[101] = {0};
int b[101] = {0};
int i, j;
a[100] = 1;
for(i = 0; i < n; i++)
{
for(j = 100; j > 0; j--)
{
a[j] = 2 * a[j] + b[j];
if(a[j] >= 10)
{
a[j] = a[j] - 10;
b[j - 1] = b[j - 1] + 1;
}
}
for(j = 0; j <= 100; j++)
b[j] = 0;
}
i = 0;
while(a[i] == 0)
i++;
for(j = i; j <= 100; j++)
cout << a[j];
cout << endl;
return 0;
}
|
25
|
12,257 |
int main()
{
int num[200];
int start;
int i , j , k;
int n;
for(i = 0 ; i < 199 ; i++)
num[i] = 0;
num[199] = 1;
cin >> n;
for(i = 1 ; i <= n ; i++)
{
for(j = 0 ; j < 200; j++)
{
num[j] = num[j] * 2;
for(k = 1 ; k < 200; k++)
{
if(num[k] >= 10)
{
num[k] = num[k] - 10;
num[k-1]++;
}
}
}
}
for(i = 0 ; i < 200 ; i++)
{
if(num[i] != 0)
{
start = i;
break;
}
}
for(i = start ; i < 200 ; i++)
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12,258 |
int n;
int num=0;
int a[40]={0};
int b[40]={0};
int c[40]={0};
void calculate()
{
int i;
memset(b,0,sizeof(b));
for(i=0;i<40;i++){
b[i]=b[i]+(a[i]*2)%10;
b[i+1]=(a[i]*2)/10+b[i+1];}
for(i=0;i<40;i++)
a[i]=b[i];
}
int main()
{
cin>>n;
int i=0,l=0;a[0]=1;
for(i=0;i<=n-1;i++)
calculate();
for(i=39;a[i]==0;i--)
l=i;
for(i=l-1;i>=0;i--)
cout<<a[i];
return 0;
}
|
25
|
12,259 |
/**
*file:1000012776_4.cpp
*author:???
*date?2010-12-18
*discription?????12-15????2?n???
*/
void ride2( char * ) ;//???????2?
void antitone( char * ) ;//?????????
void ride2( char * p )
{
int i , temp = 0 , num ;
for ( i = 0 ; ; i++ )
{
if ( *( p + i ) == '\0' )
{
if ( temp != 0 )
*( p + i ) = temp + '0' ;
break ;
}
num = ( *( p + i ) - '0' ) * 2 + temp ;
* ( p + i ) = num % 10 + '0' ;
temp = num / 10 ;
}
}
void antitone( char * p )
{
int i = 0 , j = 0 ;
char q[100] ;
while ( *( p + (i++) )!= '\0' ) ;
i-- ;
while ( i >= 0 )
*( q + j++ ) = *( p + --i ) ;
i = 0 ;
while ( *( p + i ) != '\0' )
{
*( p + i ) = *( q + i++ ) ;
}
}
int main ()
{
char num[100] = "1" ;
int i , power ;
cin >> power ;
for ( i = 0 ; i < power ; i++ )
{
ride2( num ) ;
}
antitone( num ) ;
cout << num << endl ;
return 0 ;
}
|
25
|
12,260 |
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
|
12,261 |
/**
* @file 4.cpp
* @author ??? 1300012960
* @date 2013-11-01
* @description
* ??????: ???? */
int main()
{
int n[31], m, flag; // lg2 = 0.3010 ?????2^100?31? m???? flag????????0
cin >> m;
for (int i = 0; i < 30; i++) n[i] = 0; // ????????0
n[30] = 1; // ???? 2^0 = 1
for (int i = 0; i < m; i++)
{
for (int j = 30; j >= 0; j--)
{
n[j] *= 2; // ????????????*2
}
for (int j = 30; j > 0; j--)
{
if (n[j] >= 10)
{
n[j - 1] += n[j] / 10; // ??????????
n[j] %= 10;
}
}
}
for (int i = 0; i < 31; i++)
{
if (n[i] > 0)
{
flag = i; // ????????
break;
}
}
for (int i = flag; i < 31; i++) cout << n[i]; // ????
return 0;
}
|
25
|
12,262 |
//??(11-12) ??2?N?? ??? 20121231
int A[1000]={1};
void m2(int n)
{
int d=0;
for(int i=0;i<=n;i++)
{
A[i]=A[i]*2+d;
d=A[i]/10;
A[i]%=10;
}
return;
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++) m2(i);
int i=999;
while(A[i]==0) i--;
while(i>=0) cout<<A[i],i--;
return 0;
}
|
25
|
12,263 |
int main()
{
int n=0,d=0,i=0,j;
int a[1000]={0};
memset(a,0,sizeof(a));
cin>>n;
int p=1;
a[1]=1;
for(i=1;i<=n;i++)
{
d=0;
for(j=1;j<=p;j++)
{
a[j]=d+a[j]*2;d=d-d;
if(a[j]>=10)
{
a[j]=a[j]-10;d=1;
}
}
a[p+1]=d+a[p+1];
if(a[p+1]!=0)
{p=p+1;}
}
i=999;
for(;i>=0;i--)
{
if(a[i]!=0)
{p=i;break;}
}
for(i=p;i>=1;i--)
cout<<a[i];
return 0;
}
|
25
|
12,264 |
int main()
{
int n;
int t=1,sig;
int num;
int s=0;
cin>>n;
char a[110];
for(int i=1;i<=109;i++)
a[i]='*';
a[1]='2';
if(n==0)
cout<<1<<endl;
else if(n==1)
cout<<2<<endl;
else if(n!=0&&n!=1)
{
for(int i=1;i<=n-1;i++)
{
sig=t;
for(int j=1;j<=sig;j++)
{
num=a[j]-48;
num=2*num+s;
s=0;
if(num<10)
a[j]=num+48;
else
{
a[j]=num+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,265 |
//*****************************************
//* ?????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
|
12,266 |
int main()
{
int n, temp = 0;
int power[32] = {0,1};
cin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j < 32; j++)
{
power[j] *= 2;
power[j] += temp;
if(power[j] >= 10)
{
power[j] -= 10;
temp = 1;
}
else
temp = 0;
}
}
int i = 31;
while(power[i] == 0)
i--;
for(int j = i; j >= 1; j--)
cout << power[j];
cout << endl;
return 0;
}
|
25
|
12,267 |
int main()
{
int n,t,i,j;
int a[200],b[200],length=1;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
a[0]=2;
cin>>n;
if(n==0) cout<<1;
else
{
for(t=1;t<n;t++)
{
for(i=0;i<=length-1;i++)
{
b[i]=a[i]*2+b[i];
if(b[i]>=10)
{ b[i+1]=b[i+1]+1; b[i]=b[i]-10;}
}
for(i=199;i>=0;i++)
if(b[i]!=0)
{length=i;break;}
for(i=0;i<=199;i++)
{a[i]=b[i];b[i]=0;}
}
for(i=199;i>=0;i--)
if(a[i]>0)
break;
for(j=i;j>=0;j--)
cout<<a[j];}
return 0;
}
|
25
|
12,268 |
void play(int a[100],int b[100]);
int end[100]={0};
int main()
{
int a[100]={0},N,i=0,j=0;
cin>>N;
a[1]=2;
if(N==0){cout<<"1";return 0;}
else
{
for(i=0;i<N-1;i++)
{
play(a,a);
for(j=0;j<100;j++)
{a[j]=end[j];}
}
}
for(i=99;i>=0;i--)
{if(a[i]!=0)break;}
for(j=i;j>0;j--)
{cout<<a[j];}
return 0;
}
void play(int a[],int b[])
{
int p,f[100]={0},i=0;
for(i=0;i<100;i++)
{
if(a[i]+b[i]+f[i]>=10)
{
end[i]=(a[i]+b[i]+f[i])-10;
f[i+1]++;
}
else
{
end[i]=a[i]+b[i]+f[i];
}
}
}
|
25
|
12,269 |
int main()
{
int n,i,k,p,num,len;
char s[35]={'0'};
for(i=0;i<35;i++)
s[i]='0';
s[0]='2';
k=0;
cin>>n;
if(n==0)//0?????
cout<<"1";
else//?0??
{
for(i=1;i<n;i++)
{
p=0;
for(k=32;k>=0;k--)
{
if(s[k]!='0')
{
len=k;break;
}
}
for(k=0;k<=len+1;k++)//????????? p????
{
num=(s[k]-'0')*2;
s[k]=num%10+'0'+p;
p=num/10;
}
}
for(i=32;i>=0;i--)//????????
{
if(s[i]!='0')
{
len=i;break;
}
}
for(i=len;i>=0;i--)
cout<<s[i];
}
return 0;
}
|
25
|
12,270 |
int main()
{
int num[1000] = {0}, up, add, i, k, n;
cin >> n;
num[0] = 1;
if (n == 0)
{
cout << 1;
return 0;
}
up = 0;
while (n > 0)
{
add = 0;
for (i = 0; i <= up; i++)
{
k = (num[i] * 2 + add) / 10;
num[i] = (num[i] * 2 + add) % 10;
add = k;
}
if (add != 0)
num[++up] = add;
n--;
}
for (i = up; i >= 0; i--)
cout << num[i];
return 0;
}
|
25
|
12,271 |
int main()
{
int a[101]={0},k=1,i,n,j,r=0;
scanf("%d",&n);
a[0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<k;j++)
{
a[j]=a[j]*2+r;
if(a[j]>9)
{
r=a[j]/10;
a[j]=a[j]%10;
if(j+1==k)
k++;
}
else r=0;
}
}
if(r)
a[k]=r;
for(i=k-1;i>=0;i--)
printf("%d",a[i]);
return 0;
}
|
25
|
12,272 |
int main()
{
int N,i,j;
int a[100] = {0};
a[99] = 1;
cin >> N;
for ( i = 0 ; i < N; i ++)
{
for (j = 99; j >= 0; j --)
{
a[j] = a[j] * 2;
}
for ( j = 99; j >= 0; j --)
{
if (a[j] >= 10)
{
a[j-1] = a[j-1] + 1;
a[j] = a[j] % 10;
}
}
}
int b = 0;
for (i = 0; i < 100; i ++)
{
if (!(a[i] == 0 && b == 0))
{
b ++;
cout << a[i];
}
}
cout << endl;
}
|
25
|
12,273 |
//********************************
//*?????2?N?? **
//*?????? 1300012946 **
//*???2013.11.15 **
//********************************
int main()
{
int n,i,j,a[32]={1};
cin>>n;
for (i=0 ; i<n ; i++)
{
for (j=0 ; j<32 ; j++)
{
a[j] = 2 * a[j];
}
for (j=0 ; j<32 ; j++)
{
if (a[j]>9)
{
a[j] -= 10;
a[j+1]++;
}
}
}
j=31;
while (a[j]==0)
j--;
for ( ; j>=0 ; j--)
{
cout<<a[j];
}
return 0;
}
|
25
|
12,274 |
int main()
{
int n,a[100]={0};
cin >> n;
if(n==0)
cout<<1;
else
{
a[0]=2;
for(int i=1;i<n;i++)
{
for(int j=0;j<100;j++)
a[j] *= 2;
for(int j=0;j<100;j++)
if(a[j] >= 10)
{
a[j+1] +=1;
a[j] %= 10;
}
}
int k=99;
while(a[k] == 0)
k--;
while(k>=0)
cout<<a[k--];
}
return 0;
}
|
25
|
12,275 |
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
|
12,276 |
int main()
{
int i,k,j,al=1,N,zhong;
int a[200]={4,2,0,1};
int b[200]={0};
cin>>N;
if(N<=10)
{for(i=1;i<=N;i++)
al=al*2;
cout<<al<<endl;
;return 0;}
for(i=1;i<=N-10;i++)
{
zhong=0;
for(j=0;j<=199;j++)
{
b[j]=(a[j]*2)%10+zhong;
zhong=(a[j]*2)/10;
}
for(j=0;j<=199;j++)
a[j]=b[j];
}
for(i=199;b[i]==0;i--);
for(j=i;j>=0;j--)
cout<<b[j];
cout<<endl;
return 0;
}
|
25
|
12,277 |
int main()
{
int m,n,i;
double s=1;
scanf("%d",&n);
if(n==0){printf("1");}
else
{
for(i=1;i<=n;i++)
{
s*=2;
}
printf("%.0f",s);
}
return 0;
}
|
25
|
12,278 |
int main()
{
int n,i,j,k = 0,flag = 0;
int num[1000]={0};
cin >> n ;
num[0] = 1;
for (i = 1; i <= n; i ++)
{
for (j = 0 ; j <= k; j ++)
{
num[j] = num[j] * 2 + flag;
flag = 0;
if (num[j] >= 10)
{
num[j] = num[j] - 10;
flag = 1;
}
}
if (flag == 1)
{
k ++;
num[k] = 1;
flag = 0 ;
}
}
for ( i = k ; i >=0 ; i -- )
cout << num[i];
return 0;
}
|
25
|
12,279 |
/*
??2?N??
Author:??
Number:1000012913
Date: 2010-12-15
*/
//?g_ans[i]?char???int
//?int???char
//??????????????
char g_ans[1000];
int main()
{
//??????????
int n;
cin >> n;
//????????????1
memset(g_ans, 0,sizeof(g_ans));
g_ans[0] = '1';
//n??????,i?????
int n_len, i;
//n??2
while (n--)
{
//?????????????????2
n_len = strlen(g_ans);
for (i = 0; i != n_len; i++)
g_ans[i] = itoc(ctoi(i) * 2);
//??????
for (i = 0; i != n_len; i++)
//?????
if (g_ans[i] > '9')
{
//?????10
g_ans[i] -= 10;
//?????????????????
if (g_ans[i + 1])
//????1
g_ans[i + 1]++;
//??????????????0????'\0'?
//????????1
else
g_ans[i + 1] = '1';
}
}
//???????????????????????
char *pt = &g_ans[strlen(g_ans) - 1];
while (pt != &g_ans[-1])
cout.put(*pt--);
cout << endl;
return 0;
}
|
25
|
12,280 |
int a[200] = {0};
void f(int n)
{
int i, m = 100, temp = 0;
while (a[m] == 0)
m--;
if (n == 0)
{
for (i = m; i >= 1; i--)
cout << a[i];
cout << endl;
return;
}
for (i = 1; i <= m; i++)
{
a[i] = a[i] * 2 + temp;
temp = 0;
if (a[i] >= 10)
{
temp = a[i] / 10;
a[i] = a[i] - 10;
}
}
if (temp != 0)
a[m + 1] = temp;
f(n - 1);
}
int main()
{
int n;
cin >> n;
a[1] = 1;
f(n);
return 0;
}
|
25
|
12,281 |
int main()
{
int N;
cin>>N;
int a[500]={0};
int b[500]={0};
if(N==0)cout<<"1";
else
{
a[0]=2;
for(int i = 0 ; i < N-1 ; i++)
{
for(int j = 0 ; j < 500 ; j++)
{
if((a[j]*2)<10)a[j]=a[j]*2;
else
{
a[j]=(a[j]*2)%10;
b[j+1]=1;
}
}
for(int j = 0 ; j < 500 ; j++)a[j]=a[j]+b[j],b[j]=0;
}
int flag=0;
for(int i = 499 ; i >= 0 ; i--)
{
if(a[i]!=0 || flag==1)
{
flag=1;
cout<<a[i];
}
}
}
return 0;
}
|
25
|
12,282 |
int main()
{
int n,i,j,t;
int a[100],b[100];
cin>>n;
for(i=0;i<100;i++)
{
a[i]=0;
b[i]=0;
}
a[0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<99;j++)
{
b[j+1]=(a[j]*2)/10;
a[j]=(a[j]*2)%10+b[j];
b[j]=0;
}
}
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,283 |
void main()
{
char a[105]={"1"},temp;
int s,b[105],i,j,k;
scanf("%d",&s);
while(s--){
for(i=0;a[i]!=0;i++){
b[i]=(a[i]-'0')*2;
}
for(j=0;j<i;j++){
if(j==i-1&&b[j]>=10){
b[j]-=10;
b[j+1]=1;
i++;
break;
}
if(b[j]>=10){
b[j]-=10;
b[j+1]++;
}
}
for(j=0;j<i;j++)a[j]=b[j]+'0';
a[j]=0;
}
for(j=0,k=i-1;j<k;j++,k--){
temp=a[j];
a[j]=a[k];
a[k]=temp;
}
puts(a);
}
|
25
|
12,284 |
void cheng (char *a)
{
int t,w[100]={0},i,k,j=0,s=0;
t=strlen(a);
for(i=t-1;i>=0;i--)
{
w[j]=a[i]-'0';
w[j]=2*w[j];
j++;
}
for(i=0;i<=t-1;i++)
{
w[i+1]=w[i]/10+w[i+1];
w[i]=w[i]%10;
}
j=90;
while(w[j]==0)j--;
for(i=j;i>=0;i--)
{
a[s]=w[i]+'0';
s++;
}
}
int main()
{
int n,i,s;
char a[100]={'1'};
cin>>n;
for(i=1;i<=n;i++)
{
cheng(a);
}
s=strlen(a);
for(i=0;i<=s-1;i++)
{
cout<<a[i];
}
return 0;
}
|
25
|
12,285 |
//*****************************
//*?????? 1300012809 **
//*???2013.11.16 **
//*?????2?N?? **
//*****************************
int main()
{
int n, i, j, changdu;
changdu = 1;
int a[1005] = {0}, jieguo[1005] = {0};
cin >> n;
for (i = 0; i <= n; i++)
{
if (i == 0) a[0] = 1;
if (i == 1) a[0] = 2;
if (i != 0 && i != 1)
{
if (a[changdu-1] >= 5 ) changdu += 1;
for (j = 0; j < changdu; j++)
{
a[j] = a[j]*2;
}
for (j = 0; j < changdu; j++)
{
a[j+1] = a[j] / 10 + a[j+1];
a[j] = a[j] % 10 ;
}
}
}
for (j = changdu-1; j >= 0; j--) cout << a[j];
cout << endl;
return 0;
}
|
25
|
12,286 |
int main()
{
const int MAX_LEN = 1000;
int n,i,j;
cin >> n;
int num[MAX_LEN]={0};
num[0]=1;
for (i=0;i<n;i++)
{
for (j=0;j<MAX_LEN;j++)
{
num[j]=num[j]*2;
}
for (j=0;j<MAX_LEN;j++)
{
if (num[j]>=10)
{
num[j+1]=num[j+1]+num[j]/10;
num[j]=num[j]%10;
}
}
}
i=MAX_LEN-1;
while (num[i]==0)
i--;
for (;i>=0;i--)
cout << num[i];
return 0;
}
|
25
|
12,287 |
void cf(char a[])
{
int t=strlen(a),i;
for(i=0;i<t;i++)
a[i]=(a[i]-48)*2+48;
for(i=0;i<t-1;i++)
{
if(a[i]>57)
{
a[i]-=10;
a[i+1]+=1;
}
}
if(a[t-1]>57)
{
a[t-1]-=10;
a[t]='1';
}
}
void strre(char a[])
{
int i,j,k;
char t;
k=strlen(a);
for(j=0,i=k-1;j<k/2;j++,i--)
{
t=a[j];
a[j]=a[i];
a[i]=t;
}
}
void main()
{
int n;
char a[100]={'1'};
scanf("%d",&n);
while(n--)
{
cf(a);
}
strre(a);
puts(a);
}
|
25
|
12,288 |
/*
* jisuan2deNcifang.cpp
*
* Created on: 2013-1-11
* Author: 120001791??
* ???
*/
int main() {
int N = 0, i = 0, n = 0, r = 0, temp = 0;//5????????N?????r????
int a[35];//1????????????
cin >> N;//??N
memset(a, 0, sizeof(a));//a??
a[0] = 1;//????1
while (N--) {//N????
for (i = 0; i < 35; i++) {//???????
temp = r;//????
r = (a[i] * 2 + r) / 10;//??????
a[i] = (a[i] * 2 + temp) % 10;//????
}
}
for (n = 34; a[n] == 0; n--)
;//?????0
for (; n >= 0; n--)//???
cout << a[n];//????
return 0;
}
|
25
|
12,289 |
int a[1005];
int main()
{
a[0] = 1;
int l = 1,n,t = 0,i;
scanf("%d",&n);
while(n--)
{
for(i = 0;i < l; i++)
a[i]*=2;
for(i = 0;i < l; i++)
{
if(a[i]>=10)
{
a[i+1] += a[i] / 10;
a[i] %= 10;
}
}
while(a[l])
{
if(a[l]>=10)
{
a[l+1] += a[l]/10;
a[l] %= 10;
}
l++;
}
}
for(i = l-1;i >= 0; i--)
printf("%d",a[i]);
return 0;
}
|
25
|
12,290 |
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
|
12,291 |
/*-----------------------------------------*\
|? ? ? ???2?N?? |
|? ? ???? |
|? ? ? ??2010 ? 12 ? 15 ? |
|? ? ?1000012758 |
\*-----------------------------------------*/
int main()
{
int n, a[100] = {1}, Len = 0;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = Len; j >= 0; j--)
{
a[j] *= 2;
if (a[j] >= 10)
{
a[j + 1] += a[j] / 10;
a[j] %= 10;
if (j + 1 > Len)
Len = j + 1;
}
}
for (int i = Len; i >= 0; i--)
cout << a[i];
return 0;
}
|
25
|
12,292 |
int main(){
int n;
int result[32]={0};
int carry=0;
int i,j,key=0;
scanf("%d",&n);
if(n==0){
printf("1");
}else{
result[0]=1;
for(i=1;i<=n;i++){
for(j=0;j<32;j++){
result[j]=result[j]*2+carry;
carry=0;
if(result[j]>=10){
result[j]=result[j]-10;
carry=1;
}
}
}
for(i=31;i>=0;i--){
if(result[i]!=0){
printf("%d",result[i]);
i--;
break;
}
}
for(;i>=0;i--){
printf("%d",result[i]);
}
}
return 0;
}
|
25
|
12,293 |
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
|
12,294 |
/*
* ????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
|
12,295 |
/* ???????2?N??
?????2010?12?17?
???????
*/
int main()
{
int num[100]={1} , i , j , len0 = 1 ,len1 , n ;
cin >> n ;
for (i = 0 ; i < n ; i++)
{
len1 = len0 ;
if (num[len1 -1] >= 5) len0++ ;
for (j = len1 - 1 ; j >= 0 ; j--)
{
if (num[j] < 5) num[j] = num[j] * 2 ;
else
{
num[j] = num[j] * 2 - 10 ;
num[j + 1] ++ ;
}
}
}
for (i = len0 - 1 ; i >= 0 ; i--)
cout << num[i] ;
return 0 ;
}
|
25
|
12,296 |
int main(){
char ANS[MAX];
memset(ANS,0,sizeof(ANS));
ANS[0]='1';
ANS[1]='\0';
int N;
cin>>N;
for(int i=1;i<=N;i++){
int LEN=strlen(ANS);
int g=0,h=0,k;
for(k=0;g||k<LEN;k++){
int mk=0;
if(k<LEN) mk=ANS[k]-'0';
h=mk*2+g;
g=h/10;
ANS[k]=h%10+'0';
}
ANS[k]='\0';
}
for(int i=0;i<strlen(ANS);i++) cout<<ANS[strlen(ANS)-i-1];
return 0;
}
|
25
|
12,297 |
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
|
12,298 |
int n,i,j,k=1;
int a[35]={0},b[35];
void multiple() //????????2???
{
if(n==0) cout<<"1"<<endl;
else
{
if(k==n)
{
for(i=34;i>=0;i--)
if(a[i]!=0) break;
for(j=i;j>=0;j--)
cout<<a[j]; //?????????
}
else
{
b[0]=(a[0]*2)%10;
for(i=1;i<35;i++)
b[i]=(a[i]*2)%10+a[i-1]*2/10; //???+??
for(i=0;i<35;i++)
a[i]=b[i];
k++;
multiple();
}
}
}
int main()
{
cin>>n;
a[0]=2;
multiple();
return 0;
}
|
25
|
12,299 |
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
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.