Cod sursa(job #1342823)
Utilizator | Data | 14 februarie 2015 16:01:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("ciur2.in");
ofstream fout ("ciur2.out");
int n, i, j, s=1, asf, v[500];
fin>>n;
v[0]=2;
for (i=3; i<=n; i++)
{
asf=0;
for (j=2; j<s; j++)
if (i%j==0)
asf=1;
if (asf==0)
{
v[s]=i;
s++;
}
}
fout<<s-1;
return 0;
}