Cod sursa(job #1793769)
Utilizator | Data | 31 octombrie 2016 15:33:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
using namespace std;
int n,i,s,p,c,j;
bool a[2000];
int main()
{ ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
if(a[i]==0)
{
p++;
for(j=i+1;j<=n;j=j+i)
c[j]=1;
}
g<<p;
return 0;
}