Cod sursa(job #1121631)
Utilizator | Data | 25 februarie 2014 13:28:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include fstream
using namespace std;
ifstream f(ciur.in);
ofstream g(ciur.out);
int n,i,j,c,x[100];
int main()
{
fn;
for(i=2;i=n;i++)
{
if(n==0)
{
gi ;
c++;
for(j=i+i;j=n;j=j+i)
n=1;
}
}
gc;
f.close();
g.close();
return 0;
}