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