Cod sursa(job #1011724)
Utilizator | Data | 17 octombrie 2013 11:35:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000000];
int main()
{
int n,s=0;
in>>n;
for(int i=2; i<=n; i++)
{
if(v[i]==0)
{
for(int j=(i+1); j<=n; j++)
{
v[j]=1;
s++;
}
}
}
out<<s;
in.close();
out.close();
return 0;
}