123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110#includeusing namespace std; struct node{ node* prev; node* next; int value;}; class CircleList{private: node head;public: void Add(int i); void Remove(int i); void LinkNewNode..

#include #include using namespace std;#define inf 1000000000int main(){ // n은 점 갯수, m은 선 갯수, a는 출발점, b는 도착점, c는 가중치값int n, m, a, b, c, route[101][101]; scanf("%d %d", &n, &m);fill_n(&route[0][0], 10201, inf);for (int i = 1; i

#include #define max 2097152 // 2^21long long sum(int l, int r, int nl, int nr, int nodeNum);void update(int i, int v);long long num[max];int main() {int a, b, c, n, m, k, rn;scanf("%d %d %d", &n, &m, &k);for (rn = 1; rn -1; --i)num[i] = num[i * 2 + 1] + num[i * 2 + 2];for (int i = 0; i < m + k;..

//최대공약수.int choidaegong(int a, int b){for (int temp; a%b != 0; b = temp%b){temp = a;a = b;}return b;} // 만약 최소공배수를 구하고싶으면 이 함수에 넣기 전 a*b를 리턴될 b로 나누면 됨.

max는 따로 #define 해둘 것.main에서 bool 배열을 만들어 배열 이름을 넘겨줄 것. void eratosthenes(bool *num){fill(&num[0],&num[max],1);for (int i = 4; i

#include #include #define max 100#define fr (front == rear)#define mal (node *)malloc(sizeof(node)) typedef struct _node{int data;struct _node *up, *left, *right;}node; node *head, *foot, *make; void initialize();void nodeInsert();void searchNode(); int main(){initialize();char command[7];while (1){printf("\n--\nexit - 종료, insert - 노드 추가, search - 트리 탐색\n명령어 입력 : ");scanf("%s", &command);if (!st..

#include #include #include #include #define max 10#define mem(a) memset(a, 0, sizeof(a))#define swap(a,b) {int t; t = a; a = b; b = t;} int number[max], result[max];clock_t start, end; void console();void initialize();void printResult();void copyIndex();void selection();void insert();void bubble();void shell();void quickCall();void quick(int left, int right);void radix();void merge(int *base, in..

#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 //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..