Too Large of an Array

[ascii]

Hey! I've been trying to get the answer to Project Euler problem 10 and am having some troubles :o
I'm using the standard Sieve of Eratosthenes approach to the problem. My problem is that every time i try to make my sieve have 2000000 slots the program crashes! Everything works perfectly if I'm just getting for example the sum of the primes below 10. Please help me, thanks!

#include<iostream>
using std::cout;
using std::endl;

const int max = 10;

class CPrime
{
public:
	CPrime()
	{
		sieve[0] = 0;
		sieve[1] = 0;
		for(int i = 1; i < max; i++)
		{
			sieve[i] = i;
		}
	}
	
	void generateSieve();
	void showSieve();
	int addSieve();
private:
	int sieve[max];
};

void CPrime::generateSieve()
{
	for(int i = 2; i*i < max; i++)
	{
		for(int y = i+i; y < max; y += i)
		{
			sieve[y] = 0;	
		}
	}

	return;
}

void CPrime::showSieve()
{
	for(int i = 0; i < max; i++)
		if(sieve[i] != 0)
			cout << sieve[i] << endl;
	
	return;
}

int CPrime::addSieve()
{
	int total = 0;
	for(int i = 2; i < max; i++)
		total += sieve[i];

	return total;
}

int main(void)
{	
    CPrime primes;
	primes.generateSieve();
	primes.showSieve();
	cout << primes.addSieve();

	cout << endl;
	return 0;
}

The problem can be found here: http://projecteuler.net/index.php?section=problems&id=10

[Athar]

You should use a vector instead of a raw array (or use new to create your class instance). In particular, you should use a vector<bool>, which cuts down memory usage to 1/32 of what it is now.

[Moschops]

You're making your object on the stack. The stack has a limited size. If your object is too big, your stack overflows.

http://en.wikipedia.org/wiki/Stack_overflow#Very_large_stack_variables

[ascii]

thank you both! thank you for the article moschops, when i allocated it dynamically it worked with the following code

#include<iostream>
using std::cout;
using std::endl;

const int max = 2000000;

class CPrime
{
public:
	CPrime()
	{
		sieve = new int[max];
		sieve[0] = 0;
		sieve[1] = 0;
		for(int i = 1; i < max; i++)
		{
			sieve[i] = i;
		}
	}

	~CPrime()
	{
		delete[] sieve;
	}
	
	void generateSieve();
	void showSieve();
	int addSieve();
private:
	int* sieve;
};

void CPrime::generateSieve()
{
	for(int i = 2; i*i < max; i++)
	{
		for(int y = i+i; y < max; y += i)
		{
			sieve[y] = 0;	
		}
	}

	return;
}

void CPrime::showSieve()
{
	for(int i = 0; i < max; i++)
		if(sieve[i] != 0)
			cout << sieve[i] << endl;
	
	return;
}

int CPrime::addSieve()
{
	int total = 0;
	for(int i = 2; i < max; i++)
		total += sieve[i];

	return total;
}

int main(void)
{	
    CPrime primes;
	primes.generateSieve();
	cout << primes.addSieve();

	cout << endl;
	return 0;
}

would you mind doing me one last favor XD, project euler doesnt work for me so could you tell me if my answer of 1179908154 is right?? thank you!