Pagini recente » Cod sursa (job #2041660) | Cod sursa (job #2134803) | Cod sursa (job #547599) | Cod sursa (job #1972974) | Cod sursa (job #1800901)
#include<fstream>
using namespace std;
int megold(int n)
{
int a = n % 10;
while (n % 2 == 0)
{
a = ((a % 10) * (a % 10)) % 10;
n = n / 2;
}
for (int i = 1; i < n; i++)
{
a = ((a % 10) * (n % 10)) % 10;
}
return a;
}
int main()
{
ifstream in("cifra.in");
ofstream out("cifra.out");
int n; in >> n;
int usz[100] = { 0 };
for (int i = 0; i < n; i++)
{
int m; in >> m;
int ossz = 0;
for(int j=1; j <= m;j++)
{
ossz += megold(j);
}
if (ossz >= 10) { out << ossz % 10 << endl; usz[m] = ossz%10; }
else {
out << ossz << endl; usz[m] = ossz;
}
}
return 0;
}