label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
25
|
12100
|
int main()
{
int n,i;
double a=1.0;
scanf("%d",&n);
for(i=1;i<=n;i++){
a=a*2;
}
printf("%.0lf",a);
scanf("%d",&n);
return 0;
}
|
25
|
12101
|
double f(double a);
int main(){
double n,m;
scanf("%lf",&n);
m=f(n);
printf("%.0lf",m);
return 0;
}
double f(double a)
{
double b;
if(a==0) b=1.0;
else if(a==1) b=2,0;
else b=f(a-1)*2.0;
return b;
}
|
25
|
12102
|
int main()
{
int n;
char a[200];
int len;
int p = 0,q = 0;
memset(a,0,sizeof(a));
a[0] = '2';
cin >> n;
if (n == 0)
cout << "1" << endl;
else
{
for (int i = 1; i < n; i++)
{
len = strlen(a);
for (int j = 0; j < len; j++)
{
p = a[j] - '0';
a[j] = (char) ((p * 2) % 10 + '0' + q);
q = (p * 2) / 10;
}
if (q > 0)
a[len] = (char) (q + '0');
p = 0;
q = 0;
}
len = strlen(a);
for (int i = len - 1; i >= 0; i--)
cout << a[i];
}
return 0;
}
|
25
|
12103
|
int main()
{
int num[200];
int start;
int i , j , k;
int n;
for(i = 0 ; i < 199 ; i++)
num[i] = 0;
num[199] = 1;
cin >> n;
for(i = 1 ; i <= n ; i++)
{
for(j = 0 ; j < 200; j++)
{
num[j] = num[j] * 2;
for(k = 1 ; k < 200; k++)
{
if(num[k] >= 10)
{
num[k] = num[k] - 10;
num[k-1]++;
}
}
}
}
for(i = 0 ; i < 200 ; i++)
{
if(num[i] != 0)
{
start = i;
break;
}
}
for(i = start ; i < 200 ; i++)
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12104
|
int main(){
int i,k,n,m,t,cf[100]={0};
int jinwei=0;
cf[0]=1;
scanf("%d",&n);
t=0;
for(i=0;i<n;i++){
for(k=0;k<=t;k++){
cf[k]=cf[k]*2+jinwei;
if(cf[k]>=10){
cf[k]=cf[k]%10;
jinwei=1;
}
else{
jinwei=0;
}
}
for(m=99;cf[m]==0;m--);
t=m+1;
}
for(i=99;cf[i]==0;i--);
for(;i>=0;i--){
printf("%d",cf[i]);
}
return 0;
}
|
25
|
12105
|
/**
*file:1000012776_4.cpp
*author:???
*date?2010-12-18
*discription?????12-15????2?n???
*/
void ride2( char * ) ;//???????2?
void antitone( char * ) ;//?????????
void ride2( char * p )
{
int i , temp = 0 , num ;
for ( i = 0 ; ; i++ )
{
if ( *( p + i ) == '\0' )
{
if ( temp != 0 )
*( p + i ) = temp + '0' ;
break ;
}
num = ( *( p + i ) - '0' ) * 2 + temp ;
* ( p + i ) = num % 10 + '0' ;
temp = num / 10 ;
}
}
void antitone( char * p )
{
int i = 0 , j = 0 ;
char q[100] ;
while ( *( p + (i++) )!= '\0' ) ;
i-- ;
while ( i >= 0 )
*( q + j++ ) = *( p + --i ) ;
i = 0 ;
while ( *( p + i ) != '\0' )
{
*( p + i ) = *( q + i++ ) ;
}
}
int main ()
{
char num[100] = "1" ;
int i , power ;
cin >> power ;
for ( i = 0 ; i < power ; i++ )
{
ride2( num ) ;
}
antitone( num ) ;
cout << num << endl ;
return 0 ;
}
|
25
|
12106
|
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
|
12107
|
int main(){
int n,i;
double y,a;
scanf("%d",&n);
if(n>0){
a=1.0;
for(i=0;i<n;i++){
y=a*2;
a=y;
}
}
if(n==0){
y=1.0;
}
printf("%.0lf",y);
return 0;
}
|
25
|
12108
|
int main(){
int n, num=1, i, j, flag=0;
int a[50]={1};
cin >> n;
for (i=1;i<=n;i++){
flag=0;
for (j=0;j<num;j++){
a[j]=a[j]*2+flag;
flag=0;
if (a[j]>=10){
a[j]=a[j]-10;
flag=1;
}
}
if (flag==1){
a[num]=1;
num++;
}
}
for (i=num-1;i>=0;i--){
cout << a[i];
}
}
|
25
|
12109
|
int main()
{
int num[101] = {0};
num[100] = 1;
int i, N, j;
cin >> N;
for(i = 1; i <= N; i++)
{
for(j = 1; j <= 100; j++)
{
if(num[j] * 2 < 10)
num[j] = num[j] * 2;
else
{
num[j] = num[j] * 2 - 10;
num[j - 1]++;
}
}
}
for(i = 1; i <= 100; i++)
if(num[i] != 0) break;
for(j = i; j <= 100; j++)
cout << num[j];
return 0;
}
|
25
|
12110
|
//********************************
//*??2?N?? **
//*????? 1300012848 **
//*???2013.11.16 **
//********************************
int main()
{
const int MAX_LEN = 200;
int n, i, j, k = MAX_LEN , jinwei[MAX_LEN + 1], flag[MAX_LEN + 1] = {0};
int a[MAX_LEN + 1];
memset(jinwei,0,sizeof(jinwei));
memset(a,0,sizeof(a));
memset(flag,0,sizeof(flag));
cin >> n;
if (n == 0)
cout << "1" << endl;
else
{
a[0] = 1;
for (i = 1; i <= n; i++)
{
for (j = 0; j < MAX_LEN; j++)
a[j] = a[j] * 2;
for (j = 0; j < MAX_LEN; j++)
if(a[j] >= 10)
{
a[j] = a[j] % 10;
a[j+1] ++;
}
}
while (a[k] == 0)
k--;
for(; k >= 0; k--)
cout << a[k];
}
return 0;
}
|
25
|
12111
|
int main()
{
int a[1000];
a[0]=1;
int num,i;
for(i=1;i<1000;i++)
a[i]=-1;
cin>>num;
while(num--)
{
for(i=0;i<1000;i++)
{
if(a[i]!=-1)
{
a[i]*=2;
}
else
break;
}
for(i=0;i<1000;i++)
{
if(a[i]>9)
{
a[i]=a[i]%10;
if(a[i+1]==-1)
a[i+1]=0;
a[i+1]++;
}
else if(a[i]==-1)
break;
else
continue;
}
}
for(i=999;i>=0;i--)
{
if(a[i]!=-1)
cout<<a[i];
}
}
|
25
|
12112
|
char multiply_2(char a[110])
{
int len=strlen(a);
int b[110]={0},c[110]={0};
for(int i=0;i<len;i++)
{
b[i]=a[len-i-1]-'0';
}
for(int i=0;i<len;i++)
{
if(b[i]*2+c[i]>=10)
{
c[i+1]++;
b[i]=b[i]*2+c[i]-10;
}
else
{
b[i]=b[i]*2+c[i];
}
}
int p=0;
if(c[len]>0)
{
p=1;
b[len]+=c[len];
}
if(p==1)
{
len++;
}
for(int i=0;i<len;i++)
a[i]=b[len-i-1]+'0';
return a[110];
}
int main()
{
int n=0;
cin>>n;
char a[110]={0};
a[0]='1';
for(int i=0;i<n;i++)
multiply_2(a);
cout<<a<<endl;
return 0;
}
|
25
|
12113
|
//**************************
//*?????2?N?? **
//*?????? 1200012888 **
//*???2013.11.15**
//**************************
int main()
{
int n;
cin >> n;
int buf[Max_Size] = {1};
while(n)
{
for(int i = 0;i < Max_Size ; i++)
{
buf[i] = 2 * buf[i] ;
}
for(int i = 0 ; i < Max_Size ; i++)
{
buf[i + 1] = buf[i] / 10 + buf[i + 1];
buf[i] = buf[i] % 10;
}
n --;
}
int flag = 0;
for (int i = Max_Size - 1 ; i >= 0 ; i--)
{
if(flag)
{
cout << buf[i];
}
else if(buf[i] != 0)
{
cout << buf[i];
flag = 1;
}
}
return 0;
}
|
25
|
12114
|
int num[40]={0};
int jinwei[40]={0};
void square() //?2
{
for (int i=39;i>0;i--)
{
int a=num[i]*2;
jinwei[i-1]=a/10;
num[i]=a%10+jinwei[i];
}
}
int main ()
{
num[39]=1; //???2?0??=1
int n;
cin>>n;
for (int i=0;i<n;i++) //?n?2
square();
int head;
for (int i=0;i<40;i++)
if (num[i]!=0)
{
head=i;
break;
}
for (int i=head;i<40;i++)
cout<<num[i];
return 0;
}
|
25
|
12115
|
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
|
12116
|
//*****************************
//*?????? 1300012809 **
//*???2013.11.16 **
//*?????2?N?? **
//*****************************
int main()
{
int n, i, j, changdu;
changdu = 1;
int a[1005] = {0}, jieguo[1005] = {0};
cin >> n;
for (i = 0; i <= n; i++)
{
if (i == 0) a[0] = 1;
if (i == 1) a[0] = 2;
if (i != 0 && i != 1)
{
if (a[changdu-1] >= 5 ) changdu += 1;
for (j = 0; j < changdu; j++)
{
a[j] = a[j]*2;
}
for (j = 0; j < changdu; j++)
{
a[j+1] = a[j] / 10 + a[j+1];
a[j] = a[j] % 10 ;
}
}
}
for (j = changdu-1; j >= 0; j--) cout << a[j];
cout << endl;
return 0;
}
|
25
|
12117
|
int main()
{
int n;
cin>>n;
int i=0,j=0;;
int a[100]={0};
a[1]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<100;j++)
a[j]=a[j]*2;
for(j=1;j<100;j++)
if(a[j]>=10)
{
a[j+1]=a[j+1]+a[j]/10;
a[j]=a[j]%10;
}
}
for(i=99;i>1;i--)
if(a[i]!=0)break;
for(;i>=1;i--)
cout<<a[i];
cout<<endl;
return 0;
}
|
25
|
12118
|
char p[200]={'1'},temp[200]={0}; //????????
void sq() //????2
{int i,j,jinwei=0;
for(i=0;p[i]!='\0';i++)
{temp[i]=((p[i]-'0')*2+jinwei)%10+'0'; //???
jinwei=((p[i]-'0')*2+jinwei)/10; //??
}
temp[i]=jinwei+'0'; //???
for(i=0;i<200;i++) {p[i]=temp[i];temp[i]=0;} //???????
}
int main()
{int i,j,n;
cin>>n;
for(i=0;i<n;i++) sq();
for(i=199;p[i]=='\0'||p[i]=='0';i--); //???????????????
for(;i>=0;i--) cout<<p[i];
return 0;
}
|
25
|
12119
|
int main()
{
int n, temp = 0;
int power[32] = {0,1};
cin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j < 32; j++)
{
power[j] *= 2;
power[j] += temp;
if(power[j] >= 10)
{
power[j] -= 10;
temp = 1;
}
else
temp = 0;
}
}
int i = 31;
while(power[i] == 0)
i--;
for(int j = i; j >= 1; j--)
cout << power[j];
cout << endl;
return 0;
}
|
25
|
12120
|
/**
* ??????
* ???1000012844
* ?????2?N??
**/
void multiply( char str[], int n );
int main()
{
int N;
char str[ 200 ] = "1";
cin >> N;
while ( N > 0 )
{
multiply( str, 2 );
N--;
}
cout << str << endl;
return 0;
}
void multiply( char str[], int n )
{
int num[ 200 ];
int jump = 0, temp;
memset( num, 0, sizeof( num ) );
char *sPtr = str + strlen( str ) - 1;
int *nPtr = num + 199;
while( sPtr != str - 1 )
{
*nPtr-- = *( sPtr-- ) - '0';
}
nPtr = num + 199;
while ( nPtr != num - 1 )
{
temp = *nPtr * n % 10 + jump;
jump = *nPtr * n / 10;
*nPtr-- = temp;
}
nPtr = num;
sPtr = str;
while ( *nPtr == 0 )
{
nPtr++;
}
while ( nPtr != num + 200 )
{
*sPtr++ = *nPtr++ + '0';
}
*sPtr = 0;
}
|
25
|
12121
|
int main()
{
double n,a;
scanf("%lf",&n);
a=pow(2.0,n);
printf("%.0lf",a);
return 0;
}
|
25
|
12122
|
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
|
12123
|
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
|
12124
|
/**
* @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
|
12125
|
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
|
12126
|
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
|
12127
|
//?????????//
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
|
12128
|
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
|
12129
|
int main(){
int n,i;
double f;
scanf("%d",&n);
f=pow(2.0,(double)n);
printf("%.0lf",f);
return 0;
}
|
25
|
12130
|
//************************************************
//*????????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
|
12131
|
/* title: */
/* author: ??? */
/* time: 2011.12.31*/
int main()
{
int n;
cin >> n;
int a[101] = {0};
int b[101] = {0};
int i, j;
a[100] = 1;
for(i = 0; i < n; i++)
{
for(j = 100; j > 0; j--)
{
a[j] = 2 * a[j] + b[j];
if(a[j] >= 10)
{
a[j] = a[j] - 10;
b[j - 1] = b[j - 1] + 1;
}
}
for(j = 0; j <= 100; j++)
b[j] = 0;
}
i = 0;
while(a[i] == 0)
i++;
for(j = i; j <= 100; j++)
cout << a[j];
cout << endl;
return 0;
}
|
25
|
12132
|
int n,i,j,k=1;
int a[35]={0},b[35];
void multiple() //????????2???
{
if(n==0) cout<<"1"<<endl;
else
{
if(k==n)
{
for(i=34;i>=0;i--)
if(a[i]!=0) break;
for(j=i;j>=0;j--)
cout<<a[j]; //?????????
}
else
{
b[0]=(a[0]*2)%10;
for(i=1;i<35;i++)
b[i]=(a[i]*2)%10+a[i-1]*2/10; //???+??
for(i=0;i<35;i++)
a[i]=b[i];
k++;
multiple();
}
}
}
int main()
{
cin>>n;
a[0]=2;
multiple();
return 0;
}
|
25
|
12133
|
int main()
{
int n;
cin >> n;
char c[50];
c[49] = '1';
for(int i =0 ;i<49;i++)
c[i] = '0';
for(int i = 0;i<n;i++)
{
int t = 0;
for(int j = 49;j>0;j--)
{
c[j] += c[j]+t-'0';
if( c[j] > '9')
{
c[j] -= 10;
t = 1;
}
else
t =0;
}
}
int i = 0;
while(c[i] <='0')
i ++;
for(int j = i; j < 50;j++)
cout<<c[j];
cout<<endl;
return 0;
}
|
25
|
12134
|
//**********************
//*?????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
|
12135
|
int a[1010] = {0};
void f(int n)
{
int i, u = 1000, temp = 0;
while (a[u] == 0)
u--;
if (n == 0)
{
for (i = u; i >= 1; i--)
cout << a[i];
cout << endl;
return;
}
for (i = 1; i <= u + 1; i++)
{
a[i] = a[i] * 2 + temp;
temp = 0;
if (a[i] >= 10)
{
a[i] = a[i] - 10;
temp = 1;
}
}
f(n - 1);
}
int main()
{
int n;
cin >> n;
a[1] = 1;
f(n);
return 0;
}
|
25
|
12136
|
int main()
{
int n,i,temp = 0,t;
int c[100] = {0};
cin >> n;
c[0] = 2;
c[1] = -1;
for(i = 1;i <= n - 1;i++)
{
int j = 0;
temp = 0;
while(c[j] != -1)
{
t = c[j] * 2 + temp;
c[j] = t % 10;
temp = t / 10;
j++;
}
if(temp != 0)
c[j++] = temp;
c[j] = -1;
}
i = 0;
while(c[i] != -1)
i++;
if(n != 0)
{
for(int j = i - 1;j >= 0;j--)
cout << c[j];
}else
cout << 1;
return 0;
}
|
25
|
12137
|
//
// main.cpp
// ??2?N??
//
// Created by ? ?? on 12-12-10.
// Copyright (c) 2012? ? ??. All rights reserved.
//
int n, sum = 5;
char a[999999999];
char b[999999999];
int p = 0;
int l = 2;
void cheng(int m)
{
p = 0;
int i;
for (i = l; i >= 1; i--)
{
b[i] = ((a[i - 1] - '0') * 2 % 10 + p) % 10 + '0';
p = ((a[i - 1] - '0') * 2 + p) / 10;
}
b[0] = p + '0';
if (b[0] != '0') l++;
if (b[0] == '0')
for (i = 0; i < l; i++)
b[i] = b[i + 1];
strcpy(a, b);
if (sum < n)
cheng(sum++);
}
int main()
{
cin >> n;
if (n == 0) cout << 1;
if (n == 1) cout << 2;
if (n == 2) cout << 4;
if (n == 3) cout << 8;
if (n == 4) cout << 16;
a[0] = '1';a[1] = '6';
if (n > 4)
{
cheng(sum);
for (int i = 0; i < l; i++) cout << a[i];
}
return 0;
}
|
25
|
12138
|
int main(){
int n,i,j,k=0,t;
int sum[100]={0};
sum[99]=1;
cin>>n;
for(i=1;i<=n;i++)
{
for(j=99;j>=0;j--)
{
t=sum[j]*2+k;
if(t<10)
{
sum[j]=t;
k=0;
}
else
{
sum[j]=t-10;
k=1;
}
}
}
for(i=0;sum[i]==0;i++)
;
for(j=i;j<=99;j++)
cout<<sum[j];
cout<<endl;
return 0;
}
|
25
|
12139
|
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
|
12140
|
int main()
{
int n;
cin >> n;
int i,ans=1,j,k=1;
int a[100]={0};
if(n==0)
{
cout << 1 << endl;
}
else
{
a[0]=1;
int t=0;
while(t<n)
{
t++;
for(i=0;i<100;i++)
{
a[i]=a[i]*2;
}
for(i=0;i<100;i++)
{
if(a[i]>=10)
{
a[i+1]=a[i+1]+(a[i]/10);
a[i]=a[i]%10;
}
}
}
j=99;
while(a[j]==0)
{
j--;
}
for(;j>=0;j--)
{
cout << a[j];
}
cout << endl;
}
cin.get();cin.get();cin.get();
return 0;
}
|
25
|
12141
|
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
|
12142
|
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
|
12143
|
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
|
12144
|
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
|
12145
|
const int MAX_DIGIT = 10000;
int main()
{
int num[100];
num[0] = 1;
num[1] = 0;
int numDigits = 1;
int n;
cin >> n;
for (int i = 0; i < n; ++i)
{
int end = numDigits;
for (int i = 0; i < end; ++i)
{
num[i] *= 2;
}
for (int i = 0; i < end; ++i)
{
if (num[i] >= MAX_DIGIT)
{
if (i != numDigits - 1)
num[i+1] += num[i] / MAX_DIGIT;
else
{
num[numDigits] = num[i] / MAX_DIGIT;
++numDigits;
}
}
num[i] = num[i] % MAX_DIGIT;
}
}
for (int i = numDigits - 1; i >= 0; --i)
{
if (i != numDigits - 1)
cout << setfill('0') << setw(4);
cout << num[i];
}
cout << endl;
}
|
25
|
12146
|
//********************************
//*?????2?N?? **
//*?????? 1300012946 **
//*???2013.11.15 **
//********************************
int main()
{
int n,i,j,a[32]={1};
cin>>n;
for (i=0 ; i<n ; i++)
{
for (j=0 ; j<32 ; j++)
{
a[j] = 2 * a[j];
}
for (j=0 ; j<32 ; j++)
{
if (a[j]>9)
{
a[j] -= 10;
a[j+1]++;
}
}
}
j=31;
while (a[j]==0)
j--;
for ( ; j>=0 ; j--)
{
cout<<a[j];
}
return 0;
}
|
25
|
12147
|
int main()
{
char c[1000];
int m,i,j,a[1000],k;
cin>>m;
a[0]=2;
if(m!=0)
{
for(i=1;i<1000;i++)
{
a[i]=0;
}
for(i=0;i<m-1;i++)
{
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]++;
}
}
}
i=999;
while(a[i]==0)i--;
for(k=i;k>=0;k--)
{
cout<<a[k];
}
cout<<endl;
}
else cout<<"1"<<endl;
return 0;
}
|
25
|
12148
|
int main()
{
int a[50] = {0};
int n, i, j, carry, temp;
cin >> n;
a[0] = 1;
for (i = 1;i <= n;i++)
{
carry = 0;
for (j = 0;j < 49;j++)
{
temp = floor(a[j] * 2 / 10);
a[j] = (a[j] * 2) % 10;
a[j] += carry;
carry = temp;
}
}
temp = 0;
for (i = 0;i < 49;i++)
if (a[i] != 0)
temp = i;
for (j = temp;j >= 0;j--)
cout << a[j];
cout << endl;
return 0;
}
|
25
|
12149
|
/*?????????????N(N<=100)???2?N?????
*????: 2012-12-10
*??: ??
*/
int main() {
int N, i, j, res[40] = { 1 }, len = 1;
cin >> N;
for (i = 0; i < N; i++) {
for (j = 0; j < len; j++) {
res[j] = res[j] * 2 + res[len];
if (res[j] > 9) {
res[j] -= 10;
res[len] = 1;
}
else
res[len] = 0;
}
if (res[len])
len++;
}
for (i = len - 1; i >= 0; i--)
cout << res[i];
return 0;
}
|
25
|
12150
|
// *********************************
// **** file ??2?N??.cpp ****
// **** ID:1000012895 ****
// **** Author ??? ****
// **** 2010/12/15 ****
// *********************************
int main()
{
int i, j, n, num[40], *p = NULL; // num???????????????num[0]????????
memset(num,0,160); // ??num???
num[0] = 1; // ????????????000
01?????
cin >> n;
for(i = 0; i < n; i++)
{
for(j = 0; j < 40; j++) // ??????
num[j] *= 2;
for(j = 0; j < 40; j++) // ????
{
if(num[j] > 9)
{
num[j+1]++;
num[j] -= 10;
}
}
}
p = num + 38; // ????????
while(*(--p) == 0); // ???????????????
while(p >= num) // ????????????????
{
cout << *p;
p--;
}
cout << endl;
return 0;
}
|
25
|
12151
|
//
// main.cpp
// final
//
// Created by blues cookie on 13-1-11.
// Copyright (c) 2013? blues cookie. All rights reserved.
//
int a[100]={1};
int len=1;
void cal(int num)
{
if(num==0)return;int carrybit=0;
int i;
for(i=0;i<len;i++)
{
a[i]=a[i]*2+carrybit;
carrybit=a[i]/10;
a[i]=a[i]%10;
}
if(carrybit==1)
{
len++;
a[i]=1;
}
cal(num-1);
}
int main()
{
int num;
cin>>num;
cal(num);
for(int j=len-1;j>=0;j--)
{
cout<<a[j];
}
}
|
25
|
12152
|
int main(){
int n,i,j,m,t;
cin>>n;
int a[1000]={0};
a[0]=2;
for(i=0,t=1;i<n-1;i++){
for(j=0,m=0;j<t;j++){
a[j]=a[j]+a[j]+m;
if(a[j]>9){
a[j]=a[j]-10;
m=1;
t++;
}
else m=0;
}
}
for(i=99;i>0;i--)
if(a[i]!=0)
break;
for(j=i;j>=0&&n!=0;j--)
cout<<a[j];
if(n==0)
cout<<"1";
cout<<endl;
return 0;
}
|
25
|
12153
|
/* ???????2?N??
?????2010?12?17?
???????
*/
int main()
{
int num[100]={1} , i , j , len0 = 1 ,len1 , n ;
cin >> n ;
for (i = 0 ; i < n ; i++)
{
len1 = len0 ;
if (num[len1 -1] >= 5) len0++ ;
for (j = len1 - 1 ; j >= 0 ; j--)
{
if (num[j] < 5) num[j] = num[j] * 2 ;
else
{
num[j] = num[j] * 2 - 10 ;
num[j + 1] ++ ;
}
}
}
for (i = len0 - 1 ; i >= 0 ; i--)
cout << num[i] ;
return 0 ;
}
|
25
|
12154
|
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
|
12155
|
//#include "stdafx.h"
int lena=0;
void cheng(int *a)
{
for (int i=0;i<lena;i++)
{
a[i]=a[i]*2;
}
for (int i=0;i<lena;i++)
{
a[i+1]+=a[i]/10;
a[i]=a[i]%10;
}
if (a[lena]>0) lena++;
//cout<<lena;
}
int main()
//int _tmain(int argc, _TCHAR* argv[])
{
int a[10000]={1};
int n;
lena=1;
cin>>n;
for (int i=0;i<n;i++)
cheng(a);
for (int i=lena-1;i>=0;i--)
cout<<a[i];
cout<<endl;
}
|
25
|
12156
|
int main()
{
int n, i, j, temp[100] = {0}, tag[100] = {0};
cin >> n;
temp[0] = 1;
for (i = 0; i < n; i ++)
{
for (j = 0; j < 99; j ++)
{
if (temp[j] * 2 + tag[j] < 10)
{
temp[j] = temp[j] * 2 + tag[j];
tag[j] = 0;
}
else
{
temp[j] = temp[j] * 2 + tag[j] - 10;
tag[j] = 0;
tag[j + 1] = 1;
}
}
}
for (i = 99; i >= 0; i --)
{
if (temp[i] != 0)
break;
}
for (j = i; j >= 0; j --)
cout << temp[j];
cout << endl;
return 0;
}
|
25
|
12157
|
int main()
{
int a[100] , n , h , j , i ;
cin >> n ;
memset(a , 0 , sizeof(a)) ;
a[1] = 1 ;
h = 1 ;
for (i = 1 ; i <= n ; i ++ )
{
for (j = 1 ; j <= h ; j ++ )
a[j] += a[j] ;
for (j = 1 ; j <= h ; j ++ )
if (a[j] >= 10)
{
a[j] = a[j] - 10 ;
a[j + 1] += 1 ;
}
if (a[h + 1] != 0)
h ++ ;
}
for (i = h ; i >= 1 ; i -- )
cout << a[i] ;
cout << endl ;
return 0 ;
}
|
25
|
12158
|
int main()
{
int n=0,s[100]={0},i=0,k=0;
cin>>n;
s[1]=1;
for(k=1;k<=n;k++)
{
for(i=1;i<=80;i++)
{
s[i]=s[i]*2;
}
for(i=1;i<=79;i++)
{
if(s[i]>=10)
{s[i+1]++;s[i]=s[i]%10;}
}
}
for(i=80;i>=1;i--)
{
if(s[i]!=0)
break;
}
for(;i>=1;i--)
cout<<s[i];
return 0;
}
|
25
|
12159
|
/**
* @file 4.cpp
* @author ??? 1300012960
* @date 2013-11-01
* @description
* ??????: ???? */
int main()
{
int n[31], m, flag; // lg2 = 0.3010 ?????2^100?31? m???? flag????????0
cin >> m;
for (int i = 0; i < 30; i++) n[i] = 0; // ????????0
n[30] = 1; // ???? 2^0 = 1
for (int i = 0; i < m; i++)
{
for (int j = 30; j >= 0; j--)
{
n[j] *= 2; // ????????????*2
}
for (int j = 30; j > 0; j--)
{
if (n[j] >= 10)
{
n[j - 1] += n[j] / 10; // ??????????
n[j] %= 10;
}
}
}
for (int i = 0; i < 31; i++)
{
if (n[i] > 0)
{
flag = i; // ????????
break;
}
}
for (int i = flag; i < 31; i++) cout << n[i]; // ????
return 0;
}
|
25
|
12160
|
int main()
{
char num[110]; //??????????
int N,i,j,s=1,temp,n=1,add[110];
memset(num,'\0',sizeof(num));
num[0]='1';
cin>>N;
for (i=0;i<N;i++) //??N?2??
{
memset(add,0,sizeof(add));
for (j=0;j<n;j++) //???????2
{
temp=(num[j]-'0')*2;
num[j]=temp%10+'0';
if (temp>=10)
{
add[j+1]=1;
if (num[j+1]=='\0')
{
s++;
num[j+1]='1';
}
}
}
for (j=0;j<n;j++) //??
num[j]+=add[j];
n=s;
}
for (i=s-1;i>=0;i--) //??
{
temp=num[i]-'0';
cout<<temp;
}
return 0;
}
|
25
|
12161
|
int main()
{
int an[10011]={0};
int temp[10011]={1};
int i,j=0;
int n=0;
cin>>n;
while(n>0)
{
for(i=0;i<10000;i++)
{
an[i]+=temp[i]*2;
if(an[i]>=10)
{
an[i+1]+=1;
an[i]=an[i]%10;
}
}
for(i=0;i<10000;i++){
temp[i]=an[i];
//cout<<temp[1]<<temp[0]<<endl;
}
for(i=0;i<100;i++){
//cout<<temp[i];
}
memset(an,0,sizeof(an));
n--;
}
//cout<<temp[1]<<temp[0];
for(i=10000;i>=0;i--)
{ if(temp[i]!=0)
{
for(;i>=0;i--)
cout<<temp[i];
break;
}
}
cout<<endl;
return 0;
}
|
25
|
12162
|
int main()
{
int a[100];
int i,n,k,j;
cin>>n;
for(i=0;i<100;i++)
a[i]=0;
a[0]=1;
for(k=1;k<=n;k++)
{
for(i=0;i<100;i++)
a[i]=2*a[i];
for(i=0;i<100;i++)
if(a[i]>=10)
{
a[i]=a[i]-10;
a[i+1]++;
}
}
for(i=99;i>=0;i--)
{
if(a[i]!=0)
{
j=i;
break;
}
}
for(i=j;i>=0;i--)
cout<<a[i];
return 0;
}
|
25
|
12163
|
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
|
12164
|
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
|
12165
|
int num[101]={2};
int mul();
int main()
{
int i;
int n;
int a;
cin>>n;
if (n==0)
cout<<'1'<<endl;
else
{
for (i=0;i<n-1;i++)
mul();
for (i=100;i>=0;i--)
if (num[i]!=0)
{
a=i;
break;
}
for (i=a;i>=0;i--)
cout<<num[i];
cout<<endl;
}
return 0;
}
int mul()
{
int i;
int temp[101]={0};
for (i=0;i<101;i++)
temp[i]=2*num[i];
for (i=0;i<101;i++)
{
if (temp[i]>9)
{
temp[i+1]+=temp[i]/10;
num[i]=temp[i]%10;
}
else
num[i]=temp[i];
}
return 0;
}
|
25
|
12166
|
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
|
12167
|
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
|
12168
|
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
|
12169
|
int main(){
int n,i,c=0,j;
int B[300]={0};
B[1]=1;
scanf("%d",&n);
for(i=1;i<=n;i++){
for(j=1;j<300;j++){
B[j]=B[j]*2+c;
c=0;
if(B[j]>=10){
B[j]-=10;
c=1;
}
}
}
for(i=288;i>0;i--){
if(B[i]!=0){
break;
}
}
for(j=i;j>0;j--){
printf("%d",B[j]);
}
return 0;
}
|
25
|
12170
|
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
double sum=1;
for(int i=1;i<=n;i++)
{
sum=sum*2;
}
printf("%.lf",sum);
return 0;
}
|
25
|
12171
|
int main(){
int n;
int result[32]={0};
int carry=0;
int i,j,key=0;
scanf("%d",&n);
if(n==0){
printf("1");
}else{
result[0]=1;
for(i=1;i<=n;i++){
for(j=0;j<32;j++){
result[j]=result[j]*2+carry;
carry=0;
if(result[j]>=10){
result[j]=result[j]-10;
carry=1;
}
}
}
for(i=31;i>=0;i--){
if(result[i]!=0){
printf("%d",result[i]);
i--;
break;
}
}
for(;i>=0;i--){
printf("%d",result[i]);
}
}
return 0;
}
|
25
|
12172
|
int main()
{
int N;
cin>>N;
int a[40],b[40];
a[0]=1,b[0]=1;
for (int i=1;i<40;i++)
a[i]=0,b[i]=0;
for (int i=0;i<N;i++)
{
for (int k=0;k<39;k++)
{
a[k]=a[k]*2;
}
for (int k=0;k<39;k++)
b[k]=a[k];
for (int k=0;k<39;k++)
if (b[k]>=10)
{
b[k+1]++;
b[k]=b[k]-10;
}
for (int k=0;k<39;k++)
a[k]=b[k];
}
int m;
for (int i=39;i>=0;i--)
if (b[i]!=0)
{
m=i;
break;
}
for (int i=m;i>=0;i--)
cout<<b[i];
return 0;
}
|
25
|
12173
|
int main()
{
int N,i,j;
int b[100]={1,0},jin[100]={0},liu[100]={0};
cin>>N;
if(N==0)
cout<<'1'<<endl;//0???1
else{
for(i=0;i<N;i++)//??? N ?2
{
for(j=0;j<100;j++)
b[j]=b[j]*2;
for(j=0;j<100;j++)
if(b[j]>=10)
{
b[j+1]=b[j+1]+b[j]/10;
b[j]=b[j]%10;
}
}
for(i=99;i>=0;i--)
if(b[i]!=0)break;
for(j=i;j>=0;j--)//??
cout<<b[j];
}
return 0;
}
|
25
|
12174
|
void increase (char []);
int main()
{
int N, sum = 0, i, j;
char num[100];
memset (num, '\0',100);
num[0] = '1';
cin >> N;
for (i = 0; i < N; i++)
increase (num);
i = 0;
while (num[i] != '\0') ++i;
for (j = i - 1; j >= 0; j--)
{
cout << num[j];
}
return 0;
}
int mid = 0;
void increase (char num[100])
{
int n = 0;
while (num[n] != '\0' || mid != 0)
{
if (num[n] != '\0')
mid += (num[n] - '0') * 2;
if (mid < 10)
{
num[n] = mid + '0';
mid = 0;
}
else
{
num[n] = mid % 10 + '0';
mid = 1;
}
++n;
}
}
|
25
|
12175
|
/**
* @file 1000012800_2.cpp
* @author ??
* @date 2010-12-15
* @description
* ??????:??2?N??
*/
int main()
{
int n, num[100] = {0}, count = 0;
num[0] = 1;
cin >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j <= count; j++)
num[j] *= 2;
for (int j = 0; j <= count; j++)
{
if ((num[j] / 10))
{
num[j + 1] += num[j] / 10;
num[j] = num[j] %10;
}
}
if (num[count + 1])
count++;
}
for (int i = count; i >= 0; i--)
cout << num[i];
cout << endl;
return 0;
}
|
25
|
12176
|
int a[1000];
void calc()
{
int j=0;
for(j=0;j<1000;j++)
a[j]=a[j]*2;
for(j=0;j<1000;j++)
{
if(a[j]>=10)
{
a[j+1]=a[j+1]+a[j]/10;
a[j]=a[j]%10;
}
}
}
int main()
{
memset(a,0,sizeof(a));
int n=0,k=0;
cin>>n;
int i=0,sum=1;
for(i=0;i<30;i++)
sum=sum*2;
while(sum!=0)
{
a[k]=sum%10;
sum=(sum-a[k])/10;
k++;
}
sum=1;
if(n<=30)
{
for(i=0;i<n;i++)
sum=sum*2;
cout<<sum<<endl;
}
else
{
for(i=30;i<n;i++)
calc();
int p=0;
for(i=1000;i>=0;i--)
{
if(a[i]!=0)
{
p=i;
break;
}
}
for(i=p;i>=0;i--)
cout<<a[i];
cout<<endl;
}
return 0;
}
|
25
|
12177
|
int main()
{
int n,i,j,num[2000];
memset(num,0,sizeof(num));
num[1999]=2;
cin>>n;
if(n==0)
{
cout <<"1" << endl;return 0;
}
else
{
for(i=1;i<n;i++)
{
for(j=0;j<2000;j++)
{
num[j]=2*num[j];
if(num[j]>=10)
{
num[j]=num[j]-10;
num[j-1]++;
}
}
}
}
i=0;
while(num[i]==0)
{
i++;
}
for(;i<2000;i++)
cout <<num[i];
cout << endl;
return 0;
}
|
25
|
12178
|
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
|
12179
|
/**********************************
?? ???1300017667
?? 20131114
?? 2?n?????????
**********************************/
int main()
{
int n, i, j, flag = 0; //flag???????????
cin >> n;
short int num[35] = {1, 0}; //100 * log2 < 35
for(i = 1; i <= n; i ++) //n????????2?n??
{
for(j = 0; j <= 34; j ++)
{
num[j] = num[j] * 2 + flag; //???????????????????????
if(num[j] >= 10) //?????????????????????????????1
{
num[j] = num[j] - 10;
flag = 1;
}
else
flag = 0; //???????????????0
}
}
for(j = 34; num[j] == 0; j --); //?????????????????????????
for(; j >= 0; j --) //????????????????????????????
cout << num[j];
return 0;
}
|
25
|
12180
|
/**
????5.cpp
? ?????
? ??11.16
? ????2?N??
*/
int main()
{
int N, i, j ,flag = 0;
int ans[32] = {0}; // ???2^100?31???????????32
ans[31] = 1;
cin >> N;
if(N == 0)
cout << "1" << endl;
else
{
for(i = 0 ; i < N ; i++)
{
for(j = 31 ; j >= 0 ; j--)
{
ans[j] = 2 * ans[j] + flag;
if(ans[j] >= 10)
{
ans[j] -= 10;
flag = 1;
}
else
flag = 0;
}
}
i = 0;
while(ans[i] == 0)
i++;
for(; i < 32 ; i++)
cout << ans[i];
cout << endl;
}
return 0;
}
|
25
|
12181
|
int main()
{
int N, x[31] = {0}, i, r;
x[0] = 1;
cin >> N;
while (N > 0)
{
r = 0;
for (i = 0; i <= 30; i++)
{
int t = r;
r = (x[i] * 2 + r) / 10;
x[i] = (x[i] * 2 + t) % 10;
}
N--;
}
i = 30;
while (x[i] == 0)
i--;
for (;i >= 0;i--)
cout << x[i];
cout << endl;
return 0;
}
|
25
|
12182
|
int main()
{
int n,ans=2,i,k=0,p;
char num[1000];
int m[1000]={0},result[1000]={0};
cin>>n;
if(n==0)
cout<<"1"<<endl;
else if(n<31)
{
for(i=1;i<n;i++)
{
ans=ans*2;
}
cout<<ans<<endl;
}
else
{
for(i=1;i<30;i++)
{
ans=ans*2;
}
for(int y=0;y<1000;y++)
{
num[k++]=ans%10;
ans=ans/10;
}
for(int l=30;l<n;l++)
{
for(i=0;i<1000;i++)
{
result[i]=0;
}
for(i=0;i<1000;i++)
{
result[i]=result[i]+num[i]*2;
if(result[i]>=10)
{
result[i]=result[i]%10;
result[i+1]+=1;
}
}
for(i=0;i<1000;i++)
{
num[i]=result[i];
}
}
for(i=999;i>=0;i--)
{
if(result[i]!=0)
{p=i;break;}
}
for(i=p;i>=0;i--)
{
cout<<result[i];
}
}
return 0;
}
|
25
|
12183
|
int main()
{
int n,i,N;
double total;
total=1.0;
scanf("%d",&N);
if(N==0){
total=1;}
if(N!=0){
for(i=0;i<N;i++){
total*=2;
}
}
printf("%.0lf",total);
scanf("%d",&n);
return 0;
}
|
25
|
12184
|
//********************************
//*?????(11-12) ??2?N?? **
//*?????? 1300012745 **
//*???2013.11.19 **
//********************************
int main()
{
int num[100] = {0}, N, i, j, wei = 1;
cin >> N;
if (N == 0)
cout << 1;
if (N == 1)
cout <<2;
if (N > 1)
{
num[0] = 2;
for (i = 2; i <= N; i++)
{
for (j = 0; j <= 99; j++)
{
num[j]*=2;
}
for (j = 0; j <= 99; j++)
{
if (num[j] >= 10)
{
num[j]-=10;
num[j + 1]++;
}
}
}
j = 99;
while (num[j] == 0)
j--;
for (i = j; i >= 0; i--)
cout <<num[i];
}
return 0;
}
|
25
|
12185
|
int main()
{
int i, j, num, flag;
int a[101];
cin >> num;
memset(a, 0, sizeof(a));
a[100] = 1;
while( num > 0 )
{
flag = 0;
for( i = 100; i >= 1; i-- )
{
a[i] = a[i] * 2 + flag;
if( a[i] >= 10 )
{
a[i] -= 10;
flag = 1;
}
else
flag = 0;
}
num--;
}
i = 1;
while( a[i] == 0 )
{
i++;
}
for( j = i; j <= 100; j++ )
{
cout << a[j];
}
cout << endl;
return 0;
}
|
25
|
12186
|
int num[10000000] = {0}, flag[10000000], len = 1;
void minusn()
{
int i;
flag[0] = 0;
for(i = 0; i < len; i++)
{
num[i] *= 2;
num[i] += flag[i];
flag[i+1] = 0;
if(num[i] >= 10)
{
flag[i+1] = 1;
num[i] = num [i] % 10;
}
}
if(flag[i] == 1)
{
len++;
num[i] += flag[i];
}
return;
}
int main()
{
int n, i, j, temp;
num[0] = 1;
cin >> n;
for(i = 1; i <= n; i++)
minusn();
for(j = 0, i = len - 1; j < len / 2; j++, i--)
{
temp = num[i];
num[i] = num[j];
num[j] = temp;
}
for(i = 0; i < len; i++)
cout << num[i];
cout <<endl;
return 0;
}
|
25
|
12187
|
int main()
{
int s[50]={0},t=0;s[0]=2;
int n;
cin>>n;
int i=0,j=0;
if(n==0)
cout<<"1";
else{
for(i=0;i<n-1;i++)
{
t=0;
for(j=0;j<50;j++)
{
s[j]=s[j]*2;
s[j]=s[j]+t;
if(s[j]>9)
{s[j]=s[j]-10;t=1;}
else t=0;
}
}
for(j=49;j>=0;j--)
if(s[j]>0)
break;
for(i=j;i>=0;i--)
cout<<s[i];}
return 0;
}
|
25
|
12188
|
//********************************
//*??2?N?? **
//*????? 1300012848 **
//*???2013.11.16 **
//********************************
int main()
{
const int MAX_LEN = 200;
int n, i, j, k = MAX_LEN;
int a[MAX_LEN + 1];
memset(a,0,sizeof(a)); //????
cin >> n;
if (n == 0)
cout << "1" << endl; //2?0???1
else
{
a[0] = 1;
for (i = 1; i <= n; i++) //????n?
{
for (j = 0; j < MAX_LEN; j++) //??????????
a[j] = a[j] * 2;
for (j = 0; j < MAX_LEN; j++) //???????????????
if(a[j] >= 10)
{
a[j] = a[j] % 10; //???10??
a[j+1]++; //?????
}
}
while (a[k] == 0)
k--;
for(; k >= 0; k--)
cout << a[k]; //????? ????????0?? ????
}
return 0;
}
|
25
|
12189
|
int main()
{
const int max = 200;
int result[max+1];
memset(result, 0, sizeof(result));
int n, i, j;
cin >> n;
int size=1;
result[0]= 1;
int c = 0;
for (i=0;i<n;i++)
{
for (j=0;j < size;j++)
{
result[j] = result[j] * 2 + c ;//??????????????
if (result[j] >= 10)
{
result[j] -= 10;
c = 1;
if (j == size-1)
{
size++;
}
}
else
{
c=0;
}
}
}
i=max;
while (result[i] == 0)
{
i--;
}
for (;i>=0;i--)
{
cout << result[i] ;
}
cout << endl;
return 0;
}
|
25
|
12190
|
int main()
{
int n;
cin>>n;
cout<<endl;
int num[1001];
for (int i=0;i<1001;i++)
num[i]=0;
num[0]=1;//???????1
for (int i=0;i<n;i++)
{//??n??????
for (int j=0;j<1000;j++)
{//?????????
num[j]=num[j]+num[j];
}
for (int j=0;j<1000;j++)
{//??????????10??????
if (num[j]>=10)
{
num[j+1]=num[j+1]+1;
num[j]=num[j]-10;
}
}
}
int k=1000;
while (num[k]==0) k--;//???????0???
for (int i=k;i>=0;i--)//??????
cout<<num[i];
cout<<endl;
return 0;
}
|
25
|
12191
|
/********************************************
*@file 5.cpp *
*@author ?? *
*@date 2013-11-20 *
*@description *
*??????8???2?N?? *
********************************************
*/
int main()
{
int n, a[50] = {0}, l, j; // 2?100??????32??l???
a[1] = l = 1;
for (cin >> n; n; n--) // ?????n=0?????false??
{
for (j = 1; j <= l; j++)
a[j] = a[j] * 2; // ?????2????????????????
for (j = 1; j <= l; j++)
{
a[j+1] += a[j] / 10;
if (a[l+1])
l++;
a[j] %= 10;
}
}
for ( ; l; l--)
cout<<a[l];
return 0;
}
//??????????????
/*???
a1=2?a2=0?l=1 2
a1=4?a2=0?l=1 4
a1=8?a2=0?l=1 8
a1=16?a2=1?l=2?a1=6 16
a1=12?a2=2?a2=3?l=2?a1=2 32
a1=4, a2=6?l=2 64
a1=8?a2=12?a3=1?l=3?a2=2 128
a1=16?a2=4?a3=2?a2=5?l=3?a1=6 256
??????
*/
|
25
|
12192
|
int main(void)
{
int num[1000]; // ????
int n; // ??2?n??
memset(num, 0, sizeof(num));
num[0] = 1;
cin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 1000; j++)
{
num[j] *= 2; // ????2
}
for(int j = 0; j < 1000; j++) // ??
{
if(num[j] >= 10)
{
num[j] -= 10;
num[j + 1]++; // ?????
}
}
}
int x;
for(x = 999; num[x] == 0; x--); // ??????
for(; x >= 0; x--) // ????
{
cout << num[x];
}
cout << endl;
return 0;
}
|
25
|
12193
|
int main()
{
int m,n,i;
double s=1;
scanf("%d",&n);
if(n==0){printf("1");}
else
{
for(i=1;i<=n;i++)
{
s*=2;
}
printf("%.0f",s);
}
return 0;
}
|
25
|
12194
|
int main()
{
int n,i,num[150]={0},len,k,m,j;
char str[150]={'\0'};
cin>>m;
str[0]='1';
for(j=1;j<=m;j++)
{
len=strlen(str);
k=0;
for(i=len-1;i>=0;i--)
{
n=str[i]-'0';
num[k]=n*2;
k++;
}
for(i=0;i<120;i++)
{
// cout<<num[i]<<' '<<num[i+1]<<' ';
num[i+1]=num[i+1]+num[i]/10;
num[i]=num[i]%10;
// cout<<num[i]<<' '<<num[i+1]<<endl;
}
i=140;
while(num[i]==0) i--;
k=0;
for(;i>=0;i--)
{
str[k]=num[i]+'0';
k++;
}
}
i=140;
while(num[i]==0) i--;
for(;i>=0;i--)
cout<<num[i];
if(m==0) cout<<1;
return 0;
}
|
25
|
12195
|
int main()
{
int N, i, j;
int k;
cin >> N;
int a[400] = {0};
a[399] = 1;
for( i = 0; i < N; i++ )
{
for( j = 0; j < 400; j++ )
{
a[j] = a[j] * 2;
}
for( k = 399; k >= 0; k-- )
{
if( a[k] >= 10 )
{
a[k] = a[k] - 10;
a[k-1] += 1;
}
}
}
for( i = 0; i < 400; i++ )
{
if( a[i] != 0 )
break;
}
for( j = i; j < 400; j++ )
{
cout << a[j];
}
cout << endl;
return 0;
}
|
25
|
12196
|
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
|
12197
|
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
|
12198
|
/**
*file:1000012776_4.cpp
*author:???
*date?2010-12-18
*discription?????12-15????2?n???
*/
void ride2( char * ) ;//???????2?
void antitone( char * ) ;//?????????
void ride2( char * p )
{
int i , temp = 0 , num ;
for ( i = 0 ; ; i++ )
{
if ( *( p + i ) == '\0' )
{
if ( temp != 0 )
*( p + i ) = temp + '0' ;
break ;
}
num = ( *( p + i ) - '0' ) * 2 + temp ;
* ( p + i ) = num % 10 + '0' ;
temp = num / 10 ;
}
}
void antitone( char * p )
{
int i = 0 , j = 0 ;
char q[100] ;
while ( *( p + (i++) )!= '\0' ) ;
i-- ;
while ( i >= 0 )
{
i-- ;
*( q + j ) = *( p + i ) ;
j++ ;
}
i = 0 ;
while ( *( p + i ) != '\0' )
{
*( p + i ) = *( q + i ) ;
i++ ;
}
}
int main ()
{
char num[100] = "1" ;
int i , power ;
cin >> power ;
for ( i = 0 ; i < power ; i++ )
{
ride2( num ) ;
}
antitone( num ) ;
cout << num << endl ;
return 0 ;
}
|
25
|
12199
|
int main()
{
int a[40],b[40],c[40];
int n;
a[0]=1;
b[-1]=0;
c[0]=1;
for(int k=1;k<40;k++)
a[k]=0,c[k]=0;
cin>>n;
for(int j=0;j<n;j++)
{
for(int i=0;i<39;i++)
{
if(a[i]>=5)
b[i]=1;
else
b[i]=0;
a[i]=(2*a[i])%10+b[i-1];
if(a[i]!=0)
c[i]=1;
}
}
for(int l=39;l>=0;l-=1)
{
if(c[l]==1)
cout<<a[l];
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.