Cod sursa(job #1298494)
Utilizator | Data | 22 decembrie 2014 21:16:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{int i,j,n,nr;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
bool prim[n+1];
nr=0;
for(i=2;i<=n;i++) prim[i]=true;
for(i=2;i<=n;i++)
{if(prim[i]==true)
{
for (j=2;i*j<=n;j++) prim[i*j]=false;
nr+=1;}}
g<<nr;
}