Cod sursa(job #1662247)
Utilizator | Data | 24 martie 2016 16:48:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,j,v[100],nr=0;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for(i=1;i<=n;i++)
v[i]=true;
for(i=2;i<=n;i++)
if(v[i]==true)
for(j=2;j*i<=n;j++)
v[i*j]=false;
for(i=2;i<=n;i++)
if(v[i]==true) nr++;
g << nr;
f.close();g.close();
return 0;
}