Cod sursa(job #2782714)
| Utilizator | Data | 12 octombrie 2021 20:46:07 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
bitset<1000001>e;
int main()
{
int x, n, i, j, k, nr;
cin>>x;
for (k=1; k<=x; k++)
{
cin>>n;
nr=0;
for (i=2; i<=n; i++)
e[i]=i;
for (i=2; i<=n; i++)
if(e[i]==1)
for(j=i; j<=n; j+=i)
e[j]=e[j]/i*(i-1);
for (i=2; i<=n; i++)
nr=nr+e[i]*2;
cout<<nr-1<<'\n';
}
return 0;
}
