Cod sursa(job #1884053)
Utilizator | Data | 18 februarie 2017 13:52:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int prim[2000005],ct,n;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(int i=2;i<=n;i++)
if(!prim[i])
{
++ct;
for(int j=2*i;j<=n;j+=i)
prim[j]=1;
}
g<<ct;
return 0;
}