Cod sursa(job #1957480)
| Utilizator | Data | 7 aprilie 2017 16:07:53 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
bool *prim;
prim=new bool [n];
for(int i=0; i<=n; i++ )
prim[i]=1;
int nrp=0;
for(int i=2; i<=n; i++)
{
if(prim[i]==1)
{
nrp++;
int j=2;
while(i*j<=n)
{
prim[i*j]=0;
j++;
}
}
}
g<<nrp;
return 0;
}
