SQL
#입양 시각 구하기(1)
SELECT DATE_FORMAT(DATETIME,'%H') HOUR,
COUNT(*) COUNT
FROM ANIMAL_OUTS
WHERE DATE_FORMAT(DATETIME,'%H') BETWEEN 9 AND 19
GROUP BY 1
ORDER BY 1
#DATETIME에서 DATE로 형 변환
SELECT ANIMAL_ID,
NAME,
DATE_FORMAT(DATETIME,'%Y-%m-%d') AS '날짜'
FROM ANIMAL_INS
ORDER BY ANIMAL_ID
#가격이 제일 비싼 식품의 정보 출력하기
SELECT PRODUCT_ID,
PRODUCT_NAME,
PRODUCT_CD,
CATEGORY,
PRICE
FROM FOOD_PRODUCT
ORDER BY PRICE DESC
LIMIT 1
#3월에 태어난 여성 회원 목록 출력하기
SELECT MEMBER_ID,
MEMBER_NAME,
GENDER,
DATE_FORMAT(DATE_OF_BIRTH,'%Y-%m-%d') DATE_OF_BIRTH
FROM MEMBER_PROFILE
WHERE MONTH(DATE_OF_BIRTH) = '03'
AND GENDER = 'W'
AND TLNO IS NOT NULL
ORDER BY MEMBER_ID
#카테고리 별 상품 개수 구하기
SELECT LEFT(PRODUCT_CODE,2) AS CATEGORY,
COUNT(*) PRODUCTS
FROM PRODUCT
GROUP BY 1
ORDER BY PRODUCT_CODE
파이썬퀘스트
#스파르타 자판기
print("사이다 1,700원")
print("콜라 1,900원")
print("식혜 2,500원")
print("솔의눈 3,000원")
menu = {'사이다':1700, '콜라':1900, '식혜':2500, '솔의눈':3000}
drink = input()
if drink in list(menu.keys()):
money = int(input())
if menu[drink] > money:
print("돈이 부족합니다.")
else:
change = money - menu[drink]
print(f'{change}원')
else:
quit()
#단어맞추기게임
import string
import random
letter = string.ascii_uppercase
computer = random.sample(letter, 7)
computer = ''.join(computer)
print("알파벳을 입력하세요 (한 글자만)")
life = 9
found_letters = []
tried_letters = []
while life > 0 and len(found_letters) < len(computer):
user = input().upper()
if not user.isalpha() or len(user) != 1:
print("한 글자의 알파벳만 입력하세요.")
continue
if user in tried_letters:
print("이미 시도한 알파벳입니다.")
continue
tried_letters.append(user)
if user in computer and user not in found_letters:
found_letters.append(user)
for i in range(len(computer)):
if user == computer[i]:
print(i + 1)
break
print("찾은 알파벳:", found_letters)
else:
life -= 1
print("틀렸습니다! 남은 목숨:", life)
if life == 0:
print("Game Over")
print(f'정답 = {computer}')
else:
print("축하합니다. 정답입니다!")
print(f'정답 = {computer}')'TIL' 카테고리의 다른 글
| [TIL] 최빈값 찾기 (2) | 2024.11.25 |
|---|---|
| [TIL] 241122 (1) | 2024.11.22 |
| [TIL] 241120 (2) | 2024.11.20 |
| [TIL] 241119 (1) | 2024.11.19 |
| [TIL] 241118 (2) | 2024.11.18 |