Cod sursa(job #2049533)
Utilizator | Data | 27 octombrie 2017 12:37:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,i,j,ct;
bool v[2000001];
int main()
{
in>>n;
for(i=2; i<=n; i++)
if(v[i]==0)
for(j=i+i; j<=n; j+=i)
v[j]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
ct++;
out<<ct;
return 0;
}