Pagini recente » Cod sursa (job #2117199) | Cod sursa (job #2600054) | Cod sursa (job #429794) | Cod sursa (job #385332) | Cod sursa (job #1452101)
#include <cstdio>
#include <cstring>
long long cit() {
long long ans = 0;
char c = getchar();
bool neg = false;
while (c < '0' || c > '9') {
if (c == '-') {
c = getchar();
neg = true;
break;
}
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = (ans << 3) + (ans << 1) + (c - '0');
c = getchar();
}
return (neg) ? -ans : ans;
}
void afis(long long n) {
int l = 0;
char c[20];
if (n == 0) {
putchar('0');
}
if (n < 0) {
putchar('-');
n = -n;
}
while (n > 0) {
c[l++] = n % 10 + '0';
n /= 10;
}
for (int i = l - 1; i >= 0; i--) {
putchar(c[i]);
}
putchar('\n');
}
int f(int n) {
int b = n, e = n, m = 10;
int ans = 1;
b = b % m;
while (e > 0) {
if (e % 2 == 1) {
ans = (ans * b) % m;
}
b = (b * b) % m;
e >>= 1;
}
return ans;
}
int main() {
freopen("fact.in", "r", stdin);
freopen("fact.out", "w", stdout);
int ans[100];
ans[0] = 0;
for (int i = 1; i < 100; i++) {
ans[i] = (ans[i - 1] + f(i)) % 10;
}
int t = cit();
for (int i = 0; i < t; i++) {
char sir[100];
gets(sir);
int l = strlen(sir);
if (l > 1) {
afis(ans[10 * (sir[l - 2] - '0') + sir[l - 1] -'0']);
} else {
afis(ans[sir[l - 1] - '0']);
}
}
return 0;
}