Cod sursa(job #719983)
Utilizator | Data | 22 martie 2012 11:21:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
int A[200001];
int main() {
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,count=0;
f>>n;
for(int i=2;i<=n/2;i++)
if(!A[i])
for(int j=2;j<=n/i;j++)
A[j*i]=1;
for(int i=2;i<=n;i++)
if(!A[i])
count++;
g<<count;
return 0;
}