Pagini recente » Cod sursa (job #1769617) | Cod sursa (job #2453088) | Borderou de evaluare (job #1181122) | Cod sursa (job #1178987) | Cod sursa (job #2346556)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int array[1000005];
int main()
{
int n;
f>>n;
for (int i=1;i<=n;++i)
array[i]=i-1;
for (int i=2; i<=n; ++i)
for (int j=2*i; j<=n; j+=i)
array[j]-=array[i];
long sum =0;
for (int i=1; i<=n;i++)
sum+=array[i];
g<<(2*sum+1);
return 0;
}