Pagini recente » Cod sursa (job #862224) | Cod sursa (job #1681868) | Cod sursa (job #582667) | Cod sursa (job #993624) | Cod sursa (job #1060738)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
long long v[1000],a[1000],n,i,p,u,uc,max;
ifstream f("cifra.in");
ofstream g("cifra.out");
f>>n;
max=0;
for(i=1;i<=n;i++)
f>>a[i];
f.close();
for (i=1;i<=n;i++)
if (a[i]>max)
max=a[i];
v[1]=1;
for (i=2;i<=max;i++)
{
if (i%4==0)
p=4;
else
p=i%4;
u=i%10;
uc=(v[i-1]+(int)pow(u,p)%10)%10;
v[i]=uc;
}
for(i=1;i<=n;i++)
g<<v[a[i]]<<endl;
g.close();
return 0;
}