Cod sursa(job #1331316)
Utilizator | Data | 31 ianuarie 2015 15:15:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char v[1000001];
int main()
{
int i,j,n,cnt=0;
f>>n;
for(i=2;i<n;++i) v[i]=1;
for(int i=2;i<n;++i)
if(v[i]==1)
for(j=i*i;j<n;j=j+i)
{v[j]=0;cnt++;}
g<<cnt;
return 0;
}