Cod sursa(job #902922)
Utilizator | Data | 1 martie 2013 17:28:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,n,sol=0,j;
bool v[2000003];
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(v[i]==false)
{
sol++;
for(j=2*i;j<=n;j+=i)
v[j]=true;
}
g<<sol;
}