Pagini recente » Cod sursa (job #1426326) | Cod sursa (job #1519978) | Cod sursa (job #2824346) | Cod sursa (job #734345) | Cod sursa (job #1104453)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
short T;
ifstream be;
be.open ("cifra.in");
if (be.bad() == false)
{
be >> T;
}
else return 0;
long long N[T];
for (int i = 0; i < T; i++)
{
be >> N[i];
}
be.close();
ofstream ki;
ki.open ("cifra.out");
if (ki.bad() == false)
{
for (int o = 0; o < T; o++)
{
int t = 0;
for (int p = 1; p <= N[o]; p++)
{
int a = 1;
for (int r = 1; r <= p; r++)
{
a = (a * p) % 10;
}
t = (t + a) % 10;
}
ki << t << endl;
}
}
ki.close();
return 0;
}