Cod sursa(job #1000155)
Utilizator | Data | 22 septembrie 2013 10:48:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
int a[2000005],n,k;
int main(){
ifstream inFile("ciur.in");
inFile>>n;
k=0;
for(int i=2;i<=n;i++)
if(a[i]==0){
k++;
for(int j=i+i;j<=n;j+=i) a[j]=1;
}
ofstream outFile;
outFile.open("ciur.out");
outFile<<k;
}