Cod sursa(job #2298881)
Utilizator | Data | 8 decembrie 2018 16:26:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int v[20000004];
int i,n,cnt=0,j;
int main()
{
in>>n;
for(i=2;i<=n;i++)
{
v[i]=1;
}
for(i=2;i<=n;i++)
{
if(v[i]==1)
{
cnt++;
for(j=2;i*j<=n;j++)
{
v[j*i]=0;
}
}
}
out<<cnt;
}