Cod sursa(job #1746852)
Utilizator | Data | 24 august 2016 01:02:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000100];
int N, i, j, S;
int main()
{
f>>N;
for(i=1;i<=N; i++)
v[i] =1;
for (i=2;i<=N;i++)
if(v[i]==1)
for(j=2;j*i<=N;j++)
v[i*j]=0;
for(i=1;i<=N;i++)
if(v[i]==1)
S+=1;
g<<S-1;
}