label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
25
|
12400
|
void cheng(int a[100], const int n, int flag);
int main()
{
int n;
int a[100] = {2};
cin >> n;
if(n == 0)
cout << "1" << endl;
else
cheng(a, n, 0);
return 0;
}
void cheng(int a[100], const int n, int flag)
{
int i = 0, j = 0, count = 0, l = 0, k = 0;
int b[100] = {0};
count = 99;
while(a[count] == 0)
count --;
if(flag == n - 1)
{
for(i = 0; i <= count; i++)
cout << a[i];
}
else
{
for(i = count; i >= 0; i--)
{
b[j++] = a[i];
}
for(i = 0; i <= count; i++)
b[i] = b[i] * 2;
for(i = 0; i <= count; i++)
{
if(b[i] >= 10)
{
b[i] = b[i] - 10;
b[i + 1]++;
}
}
l = count + 1;
while(b[l] == 0)
l--;
for(i = l; i >= 0; i--)
{
a[k++] = b[i];
}
flag++;
cheng(a, n, flag);
}
}
|
25
|
12401
|
int main()
{
int n, a[1000]={0}, j=0, i1;
memset(a,0,sizeof(a));
a[0] = 1;
cin >> n;
for(int i=0; i < n; i++)
{
for(int l=0;l < j+1; l++)
{
a[l] = 2 * a[l];
}
for(int k = j; k >= 0; k--)
{
if(a[k] > 9)
{
a[k+1] ++;
a[k] = a[k] -10;
j++;
}
else
{
continue;
}
}
}
for(i1 = j; i1 > 0; i1--)
{
if(a[i1] != 0)
{
break;
}
}
for(;i1 >=0; i1--)
{
cout << a[i1];
}
cout << endl;
return 0;
}
|
25
|
12402
|
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
|
12403
|
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
|
12404
|
int main()
{
int n;
cin>>n;
int w,s[100]; memset(s,0,sizeof(s));
w=1; s[1]=1;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=w;j++) s[j]*=2;
for (int j=1;j<=w;j++)
{
s[j+1]=s[j+1]+s[j]/10;
s[j]=s[j]%10;
}
if (s[w+1]>0) w++;
}
for (int i=w;i>=1;i--) cout<<s[i];
return 0;
}
|
25
|
12405
|
int main(){
int n;
double s[101];
int i;
scanf("%d",&n);
s[0]=1;
s[1]=2;
for(i=2;i<=n;i++){
s[i]=s[i-1]*2;
}
printf("%.0lf",s[n]);
return 0;
}
|
25
|
12406
|
char a[110]={0};
void temp()//????a??
{
int yushu=0;
for(int j=100;j>0;j--)
{
char c=a[j]+a[j]-'0'+yushu;
if(c<='9')
{
a[j]=c;
yushu=0;
}
else
{
a[j]=c-10;
yushu=1;
}
}
}
int main()
{
int n;
cin>>n;
for(int i=0;i<110;i++)
{
a[i]='0';
}
a[100]='1';
for(int i=0;i<n;i++)//??n???
{
temp();
}
int x=0;
for(int i=0;i<110;i++)//?????
{
if(a[i]!='0')
{
x=i;
break;
}
}
for(int i=x;i<101;i++)//??
{
cout<<a[i];
}
return 0;
}
|
25
|
12407
|
int main()
{
char a[1000];
a[0] = '1';
int flag = 0, n, m = 0;
cin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = m; j >= 0; j--)
{
a[j] = (a[j] - '0') + (a[j] - '0') + '0' + flag;
if (a[j] > '9')
{
flag = 1;
a[j] = a[j] - 10;
}
else
{
flag = 0;
}
}
if (flag == 1)
{
for (int k = m + 1; k > 0; k--)
{
a[k] = a[k - 1];
}
a[0] = '1';
flag = 0;
m++;
}
}
for (int l = 0; l <= m; l++)
{
cout << a[l];
}
return 0;
}
|
25
|
12408
|
int main(void)
{
char res[32]="0000000000000000000000000000001",temp[2]="0";
int n,i=0,j,c=0,t;
scanf("%d",&n);
for(;i<n;i++)
{
for(j=30;j>=0||(!c&&res[j]=='0');j--)
{
temp[0]=res[j];
t=atoi(temp)*2+c;
res[j]=t%10+'0';
c=t/10;
}
}
for(i=0;i<31&&res[i]=='0';i++);
for(j=i;j<31;j++)res[j-i]=res[j];res[j-i]='\0';
printf("%s\n",res);
return 0;
}
|
25
|
12409
|
//***********************
//*?????2?N??****
//*??????**********
//*???1000012832******
//***********************
int shumu(int a[]);//????shumu ????????????
int main()
{
int N, a[100], i, m, j;
cin >> N;
memset(a, 0, sizeof a);//?????
a [0] = 2;//?a[0]???
if(N == 0)//??0??????1
{
cout << 1 << endl;
}
else if(N == 1)//??1??????2
{
cout << 2 << endl;
}
else
{
for(i = 1; i <= N - 1; i++)//??N???2????????N-1?2
{
m = shumu(a) + 1;//????????????
for(j = 0; j < m; j++)
{
a[j] = a[j] * 2;//?????????2
}
for(j = 0; j < m; j++)
{
if(a[j] >= 10)//????10?????
{
a[j + 1]++;
a[j] = a[j] - 10;
}
}
}
if(a[m] == 0)//?????M+1????0
{
for(i = m - 1; i >= 0; i--)//??m???
{
cout << a[i];
}
cout << endl;
}
else if(a[m] != 0)//???1
{
for(i = m; i >= 0; i--)//??M+1???
{
cout << a[i];
}
cout << endl;
}
}
return 0;
}
int shumu(int a[])
{
int k;
for(k = 99; a[k] == 0; k--)
{
}
return k;
}
|
25
|
12410
|
int main()
{
int n;
cin>>n;//n????
int a[100]={0},b[100];
a[0]=1;
int p=0,temp,i1;
if (n!=0)
{
for (int i=0;i<n;i++)
{
for (i1=0;i1<=99;i1++)
{
temp=a[i1]*2+p;
b[i1]=temp%10;
a[i1]=b[i1];
p=temp/10;
}
}//??????
int t=0,i2;
for (i2=99;i2>=0;i2--)
{
if (b[i2]==0)
continue;
else if (b[i2]!=0)
break;
}
for (int i3=i2;i3>=0;i3--)
cout<<b[i3];
}
else
cout<<1;//2?0???1
return 0;
}
|
25
|
12411
|
int n;
int a[1001]={0};
void count(int n)
{
if(n==0) return;
for(int i=1000;i>0;i--)
a[i]=a[i]*2;
for(int i=1000;i>0;i--)
{
if(a[i]>=10)
{
a[i]-=10;
a[i-1]++;
}
}
count(n-1);
}
int main()
{
cin>>n;
a[1000]=1;
count(n);
for(int i=0;i<1001;i++)
{
if(a[i])
{
for(int j=i;j<1001;j++)
cout<<a[j];
break;
}
}
return 0;
}
|
25
|
12412
|
int main()
{
int n;cin>>n;
int answer1[40]={0};
answer1[0]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<40;j++) //??????
{
answer1[j]=answer1[j]*2;
}
for(int j=0;j<40;j++)
{
if(answer1[j]>=10)
{
answer1[j]=answer1[j]-10;
answer1[j+1]++;
}
}
}
for(int i=37;i>=0;i--)
{
if(answer1[i]!=0||answer1[i+1]!=0||answer1[i+2])
cout<<answer1[i]; //????
}
return 0;
}
|
25
|
12413
|
int main(void)
{
char res[32]="0000000000000000000000000000001";
int n,i=0,j,c=0,t;
scanf("%d",&n);
for(;i<n;i++)
{
for(j=30;j>=0;j--)
{
t=(res[j]-'0')*2+c;
res[j]=t%10+'0';
c=t/10;
}
}
for(i=0;i<31&&res[i]=='0';i++);
for(j=i;j<31;j++)res[j-i]=res[j];res[j-i]='\0';
printf("%s\n",res);
return 0;
}
|
25
|
12414
|
int a[50] = {0};
int length()
{
int i;
for (i = 49; i >= 0; i--)
if (a[i] != 0)
return (i + 1);
return 0;
}
void power(int N)
{
int i, temp, add = 0;
if (N == -1)
cout << "1" << endl;
else if (N == 0)
{
for (i = length() - 1; i >= 0; i--)
cout << a[i];
cout << endl;
return;
}
else
{
for (i = 0; i < length(); i++)
{
temp = add + a[i] * 2;
a[i] = temp % 10;
add = temp / 10;
}
a[i] = add;
power(N - 1);
}
}
int main()
{
int N;
a[0] = 2;
cin >> N;
power(N - 1);
return 0;
}
|
25
|
12415
|
int N;
void chenger(int depth,char *a)
{
if(depth==N) //??N???
{
int len=strlen(a)-1;
for(int i=len;i>=0;i--)
cout<<a[i];
}
else
{
char b[100]={'\0'};
int len=strlen(a);
int temp[100]={0};//??
for(int i=0;i<len;i++)//??
{
b[i]=((a[i]-'0')*2)%10+temp[i]+'0';
temp[i+1]=((a[i]-'0')*2)/10;
}
if(temp[len]!=0) b[len]=temp[len]+'0';
chenger(depth+1,b);
}
}
int main()
{
cin>>N;
char num[100]={'\0'};
num[0]='1';//2?0??
chenger(0,num);
return 0;
}
|
25
|
12416
|
int main ()
{
int n, m = 0, i, j = 0, flag = 0, flag1 = 1;
int result[1001] = {1};
cin >> n;
for (i = 0; i < n; i++)
{
for (j = 0; j <= 1000; j++)
{
if (flag == 0) result[j] = result[j] * 2;
if (flag == 1) {result[j] = result[j] * 2 + 1; flag = 0;}
if (result[j] >= 10)
{
result[j] = result[j] - 10;
flag = 1;
}
}
}
for (i = 1000; i >= 0; i--)
{
if (result[i] == 0 && flag1 == 1)
{ continue;}
else
{
flag1 = 0;
cout << result[i];
}
}
return 0;
}
|
25
|
12417
|
int main(){
double a,b;
cin>>a;
b=(double)pow(2,a);
cout<<fixed<<setprecision(0);
cout<<b<<endl;
return 0;
}
|
25
|
12418
|
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
|
12419
|
int main()
{
int n;
int flag=1;
cin>>n;
int result[109];
memset(result,0,sizeof(result));
result[1]=1;
while(n>0)
{
n--;
for(int i=1;i<=100;i++)
result[i]=result[i]*2;
for(int i=1;i<=100;i++)
if(result[i]>=10)
{
result[i]=result[i]-10;
result[i+1]++;
}
}
for(int i=99;i>=1;i--)
{
if(result[i]>1e-6)
flag=0;
if(flag==0)
cout<<result[i];
}
return 0;
}
|
25
|
12420
|
int main(void)
{
int i,k,n,sum;
while(scanf("%d",&n)!=EOF)
{
sum=1;
int a[10000];
for(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]=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--)
printf("%d",a[i]);printf("\n");
}
return 0;
}
|
25
|
12421
|
/*
* a3.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
/*
* 3.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main()
{
int a[100]={0},i=0,n,b=1;
cin>>n;
if(n<32){
for(i=0;i<n;i++){
b*=2;
}
cout<<b<<endl;
}
else{
a[0]=2;
int len=1,j=0;
for(i=1;i<n;i++)
{
for(j=0;j<len;j++)
a[j]=a[j]*2;
for(j=0;j<len;j++)
if(a[j]>=10){
a[j+1]++;
a[j]=a[j]-10;
}
if(a[len]!=0)len++;
}
for(i=len-1;i>=0;i--)cout<<a[i];
//}
cout<<endl;}
return 0;
}
|
25
|
12422
|
int num[100];
int main(){
int n;
scanf("%d",&n);
int i,j;
num[99]=1;
for(j=0;j<n;j++){
for(i=0;i<100;i++){
num[i]*=2;
if(num[i]>9){
num[i]-=10;
num[i-1]+=1;
}
}
}
j=0;
for(i=0;i<100;i++){
if(num[i]!=0){
j++;
}
if(j!=0){
printf("%d",num[i]);
}
}
return 0;
}
|
25
|
12423
|
int main()
{
int ans[1000] = {0}, l = 0, i, n;
cin >> n;
ans[0] = 1;
l = 1;
while (n--)
{
for (i = 0; i < l; i++)
ans[i] = ans[i] << 1;
for (i = 0; i < l; i++)
{
if (i == l - 1 && ans[i] > 9)
{
l++;
}
ans[i + 1] += ans[i] / 10;
ans[i] %= 10;
}
}
for (i = l - 1; i >= 0; i--)
{
cout << ans[i];
}
cout << endl;
return 0;
}
|
25
|
12424
|
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
|
12425
|
int a[200] = {0};
void f(int n)
{
int i, m = 100, temp = 0;
while (a[m] == 0)
m--;
if (n == 0)
{
for (i = m; i >= 1; i--)
cout << a[i];
cout << endl;
return;
}
for (i = 1; i <= m; i++)
{
a[i] = a[i] * 2 + temp;
temp = 0;
if (a[i] >= 10)
{
temp = a[i] / 10;
a[i] = a[i] - 10;
}
}
if (temp != 0)
a[m + 1] = temp;
f(n - 1);
}
int main()
{
int n;
cin >> n;
a[1] = 1;
f(n);
return 0;
}
|
25
|
12426
|
int main()
{
const int MAX_LEN = 1000;
int n,i,j;
cin >> n;
int num[MAX_LEN]={0};
num[0]=1;
for (i=0;i<n;i++)
{
for (j=0;j<MAX_LEN;j++)
{
num[j]=num[j]*2;
}
for (j=0;j<MAX_LEN;j++)
{
if (num[j]>=10)
{
num[j+1]=num[j+1]+num[j]/10;
num[j]=num[j]%10;
}
}
}
i=MAX_LEN-1;
while (num[i]==0)
i--;
for (;i>=0;i--)
cout << num[i];
return 0;
}
|
25
|
12427
|
int main()
{
char a[1000000];
int N, i, j;
cin >> N;
for(i = 0;i < 1000000;i++)
a[i] = '0';
a[0] = '2';
int count = 1;
if(N == 0)
cout << 1;
else
{
for(i = 0;i < N-1;i++)
{
for(j = 0;j < 1000000;j++)
{
a[j] = (a[j] - '0')* 2;
}
for(j = 0;j < 1000000;j++)
{
if(a[j] > 9)
{
a[j] = a[j] - 10 + '0';
a[j+1]++;
}
else
{
a[j] = a[j] + '0';
}
}
}
int first = 0;
for(i = 999999;i>=0;i--)
{
if(a[i] != '0' || first == 1)
{
first = 1;
cout << a[i];
}
}
}
return 0;
}
|
25
|
12428
|
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
|
12429
|
//********************************
//*???2?N?? **
//*?????? 1300012773 **
//*???2013.11.13 **
//********************************
int main()
{
int N;
int num[10000] = {0}; //?????????0
int result;
int k;
cin >> N;
if(N == 0) //??N?????????????1?
cout << 1;
else //??N?????????
{
k = 0; //?k???????????
num[0] = 1;
//????????????????????
for(int i = 1; i <= N; i++)
{
for(int j = 0; j <= k; j++)
{
num[j] *= 2;
}
for(int j = 0; j <= k; j++)
{
if(num[j] >= 10)
{
num[j] -= 10;
num[j+1]++;
}
}
//??????????????k?1
if(num[k+1] != 0)k++;
}
//????
for(int j = k; j >= 0 ;j--)
cout << num[j];
}
return 0;
}
|
25
|
12430
|
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
|
12431
|
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
|
12432
|
char r[101];
int main()
{
int N,i,j,k,num;
cin>>N;
r[0]='1';
if(N==0)
{
cout<<1;
return 0;
}
else
{
for(i=1;i<=N;i++)
{
k=0;
for(j=0;j<strlen(r);j++)
{
if (r[j]>='0'&&r[j]<='4')
{
r[j]='0'+2*(r[j]-'0')+k;
k=0;
}
else
{
r[j]='0'+2*(r[j]-'5')+k;
k=1;
}
}
if(k==1) r[j]='1';
}
}
for (i=strlen(r)-1;i>=0;i--)
cout << r[i];
return 0;
}
|
25
|
12433
|
int main()
{
int n, num[35], i, j;
memset(num, 0, sizeof(num));
cin >> n;
if(n != 0)
{
num[0] = 2;
for(i = 1; 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;
}
if(n == 0)
cout << 1 << endl;
return 0;
}
|
25
|
12434
|
int main()
{
int n, ans[101], len, t;
memset(ans, 0, sizeof(ans));
ans[0] = 1;
len = 0;
cin >> n;
for (int i = 1; i <= n; ++i)
{
t = 0;
for (int j = 0; j <= len; ++j)
{
ans[j] *= 2;
ans[j] += t;
if (ans[j] >= 10)
{
t = 1;
ans[j] -= 10;
}
else
{
t = 0;
}
}
ans[len + 1] += t;
if (ans[len + 1] != 0) ++len;
}
for (int i = len; i >= 0; --i)
cout << ans[i];
return 0;
}
|
25
|
12435
|
int main()
{
int i, j, n;
cin >> n;
if (n == 0)
{
cout << 1 << endl;
}
else
{
int num[51] = {0};
num[0] = 01;
for (i = 1; i <= n; i++)
{
for (j = 0; j < 50; j++)
{
num[j] = 2 * num[j];
}
for (j = 0; j < 50; j++)
{
if (num[j] >= 10)
{
num[j+1] += 1;
num[j] -= 10;
}
}
}
i = 50;
while (num[i] == 0)
{
i--;
}
for (; i >= 0; i--)
{
cout << num[i];
}
}
return 0;
}
|
25
|
12436
|
/*
*?????
*???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
|
12437
|
int main()
{
int i,j,k,b;
int m[10000]={0};
int n;
cin>>n;
if(n==0)
cout<<1;
if(n==1)
cout<<2;
if(n>1){
m[0]=2;
for(i=1;i<=n-1;i++)
{for(j=0;j<9999;j++)
m[j]=m[j]*2;
for(j=0;j<9999;j++)
if(m[j]>9)
{
m[j]=m[j]%10;
m[j+1]++;
}
}
for(i=9999;i>=0;i--)
if(m[i]!=0)
{k=i;break;}
for(b=k;b>=0;b--)
cout<<m[b];}
return 0;
}
|
25
|
12438
|
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
|
12439
|
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
|
12440
|
int main()
{
double n;
cin >> n;
if(n < 20)
{
cout << pow(2 , n);
}
if(n == 20) cout << "1048576";
if(n == 21) cout << "2097152";
if(n == 22) cout << "4194304";
if(n == 23) cout << "8388608";
if(n == 24) cout << "16777216";
if(n == 25) cout << "33554432";
if(n == 26) cout << "67108864";
if(n == 27) cout << "134217728";
if(n == 28) cout << "268435456";
if(n == 29) cout << "536870912";
if(n == 30) cout << "1073741824";
if(n == 31) cout << "2147483648";
if(n == 32) cout << "4294967296";
if(n == 33) cout << "8589934592";
if(n == 34) cout << "17179869184";
if(n == 35) cout << "34359738368";
if(n == 36) cout << "68719476736";
if(n == 37) cout << "137438953472";
if(n == 38) cout << "274877906944";
if(n == 39) cout << "549755813888";
if(n == 40) cout << "1099511627776";
if(n == 41) cout << "2199023255552";
if(n == 42) cout << "4398046511104";
if(n == 43) cout << "8796093022208";
if(n == 44) cout << "17592186044416";
if(n == 45) cout << "35184372088832";
if(n == 46) cout << "70368744177664";
if(n == 47) cout << "140737488355328";
if(n == 48) cout << "281474976710656";
if(n == 49) cout << "562949953421312";
if(n == 50) cout << "1125899906842624";
if(n == 51) cout << "2251799813685248";
if(n == 52) cout << "4503599627370496";
if(n == 53) cout << "9007199254740992";
if(n == 54) cout << "18014398509481984";
if(n == 55) cout << "36028797018963968";
if(n == 56) cout << "72057594037927936";
if(n == 57) cout << "144115188075855872";
if(n == 58) cout << "288230376151711744";
if(n == 59) cout << "576460752303423488";
if(n == 60) cout << "1152921504606846976";
if(n == 61) cout << "2305843009213693952";
if(n == 62) cout << "4611686018427387904";
if(n == 63) cout << "9223372036854775808";
if(n == 64) cout << "18446744073709551616";
if(n == 65) cout << "36893488147419103232";
if(n == 66) cout << "73786976294838206464";
if(n == 67) cout << "147573952589676412928";
if(n == 68) cout << "295147905179352825856";
if(n == 69) cout << "590295810358705651712";
if(n == 70) cout << "1180591620717411303424";
if(n == 71) cout << "2361183241434822606848";
if(n == 72) cout << "4722366482869645213696";
if(n == 73) cout << "9444732965739290427392";
if(n == 74) cout << "18889465931478580854784";
if(n == 75) cout << "37778931862957161709568";
if(n == 76) cout << "75557863725914323419136";
if(n == 77) cout << "151115727451828646838272";
if(n == 78) cout << "302231454903657293676544";
if(n == 79) cout << "604462909807314587353088";
if(n == 80) cout << "1208925819614629174706176";
if(n == 81) cout << "2417851639229258349412352";
if(n == 82) cout << "4835703278458516698824704";
if(n == 83) cout << "9671406556917033397649408";
if(n == 84) cout << "19342813113834066795298816";
if(n == 85) cout << "38685626227668133590597632";
if(n == 86) cout << "77371252455336267181195264";
if(n == 87) cout << "154742504910672534362390528";
if(n == 88) cout << "309485009821345068724781056";
if(n == 89) cout << "618970019642690137449562112";
if(n == 90) cout << "1237940039285380274899124224";
if(n == 91) cout << "2475880078570760549798248448";
if(n == 92) cout << "4951760157141521099596496896";
if(n == 93) cout << "9903520314283042199192993792";
if(n == 94) cout << "19807040628566084398385987584";
if(n == 95) cout << "39614081257132168796771975168";
if(n == 96) cout << "79228162514264337593543950336";
if(n == 97) cout << "158456325028528675187087900672";
if(n == 98) cout << "316912650057057350374175801344";
if(n == 99) cout << "633825300114114700748351602688";
if(n == 100)cout << "1267650600228229401496703205376";
return 0;
}
|
25
|
12441
|
int main()
{
int a[55];
memset(a,-1,55*sizeof(int));
int n;
cin>>n;
a[0]=1;
while(n>0)
{
int i,yu=0,ji=0;
for(i=0;;i++)
{
if(a[i]==-1){a[i]=a[i]+yu*2;break;}
else
{
ji=a[i]*2;
ji=ji+yu;
a[i]=ji%10;
if(ji>9)yu=1;
else yu=0;
}
}
n--;
}
int i=0;
while(a[i]!=-1)i++;
i--;
while(i>-1){cout<<a[i];i--;}
return 0;
}
|
25
|
12442
|
int main()
{
int n, i = 0, x, y, m;
char s[300], a[300];
cin >> n;
s[0] = '1';
for(;n > 0;n--)
{
x = y = 0;
m = i + 1;
m--;
for(i = 0; i <= m; i++)
{
y = x + (s[m - i] - '0') * 2;
a[i] = y % 10 + '0';
x = y / 10;
}
if(x != 0)
a[i] = x + '0';
else
i--;
for(m = 0; m <= i; m++)
s[m] = a[i - m];
}
for(m = 0; m <=i ; m++)
cout << s[m];
return 0;
}
|
25
|
12443
|
int main(int argc, char* argv[])
{
double n,i,k=1;
scanf("%lf",&n);
if(n==0){
printf("1");
}else{
for(i=0;i<n;i++){
k=2*k;
}
printf("%.0lf",k);
}
return 0;
}
|
25
|
12444
|
//***************************************************
//* name: 5.cpp *
//* author:?? *
//* date: 2013-11-16 *
//* description: ??2?N?? *
//***************************************************
int main ()
{
int n , i , j , num[100] ={0};
cin >>n ;
num[0] = 1 ;//?1???
for(i = 0 ; i < n ; i++)
{
for (j = 0 ; j < 100 ; j++)
num[j] = num[j] * 2 ;//
for (j = 0 ; j < 100 ; j++)
{
if(num[j] >= 10)
{
num [j]= num[j]-10;
num [j+1]++ ;
}
}
}
for(j = 99 ; j >= 0 ; j--)
{
if(num[j] == 0)
continue ;
break ;
}
while (j >= 0)
{
cout << num [j];
if(j % 50==0)
cout << endl;
j-- ;
}
return 0 ;
}
|
25
|
12445
|
int main()
{
int N, i = 1; //N????N??, i?????
int result[40]= {0}; //result????,2?100??????40??
cin >> N;
result[0] = 1; //2?0???1
while ( i <= N )
{
for ( int j = 0; j < 39; j++ )
{
result[j] *= 2; //?????2
}
for ( int k = 0; k < 39; k++ )
{
if ( result[k] >= 10 )
{
result[k+1] += result[k] / 10; //??
result[k] %= 10; //?????????
}
}
i++;
}
i = 39; //??????????????????result
while ( result[i] == 0 )
{
i--; //???????
}
for ( int k = i; k >= 0; k-- )
cout << result[k]; //????result
return 0;
}
|
25
|
12446
|
/*
* 3.cpp
*
* Created on: 2013-1-13
* Author: i
*/
int main(){
int num[40]={1},temp[40]={1},n,i;
cin>>n;
while(n--){
for(i=0;i<40;i++){
if(num[i]==0&&num[i+1]==0&&num[i+2]==0)break;
if(num[i]+temp[i]>9){
temp[i+1]++;
temp[i]=num[i]+temp[i]-10;
}
else{
temp[i]=num[i]+temp[i];
}
}
for(i=0;i<40;i++){
num[i]=temp[i];
}
}
n=0;
for(i=39;i>=0;i--){
if(n)cout<<num[i];
else if(num[i]!=0){
cout<<num[i];
n++;
}
}
cout<<endl;
return 0;
}
|
25
|
12447
|
int main()
{
int N,num[110]={0},an[110]={0},i;
num[0]=1;an[0]=1;
cin>>N;
while(N--)
{
memset(an,0,sizeof(an));
for(i=0;i<110;i++)
an[i]=num[i]*2;
for(i=0;i<110;i++)
{
if(an[i]>=10)
{
an[i+1]+=an[i]/10;
an[i]=an[i]%10;
}
}
for(i=0;i<110;i++)
num[i]=an[i];
}
if(an[0]==1)
cout<<1<<endl;
else
{
i=105;
while(an[i]==0&&i>=0) //???????0???
i--;
for(;i>=0;i--)
cout<<an[i]; //??????????????
cout<<endl;
}
cin.get();cin.get();
return 0;
}
|
25
|
12448
|
int main(int argc, char *argv[])
{
int i,j,k=1,n;
int b[100]={0};
scanf("%d",&n);
b[99]=1;
for(i=0;i<n;i++)
{
for(j=99;j>=0;j--)
b[j]=b[j]*2;
for(j=99;j>=0;j--)
{
if(b[j]>9)
{b[j]=b[j]-10;
b[j-1]++;}
}
}
for(i=0;i<100;i++)
{
if(b[i]>0)
break;
}
for(j=i;j<100;j++)
printf("%d",b[j]);
return 0;
}
|
25
|
12449
|
int a[100000],b[1000000];
int main()
{
int n,i,j,cnt=1;
cin>>n;
for(i=0;i<10000;i++)
{
a[i]=0;
b[i]=0;
}
a[0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<100000;j++)
{
a[j]=a[j]*2+b[j];
if(a[j]>=10)
{
a[j]-=10;
b[j+1]++;
}
}
for(j=0;j<10000;j++)
b[j]=0;
}
j=100000;
while(a[j]==0)
j--;
for(;j>=0;j--)
cout<<a[j];
return 0;
}
|
25
|
12450
|
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
|
12451
|
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
|
12452
|
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
|
12453
|
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
|
12454
|
/*************************************
*file 5.cpp ******
*author ??? ****
*date 2013-11-19 ***
*description 2?n?? *
*************************************/
int main()
{
int n;
cin >> n; //?????
int c[200] = {0}; //??????????
c[0] = 1; //??2?0?????
int i, j, k;
int m = 0; //??????????????-1
for(i = 1; i <= n; i++)
{
//????
for(j = 0; j <= m; j++)
{
c[j]*=2; //?????????2?
}
//????
for(j = 0; j <= m; j++) //??????
{
if(c[j] >= 10)
{
c[j]-=10;
c[j + 1]++;
}
}
if(!c[m + 1]) //???m??????????0?
m++;
}
int o = 0; //0????????????
for(i = 199; i >= 0; i--)
{
if(c[i]) //???????
{
cout << c[i];
o = 1;
}
else if(o) //??????????????????
cout << c[i];
}
cout << endl;
return 0;
}
|
25
|
12455
|
int main ( )
{
int N, i, j, t = 0, exp[1000] = {2, 0};
cin >> N;
if(N==0)
cout <<1<<endl;
else
{
for(i = 1;i < N;i++)
{
t = 0;
for(j = 0;;j++)
{
if(exp[j+1]==0 && exp[j+2]==0 && exp[j+3]==0)
{
exp[j] = 2*exp[j]+t;
t = exp[j]/10;
exp[j] = exp[j] - 10*t;
exp[j+1] = t;
break;
}
else
{
if(j==0)
{
t = 2*exp[j]/10;
exp[j] = 2*exp[j] - 10*t;
}
else
{
exp[j] = 2*exp[j]+t;
t = exp[j]/10;
exp[j] = exp[j] - 10*t;
}
}
}
}
for(i = 999;i >= 0;i--)
{
if(exp[i]!=0)
break;
}
for(;i >=0;i--)
{
cout << exp[i];
}
}
return 0;
}
|
25
|
12456
|
//****************************************************************
// ????1000012789_2.cpp *
// ???wusy *
// ???12,15 *
// ???2?N? *
//****************************************************************
int main()
{
int a[50], n, i, j;
cin >> n;
memset(a, 0, sizeof(a));
a[0] = 1;
for (i = 0; i < n; i++)
{
for(j = 0; j < 50; j++)
a[j] = a[j] * 2;
for(j = 0; j < 50; j++)
{
if(a[j] >= 10)
{
a[j + 1] = a[j + 1] + a[j] / 10;
a[j] = a[j] % 10;
}
}
}
for (i = 49; i >= 0; i--)
if (a[i] != 0)
break;
for (; i >=0; i--)
cout << a[i];
return 0;
}
|
25
|
12457
|
int a[105][105] = {0};
int main()
{
int n;
int len = 0;
int i,j;
int flag;
cin >> n;
a[1][1] = 2;
for( i = 1; i<= n -1 ; i++)
{
for(j = 1; j <= n; j++)
{
a[i+1][j] = (a[i][j] * 2 + a[i+1][j]) % 10;
a[i+1][j+1] = (a[i][j] * 2 / 10 + a[i+1][j+1]) % 10;
}
}
for(i = n ; i >= 1; i--)
{
if(a[n][i] != 0)
{
flag = 1;
len = i;
break;
}
}
for(i = len; i >= 1; i--)
printf("%d",a[n][i]);
if(n == 0)
{
printf("1\n");
}
return 0;
}
|
25
|
12458
|
//**********************
//* 2.cpp
int main()
{
int a[35] = {0}, m, i, j, p = 0;
int b[35] = {0};
cin >> m;
a[34] = 1;
for (j = 1; j <= m; j++)
{
for (i = 34; i >= 1; i--)
{
b[i] = a[i] * 2 % 10 + b[i];
b[i - 1] = a[i] * 2 / 10 + b[i - 1];
}
for (i = 0; i <= 34; i++)
{
a[i] = b[i];
b[i] = 0;
}
}
for (i = 0; i <= 34; i++)
{
if (a[i] != 0)
p = 1;
if (p == 1)
cout << a[i];
}
return 0;
}
|
25
|
12459
|
int a[35],b[35],c[35],d[35];
void jiaziji();
int main ()
{
int n=0;
cin>>n;
for (int i=0;i<35;i++)
{
a[i]=0;
b[i]=0;
c[i]=0;
d[i]=0;
}
a[34]=1;b[34]=1;
for (int i=0;i<n;i++) jiaziji();
if (n==0) cout<<'1'<<endl;
else//?????????????
{
int p=0;
for (int i=0;i<35;i++)
{
if (c[i]!=0)
{
p=i;
break;
}
}
for (int i=p;i<35;i++)
{
cout<<c[i];
}
}
return 0;
}
void jiaziji()//?????????????????
{
for (int i=34;i>0;i--)//c????????d???????a?b?????????????
{
c[i]=a[i]+b[i]+d[i];
if (c[i]>9) //????
{
c[i]-=10;
d[i-1]+=1;
}
}
for (int i=0;i<35;i++)//????????????????????a?b???d????
{
a[i]=c[i];
b[i]=c[i];
d[i]=0;
}
}
|
25
|
12460
|
int main()
{
int n , len = 1;
int num [50] = { 0 }, *p = num , carry = 0;
num [ 0 ] = 1;
cin >> n;
while ( n -- )
{
p = num;
carry = 0;
while ( p < num + len )
{
*p *= 2;
*p += carry;
carry = 0;
while ( *p > 9 )
{
carry ++;
*p -= 10;
}
p ++;
}
if ( carry )
{
len ++;
*p = carry;
}
}
if ( *p == 0 )
p --;
while ( p >= num )
{
cout << *p;
p --;
}
return 0;
}
|
25
|
12461
|
int result[ 50 ] = { 1 } ;
void power2( int n ) ;
int main()
{
int n ;
cin >> n ;
power2( n ) ;
return 0 ;
}
void power2( int n )
{
int i , j = 0 ;
for( i = 0 ; i < 50 ; i ++ )
result[ i ] = result[ i ] * 2 ;
for( i = 0 ; i < 50 ; i ++ )
if( result[ i ] >= 10 )
{
result[ i + 1 ] = result[ i + 1 ] + result[ i ] / 10 ;
result[ i ] = result[ i ] % 10 ;
}
if( n == 1 )
{
i = 50 - 1 ;
while( result[ i ] == 0 )
i -- ; //???????0??
for( ; i >= 0 ; i -- )
cout << result[ i ] ; //??????
cout << endl ;
return ;
}
else
{
if( n == 0 )
{
cout << 1 ;
return ;
}
else
power2( n - 1 ) ;
}
}
|
25
|
12462
|
int main()
{
int n,i,j,t;
int a[100],b[100];
cin>>n;
for(i=0;i<100;i++)
{
a[i]=0;
b[i]=0;
}
a[0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<99;j++)
{
b[j+1]=(a[j]*2)/10;
a[j]=(a[j]*2)%10+b[j];
b[j]=0;
}
}
for(i=99;i>=0;i--)
{
if(a[i]!=0)
{
t=i;
break;
}
}
for(i=t;i>=0;i--)
{
cout<<a[i];
}
return 0;
}
|
25
|
12463
|
/*
* jisuan2deNcifang.cpp
*
* Created on: 2013-1-11
* Author: 120001791??
* ???
*/
int main() {
int N = 0, i = 0, n = 0, r = 0, temp = 0;//5????????N?????r????
int a[35];//1????????????
cin >> N;//??N
memset(a, 0, sizeof(a));//a??
a[0] = 1;//????1
while (N--) {//N????
for (i = 0; i < 35; i++) {//???????
temp = r;//????
r = (a[i] * 2 + r) / 10;//??????
a[i] = (a[i] * 2 + temp) % 10;//????
}
}
for (n = 34; a[n] == 0; n--)
;//?????0
for (; n >= 0; n--)//???
cout << a[n];//????
return 0;
}
|
25
|
12464
|
int main()
{
int num[101][100];
int i, j, n;
for (i = 0; i < 100; i ++)
for (j = 0; j < 101; j ++)
num[j][i] = 0;
num[0][0] = 1;
cin >> n;
for (i = 1; i <= n; i ++)
{
for (j = 0; j < 90; j ++)
{
num[i][j] += 2 * num[i - 1][j];
if (num[i][j] > 9)
{
num[i][j + 1] += num[i][j] / 10;
num[i][j] = num[i][j] % 10;
}
}
}
i = 90;
while (num[n][i] == 0)
i --;
for (j = i; j >= 0; j --)
cout << num[n][j];
cout << endl;
return 0;
}
|
25
|
12465
|
void cheng (char *a)
{
int t,w[100]={0},i,k,j=0,s=0;
t=strlen(a);
for(i=t-1;i>=0;i--)
{
w[j]=a[i]-'0';
w[j]=2*w[j];
j++;
}
for(i=0;i<=t-1;i++)
{
w[i+1]=w[i]/10+w[i+1];
w[i]=w[i]%10;
}
j=90;
while(w[j]==0)j--;
for(i=j;i>=0;i--)
{
a[s]=w[i]+'0';
s++;
}
}
int main()
{
int n,i,s;
char a[100]={'1'};
cin>>n;
for(i=1;i<=n;i++)
{
cheng(a);
}
s=strlen(a);
for(i=0;i<=s-1;i++)
{
cout<<a[i];
}
return 0;
}
|
25
|
12466
|
int main()
{
int n,i;
cin>>n;
int a[40]={0};
a[0]=1;
while(n)
{
int j=0;
for(i=0;i<40;i++)
{
a[i]=2*a[i]+j;
j=0;
if(a[i]>9)
{
a[i]=a[i]-10;
j=1;
}
}
n--;
}
for(i=39;i>=0;i--)
if(a[i]!=0)
break;
for(;i>=0;i--)
cout<<a[i];
return 0;
}
|
25
|
12467
|
//******************************************************
//* ? ? ? ?? ? 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
|
12468
|
char c1[101]={'\0'};//??????
char c2[101]={'\0'};//??????
char c3[101]={'\0'};//??
int main()
{
void cal(int);
int n,i;
cin>>n;
c1[0]='1';//???????1
cal(n);
char c[100]={'\0'};
for(i=0;i<strlen(c1);i++)
c[i]=c1[strlen(c1)-i-1];//?????
cout<<c;
return 0;
}
void cal(int n)
{
int i;
if(n!=0)
{
for(i=0;c1[i]!='\0';i++)
{
if((c1[i]-'0')*2>=10)
{
c2[i]=(c1[i]-'0')*2-10+'0';
c3[i+1]='1'; //???1
}
else
{
c2[i]=(c1[i]-'0')*2+'0';
c3[i+1]='0';
}
}
for(i=1;c3[i]!='\0';i++)
{
if(c2[i]!='\0')
c2[i]=c2[i]+c3[i]-'0';
else if(c3[i]=='1') c2[i]=c3[i]; //???????????????
}
strcpy(c1,c2);
cal(n-1);
}
}
|
25
|
12469
|
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
|
12470
|
/* ???:2?N??
???:1000012896 leo
??:2010.12.17
????:??2?N??
*/
int main()
{
int num[31]={0}, N, i, j, flag;
num[30] = 1;
cin >> N;
for (i = 1; i <= N; i++)
{
flag = 0;
for (j = 30; j >= 0; j--)
{
if (num[j] * 2 + flag >= 10)
{
num[j] = num[j] * 2 + flag - 10;
flag = 1;
}
else
{
num[j] = num[j] * 2 + flag;
flag = 0;
}
}
}
for (i = 0; i <= 30; i++)
if (num[i] != 0)
break;
for (; i <= 30; i++)
cout << num[i];
return 0;
}
|
25
|
12471
|
int main()
{
int n,i,j,k = 0,flag = 0;
int num[1000]={0};
cin >> n ;
num[0] = 1;
for (i = 1; i <= n; i ++)
{
for (j = 0 ; j <= k; j ++)
{
num[j] = num[j] * 2 + flag;
flag = 0;
if (num[j] >= 10)
{
num[j] = num[j] - 10;
flag = 1;
}
}
if (flag == 1)
{
k ++;
num[k] = 1;
flag = 0 ;
}
}
for ( i = k ; i >=0 ; i -- )
cout << num[i];
return 0;
}
|
25
|
12472
|
int main()
{
int num[1000]={0},k=0,i=0,j=0,s=0;
num[0]=1;
cin>>k;
for(i=0;i<k;i++)
{
for(j=0;j<1000;j++)
num[j]*=2;
for(j=0;j<1000;j++)
{
num[j+1]+=num[j]/10;
num[j]=num[j]%10;
}
}
for(i=999;i>=0;i--)
{
if(num[i]!=0)s++;
if(s>0)cout<<num[i];
}
return 0;
}
|
25
|
12473
|
/* 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
|
12474
|
int main()
{
int n,flag=0,count=0,j,i=0,sum[100]={1};
cin>>n;
for(i=0;i<n;i++)
{
flag=0;
for(j=99;j>=0;j--)
{
if(sum[j]==0&&flag==0)
continue;
else
flag=1;
sum[j]*=2;
if(sum[j]>=10)
{
sum[j]-=10;
sum[j+1]+=1;
}
}
}
for(i=99;i>=0;i--)
{
if(sum[i]!=0)
{
for(j=i;j>=0;j--)
{
cout<<sum[j];
}
cout<<endl;
break;
}
}
return 0;
}
|
25
|
12475
|
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
|
12476
|
int main()
{
int i, n, x, temp=0;
int a[90];
memset(a, -1, sizeof(a));
a[89] = 2;
cin >> n;
if(n == 0)
cout << "1";
else
{
while(--n)
{
temp = 0;
for(i = 89; a[i] != -1; i--)
{
x = a[i] * 2 + temp;
if(x < 10)
{
a[i] = x;
temp = 0;
}
else
{
a[i] = x % 10;
temp = x / 10;
if(a[i - 1] == -1)
{
a[i-1] += temp + 1;
break;
}
}
}
}
for(i = 0; i < 90; i++)
{
if(a[i] != -1)
cout << a[i];
}
}
return 0;
}
|
25
|
12477
|
int main()
{
int a[100]={0},t=0,i,j,n;
scanf("%d",&n);
a[1]=1;
for (i=1;i<=n;i++)
{
for (j=90;j>=1;j--)
{
a[j]*=2;
a[j+1]+=a[j]/10;
a[j]=a[j]%10;
}
}
n=99;
while (n)
{
if (a[n]) t=1;
if (t) printf("%d",a[n]);
n--;
}
}
|
25
|
12478
|
int main()
{
int a[1001];
memset(a,0,sizeof(a));
int i,j,k,n;
int p = 0;
cin >> n ;
a[1] = 2 ;
if(n == 0)
{
cout << "1";
}
else
{
for(i = 1; i< n; i++)
{
p = 0;
for(j = 1; j <=1000; j ++)
{
a[j] = a[j] * 2 + p ;
p = a[j] / 10;
a[j] = a[j] % 10;
}
}
for( i = 1000; a[i] == 0 ; i-- );
k = i ;
for(i = k ;i >= 1 ; i -- )
{
cout<<a[i];
}
}
return 0 ;
}
|
25
|
12479
|
int main()
{
void fun ( int[] );
int num[1000], i, n;
cin >> n;
memset( num, 0, sizeof(num) );
num[0] = 1;
for ( i = 1; i <= n; i++ )
fun ( num );
int *p = NULL;
for ( p = num + 999; *p == 0; p-- );
for ( ; p >= num; p-- )
cout << *p;
return 0;
}
void fun ( int num[] )
{
int *p = NULL;
for ( p = num; p < num + 1000; p++ )
*p = 2 * *p;
for ( p = num; p < num + 1000; p++ )
if ( *p > 9 )
{
*p = *p - 10;
*( p + 1 ) = *( p + 1 ) + 1;
}
}
|
25
|
12480
|
int main(int argc, char* argv[])
{
int n;
double s=2;
scanf("%d",&n);
int i;
if(n==0){
s=1;
}
if(n==1){
s=2;
}
if(n>=2){
for(i=2;i<=n;i++){
s=s*2;
}
}
printf("%.0lf",s);
return 0;
}
|
25
|
12481
|
int main(){
char ANS[MAX];
memset(ANS,0,sizeof(ANS));
ANS[0]='1';
ANS[1]='\0';
int N;
cin>>N;
for(int i=1;i<=N;i++){
int LEN=strlen(ANS);
int g=0,h=0,k;
for(k=0;g||k<LEN;k++){
int mk=0;
if(k<LEN) mk=ANS[k]-'0';
h=mk*2+g;
g=h/10;
ANS[k]=h%10+'0';
}
ANS[k]='\0';
}
for(int i=0;i<strlen(ANS);i++) cout<<ANS[strlen(ANS)-i-1];
return 0;
}
|
25
|
12482
|
int main()
{
int i, n, a[102]={0}, b[102]={1}, j; //a????????b????????n????
cin >> n; //??n
if (n==0) //??n?0
cout << "1" << endl; //??1
else //??n????
{
for (j=1;j<=n;j++) //???n?
{
for (i=0;i<101;i++) //?????????
{
a[i] = 2 * b[i];
}
for (i = 0; i < 101; i++) //????????????10???1
{
if (a[i]>=10)
{
a[i+1] += a[i]/10;
a[i] %= 10;
}
}
while (a[i]==0) //???????0??
i--;
for (; i>=0; i--) //???????????????b
{
b[i] = a[i];
if (j == n) //?????n?
cout << a[i]; //????
}
}
cout << endl;
}
return 0;
}
|
25
|
12483
|
void cf(char a[])
{
int t=strlen(a),i;
for(i=0;i<t;i++)
a[i]=(a[i]-48)*2+48;
for(i=0;i<t-1;i++)
{
if(a[i]>57)
{
a[i]-=10;
a[i+1]+=1;
}
}
if(a[t-1]>57)
{
a[t-1]-=10;
a[t]='1';
}
}
void strre(char a[])
{
int i,j,k;
char t;
k=strlen(a);
for(j=0,i=k-1;j<k/2;j++,i--)
{
t=a[j];
a[j]=a[i];
a[i]=t;
}
}
void main()
{
int n;
char a[100]={'1'};
scanf("%d",&n);
while(n--)
{
cf(a);
}
strre(a);
puts(a);
}
|
25
|
12484
|
//********************************
//*?????2?N?? **
//*?????? 1300012861 **
//*???2013.11.17 **
//********************************
int main()
{
int N, i, j, len,t;
const int MAX_LEN = 200;
unsigned num[MAX_LEN];
memset(num, 0, sizeof(num)); //????
num[0] = 2;
len = 1;
cin >> N;
if ( N == 0 )
cout << 1 << endl;
else
{
for ( i = 2; i <= N; i++ )
{
t=0;
for ( j = 0; j < len; j++ )
{ num[j] = 2 * num[j]+t;
t=num[j]/10;
num[j]%=10;
}
if ( t > 0 )
{num[len]=t;len++;}
}
j = len;
while ( num[j] == 0)
j--;
for ( ; j >= 0; j-- )
cout << num[j];
cout << endl;
}
return 0;
}
|
25
|
12485
|
int a[101],b[101];//b??????
int n;
void f(int i)
{
int j;
if(i==n)
return;
else
{
for(j=0;j<101;j++)
b[j]=0;
for(j=100;j>=0;j--)
{
a[j]=a[j]*2+b[j];//????
if(a[j]>=10)
{a[j]=a[j]-10;
b[j-1]=1;}
}
f(i+1);
}
}
int main()
{
cin>>n;
a[100]=1;
f(0);
int i;
for(i=0; ;i++)
{
if(a[i]!=0)
break;
}
for(i;i<=100;i++)
cout<<a[i];
}
|
25
|
12486
|
int a[1000];
void jisuan(int a[])
{
int l,i,flag;
for(i=999;i>=0;i--)
{
if(a[i]!=0)
{ l=i;
break;
}
}
a[0]=a[0]*2;
flag=a[0]/10;
a[0]=a[0]%10;
for(i=1;i<=l+1;i++)
{
a[i]=2*a[i]+flag;
flag=a[i]/10;
a[i]=a[i]%10;
}
}
int main()
{
int N,i,l;
cin>>N;
for(i=0;i<1000;i++)
a[i]=0;
a[0]=1;
for(i=0;i<N;i++)
jisuan(a);
for(i=999;i>=0;i--)
{
if(a[i]!=0)
{
l=i;
break;
}
}
for(i=l;i>=0;i--)
cout<<a[i];
return 0;
}
|
25
|
12487
|
void Multiply(int[50]);
int main()
{
int n, num[50] = {0}, i;
num[0] = 1;
cin >> n;
for(i = 1; i <= n; i++)
{
Multiply(num);
}
i = 49;
while(num[i] == 0) i--;
for(; i >= 0;)
{
cout << num[i--];
}
return 0;
}
void Multiply(int num[50])
{
int i;
for(i = 0; i < 50; i++)
{
num[i] *= 2;
}
for(i = 0; i < 50; i++)
{
if(num[i] >= 10)
{
num[i + 1] += num[i] / 10;
num[i] = num[i] % 10;
}
}
return;
}
|
25
|
12488
|
int main(){
int n;
cin>>n;
if(n==0){
cout<<1<<endl;return 0;
}
n--;
static int a[1000],b[1000];
for(int i=0;i<1000;i++)a[i]=0;
a[0]=1;a[1]=2;
while(n){
n--;
for(int i=0;i<1000;i++)b[i]=0;
b[0]=a[0];
for(int i=1;i<=a[0];i++){
b[i]+=a[i]*2;
b[i+1]+=b[i]/10;
b[i]%=10;
}
if(b[a[0]+1]>0)b[0]++;
for(int i=0;i<1000;i++)a[i]=b[i];
}
for(int i=a[0];i>=1;i--){
cout<<a[i];
}
cout<<endl;
return 0;
}
|
25
|
12489
|
int main()
{
int N;
cin>>N;
int a[500]={0};
int b[500]={0};
if(N==0)cout<<"1";
else
{
a[0]=2;
for(int i = 0 ; i < N-1 ; i++)
{
for(int j = 0 ; j < 500 ; j++)
{
if((a[j]*2)<10)a[j]=a[j]*2;
else
{
a[j]=(a[j]*2)%10;
b[j+1]=1;
}
}
for(int j = 0 ; j < 500 ; j++)a[j]=a[j]+b[j],b[j]=0;
}
int flag=0;
for(int i = 499 ; i >= 0 ; i--)
{
if(a[i]!=0 || flag==1)
{
flag=1;
cout<<a[i];
}
}
}
return 0;
}
|
25
|
12490
|
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
|
12491
|
int main()
{
int m,n,i,j,k,jin;
int a[35],b[35];//n????????
cin>>m;
for(i=1;i<35;i++)a[i]=0;
a[0]=2;
for(i=1;i<m;i++)
{
jin=0;
for(j=0;j<35;j++)
{
b[j]=(2*a[j]+jin)%10;
jin=(2*a[j]+jin)/10;
}
for(j=0;j<35;j++)
{a[j]=b[j];}
}
for(i=34;i>=0;i--)
{
if(a[i]!=0)break;
}
if(m==0)cout<<1;
else if(i==-1)cout<<a[0];
else
{
for(j=i;j>=0;j--)cout<<a[j];
}
return 0;
}
|
25
|
12492
|
/**
* @file 5.cpp
* @author ???
* @date 2013-11-13
* @description ?????????2?N??
*/
int main(void)
{
int N, a[100] = {0}, i, k;
a[99] = 1;
cin >> N;
for( i = 0 ; i < N ; i++ )
{
for( k = 1 ; k <= 100 ; k++ )
a[100 - k] *= 2;
for( k = 1 ; k <= 100 ; k++ )
if( a[100 - k] > 9 )
{
a[99 - k] += a[100 - k] / 10;
a[100 - k] %= 10;
}
}
for( k = 0 ; k < 100 ; k++ )
if( a[k] )
break;
for( ; k < 100 ; k++ )
cout << a[k];
return 0;
}
|
25
|
12493
|
/***************************??2?N??**********************
??
??????????N(N<=100)???2?N?????
????
??????????N?
????
??2?N?????
????
5
????
32
??
?????
***********************************************************
programmer Qiu HEzi
version 1.0
creat time 2012.12.21 1:14
***********************************************************/
void c (char *temp , int num)
{
*temp = '0' +num;
}
int fun (char a[110] , int w)
{
int plu =0 ; //????????1
for (int i=0 ; i<w ; i++)
{
int temp = (a[i]-'0')*2 +plu;
if (temp>=10)
{
plu=1;
temp-=10;
}
else
plu=0;
a[i]=temp+'0';
}
if (plu==1)
{
w++;
a[w-1]='1';
}
return w;
}
int main()
{
int n;
cin>>n;
char a[110]={0};
a[0]='1';
int w=1 ;//???????
for (int i=0 ; i<n ; i++)
w = fun (a , w);
for (int i=w-1 ; i>=0 ; i--)
cout<<a[i];
return 0;
}
|
25
|
12494
|
/*
* 3.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main()
{
int n;
cin >> n;
int i, j, k;
char ans[1000];
int tans[1000];
ans[0] = 1 + '0';
ans[1] = '\0';
for (i = 0; i < n; i++) {
int len = strlen(ans);
for (j = 0; j < len; j++) {
tans[j] = (ans[j] - '0') * 2;
}
int carry = 0;
for (j = 0; j < len; j++) {
int carrytem = tans[j] / 10;
tans[j] = (tans[j] + carry) % 10;
carry = carrytem; }
if (carry == 1) {
tans[j] = 1;
j++;
}
for (k = 0; k < j; k++) {
ans[k] = tans[k] + '0';
}
ans[j] = '\0';
}
int lentem = strlen(ans);
for (i = lentem - 1; i >= 0; i--)
cout << ans[i];
return 0;
}
|
25
|
12495
|
/**
* ??????
* ???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
|
12496
|
//**********************************
//* ????homework_5.cpp *
//* ??????1200012884 *
//* ?????2012?12?17? *
//* ???????2?N??
//**********************************
int main()
{
int n, temp, len;
cin >> n;
int i, j;
int a[100] = {0};
a[0] = 1;
len = 1;
for (i = 0;i < n;i++)
{
temp = 0;
for (j = 0;j < len;j++)
{
a[j] = a[j] * 2 + temp;
temp = floor(a[j] / 10);
a[j] = a[j] % 10;
}
if (temp > 0)
{
a[j] = temp;
len++;
}
}
for (i = len - 1;i >= 0;i--)
cout << a[i];
cout << endl;
return 0;
}
|
25
|
12497
|
void bigmulti(char a[],char b[],char c[])
{
int i,tem[400],j,k,la=strlen(a),lb=strlen(b);
int sum[800],num1[400],num2[400];
memset(sum,0,sizeof(sum));
memset(num1,0,sizeof(num1));
memset(num2,0,sizeof(num2));
for(i=0;i<la;i++)
num1[i]=a[la-1-i]-'0';
for(i=0;i<lb;i++)
num2[i]=b[lb-1-i]-'0';
for(i=0;i<lb;i++)
{
memset(tem,0,sizeof(tem));
tem[0]=num1[0]*num2[i];
for(j=1;j<=la;j++)
{
tem[j]=num1[j]*num2[i]+tem[j-1]/10;
tem[j-1]%=10;
}
for(j=0;j<=200;j++)
{
if(j==0&&i==0)
sum[0]=tem[0];
else
{
sum[i+j]=sum[i+j]+tem[j]+sum[i+j-1]/10;
sum[i+j-1]%=10;
}
}
}
for(i=la+lb;i>=0&&sum[i]==0;i--);
c[i+1]='\0';
for(j=0;j<=i;j++)
c[i-j]=sum[j]+'0';
}
int main()
{
int n,i;
char s[1000]="1",a[1000];
scanf("%d",&n);
for(i=1;i<=n;i++){
bigmulti(s,"2",a);
strcpy(s,a);
}
printf("%s",s);
return 0;
}
|
25
|
12498
|
int main()
{
int n,num1,num2,s=0;;
char a[110];
for(int i=1;i<=109;i++)
a[i]='*';
cin>>n;
int t=1;
int sig;
a[1]='2';
if(n==1)
cout<<2<<endl;
else
{
if(n==0)
cout<<1;
else
{
for(int i=1;i<=n-1;i++)
{
sig=t;
for(int j=1;j<=sig;j++)
{
num1=a[j]-48;
num1=num1*2+s;
s=0;
if(num1<10)
a[j]=num1+48;
else
{
a[j]=num1+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
|
12499
|
int x[10000]={0};
int b=1;
void f(int a,int n){
int i;
if(n==1);
else {
for(i=0;i<a;i++)x[i]=x[i]*2;
for(i=0;i<a;i++){
if(i<a-1){
if(x[i]>=10){
x[i]-=10;
x[i+1]+=1;}
}
else {
if(x[i]<10)f(a,n-1);
else {x[i+1]=1;
x[i]-=10;
b++;
f(a+1,n-1);
}
}
}}
}
int main()
{
int i,j,n,a,q,m,g,k,h;
scanf("%d",&n);
if(n==0)printf("1");
else{
x[0]=2;
f(1,n);
for(i=b-1;i>=0;i--){
printf("%d",x[i]);}
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.