Pagini recente » Cod sursa (job #2602734) | Borderou de evaluare (job #989898) | Cod sursa (job #3207822) | Cod sursa (job #3235701) | Cod sursa (job #2165299)
#include <bits/stdc++.h>
#define nmax 1000001
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int a[nmax],n;
void Read()
{
f>> n;
for (int i =2; i<=n; ++i)
a[i]=i-1;
for (int i=2; i<=n; ++i)
for (int j=2*i; j<=n; j+=i)
a[j]-=a[i];
long long sum=0;
for(int i=2; i<=n; ++i)
sum+=a[i];
g<<2*sum+1;
}
int main()
{
Read();
}