Cod sursa(job #1540817)
Utilizator | Data | 3 decembrie 2015 12:16:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[1000001];
int s=1,n;
void sundaram()
{int i,j;
for(i=1;i<=(n-1)/2;i++)
if(v[i]==false)
{s++;
for(j=i;i+j+2*i*j<=n;j++)
v[i+j+2*i*j]=true;
}
}
int main()
{ f>>n;
sundaram();
g<<s;
return 0;
}