g_200ymdwan.log

[NYPC 2023_ Round 1] 메이플스토리 새로운 직업 고르기

Sat, 02 Sep 2023 14:08:49 GMT

import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.math.BigInteger;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int N = Integer.parseInt(br.readLine());
        String [] jobs = new String[N];
        for(int i=0; i jobList = new ArrayList<>(Arrays.asList(jobs));
        int K = Integer.parseInt(br.readLine());
        for(int i=0; i



[NYPC 2023_ Round 1] 연습문제 - 인류의 적 모기 퇴치
Sat, 02 Sep 2023 13:11:36 GMT
import sys
input = sys.stdin.readline

li = []

mosquito_cross = []
mosquito_diagonal = []

N, M = map(int, input().split())
for i in range(N):
    a = list(map(int, input().split()))
    li.append(a)



def cross(i, j):  # 십자 모양
    move_x = [1,-1,0,0]
    move_y = [0,0,1,-1]

    cnt = 0
    for k in range(1,M+1):
        for h in range(4):
            x = i + move_x[h]*k
            y = j + move_y[h]*k
            if(x < 0 or x >= N or y < 0 or y >= N): continue
            cnt += li[x][y]

    return cnt + li[i][j]


def diagonal(i,j):  # 대각선 모양
    move_x = [-1,-1,1,1]
    move_y = [-1,1,-1,1]

    cnt = 0
    for k in range(1,M+1):
        for h in range(4):
            x = i + move_x[h]*k
            y = j + move_y[h]*k
            if(x < 0 or x >= N or y < 0 or y >= N): continue
            cnt += li[x][y]

    return cnt + li[i][j]



res = 0
for i in range(N):
    for j in range(N):
        res = max(res, cross(i,j), diagonal(i,j))


print(res)
맞는지 모르겠음



2178 미로 탐색 [Python]
Thu, 17 Aug 2023 07:55:09 GMT
참고click
import sys
from collections import deque
input = sys.stdin.readline

def bfs(x,y):
    queue = deque()
    queue.append((x,y))

    while queue:
        x, y = queue.popleft()

        for i in range(4):
            nx = x + dx[i]
            ny = y + dy[i]

            if 0 <= nx < N and 0 <= ny < M and graph[nx][ny] == 1:
                queue.append((nx,ny))
                graph[nx][ny] = graph[x][y] + 1

    return graph[N-1][M-1]



N, M = map(int, input().split())

graph = []

for i in range(N):
    graph.append(list(map(int, input().rstrip())))


dx = [-1,1,0,0]
dy = [0,0,-1,1]

print(bfs(0,0))


백준 1260 DFS와 BFS [Python]
Tue, 15 Aug 2023 09:04:29 GMT
참고click
import sys

N, M, V = map(int, sys.stdin.readline().split())

matrix = [[0]*(N+1) for i in range(N+1)]
visited = [0]*(N+1)

for i in range(M):
    a, b = map(int, sys.stdin.readline().split())
    matrix[a][b] = matrix[b][a] = 1


def dfs(V):
    visited[V] = 1
    print(V, end=' ')

    for i in range(1,N+1):
        if(visited[i] == 0 and matrix[V][i] == 1):
            dfs(i)

def bfs(V):
    queue = [V]

    visited[V] = 0

    while queue:
        V = queue.pop(0)
        print(V, end = ' ')
        for i in range(1, N+1):
            if(visited[i] == 1 and matrix[V][i] == 1):
                queue.append(i)
                visited[i] = 0

dfs(V)
print()
bfs(V)


백준 11131 Balancing Weights [Java]
Mon, 14 Aug 2023 09:19:32 GMT
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int T = Integer.parseInt(br.readLine());
        for(int i=0; i right) System.out.println("Left");
            else if(left == right) System.out.println("Equilibrium");
            else System.out.println("Right");

        }

    }
}


백준 1940 주몽 [Python]
Mon, 14 Aug 2023 09:06:12 GMT
참고click
import sys

N = int(sys.stdin.readline())
M = int(sys.stdin.readline()) 

nums = list(map(int, sys.stdin.readline().split()))


nums.sort()
left, right = 0, len(nums)-1
cnt = 0

while left < right:
    sum = nums[left] + nums[right]
    if sum < M:
        left += 1
    elif sum > M:
        right -= 1
    else:
        cnt += 1
        left += 1
        right -= 1


