Pagini recente » Cod sursa (job #1197279) | Cod sursa (job #2328378) | Cod sursa (job #220264) | Cod sursa (job #1669662) | Cod sursa (job #1418606)
#include<fstream>
#include<iostream>
#include<string.h>
using namespace std;
char v[1001];
int q[101],t;
long long pow(long long x,long long y)
{
long long pr=1;
while(y!=1)
{
if(y%2==0)
x=(x*x)%10,y=y/2;
else
pr=(pr*x)%10,y--;
}
return (x*pr)%10;
}
int main()
{
ifstream in("cifra.in");
ofstream out("cifra.out");
for(long long i=1;i<=100;i++)
{
q[i]=(q[i-1]+pow(i,i)%10)%10;
}
in>>t;
for(int i=1;i<=t;i++)
{
in>>v;
int l=strlen(v);
int u_c;
if(l>9)
u_c=(v[l-2]-'0')*10 +(v[l-1]-'0');
else
u_c=v[l-1]-'0';
out<<q[u_c%100]<<'\n';
}
return 0;
}