Cod sursa(job #1646138)
Utilizator | Data | 10 martie 2016 15:11:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
long long int v[2000012];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cnt=0;
fin>>n;
for(int i=2;i<=n;++i)
{
if(v[i]==0)
{
++cnt;
for(int j=i+i;j<=n;j+=i)
{
v[j]=1;
}
}
}
}