Cod sursa(job #1999774)
| Utilizator | Data | 12 iulie 2017 09:28:28 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char ciur[2000000];
int n, nr=0;
void facere (){
f >> n;
for (int i=2; i<=n; i++)
{
if (ciur[i]==0)
{
for (int j=i*2; j<=n; j+=i)
ciur[j]=1;
}
}
}
int main()
{
facere();
for (int i=2; i<=n; i++)
{
if (ciur[i]==0)
{
nr++;
}
}
g << nr;
return 0;
}
