Cod sursa(job #555662)
Utilizator | Data | 15 martie 2011 17:54:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
int n;
ifstream aa("ciur.in");
ofstream ss("ciur.out");
int main() {
aa >> n;
ciur();
ss << u;
return 0;
}
bool c[100];
int u;
void ciur() {
int i;
for (i=2;i*i<n;++i) {
if (!c[i]) {
for (j=i*i;j<n;j+=i)
c[j]=true;
}
}
for (i=2;i<=n;++i) {
if (!c[i]) {
++u;
}
}
}