Cod sursa(job #1976492)
Utilizator | Data | 3 mai 2017 15:52:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[200000001]
int main()
{
long long n,i,c,d;
in>>n;
for(d=2; d<=n; d++)
{
if(ciur[d]==0)
{
for(i=d*2; i<=n; i++)
if(ciur(i)=1)
out<<d;
return 0;
}