Pagini recente » Cod sursa (job #1567602) | Cod sursa (job #853835) | Cod sursa (job #384793) | Cod sursa (job #1719143) | Cod sursa (job #1490495)
#include <iostream>
#include <limits.h>
#include <cmath>
#include <string>
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <map>
#include <fstream>
#include <list>
#include <queue>
#include <cstring>
#include <iomanip>
#include <deque>
#include <set>
using namespace std;
ifstream f("cifra.in");
ofstream g("cifra.out");
int sp1[] = {0,1,5,2,8,3,9,2,8,7};
int sp2[] = {0,1,7,0,6,1,7,4,8,7};
int main()
{
int t;
char x[105];
f>>t;
f.get();
for(int i = 1; i<=t; i++)
{
f.getline(x,105);
int l = strlen(x);
if (l == 1)
{
g<<sp1[x[0]-'0']<<"\n";
}
else
{
int unitati = x[l-1] - '0';
int zeci = x[l-2] - '0';
if (zeci % 2 == 0)
g<<((zeci * 47) + sp1[unitati])%10<<"\n";
else
g<<((zeci * 47) + sp2[unitati])%10<<"\n";
}
}
return 0;
}