Cod sursa(job #1718080)
Utilizator | Data | 16 iunie 2016 16:38:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool a[100];
int main()
{
int n, i, j, cate=0;
in>>n;
for(i=2; i*i<n; i++)
{
if(a[i]==0)
for(j=i+i; j<=n; j=j+i)
{
a[j]=1;
}
}
for(i=2; i<=n; i++)
if(a[i]==0)
cate++;
out<<cate;
return 0;
}