Cod sursa(job #2023639)
Utilizator | Data | 19 septembrie 2017 10:31:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ifstream f("ciur.in");
ofstream g("ciur.out");
int N,i,j,cont;
char v[2000009]={1};
f>>N;cout<<v[6];
cont=0;cout<<v[100];
for (i=2;i<N;i++)
{if (v[i]==1)
cont++;
for (j=i*2;j<N;j=j+i)
v[j]=0;}
g<<cont;
return 0;
}