Cod sursa(job #1221074)
Utilizator | Data | 19 august 2014 13:21:02 | |
---|---|---|---|
Problema | Fractii | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int main()
{
int i, j, N;
long long count = 0;
ifstream in("fractii.in");
ofstream out("fractii.out");
in>>N;
in.close();
long long V[N+1];
for(i=1;i<=N;i++) V[i] = i-1;
for(i=2;i<=N;i++)
{
for(j=i+i;j<=N;j+=i)
V[j]-=V[i];
count+=V[i];
}
count= count*2+1;
out<<count<<"\n";
out.close();
return 0;
}