Cod sursa(job #2273464)
Utilizator | Data | 31 octombrie 2018 17:00:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <iostream>
using namespace std;
int a[2000005],n,m,i;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin>>n;
a[1]=1;
for(int i=2;i<=1415;i++)
for(int j=2;j*i<=2000000;j++)
a[i*j]=1;
int k=0;
for(int i=1;i<=n;i++)
cout<<i<<" "<<a[i]<<'\n';
for(int i=1;i<=n;i++)
k=k+1-a[i];
fout<<k;
return 0;
}