Cod sursa(job #1846378)
Utilizator | Data | 12 ianuarie 2017 17:16:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int s[2000000];
int main()
{
int n,t=0;
in>>n;
for (int i=2;i<=n;i++)
{
if (s[i]==0)
{
t++;
for (int j=i;j<=n;j=j+i)
s[j]=1;
}
}
out<<t;
return 0;
}