Cod sursa(job #1864119)
Utilizator | Data | 31 ianuarie 2017 15:25:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int v[400010],n,i,j,nr=0;;
f>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i]==1)
{
nr++;
for(j=2;j*i<=n;j++)
v[i*j]=0;
}
g<<nr;
return 0;
}