Pagini recente » Istoria paginii utilizator/teodor54 | Rating Stefanescu Alexandru (Piti0015) | Atasamentele paginii Clasament oji_sim_avram_9 | Cod sursa (job #2088721) | Cod sursa (job #1053346)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int N;
int a[2000000];
in>>N;
for(int i = 2 ; i <= (int)sqrt((float)N); i++)
for(int j = i * 2 ; j <= N ; j = j + i)
a[j] = 1;
int count = 0;
for(int i = 2 ; i <= N ; i++)
if(a[i] == 0) count++;
out<<count;
return 0;
}