Cod sursa(job #1347382)
Utilizator | Data | 18 februarie 2015 22:28:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool m[2000002];
int main()
{
int i,j,n,t=0;
in>>n;
for(i=2;i<=(n/2);i++)
for(j=2;(j*i)<=n;i++)
{
m[i]=1;
for(i=1;i<=n/2;i++)
{
if(m[i]==0)
t++;
}
}
out<<t;
return 0;
}