Cod sursa(job #2035364)
Utilizator | Data | 9 octombrie 2017 11:38:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,cnt;
bool mark[2000001];
void verif()
{
int i,j;
for(i=2; i<=sqrt(n);i++)
for(j=i;i*j<=n;j++)
{
if(mark[i*j]==0)
mark[i*j]=1;
}
}
int main()
{
int i;
f>>n;
verif();
for(i=3;i<=n;i=i+2)
if(mark[i]==0)
cnt++;
g<<cnt+1;
return 0;
}