Cod sursa(job #1937373)
Utilizator | Data | 23 martie 2017 21:59:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int c[2000001],v[2000000];
int i,j,k,n;
int main()
{
f >> n;
for(i=2; i<=n; i++)
if(c[i]==0)
for(j=i*2; j<=n; j+=i)
c[j]=1;
for(int i=2; i<=n; i++)
if(c[i]==0)
k++;
g<<k;
return 0;
}