Cod sursa(job #2471258)
Utilizator | Data | 10 octombrie 2019 17:43:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long v[1999999];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,j,x,cnt=0;
f>>x;
v[1]=1;
for(i=2;i<=x;i++)
for(j=2*i;j<=x;j=j+i)
v[j]=1;
for(i=1;i<=x&&i<=x;i++)
{
if(v[i]==0)
if(i<=x)
cnt++;
}
g<<cnt;
return 0;
}