label stringlengths 1 2 | index stringlengths 1 5 | code stringlengths 87 8.24k |
|---|---|---|
25 | 12200 |
int main()
{
int a1[102],i,a3[102];
memset(a1,0,sizeof(a1));
memset(a3,0,sizeof(a3));
a1[0]=1;
int n;
cin >> n;
while(n-->0)
{
for(i=0;i<101;i++)
{
a3[i]+=a1[i]*2;
if(a3[i]>=10)
{
a3[i+1]++;
a3[i]=a3[i]%10;
}
}
for(i=0;i<101;i++)
a1[i]=a3[i];
memset(a3,0,sizeof... |
25 | 12201 | void compute (int x, int time);
char num[100];
int ad[100];
int N, len = 1;
int main()
{
int j, k;
cin >> N;
for (k = 0; k < 100; k++)
{
num[k] = '0';
ad[k] = 0;
}
if (N == 0)
{
cout << '1';
return 0;
}
num[0] = '2';
compute(1, N);
for (j = len - 1; j >= 0; j--) // ????
{
cout << num[j];
}
re... |
25 | 12202 | int main()
{
int N,i,j,b;
int a[100]={0};
scanf("%d",&N);
a[0]=1;
for(i=0;i<N;i++)
{
for(j=0;j<100;j++)
{
a[j]*=2;
}
for(j=0;j<100;j++)
{
if(a[j]>9)
{
a[j+1]++;
a[j]%=10;
}
}
}
for(j=99;j>=0;j--)
{
if(a[j]!=0)
{
b=j;
break;
}
}
for(j=b;j>=0;j--)
{
printf("%d",a[... |
25 | 12203 | int main()
{
int i, n, num[1005], flag = 0, p = 1, j, t;
cin >> n;
for(i = 0; i<= 1004; i++)
num[i] = 10;
if(n == 0)
cout << "1" << endl;
else
{
num[1000] = 1;
for(i = 1; i <= n; i++)
{
t = p;
for(j = 1000; j >= 1000 - p + 1; j--)
{
num[j] = num[j] * 2 + flag;
flag = 0;
if(num[j] >=... |
25 | 12204 | /*************************
??cpp5
??(11-12) ??2?N??
???
2013/11/14
**************************/
int main()
{
int i, j, m, k,N, a[100]={0}, flag=0;
cin >> N;
a[0]=1;
for(i=1; i<= N; i++)
{
for (j=0; j<=99; j++)
{
if (2 * a[j] +flag < 10 )
{
a[j] = 2 * a[j] +flag;
flag = 0;
}
else
{
a[... |
25 | 12205 | int a[100]={1};
void multiplus(int a[])
{
int b[100]={0};
for(int i=0;i<100;i++)
{
if(a[i]*2+b[i]>=10) b[i+1]=1;
a[i]=(a[i]*2+b[i])%10;
}
}
int main()
{
int n,i,k;
cin>>n;
for(i=0;i<n;i++)
{
multiplus(a);
}
for(i=99;i>=0;i--)
{... |
25 | 12206 | /*
* final_07.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int sum[1000]={1};
int len=1;
void cheng(void){
int i=0;
for(i=0;i<len;i++)
sum[i]=sum[i]*2;
for(i=0;i<len-1;i++){
if(sum[i]>=10){
sum[i]=sum[i]-10;
sum[i+1]++;
}
}
if(sum[len-1]>=10){
sum[i]=sum[i]-10;
sum[i+1]++;
len+... |
25 | 12207 | int main()
{
int n;cin>>n;
int num[1001]={0};
num[1000]=1;
int i,j;
while(n--)
{
for(i=1000;i>0;i--)
num[i]=num[i]*2;
for(i=1000;i>0;i--)
{
if(num[i]>=10)
{
num[i]=num[i]-10;
num[i-1]=num[i-1]+1;
}
}
}
for(i=0;i<=1000;i++)
{
if(num[i]!=0)
{
for(j=i;j<=1000;j++)
cout<<num[... |
25 | 12208 | int main()
{
int a[1000]={0};
int b[1000]={0},n,c;
a[999]=1;
cin >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 1000; j++)
{
a[j]*=2;
}//????
for (int j = 999; j >= 0; j--)
{
if (a[j]>9)
{
a[j-1]+=1;
a[j]-=10;
}//????
}
}
for (int j = 0; j < 1000; j++)
{
if (a[j]!=0)... |
25 | 12209 | int main(){
int n,i,j,b[1000];
scanf("%d",&n);
b[0]=1;
for(i=1;i<1000;i++){
b[i]=0;
}
for(i=0;i<n;i++){
j=1;
b[0]=b[0]*2;
for(j=1;1;j++){
if(b[j]==0&&b[j+1]==0&&b[j+2]==0){
b[j]=b[j-1]/10;
b[j-1]=b[j-1]%10;
break;
}
b[j]=b[j]*2+b[j-1]/10;
b[j-1]=b[j-1]%10;
}
}
if(n!=0){
if(b[j... |
25 | 12210 | int main()
{
int a[100]={0};
a[0]=1;
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=0;j<100;j++)
{
a[j]*=2;
}
for(int j=0;j<100;j++)
{
if(a[j]>=10)
{
a[j]-=10;
a[j+1]++;
}
}
}
int len=0;
for(int i=99;i>=0;i--)
{
if(a[i]!=0)
{
len=i;
break;
}
}
for(int i=len;i>=0... |
25 | 12211 | int main()
{
int n,i,j;
int re[100];
for(int x=0;x<100;x++)
re[x]=0;
cin>>n;
if(n==0)
cout<<"1"<<endl;
else if(n==1)
cout<<"2"<<endl;
else
{
re[99]=2;
for(i=1;i<n;i++)
{
j=99;
while(j!=0)
{
re[j]=re[j]*2;
j--;
}
j=99;
while(j!=0)
{
if(re[j]>=10)
{
re[j-1]+=r... |
25 | 12212 | //***************************************
//??2?N??
int main()
{
int n;
double a[1000]={0};
cin>>n;
a[999]=2;
if(n==0)
cout<<1;
else
{
for(int i=0;i<n-1;i++)
for(int j=999;j>=0;j--)
{
if(a[j]+a[j]<10)
a[j]=a[j]*2;
else
{
a[j]=a[j]*2-10;
a[j-1]=0.5+a[j-1];
}
}
int m=0... |
25 | 12213 | //***************************
//*?????2?N?? **
//*?????? **
//*???2013.11.15 **
//***************************
int main()
{
int i,j,k,n;
cin>>n;
int a[52];
if(n==0)
{
cout<<"1"<<endl;
}
else
{
for(i=0;i<=50;i++)
{
a[i]=0;
}
a[51]=1;
for(i=0;i<n;i++)
{
for(j=5... |
25 | 12214 | int main()
{
int N;
scanf("%d",&N);
int i,sz[1000];
double sum=1;
for(i=1;i<=N;i++){
sz[i]=2;
sum=sum*sz[i];
}
printf("%.0lf",sum);
return 0;
} |
25 | 12215 | int main()
{
int n=0,a[50],b[50],c=0,num=0,yushu=0;
cin>>n;
int i=0;
a[0]=1;
b[0]=1;
for(i=1;i<50;i++)
{
a[i]=0;
b[i]=0;
}
for(i=0;i<n;i++)
{
num=0;
yushu=0;
c=a[num]*2+yushu;
if(c<10)
b[num]=c;
else if(c>=10)
{
b[num]=c%10;
yushu=c/10;
}
num++;
//while(a[num-1]!=0 && num-1>=0)
... |
25 | 12216 |
int main()
{
int n;
cin >> n;
char a[200] = {0}, b[200] = {0} ;
int c[200] = {0}, d[200] = {0};
a[0] =1 + '0';
int i=0;
char *p=a;
while(i<n)
{
int j =0;
while( j<strlen(a) )
{
c[j] = a[j] - '0';
j++;
}
j=0;
while (j<strlen(a))
{
c[j] = c[j]*2;
j++;
}
j=0;
while (... |
25 | 12217 | char *mul(char *, char *);
int main()
{
char str1[100000] = "1", str2[100000];
int n, i;
int length = strlen(str2);
char *q = str1, *p = str2;;
cin >> n;
for (i = 0; i < n; i++)
{
q = str1;
p = mul(str1, str2);
p--;
for (; p >= str2; p--)
{
*q = *p;
q++;
}
}
cout << str1 << endl;
return 0;
... |
25 | 12218 | int main()
{
int n,num;
cin>>n;
int a[100];
int i,j,k;
for(i=0;i<100;i++)
{
a[i]=0;
}
a[99]=1;
for(j=0;j<n;j++)
{
for(i=0;i<100;i++)
{
a[i]=a[i]*2;
if(a[i]>=10)
{
a[i]=a[i]-10;
a[i-1]=a[i-1]+1;
}
}
}
for(i=0;i<100;i++)
{
if(a[i]!=0)
{
num=i;
break;
}
}
for(i=num;i<100;i++)
{
co... |
25 | 12219 | int main()
{
int flag=0;
int k,i,j,sum[100001];
cin>>k;
memset(sum,0,sizeof(sum));
sum[0]=1;
for(i=0;i<k;i++)
{
for(j=0;j<=100000;j++)
{
sum[j] *= 2;
}
for(j=0;j<=100000;j++)
{
if(sum[j]>=10)
{
sum[j]-=10;
sum[j+1]+=1;
}
}
}
for(i=100000;i>=0;i--)
... |
25 | 12220 | /*
* 2mi.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main()
{
int n,i,s[100],j;
for(i=0;i<100;++i)
s[i]=0;
s[0]=1;
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<100;j++)
{
s[j]=2*s[j];
}
for(j=0;j<100;j++){
if(s[j]>9)
{
s[j+1]=s[j+1]+1;
s[j]=s[j]%10;
}}
}
for(i=99;i>=0... |
25 | 12221 | /*
* 3.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
int main(){
int n,m;
cin>>n;
int i,carry=0,lenx=1;
int y[405]={0};
int x[405]={0};
x[0]=1;
for(m=1;m<=n;m++)
{
carry=0;
for(i=0;i<lenx;i++)
y[i]=0;
for(i=0;i<lenx;i++){
if(x[i]*2>=10){
y[i]=x[i]*2-10+carry;
carry=1;
}
e... |
25 | 12222 | //?????2?N??
//??????
//???2010.12.15
int g_a = 0; //?????? g_a ????????????????1????0
int main()
{
int n = 0;
int a[100]; //???a???????????
int i = 0;
int j = 0;
int flag = 0;
memset(a,0,sizeof(a));
cin >> n;
a[99] = 1; //a[99]?????
for (i = 1; i <= n; i++)
for (j = 99; j >= 50; j--)
{... |
25 | 12223 | //**********************************
//????1000012825 *
//?????? *
//???12.15 *
//?????2?N?? *
//**********************************
int main ()
{
int n, i ,j, a[101] = {0}, k;
cin >> n;
a[0] = 1;
for ( i = 1; i <= n; i++ )
{
for ( j = 0; j <= 1... |
25 | 12224 | /*
* 12.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
/*
* 13.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
char a[1000] ;
int b[1000] ;
void chen() ;
int main()
{
int n ,i,j;
cin >> n ;
a[0] = '1' ;
for (i = 1 ; i<1000 ;i++)
a[i] = '#' ;
if (n == 0)
cout << "1" ;
else
{ for (i =... |
25 | 12225 |
int main()
{
int N, i, j, num = 1;
int s[101] = {0};
cin >> N;
s[0] = 1;
for (i = 0; i < N; i++)
{
for (j = 0; j < num; j++)
{
s[j] = s[j] * 2;
}
for (j = 0; j < num; j++)
{
if (s[j] >= 10)
{
s[j] -= 10;
s[j+1]++;
}
}
if (s[num] == 1) num++;
}
for (i = num - 1; i >= 0; i--... |
25 | 12226 | int main()
{
int n,m,i,j,num[101]={0};
cin>>n;
num[0]=2;
if(n==0) cout<<'1'<<endl;
else
{
while(n>1)
{
for(i=100;i>=0;i--)
{
if(num[i]!=0)
break;
}
for(j=0;j<=i;j++)
{
num[j]=num[j]*2;
}
for(j=0;j<=i;j++)
{
if(num[j]>=10)
{
num[j]=num[j]-10;
num[j+1]=num[... |
25 | 12227 |
int main()
{
int n;
cin>>n;
int a[1001]={0};
a[1000]=1;
int i,j;
while(n--)
{
for(i=1000;i>0;i--)
a[i]*=2; //????????*2
for(i=1000;i>0;i--)
{
if(a[i]>=10) //????????????10???
{
a[i]-=10;
... |
25 | 12228 | /*
* 3.cpp
*
* Created on: 2011-12-31
* Author: 2011
*/
void times2(char *a,int length){
int i,carry=0;
for(i=0;i<length;i++){
a[i]=a[i]*2+carry-'0';
if(a[i]>'9'){
a[i]=a[i]-10;
carry=1;
}
else carry=0;
}
if(carry==1){
a[length]='1';
}
}
int main(){
int n,i,length;
cin>>n;
char answer... |
25 | 12229 |
int n;
int num=0;
int a[40]={0};
int b[40]={0};
int c[40]={0};
void calculate()
{
int i;
memset(b,0,sizeof(b));
for(i=0;i<40;i++){
b[i]=b[i]+(a[i]*2)%10;
b[i+1]=(a[i]*2)/10+b[i+1];}
for(i=0;i<40;i++)
a[i]=b[i];
}
int main()
{
cin>>n;
int i=0,l=0;a[0]=1;
for(i=0;i<=n-1;i++)
calculate();
for(i=39;a... |
25 | 12230 | int main()
{
int a[100]={0},n,b,i,j,k;
a[99]=1;
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<100;j++)
{
if(a[j]*2>=10)
{
a[j-1]++;
... |
25 | 12231 | int main()
{
int a[101]={0},b[101]={0},I=0;
a[0]=1;
int n;
cin>>n;
for(int j=1;j<=n;j++)
{
for(int i=0;i<101;i++)
{
a[i]=a[i]*2;
if(a[i]>=10)
{
a[i]-=10;
b[i+1]++;
}
}
for(int i=0;i<101;i++)
{
a[i]=a[i]+b[i];
b[i]=0;
}
}
for(int i=99;i>=0;i--)
{
if(a[i]!=0)I++;
if(I>0)... |
25 | 12232 | int main()
{
int a[50] = {0}, i, j, k = 0, n, p = 48;
cin >> n;
a[49] = 1;
for (i = 1; i <= n; i++)
{
for (j = 49; j >= p; j--)
{
a[j] = a[j] * 2 + k;
if (a[j] >= 10)
{
k = 1;
a[j] = a[j] - 10;
}
else k = 0;
}
if (a[p] > 0) p--;
}
while (a[p] == 0) p++;
for (i = p; i <= 49; i++)
... |
25 | 12233 | //*****************************
//* ??????2?N?? **
//* ?????? 1300012948 **
//* ???2013.11.15 **
//*****************************
int main()
{
int a[32] = {0}, n, p;
cin >> n;
a[0] = 1;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 32; j++) // ????????????
... |
25 | 12234 | int main()
{
int n, i, j, a[35] = {0};
a[1] = 1;
cin >> n;
if(n == 0) cout << a[1] <<endl;
else
{
for(i = 1;i <= n;i++)
{
int flag[35] = {0};
for(j = 1; ;j++)
{
if(a[j]*2 <= 8)
{
a[j] = a[j]*2 + flag[j-1];
if(a[j+1] == 0 && a[j+2] ==0 &&a[j+3] == 0) break;
}
else if(a[j]*... |
25 | 12235 | //***************************
//?????? 1200012896 **
//???2012.12.23 **
//?????2?N?? **
//***************************
int main()
{
int n;
cin >> n;
switch (n)
{
case 0: cout << "1" << endl; break;
case 1: cout << "2" << endl; break;
case 2: cout << "4"... |
25 | 12236 | //********************************
//*?????2?N?? **
//*?????? 1300012957 **
//*???2013.11.19 **
//********************************
int main ( )
{
int n ;
cin >> n ;
double n1[101] = {0} ;
int i,j ;
if( n == 0 )
{
cout << 1 ;
} //?????0????1
else if( n != 0 ) //??... |
25 | 12237 |
int main()
{
int N, i, j, count, flag;
char num[1000];
for (i = 0; i < 1000; i++)
{
num[i] = '0';
}
num[0] = '1';
cin >> N;
for (i = 1; i <= N; i++)
{
count = 999;
while (num[count] == '0')
count--;
count++;
j = 0;
flag = 0;
while (j <= count)
{
num[j] = 2 * num[j] - '0';
if (flag == ... |
25 | 12238 | /*
* file homework 12_2
* author ??
* date 2010-12-18
* description
?????????2?n?????????
*/
int main()
{
char s[50] = {'0'};
int n, i, j, len, t, carry; //carry ????
cin >> n;
s[0] = '1';
len = 1; // len??s???
for (i = 1; i <= n; i++) ... |
25 | 12239 | int main()
{
int i, n, m, flag = 0, k;
int a[40] = {0};
cin >> n;
a[39] = 1;
m = 0;
for (k = 1; k <= n; k ++)
{
for (i = 39; i >= 1; i --)
{
if (a[i] >= 5)
{
a[i] = a[i] * 2 - 10 + m;
m = 1;
}
else
{
a[i] = a[i] * 2 + m;
m = 0;
}
}
}
for (i = 0; i <= 39; i ++)
{
if (... |
25 | 12240 | int ans[50]={0,1};
void calc()
{
int i,t=0;
for(i=1;i<=40;i++)
{
ans[i]=ans[i]*2+t;
t=ans[i]/10;
ans[i]%=10;
}
}
int main()
{
int m,i,j;
cin>>m;
for(i=1;i<=m;i++)
calc();
j=0;
for(i=40;i>=1;i--)
{
if(ans[i]!=0)j=1;
if(j==1)cout<<ans[i];
}
return 0;
} |
25 | 12241 | int a[100001]={0};
int main()
{
int N;
cin>>N;
int i,j,p,q,x;
a[0]=2;
if(N==0)
{
cout<<1;
exit(1);
}
else
{
for(i=1;i<=N-1;i++)
{
for(j=0;j<1000;j++)
{
a[j]=a[j]+a[j];
}
for(x=0;x<1000;x++)
{
if(a[x]>=10)
{
a[x]=a[x]-10;
a[x+1]=a[x+1]+1;
}
}
}
}
p=1000;... |
25 | 12242 | int main()
{
int s=1,n,len1,len2,i,j,num1[100],num2[100],num3[40000]={0},flag;
char str1[100]={0};
cin>>n;
if(n<32){
for( i=0;i<n;i++)
s*=2;
cout<<s;
}
else if(n>=32&&n<=60)
{
num1[9]=1,num1[8]=0,num1[7]=7,num1[6]=3,num1[5]=7,num1[4]=4,num1[3]=1,num1[2]=8,num1[1]=2,num1[0]=4;
j=0;
n=n-30;s=1;
for(i=0;i... |
25 | 12243 | void exponent(int a[], int n);
int main()
{
int n;
int a[200];
int i;
memset(a, 0, sizeof(a));
a[0] = 1;
cin >> n;
exponent(a, n);
for(i = 199; a[i] == 0; i--);
for(;i >= 0;i--)
{
cout << a[i];
}
return 0;
}
void exponent(int a[], int n)
{
if(n == 0)
return;
else
{
int i, k;
for(i = 199; a[i] == ... |
25 | 12244 | int main()
{
char num[10000] , a ;
int n , i , len = 1 , k ;
cin >> n ;
cin.get() ;
num[0] = '1' ;
for ( i = 1 ; i <= n ; i++ )
{
if ( ( num[0] + num[0] ) > ( '9' + '0' ) )
{
len++ ;
for ( k = len - 1 ; k >= 1 ; k-- )
{
num[k] = num[k-1] ;
}
num[0] = '1' ;
if ( len > 2 )
{
for ( ... |
25 | 12245 | /* ??2?N??
?????? 2010.12.15 */
void mul(int, int *);//??2??
void out(int *);//??
int main()
{
int n;
int a[40] = {1};//????????
cin >> n;
mul(n, a);
return 0;
}
void mul(int n,int *a)
{
if(n == 0)
{
out(a);
return ;
}
int i;
for(i = 0; i < 40; i++)
a[i] = a[i] * 2;//???2
for(... |
25 | 12246 | int main()
{
int n,i,j,k;
cin>>n;
int num[50]={0};
num[1]=2;
for(i=1;i<n;i++)
{
k=49;
while(num[k]==0)
k--;
for(j=1;j<=k+1;j++)
{
num[j]*=2;
if(num[j-1]>=10)
{
num[j-1]-=10;
num[j]++;
}
}
}
if(n==0)
cout<<1<<endl;
else
{
k=49;
while(num[k]==0)
k--;
for(i=k;i>0;i--)
... |
25 | 12247 |
int main ()
{
char a[100]={0};
a[99]=2;
int n;
cin >>n;
for (int j=1;j<=n-1;j++)
{
for (int i=99;i>=0;i--)
{
a[i]=a[i]*2;
}
for (int i=99;i>=0;i--)
{
if (a[i]>=10)
{
a[i]=a[i]-10;
a[i-1]=a[i-1]+1;
... |
25 | 12248 | int main ()
{
int N ;
cin >> N ;
int num[1000] = {0} ;
num[999] = 1 ;
for (int i = 1 ; i <= N ; i ++)
{
for (int j = 999 ; j >= 1 ; j --)
{
num[j] *= 2 ;
}
for (int j = 999 ; j >= 1 ; j --)
{
num[j - 1] += num[j] / 10 ;
num[j] = num[j] % 10 ;
}
}
int b = 0 ;
while (num[b] == 0)
b ++ ;
... |
25 | 12249 | int n, num[100];
void multi()
{
int pos = 0, step;
while(num[pos] == 0)
{
pos++;
}
for(int i = 99; i >= pos; i--)
num[i] *= 2;
for(int i = 99; i >= pos; i--)
{
if(num[i] >= 10)
{
step = num[i] / 10;
num[i - 1] += step;
num[i] = num[i] % 10;
}
}
}
int main()
{
int p = 0;
cin >> n;
if(n =... |
25 | 12250 | int a[1000]={0};
long sum=1;
void mi(int);
int main()
{
int n,i,j=1;
a[0]=4;a[1]=2;a[2]=0;a[3]=1;
cin>>n;
if(n==0)cout<<1<<endl;
else if(n<=10)
{
for(i=0;i<n;i++)
j*=2;
cout<<j<<endl;
}
else mi(n-10);
return 0;
}
void mi(int n)
{
int i,j,len=0;
if(n==0)
{
for(i=999;i>=0;i--)
{
if(a[i]!=0)
... |
25 | 12251 | void main()
{
char a[105]={"1"},temp;
int s,b[105],i,j,k;
scanf("%d",&s);
while(s--){
for(i=0;a[i]!=0;i++){
b[i]=(a[i]-'0')*2;
}
for(j=0;j<i;j++){
if(j==i-1&&b[j]>=10){
b[j]-=10;
b[j+1]=1;
i++;
break;
}
if(b[j]>=10){
b[j]-=10;
b[j+1]++;
}
}
for(j=0;j<i;j++)a[j]=b[j]+... |
25 | 12252 | int main()
{
int n, i , k, te, a[100], yu=0, io=0;
cin >> n;
memset(a, 0 , sizeof(a));
a[0] = 1;
if(n==0)
cout << a[0] << endl;
else
{
for(i = 1; i <= n; i++)
for(k = 0; k < 100; k++)
{
io = yu; //io?????, yu????
te = a[k] * 2;
if(te > 9)
{
yu = 1;
... |
25 | 12253 | void play(int a[100],int b[100]);
int end[100]={0};
int main()
{
int a[100]={0},N,i=0,j=0;
cin>>N;
a[1]=2;
if(N==0){cout<<"1";return 0;}
else
{
for(i=0;i<N-1;i++)
{
play(a,a);
for(j=0;j<100;j++)
{a[j]=end[j];}
}
}
for(i=99;i>=0;i--)
{if(a[i]!=0)break;}
for(j=i;j>0;j--)
{cout<<a[j];}... |
25 | 12254 | main()
{
int n,i,k;
scanf("%d",&n);
int v[1001]={0};
v[0]=1;
while(n--)
{
for(i=0;i<=1000;i++)
v[i]=v[i]*2;
for(i=0;i<=1000;i++)
{
if(v[i]>=10)
{
v[i]=v[i]-10;
v[i+1]=v[i+1]+1;
}
}
}
//printf("%d\n",v[1]);
int flag=0;
for(i=1000;i>=0;i--)
{
if(v[i]!=0)
{ for(k=i;k>=0;k-... |
25 | 12255 | int main()
{
int N;
cin >> N;
if( N == 0 )
{ cout << "1" ;return 0; }
char a[1000] = "2";
for( int i = 0; i< N - 1; i++ )
{
char b[1000];
int yushu = 0, j;
for( j = 0; j < strlen( a ); j++ )
{
b[j] = ( a[j] - '0' ) * 2 + yushu;
yushu = b[j] / 10;
b[j] = b[j] % 10 + '0';
}
if( yushu != 0 )
{ b[j] = yushu + '0';b[j + 1] ... |
25 | 12256 | /**
* @file ??2?N?? .cpp
* @author ???
* @date 2013-11-16
* @description
* ??????: ??2?N??
*/
int main()
{
int N;
double a[500]={0};
cin>>N;
a[0]=1;
for(int i=1;i<=N;i++)
{
for(int j=0;;j++)
{
if(a[j]==0&&a[j+1]==0&&a[j+2]==0)
break;
a[j]=a[j]*2;
if(a[j]>=10)
{
... |
25 | 12257 | //**************************
//*?????2?N?? **
//*?????? **
//*???20131114 **
//**************************
int main ()
{
int n ,i ,j ,k ,nLen ,h ,lg ,q ,flag;
int a[9999] ,b[9999];
memset(a,0,sizeof(a));
cin >> n;
if(n == 0)
cout << "1" << endl;
if(n == 1)
cout << "2" << endl;//??????
i... |
25 | 12258 | void f(int n,int a[100])
{ if(n==0) return ;
else
{ int b[100]={0};
int i;
for(i=1;i<100;i++)
{ b[i]=(2*a[i])/10;
a[i]=(2*a[i])%10+b[i-1];
}
f(n-1,a);
}
}
int main()
{ int n;
cin>>n;
int a[100]={0};
a[1]=1;
f(n,a);
... |
25 | 12259 |
char s[50]; //?????????2?100???????50??
int i,j,k;
int flag=0;
void f(int n) //?????????2?n??????
{
if(n==0) return;
else if(n==1)
{
for(i=48; i>=0; i--)
{
s[i]=(s[i]-'0')*2+flag; //???????????????2???
... |
25 | 12260 |
int main()
{
int n;
cin >> n;
char str[102];
str[1] = '1';
for (int i = 2; i < 102; i++)
str[i] = '0';
int num[102];
for (int i = 1; i < 102; i++)
num[i] = str[i] - '0';
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= 101; j++)
num[j] *= 2;
... |
25 | 12261 |
int main()
{
int N;
int value[1001] = {0};
int i;
value[1000] = 1;
scanf("%d", &N); //2^N
while(N--)
{
for(i = 1000; i > 0; i--)
{
value[i] *= 2;
}
for(i = 1000; i > 0; i--)
{
if(value[i] >... |
25 | 12262 | //*****************************
//*?????? 1300012809 **
//*???2013.11.16 **
//*?????2?N?? **
//*****************************
int main()
{
int n, i, j, changdu;
changdu = 1; //?????
int a[1005] = {0}; ... |
25 | 12263 | int main()
{
int k , i ,j ,len;
int str[100];
memset( str , 0 ,sizeof( str ) );
scanf("%d",&k);
str[0] = 2;
len =1;
for( i = 2 ;i <= k; i ++ )
{
for( j = 0 ; j < len ;j++ )
str[j] = str[j]*2;
for( j = 0 ;j < len ;j++ )
{
if( str[j] >= 10 )
... |
25 | 12264 | //******************************************************
/* ? ? ? ???2?n???????
/* ? ? ????
/* ? ? ? ??2010 ? 12 ? 15 ?
/* ? ? ? ????2?n???n????100?
/* ? ? ?1000012752
*******************************************************/
void chengfang(int result[],int n)
{
... |
25 | 12265 | int main()
{
int n=0,d=0,i=0,j;
int a[1000]={0};
memset(a,0,sizeof(a));
cin>>n;
int p=1;
a[1]=1;
for(i=1;i<=n;i++)
{
d=0;
for(j=1;j<=p;j++)
{
a[j]=d+a[j]*2;d=d-d;
if(a[j]>=10)
{
a[j]=a[j]-10;d=1;
}
}
a[p+1]=d+a[p+1];
if(a[p+1]!=0)
{p=p+1;}
}
i=999;
for(;i>=0;i--)
{
if(a[i]!=0... |
25 | 12266 | int a[500] = {0};
void f(int c)
{
int i;
if (c == 0)
{
return ;
}
if (c == 1)
{
for (i = 0 ; i <= 499 ; i++)
{
a[i] *= 2;
}
for (i = 499 ; i >= 1 ; i--)
{
a[i - 1] += a[i] / 10;
a[i] %= 10;
}
a[0] %= 10;
return ;
}
if (c % 2 == 0)
{
f(c / 2);
f(c / 2);
return ;
}
else
{
f(... |
25 | 12267 | char number[100];
char transnum[100];
void inttochar(int num)
{
int i = 0;
char temp[100];
do
{
temp[i] = num % 10 + '0';
num = num / 10;
i++;
}while(num != 0);
for (int j = i - 1; j >= 0; j--)
{
number[i - 1 - j] = temp[j];
}
return;
}
void multiply(char number[], int k)
{
int t = 0;
for(int j = st... |
25 | 12268 | int main ()
{
int m=1,n,i,c=0,sz[1000],p,j,b;
scanf("%d",&n);
if(n<=30){
for(i=0;i<n;i++){
m*=2;
}
printf("%d",m);
}
else{
sz[0]=4;
sz[1]=2;
sz[2]=8;
sz[3]=1;
sz[4]=4;
sz[5]=7;
sz[6]=3;
sz[7]=7;
sz[8]=0;
sz[9]=1;
p=10;
b=p;
for(i=0;i<n-30;i++){
c=0;
for(j=0;j<p;j++){
... |
25 | 12269 | int main()
{
int i,a;
double d;
scanf("%d",&a);
d=1;
if(a==0){
d=1;
}
if(a!=0){
for(i=1;i<=a;i++){
d=d*2;
}
}
printf("%.0lf",d);
} |
25 | 12270 | int main()
{
int N;
cin >> N;
const int MAX_LEN = 210;
unsigned num[MAX_LEN + 1] = { 0 };
num[1] = 1;
for (int i = 1; i <= N; i++)
{
for (int k = 1; k <= N; k++)
num[k] *= 2;
for (int k = 1; k <= N; k++)
if (num[k] >= 10)
{
num[k + 1] = num[k + 1] + num[k] / 10;
num[k] = num[k] % 10;
}
... |
25 | 12271 | int main()
{
int m[100] = {0};
m[0] = 2;
int N,i,j,temp = 0,t = 0,count = 0;
cin >> N;
if(N == 0)
cout << 1 << endl;
else
{
for(i = 1 ; i < N ; i++)
{
for(j = 0 ; j <= count + 1 ; j++)
{
t = m[j] * 2 + temp;
temp = t / 10;
m[j] = t % 10;
}
for(j = 100 ; j >= 0 ; j--)
{
if(m[j... |
25 | 12272 | int main()
{
int n,cnt=0;
cin>>n;
int num[100]={0};
num[0]=1;
for(int j=0;j<n;j++)
{
for(int i=0;i<100;i++)
{
num[i]=num[i]*2;
}
for(int i=0;i<100;i++)
{
if(num[i]>=10)
{
num[i+1]+=num[i]/10;
num[i]=num[i]%10;
}
}
}
int k=99;
while(num[k]==0) k--;
for(int i=k;i>=0;i--)
cout<<num[i];
... |
25 | 12273 | //***********************************************************************************
//???????2?n??
//?? ????
//??? 11-13
//***********************************************************************************
int main()
{
int n; //??
int a[41] = {0}; //??????????0
int i, j, k;
cin >... |
25 | 12274 | int main()
{
int num[1000] = {0}, up, add, i, k, n;
cin >> n;
num[0] = 1;
if (n == 0)
{
cout << 1;
return 0;
}
up = 0;
while (n > 0)
{
add = 0;
for (i = 0; i <= up; i++)
{
k = (num[i] * 2 + add) / 10;
num[i] = (num[i] * 2 + add) % 10;
add = k;
}
if (add != 0)
num[++up] = add;
n--;
... |
25 | 12275 | int main()
{
int a[110]={0};
int n ;
cin>>n;
a[0]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<100;j++)
{
a[j]=a[j]*2;
}
//for(int j=0;j<20;j++)
//{cout<<a[j]<<endl ;}
for(int j=0;j<100;j++)
{
if(a[j]>9)
... |
25 | 12276 | int main()
{
int num[101]={0};
int N,q,i,j=0;
cin>>N;
num[0]=1;
for(q=1;q<=N;q++)
{
for(i = 0;i<=100 ; i++)
num[i]= num[i] * 2; //???????????
for (i = 0;i<=100 ; i++)
if(num[i] >= 10)
{
num[i + 1] = num[i+1] +num[i]/10; //?????????
num[i] =num[i]%10; //???????????
}
}
i=100;
while(num[... |
25 | 12277 | int main()
{
int n,i,j;
int a[100]={0};
scanf("%d",&n);
a[0]=1;
for(i=0;i<n;i++)
{
for(j=0;j<100;j++)
a[j]=a[j]*2;
for(j=0;j<100;j++)
{
if(a[j]>=10)
{
a[j+1]=a[j+1]+a[j]/10;
a[j]=a[j]%10;
}
}
}
for(i=99;... |
25 | 12278 |
int main()
{
int a[1000]={0};
a[0] = 2;
int k;
cin >> k;
if(k==0)
cout << "1";
if(k==1)
cout << "2";
if(k>=2)
{
int i,j;
for(i = 0; i < k -1 ;i++)
{
for(j =0;j<1000;j++)
{
a[j] = 2 * a[j];
}
for(j = 0;j<1000;j++)
{
if(a[j]>=10)
{
a[j+1] = a[j+1]+a[j]/10;
a[j] = a[j]%10;
}... |
25 | 12279 |
int result[100000] = {2};
int main()
{
int N;
cin >> N;
if (N == 0)
{
cout << 1 << endl;
}
else
{
for (int i = 0; i < N - 1; i++)
{
for (int j = 0; j < 100000; j++)
{
result[j] *= 2;
}
for (int k = 0; k < 100000; k++)
{
if (result[k] >= 10)
{
result[k+1] += result[k]/10... |
25 | 12280 | int a[10000],b[10000],c[10000],ans[10000];
void cheng(int a[10000])
{
int i,j,m;
memset(c,0,sizeof(c));
for (i=1;i<=a[0];i++)
{
c[i]=c[i]+a[i]*2;
c[i+1]=c[i+1]+c[i]/10;
c[i]=c[i]%10;
}
j=a[0]+10;
while (j>0&&c[j]==0) j--;
a[0]=j;
for (i=1;i<=j;i++) a[i]=c[i];... |
25 | 12281 |
int main()
{int b[2][100]={0};
b[0][0]=2;
int n,i,j,k;
cin>>n;
if(n==0)
cout<<"1"<<endl;
else if(n==1)
cout<<"2"<<endl;
else{
for(i=1;i<n;i++)
{k=90;
while(b[0][k]==0)k--;
for(j=0;j<=k+1;j++)
{if(j!=0)
{b[1][j]=b[0][j]*2+b[1][j-1]/10;
b[0][j]=b[1][j]%10;}
else {b[1][0]=b[0][0]*2;
b[0][0]=b[1][0]%10;
}}}
k=90;
while(... |
25 | 12282 | int main(){
int n,i,e,d,k=1;
int sz[100]={0},sum[100]={0};
sz[0]=2;
scanf("%d",&n);
int c=0;
for(i=0;i<n-1;i++){
for(d=0;d<100;d++){
sum[d]=sz[d]+sz[d]+c;
if(sum[d]>=10){
sum[d]-=10;
c=1;
}else{
c=0;
}
}
for(e=0;e<100;e++){
sz[e]=sum[e];
}
}
int f=99;
while(sz[f]==0){
f--;
}
if(n!=0){
for(i=f;i>=0;i-... |
25 | 12283 |
char s[100] = {0};
void cal()
{
int len = strlen(s);
int num[100] = {0};
for(int i = 0; i < len; i++)
{
num[i] = s[i] - '0';
}
for(int i = 0; i < len; i++)
{
num[i] *= 2;
}
for(int i = 0; i < len; i++)
{
if(num[i] > 9)
{
num[i + 1] +=num[i] / 10;
num[i] %= 10;
}
}
if(num[len] == 0)
{
f... |
25 | 12284 | //********************************
//* ??????2?N?? *
//* ?????? *
//* ???2010-12-16 *
//* ?????2?N?? *
//********************************
void product(int res[200], int N)
{
int i, j;
for(i = 1; i <= N; i++)
{
for(j = 0; j < 199; j++)
{
res[j] = res[j] * 2;
... |
25 | 12285 | int main()
{
int n,i,cnt=0,len1=1,len2=1;
cin >> n;
char a[100];
a[0]=49;
for(i=1; i<100; i++)
{
a[i]=48;
}
while(cnt<n)
{
for(i=len1-1; i>=0; i--)
{
if((a[i]-48)*2>=10)
{
a[i+1]+=1;
if(i==len1-1)
len2+=1;
}
a[i]=((a[i]-48)*2)%10+48;
}
len1=len2;
cnt++;
}
for(i=len1-1; i>=... |
25 | 12286 |
int main()
{
int N,i,j;
int a[100] = {0};
a[99] = 1;
cin >> N;
for ( i = 0 ; i < N; i ++)
{
for (j = 99; j >= 0; j --)
{
a[j] = a[j] * 2;
}
for ( j = 99; j >= 0; j --)
{
if (a[j] >= 10)
{
a[j-1] = a[j-1] + 1;
a[j] = a[j] % 10;
}
}
}
int b = 0;
for (i = 0; i < 100; i ++)
{
i... |
25 | 12287 | int main()
{
int n,i;
int a[1000];
memset(a,0,sizeof(a));
a[0]=1;
cin >> n;
for(i=0;i<n;i++)
{
int j;
for(j=0;j<1000;j++)
a[j]=a[j]*2;
for(j=0;j<1000;j++)
if(a[j]>9)
{
a[j]=a[j]%10;
a[j+1]++;
}
}
for(i=999;i>=0;i--)
if(a[i]!=0)
break;
int s;
for(s=i;s>=0;s--)
cout << a[... |
25 | 12288 | int main()
{
int n,a[100]={0};
cin >> n;
if(n==0)
cout<<1;
else
{
a[0]=2;
for(int i=1;i<n;i++)
{
for(int j=0;j<100;j++)
a[j] *= 2;
for(int j=0;j<100;j++)
if(a[j] >= 10)
{
a[j+1] +=1;
a[j] %= 10;
}
}
int k=99;
while(a[k] == 0)
k--;
while(k>=0)
cout<<a[k... |
25 | 12289 | int a[MAXN];
int n,i;
int main()
{
cin>>n;
a[0]=1;
while(n--)
{
for(i=0;i<MAXN;i++)
a[i]*=2;
for(i=0;i<MAXN-1;i++)
{
a[i+1]+=a[i]/10;
a[i]%=10;
}
}
for(i=MAXN-1;i>0&&a[i]==0;i--);//????? ?????????
for(;i>=0;i--)
... |
25 | 12290 | char number[100];
int main()
{
number[0]='0';
int n;
cin>>n;
void power(int);
if(n==0)
cout<<"1"<<endl;
else
{
power(n-1);
int i;
for(i=1;i<=strlen(number)-1;i++)
cout<<number[i];
}
return 0;
}
void power(int n)
{
if(n==0)
number[1]='1';
else
power(n-1);
int len=strlen(number);
int a[100];
a[l... |
25 | 12291 | int main()
{
int n,i,j,k=1;
int b[200]={1},c[200]={0};
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<=k;j++)
c[j]=0;
for(j=0;j<k;j++)
{
c[j]+=2*b[j];
c[j+1]+=c[j]/10;
c[j]=c[j]%10;
}
if(c[k])
k++;
for(j=0;j<k;j++)
b[j]=c[j];
}
for(i=k-1;i>=0;i--)
cout<<b[i];
cout<<endl;
return 0;
}
|
25 | 12292 | int main()
{
int a[100]={0};
int i,key=0,n,j,p;
scanf("%d",&n);
a[key]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<100;j++)
{
if(a[j]!=0)
a[j]=a[j]*2;
}
for(j=0;j<100;j++)
{
if(a[j]>=10)
{a[j]=a[j]%10;a[j+1]=a[j+1]+1;}
}
}
for(i=99;i>=0;i--)
if(a[i]!=0){p=i;break;}
for(i=p;i>=0;i--)
printf(... |
25 | 12293 | int main()
{
int N;
cin>>N;//??N
int a[100]={0};//??????????
a[99]=1;//?????????????1
for(int i=1;i<=N;i++)
for(int j=0;j<=99;j++)
{
a[j]=a[j]*2;//?????2
if(a[j]>=10)//????????10
{
a[j-1]=a[j-1]+1;//?????
a[j]=a[j]-10;//???10
}
}
int i=0;
while(a[i]==0)i++;//???????????????????
for(int... |
25 | 12294 | int main()
{
int n , i , j;
int start;
cin >> n;
int num[101] = {0}; //??num????????
num[100] = 1;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= 100; j++)//?????????2
{
num[j] = num[j] * 2;
}
for(j = 1; j <= 100; j++)//????10??????????-10
{
if(num[j] >= 10)
{
num[j] = num[j] - 10;
num[j -... |
25 | 12295 | void add(int []);
int main()
{
int n, a[100] = {0}, i, j;
a[0] = 1;
cin >> n;
for(i = 0; i < n; i++)
add(a);
i = 99;
while(a[i] == 0)
i--;
for(j = i; j >= 0; j--)
cout << a[j];
cout << endl;
return 0;
}
void add(int a[])
{
int i = 99, j;
while(a[i] != 0)
i--;
for(j = i; j >= 0; j--)
{
a[j] = 2... |
25 | 12296 | int main()
{
int n,sum = 1, i, j, temp = 0, l;
cin >> n;
char str[40];
for(i = 0; i < 40; i++)
{
str[i] = '0';
}
str[0] = '1';
for(i = 1; i <= n; i++)
{
temp = 0;
for(j = 0; j < 40; j++)
{
if(2 * (str[j] - '0') + temp >= 10)
{
str[j] = 2 * (str[j] - '0') - 10 + temp + '0';
temp = 1;
}
... |
25 | 12297 | /*
* ????main.cpp
* ??????
* ?????2013-01-11
* ????????????N(N<=100)???2?N?????
*/
void f ( int n )
{
int i,j,l,len,c[10000] = {0};
c[0] = 1;
len = 1;
for ( i = 0; i < n; i++ )
{
l = 0;
for ( j = 0; j < len; j++ )
{
c[j] = c[j] * 2 + l;
l = 0;
if ( c[j] > 9 )
{
l = (c[j] - c[j] % 10) ... |
25 | 12298 | int main()
{
int n, a[32] = {1}, compute[32] = {0}, k;
cin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 32; j++)
compute[j] += a[j] * 2;
for(int j = 0; j < 32; j++)
{
compute[j + 1] += compute[j] / 10;
compute[j] %= 10;
}
for(int j = 0; j < 32; j++)
a[j] = compute[j];
memset(comput... |
25 | 12299 |
char a[10002];
int b[10001] = {0};
int main()
{
int N, i, j, k, t;
cin >> N;
if (N == 0)
{
cout << 1;
return 0;
}
for (i = 0; i < 10000; i++)
a[i] = '0';
a[i] = '2';
for (i = 1; i < N; i++)
{
k = 10000;
for (t = 0; t < 10001; t++)
b[t] = 0;
for (j = 0; j < 10001; j++)
if (a[j] != '0')
b... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.