Pagini recente » Cod sursa (job #2405818) | Cod sursa (job #1754972) | Cod sursa (job #1271659) | Cod sursa (job #1875351) | Cod sursa (job #1196831)
/*
cifra infoarena
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second
#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))
#define IN_FILE "cifra.in"
#define OUT_FILE "cifra.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);
//variables
int t;
vector<short int> x;
string a;
//other functions
void reading()
{
f >> t;
x.RS(100);
FOR(i, 1, 99)
{
int u = i;
FOR(j, 2, i)
{
u = u*i % 10;
}
x[i] = (u+x[i-1])%10;
}
FORN(i, t)
{
f >> a;
int co = 0;
int n = a.length();
if (n > 1)
{
co = (a[n - 2] - '0') * 10 + a[n - 1]-'0';
}
else
{
co = a[n - 1] - '0';
}
g << x[co] << "\n";
}
f.close();
}
void solving()
{
}
void write_data()
{
}
int main()
{
reading();
solving();
write_data();
}