hsuan1117

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

typedef struct _Node {
    char val;
    struct _Node *next;
} Node;

Node *head[100005] = {};
Node *tail[100005] = {};

hsuan1117

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

typedef struct Node {
    int data;
    struct Node *next;
	struct Node *prev;
} Node;
Node *head;
Node *tail, *tmp;

hsuan1117

#include<stdio.h>
#include<stdlib.h>
#include"function.h"
Table* createTable() {
	Table* t = malloc(sizeof(Table));
	int s;
	scanf(" %d", &s);
	t->tableSize = s;
	return t;
}

hsuan1117

#include<stdio.h>
#include<string.h>
#define to_lower(x) ( ('a' <= x && x <= 'z') ? x : (('A' <= x && x <= 'Z') ? x - 'A' + 'a' : -1 ))

char resultA[100000+5];
char resultB[100000+5];
char in[100000+5];
char name[100000+5];
char sentence[100000+5];
int max = -1;

hsuan1117

# -*- coding: utf-8 -*-

import os
import sys

from dotenv import load_dotenv
from linebot.v3.messaging import (
    Configuration,
    ApiClient,
    MessagingApi,

hsuan1117

#include <stdio.h>

#define UP 0
#define LEFT 1
#define FRONT 2
#define RIGHT 3
#define BACK 4
#define DOWN 5

char rubiks[6][4];

hsuan1117

#include <stdio.h>

#define UP 0
#define LEFT 1
#define FRONT 2
#define RIGHT 3
#define BACK 4
#define DOWN 5

char rubiks[6][4];

hsuan1117

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

#define N 15+3


int n, s, t;
int jumped[N] = {0};
int color[N] = {0};
int height[N] = {0};

hsuan1117

#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <random>

double findMedian(std::vector<double> &arr, int l, int r) {
    std::sort(arr.begin() + l, arr.begin() + r + 1);
    int n = r - l + 1;
    return arr[l + n / 2];

hsuan1117

#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <random>

double findMedian(std::vector<double> &arr, int l, int r) {
    std::sort(arr.begin() + l, arr.begin() + r + 1);
    int n = r - l + 1;
    return arr[l + n / 2];