Cod sursa(job #2198589)
Utilizator | Data | 24 aprilie 2018 19:11:01 | |
---|---|---|---|
Problema | Fractii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#define MAX 1000010
using namespace std;
typedef long long ll;
ll n,ans;
ll a[MAX];
int main()
{
ifstream f ("fractii.in");
ofstream g ("fractii.out");
f>>n;
for(ll i=1;i<=n;i++)a[i]=i;
for(ll i=1;i<=n;i++){
ans+=a[i];
for(ll j=2;i*j<=n;j++) a[i*j]-=a[i];
}
g<<ans*2-1;
f.close ();
g.close ();
return 0;
}