id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
12,100 |
int main()
{
int n,i,j,g;
int a[50]={0};//?????????a[0]????
cin >>n;//??
a[0]=1;a[1]=1;//???
for (i=1;i<=n;i++)
{
g=0;//?????
for (j=1;j<=a[0];j++)
{
a[j]=a[j]*2+g;//???*2??????
g=a[j]/10;a[j]=a[j]%10;//??????????
}
while (g>0)
{
a[0]++;
a[a[0]]=g%10;
g=g/10;
}//?????
}
for (i=a[0];i>0;i--)
cout <<a[i];//??
return 0;
}
|
25
|
12,101 |
//***************************************
//??2?N??
int main()
{
int n;
double a[1000]={0};
cin>>n;
a[999]=2;
if(n==0)
cout<<1;
else
{
for(int i=0;i<n-1;i++)
for(int j=999;j>=0;j--)
{
if(a[j]+a[j]<10)
a[j]=a[j]*2;
else
{
a[j]=a[j]*2-10;
a[j-1]=0.5+a[j-1];
}
}
int m=0;
for(int i=0;i<1000;i++)
{
if(a[i]!=0)
{
cout<<a[i];
m=i;
break;
}
}
for(int i=m+1;i<1000;i++)
cout<<a[i];
}
return 0;
}
|
25
|
12,102 |
int n;
int a[1001]={0};
void count(int n)
{
if(n==0) return;
for(int i=1000;i>0;i--)
a[i]=a[i]*2;
for(int i=1000;i>0;i--)
{
if(a[i]>=10)
{
a[i]-=10;
a[i-1]++;
}
}
count(n-1);
}
int main()
{
cin>>n;
a[1000]=1;
count(n);
for(int i=0;i<1001;i++)
{
if(a[i])
{
for(int j=i;j<1001;j++)
cout<<a[j];
break;
}
}
return 0;
}
|
25
|
12,103 |
int main()
{
int n,i;
cin>>n;
int a[40]={0};
a[0]=1;
while(n)
{
int j=0;
for(i=0;i<40;i++)
{
a[i]=2*a[i]+j;
j=0;
if(a[i]>9)
{
a[i]=a[i]-10;
j=1;
}
}
n--;
}
for(i=39;i>=0;i--)
if(a[i]!=0)
break;
for(;i>=0;i--)
cout<<a[i];
return 0;
}
|
25
|
12,104 |
int main()
{
int num[101]={0};
int N,q,i,j=0;
cin>>N;
num[0]=1;
for(q=1;q<=N;q++)
{
for(i = 0;i<=100 ; i++)
num[i]= num[i] * 2; //???????????
for (i = 0;i<=100 ; i++)
if(num[i] >= 10)
{
num[i + 1] = num[i+1] +num[i]/10; //?????????
num[i] =num[i]%10; //???????????
}
}
i=100;
while(num[i]== 0){ i--;} //???????0??
for (j=i; j >= 0; j--)
cout << num[j];
//??????
return 0;
}
|
25
|
12,105 |
int main(void)
{
char res[32]="0000000000000000000000000000001";
int n,i=0,j,c=0,t;
scanf("%d",&n);
for(;i<n;i++)
{
for(j=30;j>=0;j--)
{
t=(res[j]-'0')*2+c;
res[j]=t%10+'0';
c=t/10;
}
}
for(i=0;i<31&&res[i]=='0';i++);
for(j=i;j<31;j++)res[j-i]=res[j];res[j-i]='\0';
printf("%s\n",res);
return 0;
}
|
25
|
12,106 |
int a[100000],b[1000000];
int main()
{
int n,i,j,cnt=1;
cin>>n;
for(i=0;i<10000;i++)
{
a[i]=0;
b[i]=0;
}
a[0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<100000;j++)
{
a[j]=a[j]*2+b[j];
if(a[j]>=10)
{
a[j]-=10;
b[j+1]++;
}
}
for(j=0;j<10000;j++)
b[j]=0;
}
j=100000;
while(a[j]==0)
j--;
for(;j>=0;j--)
cout<<a[j];
return 0;
}
|
25
|
12,107 |
/**
* @file C8Q5.cpp
* @author ???
* @date 2013-11-17
* @description
* ??????:??2?N??
*/
int main()
{
char c[MAX]; //????
int n;
int pos = 0; //????????
memset(c,0,MAX*sizeof(char)); //???
cin >> n;
c[0] = 1; //2?0???1
for (int i = 0 ; i < n; i++) //??n?
{
for (int j = 0 ; j < MAX ; j++)
{
c[j] *= 2; //??
}
for (int k = 0 ; k < MAX - 1; k++) //??????
{
if (c[k] >= 10) //????
{
c[k+1] += c[k]/10;
c[k] %= 10;
}
if (c[k] != 0 && k > pos) //????????
pos = k;
}
}
for (int i = pos ; i >= 0 ; i--) //???????
cout << (char)(c[i]+'0');
cout << endl;
}
|
25
|
12,108 |
int main()
{
int n;
cin >> n;
int x[100] = {1};
for( int i = 1; i <= n; i++ )
{
for( int j = 0; j < 100; j++ )
{
x[j] = 2 * x[j];
}
for( int j = 0; j < 100; j++ )
{
if( x[j] >= 10 )
{
x[j] -= 10;
x[j+1]++;
}
}
}
int j;
for( j = 99; j >= 0; j-- )
{
if( x[j] != 0 )
break;
}
for( ; j >=0; j-- )
{
cout << x[j];
}
cout << endl;
return 0;
}
|
25
|
12,109 |
int main()
{
int n;cin>>n;
int num[1001]={0};
num[1000]=1;
int i,j;
while(n--)
{
for(i=1000;i>0;i--)
num[i]=num[i]*2;
for(i=1000;i>0;i--)
{
if(num[i]>=10)
{
num[i]=num[i]-10;
num[i-1]=num[i-1]+1;
}
}
}
for(i=0;i<=1000;i++)
{
if(num[i]!=0)
{
for(j=i;j<=1000;j++)
cout<<num[j];
break;
}
}
return 0;
}
|
25
|
12,110 |
int num[100];
int main(){
int n;
scanf("%d",&n);
int i,j;
num[99]=1;
for(j=0;j<n;j++){
for(i=0;i<100;i++){
num[i]*=2;
if(num[i]>9){
num[i]-=10;
num[i-1]+=1;
}
}
}
j=0;
for(i=0;i<100;i++){
if(num[i]!=0){
j++;
}
if(j!=0){
printf("%d",num[i]);
}
}
return 0;
}
|
25
|
12,111 |
int main(){
int n;
double s[101];
int i;
scanf("%d",&n);
s[0]=1;
s[1]=2;
for(i=2;i<=n;i++){
s[i]=s[i-1]*2;
}
printf("%.0lf",s[n]);
return 0;
}
|
25
|
12,112 |
int line[99999]={0},temp[99999]={0};
void cal(int line[99999])
{
int i;
for(i=0;i<9999;i++)
{
temp[i]=line[i]*2;
}
for(i=0;i<9999;i++)
{
if(temp[i]>=10)
{
temp[i]=temp[i]-10;
temp[i+1]=temp[i+1]+1;
}
}
for(i=0;i<9999;i++)
{
line[i]=temp[i];
}
}
int main()
{
int n,p=0,j,i;
cin>>n;
if(n==0)cout<<"1"<<endl;
else
{
line[0]=1;
while(p<n)
{
cal(line);
p++;
}
j=9998;
while(temp[j]==0)j--;
for(i=j;i>=0;i--)
cout <<temp[i];
cout <<endl;
}
return 0;
}
|
25
|
12,113 |
//**********************************
//????1000012825 *
//?????? *
//???12.15 *
//?????2?N?? *
//**********************************
int main ()
{
int n, i ,j, a[101] = {0}, k;
cin >> n;
a[0] = 1;
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] >= 10 )
{
a[j] = a[j] % 10;
a[ j + 1 ]++; //?????????????????????
}
}
}
for ( i = 100; a[i] == 0; i-- )
k = i;
for ( j = k - 1 ;j >= 0; j-- ) //?????0???????
cout << a[j];
cout << endl;
return 0;
}
|
25
|
12,114 |
int main()
{
int an[10011]={0};
int temp[10011]={1};
int i,j=0;
int n=0;
cin>>n;
while(n>0)
{
for(i=0;i<10000;i++)
{
an[i]+=temp[i]*2;
if(an[i]>=10)
{
an[i+1]+=1;
an[i]=an[i]%10;
}
}
for(i=0;i<10000;i++){
temp[i]=an[i];
//cout<<temp[1]<<temp[0]<<endl;
}
for(i=0;i<100;i++){
//cout<<temp[i];
}
memset(an,0,sizeof(an));
n--;
}
//cout<<temp[1]<<temp[0];
for(i=10000;i>=0;i--)
{ if(temp[i]!=0)
{
for(;i>=0;i--)
cout<<temp[i];
break;
}
}
cout<<endl;
return 0;
}
|
25
|
12,115 |
//***********************************************************************************
//???????2?n??
//?? ????
//??? 11-13
//***********************************************************************************
int main()
{
int n; //??
int a[41] = {0}; //??????????0
int i, j, k;
cin >> n;
a[40] = 1; //???????????
for(k = 0; k < n; k ++)
{
int tem[41] = {0}; //????????????
for(i = 40; i >= 0; i --)
tem[i] = a[i] * 2;
for(i = 40; i >= 0; i --) //???????????a[]???
{
tem[i - 1] += tem[i] / 10;
a[i] = tem[i] % 10;
}
}
int count = 0; //??????0???
for(i = 0; i <= 40; i ++)
{
if(a[i] == 0 && count == 0)
continue;
else
{
cout << a[i];
count = 1;
}
}
return 0;
}
|
25
|
12,116 |
//?????2?N??
//??????
//???2010.12.15
int g_a = 0; //?????? g_a ????????????????1????0
int main()
{
int n = 0;
int a[100]; //???a???????????
int i = 0;
int j = 0;
int flag = 0;
memset(a,0,sizeof(a));
cin >> n;
a[99] = 1; //a[99]?????
for (i = 1; i <= n; i++)
for (j = 99; j >= 50; j--)
{
if ((a[j] * 2 > 8) && (g_a == 1)) //??????????
a[j] = a[j] * 2 - 9;
else if ((a[j] * 2 > 8) && (g_a == 0)) //???????
a[j] = a[j] * 2 - 10 + g_a++;
else if ((a[j] * 2 <= 8) && (g_a == 1)) //???????
a[j] = a[j] * 2 + g_a--;
else if ((a[j] * 2 <= 8) && (g_a == 0)) //???
a[j] = a[j] * 2;
}
for (i = 1; i <= 99; i++)
{
//?????????????? 0 ?????
if ((a[i] == 0) && (flag == 0))
continue;
else
{
cout << a[i];
flag = 1;
}
}
return 0;
}
|
25
|
12,117 |
int a[1010] = {0};
void f(int n)
{
int i, u = 1000, temp = 0;
while (a[u] == 0)
u--;
if (n == 0)
{
for (i = u; i >= 1; i--)
cout << a[i];
cout << endl;
return;
}
for (i = 1; i <= u + 1; i++)
{
a[i] = a[i] * 2 + temp;
temp = 0;
if (a[i] >= 10)
{
a[i] = a[i] - 10;
temp = 1;
}
}
f(n - 1);
}
int main()
{
int n;
cin >> n;
a[1] = 1;
f(n);
return 0;
}
|
25
|
12,118 |
//***********************
//*?????2?N??****
//*??????**********
//*???1000012832******
//***********************
int shumu(int a[]);//????shumu ????????????
int main()
{
int N, a[100], i, m, j;
cin >> N;
memset(a, 0, sizeof a);//?????
a [0] = 2;//?a[0]???
if(N == 0)//??0??????1
{
cout << 1 << endl;
}
else if(N == 1)//??1??????2
{
cout << 2 << endl;
}
else
{
for(i = 1; i <= N - 1; i++)//??N???2????????N-1?2
{
m = shumu(a) + 1;//????????????
for(j = 0; j < m; j++)
{
a[j] = a[j] * 2;//?????????2
}
for(j = 0; j < m; j++)
{
if(a[j] >= 10)//????10?????
{
a[j + 1]++;
a[j] = a[j] - 10;
}
}
}
if(a[m] == 0)//?????M+1????0
{
for(i = m - 1; i >= 0; i--)//??m???
{
cout << a[i];
}
cout << endl;
}
else if(a[m] != 0)//???1
{
for(i = m; i >= 0; i--)//??M+1???
{
cout << a[i];
}
cout << endl;
}
}
return 0;
}
int shumu(int a[])
{
int k;
for(k = 99; a[k] == 0; k--)
{
}
return k;
}
|
25
|
12,119 |
//*****************************
//*?????? 1300012809 **
//*???2013.11.16 **
//*?????2?N?? **
//*****************************
int main()
{
int n, i, j, changdu;
changdu = 1; //?????
int a[1005] = {0}; //?????a
cin >> n;
for (i = 0; i <= n; i++) //??n+1?
{
if (i == 0) a[0] = 1;
if (i == 1) a[0] = 2;
if (i != 0 && i != 1)
{
if (a[changdu-1] >= 5 ) changdu += 1; //??*2????????????????
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]; //??10???
a[j] = a[j] % 10 ;
}
}
}
for (j = changdu-1; j >= 0; j--) cout << a[j]; //??????
cout << endl;
return 0;
}
|
25
|
12,120 |
int main()
{
int a[1000]={0};
int b[1000]={0},n,c;
a[999]=1;
cin >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 1000; j++)
{
a[j]*=2;
}//????
for (int j = 999; j >= 0; j--)
{
if (a[j]>9)
{
a[j-1]+=1;
a[j]-=10;
}//????
}
}
for (int j = 0; j < 1000; j++)
{
if (a[j]!=0)
{
c=j;
break;
}
}
for (int i = c; i < 1000; i++)
{
cout << a[i];
}
return 0;
}
|
25
|
12,121 |
int main()
{
int i,n,t,len,ans[100];
cin >> n;
len=1;ans[0]=1; // ???
while (n--)
{
t=0; // ??
for (i=0;i<len;i++)
{
ans[i]=ans[i]*2+t; // ??+??
t=ans[i]/10; // ??
ans[i]%=10;
}
if (t>0) ans[len++]=t; // ????
}
for (i=len-1;i>=0;i--)
cout << ans[i]; // ??
cout << endl;
return 0;
}
|
25
|
12,122 |
char result[30] = {0};
void mul();
int main()
{
int n;
result[0] = '1';
cin >> n;
int i;
if(n == 0) cout << result << endl;
else
{
for(i = 1; i <= n; i++)
mul();
for(i = strlen(result) - 1; i >= 0; i--)
cout << result[i] ;
}
return 0;
}
void mul()
{
int k;
int div = 0;
k = strlen(result);
for(int i = 0; i < k; i++)
{
int t;
t = result[i] - '0';
t = t * 2;
result[i] = t % 10 + div + '0';
div = t / 10;
if(i == k - 1 && div != 0)
result[i + 1] = div + '0';
}
}
|
25
|
12,123 |
char s[50]; //?????????2?100???????50??
int i,j,k;
int flag=0;
void f(int n) //?????????2?n??????
{
if(n==0) return;
else if(n==1)
{
for(i=48; i>=0; i--)
{
s[i]=(s[i]-'0')*2+flag; //???????????????2???
if(s[i]>=10) //??????????10?????
{
flag=s[i]/10;
s[i]=s[i]%10+'0';
}
else
{
flag=0; //???????
s[i]=s[i]+'0';
}
}
return;
}
else if(n==2)
{
for(i=48; i>=0; i--)
{
s[i]=(s[i]-'0')*4+flag; //???????????????4???
if(s[i]>=10) //??????????10?????
{
flag=s[i]/10;
s[i]=s[i]%10+'0';
}
else
{
flag=0; //???????
s[i]=s[i]+'0';
}
}
return ;
}
else
{
for(i=48; i>=0; i--)
{
s[i]=(s[i]-'0')*8+flag; //???????????????8???
if(s[i]>=10) //??????????10?????
{
flag=s[i]/10;
s[i]=s[i]%10+'0';
}
else
{
flag=0; //???????
s[i]=s[i]+'0';
}
}
f(n-3); //??????n-3???
}
}
int main()
{
int n;
cin>>n;
memset(s,'0',sizeof(s)); //??????????0
s[48]='1'; //???s[48]?1
f(n); //????
i=0;
while(s[i]=='0') //??????0?????
{
i++;
}
for(j=i; j<=48; j++) //???????????????s[48]
{
cout<<s[j];
}
return 0;
}
|
25
|
12,124 |
int main()
{
int N,num[110]={0},an[110]={0},i;
num[0]=1;an[0]=1;
cin>>N;
while(N--)
{
memset(an,0,sizeof(an));
for(i=0;i<110;i++)
an[i]=num[i]*2;
for(i=0;i<110;i++)
{
if(an[i]>=10)
{
an[i+1]+=an[i]/10;
an[i]=an[i]%10;
}
}
for(i=0;i<110;i++)
num[i]=an[i];
}
if(an[0]==1)
cout<<1<<endl;
else
{
i=105;
while(an[i]==0&&i>=0) //???????0???
i--;
for(;i>=0;i--)
cout<<an[i]; //??????????????
cout<<endl;
}
cin.get();cin.get();
return 0;
}
|
25
|
12,125 |
/**
* @file 5.cpp
* @author ???
* @date 2013-11-15
* @description
* ?????????(11-12) ??2?N??
*/
int main()
{
int N, k, i, j = 0, a[100] = {1}, b[100]; // i, j, k?????????
cin >> N;
for (k = 1; k <= N; ++k)
for (i = 0; i <= j; ++i) // ??????
{
if (!i) b[0] = a[0];
b[i + 1] = a[i + 1];
a[i] += b[i];
if (a[i] >= 10)
{
a[i] -= 10;
++a[i + 1];
if (a[i + 1] == 1 && i == j)
{
++j;
break;
}
}
}
i = 99;
while (a[--i] == 0);
for (; i >= 0; --i)
cout << a[i];
return 0;
}
|
25
|
12,126 |
//****************************
//**Title:??2?N?? **
//**Author:?? 1300012732 **
//**Date?2013.11.16 **
//**File?5.cpp **
//****************************
int main()
{
int n, i, j;
cin >> n;
int a[32] = {1};
for (i = 0; i < n; i++)
{
for (j = 0; j < 32; j++)
a[j] *= 2;
for (j = 0; j < 32; j++)
{
if (a[j] >= 10)
{
a[j]-=10;
a[j+1]++;
}
}
}
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,127 |
int main()
{
int N;
int value[1001] = {0};
int i;
value[1000] = 1;
scanf("%d", &N); //2^N
while(N--)
{
for(i = 1000; i > 0; i--)
{
value[i] *= 2;
}
for(i = 1000; i > 0; i--)
{
if(value[i] >= 10)
{
value[i] -= 10;
value[i-1] += 1;
}
}
}
for(i = 0; i <= 1000; i++)
{
if(value[i] != 0)
{
while (i <= 1000)
{
printf("%d", value[i]);
++i;
}
break;
}
}
return 0;
}
|
25
|
12,128 |
int main()
{
int n,i,j,num[2000];
memset(num,0,sizeof(num));
num[1999]=2;
cin>>n;
if(n==0)
{
cout <<"1" << endl;return 0;
}
else
{
for(i=1;i<n;i++)
{
for(j=0;j<2000;j++)
{
num[j]=2*num[j];
if(num[j]>=10)
{
num[j]=num[j]-10;
num[j-1]++;
}
}
}
}
i=0;
while(num[i]==0)
{
i++;
}
for(;i<2000;i++)
cout <<num[i];
cout << endl;
return 0;
}
|
25
|
12,129 |
int main()
{
int num[101] = {0};
num[100] = 1;
int i, N, j;
cin >> N;
for(i = 1; i <= N; i++)
{
for(j = 1; j <= 100; j++)
{
if(num[j] * 2 < 10)
num[j] = num[j] * 2;
else
{
num[j] = num[j] * 2 - 10;
num[j - 1]++;
}
}
}
for(i = 1; i <= 100; i++)
if(num[i] != 0) break;
for(j = i; j <= 100; j++)
cout << num[j];
return 0;
}
|
25
|
12,130 |
/*
* exam.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main(){
int result[10000]={1};
int length=1,n,i,k;
cin>>n;
for (k=0;k<=n-1;k++){
for (i=0;i<=length-1;i++){
result[i]=result[i]*2;
}
for (i=0;i<=length-1;i++){
result[i+1]=result[i+1]+result[i]/10;
result[i]=result[i]%10;
}
if (result[i])length++;
}
for (i=length-1;i>=0;i--)cout<<result[i];
return 0;
}
|
25
|
12,131 |
int main()
{
int N, i, j;
int k;
cin >> N;
int a[400] = {0};
a[399] = 1;
for( i = 0; i < N; i++ )
{
for( j = 0; j < 400; j++ )
{
a[j] = a[j] * 2;
}
for( k = 399; k >= 0; k-- )
{
if( a[k] >= 10 )
{
a[k] = a[k] - 10;
a[k-1] += 1;
}
}
}
for( i = 0; i < 400; i++ )
{
if( a[i] != 0 )
break;
}
for( j = i; j < 400; j++ )
{
cout << a[j];
}
cout << endl;
return 0;
}
|
25
|
12,132 |
int main()
{
int a[42] = {0}, N, i, j, k; //?????????0
cin >> N;
a[41] = 1; //??????????2
if (N == 0)
{
cout << "1" << endl;
return 0;
}
for (k = 1; k <= N; k++) //????N??2
{
for (i = 41; i >= 0; i--) //??????2
a[i] = a[i] * 2;
for (j = 41; j >= 0; j--) //?????
if (a[j] >= 10)
{
a[j-1] += a[j] / 10;
a[j] = a[j] % 10; //??
}
}
i = 0; //?i???
while(a[i]==0) //???????0??
i++;
for (; i <= 41; i++) //????
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12,133 |
int main()
{
char a[1000];
a[0] = '1';
int flag = 0, n, m = 0;
cin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = m; j >= 0; j--)
{
a[j] = (a[j] - '0') + (a[j] - '0') + '0' + flag;
if (a[j] > '9')
{
flag = 1;
a[j] = a[j] - 10;
}
else
{
flag = 0;
}
}
if (flag == 1)
{
for (int k = m + 1; k > 0; k--)
{
a[k] = a[k - 1];
}
a[0] = '1';
flag = 0;
m++;
}
}
for (int l = 0; l <= m; l++)
{
cout << a[l];
}
return 0;
}
|
25
|
12,134 |
main()
{
int n,i,k;
scanf("%d",&n);
int v[1001]={0};
v[0]=1;
while(n--)
{
for(i=0;i<=1000;i++)
v[i]=v[i]*2;
for(i=0;i<=1000;i++)
{
if(v[i]>=10)
{
v[i]=v[i]-10;
v[i+1]=v[i+1]+1;
}
}
}
//printf("%d\n",v[1]);
int flag=0;
for(i=1000;i>=0;i--)
{
if(v[i]!=0)
{ for(k=i;k>=0;k--)
printf("%d",v[k]);
flag=1;
break;
}
if(flag)
break;
}
}
|
25
|
12,135 |
int main()
{
int i, n, num[1005], flag = 0, p = 1, j, t;
cin >> n;
for(i = 0; i<= 1004; i++)
num[i] = 10;
if(n == 0)
cout << "1" << endl;
else
{
num[1000] = 1;
for(i = 1; i <= n; i++)
{
t = p;
for(j = 1000; j >= 1000 - p + 1; j--)
{
num[j] = num[j] * 2 + flag;
flag = 0;
if(num[j] >= 10)
{
num[j] = num[j] - 10;
flag = 1;
if(num[j - 1] == 10)
{
num[j - 1] = 1;
flag = 0;
t++;
}
}
}
p = t;
}
if(num[1000 - p + 1] == 0)
num[1000 - p + 1] = 1;
for(i = 1000 - p + 1; i <= 1000; i++)
cout << num[i];
}
cin >>n;
return 0;
}
|
25
|
12,136 |
int main()
{
int a[100]={0},t=0,i,j,n;
scanf("%d",&n);
a[1]=1;
for (i=1;i<=n;i++)
{
for (j=90;j>=1;j--)
{
a[j]*=2;
a[j+1]+=a[j]/10;
a[j]=a[j]%10;
}
}
n=99;
while (n)
{
if (a[n]) t=1;
if (t) printf("%d",a[n]);
n--;
}
}
|
25
|
12,137 |
int a[100];
int main()
{
a[0]=1;
int k=1,i,n;
scanf("%d",&n);
while(n--)
{
for(i=0;i<k;i++)
a[i]*=2;
for(i=0;i<k;i++)
if(a[i]>=10)
{
a[i+1]+=a[i]/10;
a[i]%=10;
if(i==k-1)
k++;
}
}
for(i=k-1;i>=0;i--)
printf("%d",a[i]);
return 0;
}
|
25
|
12,138 |
int main()
{
int N, i, j, num = 1;
int s[101] = {0};
cin >> N;
s[0] = 1;
for (i = 0; i < N; i++)
{
for (j = 0; j < num; j++)
{
s[j] = s[j] * 2;
}
for (j = 0; j < num; j++)
{
if (s[j] >= 10)
{
s[j] -= 10;
s[j+1]++;
}
}
if (s[num] == 1) num++;
}
for (i = num - 1; i >= 0; i--)
cout << s[i];
return 0;
}
|
25
|
12,139 |
int main()
{
int a[1000]={0};
a[0] = 2;
int k;
cin >> k;
if(k==0)
cout << "1";
if(k==1)
cout << "2";
if(k>=2)
{
int i,j;
for(i = 0; i < k -1 ;i++)
{
for(j =0;j<1000;j++)
{
a[j] = 2 * a[j];
}
for(j = 0;j<1000;j++)
{
if(a[j]>=10)
{
a[j+1] = a[j+1]+a[j]/10;
a[j] = a[j]%10;
}
}
}
int flag = 0;
for(i = 999; i>=0;i--)
{
if(a[i]==0&&flag==0)
continue;
if(a[i]!=0)
{
cout << a[i];
flag = 1;
}
if(a[i] == 0 &&flag ==1 )
cout << a[i];
}
}
int wo;
cin >> wo;
return 0;
}
|
25
|
12,140 |
int main()
{
int a[50] = {0}, i, j, k = 0, n, p = 48;
cin >> n;
a[49] = 1;
for (i = 1; i <= n; i++)
{
for (j = 49; j >= p; j--)
{
a[j] = a[j] * 2 + k;
if (a[j] >= 10)
{
k = 1;
a[j] = a[j] - 10;
}
else k = 0;
}
if (a[p] > 0) p--;
}
while (a[p] == 0) p++;
for (i = p; i <= 49; i++)
{
cout << a[i];
}
cout << endl;
return 0;
}
|
25
|
12,141 |
int main()
{
void fun ( int[] );
int num[1000], i, n;
cin >> n;
memset( num, 0, sizeof(num) );
num[0] = 1;
for ( i = 1; i <= n; i++ )
fun ( num );
int *p = NULL;
for ( p = num + 999; *p == 0; p-- );
for ( ; p >= num; p-- )
cout << *p;
return 0;
}
void fun ( int num[] )
{
int *p = NULL;
for ( p = num; p < num + 1000; p++ )
*p = 2 * *p;
for ( p = num; p < num + 1000; p++ )
if ( *p > 9 )
{
*p = *p - 10;
*( p + 1 ) = *( p + 1 ) + 1;
}
}
|
25
|
12,142 |
int main()
{
int n,flag=0,count=0,j,i=0,sum[100]={1};
cin>>n;
for(i=0;i<n;i++)
{
flag=0;
for(j=99;j>=0;j--)
{
if(sum[j]==0&&flag==0)
continue;
else
flag=1;
sum[j]*=2;
if(sum[j]>=10)
{
sum[j]-=10;
sum[j+1]+=1;
}
}
}
for(i=99;i>=0;i--)
{
if(sum[i]!=0)
{
for(j=i;j>=0;j--)
{
cout<<sum[j];
}
cout<<endl;
break;
}
}
return 0;
}
|
25
|
12,143 |
char a[100];
int b[100] = {0};
void f(int i)
{
int j, k;
if (i == 0)
a[100] = '1';
else
{
a[100] = '1';
for (j = i; j >= 1; j--)
{
for (k = 100; k >= 0; k--)
{
a[k] = (a[k] - '0') * 2 + '0';
if (b[k] == 1)
a[k]++;
if (a[k] - 10 >= '0')
{
a[k] -= 10;
b[k - 1]++;
}
}
memset(b, 0, sizeof(b));
}
}
for (j = 0; j <= 1000; j++)
{
if (a[j] != '0')
{
for (k = j; k <= 100; k++)
cout << a[k];
cout << endl;
break;
}
}
}
int main()
{
int i;
cin >> i;
memset(a, '0', sizeof(a));
f(i);
return 0;
}
|
25
|
12,144 |
int num[36];
void mult ()
{
int i;
for (i=0;i<35;i++)
num[i]=num[i]*2;
for (i=0;i<35;i++)
{
num[i+1]=num[i+1]+num[i]/10;
num[i]=num[i]%10;
}
}
int main()
{
num[0]=1;
int i,n;
cin>>n;
for (i=1;i<=n;i++) mult();
int flag=0;
for (i=35;i>=0;i--)
{
if (num[i]!=0) flag=1;
if (flag==1) cout<<num[i];
}
return 0;
}
|
25
|
12,145 |
int main()
{
int n,num;
cin>>n;
int a[100];
int i,j,k;
for(i=0;i<100;i++)
{
a[i]=0;
}
a[99]=1;
for(j=0;j<n;j++)
{
for(i=0;i<100;i++)
{
a[i]=a[i]*2;
if(a[i]>=10)
{
a[i]=a[i]-10;
a[i-1]=a[i-1]+1;
}
}
}
for(i=0;i<100;i++)
{
if(a[i]!=0)
{
num=i;
break;
}
}
for(i=num;i<100;i++)
{
cout<<a[i];
}
}
|
25
|
12,146 |
int a[1000];
void calc()
{
int j=0;
for(j=0;j<1000;j++)
a[j]=a[j]*2;
for(j=0;j<1000;j++)
{
if(a[j]>=10)
{
a[j+1]=a[j+1]+a[j]/10;
a[j]=a[j]%10;
}
}
}
int main()
{
memset(a,0,sizeof(a));
int n=0,k=0;
cin>>n;
int i=0,sum=1;
for(i=0;i<30;i++)
sum=sum*2;
while(sum!=0)
{
a[k]=sum%10;
sum=(sum-a[k])/10;
k++;
}
sum=1;
if(n<=30)
{
for(i=0;i<n;i++)
sum=sum*2;
cout<<sum<<endl;
}
else
{
for(i=30;i<n;i++)
calc();
int p=0;
for(i=1000;i>=0;i--)
{
if(a[i]!=0)
{
p=i;
break;
}
}
for(i=p;i>=0;i--)
cout<<a[i];
cout<<endl;
}
return 0;
}
|
25
|
12,147 |
int main()
{
int a[500] = {0};
int n , i , j , flag = 0;
cin >> n;
a[499] = 1;
for (i = 1 ; i <= n ; i++)
{
for (j = 499 ; j >= 0 ; j--)
{
a[j] *= 2;
}
for (j = 499 ; j >= 1 ; j--)
{
a[j - 1] += a[j] / 10;
a[j] = a[j] % 10;
}
a[0] = a[0] % 10;
}
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,148 |
//****************************************
//???????2?N??
//??????
//?????2010.12.18
//???????2?N??
//****************************************
int main ()
{
int N, i, j, m;//???????????i,j,m
unsigned a[31],b[31];//???????????
memset(a,0,sizeof(a));//?a????
a[0] = 1;
for (i = 1; i < 31; i++)
a[i] = 0;//?a????1
cin >> N;
if (N == 0)
cout << "1" << endl;//???0??????1
else
{
for(m = 0; m < N; m++)
{
memset(b,0,sizeof(b));//??????b????
i = 30;
while(a[i] == 0) i--;//?????????
//??????2
for ( j = 0; j <= i; j++)
b[j] = a[j] * 2;
for ( j = 0; j < i + 1; j++)
{
//??10???
if ( b[j] >= 10)
{
b[j + 1] += b[j] / 10;
b[j] %= 10;
}
}
//?a????????2
for (j = 0; j < i + 2; j++)
a[j] = b[j];
}
j = i + 1;
while ( b[j] == 0) j--;//????????????
for (; j >= 0; j--)
cout << b[j];
cout << endl;
}
return 0;
}
|
25
|
12,149 |
//********************************
//*?????(11-12) ??2?N?? **
//*?????? 1300012713 **
//*???2013.11.17 **
//********************************
int main()
{
int n, a[100] = {1}, b = 0, c = 0;
cin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 100; j++)
{
a[j] = a[j] * 2 + c;
if(c == 1) c = 0;
if(a[j] >= 10)
{
a[j] = a[j] - 10;
c = 1;
}
}
}
for(int k = 99; k >= 0; k--)
{
if(a[k] != 0 || b != 0)
{
cout << a[k];
b++;
}
}
return 0;
}
|
25
|
12,150 |
void increase (char []);
int main()
{
int N, sum = 0, i, j;
char num[100];
memset (num, '\0',100);
num[0] = '1';
cin >> N;
for (i = 0; i < N; i++)
increase (num);
i = 0;
while (num[i] != '\0') ++i;
for (j = i - 1; j >= 0; j--)
{
cout << num[j];
}
return 0;
}
int mid = 0;
void increase (char num[100])
{
int n = 0;
while (num[n] != '\0' || mid != 0)
{
if (num[n] != '\0')
mid += (num[n] - '0') * 2;
if (mid < 10)
{
num[n] = mid + '0';
mid = 0;
}
else
{
num[n] = mid % 10 + '0';
mid = 1;
}
++n;
}
}
|
25
|
12,151 |
int num[10000000] = {0}, flag[10000000], len = 1;
void minusn()
{
int i;
flag[0] = 0;
for(i = 0; i < len; i++)
{
num[i] *= 2;
num[i] += flag[i];
flag[i+1] = 0;
if(num[i] >= 10)
{
flag[i+1] = 1;
num[i] = num [i] % 10;
}
}
if(flag[i] == 1)
{
len++;
num[i] += flag[i];
}
return;
}
int main()
{
int n, i, j, temp;
num[0] = 1;
cin >> n;
for(i = 1; i <= n; i++)
minusn();
for(j = 0, i = len - 1; j < len / 2; j++, i--)
{
temp = num[i];
num[i] = num[j];
num[j] = temp;
}
for(i = 0; i < len; i++)
cout << num[i];
cout <<endl;
return 0;
}
|
25
|
12,152 |
int main(){
int i,k,n,m,t,cf[100]={0};
int jinwei=0;
cf[0]=1;
scanf("%d",&n);
t=0;
for(i=0;i<n;i++){
for(k=0;k<=t;k++){
cf[k]=cf[k]*2+jinwei;
if(cf[k]>=10){
cf[k]=cf[k]%10;
jinwei=1;
}
else{
jinwei=0;
}
}
for(m=99;cf[m]==0;m--);
t=m+1;
}
for(i=99;cf[i]==0;i--);
for(;i>=0;i--){
printf("%d",cf[i]);
}
return 0;
}
|
25
|
12,153 |
/* Name : ??2?N??
* Version : 1.0
* Date : 2012-12-24
* New : Null
* Description :
* State : Design
*/
int main()
{
int a[33]={1},Bit[33]={0}; //???a[33]?????????????????????Bit[33]??????????a[]??
int N;
cin>>N;
for(int i=0;i<N;i++)
{
for(int j=0;j<32;j++) //????a[0]?????????????a[32]?Bit[32]???????Bit[33]???
{
a[j]=2*a[j]+Bit[j]; //?????????????????
if(a[j]>9) //???????????????????????????Bit??1
{
a[j]=a[j]-10;
Bit[j+1]=1;
}
else Bit[j+1]=0; //????Bit??0???????????????????
}
}
for(int i=31,Begin=0;i>=0;i--) //????a[31]?????a[0]????????Begin?????????????0?????
{
if(a[i]!=0)Begin=1; //???????0???Begin???1???????
if(Begin==1)cout<<a[i];
}
cout<<endl;
return 0;
}
|
25
|
12,154 |
//********************************
//*?????2?N?? **
//*?????? 1300012957 **
//*???2013.11.19 **
//********************************
int main ( )
{
int n ;
cin >> n ;
double n1[101] = {0} ;
int i,j ;
if( n == 0 )
{
cout << 1 ;
} //?????0????1
else if( n != 0 ) //????0?
{
n1[0] = 2 ; //????2
for( i = 1 ; i <= n - 1 ; i++ )
//i????????????
{
for( j = 0 ; j <= 100 ; j++ )
//j???????
//?????????2?????
{
n1[j] = n1[j] * 2 ; //???*2
if( n1[j] >= 10 ) //??*2???10
{
n1[j+1] += 0.5 ;//??????*2?????0.5
//?*2???1
n1[j] -= 10 ; //?????????10
}
}
}
for( i = 100 ; i >= 0 ; i-- )
{
if( n1[i] != 0 )
break ; //???????????????i
}
for( j = i ; j >= 0 ; j-- ) //???????????????
//??i???0??
{
cout << n1[j] ; //??????
}
}
return 0 ;
}
|
25
|
12,155 |
int main()
{
int i, n, m, flag = 0, k;
int a[40] = {0};
cin >> n;
a[39] = 1;
m = 0;
for (k = 1; k <= n; k ++)
{
for (i = 39; i >= 1; i --)
{
if (a[i] >= 5)
{
a[i] = a[i] * 2 - 10 + m;
m = 1;
}
else
{
a[i] = a[i] * 2 + m;
m = 0;
}
}
}
for (i = 0; i <= 39; i ++)
{
if (a[i] != 0)
flag = 1;
if (flag != 0)
cout << a[i];
}
return 0;
}
|
25
|
12,156 |
//???2010?12?15?
//???1000010586_???
//???2?N??
void Jisuan( char num[] );
int main()
{
char num[ 50 ] ;
int N , i;
for ( i = 0 ; i <= 49 ; i++ )
num[ i ] = '0';
num[ 49 ] = '2';
cin >> N;
if ( N == 0)
cout << 1;
else
{
for ( i = 1 ; i <= N - 1 ; i++ )
Jisuan ( num );
for ( i = 0 ; i <= 49 ; i++ )
{
if ( num[ i ] != '0' )
{
cout << num[ i ];
break;
}
}
for ( i = i + 1 ; i <= 49 ; i++ )
cout << num[ i ];
}
return 0;
}
void Jisuan( char num[] )
{
int i;
num[ 49 ] = num[ 49 ] + num[ 49 ] - '0';
for ( i = 49 ; i >= 1 ; i-- )
{
if ( num[ i ] > '9' )
{
num[ i ] = num[ i ] - 10;
num[ i - 1 ] = num[ i - 1 ] + num[ i - 1 ] - '0' + 1;
}
else
num[ i - 1 ] = num[ i - 1 ] + num[ i - 1 ] - '0';
}
}
|
25
|
12,157 |
// 2011???.cpp : ??????????????
int num[100000];
void plu()
{
int sub[100000];
for(int i=0;i<110;i++) sub[i]=0;
int k=0;
while(num[k]!=-1)
{
sub[k]=num[k]*2%10+sub[k];
sub[k+1]=num[k]*2/10;
k++;
}
int j=60;
while(sub[j]==0)
{
j--;
}
for(int m=j;m>-1;m--)
num[m]=sub[m];
}
int main()
{
int n;
cin>>n;
if(n==1) {cout<<2;return 0;}
if(n==0) {cout<<1;return 0;}
for(int i=0;i<n;i++)
num[i]=-1;
num[0]=1;
for(int j=0;j<n;j++)
plu();
int k=0;
while(num[k]!=-1)
k++;
for(int l=k-1;l>-1;l--)
cout<<num[l];
return 0;
}
|
25
|
12,158 |
int longInt[100];
int main()
{
int size = 1;//??
int c;//??
int n;//n??
int i;
cin>>n;
longInt[0] = 1;
for(i = 0; i < n; i++)
{
c = 0;
for(int j = 0; j < size; j++)
{
longInt[j] = longInt[j]*2 + c;
c = longInt[j]/1000;
if(longInt[j] >= 1000)
{
longInt[j] = longInt[j]%1000;
if(j == size-1)
{
size ++;
}
}
}
}
for(i = size - 1; i > -1; i--)
{
if(i != size-1)
{
cout<<setw(3)<<setfill('0');
}
cout<<longInt[i];
}
cout<<endl;
return 0;
}
|
25
|
12,159 |
int main()
{
int i,a;
double d;
scanf("%d",&a);
d=1;
if(a==0){
d=1;
}
if(a!=0){
for(i=1;i<=a;i++){
d=d*2;
}
}
printf("%.0lf",d);
}
|
25
|
12,160 |
int main()
{
int i,j,k,n,e=0,a[50]={0};
scanf("%d",&n);
a[0]=1;
for(i=1;i<=n;i++){
for(j=0;j<50;j++){
a[j]*=2;}
for(k=0;k<50;k++){
if(a[k]>9){
a[k]=a[k]%10;
a[k+1]+=1;
}
}
}
for(i=49;i>=0;i--){if(e==1){
printf("%d",a[i]);
}
if(a[i]!=0){
if(e==0){
printf("%d",a[i]);
e=1;
}
}
}
return 0;
}
|
25
|
12,161 |
int main()
{
int N;
cin>>N;//??N
int a[100]={0};//??????????
a[99]=1;//?????????????1
for(int i=1;i<=N;i++)
for(int j=0;j<=99;j++)
{
a[j]=a[j]*2;//?????2
if(a[j]>=10)//????????10
{
a[j-1]=a[j-1]+1;//?????
a[j]=a[j]-10;//???10
}
}
int i=0;
while(a[i]==0)i++;//???????????????????
for(int j=i;j<=99;j++)
cout<<a[j];//??
cout<<endl;
return 0;
}
|
25
|
12,162 |
int main()
{
char a[100];
int n, c, len, j, i, k;
cin >> n;
a[0] = '1';
a[1] = '\0';
for(i = 1; i <= n; i ++)
{
c = 0;
len = strlen(a);
for(j = 0; j <= len - 1; j ++)
{
if(a[j] - '0' < 5)
{
a[j] = (a[j] - '0') * 2 + '0' + c;
c = 0;
}
else
{
a[j] = (a[j] - '0') * 2 + '0' + c - 10;
c = 1;
}
}
a[j] = c + '0';
if(a[j] != '0')
a[j + 1] = '\0';
else
a[j] = '\0';
}
len = strlen(a);
for(k = len - 1; k >= 0; k--)
cout << a[k];
return 0;
}
|
25
|
12,163 |
int main()
{
int num[100] = {0};
num[0] = 1;
int x;
int i, j;
cin >> x;
for (i = 0; i < x; i++)
{
for (j = 0; j < 100; j++)
num[j] = 2 * num[j];
for (j = 0; j < 100; j++)
if (num[j] > 9)
{
num[j] = num[j] - 10;
num[j + 1]++;
}
}
i = 99;
while (num[i] == 0)
i--;
for (; i >= 0; i--)
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12,164 |
//****************************************************************
// ????1000012789_2.cpp *
// ???wusy *
// ???12,15 *
// ???2?N? *
//****************************************************************
int main()
{
int a[50], n, i, j;
cin >> n;
memset(a, 0, sizeof(a));
a[0] = 1;
for (i = 0; i < n; i++)
{
for(j = 0; j < 50; j++)
a[j] = a[j] * 2;
for(j = 0; j < 50; j++)
{
if(a[j] >= 10)
{
a[j + 1] = a[j + 1] + a[j] / 10;
a[j] = a[j] % 10;
}
}
}
for (i = 49; i >= 0; i--)
if (a[i] != 0)
break;
for (; i >=0; i--)
cout << a[i];
return 0;
}
|
25
|
12,165 |
int main()
{
char a[200] = {0};
int b[200] = {0};
int n;
cin >> n;
a[0] = '1';
int i = 0 ;
for( ; i < n ; i++)
{
int j = 0;
for( ; j < strlen(a) ; j++)
b[j] = a[j] - '0';
for(j = 0 ; j < strlen(a) ; j++)
b[j] = b[j]*2 ;
j = 199;
while(b[j] == 0)
j--;
int k = j + 1;
for(j = 0 ; j < k; j++)
{
b[j+1] += b[j]/10;
b[j] = b[j]%10;
}
j = 199;
while(b[j] == 0)
j--;
for( ; j >= 0; j--)
a[j] = b[j] + '0';
}
i = 199;
while(a[i] == 0)
i--;
for( ; i >= 0 ; i--)
cout << a[i] ;
cout << endl;
return 0;
}
|
25
|
12,166 |
int num[101]={2};
int mul();
int main()
{
int i;
int n;
int a;
cin>>n;
if (n==0)
cout<<'1'<<endl;
else
{
for (i=0;i<n-1;i++)
mul();
for (i=100;i>=0;i--)
if (num[i]!=0)
{
a=i;
break;
}
for (i=a;i>=0;i--)
cout<<num[i];
cout<<endl;
}
return 0;
}
int mul()
{
int i;
int temp[101]={0};
for (i=0;i<101;i++)
temp[i]=2*num[i];
for (i=0;i<101;i++)
{
if (temp[i]>9)
{
temp[i+1]+=temp[i]/10;
num[i]=temp[i]%10;
}
else
num[i]=temp[i];
}
return 0;
}
|
25
|
12,167 |
int main()
{
int n;
cin>>n;//n????
int a[100]={0},b[100];
a[0]=1;
int p=0,temp,i1;
if (n!=0)
{
for (int i=0;i<n;i++)
{
for (i1=0;i1<=99;i1++)
{
temp=a[i1]*2+p;
b[i1]=temp%10;
a[i1]=b[i1];
p=temp/10;
}
}//??????
int t=0,i2;
for (i2=99;i2>=0;i2--)
{
if (b[i2]==0)
continue;
else if (b[i2]!=0)
break;
}
for (int i3=i2;i3>=0;i3--)
cout<<b[i3];
}
else
cout<<1;//2?0???1
return 0;
}
|
25
|
12,168 |
/*************************
??cpp5
??(11-12) ??2?N??
???
2013/11/14
**************************/
int main()
{
int i, j, m, k,N, a[100]={0}, flag=0;
cin >> N;
a[0]=1;
for(i=1; i<= N; i++)
{
for (j=0; j<=99; j++)
{
if (2 * a[j] +flag < 10 )
{
a[j] = 2 * a[j] +flag;
flag = 0;
}
else
{
a[j] = ( 2 * a[j] +flag ) % 10;
flag = 1;
}
}
}
for (i=99 ; a[i]==0; i--)
m=i;
for (k=m-1; k>=0; k--)
cout << a[k];
return 0;
}
|
25
|
12,169 |
int main ()
{
int n, m = 0, i, j = 0, flag = 0, flag1 = 1;
int result[1001] = {1};
cin >> n;
for (i = 0; i < n; i++)
{
for (j = 0; j <= 1000; j++)
{
if (flag == 0) result[j] = result[j] * 2;
if (flag == 1) {result[j] = result[j] * 2 + 1; flag = 0;}
if (result[j] >= 10)
{
result[j] = result[j] - 10;
flag = 1;
}
}
}
for (i = 1000; i >= 0; i--)
{
if (result[i] == 0 && flag1 == 1)
{ continue;}
else
{
flag1 = 0;
cout << result[i];
}
}
return 0;
}
|
25
|
12,170 |
/**
* @file 5.cpp
* @author ???
* @date 2013-11-15
* @description
* ?????????(11-12) ??2?N??
*/
int main()
{
int N, k, i, j = 0, a[100] = {1}, b[100]; // i, j, k?????????
cin >> N;
for (k = 1; k <= N; ++k)
{
for (i = 0; i <= j; ++i)
b[i] = a[i];
for (i = 0; i <= j; ++i) // ??????
{
a[i] += b[i];
if (a[i] >= 10)
{
a[i] -= 10;
++a[i + 1];
if (a[i + 1] == 1 && i == j)
{
++j;
break;
}
}
}
}
i = 99; // ??
while (a[--i] == 0);
for (; i >= 0; --i)
cout << a[i];
return 0;
}
|
25
|
12,171 |
int main()
{
char num[10000] , a ;
int n , i , len = 1 , k ;
cin >> n ;
cin.get() ;
num[0] = '1' ;
for ( i = 1 ; i <= n ; i++ )
{
if ( ( num[0] + num[0] ) > ( '9' + '0' ) )
{
len++ ;
for ( k = len - 1 ; k >= 1 ; k-- )
{
num[k] = num[k-1] ;
}
num[0] = '1' ;
if ( len > 2 )
{
for ( k = 1 ; k <= len - 2 ; k++ )
{
if ( ( num[k] + num[k] ) > ( '9' + '0' ) )
{
num[k] = num[k] + num[k] - '9' - '1' + '0' ;
if ( ( num[k+1] + num[k+1] ) > ( '9' + '0' ) )
num[k] = num[k] + '1' - '0' ;
}
else
{
num[k] = num[k] + num[k] - '0' ;
if ( ( num[k+1] + num[k+1] ) > ( '9' + '0' ) )
num[k] = num[k] + '1' - '0' ;
}
}
}
if ( ( num[len-1] + num[len-1] ) > ( '9' + '0' ) )
{
num[len-1] = num[len-1] + num[len-1] - '9' - '1' + '0' ;
}
else
{
num[len-1] = num[len-1] + num[len-1] - '0' ;
}
}
else
{
if ( len > 1 )
{
for ( k = 0 ; k <= len - 2 ; k++ )
{
if ( ( num[k] + num[k] ) > ( '9' + '0' ) )
{
num[k] = num[k] + num[k] - '9' - '1' + '0' ;
if ( ( num[k+1] + num[k+1] ) > ( '9' + '0' ) )
num[k] = num[k] + '1' - '0' ;
}
else
{
num[k] = num[k] + num[k] - '0' ;
if ( ( num[k+1] + num[k+1] ) > ( '9' + '0' ) )
num[k] = num[k] + '1' - '0' ;
}
}
}
if ( ( num[len-1] + num[len-1] ) > ( '9' + '0' ) )
{
num[len-1] = num[len-1] + num[len-1] - '9' - '1' + '0' ;
}
else
{
num[len-1] = num[len-1] + num[len-1] - '0' ;
}
}
}
for ( k = 0 ; k <= len - 1 ; k++ )
cout << num[k] ;
cout << endl ;
return 0 ;
}
|
25
|
12,172 |
int main(){
double a,b;
cin>>a;
b=(double)pow(2,a);
cout<<fixed<<setprecision(0);
cout<<b<<endl;
return 0;
}
|
25
|
12,173 |
//********************************
//*?????2?N?? **
//*?????? 1300012861 **
//*???2013.11.17 **
//********************************
int main()
{
int N, i, j, len,t;
const int MAX_LEN = 200;
unsigned num[MAX_LEN];
memset(num, 0, sizeof(num)); //????
num[0] = 2;
len = 1;
cin >> N;
if ( N == 0 )
cout << 1 << endl;
else
{
for ( i = 2; i <= N; i++ )
{
t=0;
for ( j = 0; j < len; j++ )
{ num[j] = 2 * num[j]+t;
t=num[j]/10;
num[j]%=10;
}
if ( t > 0 )
{num[len]=t;len++;}
}
j = len;
while ( num[j] == 0)
j--;
for ( ; j >= 0; j-- )
cout << num[j];
cout << endl;
}
return 0;
}
|
25
|
12,174 |
int main()
{
char str[100];
int num[100],i;
memset(str,0,sizeof(str));
memset(num,0,sizeof(num));
int N;
cin>>N;
if(N==0) cout<<1<<endl;
else{
str[0] = 2;
num[0] = 2;
while(N>1)
{
N--;
for(i=0;i<100;i++)
{
num[i] = num[i]*2;
}
for(i=0;i<100;i++)
{
if(num[i]>=10)
{
num[i] = num[i]-10;
num[i+1]++;
}
}
}
int k=99;
while(num[k]==0 && k>0) k--;
for(i=k;i>=0;i--)
cout<<num[i];
cout<<endl;
}
return 0;
}
|
25
|
12,175 |
int main()
{
int a[100]={1},*p;
int n;cin>>n;
if(n==0)
{cout<<1;return 0;}
for(int i=0;i<n;i++)
{
p=a;
for(int j=0;*p!=0||*(p+1)!=0||*(p+2)!=0;j++)
{
*p=(*p)*2;
p++;
}
for(int *q=a;*q!=0||*(q+1)!=0||*(q+2)!=0;q++)
{
if(*q>=10)
{*q=*q-10;*(q+1)=*(q+1)+1;}
}
}
if(*p==0)
p--;
while(p!=a)
{cout<<*p;p--;}
cout<<*p;
return 0;
}
|
25
|
12,176 |
int main()
{
int n, i, pos;
const int MAX = 200;
unsigned an[MAX]={0};
an[0] = 1;
cin >> n;
if(n==0)
cout << an[0];
else
{
while(n--)
{
for(i=0;i<MAX;i++)
an[i] = an[i] * 2;
for(i=0;i<MAX;i++)
if(an[i]>9)
{
an[i+1]+=an[i]/10;
an[i] = an[i] % 10 ;
}
}
for(i=MAX-1;an[i]==0;i--);
for(;i>=0;i--)
cout << an[i] ;
}
return 0;
}
|
25
|
12,177 |
int main()
{
int n=0,s[100]={0},i=0,k=0;
cin>>n;
s[1]=1;
for(k=1;k<=n;k++)
{
for(i=1;i<=80;i++)
{
s[i]=s[i]*2;
}
for(i=1;i<=79;i++)
{
if(s[i]>=10)
{s[i+1]++;s[i]=s[i]%10;}
}
}
for(i=80;i>=1;i--)
{
if(s[i]!=0)
break;
}
for(;i>=1;i--)
cout<<s[i];
return 0;
}
|
25
|
12,178 |
/**
* @file 1000012800_2.cpp
* @author ??
* @date 2010-12-15
* @description
* ??????:??2?N??
*/
int main()
{
int n, num[100] = {0}, count = 0;
num[0] = 1;
cin >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j <= count; j++)
num[j] *= 2;
for (int j = 0; j <= count; j++)
{
if ((num[j] / 10))
{
num[j + 1] += num[j] / 10;
num[j] = num[j] %10;
}
}
if (num[count + 1])
count++;
}
for (int i = count; i >= 0; i--)
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12,179 |
int main()
{
int a[100]={0},n,b,i,j,k;
a[99]=1;
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<100;j++)
{
if(a[j]*2>=10)
{
a[j-1]++;
b=a[j]*2-10;
}
if(a[j]*2<10)
b=a[j]*2;
a[j]=b;
}
}
for(j=0;j<100;j++)
{
if(a[j]!=0)
{
for(k=j;k<100;k++)
cout<<a[k];
break;
}
}
return 0;
}
|
25
|
12,180 |
int main()
{
int N;
cin >> N;
const int MAX_LEN = 210;
unsigned num[MAX_LEN + 1] = { 0 };
num[1] = 1;
for (int i = 1; i <= N; i++)
{
for (int k = 1; k <= N; k++)
num[k] *= 2;
for (int k = 1; k <= N; k++)
if (num[k] >= 10)
{
num[k + 1] = num[k + 1] + num[k] / 10;
num[k] = num[k] % 10;
}
}
int j = MAX_LEN;
while (num[j] == 0)
j--;
for (int k = j; k > 0; k--)
cout << num[k];
cout << endl;
return 0;
}
|
25
|
12,181 |
char multiply_2(char a[110])
{
int len=strlen(a);
int b[110]={0},c[110]={0};
for(int i=0;i<len;i++)
{
b[i]=a[len-i-1]-'0';
}
for(int i=0;i<len;i++)
{
if(b[i]*2+c[i]>=10)
{
c[i+1]++;
b[i]=b[i]*2+c[i]-10;
}
else
{
b[i]=b[i]*2+c[i];
}
}
int p=0;
if(c[len]>0)
{
p=1;
b[len]+=c[len];
}
if(p==1)
{
len++;
}
for(int i=0;i<len;i++)
a[i]=b[len-i-1]+'0';
return a[110];
}
int main()
{
int n=0;
cin>>n;
char a[110]={0};
a[0]='1';
for(int i=0;i<n;i++)
multiply_2(a);
cout<<a<<endl;
return 0;
}
|
25
|
12,182 |
int main()
{
int n, a[1000]={0}, j=0, i1;
memset(a,0,sizeof(a));
a[0] = 1;
cin >> n;
for(int i=0; i < n; i++)
{
for(int l=0;l < j+1; l++)
{
a[l] = 2 * a[l];
}
for(int k = j; k >= 0; k--)
{
if(a[k] > 9)
{
a[k+1] ++;
a[k] = a[k] -10;
j++;
}
else
{
continue;
}
}
}
for(i1 = j; i1 > 0; i1--)
{
if(a[i1] != 0)
{
break;
}
}
for(;i1 >=0; i1--)
{
cout << a[i1];
}
cout << endl;
return 0;
}
|
25
|
12,183 |
int main()
{
int ans[100]={0},flag=0;
ans[0]=1;
int n,i,j;
cin>>n;
for(j=1;j<=n;j++)
for(i=0;i<100;i++)
{
ans[i]=ans[i]*2+flag;
if(ans[i]>=10)
{
flag=1;
ans[i]=ans[i]%10;
}
else
flag=0;
}
for(i=99;i>=0;i--)
if(ans[i]!=0)
break;
for(j=i;j>=0;j--)
cout<<ans[j];
cout<<endl;
return 0;
}
|
25
|
12,184 |
int main()
{
int n,i,j,sz[100];
scanf("%d",&n);
for(i=0;i<99;i++){
sz[i]=0;
}
sz[99]=1;
for(j=1;j<=n;j++){
for(i=0;i<100;i++){
sz[i]=sz[i]*2;
}
for(i=0;i<100;i++){
if(sz[i]>=10){
sz[i]=sz[i]-10;
sz[i-1]=sz[i-1]+1;
}
}
}
for(i=0;i<100;i++){
if(sz[i]!=0){
for(j=i;j<100;j++){
printf("%d",sz[j]);
}
break;
}
}
return 0;
}
|
25
|
12,185 |
int main()
{
int n ;
cin>>n ;
char a[40] ;
for(int y = 0 ; y <= 39 ; y++)
{
a[y] = '0' ;
}
a[0] = '1' ;
int b[40] = {0} ;
int c = 0 ;
for(int i = 0 ; i<n ; i++)
{
for(int j = 0 ; j<=39 ; j++)
{
b[j] = (int)((a[j] - '0') * 2 + c) ;
c = 0 ;
if(b[j]>=10)
{
a[j] = (char)(b[j] - 10 + '0') ;
c = 1 ;
}
else
{
a[j] = (char)(b[j]+'0') ;
}
}
}
int k = 39 ;
for( ; k>=0 ; k--)
{
if((a[k]-'0')!=0)
break ;
}
for(; k>=0 ; k--)
{
cout<<a[k] ;
}
return 0;
}
|
25
|
12,186 |
int main()
{
int n,i,j,k=0,flag1,flag2;
cin>>n;
char c[200];
c[0]='1';
for(i=1;i<200;i++)
{
c[i]='0';
}
for(i=1;i<=n;i++)
{
flag1=0,flag2=0;
for(j=0;j<=k;j++)
{
if(c[j]-'0'<5)
{
c[j]=2*c[j]-'0'+flag2;
flag2=0;
}
else if(c[j]-'0'>=5)
{
c[j]=(2*(c[j]-'0'))%10+'0'+flag2;
flag2=1;
if(j == k)
flag1 = 1;
}
}
if( flag1 )
{
k++;
c[k]='1';
}
}
for(i=0;i<=k;i++)
{
cout<<c[k-i];
}
return 0;
}
|
25
|
12,187 |
/*
name:??2?N??
writer:???
time:2013.11.14
*/
int main ()
{
int n , i , num , j , len = 1 , m ;
char str[100] ;
memset(str,'0',99); //???
str[99] = '1' ; //??????0
cin >> n ; //????
for ( i = 1 ; i <= n ; i++ )
{
for ( j = 100 - len ; j <= 99 ; j++ )
{
num = str[j] - '0' ;
if ( str[j] <= '4' )
str[j] = str[j] + num ; //0-4????
else
{
str[j] = str[j] + num - 10 ; //5-9????10
for ( m = j - 1 ;;m--)
{
if ( m == 99 - len ) //????
len++;
if ( str[m] == '9' ) //??
{
str[m] = '0';
str[m-1] ++ ;
}
else
{
str[m]++ ;
break ;
}
}
}
}
}
for ( j = 100 - len ; j <= 99 ; j++ ) //??????
cout << str[j] ;
cout << endl ;
return 0 ;
}
|
25
|
12,188 |
int main()
{
int n;
cin >> n;
int num[50] = {0};
int num0[50] = {0};
int i, j;
int k = 1;
num[0] = 1;
for (i = 1; i <= n; i++)
{
for (j = 0; j < k; j++)
{
num[j] = num[j] * 2;
num0[j] = num[j] / 10;
num[j] = num[j] % 10;
}
for (j = 0; j < k; j++)
num[j + 1] += num0[j];
if (num[k] != 0)
k++;
}
for (i = k - 1; i >= 0; i--)
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12,189 |
/**
*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 )
{
i-- ;
*( q + j ) = *( p + i ) ;
j++ ;
}
i = 0 ;
while ( *( p + i ) != '\0' )
{
*( p + i ) = *( q + i ) ;
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,190 |
int main()
{
int a[100];
int i,n,k,j;
cin>>n;
for(i=0;i<100;i++)
a[i]=0;
a[0]=1;
for(k=1;k<=n;k++)
{
for(i=0;i<100;i++)
a[i]=2*a[i];
for(i=0;i<100;i++)
if(a[i]>=10)
{
a[i]=a[i]-10;
a[i+1]++;
}
}
for(i=99;i>=0;i--)
{
if(a[i]!=0)
{
j=i;
break;
}
}
for(i=j;i>=0;i--)
cout<<a[i];
return 0;
}
|
25
|
12,191 |
int main()
{
//??n???????num???????????add???????flag?????????????????
int n, num[50], add = 0, flag = 0;
//?num????
memset( num, 0, sizeof(num) );
//?num[0]??1
num[0] = 1;
cin >> n;
for ( int i = 0; i < n; i++ )//i????????????
{
for ( int j = 0; j < 50; j++ )//???????????????
{
num[j] = num[j] * 2;
num[j]+=add;
add = num[j] / 10;
num[j] = num[j] % 10;
}
}
for ( int i = 49; i >= 0; i-- )
//??????????????flag?????0??????????????????
if ( num[i] != 0 && flag == 0 )
{
cout << num[i];
flag++;
}
//??????????????
else
if ( flag )
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12,192 |
int main()
{
int a[1000];
a[0]=1;
int num,i;
for(i=1;i<1000;i++)
a[i]=-1;
cin>>num;
while(num--)
{
for(i=0;i<1000;i++)
{
if(a[i]!=-1)
{
a[i]*=2;
}
else
break;
}
for(i=0;i<1000;i++)
{
if(a[i]>9)
{
a[i]=a[i]%10;
if(a[i+1]==-1)
a[i+1]=0;
a[i+1]++;
}
else if(a[i]==-1)
break;
else
continue;
}
}
for(i=999;i>=0;i--)
{
if(a[i]!=-1)
cout<<a[i];
}
}
|
25
|
12,193 |
int main()
{
int N, num[40] = {0}, i, j, x = 0, t;
cin >> N;
if (N == 0)
cout << 1 << endl;
else
{
num[0] = 1;
for (i = 0; i < N; i++)
{
for (j = 0; j < 40; j++)
{
t = x;
x = num[j] * 2 / 10;
num[j] = num[j] * 2 % 10 + t;
}
}
i = 39;
while (num[i] == 0)
i--;
for (; i >= 0; i--)
cout << num[i];
cout << endl;
}
return 0;
}
|
25
|
12,194 |
int a[105][105] = {0};
int main()
{
int n;
int len = 0;
int i,j;
int flag;
cin >> n;
a[1][1] = 2;
for( i = 1; i<= n -1 ; i++)
{
for(j = 1; j <= n; j++)
{
a[i+1][j] = (a[i][j] * 2 + a[i+1][j]) % 10;
a[i+1][j+1] = (a[i][j] * 2 / 10 + a[i+1][j+1]) % 10;
}
}
for(i = n ; i >= 1; i--)
{
if(a[n][i] != 0)
{
flag = 1;
len = i;
break;
}
}
for(i = len; i >= 1; i--)
printf("%d",a[n][i]);
if(n == 0)
{
printf("1\n");
}
return 0;
}
|
25
|
12,195 |
int main()
{
int a[101]={0};
int b[101];
int n,i,j;
cin >>n;
a[0]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<i;j++)
{
if(j==0)
{
b[j]=(a[j]*2)/10;
a[j]=(a[j]*2)%10;
}
else
{
b[j]=(a[j]*2+b[j-1])/10;
a[j]=(a[j]*2+b[j-1])%10;
}
}
}
for(i=100;i>=0;i--)
{
if(a[i]!=0)
{
for(j=i;j>=0;j--)
{
cout <<a[j];
}
break;
}
}
return 0;
}
|
25
|
12,196 |
int i,k,num[50]={0},temp[50]={0};
int mul()
{
int m;
for(m=0;m<50;m++)
{
temp[m]=temp[m]+num[m]*2;
if(temp[m]>=10)
{
temp[m+1]++;
temp[m]=temp[m]%10;
}
}
for(m=0;m<50;m++)
num[m]=temp[m];
for(m=0;m<50;m++)
temp[m]=0;
return 0;
}
int main()
{
cin>>k;
num[0]=2;
if(k!=0)
{for(i=0;i<k-1;i++)
mul();
for(i=1;num[50-i]==0;i++);
for(;i<=50;i++)
cout<<num[50-i];}
else
cout<<1;
return 0;
}
|
25
|
12,197 |
/**
* ????1000012815_2.cpp
* ?????2?N??
* ??????
* ???2010.12.15
*/
int main()
{
int n;
cin >> n; //??2?N??????
//number???????????flag???????????????
int number[101], flag[101] = {0};
memset(number, -1, sizeof(number)); //?number?????-1
number[100] = 1; //?????????1
int i, j;
for (j = 1; j <= n; j++) //?????
{
for (i = 100; number[i] != -1; i--) //????????2
if (number[i] * 2 > 9) //????????
{
number[i] = number[i] * 2 - 10;
flag[i - 1] = 1; //??????????????1
}
else
number[i] *= 2;
for (i = 99; number[i + 1] != -1; i--) //?????????
if (flag[i] == 1)
if (number[i] != -1) //??????????????1
number[i]++;
else
number[i] = 1; //?????????1
memset(flag, 0, sizeof(flag)); //???????
}
int noZero = 0;
while (number[noZero] == -1) //????????
noZero++;
for (j = noZero; j <= 100; j++) //???????
cout << number[j];
cout << endl;
return 0;
}
|
25
|
12,198 |
int main()
{
int n;
int flag=1;
cin>>n;
int result[109];
memset(result,0,sizeof(result));
result[1]=1;
while(n>0)
{
n--;
for(int i=1;i<=100;i++)
result[i]=result[i]*2;
for(int i=1;i<=100;i++)
if(result[i]>=10)
{
result[i]=result[i]-10;
result[i+1]++;
}
}
for(int i=99;i>=1;i--)
{
if(result[i]>1e-6)
flag=0;
if(flag==0)
cout<<result[i];
}
return 0;
}
|
25
|
12,199 |
char answer[1000000]={'1'};
int temp[1000000]={0};
int main()
{
int n;
cin>>n;
if (n==0)
cout<<'1';
else{
int i,j;
for (j=0;answer[j]!='\0';j++)
temp[j]= answer[j]-'0';
for (int k=1;k<=n;k++)
{
for (i=0;i<j;i++)
temp[i]=temp[i]*2;
for (i=0;i<j;i++)
{
if (temp[i]>=10)
{
temp[i+1] += temp[i]/10;
temp[i]=temp[i]%10;
}
}
while (temp[i]==0)
i--;
j=i+1;
}
for ( j=i;j>=0;j--)
cout<<temp[j];
}
return 0;
}
|
25
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.