Cod sursa(job #1089433)
Utilizator | Data | 21 ianuarie 2014 18:23:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
using namespace std;
#include<fstream>
#include<iostream>
ifstream f("ciur.in");
ofstream g("ciur.out");
int M, counter;
char visited[2000001];
int main()
{
f>>M;
for(int i=2;i<=M;i++)
{
if(visited[i] == 0)
{
counter++;
int j=i;
while(j<=M)
{
visited[j] = 1;
j+=i;
}
}
}
g<<counter;
return 0;
}