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