Pagini recente » Diferente pentru tree-decompositions intre reviziile 78 si 79 | Cod sursa (job #2346015) | Borderou de evaluare (job #1295990) | Cod sursa (job #1453929) | Cod sursa (job #778611)
Cod sursa(job #778611)
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int n, sol[1000004];
long long sum;
int main()
{ int s=0,i,j;
in>>n;
for(i=2;i<=n;i++)
{sol[i]=i-1;}
for (i=2;i<=n;i++)
{sum+=sol[i];
for(j=2*i;j<=n;j+=i)
{sol[j]=sol[j]-sol[i];}
}
out<<sum*2+1;
in.close();
out.close();
return 0;
}