Cod sursa(job #1052301)
Utilizator | Data | 11 decembrie 2013 01:10:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000000];
int main()
{
int n,ct=0,i,j;
f>>n;
for(i=2;i<=n;i++)
if(!v[i])
{
ct++;
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
g<<ct;
}