Pagini recente » Cod sursa (job #805701) | 363776673968486 | Cod sursa (job #2805272) | Cod sursa (job #59194) | Cod sursa (job #2642402)
#include <fstream>
#include <algorithm>
using namespace std;
int putere(int a, int b);
int p[101];
void precalcul();
int rezolva();
string sir;
int main()
{
ifstream f("cifra.in");
ofstream g("cifra.out");
int T; f >> T;
precalcul();
while (T--)
{
f >> sir;
g << rezolva() % 10 << '\n';
}
f.close(); g.close();
}
int putere(int a, int b)
{
if (b == 0)
return 1;
int ret = putere(a, b / 2);
ret = (ret * ret) % 10;
if (b & 1)
ret = (ret * a) % 10;
return ret % 10;
}
void precalcul()
{
for (int i = 1; i < 101; i++)
p[i] = p[i - 1] + putere(i, i);
}
int rezolva() {
int k = sir.size(), x = 0;
for (int i = max(0, k - 2); i < k; i++)
x = x * 10 + sir[i] - '0';
return p[x] % 10;
}