Pagini recente » Cod sursa (job #680136) | Cod sursa (job #308456) | Cod sursa (job #1841007) | Cod sursa (job #2251484) | Cod sursa (job #3276838)
#include <fstream>
#include <string>
#include <cmath>
using namespace std;
ifstream fin("cifra.in");
ofstream fout("cifra.out");
int getLastDigitOfPower(int base, int exponent) {
if (exponent == 0) return 1; // orice număr la puterea 0 este 1
int result = 1;
for (int i = 0; i < exponent; i++) {
result = (result * base) % 10;
}
return result;
}
int main() {
int T;
fin >> T;
while (T--) {
string N;
fin >> N;
int sumLastDigit = 0;
for (int i = 1; i <= 9; i++) {
int exponent = (N.length() == 1) ? (N[0] - '0') : (((N[N.length()-2] - '0') * 10 + (N[N.length()-1] - '0')) % 4) + 1;
sumLastDigit = (sumLastDigit + getLastDigitOfPower(i, exponent)) % 10;
}
fout << sumLastDigit << "\n";
}
return 0;
}