7份作死代码
#include<bits/stdc++.h>
using namespace std;
void dfs(int dep)
{
if(! dep) return ;
dfs(dep-1);
}
int main()
{
getchar();
int len = strlen((char*)6);
printf("%d\n", *(int*)NULL);
printf("%d\n", *&*&*&*&*&*&*&*&*&*&len);
int i = 0;
printf("hello, %nworld!\n", i);
printf("now i=%d\n", i);
dfs(1E9+7);
queue <int> q;
for(int i =1; i<=(int)1E9+7; i++) q.push(i);
for(int i =1; i<=(int)1E9+7; i++) q.push(i);
for(int i =1; i<=(int)1E9+7; i++) q.push(i);
for(int i =1; i<=(int)1E9+7; i++) q.push(i);
for(int i =1; i<=(int)1E9+7; i++) q.push(i);
for(int i =1; i<=(int)1E9+7; i++) q.push(i);
cout << q.size() << endl;
int * ptr;
ptr = &i;
int t = 100000;
while(t --)
{
int * idl = (int*)malloc(400000);
}
return 0;
}