Pagini recente » Istoria paginii utilizator/triponosul | Cod sursa (job #1124448) | Istoria paginii utilizator/nistaman | Istoria paginii utilizator/rarespodaru | Cod sursa (job #1730379)
#include <iostream>
int T;
int V[10][4];
int S[100];
char N[101];
int SOL[30000];
int main(int argc, const char * argv[]) {
int i, j, k;
for (i = 1; i < 10; i++) {
for (j = 1, k = i; j <= 4; j++, k *= i)
V[i][j%4] = k % 10;
}
for (i = 1; i <= 100; i++)
S[i%100] = (S[i-1] + V[i%10][i%4]) % 10;
freopen("cifra.in", "r", stdin);
freopen("cifra.out", "w", stdout);
scanf("%d\n", &T);
for (i = 0; i < T; i++) {
int digits[2] = {0, 0};
int ch;
while ((ch = getc(stdin))) {
if ('0' <= ch && ch <= '9')
digits[0] = digits[1], digits[1] = ch - '0';
else
break;
}
k = digits[0] * 10 + digits[1];
printf("%d\n", S[k]);
SOL[i] = S[k];
}
return 0;
}