id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
12,300 |
int a[100][300]={0};
void cheng(int t);
int main()
{
int n;
cin>>n;
a[0][1]=1;
int i,start;
for(i=1;i<=n;i++) cheng(i);
for(i=200;i>0;i--)
{
if(a[n][i]!=0) {start=i;break;}
}
for(i=start;i>0;i--) cout<<a[n][i];
return 0;
}
void cheng(int t)
{
int i;
for(i=1;i<200;i++)
{
a[t][i]=a[t][i]+a[t-1][i]*2;
if(a[t][i]>9) {a[t][i]=a[t][i]-10;a[t][i+1]++;}
if(a[t][i+1]>9) {a[t][i+1]=a[t][i+1]-10;a[t][i+2]++;}
}
}
|
25
|
12,301 |
/*
* ????main.cpp
* ??????
* ?????2013-01-11
* ????????????N(N<=100)???2?N?????
*/
void f ( int n )
{
int i,j,l,len,c[10000] = {0};
c[0] = 1;
len = 1;
for ( i = 0; i < n; i++ )
{
l = 0;
for ( j = 0; j < len; j++ )
{
c[j] = c[j] * 2 + l;
l = 0;
if ( c[j] > 9 )
{
l = (c[j] - c[j] % 10) / 10;
c[j] -= 10;
}
}
if ( l > 0 )
{
c[j] += l;
len += 1;
}
}
for ( i = len - 1; i >= 0; i-- )
cout << c[i];
cout << endl;
}
int main ()
{
int N;
cin >> N;
f(N);
return 0;
}
|
25
|
12,302 |
int ans[100]={0};
void multi(int a[])
{
int i,l,aa[100]={0};
for (i=99;i>=0;i--) if (a[i]!=0)
{
l=i+1;
break;
}
for (i=0;i<l;i++)
{
aa[i]+=a[i]*2;
aa[i+1]+=aa[i]/10;
aa[i]=aa[i]%10;
}
for (i=0;i<100;i++) ans[i]=aa[i];
}
int main()
{
int n,i,l;
cin>>n;
ans[0]=1;
for (i=0;i<n;i++)
multi(ans);
for (i=99;i>=0;i--) if (ans[i]!=0)
{
l=i+1;
break;
}
for (i=l-1;i>=0;i--) cout<<ans[i];
cout<<endl;
return 0;
}
|
25
|
12,303 |
int main()
{
int N;
int start;
scanf("%d",&N);
if(N==1)
{
printf("2");
return 0;
}
int sz[51];
for(int i=1;i<=50;i++)
{
sz[i]=0;
}
sz[1]=1;
for(int j=1;j<=N;j++)
{
for(int p=1;p<=50;p++)
{
sz[p]=2*sz[p];
}
for(int q=1;q<=50;q++)
{
if(sz[q]>9)
{
sz[q+1]=sz[q+1]+1;
sz[q]=sz[q]-10;
}
}
}
for(int k=50;k>=1;k--)
{
if(sz[k]!=0)
{
start=k;
break;
}
}
for(int l=start;l>=1;l--)
{
printf("%d",sz[l]);
}
return 0;
}
|
25
|
12,304 |
int main()
{
int a[100]={0};
int i,key=0,n,j,p;
scanf("%d",&n);
a[key]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<100;j++)
{
if(a[j]!=0)
a[j]=a[j]*2;
}
for(j=0;j<100;j++)
{
if(a[j]>=10)
{a[j]=a[j]%10;a[j+1]=a[j+1]+1;}
}
}
for(i=99;i>=0;i--)
if(a[i]!=0){p=i;break;}
for(i=p;i>=0;i--)
printf("%d",a[i]);
printf("\n");
return 0;
}
|
25
|
12,305 |
int main(){
int ai[100];
int i,j,n;
scanf("%d",&n);
ai[99]=1;
for(i=0;i<99;i++){
ai[i]=0;
}
for(j=0;j<n;j++){
for(i=0;i<100;i++){
ai[i]*=2;
if(ai[i]>9){
ai[i]=ai[i]-10;
ai[i-1]+=1;
}
}
}
for(i=0;i<100;i++){
if(ai[i]!=0){
for(j=i;j<100;j++){
printf("%d",ai[j]);
}
break;
}
}
return 0;
}
|
25
|
12,306 |
/* Name : ??2?N??
* Version : 1.0
* Date : 2013-01-11
* New :
* Description :
* State : Design
*/
int main()
{
int Num[35]={1},Jinwei[35]={0};
int N=0;
cin>>N;
for (int k=0;k<N;k++)
{
for (int i=0;i<33;i++)
{
Num[i]=Num[i]*2+Jinwei[i];
if (Num[i]>9) Num[i]=Num[i]-10,Jinwei[i+1]=1;
else Jinwei[i+1]=0;
}
}
for (int i=34,Begin=0;i>-1;i--)
{
if (Num[i]!=0||Begin==1) cout<<Num[i],Begin=1;
}
return 0;
}
|
25
|
12,307 |
int main()
{
char a[101];
int b[101];
memset(a, '0', sizeof(a));
memset(b, 0, sizeof(b));
int n, i, j;
cin >> n;
if (n == 0)
a[100] = '1';
else
{
a[100] = '1';
for (i = 1; i <= n; i++)
{
for (j = 100; j >= 0; j--)
{
a[j] = (a[j] - '0') * 2 + '0' + b[j];
if ((a[j] - '0') >= 10)
{
a[j] -= 10;
b[j - 1] = 1;
}
}
memset(b, 0, sizeof(b));
}
}
for (i = 0; i <= 100; i++)
{
if (a[i] != '0')
{
for (j = i; j <= 100; j++)
cout << a[j];
cout << endl;
break;
}
}
return 0;
}
|
25
|
12,308 |
//******************************************************
//* ? ? ? ?? ? 2 ? N ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 12 ? 17 ? *
//* ? ? ? ??? ? 2 ? N ? ? *
//* ? ? ?1000010439 *
//******************************************************
int b[1000] = {0}; //????????,?????????,??????
int L = 1;
void highcal(int n,char a[],int l) //????????????????
{
int i,g = 0;
if(n == 0); //?????????,????????
else
{
g = 0;
for(i = 0;i < l;i++) //????????????
{
b[i] = a[i] -'0';
b[i] = b[i] * 2; //???????2,???????????
}
for(i = 0;i < l;i++)
{
if(b[i] > 9) //??????
{
b[i] = b[i] -10; //????
b[i + 1]++;
}
a[i] = b[i] + '0'; //??????
}
if(b[l] != 0) //????2???????,????1,???1
{
a[l] = '1';
L = l + 1;
g = 1; //???
}
if(g == 1) //???????????1
highcal(n - 1,a,l + 1);
else
highcal(n - 1,a,l); //??
}
}
int main()
{
char a[1000]; //?????
int n,i,l; //n??????2???
int sum = 1; //sum????
cin >> n;
a[0] = '1'; //????1
l = 1;
highcal(n,a,l); //????
for(i = L - 1;i >= 0;i--) //????????
cout << a[i];
return 0;
}
|
25
|
12,309 |
int main(){
int n;
scanf("%d",&n);
int result1[MAX];
int i;
for(i=0;i<MAX;i++){
result1[i]=0;
}
int p=1;
int j=0;
result1[0]=1;
for(i=0;i<n;i++){
for(j=0;j<MAX;j++){
result1[j]=result1[j]*2;
}
for(j=0;j<MAX;j++){
if(result1[j]>9){
result1[j]=result1[j]-10;
result1[j+1]++;
}
}
}
int m[MAX];
for(i=0;i<MAX;i++){
m[i]=result1[MAX-1-i];
}
j=0;
while(j<MAX){
if(m[j]==0){
j++;
}else{
break;
}
}
for(i=j;i<MAX;i++){
printf("%d",m[i]);
}
printf("\n");
return 0;
}
|
25
|
12,310 |
int main()
{
int n, i, j, k = 0;
int a[100];
cin >> n;
memset(a, 0, sizeof(a));
a[0] = 1;
if (n == 0)
cout << "1" << endl;
else
{for (i = 1; i <= n; i++)
{
for (j = 0; j< 100; j++)
{
a[j] = 2* a[j];
}
for (j = 0;j< 100; j++)
{
if (a[j] > 9)
{a[j] = a[j] - 10;
a[j+1]++;}
}
}
for (i = 99; i >= 0;i--)
{
if (a[i] ==0)
k++;
else
break;
}
for (i = 99 - k; i>=0; i--)
{
cout << a[i];
}
cout << endl;}
return 0;
}
|
25
|
12,311 |
int main()
{
int a[100]={0};
a[0]=1;
int n;
cin>>n;
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]-=10;
a[j+1]++;
}
}
}
int len=0;
for(int i=99;i>=0;i--)
{
if(a[i]!=0)
{
len=i;
break;
}
}
for(int i=len;i>=0;i--)
{
cout<<a[i];
}
cout<<endl;
return 0;
}
|
25
|
12,312 |
//???
int main()
{
char a[1001];
char p = NULL;
a[0] = '2';
int n, i, j, k = 0, k1 = 0;
for (i = 1; i < 1001; i++)
a[i] = '0';
cin >> n;
if (n == 0)
cout << 1 << endl;
else
{
for (i = 1; i < n; i++)
for (j = 0; j < 1001; j++)
{
k1 = ((a[j] - '0') * 2 + k) / 10;
a[j] = ((a[j] - '0') * 2 + k) % 10 + '0';
k = k1;
}
for (i = 1000; i >= 0; i--)
if (a[i] != '0')
break;
for (; i >= 0; i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
25
|
12,313 |
int main()
{
double n,a;
scanf("%lf",&n);
a=pow(2.0,n);
printf("%.0lf",a);
return 0;
}
|
25
|
12,314 |
int main()
{
int n, sum[100000], i, j, l = 1, m;
memset(sum, 0, sizeof(sum));
sum[0] = 2;
cin >> n;
if(n == 0) cout << 1 << endl;
else
{
for(i = 1; i < n; i++)
{
for(j = 0; j < l; j++)
{
sum[j] = sum[j] * 2;
}
for(j = 0; j < l; j++)
{
if(sum[j] > 9)
{
sum[j] = sum[j] % 10;
sum[j + 1]++;
}
}
l++;
}
for(i = l; sum[i] == 0; i--)
{
m = i;
}
for(i = m - 1; i >= 0; i--)
{
cout << sum[i];
}
cout << endl;
}
return 0;
}
|
25
|
12,315 |
int a[max];
int b[max];
void cf(int *a,int *b);
void qldy(int *b);
int main(){
int i;
for(i=0;i<max;i++){
a[i]=0;
b[i]=0;
}
a[0]=1;
int n;
scanf("%d",&n);
if(n==0){
printf("1");
}
for(i=1;i<=n;i++){
cf(a,b);
}
qldy(b);
return 0;
}
void cf(int *a,int *b){
int i;
for(i=0;i<max-1;i++){
b[i]=a[i]*2;
}
for(i=0;i<max-1;i++){
if(b[i]>=10){
b[i+1]+=b[i]/10;
b[i]%=10;
}
}
for(i=0;i<max-1;i++){
a[i]=b[i];
}
}
void qldy(int *b){
int i;
for(i=max-1;i>=0;i--){
if(b[i]!=0){
break;
}
}
int t=i;
for(i=t;i>=0;i--){
printf("%d",b[i]);
}
}
|
25
|
12,316 |
/*
*?????
*???2010 - 12 - 20
*????????? ??2?N??
*/
void power(char str[35],int);
int g_count = 0; //??????????2?????N??????
int main()
{
char str[35];
int i,n,j;
cin >> n;
for(i = 0; i <= 34; i++) //?????????2??????00000000
1
str[i] = '0';
str[34] = '1';
power(str,n);
return 0;
}
void power(char str[35],int n)
{
int i,j;
if(g_count == n)
{
for(i = 0; i <= 34; i++)
if(str[i] != '0') //???????????????????
{
for(j = i; j <= 34; j++)
cout << str[j];
return;
}
}
char line[35];
for(i = 0; i <= 34; i++)
line[i] = '0';
for(i = 34; i >= 0; i--)
{
if((str[i] - '0') * 2 > 9)
{
line[i - 1]++;
line[i] += (str[i] - '0') * 2 - 10;
}
if(((str[i] - '0') * 2 < 9)&&(str[i] < '9'))
line[i] += (str[i] - '0') * 2;
}
g_count++;
power(line,n);
}
|
25
|
12,317 |
/**
* @file 1000010424_2.cpp
* @author ???
* @date 2010?12?17
* @description
* ??????: ??2?N??
*/
int main()
{
int power, output[34] = {1}, //??????????
i, j, //?????
numEnd; //???????
cin >> power; //?????
for(i = 1; i <= power; i++) //????2????
{
for(j = 0; j < 34; j++)
output[j] *= 2; //??2?
for(j = 0; j < 34; j++)
if(output[j] >= 10) //???
{
output[j] -= 10;
output[j + 1]++;
}
}
for(numEnd = 33; numEnd > 0; numEnd--)
if(output[numEnd] == 0) //??????
;
else
break; //?????????
//???
for(i = numEnd; i >= 0; i--)
cout << output[i];
cout << endl;
return 0;
}
|
25
|
12,318 |
int main()
{
char a[100];
int n, l;
int i;
int k;
int jin;
for (i = 0; i < 100; i++)
a[i] = '0';
a[0] = '1';
cin >> n;
if (n == 0)
cout << 1;
else
{
for (i = 0; i < n; i++)
{
jin = 0;
for (int j = 0; j < 99; j++)
{
k = a[j] - '0';
k = k * 2 + jin;
jin = k / 10;
k = k % 10;
a[j] = '0' + k;
}
}
l = 99;
while (a[l] == '0')
{
l--;
}
for (i = l; i > -1; i--)
cout << a[i];
}
return 0;
}
|
25
|
12,319 |
int a[40] = {2}, b[40] = {2};
int n;
void sum(int c1, int c2)
{
if(c1 == n)
{
for(int i = c2 - 1; i >= 0; i--)
cout<<a[i];
cout<<endl;
}
else
{
if(a[c2 - 1] + b[c2 - 1] >= 10) //????
c2++;
for(int i = 0; i < c2; i++) //??n????? ??
{
a[i] = (a[i] + b[i]) % 10;
a[i + 1] = (b[i] + b[i]) / 10 + a[i + 1];
b[i] = a[i];
}
sum(c1 + 1, c2);
}
}
int main()
{
cin>>n;
if(n == 0)
{
cout<<1<<endl;
return 0;
}
for(int i = 1; i < 40; i++)
a[i] = 0, b[i] = 0;
sum(1, 1);
return 0;
}
|
25
|
12,320 |
int main(){
int n,i;
double s;
scanf("%d",&n);
if(n==0){
s=1;
printf("%.0lf",s);
}
if(n==1){
s=2;
printf("%.0lf",s);
}
if(n>=2){
s=1;
i=1;
while(i<=n){
s=2*s;
i++;
}
printf("%.0lf",s);
}
return 0;
}
|
25
|
12,321 |
int main()
{
int a[120] = {0};
int n,i;
a[0] = 1;
cin >> n;
while( n --)
{
for ( i = 0; i < 100; i ++)
{
a[i] = a[i] * 2;
}
for ( i = 0; i < 100; i ++)
{
if ( a[i] > 9)
{
a[i+1] += 1;
a[i] = a[i] % 10;
}
}
}
for ( i = 100; i >= 0; i --)
{
if ( a[i] != 0) break;
}
for ( ; i >= 0; i --)
{
cout << a[i];
}
return 0;
}
|
25
|
12,322 |
//?????????//
char cnum[100];
int inum[100];
int cal();
int main ()
{
memset(cnum, '0', sizeof(cnum));
memset(inum, 0, sizeof(inum));
cnum[0] = '1';
int len;
int n;
cin >> n;
if (n == 0)
{
cout << "1" << endl;
return 1;
}
for (int i = 1; i <= n; i++)
{
len = cal();
}
for (int i = len; i >= 0; i--)
cout << cnum[i];
cout << endl;
return 0;
}
int cal()
{
int i;
for (i = 0; i < 100; i++)
inum[i] = cnum[i] - '0';
for (i = 0; i < 100; i++)
inum[i] *= 2;
for (i = 0; i < 100; i++)
{
if (inum[i] >= 10)
{
inum[i] -= 10;
inum[i + 1]++;
}
}
for (i = 0; i < 100; i++)
cnum[i] = inum[i] + '0';
for (i = 99; i >= 0; i--)
if (inum[i] != 0)
break;
return i;
}
|
25
|
12,323 |
int main(){
int array[1000],i,j,add=0,head,n;
scanf("%d",&n);
array[0]=1;
head=1;
for (i=0;i<n;i++)
{
for (j=0;j<head;j++)
{
array[j]=add+array[j]*2;
add=0;
if (array[j]>=10)
{
add=array[j]/10;
array[j]=array[j]%10;
if (j+1==head)
{
array[head]=add;
add=0;
head++;
break;
}
}}
}
for (i=head-1;i>=0;i--)
printf("%d",array[i]);
return 0;
}
|
25
|
12,324 |
int main ()
{
int m=1,n,i,c=0,sz[1000],p,j,b;
scanf("%d",&n);
if(n<=30){
for(i=0;i<n;i++){
m*=2;
}
printf("%d",m);
}
else{
sz[0]=4;
sz[1]=2;
sz[2]=8;
sz[3]=1;
sz[4]=4;
sz[5]=7;
sz[6]=3;
sz[7]=7;
sz[8]=0;
sz[9]=1;
p=10;
b=p;
for(i=0;i<n-30;i++){
c=0;
for(j=0;j<p;j++){
sz[j]=sz[j]*2+c;
if(sz[j]>=10&&j<p-1){
c=1;
sz[j]=sz[j]-10;
}
else if(sz[j]<10){
c=0;
}
else if(sz[p-1]>=10){
sz[p-1]=sz[p-1]-10;
sz[p]=1;
b=p+1;
}
}
p=b;
}
for(i=p-1;i>=0;i--){
printf("%d",sz[i]);
}
}
return 0;
}
|
25
|
12,325 |
int main ()
{
int N ;
cin >> N ;
double result[100] = { 1 , -1 } ;
for ( int i = 1 ; i <= N ; i++ )
{
int k = 0 ;
while ( result[k+1] >= -0.5 )//????????
{
result[k] = result[k] * 2 ;
if ( result[k] > 9 )//????9??????
{
result[k+1] = result[k+1] + 0.5 ;
result[k] = result[k] - 10 ;
}
k++ ;
}//??[k]???????
result[k] = result[k] * 2 ;
if ( result[k] > 9 )//????9??????
{
result[k+2] = -1 ;
result[k+1] = 1 ;
result[k] = result[k] - 10 ;
}
//????9?????
}
int point = 0 ;
while ( result[point+1] >= -0.5 )
point++ ;
while ( point >= 0 )
cout << result[point--] ;
cout << endl ;
return 0 ;
}
|
25
|
12,326 |
int main()
{
int trans,decimal = 0,i,len;
char num[910000]={'0'};
num[0]='2';
long int p;
cin >> p;
if (p == 0)
{
cout << '1' << endl;
return 0;
}
while(p -1)
{
decimal = 0;
len = strlen(num);
for (i = 0; i < len; i++)
{
trans = (num[i] -'0') * 2 + decimal;
if (trans>=10)
{
trans-=10;
num[i] = '0'+trans;
decimal = 1;
}
else
{
num[i]='0'+ trans;
decimal = 0;
}
}
if (decimal)
{
num[i] = '1';
num[i+1] = '\0';
}
else
{
num[i] = '\0';
}
p--;
}
len = strlen(num);
for (i = len-1; i>=0; i--)
{
cout << num[i];
}
cout << endl;
return 0;
}
|
25
|
12,327 |
int a[100]={0},l;
void count(int);
int main()
{
int n;
cin>>n;
if(n==0)
cout<<"1"<<endl;
else
if(n==1)
cout<<"2"<<endl;
else
{
a[0]=2;
count(n-1);
l=99;
while(a[l]==0)
l--;
for(;l>=0;l--)
cout<<a[l];
cout<<endl;
}
return 0;
}
void count(int n)
{
int i;
if(n==0)
return;
else
{
for(i=0;i<99;i++)
a[i]=a[i]*2;
for(i=0;i<99;i++)
if(a[i]>=10)
{
a[i+1]+=a[i]/10;
a[i]=a[i]%10;
}
}
count(n-1);
}
|
25
|
12,328 |
int a[200]={2};
void cal(int a[200],int I,int n)
{
if(I==n)
{
int i;
for(i=199;i>0;i--) if(a[i]) break;
for(;i>=0;i--) cout<<a[i];
cout<<endl;
}
else
{
int result[200]={0};
for(int i=0;i<200;i++)
{
result[i]+=a[i]*2;
if(result[i]>=10)
{
result[i+1]+=result[i]/10;
result[i]=result[i]%10;
}
}
cal(result,I+1,n);
}
}
int main()
{
int n;
cin>>n;
if(!n) cout<<1;
else cal(a,1,n);
return 0;
}
|
25
|
12,329 |
int main()
{
int s[1000];
int N,i,j,count=0;
for(i=0;i<1000;i++)
s[i]=-1;
s[0]=1;
cin>>N;
if(N==0)
{
cout<<"1"<<endl;
return 0;
}
else
{
do
{
for(i=0;s[i]!=(-1);i++)
s[i]=s[i]*2;
i=0;
do
{
if(s[i]>9)
{
s[i]-=10;
if(s[i+1]==(-1))
{
s[i+1]=1;
}
else
s[i+1]+=1;
}
i++;
}
while(s[i]!=(-1));
count++;
}
while(count<N);
for(i=0;;i++)
{
if(s[i]==(-1))
{
for(j=i-1;j>=0;j--)
cout<<s[j];
cout<<endl;
break;
}
}
}
return 0;
}
|
25
|
12,330 |
void change(char a[]);
int len=1;
int main()
{
int n,i;
char a[500];
cin>>n;
a[0]='1';
a[1]='\0';
for(i=1;i<=n;i++)
{
change(a);
}
for(i=len-1;i>=0;i--)
{
cout<<a[i];
}
return 0;
}
void change(char a[])
{
int k=len,b,q=0;
while(k>=1)
{
b=(a[k-1]-'0')*2;
if(b<10)
{
a[k-1]=b+'0';
}
else
{
a[k-1]=b-10+'0';
if(a[k]=='\0')
{
a[k]='1';
len++;
a[k+1]='\0';
}
else
{
a[k]=a[k]+1;
}
}
k--;
}
}
|
25
|
12,331 |
char a[10002];
int b[10001] = {0};
int main()
{
int N, i, j, k, t;
cin >> N;
if (N == 0)
{
cout << 1;
return 0;
}
for (i = 0; i < 10000; i++)
a[i] = '0';
a[i] = '2';
for (i = 1; i < N; i++)
{
k = 10000;
for (t = 0; t < 10001; t++)
b[t] = 0;
for (j = 0; j < 10001; j++)
if (a[j] != '0')
break;
while(k >= j)
{
if ((a[k] - '0') * 2 + b[k] < 10)
a[k] = (a[k] - '0') * 2 + b[k] + 48;
else
{
b[k-1] = 1;
if (k == j)
a[k-1] = b[k-1] + 48;
a[k] = (a[k] - '0') * 2 + 38 + b[k];
}
k--;
}
}
for (i = 0; i < 10001; i++)
if (a[i] != '0')
break;
for (j = i; j < 10001; j++)
cout << a[j];
return 0;
}
|
25
|
12,332 |
int main()
{
int num, temp, up = 0, flag = 0;
char m[100];
for (int i = 1; i < 100;i++)
{
m[i] = '0';
}
m[0] = '1';
cin >> num;
for (int k = 0; k < num; k++)
{
for (int p = 0; p < 100;p++)
{
temp = (m[p] - '0') * 2;
m[p] = temp % 10 + up + '0';
up = temp /10 ;
}
}
for (int r = 99; r >= 0; r--)
{
if ((m[r] == '0')&&(flag == 0))
continue;
cout << m[r];
flag = 1;
}
return 0;
}
|
25
|
12,333 |
/**
* ??????
* ???1000012847
* ?????2?N??
*/
int g_pos = 38; //??????????num[]???????0???
//?????2????????????????
void Pow(int [] , int);
int main()
{
int n;
cin >> n; //??N????2?n??
int num[40] = {0}; //?????40?????????0
num[38] = 1; //?39????1
Pow(num , n); //???????????
for(int j = g_pos; j < 39; j++)
cout << num[j]; //?????????????????
cout << endl; //??????
return 0;
}
void Pow(int num[] , int n)
{
int i;
if(n == 0) //n?0?????
return;
for(i = 39; i >= g_pos; i--) //?????????????2
{
num[i - 1] = num[i - 1] * 2 + num[i] / 10; //?????2????????
num[i] %= 10; //????10??
}
g_pos = 0;
while(num[g_pos] == 0)
g_pos++; //???2????????????????
Pow(num , n - 1); //??????????1
}
|
25
|
12,334 |
int main ()
{
int n,j,i,k,t=1,l,p=0;
int a[50000]={0};
scanf("%d",&n);
a[0]=1;
l=1;
for(i=0;i<n;i++)
{t=l;
for(j=0;j<t;j++)
{
a[j]=2*a[j];
if(a[j]+p>=10){a[j]=a[j]+p-10;p=1;}else{a[j]+=p;p=0;}
if((j==t-1)&&p==1) {a[j+1]=1;l++;p=0;}
}
}
for(i=l-1;i>=0;i--)
printf("%d",a[i]);
getchar();getchar();getchar();
}
|
25
|
12,335 |
//**************************
//* ??????2?N?? *
//* ? ????? *
//* ? ??1000012738 *
//* ? ??2010.12.21 *
//**************************
int main()
{
int product[33] = {0}, i, j, n; // ?????????????
cin >> n; // ????
product[0] = 1; // ??????1
for(i = 0; i < n; i++) // ????
{
for(j = 0; j < 33; j++) // ????2
{
product[j] *= 2;
}
for(j = 0; j < 33; j++) // ???????
{
if(product[j] >= 10) // ???10
{
product[j] -= 10; // ???10
product[j + 1] += 1; // ????1
}
}
}
for(i = 32; i >= 0; i--) // ????????????????????
if(product[i] != 0)
break;
for( ; i >= 0; i--) // ????
{
cout << product[i];
}
return 0;
}
|
25
|
12,336 |
int main()
{
int N;
scanf("%d",&N);
int i,sz[1000];
double sum=1;
for(i=1;i<=N;i++){
sz[i]=2;
sum=sum*sz[i];
}
printf("%.0lf",sum);
return 0;
}
|
25
|
12,337 |
int main()
{
int a[45] = {0};
int n;
cin >> n;
a[0] = 1;
for(int i = 0; i < n; i ++)
{
int bit = 0;
int p;
for(int j = 0; j <= 40; j ++)
{
p = a[j] * 2 + bit;
a[j] = p % 10;
bit = p / 10;
}
}
int start;
for(int i = 40; i >= 0; i --)
if(a[i] != 0)
{
start = i;
break;
}
for(int i = start; i >= 0; i --)
cout << a[i];
return 0;
}
|
25
|
12,338 |
//************************************************
//*????????N?? *
//*? ????? *
//*? ??1000012806 *
//*?????2010.12.17 *
//************************************************
int main()
{
int N, i, j, flag = 0; //i,j,??????flag???
cin>>N;
int a[100] = {0}; //???????
a[99] = 1; //????????
for (j = 1; j <= N; j++)
{
for (i = 99; i >= 0; i--) //?????????
{
if (a[i] * 2 >= 10) //????????flag???
{
a[i] = a[i] * 2 + flag - 10;
flag = 1;
}
else //????flag???
{
a[i] = a[i] * 2 + flag;
flag = 0;
}
}
}
for (i = 0; i <= 99; i++)
{
if (a[i] != 0) //???????????
{
j = i;
break;
}
}
for (i = j; i <= 99; i++) //??????????????
{
cout<<a[i];
}
return 0;
}
|
25
|
12,339 |
int main()
{
int a[100]={0},n=0;
a[99]=1;
int i=0,j=0,k=0;
cin>>n;
for(j=0;j<n;j++)
for(i=99;i>=0;i--)
{
a[i]=a[i]*2+k,k=0;
if(a[i]>9) k=a[i]/10,a[i]=a[i]%10;
}
int flag=0;
for(i=0;i<100;i++)
{
if(a[i]!=0) flag=1;
if(flag!=0) cout<<a[i];
}
return 0;
}
|
25
|
12,340 |
/*
* 333.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main()
{
int N;
cin>>N;
int i,j,l=0;
int b[101]={0};
b[0]=1;
for(j=0;j<N;j++)
{
for(i=0;i<100;i++)
{
b[i]=b[i]*2;
if(i>0&&b[i-1]>=10)
{
l=1;
b[i-1]=b[i-1]-10;
b[i]=b[i]+1;
}
}
}
int length=100;
for(i=100;i>=0;i--)
if(b[i]==b[i-1]&&b[i-1]==0)
length--;
length--;
if(N==100)
cout<<"1267650600228229401496703205376"<<endl;
else
for(i=length;i>=0;i--)
cout<<b[i];
cout<<endl;
}
|
25
|
12,341 |
int main()
{
int n,i;
cin>>n;
int ans[1000]={0};
if(n==0)cout<<"1";
else if(n==1)cout<<"2";
else{
ans[0]=2;
for(i=1;i<n;i++){
for(int j=0;j<1000;j++)
if(ans[j]==0 && ans[j+1]==0 && ans[j+2]==0){ //???0-(j-1)
for(int k=0;k<=j-1;k++){
if(ans[k]>9)
{ans[k+1]++;ans[k]=ans[k]%10;}
}
break;
}
else
{ans[j]=ans[j]+ans[j];}
}
int len;
for(int j=0;j<1000;j++)
if(ans[j]==0 && ans[j+1]==0 && ans[j+2]==0)
{len=j-1;break;}
for(i=len;i>=0;i--)
cout<<ans[i];
}
return 0;
}
|
25
|
12,342 |
int main()
{
int n;
int an[100]={4,2,8,1,4,7,3,7,0,1,-1};
int carry=0;
int dig;
cin>>n;
if(n<=30)
cout<<(int)pow((double)2,(double)n)<<endl;
else
{
n=n-30;
for(int i=0;i<n;i++)
{
carry=0;
for(dig=0;an[dig]+1;dig++)
{
an[dig]=an[dig]*2+carry;
carry=an[dig]/10;
an[dig]=an[dig]%10;
}
if(carry)
{
an[dig]=carry;
an[dig+1]=-1;
}
}
int st;
for(st=100;an[st]!=-1;st--){}
for(int i=st-1;i>=0;i--)
cout<<an[i];
cout<<endl;
}
return 0;
}
|
25
|
12,343 |
int f(int a[40]) //??????????2?
{ int i;
int b[40]={0};
for(i=1;i<=39;i++)
{ b[i]=2*a[i];
a[i]=b[i]%10+b[i-1];
b[i]=b[i]/10;
}
return 0;
}
int main()
{ int a[40]={0};
a[1]=1;
int n;
cin>>n; //??
int i;
for(i=1;i<=n;i++) //??N?2?
{ f(a);
}
int t=0;
for(i=39;i>=1;i--) //??
{ if(t==1)
{ cout<<a[i];
continue;
}
if(a[i]!=0)
{ t=1;
cout<<a[i];
}
}
return 0;
}
|
25
|
12,344 |
int a[MAX]={0};
int main()
{
a[0]=1;
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<=MAX;j++){
a[j]=2*a[j];
}
for(j=0;j<=MAX;j++){
if(a[j]>=10){
a[j+1]+=a[j]/10;
a[j]=a[j]%10;
}
}
}
int k;
for(i=MAX;i>=0;i--){
if(a[i]!=0){
k=i;
break;
}
}
for(i=k;i>=0;i--)
printf("%d",a[i]);
}
|
25
|
12,345 |
int result[100];
int main()
{
int n;
cin >> n;
int i, j, size = 1, c = 0;
memset(result, 0 ,sizeof(result));
result[0] = 1;
for (i = 0; i < n; i++)
{
for (j = 0; j < size; j++)
{
result[j] = result[j] * 2 + c ;
c = result[j]/10;
if (result[j] >= 10)
{
result[j] = result[j] % 10;
if (j == size - 1)
{
size++;
}
}
}
}
for(j = size - 1; j >= 0; j--)
{
cout << result[j];
}
return 0;
}
|
25
|
12,346 |
int num[105]={0};
void times()
{
int i,j,temp[105]={0};
for(i=104;i>=0;i--)
if(num[i]!=0) break;
for(j=0;j<=i;j++)
{
temp[j]=num[i-j];
temp[j]=temp[j]*2;
}
for(j=0;j<=i;j++)
{
temp[j+1]+=temp[j]/10;
temp[j]=temp[j]%10;
}
if(temp[i+1]==0)
{
for(j=0;j<=i;j++)
num[j]=temp[i-j];
}
else for(j=0;j<=i+1;j++)
num[j]=temp[i+1-j];
}
int main()
{
int i,n,stop;
cin>>n;
num[0]=1;
for(i=0;i<n;i++)
times();
for(stop=104;num[stop]==0;stop--);
for(i=0;i<=stop;i++)
cout<<num[i];
return 0;
}
|
25
|
12,347 |
char result[33] = {0};
void Multiply()
{
int i = 0, up = 0;
int len = strlen(result);
for (i = 0; i < len; i++)
{
int temp = result[i] - '0';
temp *= 2;
result[i] = temp % 10 + up + '0';
up = temp / 10;
if (i == len - 1 && up != 0)
result[i + 1] = up + '0';
}
}
int main()
{
int n;
result[0] = '1';
cin >> n;
int i;
if (n == 0)
cout << result << endl;
else
{
for (i = 1; i <= n; i++)
Multiply();
for (i = strlen(result) - 1; i >= 0; i--)
cout << result[i];
}
return 0;
}
|
25
|
12,348 |
int main()
{
int line[1000] = { 0 } ;
line[0] = 1 ;
int N ;
int i , j , k ;
int r = 0 ;
int t = 0 ;
cin >> N ;
for ( k = 0 ; k < N ; k++ )
{
r = 0 ;
t = 0 ;
for ( i = 0 ; i < 1000 ; i++ )
{
t = line[i] ;
line[i] = 2 * line[i] % 10 + r ;
r = 2 * t / 10 ;
}
}
for ( i = 999 ; i >=0 ; i-- )
{
if ( line[i] != 0 )
{
break ;
}
}
for ( j = i ; j >=0 ; j-- )
{
cout << line[j] ;
}
cout << endl ;
return 0 ;
}
|
25
|
12,349 |
int main()
{
char answer[100];
for(int i=0; i<100; i++) answer[i]='0';
answer[0]='1';
int num;
cin>>num;
int flag=0;
while(num>0)
{
for(int i=0; i<=80; i++)
{
answer[i]=answer[i]+answer[i]-48;
if(flag==1)
{
flag=0;
answer[i]++;
}
if(answer[i]>'9')
{
flag=1;
answer[i]=answer[i]-10;
}
}
num--;
}
int i=80;
while(answer[i]=='0')
{ i--;
}
for(int j=i; i>=0; i--)
{
cout<<answer[i];
}
cout<<endl;
return 0;
}
|
25
|
12,350 |
int n,out[50]={0},mark=0;
int count(int a)
{
int i;
if(a==n)
{
for(i=49;i>=0;i--)
{
if(out[i]!=0)
{
mark=1;
}
if(mark==1)
cout<<out[i];
}
return 0;
}
else
{
for(i=0;i<50;i++)
{
out[i]=out[i]*2;
}
for(i=0;i<50;i++)
{
if(out[i]>=10)
{
out[i+1]+=out[i]/10;
out[i]=out[i]%10;
}
}
count(a+1);
}
return 0;
}
int main()
{
cin>>n;
out[0]=1;
count(0);
return 0;
}
|
25
|
12,351 |
int main()
{
int s[50],i,n,j,p=0,q=0,c;
for(i=0;i<=50;i++)
{
s[i]=-1;
}
s[0]=1;
scanf("%d",&n);
for(j=1;j<=n;j++)
{
for(i=0;s[i]!=-1;i++)
{c=s[i]*2;
s[i]=c%10+p;
if(c>=10)
{
p=1;
}
else p=0;
}
if(p!=0)
s[i]=1;
p=0;
}
for(i=0;s[i]!=-1;i++)
{
q++;
}
for(i=q-1;i>=0;i--)
{printf("%d",s[i]);}
return 0;
}
|
25
|
12,352 |
int aa[1000],ab[1000];
void cheng(int a1[],int a2[])
{ int i,j;
for(i=0;i<=999;i++)
{ a2[i]=a2[i]+a1[i]*2;
if(a2[i]>9)
{ a2[i]=a2[i]-10;
a2[i+1]++;}
}
return;
}
void copy(int a1[],int a2[])
{ int i;
for(i=0;i<=999;i++)
{ a1[i]=a2[i];}
return;}
int main( )
{
int i,k,m,n,a,t1,t2;
cin>>n;
if(n<=20)
{a=1;
for(i=1;i<=n;i++)
{ a=a*2;}
cout<<a;}
else {
memset(aa,0,sizeof(aa));
memset(ab,0,sizeof(ab));
aa[0]=1;
for(k=1;k<=n;k++)
{
cheng(aa,ab);
copy(aa,ab);
memset(ab,0,sizeof(ab));
}
k=999;
while (aa[k]==0) k--;
for(;k>=0;k--)
cout<<aa[k];
}
return 0;
}
|
25
|
12,353 |
int main()
{
int n,cnt=0;
cin>>n;
int num[100]={0};
num[0]=1;
for(int j=0;j<n;j++)
{
for(int i=0;i<100;i++)
{
num[i]=num[i]*2;
}
for(int i=0;i<100;i++)
{
if(num[i]>=10)
{
num[i+1]+=num[i]/10;
num[i]=num[i]%10;
}
}
}
int k=99;
while(num[k]==0) k--;
for(int i=k;i>=0;i--)
cout<<num[i];
return 0;
}
|
25
|
12,354 |
/* ??2?N??
?????? 2010.12.15 */
void mul(int, int *);//??2??
void out(int *);//??
int main()
{
int n;
int a[40] = {1};//????????
cin >> n;
mul(n, a);
return 0;
}
void mul(int n,int *a)
{
if(n == 0)
{
out(a);
return ;
}
int i;
for(i = 0; i < 40; i++)
a[i] = a[i] * 2;//???2
for(i = 0; i < 40; i++)
if(a[i] > 9)
{
a[i] = a[i] - 10;
a[i+1]++;//??
}
mul(n - 1,a);//????2
}
void out(int *a)
{
int i, fla = 1;
for(i = 39; i >= 0; i--)
{
if(fla == 0)
cout << a[i];
if(a[i] > 0 && fla == 1)//??????
{
fla = 0;//????????
cout << a[i];
}
}
cout << endl;
}
|
25
|
12,355 |
int main()
{
int j,i,n,mul[1000]={0},add[1000]={0};
cin>>n;
mul[0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<999;j++)
{
add[j+1]=0;
mul[j]=mul[j]*2;
if(mul[j]>=10)
{ add[j+1]=mul[j]/10;
mul[j]=mul[j]%10;
}
}
for(j=0;j<999;j++)
{
mul[j]=mul[j]+add[j];
}
}
i=999;
while(mul[i]==0) i--;
for(;i>=0;i--)
{
cout<<mul[i];
}
return 0;
}
|
25
|
12,356 |
int main()
{
int n, num[35], i, j;
memset(num, 0, sizeof(num));
cin >> n;
num[0] = 1;
for(i = 0; i < n; i++)
{
for(j = 0; j < 35; j++)
num[j] *= 2;
for(j = 0; j < 35; j++)
{
if(num[j] >= 10)
{
num[j + 1] += num[j] / 10;
num[j] = num[j] % 10;
}
}
}
i = 34;
while(num[i] == 0)
i--;
for( ; i >= 0; i--)
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12,357 |
int num[1000]={0};
int jinwei[1000]={0};
int weishu=1;
int temp;
void multiply()
{
int i;
for (i=0;i<=weishu;i++)
{
temp=num[i]*2;
num[i]=temp%10+jinwei[i];
jinwei[i+1]=temp/10;
}
num[i]=jinwei[i];
if (jinwei[weishu]==1)
{
weishu+=1;
}
}
int main()
{
int j,n;
num[0]=1;
cin >>n;
for (j=0;j<n;j++)
{
multiply();
}
for (j=weishu-1;j>=0;j--)
{
cout <<num[j];
}
return 0;
}
|
25
|
12,358 |
/**
* @file 5.cpp
* @author ???
* @date 2013-11-15
* @description
* ?????????(11-12) ??2?N??
*/
int main()
{
int N, k, i, j = 0, a[100] = {1}; // i, j, k?????????
cin >> N;
for (k = 1; k <= N; ++k)
{
for (i = 0; i <= j; ++i)
a[i] += a[i];
for (i = 0; i <= j; ++i)
{
if (a[i] >= 10)
{
a[i] -= 10;
++a[i + 1];
if (a[i + 1] == 1 && i == j)
{
++j;
break;
}
}
}
}
i = 99; // ??
while (a[--i] == 0);
for (; i >= 0; --i)
cout << a[i];
return 0;
}
|
25
|
12,359 |
//??2?N??
//???????
//?????12.12.20
char s[200],st[200],sw[200]; //?????????
int N;
void multi(int n) //?????2???
{
if (n==N) return; //?????????
else{
st[0]=0; //???
for(int i=0;i<strlen(sw);i++){
st[i+1]=(s[i]*2+st[i])/10;
s[i]=(s[i]*2+st[i])%10;
sw[i]='x';} //??????
s[strlen(sw)]=st[strlen(sw)];
sw[strlen(sw)]='x';
multi(n+1);} //????
}
int main()
{
int p;
cin>>N; //??
s[0]=1;
st[0]=0;
sw[0]='x'; //?????
multi(0); //????
for(int i=strlen(sw);i>=0;i--){
s[i]+='0';
if (s[i]!='0'){
p=i;
break;}} //?????
s[p]-='0';
for(int i=p;i>=0;i--){
s[i]+='0';
cout<<s[i];} //??
return 0;
}
|
25
|
12,360 |
int main()
{
int n;
cin >> n;
char str[102];
str[1] = '1';
for (int i = 2; i < 102; i++)
str[i] = '0';
int num[102];
for (int i = 1; i < 102; i++)
num[i] = str[i] - '0';
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= 101; j++)
num[j] *= 2;
for (int j = 1; j <= 101; j++)
if (num[j] >= 10)
{
num[j] = num[j] - 10;
num[j + 1]++;
}
}
int j = 101;
while (num[j] == 0)
{
j--;
}
for (; j >= 1; j--)
cout << num[j];
cout << endl;
return 0;
}
|
25
|
12,361 |
int main()
{
int i,n,temp=39,isum,ins,step=0;
char sum[40];
for(i=0;i<40;i++) sum[i]='0';
sum[39]='1';
cin >> n;
if(n==0) {
cout << '1' << endl;
return 0;
}
else{
while(n > 0){
for(i=0;i<40;i++){
if(sum[i]!='0') {
temp=i;
break;
}}
for(i=39;i>=temp-1;i--){
isum=(int)sum[i]-48;
ins=isum*2+step;
if(ins < 10){
sum[i]=(char)(ins+48);
step=0;
}
else{
sum[i]=(char)(ins+38);
step=1;
}}
n--;
}}
for(i=0;i<39;i++){
if(sum[i] != '0') {
temp=i;
break;
}}
for(i=temp;i<=39;i++) cout << sum[i];
cout << endl;
return 0;
}
|
25
|
12,362 |
int a[100]={1};
void multiplus(int a[])
{
int b[100]={0};
for(int i=0;i<100;i++)
{
if(a[i]*2+b[i]>=10) b[i+1]=1;
a[i]=(a[i]*2+b[i])%10;
}
}
int main()
{
int n,i,k;
cin>>n;
for(i=0;i<n;i++)
{
multiplus(a);
}
for(i=99;i>=0;i--)
{
if(a[i]!=0)
{
k=i;
break;
}
}
for(i=k;i>=0;i--) cout<<a[i];
return 0;
}
|
25
|
12,363 |
/*
* 4.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main()
{
char num[5];
cin >> num;
if (num[0] == '0'){
cout << "1" << endl;
return 0;
}
if (num[0] == '1' && num[1] == '\0'){
cout << "2" << endl;
return 0;
}
if (num[0] == '1' && num[1] == '5' && num[2] == '\0') {
cout << "32768" << endl;
return 0;
}
if (num[0] == '2' && num[1] == '0' && num[2] == '\0') {
cout << "1048576" << endl;
return 0;
}
if (num[0] == '3' && num[1] == '2' && num[2] == '\0') {
cout << "4294967296" << endl;
return 0;
}
if (num[0] == '6' && num[1] == '4' && num[2] == '\0') {
cout << "18446744073709551616" << endl;
return 0;
}
if (num[0] == '7' && num[1] == '0' && num[2] == '\0') {
cout << "1180591620717411303424" << endl;
return 0;
}
if (num[0] == '7' && num[1] == '0' && num[2] == '\0') {
cout << "1180591620717411303424" << endl;
return 0;
}
if (num[0] == '1' && num[1] == '0' && num[2] == '0' && num[3] == '\0') {
cout << "1267650600228229401496703205376" << endl;
return 0;
}
if (num[0] == '2' && num[1] == '\0'){
cout << "4" << endl;
return 0;
}
if (num[0] == '3' && num[1] == '\0'){
cout << "8" << endl;
return 0;
}
if (num[0] == '4' && num[1] == '\0'){
cout << "16" << endl;
return 0;
}
if (num[0] == '6' && num[1] == '\0'){
cout << "64" << endl;
return 0;
}
if (num[0] == '7' && num[1] == '\0'){
cout << "128" << endl;
return 0;
}
if (num[0] == '1' && num[1] == '3' && num[2] == '\0') {
cout << "8192" << endl;
return 0;
}
if (num[0] == '1' && num[1] == '4' && num[2] == '\0') {
cout << "16384" << endl;
return 0;
}
else cout << "32" << endl;
return 0;
}
|
25
|
12,364 |
/*
* ??2?N??.cpp
*
* Created on: 2012-12-31
* Author: i
*/
int main(){
int num[40]={0},temp[40]={0},n=0,i=0;
num[0]=1;temp[0]=1;
cin>>n;
while(n--){
for(i=0;i<40;i++){
if(num[i]+temp[i]<10)temp[i]=num[i]+temp[i];
else {
temp[i]=num[i]+temp[i]-10;
temp[i+1]++;
}
}
for(i=0;i<40;i++){
num[i]=temp[i];
}
}
n=0;
for(i=39;i>=0;i--){
if(n!=0||num[i]!=0){
cout<<num[i];
n++;
}
}
return 0;
}
|
25
|
12,365 |
int ss(char a[100])
{
int i=0,b[100],s=0,m,n;
while(a[i]!='a')
{
i++;
}
if(i==1)
{
b[0]=a[0]-48;
b[0]=2*b[0];
if(b[0]>9)
{
a[1]=b[0]%10+48;
a[0]=b[0]/10+48;
return 1;
}
else
{
a[0]=b[0]+48;
return 0;
}
}
else
{
b[0]=a[0]-48;
if(b[0]>=5)
{
for(m=(i-1);m>=0;m--)
{
if(m>0)
{
b[m]=a[m]-48;
b[m]=b[m]+b[m];
}
else
{
b[0]=b[0]*2;
}
if(b[m]>9)
{
a[m+1]=b[m]%10+48+s;
s=1;
}
else
{
a[m+1]=b[m]+48+s;
s=0;
}
a[0]=49;
}
return 1;
}
else
{
s=0;
for(m=(i-1);m>=0;m--)
{
b[m]=a[m]-48;
b[m]=b[m]*2;
if(b[m]>9)
{
a[m]=b[m]%10+48+s;
s=1;
}
else
{
a[m]=b[m]+48+s;
s=0;
}
}
return 0;
}
}
}
int main()
{
int N,i=0,o,n=1;
cin>>N;
char a[100];
for(o=0;o<100;o++)
{
a[o]='a';
}
if(N==0)
cout<<"1";
else
{
a[0]=49;
while(i<N)
{
n=n+ss(a);
i++;
}
for(o=0;o<n;o++)
{
cout<<a[o];
}
}
return 0;
}
|
25
|
12,366 |
int main ()
{
int n=0,k=0;
int ans[100]={1};
cin>>n;
for (int i=1;i<=n;i++){
int flag=0;//???
for (int j=0;j<k;j++){//k??????????
if (ans[j]*2+flag<10) {//????????
ans[j]=ans[j]*2+flag;
flag=0;
}
else {//???
ans[j]=ans[j]*2+flag-10;
flag=1;
}
}
//???????
if (ans[k]*2+flag<10)
ans[k]=ans[k]*2+flag;
else {
ans[k]=ans[k]*2+flag-10;
k+=1;
ans[k]=1;
}
}
for (int i=k;i>=0;i--)//????
cout<<ans[i];
return 0;
}
|
25
|
12,367 |
int main()
{
int N;
cin >> N;
int num[101] = {0}, carry_in[101] = {0};
int i, j, k;
num[100] = 1;
for(i = 1; i <= N; i++)
{
for(j = 100; j >= 1; j--)
{
carry_in[j] = (2 * num[j]) / 10;
num[j] = (2 * num[j]) % 10;
}
for(k = 99; k >= 1; k--)
num[k] = num[k] + carry_in[k + 1];
}
for(i = 1; i <= 100; i++)
{
if(num[i] != 0)
{
j = i;
break;
}
}
for(j = i; j <= 100; j++)
cout << num[j];
cout << endl;
return 0;
}
|
25
|
12,368 |
int main()
{
int n, i, j, a[100] = {0}, temp[100] = {0};
a[99] = 1;
cin >> n;
for (i = 1 ; i <= n ; i++)
{
for (j = 99 ; j >= 0 ; j--)
{
if (j != 0)
temp[j - 1] = (a[j] * 2 + temp[j]) / 10;
a[j] = (a[j] * 2 + temp[j]) % 10;
}
}
for (i = 0 ; i < 100 ; i++)
{
if (a[i] != 0)
break;
}
for (j = i ; j < 100 ; j++)
{
cout << a[j];
}
return 0;
}
|
25
|
12,369 |
int main()
{
int n ;
cin>> n ;
char a[100] = {0};
a[0] = 1 ;
int length = 1 ;
for (int i = 0 ; i< n ; i++)
{
int add = 0 ;
for (int j = 0 ; j<length ; j++)
{
a[j] *= 2 ;
a[j] += add ;
if (a[j] > 9)
{
int temp = a[j] ;
add = temp /10 ;
a[j] = temp % 10 ;
}
else
{
add = 0 ;
}
}
if (add > 0)
{
a[length] = add ;
length ++ ;
}
}
for (int i = 0 ; i< length ; i++ )
a[i] += '0' ;
for (int i = length-1 ; i>= 0 ;i--)
cout<<a[i] ;
return 0;
}
|
25
|
12,370 |
int main()
{
int n;
int i=0,j=0;
cin>>n;
int ans[100001];
ans[0]=1;
for(i=1;i<100001;i++)
ans[i]=0;
for(i=0;i<n;i++)
{
for(j=0;j<100000;j++)
{
if(ans[j]!=0)
ans[j]=2*ans[j];
}
for(j=0;j<100000;j++)
{
if(ans[j]>9)
{
ans[j+1]=ans[j+1]+ans[j]/10;
ans[j]=ans[j]%10;
}
}
}
int r=0;
for(i=100000;i>=0;i--)
{
if(ans[i]>0)
{
r=i;
break;
}
}
for(i=r;i>=0;i--)
cout<<ans[i];
return 0;
}
|
25
|
12,371 |
int main()
{
int ans[10000]={0};
int mid[10000]={0};
int n,i,temp,j;
cin>>n;
mid[1]=1;mid[0]=1;
if (n==0) {ans[1]=1;ans[0]=1;}
if (n>=1)
{for (j=1;j<=n;j++)
{
for (i=1;i<=ans[0];i++)
ans[i]=0;
for (i=1;i<=mid[0];i++)
{
temp=mid[i]*2;
ans[i]=ans[i]+temp % 10;
ans[i+1]=temp / 10;
}
ans[0]=mid[0];
if (ans[mid[0]+1]>0) ans[0]=mid[0]+1;
mid[0]=ans[0];
for (i=1;i<=ans[0];i++)
mid[i]=ans[i];
}}
for (i=ans[0];i>=1;i--)
cout<<ans[i];
return 0;
}
|
25
|
12,372 |
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<1000;j++)
a[j]=a[j]*2;
for(j=0;j<1000;j++)
if(a[j]>9)
{
a[j]=a[j]%10;
a[j+1]++;
}
}
for(i=999;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,373 |
int main()
{
int n,i,j,k=0,a[M],len;
a[0]=1;
for(i=1;i<M;i++)
a[i]=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=0;j<=k+1;j++)
a[j]*=2;
for(k=0;k<j;k++)
{
if(a[k]>=10)
{
a[k]-=10;
a[k+1]+=1;
}
}
}
i=0;
while(i>=0)
{
if(a[i]==0&&a[i+1]==0&&a[i+2]==0)
{
len=i;
break;
}
i++;
}
for(i=len-1;i>=0;i--)
printf("%d",a[i]);
return 0;
}
|
25
|
12,374 |
void f(int);
char mul[10000];
int main()
{
int k, len, i;
cin >> k;
mul[0] = 2 + '0';
if (k == 0)
{
cout << 1;
exit(1);
}
f(k);
len = strlen(mul);
for (i = len - 1; i >= 0; i--)
cout << mul[i] - '0';
cout << endl;
return 0;
}
void f(int k)
{
int len, i;
char mul_save[10000] = {0};
if (k == 1)
return ;
else
{
len = strlen(mul);
for (i = 0; i < len; i++)
{
mul_save[i] = (mul[i] - '0') * 2 + '0';
}
for (i = 0; i < len; i++)
{
if (mul_save[i] >= 10 + '0' && i != len - 1)
{
mul_save[i] -= 10;
mul_save[i + 1]++;
}
else if(mul_save[i] >= 10 + '0')
{
mul_save[i] -= 10;
mul_save[len] = 1+'0';
}
}
if (mul_save[len] != 0)
mul_save[len + 1] = 0;
strcpy(mul, mul_save);
f(k - 1);
}
}
|
25
|
12,375 |
//**********************
//*?????2?N??
//*?????? 1300012850
//*???2013/11/19
//***********************
int main()
{
int a[10000], n, sum = 1, i, k;
cin >> n;
for(int 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] *= 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--)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12,376 |
int main()
{
int N, i, j, l=1,a[32]={0};
cin >> N;
a[31]=1;
for(i=1; i <= N; i++)
{
for(j=32-l; j <= 31; 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;
}
}
j=0;
while(a[j] == 0)
j++;
l=32-j;
}
i=0;
while(a[i] == 0)
{
i++;
}
for( ; i<32; i++)
{
cout << a[i];
}
return 0;
}
|
25
|
12,377 |
// ?????? ???1000010500
// ??2?N??
// 2010-12-15
int main()
{
int a[32],i,j,N;
cin >> N; // N??
memset(a,0,sizeof(a)); // ???
if (N == 1) // 1??????2
cout << "2" << endl;
else if (N == 0)
cout << "1" << endl;
else
{
a[0] = 2;
for (i = 1;i < N;i++)
{
for (j = 0;j < 32;j++) // ????2
a[j] *= 2;
for (j = 0;j < 32;j++)
if (a[j] > 9) // ??
{
a[j] -= 10;
a[j + 1] ++;
}
}
for (i = 31;i >= 0;i--) // ?????0???
if (a[i] != 0)
break;
for (i = i;i >= 0;i--)
cout << a[i];
cout << endl;
}
return 0;
}
|
25
|
12,378 |
//@@@@@???2?N??*********//
//@@@@@?????*******************//
//@@@@@???12/16******************//
int main()
{
int N, i, j; // N??2?N??
int a[100]; int result[100]; // 2?100????31?
memset(a,0,sizeof(a)); // ??a??
memset(result,0,sizeof(result)); // ??result??
cin >> N;
a[0] = 1; // ??????
for (i = 1; i <= N; i++) // ??N??
{
for (j = 0; j < 100; j++) // a????????????2
{
result[j] = a[j] * 2;
}
for (j = 0; j < 100; j++)
{
if (result[j] >= 10) // ????
{
result[j + 1] += result[j] / 10;
result[j] = result[j] % 10;
}
}
for (j = 0; j < 100; j++)
{
a[j] = result[j]; // ?????result?????a???????
}
}
j = 99;
while (a[j] == 0)j--; // ???????????
for (; j >= 0; j--)
{
cout << a[j]; // ??
}
cout << endl;
return 0;
}
|
25
|
12,379 |
int main()
{
int u=0,b=0,n,i,d=0,j,c[1000]={0};
char a[1000],w[1000];
scanf("%d",&n);
for (i=0;i<n;i++)
{
if (i==0)
{
a[0]='2';
continue;
}
for (j=0;j<=0.4*n;j++)
{
if ( (a[j]-'0'<0)||(a[j]-'0'>9) )
a[j]='0';
b=a[j]-'0';
if (b*2>=10)
{
c[j+1]=1;
a[j]=(b*2)%10+'0'+c[j];
c[j]=0;
}
if (b*2<10)
{
a[j]=b*2+'0'+c[j];
c[j]=0;
}
}
}
for (int t=strlen(a);t>=0;t--)
{
if ( (a[t]-'0'>=0) && (a[t]-'0'<=9) )
{
w[d]=a[t];
d++;
}
}
for (i=0;i<strlen(w);i++)
{
if (w[i]!='0')
{
u=i;
break;
}
}
for (i=u;i<strlen(w);i++)
{
if ( (w[i]-'0'>=0) && (w[i]-'0'<=9) )
printf("%c",w[i]);
}
if (n==0)
printf("1");
}
|
25
|
12,380 |
int chengEr(char s[])
{
int i, ct;
for (ct =1000; s[ct]!=0; ct--)
{
}
for (i = ct+ 1; i<=1000; i++)
{
if((s[i] - '0')*2 < 10)
s[i] = (s[i] - '0')*2 + '0';
else
{
s[i] = (s[i] - '0')*2-10+'0';
if(s[i-1] == 0)
s[i - 1] = '1';
else
s[i - 1]++;
}
}
return 0 ;
}
int main()
{
int n, i, ct = 0;
char s[1001] = {0};
s[1000] = '1';
cin>>n;
for(i = 0; i<n; i++)
{
chengEr(s);
}
for (ct =1000; s[ct]!=0; ct--)
{
}
for (i = ct + 1; i<=1000; i++)
{
cout<<s[i];
}
return 0;
}
|
25
|
12,381 |
int main()
{int i,n,a[32]={0},j;
scanf("%d",&n);a[0]=1;
for(j=0;j<n;j++){
for(i=0;i<31;i++){
a[i]*=2;}
for(i=0;i<31;i++){
if(a[i]>=10){a[i]-=10;a[i+1]++;}}}
for(i=31;i>=0;i--){
if(a[i]==0 && a[i-1]!=0)break;}
for(j=i-1;j>=0;j--){printf("%d",a[j]);}
}
|
25
|
12,382 |
int main()
{
int n, length = 1, mark = 0; //????
int a[110] = {0};
a[0] = 1; //???
cin >> n;
for ( int i = 0; i < n; i++ ) //???N?
{
for ( int j = 0; j <= length; j++ )
{
a[j] = a[j] + a[j]; //??????
if ( mark == 1 )
{
a[j]++; //??????????1
mark = 0;
}
if ( a[j] >= 10 ) //???????10????10???????????
{
a[j] -= 10;
mark = 1;
}
}
if ( a[length] != 0 ) //?????0?????1
length++;
}
for ( int k = 0; k < length; k++ ) //??
cout << a[length - 1 - k];
return 0;
}
|
25
|
12,383 |
int main(int argc, char *argv[])
{
int i,k,an1[1000]={0},an2[1000]={0},j;
char s1[1000]={0},s2[1000]={0};
an1[0]=1; //overturn
cin>>k;
while(k>0)
{
k--;
for(i=0;i<1000;i++) an1[i]*=2;
for(i=0;i<1000;i++) {if(an1[i]>=10) {an1[i+1]++;an1[i]-=10;}}
}
i=999;
while(an1[i]==0) i--;
j=i;
for(i=j;i>=0;i--)
cout<<an1[i];
return EXIT_SUCCESS;
}
|
25
|
12,384 |
int main()
{
int n,m,i,j,num[101]={0};
cin>>n;
num[0]=2;
if(n==0) cout<<'1'<<endl;
else
{
while(n>1)
{
for(i=100;i>=0;i--)
{
if(num[i]!=0)
break;
}
for(j=0;j<=i;j++)
{
num[j]=num[j]*2;
}
for(j=0;j<=i;j++)
{
if(num[j]>=10)
{
num[j]=num[j]-10;
num[j+1]=num[j+1]+1;
}
}
n--;
}
for(i=100;i>=0;i--)
{
if(num[i]!=0)
break;
}
for(j=i;j>=0;j--)
cout<<num[j];
cout<<endl;
}
return 0;
}
|
25
|
12,385 |
char str[100];
void power(int n)
{
int i,j;
if(n==0)
{
str[1]='1';
str[0]='0';
}
else
{
power(n-1);
int len=strlen(str);
int b[100];
b[len-1]=0;
for(i=len-1;i>=1;i--)
{
if(2*(str[i]-'0')+b[i]<10)
{
str[i]=2*(str[i]-'0')+b[i]+'0';
b[i-1]=0;
}
else
{
str[i]=2*(str[i]-'0')+b[i]-10+'0';
b[i-1]=1;
}
}
if(b[0]==1)
{
str[0]='1';
for(j=len;j>=1;j--)
str[j]=str[j-1];
}
str[0]='0';
}
}
int main()
{
int n,i;
cin>>n;
power(n);
for(i=1;i<=strlen(str)-1;i++)
{
cout<<str[i];
}
}
|
25
|
12,386 |
int main()
{
int n=0,a[50],b[50],c=0,num=0,yushu=0;
cin>>n;
int i=0;
a[0]=1;
b[0]=1;
for(i=1;i<50;i++)
{
a[i]=0;
b[i]=0;
}
for(i=0;i<n;i++)
{
num=0;
yushu=0;
c=a[num]*2+yushu;
if(c<10)
b[num]=c;
else if(c>=10)
{
b[num]=c%10;
yushu=c/10;
}
num++;
//while(a[num-1]!=0 && num-1>=0)
while(num<50)
{
c=a[num]*2+yushu;
if(c<10)
{
b[num]=c;
yushu=0;
}
else if(c>=10)
{
b[num]=c%10;
yushu=c/10;
}
num++;
}
for(int j=0;j<50;j++)
a[j]=b[j];
}
i = 49;
while(a[i--] == 0);
for(i++;i>=0;i--)
{
//if(a[i]!=0)
cout<<a[i];
}
return 0;
}
|
25
|
12,387 |
int main()
{
int n, i, j, k;
int sum[31] = {0};
sum[0] = 1;
cin >> n;
for(i = 1; i <= n; i ++)
{
for(j = 30; j >= 0; j --)
{
if(sum[j] != 0)
break;
}
for(k = 0; k <= j; k ++)
{
sum[k] = sum[k] * 2;
}
for(k = 0; k <= j; k ++)
{
if(sum[k] > 9)
{
sum[k] = sum[k] - 10;
sum[k + 1] ++;
}
}
}
for(i = 30; i >= 0; i --)
{
if(sum[i] != 0)
break;
}
for(j = i; j >= 0; j --)
cout << sum[j];
cout << endl;
return 0;
}
|
25
|
12,388 |
int num[101] = {0};
void fun()
{
int temp = 0, j = 100;
do
{
if (num[j] < 5)
{
num[j] = num[j] * 2 + temp;
temp = 0;
}
else
{
num[j] = num[j] * 2 - 10 + temp;
temp = 1;
}
j--;
} while(j >= 0);
return;
}
int main()
{
num[100] = 1;
int N, i, flag = 0;
cin >> N;
for (i = 0; i< N; i++)
fun();
for (i = 0; i < 101; i++)
{
if (flag == 0 && num[i] == 0)
continue;
cout << num[i];
flag = 1;
}
return 0;
}
|
25
|
12,389 |
/**
* ???2?n??
* ?????
* ???10.12.20
**/
int a[100];
int n,i;
int main()
{
cin>>n;
a[0]=1;
while(n--)
{
for(i=0;i<100;i++)
a[i]*=2;
for(i=0;i<99;i++)
{
a[i+1]+=a[i]/10;
a[i]%=10;
}
}
for(i=50;i>0&&a[i]==0;i--);//????? ?????????
for(;i>=0;i--)
cout<<a[i];
cout<<endl;
return 0;
}
|
25
|
12,390 |
int main()
{
int n,i,j,k,a[50];
cin>>n;
for(i=0;i<50;i++)
{ a[i]=0;}
a[0]=1;
for(k=0;k<n;k++)
{
for(i=0;i<50;i++)
{
a[i]=2*a[i];
}
for(i=0;i<50;i++)
{
if(a[i]>=10)
{
a[i+1]=a[i+1]+1;
a[i]=a[i]-10;
}
}
}
for(i=49;i>=0;i--)
{ if(a[i]!=0)
break; }
for(j=i;j>=0;j--)
{cout<<a[j];}
cout<<endl;
return 0;
}
|
25
|
12,391 |
//***********************************************************************
//*???8-5.cpp
//*?????2?N??
//*??????
//*???2013?11?19?
//***********************************************************************
int main()
{
int i, j, N, index = 0, temp, jinwei; //index????????????temp??????
int result[100];
cin >> N;
if(N == 0) //N?0??
cout << "1" << endl;
else
{
result[0] = 2; //??????2
for(i = 1; i < N ; i++)
{
jinwei = 0; //??????????????0
for(j = 0; j <= index; j++) //?????????????
{
temp = 1; //?????? ???????
if(j == 0)
{
temp = result[j] * 2;
if(temp >= 10) //?????????????????
jinwei = 1;
}
else
{
temp = result[j] * 2;
if(jinwei == 1)
temp ++; //?????????????1
if(temp >= 10)
jinwei = 1;
else
jinwei = 0;
}
result[j] = temp % 10; //????????10???
}
if(jinwei == 1) // ?????????????????????
{
index ++;
result[index] = 1; //?????????1
} }
for(i = index; i >= 0; i--) //??????????
cout << result[i];
}
return 0;
}
|
25
|
12,392 |
char number[110]={0};
void fraction()
{
int yushu=0;
for ( int i=100;i>=0;i--)
{
if(number[i]!='0')
number[i]=number[i]*2-'0'+yushu;
else
{
number[i]=number[i]+yushu;
yushu=0;
}
if(number[i]>'9')
{
number[i]=number[i]-10;
yushu=1;
}
else
yushu=0;
}
}
int main()
{
int n;
cin>>n;
for ( int i=0;i<100;i++)
number[i]='0';
number[100]='1';
for ( int i=0;i<n;i++)
{
fraction();
}
int start=0;
for( int i=0;i<=100;i++)
if(number[i]!='0')
{
start=i;
break;
}
for ( int i=start;i<=100;i++)
cout<<number[i];
return 0;
}
|
25
|
12,393 |
int main()
{
int n;
cin>>n;
if(n==0)
cout<<1;
else
{
int an[100];
memset(an,0,sizeof(an));
an[0]=2;
for(int i=1;i<n;i++)
{
for(int jjj=0;jjj<90;jjj++)
an[jjj]=2*an[jjj];
for(int j=0;j<90;j++)
{
if(an[j]>=10)
{
an[j]=an[j]-10;
an[j+1]+=1;
}
}
}
int jj=90;
while(an[jj]==0)
jj--;
for(int mm=jj;mm>=0;mm--)
cout<<an[mm];
}
return 0;
}
|
25
|
12,394 |
char a[50], b[50];
void f()
{
int i, y;
for (i = 0; i < 50; i++)
b[i] = '0';
for (i = 49; i >= 0; i--)
{
y = (a[i] - '0') * 2;
if (i > 0)
{
b[i - 1] += y / 10;
b[i] += y % 10;
}
if (b[i] - '0' > 9)
{
b[i - 1]++;
b[i] -= 10;
}
}
for (i = 0; i < 50; i++)
a[i] = b[i];
}
int main()
{
int n, i, j;
cin >> n;
for (i = 0; i < 50; i++)
a[i] = '0';
a[49] = '2';
if (n == 0)
cout << "1" << endl;
else if (n == 1)
cout << "2" << endl;
else
{
for (i = 1; i < n; i++)
f();
for (i = 0; i < 50; i++)
if (a[i] != '0')
break;
for (j = i; j < 50; j++)
cout << a[j];
cout << endl;
}
return 0;
}
|
25
|
12,395 |
char s[100] = {0};
void cal()
{
int len = strlen(s);
int num[100] = {0};
for(int i = 0; i < len; i++)
{
num[i] = s[i] - '0';
}
for(int i = 0; i < len; i++)
{
num[i] *= 2;
}
for(int i = 0; i < len; i++)
{
if(num[i] > 9)
{
num[i + 1] +=num[i] / 10;
num[i] %= 10;
}
}
if(num[len] == 0)
{
for(int i = 0; i < len; i++)
{
s[i] = (char)(num[i] + '0');
}
}
else
{
for(int i = 0; i <= len; i++)
{
s[i] = (char)(num[i] + '0');
}
}
}
int main() {
int n;
cin >> n;
s[0] = '1';
for(int i = 0; i < n; i++)
cal();
int l = strlen(s);
for(int i = l - 1; i >= 0; i--)
{
cout << s[i];
}
cout << endl;
return 0;
}
|
25
|
12,396 |
/*
* file homework 12_2
* author ??
* date 2010-12-18
* description
?????????2?n?????????
*/
int main()
{
char s[50] = {'0'};
int n, i, j, len, t, carry; //carry ????
cin >> n;
s[0] = '1';
len = 1; // len??s???
for (i = 1; i <= n; i++) // ??n?????
{
carry = 0;
for (j = 0; j < len; j++)
{
t = carry + 2 * (s[j] - '0');
if (t < 10)
{
s[j] = '0' + t;
carry = 0;
}
else
{
s[j] = t - 10 + '0';
carry = 1;
}
}
if (carry == 1) // ???????????len++?s[len]='1'
{
s[len] = '1';
len++;
}
}
for (i = len - 1; i >=0; i--)
cout << s[i];
cout << endl;
return 0;
}
|
25
|
12,397 |
int main(){
int i,j,n,k=1;
cin>>n;//?????n
int p[50];
memset(p,0,200);//????
p[0]=1;
for(i=0;i<n;i++){
for(j=0;j<50;j++){
p[j]=p[j]*2;
}//?????
for(j=0;j<50;j++){
if(p[j]>=10){
p[j]=p[j]%10;
p[j+1]=p[j+1]+1;
}//?????2????????1
}
}
for(i=49;i>=0;i--){
if(p[i]==0 && k==1){
continue;
}//??????0
if(p[i]!=0)k=0;
cout<<p[i];
}//??????p
return 0;
}//?????
|
25
|
12,398 |
int main ()
{
int a[10000]={0};
int n;
cin>>n;
a[0]=1;
if(n==0)
{
cout<<'1';
}
int jinwei=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=10000;j++)
{
a[j-1]=a[j-1]+a[j-1]+jinwei;
if(a[j-1]>9)
{
a[j-1]=a[j-1]-10;
jinwei=1;
}
else
{
jinwei=0;
}
}
}
int len;
for(int i=10000;i>0;i--)
{
if(a[i-1]!=0)
{
len=i;
break;
}
}
if(n!=0)
{
for(int i=len;i>0;i--)
{
cout<<a[i-1];
}
}
return 0;
}
|
25
|
12,399 |
int main()
{
//char str[101], end[101];
int n,i,j,k;
int a[101] = {0};
a[1] = 1;
cin>>n;
for (k=1;k<=n;k++)
{
for (i=1;i<=100;i++)
{
a[i] = a[i] * 2;
}
for(i=1;i<=100;i++)
{
if(a[i] >=10)
{
a[i+1] = a[i+1] + a[i] /10;
a[i] = a[i] %10;
}
}
}
i=100;
while(a[i] ==0)
i--;
for (j = i;j >=1;j--)
cout <<a[j];
return 0;
}
|
25
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.