Pagini recente » Cod sursa (job #767959) | Borderou de evaluare (job #1360457) | Diferente pentru problema/drum intre reviziile 2 si 1 | Cod sursa (job #848895) | Cod sursa (job #732136)
Cod sursa(job #732136)
#include<iostream>
#include<fstream.h>
#include<math.h>
int szam(int k){
if(k==1)return 1;
else return pow(k,k)+szam(k-1);
}
int main(){
long t,n,i,s;
ifstream f("cifra.in");
ofstream g("cifra.out");
f>>n;
for(i=1;i<=n;i++){
f>>t;
s= szam(t);
g<<s%10<<"\n";
}
f.close();
g.close();
return 0;
}