본문 바로가기

전체 글625

leetcode : 1148. Article Views I leetcode : 1148. Article Views I[leetcode : 1148. Article Views I]다이어그램erDiagram VIEWS { int article_id int author_id int viewer_id date view_date }목표저자가 자신의 논문 본 로그있으면 추출문제 풀이MySQL-- Solution 1SELECT DISTINCT(AUTHOR_ID) AS IDFROM VIEWSWHERE AUTHOR_ID = VIEWER_IDORDER BY ID ASCSolution 1DISTINCT로 중복값 제거하기Pandas# Solution 1def article_views(views: pd.DataFrame) .. 2025. 1. 15.
leetcode : 1141. User Activity for the Past 30 Days I leetcode : 1141. User Activity for the Past 30 Days I[leetcode : 1141. User Activity for the Past 30 Days I]다이어그램erDiagram UserActivity { int user_id int session_id date activity_date enum activity_type }목표2019 1분기에만 팔린 제품 구하기MySQL-- Solution 1WITH GROUPED AS ( SELECT ACTIVITY_DATE AS `DAY`, COUNT(DISTINCT USER_ID) AS ACTIVE_USERS FROM ACTIVITY GROUP BY.. 2025. 1. 14.
leetcode : 1084. Sales Analysis III leetcode : 1084. Sales Analysis III[leetcode : 1084. Sales Analysis III]다이어그램erDiagram Products { int product_id PK varchar product_name int unit_price } Sales { int seller_id int product_id FK int buyer_id date sale_date int quantity int price } Products ||--o{ Sales : has목표2019 1분기에만 팔린 제품 구하기문제 풀이MySQL-- Solution 1S.. 2025. 1. 14.
[파이썬] 백준 12886 : 돌 그룹 (12886) [파이썬] 백준 12886 : 돌 그룹 (12886)https://www.acmicpc.net/problem/12886풀이방향성 생각$O((a+b+c)^3)$가 꽤 큰 숫자라서, 대충 3차원 리스트나 set 사용하면 TLE 발생한다.두 수로 나머지 한 수를 알수 있다는 점을 이용해서 풀이. 전체코드from collections import dequea,b,c = map(int,input().split())find = 0s = a+b+cif s%3 == 0: # 2차원 배열 min max 생성 V = [[False]*(s+1) for _ in range(s+1)] V[min([a,b,c])][max([a,b,c])] = True Q = deque([(a,b,c)]) while Q.. 2025. 1. 13.

티스토리툴바