Cod sursa(job #3259638)
| Utilizator | Data | 27 noiembrie 2024 09:48:03 | |
|---|---|---|---|
| Problema | Sum | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
const int N=1e5;
int ciur[N+1];
void euler()
{
for(int i=2;i<=N;i++)
{
ciur[i] = i;
}
for(int i=2;i<=N; i++)
{
if(ciur[i]==i)
{
for(int div=i;div<=N;div+= i)
{
ciur[div]=ciur[div]/i*(i - 1);
}
}
}
}
int main()
{
int n;
euler();
fin>>n;
for(int i=1;i<=n;i++)
{
int nr;
fin>>nr;
fout<<((long long)(2*nr*ciur[nr]))<<endl;
}
return 0;
}
