Cod sursa(job #1538752)
Utilizator | Data | 29 noiembrie 2015 18:31:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
int main()
{ int n,i,j,ciur=0;
f>>n;
for(i=2;i<=n;i++)
{if(a[i]==0)
{ciur++;
for(j=2;j*i<=n;j++)
a[i*j]=1;}}
g<<ciur;}