Cod sursa(job #1050129)
| Utilizator | Data | 8 decembrie 2013 11:16:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,sol;
char v[2000001];
int main ()
{
fin>>n;
for(i=2;i<=n;++i)
if(v[i]==0){
sol++;
for(j=i+i;j<=n;j+=i);
}
fout<<sol;
return 0;
}
