Cod sursa(job #1013249)
Utilizator | Data | 20 octombrie 2013 17:56:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int main()
{
int j;
long int n,i,c;
f>>n;
c=0;
for(i=2; i<=n; i++)
{
for(j=2; j<=10; j++)
{
if(j==i) j++;
if(i%j==0) j=10;
if(j==9) c++;
}
}
g<<c;
return 0;
}