#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <stack>
#define M 10000
using namespace std;
typedef struct Node{
int x;
int y;
}Node;
Node m[M];
Node n[M];
int main()
{
freopen("in.in","r",stdin);
for(int i = 0;i < M;i++)
m[i].x = m[i].y = i;
memcpy(n,m,sizeof(m[0])*M);
for(int i = 0;i < 10;i++)
printf("%d %d\n",n[i].x,n[i].y);
int a[3] = {1,2,3};
int b[3] = {4,2,3};
int temp = memcmp(a,b,sizeof(int)*3); //遇到不相同元素是 a [i] > b[i] 则返回1 a[i] < b[i] 返回 -1 全部相同返回 0
printf("temp = %d\n",temp);
return 0;
}