Cod sursa(job #149146)
Utilizator | Data | 5 martie 2008 13:02:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream.h>
long long n,i,j,m,w=1;
char prim[2000030];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++){
if(v[i]==0){
nr++;
for(j=i+i;j<=n;j+=i){
}
}
}
f.close();
g.close();
return 0;
}