Cod sursa(job #1742286)
Utilizator | Data | 16 august 2016 10:17:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000000];
int main()
{ int n,cate,i,j;
f>>n;
cate=0;
for(i=2;i<=n;i++){
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
for(i=2;i<=n;i++)
if(v[i]==0)
cate++;
g<<cate;
return 0;
}