Cod sursa(job #2141610)
Utilizator | Data | 24 februarie 2018 14:55:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int f[2000000];
int main()
{
int n,i,j,prime=0;
in>>n;
for(i=2;i<=n/2;i++)
if(f[i]==0)
for(j=2;j<=n/i;j++)
f[i*j]=1;
for(i=2;i<=n;i++)
if(f[i]==0)
prime++;
out<<prime;
}