Cod sursa(job #893020)
Utilizator | Data | 26 februarie 2013 12:40:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream.h>
#define max 2000001
int t[max] = {0};
using namespace std;
int main()
{
fstream f,g;
f.open("ciur.in",ios::in);
g.open("ciur.out",ios::out);
int n,p=0,i,k;
f>>n;
for (i=2;i<=n;i++)
{
if (t[i]==0)
{
p++;
k=2*i;
while(k<=n)
{
t[k]=1;
k=k+i;
}
}
}
g<<p;
}