Cod sursa(job #2222735)
Utilizator | Data | 17 iulie 2018 22:28:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,j,n,prim[2000],cnt=0;
f>>n;
for(i=1;i<=n;i++) prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i])
{cnt++;
for(j=i+i;j<=n;j+=i) prim[j]=0;}
g<<cnt;
return 0;}