Cod sursa(job #1441441)
| Utilizator | Data | 24 mai 2015 10:42:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#define MAX 2000002
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char v[MAX];
int n;
int ciur()
{
int nr=0;
for(int i=2;i<=n;i++)
if(v[i]==0)
{
nr++;
for(int j=i+i;j<=n;j=j+i)
v[j]=1;
}
return nr;
}
int main()
{
f>>n;
g<<ciur();
}
