Pagini recente » Cod sursa (job #1795555) | Cod sursa (job #2246321) | Cod sursa (job #936569) | Cod sursa (job #1877644) | Cod sursa (job #248083)
Cod sursa(job #248083)
#include <stdio.h>
#include <math.h>
int v[11]={1,5,2,8,3,9,2,8,7,7};
int main()
{
int t,i,cif,uc,n,j;
FILE *f,*g;
f=fopen("cifra.in","r");
g=fopen("cifra.out","w");
fscanf(f,"%d",&t);
for(i=0;i<t;i++)
{
fscanf(f,"%ld",&n);
if(n<=10)
fprintf(g,"%d\n",v[n-1]);
else
{
cif=7; //ultima cifra 1^1 + 2^2 + ... + 10^10 = 7
for(j=11;j<=n;j++)
{
uc=j%10;
if(uc==0 || uc==1 || uc==5 || uc==6)
cif+=uc;
else
{
uc=j%4;
if(!uc)
uc=4;
cif+=(int)pow(j%10,uc)%10;
}
}
fprintf(g,"%d\n",cif%10);
}
}
fclose(f);
fclose(g);
return 0;
}