Cod sursa(job #1787361)
Utilizator | Data | 24 octombrie 2016 15:41:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int prim(int n){
int i,j,nr=0;
char v[2000001];
for(i=1;i<=n;i++)
v[i]=0;
for(i=2;i<=n;i++)
if(v[i]==0){
nr++;
for(j=i+i;j<=n;j=j+i)
v[j]=1;
}
return nr;
}
int main()
{
int n;
in>>n;
out<<prim(n);
return 0;
}