Cod sursa(job #1657327)
Utilizator | Data | 20 martie 2016 13:27:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int k,N,i,v[2000000],j;
int main()
{ ifstream f("ciur.in");
ofstream g("ciur.out");
f>>N;
for(i=1;i<=N;i++)
v[i]=i;
for(i=2;i<=N;i++)
for(j=i+i;j<=N;j=j+i)
v[j]=0;
for(i=1;i<=N;i++)
if(v[i]!=0)
k++;
k--;
cout<<k;
return 0;
}