Pagini recente » Cod sursa (job #1401225) | Cod sursa (job #1765014) | Cod sursa (job #656916) | Cod sursa (job #2584376) | Cod sursa (job #1303174)
#include <fstream>
#include <cstring>
using namespace std;
int a[101];
int i, t, ultima, penultima;
char s[250];
int power(int x)
{
long long p = 1, k = x;
while (x != 0)
{
if (x % 2 == 1)
p = p * k % 100;
k = k * k % 100;
x = x / 2;
}
return p;
}
int main()
{
ifstream f("cifra.in");
ofstream g("cifra.out");
for (i = 1; i <= 100; i++)
{
a[i] = (a[i - 1] + power(i)) % 100;
a[i] = a[i] % 10;
}
f >> t;
for (i = 1; i <= t; i++)
{
f >> s;
if (strlen(s) > 1)
{
penultima = s[strlen(s) - 2] - '0';
penultima = penultima * 10;
ultima = s[strlen(s) - 1] - '0';
g << a[(ultima + penultima) % 100 ] << endl;
}
else
{
ultima = s[strlen(s) - 1] - '0';
g << a[ultima % 100] << endl;
}
}
return 0;
}