Cod sursa(job #1337718)
| Utilizator | Data | 9 februarie 2015 13:45:24 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int x[2000000];
int main()
{
int n, i, j;
fin>> n;
for(i=1; i<=n; i++)
{
x[i]=i;
}
int ct, ct1=0;
for(i=1; i<=n; i++)
{
ct=0;
for(j=1; j<=x[i]; j++)
{
if(x[i]%j==0)
{
ct++;
}
}
if(ct==2)
{
// cout<< x[i] << " ";
ct1++;
}
}
fout << ct1;
/* for(i=1; i<=n; i++)
{
cout << x[i] << " ";
}
*/
return 0;
}
