mikigom

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <unistd.h>
#include <wait.h>

#define CHUNK 1

char** res = NULL;

mikigom

mikigom

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

int matrix[101][101];
int cache[101][101];
int matrix_num;
unsigned long reach_end_counter;

int DP(int x, int y)

mikigom

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

int matrix[101][101];
int cache[101][101];
int matrix_num;

int DP(int x, int y)
{

mikigom

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>

using namespace std;

// 단어의 사이즈를 점수로 변환
const int size2score[9] = {-987654321, 0, 0, 1, 1, 2, 3, 5, 11};

mikigom

#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main()
{
    int input_num;
    cin >> input_num;

mikigom

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int test_case_num;
    cin >> test_case_num;