Cod sursa(job #698098)
Utilizator | Data | 29 februarie 2012 12:24:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("ciur.in");
ofstream q("ciur.out");
int a[2000000];
int main ()
{
int i,j,n,s=1;
f>>n;
for(i=3;i<=n;i=i+2)
if(a[i]==0)
{ s++;
for(j=i*i;j<=n;j=i+j)
if(j%i==0)
a[j]=1;}
q<<s;
}