Cod sursa(job #3186355)
Utilizator | BelaconiAndrei BelaconiAndrei | Data | 22 decembrie 2023 19:31:30 |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int N=1000001;
int e[N];
ifstream fin ("sum.in");
ofstream fout ("sum.out");
int main()
{
int n;
fin>>n;
for (int i=2 ; i<=N ; i++)
{
e[i]=i;
}
e[1]=1;
for (int i=2 ; i<=N ; i++)
{
if (e[i]==i)
{
for (int mult=i; mult<=N ; mult+=i)
{
e[mult]=(float)e[mult]/i*(i-1);
}
}
}
for (int i=1 ; i<=n ; i++)
{
int x;
fin>>x;
fout<<2LL*x*e[x]<<'\n';
}
return 0;
}