Pagini recente » Istoria paginii runda/sfantul_catruna/clasament | Metoda Greedy si problema fractionara a rucsacului | Monitorul de evaluare | Istoria paginii utilizator/lianalungana | Cod sursa (job #178825)
Cod sursa(job #178825)
#include<fstream.h>
#include<iostream.h>
#include<math.h>
#include<stdio.h>
#include<string.h>
int main(void)
{
long int t,r,i,j,x[105],m,coun,h,n;
fstream f,g;
char y[105];
char *ptr;
x[0]=0;
for(i=1;i<=99;i++)
{
r=pow((i%10),(i%4)+4);
r=r%10;
x[i]=(x[i-1]+r)%10;
}
f.open("cifra.in",ios::in);
g.open("cifra.out",ios::out);
f>>t;
for(i=1;i<=t;i++)
{
f>>y;
ptr=strchr(y,0);
coun=ptr-y-1;
r=y[coun]-48;
if(coun>1)
r=r+10*(y[coun-1]-48);
g<<x[r]<<"\n";
}
f.close();
g.close();
return 0;
}