Cod sursa(job #2781306)
| Utilizator | Data | 9 octombrie 2021 00:09:56 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
ifstream fin( "sum.in" );
ofstream fout( "sum.out" );
int phi[MAXN+1];
void euler() {
int i, j;
for( i = 1; i <= MAXN; i++ )
phi[i] = i - 1;
for( i = 2; i <= MAXN; i++ ) {
for( j = 2 * i; j <= MAXN; j += i )
phi[j] -= phi[i];
}
}
int main() {
int n, t;
euler();
fin >> t;
while( t-- ) {
fin >> n;
fout << (long long) 2 * n * phi[n] << '\n';
}
return 0;
}