print(cnt)


백준 15624 피보나치 수 7 [Java]
Sun, 13 Aug 2023 13:31:27 GMT
import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());

        int [] fib = new int[1000001];
        fib[0] = 0;
        fib[1] = 1;

        for(int i=2; i<=n; i++){
            fib[i] = (fib[i-2] + fib[i-1])%(1000000007);
        }

        System.out.println(fib[n]);
    }
}


백준 1620 나는냐 포켓몬 마스터 이다솜 [python]
Wed, 21 Jun 2023 12:57:29 GMT
import sys

N, M = map(int, sys.stdin.readline().split())

poketmon = {}
for i in range(N):
    name = sys.stdin.readline().strip()
    poketmon[name] = i+1


reverse_poketmon = dict(map(reversed, poketmon.items()))


for i in range(M):
    s = sys.stdin.readline().strip()
    if 48 <= ord(s[0]) <= 57:
        print(reverse_poketmon.get(int(s)))
    else:
        print(poketmon.get(s))


백준 1904 01타일 [Java]
Fri, 07 Apr 2023 11:36:56 GMT
import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());


        int [] dp = new int[1000001];

        dp[1] = 1;  //1
        dp[2] = 2; 


        if(n >= 3) {
            for(int i=3; i<=n; i++) {
                dp[i] = (dp[i-2] + dp[i-1])%15746; 
            }
        }


        System.out.println(dp[n]);
    }    
}
2023-04-07



백준 27736 찬반투표 [Python]
Fri, 07 Apr 2023 10:43:36 GMT
n = int(input())

vote = list(map(int, input().split()))

if vote.count(0) >= n/2:
    print("INVALID")
else:
    if vote.count(1) > vote.count(-1):
        print("APPROVED")
    else:
        print("REJECTED")
2023-04-07



백준 27522 카트라이더: 드리프트 [Python]
Fri, 07 Apr 2023 10:15:33 GMT
import sys

Li = []

for i in range(8):
    time, team = map(str, sys.stdin.readline().split())
    m, ss, sss = time.split(":")
    li = [m,ss,sss, team]
    Li.append(li)

Li.sort()


RED = 0
BLUE = 0
score = 10
for i in range(8):
    if Li[i][3] == 'R':
        RED += score
    else:
        BLUE += score
    if i < 2: score -= 2
    else: score -= 1

if RED > BLUE: print("Red")
else: print("Blue")
2023-04-07



18238 ZOAC 2 [Python]
Tue, 04 Apr 2023 10:41:28 GMT
ZOAC = list(input())

sum = 0
curr = 65
for i in range(len(ZOAC)):
    tmp1 = abs(ord(ZOAC[i]) - curr)
    tmp2 = abs(26 - tmp1)
    sum += min(tmp1, tmp2)
    curr = ord(ZOAC[i])

print(sum)
2023-04-04



백준 23812 골뱅이 찍기 - 돌아간 ㅍ [Python]
Tue, 04 Apr 2023 10:22:22 GMT
li1 = ["@", " ", " ", " ", "@"]
li2 = ["@", "@", "@", "@", "@"]
li3 = ["@", " ", " ", " ", "@"]
li4 = ["@", "@", "@", "@", "@"]
li5 = ["@", " ", " ", " ", "@"]


n = int(input())
for i in range(n):
    for j in range(5):
        for k in range(n):
            print(li1[j], end="")
    print()

for i in range(n):
    for j in range(5):
        for k in range(n):
            print(li2[j], end="")
    print()

for i in range(n):
    for j in range(5):
        for k in range(n):
            print(li3[j], end="")
    print()

for i in range(n):
    for j in range(5):
        for k in range(n):
            print(li4[j], end="")
    print()

for i in range(n):
    for j in range(5):
        for k in range(n):
            print(li5[j], end="")
    print()
2023-04-04



백준 17986 Fire on Field [Java]
Sat, 01 Apr 2023 15:10:37 GMT
import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());

        int [] A = new int[1001];
        A[0] = 1;
        A[1] = 1;


        for(int i=2; i<=n; i++) {
            A[i] = 1;
            while(true) {
                boolean flag = false;  

                for(int k=1; i-2*k >= 0; k++) {
                    if(A[i]-A[i-k] == A[i-k] - A[i-2*k]) {
                        flag = true;
                        break;
                    }
                }

                if(flag == false) break;
                else A[i]++;
            }
        }

        System.out.println(A[n]);
    }    
}
2023-04-01



