Cod sursa(job #2432536)
Utilizator | Data | 24 iunie 2019 11:40:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,x,v[1010],c;
int main()
{
for(i=2;i<=1000;i++)
{x=0;
for(j=1;j<=i;j++)
{if(i%j==0) x++;
if(x>2) v[i]=1;
}
}
f>>n;
c=0;
for(i=n;i>=2;i--)
{if(v[i]==0) c++;
}
g<<c;
return 0;
}