ACM 开栈黑魔法

1.cpp

// Reference: 
// https://www.cnblogs.com/HarryGuo2012/p/4722784.html
// http://blog.csdn.net/fcxxzux/article/details/40053937

#include <cstring>
#include <cstdio>
#include <cstdlib>

int dfs(int i) {
	int a[100];
	if (i == 1000000) {
		return 0;
	}
	return dfs(i+1);
}

void solve() {
	/// Write your code here
	/// ...
	dfs(0);
}

int main() {
  	int size = 128 << 20; // 128MB
  	char *p = (char*)malloc(size) + size;  
  	__asm__("movl %0, %%esp\n" :: "r"(p));
	solve();
	exit(0);
}