Pagini recente » Cod sursa (job #249078) | Cod sursa (job #3158975) | Istoria paginii preoni-2008/clasament | Cod sursa (job #3148558) | Cod sursa (job #2055356)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("cifra.in");
ofstream g("cifra.out");
int a[11][11];
void matrice()
{
a[1][0]=1;
a[1][1]=1;
a[1][2]=1;
a[1][3]=1;
a[2][1]=2;
a[2][2]=4;
a[2][3]=8;
a[2][0]=6;
a[3][1]=3;
a[3][2]=9;
a[3][3]=7;
a[3][0]=1;
a[4][1]=a[4][3]=4;
a[4][0]=a[4][2]=6;
a[5][0]=a[5][1]=a[5][2]=a[5][3]=5;
a[6][0]=a[6][1]=a[6][2]=a[6][3]=6;
a[7][1]=7;
a[7][2]=9;
a[7][3]=3;
a[7][0]=1;
a[8][1]=8;
a[8][2]=4;
a[8][3]=2;
a[8][0]=6;
a[9][1]=a[9][3]=9;
a[9][0]=a[9][2]=1;
}
void Make_the_sum(int nr,int &s)
{
int i;
for(i=1;i<=nr;i++)
{
s=s+a[i%10][i%4];
s%=10;
}
g<<s<<endl;
}
void Read()
{
int t,i,number,s;
char a[101];
f>>t;
for(i=1;i<=t;i++)
{
s=0;
f.get();
f.get(a,101,'\n');
if( ( (a[strlen(a)-2]-'0')>=0 ) && ( (a[strlen(a)-2]-'0')<=9 ) )
number = (a[strlen(a)-2]-'0')*10 + (a[strlen(a)-1]-'0');
else
number = (a[strlen(a)-1]-'0');
Make_the_sum(number,s);
}
}
int main()
{
matrice();
Read();
}