- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
#include<stdio.h>
#include<stdlib.h>
#define N 3
using namespace std;
/*class Node{
struct Node *f,*s,*t;
public :
int x,y;
void Node(int rx,int ry){
x=rx;
y=ry;
return;
}
};*/
typedef struct node{int x,y}node;
node tree[100];
node jmps[3];
int main(){
// Node *root=new Node(-1,-1);
int i=0,j;
////////////////////////
////////////////////////
tree[0].x=-1;
tree[0].y=-1;
for(i=0;i<N;i++){
for(j<N*)
}
}