Cod sursa(job #3217698)
Utilizator | Data | 24 martie 2024 13:24:30 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
#define MAXN 1000000
long long sp[MAXN+1];
int main() {
int n;
cin>>n;
int i, j;
for(i=2; i<=n; i++) sp[i]=i-1;
long long ans;
ans=0;
for(i=2; i<=n; i++) {
ans+=sp[i];
for(j=i+i; j<=n; j+=i) sp[j]-=sp[i];
}
cout<<2*ans+1;
}