@increase_up

#include <iostream>
using namespace std;

class Member {
protected :
    int id;
    char* name;
    int age
    int guardID = -1;
public :

#include <iostream>
using namespace std;

void Print(const char * mini){
    cout << mini;
}

int main() {
    char* min;
    cin >> min;

#include <iostream>
#include <cstring>
using namespace std;

//class MainMenu
class MainMenu {
private:
    int sel;
public:
    int IssueMenu() {

#include <iostream>
using namespace std;

class Person {
public :
    int age;
    char* name;
};

class Student : public Person {

-- 병실
CREATE TABLE HospitalRoom (
    RoomNumber VARCHAR2(10) PRIMARY KEY,
    RoomType VARCHAR2(20),
    RoomLocation VARCHAR2(50) NOT NULL,
    BedCount NUMBER
);

-- 환자
CREATE TABLE Patient (

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
    int data;
    struct Node leftChild;
    struct Node rightChild;
} node;

void insertData (node* arrPtr, int data) {

#include <stdio.h>
#include <stdlib.h>

int numAvg(int arr[], int num){
    int sum = 0;
    for (int i = 0; i < num; i++)
        sum += arr[i]; 
    return sum/num;
}

#include <stdio.h>

int main() {
    int arr[246913] ={0,};
    for (int i = 2; i <= 123456; i++){
        for (int j = 2; j*i <= 246912; j++ ) {
            arr[j*i] =  1;
        }
    }
    while (1) {

#include <stdio.h>
void splitArray(int arr[], int max[], int min[], int length) {
    for (int i = 0; i < length; i = i + 2){
        if (arr[i] >= arr[i+1]){
            max[cnt] = arr[i];
            min[cnt] = arr[i+1];
        }  
        else {
            min[cnt] = arr[i];
            max[cnt] = arr[i+1];

#include <stdio.h>

//heapSort(int arr[]);
insert(int arr[]);
arrPrint(int arr[]); 

int main() {
    int arr[11] = {-1,};
    insert(arr);
    arrPrint(arr);

#include <stdio.h>
#include <stdlib.h>

typedef struct Node *treePointer;

typedef struct Data {
    int key;
} Data;

typedef struct Node {

#include <stdio.h>

int main() {
    int cnt; scanf("%d",&cnt);
    int arr[3],start = 0, end = 0,twin;
    
    while(cnt){
        int x,y,x1,y1;scanf("%d %d %d %d", &x,&y,&x1,&y1);
        int num; scanf("%d",&num);
        while(num) {

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
 
int fib[41][2];
// fib[n][0]: 0을 출력하는 개수, fib[n][1]: 1을 출력하는 개수
 
int main() {
    int T, n;
    int t, i;   // t: Test case의 횟수, i: fib[][]의 index
    fib[0][0] = 1;  // n = 0일 때 0을 출력하는 개수는 1

import java.util.*;
import java.lang.*;
import java.io.*;

class GStack<T> {
    int tos;
    Object [] stck;

    public GStack() {
        tos = 0;