Cod sursa(job #676875)

Utilizator Jim215Pop Flaviu Jim215 Data 9 februarie 2012 17:58:21
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include<iostream>
#include<fstream>
#include<bitset>
using namespace std;
bool v[2000000];
int k,n,i,z;
int main()
{
	ifstream f("ciur.in");
	ofstream g("ciur.out");
	f>>n;
	z=2;
	k=0;
	while(z<n/2)
	{
	for(i=z;i<=n-1;i=i+z)
	{
		
		
			
		if(v[i]!=1)
		{
		if(i%z==0 && i!=z)
			v[i]=1;
		}
		
		
	}
	z=z+1;
	while(v[z]==1 && z<n/2)
	{
		z=z+1;
	
	}
	
	
	}
	for(i=2;i<n;i++)
	{
		if(v[i]!=1)
			{k=k+1;}
	}
	g<<k;
	return 0;
}