Cod sursa(job #2194723)
Utilizator | Data | 14 aprilie 2018 11:08:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,nr,j;
char u[2000005];
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=2; i<=n; i++)
{
u[i]=1;
}
for(i=2; i<=n; i++)
{
if(u[i]==1)
{
nr++;
for(j=2*i; j<=n; j=j+i)
{
u[j]=0;
}
}
}
out<<nr;
return 0;
}