Cod sursa(job #2331013)
Utilizator | Data | 29 ianuarie 2019 08:50:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include<cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int viri[1001]={0},cnt=0,n;
fin>>n;
for(int i=2;i<=n;i++)
{
if(viri[i]==0)
{
cnt++;
for(int j=i*i;j<=n;j+=i)
{
viri[j]=1;
}
}
}
fout<<cnt;
return 0;
}