Cod sursa(job #1241398)
Utilizator | Data | 13 octombrie 2014 15:01:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[200000];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,mare,mic,nr=0;
f>>n;
for(i=2;i<=n;i++)
{
if(v[i]==0)
for(j=i;j<=n/i;j++)
v[i*j]=1;
}
v[0]=1; v[1]=1;
for(i=0;i<=n;i++)
if(v[i]==0)
nr++;
g<<nr;
return 0;
}