Cod sursa(job #2058151)
Utilizator | Data | 5 noiembrie 2017 11:08:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
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");
char ciur [2000001];
int n,nr,i,j;
int main()
{f>>n;
ciur[0]=1;
ciur[1]=1;
for (i=1;i<=n;i++)
if (ciur[i]==0)
{nr++;
for (j=i*i;j<=n;j=j+i)
ciur[j]=1;
}
g<<nr;}