Pagini recente » Cod sursa (job #402083) | Cod sursa (job #539045) | Solutii Summer Challenge, Runda 2 | Cod sursa (job #2011819) | Cod sursa (job #1131056)
#include <fstream>
#include <vector>
using namespace std;
int n;
ifstream f("cifra.in");
ofstream g("cifra.out");
vector<int> a;
long long s=0;
void rezolva_recursiv(int i, int n){
if (i<n)
{
long long cub=a[i];
for (int j=2; j<=a[i];j++)
cub *= a[i];
s += cub;
g << s%10 <<endl;
rezolva_recursiv(++i, n);
}
}
int main(){
f>>n;
a = vector<int> (n);
for (int i=0; i<n; i++)
f>>a[i];
rezolva_recursiv(0,n);
f.close();
g.close();
return 0;
}