Cod sursa(job #1205121)
| Utilizator | Data | 5 iulie 2014 12:59:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
//#include "stdafx.h"
#include<iostream>
#include<stdio.h>
using namespace std;
int n, nr=0;
char prim[2000001];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for (int i = 2; i <= n; i++)
prim[i] = 1;
for (int i = 2; i <= n; i++)
{
if (prim[i]==1)
{
int j = i;
while (j <= n)
{
prim[j] = 0;
j = j + i;
}
nr++;
}
}
printf("%d", nr);
return 0;
}
