Cod sursa(job #2298862)
Utilizator | Data | 8 decembrie 2018 16:15:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int v[2000005];
int main()
{
int n,i,j,ct=0;
in>>n;
for(i=1;i<=n;i++)
{
v[i]=1;
}
for(i=2;i<=n;i++)
{
if(v[i]==1)
{
for(j=2;j*i<=n;j++)
{
v[i*j]=0;
}
}
}
for(i=2;i<=n;i++)
{
if(v[i]==1)
{
ct++;
}
}
out<<ct;
return 0;
}