Cod sursa(job #3260224)
| Utilizator | Data | 1 decembrie 2024 08:15:20 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("egale.in");
ofstream fout("egale.out");
const int VMAX=1000001,MOD=666013;
long long C[VMAX],N;
void CIUR(long long &nr)
{
for(int d=3;d<=N/2;d+=2)
if(C[d]==0)
{
long long cnt=1;
for(int m=d*2;m<=N;m+=d)
{
C[m]=1;
cnt++;
}
nr=nr-cnt*(cnt-1);
}
}
int main()
{
fin>>N;
long long nr=N*N-(N-1)-(N/2)*(N/2-1);
CIUR(nr);
fout<<nr;
return 0;
}
