Cod sursa(job #2001978)
Utilizator | Data | 18 iulie 2017 12:26:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[2000000];
int main()
{
int n,i,k,nr=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
{
k=i;
if(v[i]==0)nr++;
while(k<=n-i)
{
k=k+i;
v[k]=1;
}
}
g<<nr;
return 0;
}