Cod sursa(job #1120401)
Utilizator | Data | 24 februarie 2014 23:47:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<iostream>
#include<fstream>
using namespace std;
int p,v[2000000],n,nr;
int main()
{int i=2;nr=1;p=2;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
while(p*p<n)
{ i=2;
while(i*p<=n)
{v[i*p]=1;i++;}
p++;}
for(int j=3;j<=n;j++)
if(v[j]==0)
nr++;
g<<nr;
}