Cod sursa(job #2131583)
Utilizator | Data | 14 februarie 2018 19:41:46 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long n;
bool ciur[1000001];
int main()
{
f>>n;
long nrfr=n;
for(int i=2;i<=n;i++)
{
for(int j=2;j<=n;j++) ciur[j]=0;
for(int j=1;j*i<=n;j++) ciur[i*j]=1;
for(int j=1;j<=n;j++) {if(ciur[j]==0) nrfr++;}
}
g<<nrfr-1;
return 0;
}