Cod sursa(job #1340338)
Utilizator | Bolos Robert euunu | Data | 11 februarie 2015 19:25:06 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | 9neplace | Marime | 0.36 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
bool ciur[2000000];
ifstream("ciur.in");
ofstream("ciur.out");
long x,i,j;
fin >>x;
int cnt=0;
for(i=2;i<=x;i++)
if (ciur[i]==true)
{
cnt++
for(j=i+i;j<=x;j=j+i)
ciur[i]==false;
} fout<<cnt;
return 0;}