VioletaBabel
#include #include #include #define mal (node *)malloc(sizeof(node))typedef struct _node {char data;struct _node *left;struct _node *right;int degree;int level;}node; node *head, *end, *stack[8], *parent, *leftChild, *rightChild;int top = 0, bool_treeCount = 0, degreecursor = 1, levelcursor = 1, bool_fullTree = 0, bool_firstpop = 0; void push(node *cursor);node *pop();int stackEmpty();void addtre..
#include #include #include int q[10000];int start = 0, end = 0, count = 0; void push(int x);void pop();void size();void empty();void front();void back(); void push(int x){q[end++] = x;++count;}void pop(){if (count != 0){printf("%d\n", q[start++]);--count;}elseprintf("-1\n");}void size(){printf("%d\n", count);}void empty(){if (count == 0)printf("1\n");elseprintf("0\n");}void front(){if (count != ..
스택을 안써도 그냥 count 매기는걸로 풀 수 있을 것 같지만, 분류가 스택이길래 스택 함수까지 해보았다. #include #include //malloc#include #define mal (node *)malloc(sizeof(node))typedef struct _node{int data;struct _node *next;}node; node *head, *end, *indexnode;int count = 0;void push(int num);void pop(); void push(int num){indexnode = (node *)malloc(sizeof(node));indexnode->data = num;indexnode->next = head->next;head->next = indexnod..
#include #include //malloc#include #define mal (node *)malloc(sizeof(node))typedef struct _node{int data;struct _node *next;}node; node *head, *end, *indexnode;void push(int num);void pop(); void push(int num){indexnode = (node *)malloc(sizeof(node));indexnode->data = num;indexnode->next = head->next;head->next = indexnode;printf("+\n");} void pop(){indexnode = head->next;head->next = indexnode-..
#include #include //malloc#include #define mal (node *)malloc(sizeof(node))typedef struct _node{int data;struct _node *next;}node; node *head, *end, *indexnode;int count = 0;void push(int num);void pop();void size();void empty();void top(); void push(int num){indexnode = (node *)malloc(sizeof(node));indexnode->data = num;indexnode->next = head->next;head->next = indexnode;++count;} void pop(){in..
#include #include //malloc#include //getche#define mal (node *)malloc(sizeof(node))struct node{ int data; node *next;};node *head, *end, *node1, *node2, *node3, *node4, *node5;int count = 0;char command;void startProgram();void insertNode(node *newnode);void checkCommand();void numbering();void rebuildnode(node *change);void startProgram(){ printf("이 프로그램은 최대 5개까지의 숫자를 저장합니다.\n"); head = mal, en..
밣밞따맣반발따반발따따밪반타다맣밪밫따밞따빠맣맣밦밦따받박타다받따맣밣밫따맣밡밡따밦다맣밦밦따받박타다받따맣밦밦따반다받따맣밪밫따밞따맣반발따빠따맣밞반다받따맣희
방방타망희
방방다망희
#include using namespace std;int main(){int T, M, N, x, y, cx = 0, cy = 0, count = 0;cin >> T;for (int i = 0; i > M >> N >> x >> y;while (1){++cx;++cy;++count;if (cx > M && cy > N){count = -1;break;}cx = (cx > M) ? 1 : cx;cy = (cy > N) ? 1 : cy;if (cx == x && cy == y)break;}cout