Cod sursa(job #1047476)
Utilizator | Data | 4 decembrie 2013 16:37:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
int v[100]={0},n,i,j,gogu=0;
in>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{for(j=i+i;j<=n;j=j+i)
v[j]=1;
gogu++;}
out<<gogu;
return 0;
}