백준 ZOAC 5 [Python]
Sat, 01 Apr 2023 14:48:01 GMT
s = input().rstrip()
cnt = s.count(s[0])
print(cnt)
2023-04-01



백준 23809 골뱅이 찍기 - 돌아간 ㅈ [Python]
Sat, 01 Apr 2023 14:34:37 GMT
li1 = ["@", " ", " ", " ","@"]
li2 = ["@", " ", " ", "@"]
li3 = ["@", "@", "@"]
li4 = ["@", " ", " ", "@"]
li5 = ["@", " ", " ", " ","@"]

n = int(input())

for i in range(n):
    for j in range(5):
        for k in range(n):
            print(li1[j], end="")
    print()

for i in range(n):
    for j in range(4):
        for k in range(n):
            print(li2[j], end="")
    print()

for i in range(n):
    for j in range(3):
        for k in range(n):
            print(li3[j], end="")
    print()

for i in range(n):
    for j in range(4):
        for k in range(n):
            print(li4[j], end="")
    print()

for i in range(n):
    for j in range(5):
        for k in range(n):
            print(li5[j], end="")
    print()
2023-04-01



프로그래머스 Lev.1 로또의 최고 순위와 최저 순위 [C언어]
Fri, 31 Mar 2023 12:30:46 GMT
#include 
#include 
#include 


int* solution(int lottos[], size_t lottos_len, int win_nums[], size_t win_nums_len) {
    int* answer = (int*)malloc(sizeof(int)*2);



    int min = 0;
    int cnt = 0;  //모르는 번호 카운트
    for (int i = 0; i < lottos_len; i++) {
        if (lottos[i] == 0) { //모르는 번호
            cnt++;
            continue;
        }
        for (int j = 0; j < win_nums_len; j++) {
            if (lottos[i] == win_nums[j]) {  //일치하는 번호
                min++; 
                break;
            }
        }
    }
    int max = min + cnt;

    min = 7 - min;
    if (min == 7) min = 6;  //0개 번호가 일치하면 6등
    max = 7 - max;
    if (max == 7) max = 6;  //0개 번호가 일치하면 6등

    answer[0] = max;  //당첨 가능한 최고 순위
    answer[1] = min;  //최저 순위

    return answer;
}
2023-03-31



백준 1003 피보나치 함수 [Java]
Fri, 31 Mar 2023 11:49:36 GMT
import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int T = Integer.parseInt(br.readLine());

        int [] dp0 = new int[41];
        int [] dp1 = new int[41];
        dp0[0] = 1;
        dp1[0] = 0;
        dp0[1] = 0;
        dp1[1] = 1;

        for(int i=2; i<=40; i++) {
            dp0[i] = dp0[i-1] + dp0[i-2];
            dp1[i] = dp1[i-1] + dp1[i-2];
        }

        for(int i=0; i
2023-03-31




백준 27159 노 땡스! [Python]
Fri, 31 Mar 2023 11:19:26 GMT
import sys

n = int(input())
li = list(map(int, sys.stdin.readline().split()))

sum = li[0]
for i in range(1,n):
    if(li[i] - li[i-1] == 1): continue
    else:
        sum += li[i]

print(sum)
2023-03-31



백준 23808 골뱅이 찍기 - ㅂ [Python]
Fri, 31 Mar 2023 10:54:58 GMT
li1 = ["@", " ", " ", " ", "@"]
li2 = ["@", " ", " ", " ", "@"]
li3 = ["@", "@", "@", "@", "@"]
li4 = ["@", " ", " ", " ", "@"]
li5 = ["@", "@", "@", "@", "@"]

n = int(input())
for i in range(n):
    for j in range(len(li1)):
        for k in range(n):
            print(li1[j], end="")
    print()

for i in range(n):
    for j in range(len(li2)):
        for k in range(n):
            print(li2[j], end="")
    print()

for i in range(n):
    for j in range(len(li3)):
        for k in range(n):
            print(li3[j], end="")
    print()

for i in range(n):
    for j in range(len(li4)):
        for k in range(n):
            print(li4[j], end="")
    print()

for i in range(n):
    for j in range(len(li5)):
        for k in range(n):
            print(li5[j], end="")
    print()
2023-03-31