Pagini recente » Cod sursa (job #1002816) | Solutii preONI 2007, Runda 3 | Cod sursa (job #2570321) | Cod sursa (job #796838) | Cod sursa (job #257551)
Cod sursa(job #257551)
#include<stdio.h>
int i,j,k,n,v[10000];
void multi(int x){
k=0;
for(j=1;j<=v[0]||k;j++,k/=10)
v[j]=(k+=v[j]*x)%10;
v[0]=j-1;
}
int main(){
FILE *f=fopen("patrate2.in","r");
fscanf(f,"%d",&n);
fclose(f);
v[0]=v[1]=1;
FILE *g=fopen("patrate2.out","w");
if(n==1)
{fprintf(g,"%d",1);return 0;
fclose(g);}
for(i=1;i<=n*n/10;i++)
multi(1024);
for(i=1;i<=(n*n)%10;i++)
multi(2);
for(i=1;i<=n/2;i+=2)
multi(i*(i+1));
if(n%2==1)
multi(n);
for(i=v[0];i>=1;i--)
fprintf(g,"%d",v[i]);
fclose(g);
}