Pagini recente » Cod sursa (job #1060070) | Cod sursa (job #836050) | Cod sursa (job #1525768) | Cod sursa (job #835317) | Cod sursa (job #235849)
Cod sursa(job #235849)
#include <iostream>
#include <fstream>
using namespace std;
long long power(long long n, long long m);
long long last(long long n);
int main () {
long long t,n,i,k,r,suma=0,j,m=0;
ifstream I("cifra.in");
ofstream O("cifra.out");
long long cifre[20];
for (i=0;i<=19;i++){
cifre[i]=last(power(i+1,last(i+1)));
suma=suma+cifre[i];
}
I>>t;
for (i=0;i<=t;i++){
I>>n;
r=n%20;
k=(n-r)/20;
for (j=0;j<=r-1;j++) {
m=m+cifre[j];
}
O<<last(k*suma+m)<<"\n";
m=0;
}
}
long long power(long long n,long long m) {
long long i, r=1;
for(i=1;i<=n;i++)
r=r*m;
return r;
}
long long last(long long n) {
return n%10;
}