Cod sursa(job #1246033)
Utilizator | Data | 20 octombrie 2014 13:50:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[1000];
int main()
{
long int n,i,j,t=0;
fin>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{
for(j=2;j*i<=n;j++)
v[i*j]=1;
t=t+1;
}
fout<<t;
return 0;
}