skysign

from collections import deque
import sys

MAX = 100000 + 1

def solve():
    input = sys.stdin.readline
    N, K = map(int, input().strip().split())

    q = deque()

skysign

const router = express.Router()

async function myValidationResult(req: Request, res: Response, next: NextFunction) {
  const result = validationResult(req)
  
  if (!result.isEmpty()) {
    return res.status(400).json({ errors: result.array() })
}

return next();

skysign

import copy

candidates: list[str] = []
max_length = 0

def solution(s:str):
    questionMarkIdxes = []
    for idx in range(len(s)):
        if s[idx] == '?':
            questionMarkIdxes.append(idx)

skysign

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.util.ArrayList;
import java.util.Arrays;

/**
 * BOJ 1912번 연속합

skysign

#include <iostream>

int global[3][3];

void func1(int** local);

int main()
{
    func1((int**)global);
    std::cout << "Hello World!\n";

skysign

/**
 * 4991번 로봇 청소기 / BOJ
 * 문제링크 : https://www.acmicpc.net/problem/4991
 * 제출링크 : https://www.acmicpc.net/source/19521047
 * 문제풀이 : https://skysign.tistory.com/214
 */

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;

skysign

import java.util.ArrayList;
import java.util.Scanner;

/**
 * 13460번 구슬 탈출 2 / BOJ / acmicpc.net
 * 문제링크 : https://www.acmicpc.net/problem/13460
 * 답제출 : https://www.acmicpc.net/source/17221215
 *
 * 다른분들의 풀이를 보면 BFS로 푸신 것 같아서, DFS로 풀이를 만들어 봤습니다.
 * 문제가 까다로운 부분이 몇가지 있어서, 풀기 좀 어려웠습니다.