Pagini recente » Cod sursa (job #2688527) | Cod sursa (job #829558) | Cod sursa (job #2112016) | Cod sursa (job #1652106) | Cod sursa (job #2958310)
#include <vector>
#include <iostream>
#include <cmath>
#include <fstream>
#include <cstring>
typedef long long int ll;
using namespace std;
int dp[101] = {0};
int mat[11][4];
ifstream f("cifra.in");
ofstream g("cifra.out");
int main(){
for(int i = 0; i <= 9; i ++){
mat[i][1] = i % 10;
mat[i][2] = (i*i) % 10;
mat[i][3] = (i*i*i) % 10;
mat[i][0] = (i*i*i*i) % 10;
}
int j = 1;
for(int i = 1 ; i <= 100; i ++){
dp[i] = (dp[i-1] + mat[i%10][j]) % 10;
if(j==3) j = 0;
else j+=1;
}
ll n;
char nin[100];
ll t;
f >> t;
for(int i = 1 ; i <= t ; i ++){
f >> nin;
if(nin[1] == '\0'){
n = nin[0] - '0';
}else{
n = (nin[strlen(nin)-2] - '0') * 10 + (nin[strlen(nin)-1] - '0');
}
g << dp[n] << endl;
}
return 0;
}