Pagini recente » Istoria paginii runda/summah | Diferente pentru schimbare-borland/argumentatie intre reviziile 27 si 13 | Istoria paginii fmi-no-stress-2012/solutii/potrivire | Cod sursa (job #2706633) | Cod sursa (job #2073068)
#include <iostream>
#include <fstream>
#include <string.h>
#include <cstdlib>
using namespace std;
int main()
{
ifstream in("cifra.in");
ofstream out("cifra.out");
int a[100],T,l,n1;
char n[102];
for(int i=0; i<100; i++)
{
a[i]=i;
for(int j=2; j<=i; j++)
{a[i]=(a[i]*i)%10;}
a[i]=(a[i]+a[i-1])%10;
}
in>>T;
for(int i=1; i<=T; i++)
{
in>>n;
l=strlen(n);
if(l>1)
{
char n2[3];
n2[0]=n[l-2];
n2[1]=n[l-1];
n1=atoi(n2);
}
else {n1=n[l-1]-'0';}
out<<a[n1%100]<<"\n";
}
in.close();
out.close();
return 0;
}