Cod sursa(job #2038411)
Utilizator | Data | 13 octombrie 2017 17:41:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,i,j,s=0,t[10000]={0};
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i*i<=n;i++){
if(t[i]==0)
for(j=i+i;j<=n;j=j+i)t[j]=1;
}
for(i=2;i<=n;i++)
if(t[i]==0)s++;
g<<s;
}