Cod sursa(job #1509011)
Utilizator | Data | 23 octombrie 2015 13:44:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
int a[2000000];
int main ()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
int i,j;
for(i=2;i<=n;i++)
for(j=i+1;j<=n;j++)
if(j%i==0)
a[j]=1;
int k=0;
for(i=2;i<=n;i++)
if(a[i]==0)
k++;
g<<k;
}