Pagini recente » Istoria paginii runda/prolotomiada1/clasament | Cod sursa (job #1935821) | Cod sursa (job #434938) | Cod sursa (job #424661) | Cod sursa (job #1695368)
#include <fstream>
#include <cmath>
using namespace std;
int main ()
{
long N,i,T[300],S=0,x,cif[300],max=0;
ifstream f("cifra.in");
ofstream g("cifra.out");
f>>N;
for(i=1;i<=N;i++)
{ f>>cif[i];
if(cif[i]>max) max=cif[i];}
for(i=1;i<=max;i++)
{
int P=1;
for( int j=1; j<=i; j++) P=(P*i)%10;
S=(S+P)%10;
x=S;
x=x%10;
T[i]=x;
}
for(i=1;i<=N;i++) g<<T[cif[i]]<<endl;
return 0;
}