Pagini recente » Cod sursa (job #2033247) | Cod sursa (job #3148263) | Cod sursa (job #1799681) | Cod sursa (job #3290403) | Cod sursa (job #1775941)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
#define nmax 1000100
long long ind[nmax];
long long i,j,n,ans;
int main()
{
fin>>n;
for(i=1; i<=n; ++i)
ind[i]=i;
for(i=2; i<=n; ++i)
{
if(ind[i]==i)
for(j=i; j<=n; j+=i)
ind[j]=ind[j]/i*(i-1);
ans+=ind[i];
}
ans*=2;
++ans;
fout<<ans;
}