Pagini recente » Cod sursa (job #1103343) | Cod sursa (job #189907) | Cod sursa (job #2599717) | Cod sursa (job #1385546) | Cod sursa (job #1118872)
#include <iostream>
#include<stdio.h>
using namespace std;
#define MAXI 10000
int a1,b1,c1,n;
int s;
int a10;
int a[MAXI],b[MAXI],c[MAXI];
void putere(int x)
{
while(x!=0)
{
a[++a[0]]=x%10;
x/=10;
}
b[0]=1;
b[1]=1;
for(int i=1;i<=10;i++)
{
s=0;
for(int j=1;j<=a[0];i++)
{
for(int u=1;u<=b[0]+2;u++)
{
c[j+u-1]+=a[j]*b[u]+s;
s=c[u+j-1]/10;
c[u+j-1]%=10;
}
}
s=a[0]+b[0]+2;
while(c[s]==0&&s>0)
s--;
for(int k=0;k<=s;k++)
{
b[k]=c[k];
c[k]=0;
}
}
}
int main()
{
freopen("radixsort.in","r",stdin);
freopen("radixsort.out","w",stdout);
scanf("%d %d %d &d",&n,&a1,&b1,&c1);
putere(a1);
for(int i=1;i<=b[0];i++)
printf("%d",b[i]);
return 0;
}