Cod sursa(job #1088592)
Utilizator | Data | 20 ianuarie 2014 17:21:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
#include<cmath>
using namespace std;
char ciur[2000001];
FILE *f=fopen("ciur.in", "r");
FILE *g=fopen("ciur.out", "w");
void ciu(int rp){
int r=0, j;
ciur[1]=1;
for (int i=2;i<=rp;++i){
if (!ciur[i]){
++r;
for (int j=i+i;j<=rp;j+=i)
ciur[j]=1;
}
}
fprintf(g, "%d", r);
}
int main(){
int n;
fscanf(f, "%d", &n);
ciu(n);
return 0;
}