Cod sursa(job #1860816)
Utilizator | Data | 28 ianuarie 2017 13:29:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int i,j,n,k;
bool t[100002];
int main() {
ifstream cin("ciur.in");
ofstream cout("ciur.out");
cin>>n;
for (i=2; i<=n; i++)
if (!t[i])
for (j=2; j<=n/i; j++)
t[j]=true;
for (i=2; i<=n; i++)
if (!t[i]) k++;
cout<<k-1;
}