Cod sursa(job #3328856)
| Utilizator | Data | 10 decembrie 2025 19:15:37 | |
|---|---|---|---|
| Problema | Sum | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
const int NMAX=200000;
long long v[NMAX+1];
void ciur(int n)
{
int i,j;
for(i=1; i<=n; i++)
v[i]=i;
for(i=2; i<=n; i++)
if(v[i]==i)
{
for(j=i; j<=n; j+=i)
v[j]-=v[j]/i;
}
}
int main()
{
long long n,x;
ciur(NMAX);
f>>n;
while(n--)
{
f>>x;
g<<v[x]*2*x<<'\n';
}
f.close();
g.close();
return 0;
}