Pagini recente » Istoria paginii runda/teme_acmunibuc_2014_2 | Cod sursa (job #2299178) | Cod sursa (job #791104) | Cod sursa (job #1264007) | Cod sursa (job #995317)
Cod sursa(job #995317)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("cifra.in");
ofstream g("cifra.out");
int main()
{
int i,j,n,aux=0;
char a[1000000];
f>>n;
for(i=0;i<=n;i++)
f >> a[i];
for(i=0;i<=n;i++)
a[i]-'0';
for(i=1;i<=n;i++)
{
aux=0;
for(j=1;j<=i;j++)
aux+=pow(j,j);
g << aux%10;
g <<endl;
}
}