label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
25
|
12300
|
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
|
12301
|
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
|
12302
|
int main()
{
int n, a[100] = {0}, l;
cin >> n;
a[0] = 1;
l = 1;
while (n--)
{
for (int i = 0; i < l; i++)
{
a[i] *= 2;
}
for (int i = 0; i < l; i++)
{
if (a[i] > 9)
{
a[i + 1]++;
a[i] -= 10;
}
}
if (a[l])
{
l++;
}
}
for (int i = l - 1; i >= 0; i--)
{
cout << a[i];
}
cout << endl;
return 0;
}
|
25
|
12303
|
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
|
12304
|
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
|
12305
|
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
|
12306
|
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
|
12307
|
//??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
|
12308
|
/**
*@ file 1000012834_002homework.cpp
*@ author ???
*@ date 2010-12-15
*@ description
* ?????????2?N??
*/
int main()
{
int j, i, len, n; // ??????i,j?????len,????n
int involution[5000]; // ?????????????
memset(involution, 0, sizeof(involution)); // ?????
cin >> n; // ???????
involution[0] = 1; // ???1??????1
len = 1; // ???????1
for (j = 1; j <= n; j++) // ????n?
{
for (i = 0; i < len; i++) // ???????*2???
{
involution[i] *= 2;
}
// ??????????????9??????????
for (i = 0; i < len; i++)
{
if (involution[i] >= 10)
{
involution[i + 1] += involution[i] / 10;
involution[i] %= 10;
}
}
// ???????????????????????????????+1
if (involution[len] != 0)
len++;
}
for (j = len - 1; j >= 0; j--) // ???????
cout << involution[j];
cout << endl; // ????
return 0;
}
|
25
|
12309
|
void multiple(char a[],char b[])
{
char c[1500]={0};
int i,j,alen,blen;
for(i=0;i<700;i++)
for(j=0;j<700;j++)
{
c[i+j]+=a[i]*b[j];
c[i+j+1]+=(c[i+j])/10;
c[i+j]=c[i+j]%10;
}
for(i=0;i<1499;i++) a[i]=c[i];
}
int main()
{
int n,len,i;
char tep[1500]={0},out[1500]={0};
tep[0]=2;
out[0]=1;
cin>>n;
while(n>0)
{
if(n%2==1) multiple(out,tep);
multiple(tep,tep);
n=(n)/2;
}
i=1499;
while(out[i]==0)i--;
for(;i>=0;i--)
cout<<(int)out[i];
return 0;
}
|
25
|
12310
|
/**
* @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
|
12311
|
int main()
{
int N; //N????
cin >> N;
int num[32] = {0};
num[1] = 1;
int cntbyte = 1;
for(int i = 1 ; i <= N ; i++)
{
for(int j = 1 ; j <= cntbyte ; j++)
num[j] *= 2;
for(int j = 1 ; j <= cntbyte ; j++)
{
if (num[j] >= 10)
{
num[j] -= 10;
num[j+1] ++;
}
}
if (num[cntbyte + 1] != 0)
cntbyte ++;
}
for (int k = cntbyte; k >= 1; k--)
cout << num[k];
cin.get();
cin.get();
return 0;
}
|
25
|
12312
|
int main()
{
int n, a[1000] = {0};
cin >> n;
if (n == 0)//???0
cout << "1";
else
{
a[0] = 1;
int t, l = 1;
for (int i = 0; i < n; i++)
{
for (int j = l-1; j >= 0; j--)
{
a[j] = 2 * a[j];
if (a[j] > 9)//??
{
t = a[j];
a[j] = a[j] % 10;
a[j+1] = a[j+1] + 1;
if(j+1 == l)
{l++; break;}
l++;
}
}
}
}
int flag = 0;
for (int m = 999; m >= 0; m--)
{
if (a[m] != 0 || flag != 0)
cout << a[m], flag = 1;
}
return 0;
}
|
25
|
12313
|
/*
*@file 5.cpp
*@author ???
*@date 11.15
*@description ??2?n??
*/
int main ()
{
int a[1000]={0}; //????????????????????
int i,n,temp=0;
int N;
a[0]=1; //???????1
cin >> N;
for(n = 1; n <= N; n++)
{
for(i = 0; i < 1000; i++)
a[i]*=2; //??????????2
for(i = 0; i < 1000; i++)
{
if(a[i] > 9)
{
a[i] = a[i] % 10; //?????2???9????
a[i+1]+=1;
}
}
}
for(i = 999; i >= 0; i--)
{
if(a[i]!=0)
{
temp=i; //????????????0???
break;
}
}
for(i = temp; i >= 0; i--)
cout << a[i];
return 0;
}
|
25
|
12314
|
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
|
12315
|
void everydouble(int a[])
{
int i;
for (i=0;i<=99;i++)
a[i]*=2;
}
void moveahead(int a[])
{
int i;
for (i=0;i<=99;i++)
{
if (a[i]>=10)
{a[i]-=10;a[i+1]++;}
}
}
void print(int a[])
{
int flag=0,i;
for (i=0;i<=99;i++)
{
if (a[i]!=0)
flag=i;
}
for (i=flag;i>=0;i--)
printf("%d",a[i]);
}
int main(int argc, char *argv[])
{
int n,i,j;
scanf("%d",&n);
int a[100];
a[0]=1;
for (i=1;i<=99;i++)
a[i]=0;
for (i=0;i<=n-1;i++)
{
everydouble(a);
moveahead(a);
}
print(a);
return 0;
}
|
25
|
12316
|
char a[1000] = {'0'};
int len;
void mul(char a[])
{
len = strlen(a);
int b[1000] = {0};
for (int i = 0; i < len; i ++)
{
b[i] = 2 * (a[i] - '0');
}
for (int i = 0; i < len; i ++)
{
b[i + 1] = b[i + 1] + b[i] / 10;
b[i] = b[i] % 10;
a[i] = b[i] + '0';
a[i + 1] = b[i + 1] + '0';
}
}
int main()
{
int n;
cin >> n;
a[0] = '2';
a[1] = '\0';
if (n == 0)
{
cout << "1" << endl;
}
else
{
for (int i = 1; i < n; i ++)
{
mul(a);
}
int i = len;
while (a[i] == '0')
{
i --;
}
for (int j = i; j >= 0; j --)
{
cout << a[j];
}
cout << endl;
}
return 0;
}
|
25
|
12317
|
//* * * * * * * * * * * * * * * * * * * * * * * *
//*??????2?N?? *
//*??????2?N?? .cpp *
//*????? 1000012839 *
//*???2010.12.15 *
//* * * * * * * * * * * * * * * * * * * * * * * *
int main()
{
int N; // ??2?N???
int i, j, k; // ?????
int num[100]; // ???????
int result[100]; // ???????
cin >> N;
memset(num, 0, sizeof(num)); // ???
memset(result, 0, sizeof(result)); // ???
result[0] = 1; // 2?0???1?
for (i = 0; i < N; i++) // ???????2?
{
j = 0;
for (k = 0; k < 100; k++)
num[j++] = result[k]; // ????????????num?
memset(result, 0, sizeof(result)); // result????????????
for (j = 0; j < 100; j++)
result[j] = 2 * num[j];
for (j = 0; j < 100; j++)
{
if (result[j] >= 10)
{
result[j + 1] += result[j] / 10;
result[j] %= 10; // ??10????
}
}
}
j = 99;
while (result[j] == 0)
j--; // ???????????
for ( ; j >= 0; j--)
cout << result[j]; // ???????
cout << endl;
return 0;
}
|
25
|
12318
|
//********************************
//*?????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
|
12319
|
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
|
12320
|
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
|
12321
|
/*************************
***??:??? 1200012776
***????:??2?N??
***??:2012?12?5?
*************************/
int length(int ch[]) //??length????????????
{
int i;
for (i = 199; i >= 0; i--)
{
if (ch[i] != 0)
break;
}
return (i + 1);
}
void multi(int ch[], int a) //?????????,??multi,ch1(??)???ch1 * a
{
int i, max = length(ch), t;
int ji[200] = {0};
for (i = 0; i <= max + 3; i++)
{
ji[i] = ch[i] * a;
ji[i + 1] += ch[i] * a;
}
for (i = 0; i <= max + 3; i++) //????ji??????
{
t = ji[i];
ji[i] = ji[i] % 10;
ji[i + 1] += t / 10;
}
for (i = 0; i <= max + 5; i++) //??????????ch
{
ch[i] = ji[i];
}
}
void pow(int p, int j, int chpow[]) //??a, b????,?chpow[]??(????)
{
int i;
if (j == 0)
{
chpow[0] = 1;
}
else
{
chpow[0] = 1;
for (i = 1; i <= j; i++)
{
multi(chpow, p);
}
}
}
int main()
{
int i, chpow[200] = {0}, end;
cin >> i;
pow(2, i, chpow);
end = length(chpow);
for (i = end - 1; i > -1; i--)
{
cout << chpow[i];
}
cout << endl;
return 0;
}
|
25
|
12322
|
/*
* 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
|
12323
|
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
|
12324
|
//*************************************
//*???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
|
12325
|
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
|
12326
|
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
|
12327
|
int main () {
int n,i;
scanf ("%d",&n);
double s=1;
for (i=0;i<n;i++){
s=s*2;
}
printf ("%.0lf",s);
return 0;
}
|
25
|
12328
|
int main()
{
int n, i, j, count = 0;
cin >> n;
int a[100];
for(i = 0; i < 99; i++)
a[i] = -1;
a[99] = 1;
if(n == 0)
cout << 1;
else
{
for(i = 0; i < n; i++)
{
count = 0;
for(j = 99; j >= 0; j--)
if(a[j] != -1)
{
count++;
}
for(j = 99; j > 99 - count; j--)
a[j] = a[j] * 2;
for(j = 99; j > 99 - count; j--)
{
if(a[j] >= 10)
{
a[j] = a[j] - 10;
if(a[j - 1] == -1)
{
a[j - 1] = 1;
count++;
break;
}
else
a[j - 1] = a[j - 1] + 1;
}
}
}
}
for(i = 99 - count + 1; i <= 99; i++)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12329
|
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
|
12330
|
//???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
|
12331
|
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
|
12332
|
/**
* @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
|
12333
|
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
|
12334
|
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
|
12335
|
int main()
{
int N, i, j, flag = 0;
cin >> N;
int str[1000] = {0};
str[0] = 1;
for (i = 0; i < N; i++)
{
for (j = 0; j < 1000; j++)
str[j] = str[j] * 2;
for (j = 0; j < 1000; j++)
if (str[j] > 9)
{
str[j + 1] += str[j] / 10;
str[j] = str[j] % 10;
}
}
for (i = 999; i >= 0; i--)
{
if (str[i] != 0)
flag = 1;
if (flag)
cout << str[i];
}
return 0;
}
|
25
|
12336
|
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
|
12337
|
/*
* 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
|
12338
|
int main()
{
int N, i, j, l, a[32];
for(i=0; i<32; i++)
{
a[i]=0;
}
cin >> N;
a[31]=1;
if(N == 0)
cout << 1 << endl;
else
{
for(i=1; i <= N; i++)
{
j=0;
while(a[j] == 0)
{
j++;
}
l=32-j;
for(j=31; j >= 32-l; j--)
{
a[j] *= 2;
}
for(j=31; j >= 32-l; j--)
{
if(a[j] >= 10)
{
a[j-1] += a[j]/10;
a[j]=a[j]%10;
}
}
}
i=0;
while(a[i] == 0)
{
i++;
}
for( ; i<32; i++)
cout << a[i];
return 0;
}
}
|
25
|
12339
|
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
|
12340
|
/*
* ??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
|
12341
|
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
|
12342
|
int main()
{
char a[1001];
a[0] = '2';
int b, i, j, k = 0, k1 = 0;
cin >> b;
if (b == 0)
cout << "1" << endl;
else
{
for (i = 1; i < 1001; i++)
a[i] = '0';
for (i = 1; i < b; i++)
{
for (j = 0; j <1001; j++)
{
k = (a[j] - '0') * 2 / 10;
a[j] = (a[j] - '0') * 2 % 10 + k1 + '0';
k1 = k;
}
}
k = 0;
for(i = 1000; i >= 0; i--)
{
if (a[i] !='0')
k = 1;
if (k == 1)
cout << a[i];
}
cout << endl;
}
return 0;
}
|
25
|
12343
|
/*-----------------------------------------*\
|? ? ? ???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
|
12344
|
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
|
12345
|
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
|
12346
|
//??(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
|
12347
|
//****************************************************
//* ????1000012846_2.cpp ***********************
//* ????? *************************************
//* ????:2010?12? ****************************
//* ???????2?N?? *************************
//****************************************************
//???????????Cheng,?????????????str[]??????????N
void Cheng ( char str [40] , int N )
{
if ( N == 1 ) //????????
cout << str ;
else if ( N > 1 ) //??????2???
{
int num1[40] = {0} , num2[40] , len = 0 , i = 0 , k = 40 ;
len = strlen(str) ;
for ( i = 0 ; i < len ; i++ ) //?????????????
num1[i] = str[len-1-i] - '0' ;
for ( i = 0 ; i < 40 ; i++ ) //????
num2[i] = num1[i] * 2 ;
for ( i = 0 ; i < 40 ; i++ ) //????
{
if ( num2[i] > 9 )
{
num2[i] -= 10 ;
num2[i+1] += 1 ;
}
}
while ( num2[k-1] == 0 ) //???????????????
k-- ;
for ( i = 0 ; i < k ; i++ ) //?????????????
str[i] = num2[k-1-i] + '0' ;
str[k] = '\0' ;
Cheng(str,N-1) ; //??????
}
}
int main()
{
char str[40] = "2" ; //????????
int N ;
cin >> N ;
if ( N == 0 ) //?N=0?????1
cout << "1" << endl ;
else
Cheng ( str , N ) ; //????
return 0 ;
}
|
25
|
12348
|
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
|
12349
|
//********************************
//*???2?n??
//*??? ?? 1300012814 **
//*???2013.11,14 **
//********************************
int main()
{
int n, a[100] = {1};
cin >>n;
for (int i = 1; i<=n;i++)
{
for (int j = 0;j < 100;j++)
{
a[j] = 2 * a[j];
}
for (int j = 0; j<100;j++)
{
if (a[j] >= 10)
{
a[j+1]++;
a[j] = a[j]%10;
}
}
}
int j = 99;
while (a[j]==0)
{
j--;
}
for (;j>=0;j--)
{
cout << a[j];
}
return 0;
}
|
25
|
12350
|
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
|
12351
|
int main()
{
int x, length = 1, i;
char result[51];
for (i = 1; i < 51; i++)
result[i] = '0';
result[0] = '1';
for (cin >> x; x > 0; x--)
{
for (i = 0; i < length; i++)
result[i] = result[i] * 2 - '0';
for (i = 0; i < length - 1; i++)
if (result[i] > '9')
{
result[i] -= 10;
result[i + 1]++;
}
if (result[i] > '9')
{
result[i] -= 10;
result[i + 1]++;
length++;
}
}
for (length--; length >= 0; length--)
cout << result[length];
return 0;
}
|
25
|
12352
|
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
|
12353
|
int main ()
{
int n, i, j,flag = 0;
int num[32] = {0};
cin >> n;
num[0] = 2;
for(i = 1; i <= n - 1; i++)
{
for(j = 0; j < 32; j++)
{
num[j] *= 2;
}
for(j = 0; j < 32; j++)
{
if(num[j] >= 10)
{
num[j] -= 10;
num[j+1]++;
}
}
}
if(n != 0)
{
for(j = 31; j >= 0; j--)
{
if(num[j] == 0 && flag == 0)
continue;
else
flag = 1;
if(flag == 1)
cout << num[j];
}
}
else
cout << "1";
cout << endl;
return 0;
}
|
25
|
12354
|
/*???????2?N??
*??????
*???2010/12/16
*???1000010449
*/
void multiply(char *p) //?2
{
int num[70], i = 0, end;
num[0] = 0; //?????????
while (*(p + i) != '\0')
{
num[i + 1] = 2 * (*(p + i) - '0');
i++;
}
end = i; //?????
for (; i > 0; i--) //??
{
num[i - 1] += num[i] / 10;
num[i] %= 10;
}
if (num[0] == 0) //????0???????
i = 1;
else
i = 0;
while (i <= end)
*p++ = num[i++] + '0';
*p = '\0';
return;
}
int main()
{
char result[71] = "1";
int n, i;
cin >> n;
for (i = 0; i < n; i++)
multiply(result); //?n?
cout << result << endl;
return 0;
}
|
25
|
12355
|
//****************************************
//???????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
|
12356
|
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
|
12357
|
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
|
12358
|
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
|
12359
|
// * * * * * * * * * * * * * * *
// *?????2?N?? *
// *?????? 1300013011 *
// *???2013.11.17 *
// * * * * * * * * * * * * * * *
int main()
{
int n, num[1000] = {0}, i, j, len;
cin >> n;
num[0] = 1; // ??????????1????0
for (i = 1; i <= n; i++)
{
for (j = 999; j >= 0; j--)
{
if (num[j] != 0)
{
len = j; // ????0???????
break;
}
}
for (j = 0; j <= len; j++)
num[j] *= 2; // ??????0???????2
for (j = 0; j <= len; j++)
{
if (num[j] >= 10) // ?????????9????????
{
num[j + 1] += num[j] / 10;
num[j] = num[j] % 10;
}
}
}
for (j = 999; j >= 0; j--) // ??????????0??
{
if (num[j] != 0)
{
len = j;
break;
}
}
for (i = len; i >= 0; i--) // ??????0????????
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12360
|
/* 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
|
12361
|
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
|
12362
|
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
|
12363
|
//****************************
//**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
|
12364
|
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
|
12365
|
/*
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
|
12366
|
int main()
{
int a[200] = {0}, i, j, k, n, t;
cin >> n;
a[0] = 1;
for (i = 1; i <= n; i++)
{
for (j = 0; j < 200; j++)
a[j] *= 2;
t = a[0] / 10;
a[0] %= 10;
for (j = 1; j < 200; j++)
{
a[j] = t + a[j];
t = a[j] / 10;
a[j] %= 10;
}
}
for (i = 199; i >= 0; i--)
{
if (a[i] != 0)
{
k = i;
break;
}
}
for (i = k; i >= 0; i--)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12367
|
//???2?N??//
//??????//
//???1000011029//
//???2010?12?21?//
int main()
{
int n = 0; //????//
char sum[101]; //???????//
int i = 0;
cin >> n; //????//
char*p = &sum[1]; //????//
memset(sum,'0',sizeof(sum) );
*p = '1';
for( i = 1;i <= n;i++ ) //?????????????,???//
{
p = &sum[100];
while(1)
{
if( ( *p - '0') * 2 >= 20 )
{
(*( p + 1 )) += 2;
*p = ( *p - '0') * 2 % 20 + '0';
}
else if( ( *p - '0') * 2 >= 10 && ( *p - '0') * 2 < 20 )
{
(*( p + 1 ))++;
*p = ( *p - '0') * 2 % 10 + '0';
}
else
*p = ( *p - '0') * 2 + '0';
p--;
if( p == &sum[0] )
break;
}
}
for( i = 1;i <= 100;i++ ) //?????????//
if( sum[i] - '0' >= 10 )
{
sum[i + 1]++;
sum[i] = sum[i] % 10;
}
for( i = 100;i >= 1;i-- ) //?????//
if( sum[i] - '0' > 0 )
break;
for( ;i > 0;i-- ) //??//
cout << sum[i];
return 0;
}
|
25
|
12368
|
/*
* 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
|
12369
|
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
|
12370
|
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
|
12371
|
//********************************
//*????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
|
12372
|
//*************************************************
//***?????2?N??***
//***??????***
//***???2013.1.13***
//*************************************************
int a[100];
void f()
{
int i,t = 0;
for (i = 0; i < 100; i++)
{
a[i] = a[i] * 2 + t;
t = a[i] / 10;
a[i] = a[i] % 10;
}
}
int main ()
{
int N,i,j;
memset(a,0,sizeof(a));
a[0] = 1;
cin >> N;
for (i = 0; i < N; i++)
{
f();
}
i = 99;
while (a[i] == 0)
i--;
for (j = i; j >= 0; j--)
cout << a[j];
cout << endl;
return 0;
}
|
25
|
12373
|
//********************************
//*?????(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
|
12374
|
//@@@@@???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
|
12375
|
//
// main.cpp
// ??
//
// Created by ? ? on 12-12-15.
// Copyright (c) 2012? ? ?. All rights reserved.
//
void output(int *S)
{
int k=0;
for (; S[k]==0; k++) {
;
}
for (int i=k; i<41; i++) {
cout<<S[i];
}
}
void muti(int n)
{
int S[41]={0};
S[40]=1;
for(int i=0;i<n;i++){
for (int i=40; i>0; i--) {
S[i]=S[i]*2;
}
for (int i=40; i>0; i--) {
while (S[i]>9) {
int x;
x=S[i]/10;
S[i]-=10*x;
S[i-1]+=x;
}
}
}
output(S);
}
int main()
{
int n;
cin>>n;
muti(n);
return 0;
}
|
25
|
12376
|
int main(){
int n;
double m;
scanf("%d",&n);
if(n==0){
printf("1");
}
else{
m=pow(2,n);
printf("%.lf",m);
}
return 0;
}
|
25
|
12377
|
/*
* ????
* Created on: 2013-1-4
* ??
* Author: ???
*/
int main(){
double n;
cin>>n;
cout<<fixed<<setprecision(0)<<pow(2.0,n)<<endl;
return 0;
}
|
25
|
12378
|
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
|
12379
|
int main() {
int a[100],n,wei;
cin>>n;
for(int i=1;i<=99;i++)
a[i]=0;
a[0]=2;
if(n>=2) {
for(int i=1;i<n;i++) {
for(int j=0;j<=99;j++)
a[j]=2*a[j];
for(int j=0;j<=99;j++) {
if(a[j]>=10) {
a[j+1]++;
a[j]=a[j]-10;
}
}
}
for(int i=99;i>=0;i--) {
if(a[i]!=0) {
wei=i;
break;
}
}
for(int i=wei;i>=0;i--)
cout<<a[i];
}
else if(n==1)
cout<<"2";
else if(n==0)
cout<<"1";
return 0;
}
|
25
|
12380
|
int ans[1000];
int main()
{
memset(ans,0,sizeof(ans));
int n,i;
cin>>n;
ans[1]=1;
ans[0]=0;
for(;n>0;n--)
{
for(i=1;i<1000;i++)
{
ans[i]=ans[i]*2+ans[i-1]/10;
ans[i-1]=ans[i-1]%10;
}
}
for(i=999;ans[i]==0;i--);
for(;i>0;i--)
cout<<ans[i];
}
|
25
|
12381
|
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
|
12382
|
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
|
12383
|
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
|
12384
|
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
|
12385
|
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
|
12386
|
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
|
12387
|
//?????????100?????
int main()
{
int result[80]={0}; //????
//???????????????????????????OTZ?
int l=1; //??
int c; //????????
int n; //??
int i,j;
scanf("%d",&n);
if(n<=30)
{
c=(int)pow(2,n);
printf("%d",c);
return 0; //????????????=u=+
}
//if(n==100)
//{
// printf("1267650600228229401496703205376");
// return 0;
// }
result[0]=1; //2?0??
for(i=0;i<n;i++) //???2
{
c=0; //??????
for(j=0;j<l;j++) //??????
{
result[j]=result[j]*2+c;
c=result[j]/1000; //??
if(result[j]>=1000) //????
{
result[j]=result[j]%1000; //??
if(j==l-1) //?????
{
l++; //?+1
}
}
}
}
for(i=l-1;i>=0;i--) //??
{
if(i!=l-1) //??
{
printf("%.3d",result[i]);
continue;
}
printf("%d",result[i]);
}
printf("\n");
return 0;
}
|
25
|
12388
|
int main()
{
int N,i,j,t;
int a[100]={0};
cin>>N;
a[0]=1;
t=0;
for(i=0;i<N;i++)
{
for(j=0;j<100;j++)
{
a[j]=a[j]*2;
a[j]=a[j]+t;
t=0;
if(a[j]>9)
{
a[j]=a[j]-10;
t=1;
}
}
}
for(i=99;i>=0;i--)
{
if(a[i]>0)
{
t=i;
break;
}
}
for(i=t;i>=0;i--)
{
cout<<a[i];
}
return 0;
}
|
25
|
12389
|
int main()
{
int n, i = 0, k;
cin >> n;
int num[40] = {0};
int mirror[40] = {0};
num[39] = 1;
mirror[39] = 1;
if (n == 0)
cout << 1 << endl;
else
{
for (i = 1; i <= n; i++)
{
for (k = 39; k >= 0; k--)
{
num[k] = num[k] + mirror[k];
if (num[k] >= 10)
{
num[k] = num[k] - 10;
num[k - 1]++;
}
}
for (k = 0; k <= 39; k++)
mirror[k] = num[k];
}
k = 0;
while (num[k] == 0 )
k++;
for (k; k <= 39; k++)
cout << num[k];
cout << endl;
}
return 0;
}
|
25
|
12390
|
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
|
12391
|
/*
??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
|
12392
|
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
|
12393
|
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
|
12394
|
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
|
12395
|
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
|
12396
|
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
|
12397
|
int main()
{
int a[100][100] = {0};
int i, m, temp = 0, j;
cin >> m;
if(m == 0)
{
cout << 1;
return 0;
}
a[0][99] = 2;
for(i = 1 ; i < 100 ; i ++)
{
temp = 0;
for(j = 99 ; j >= 0 ; j --)
{
temp = a[i - 1][j] + a[i - 1][j] + a[i][j];
if(temp > 9)
a[i][j - 1] ++;
a[i][j] = temp % 10;
}
}
int flag = 0;
for(i = 0 ; i < 100 ; i ++)
{
if(flag == 1)
cout << a[m - 1][i];
if(a[m - 1][i] != 0 && !flag)
{
cout << a[m - 1][i];
flag = 1;
}
}
return 0;
}
|
25
|
12398
|
int main ()
{
char ch[50] = {'1'};
for ( int i = 1; i < 50; i ++ )
ch[i] = '0';
int n;
cin >> n;
int temp = 0;
for ( int i = 1; i <= n; i ++ )
{
for ( int j = 0; j < 50; j ++ )
{
ch[j] = (ch[j]-'0')*2+temp;
if ( ch[j] > 9 )
{
temp = 1;
ch[j] = ch[j] - 10 + '0';
}
else
{
temp = 0;
ch[j] = ch[j] + '0';
}
}
}
for ( int i = 49; i >= 0; i -- )
{
if ( ch[i] != '0' )
{
temp = i;
break;
}
}
for ( int i = temp; i >= 0; i -- )
cout << ch[i];
return 0;
}
|
25
|
12399
|
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;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.