Pagini recente » Cod sursa (job #2325231) | Cod sursa (job #856014) | Cod sursa (job #1012435) | Cod sursa (job #2714291) | Cod sursa (job #96756)
Cod sursa(job #96756)
#include<stdio.h>
#include<math.h>
int t,s[1000];
long n,i,j,a[1000],max=0;
int main()
{
freopen("cifra.in","r",stdin);
freopen("cifra.out","w",stdout);
scanf("%i",&t);
max=0;
for(i=1;i<=t;i++){
scanf("%ld",&a[i]);
if(a[i]>max) max=a[i];
}
if(max<10){
s[1]=1;
for(i=2;i<=max;i++) {
//int y;
//y=(int)pow(i,i);
//y=y%10;
s[i]=(s[i-1]+(int)pow(i,i))%10;
}
// printf("%i\n",s[i]);
for(i=1;i<=t;i++)
printf("%i\n",s[a[i]]);
}
return 0;
}