Cod sursa(job #1571297)
Utilizator | Data | 17 ianuarie 2016 19:41:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main ()
{
int n,ct;
f>>n;
ct=0;
bool prim[n];
for (int i=2;i<=n;i++)
{
prim[i]=1;
}
for (int i=2;i<=n;i++)
{
if (prim[i]==1)
{
ct++;
int j;
for (j=i+i;j<=n;j=j+i)
{
prim[j]=0;
}
}
}
g<<ct;
}