숫자야구게임 Lv1
String word = "apple";
word.charAt(0); // a 반환
String str = "hello world";
int index = str.indexOf('w'); //6 반환
https://school.programmers.co.kr/learn/courses/30/lessons/144854
SELECT B.BOOK_ID, A.AUTHOR_NAME, DATE_FORMAT(B.PUBLISHED_DATE, '%Y-%m-%d') AS PUBLISHED_DATE
FROM BOOK B
JOIN AUTHOR A ON B.AUTHOR_ID = A.AUTHOR_ID
WHERE B.CATEGORY = '경제'
ORDER BY B.PUBLISHED_DATE ASC;
https://school.programmers.co.kr/learn/courses/30/lessons/59045
SELECT I.ANIMAL_ID,I.ANIMAL_TYPE,I.NAME
FROM ANIMAL_INS I
JOIN ANIMAL_OUTS O ON I.ANIMAL_ID=O.ANIMAL_ID
WHERE I.SEX_UPON_INTAKE LIKE '%Intact%'
AND (O.SEX_UPON_OUTCOME LIKE '%Spayed%'or O.SEX_UPON_OUTCOME LIKE '%Neutered%');
https://school.programmers.co.kr/learn/courses/30/lessons/12940
def solution(n, m):
gcd = 1
for i in range(1, min(n, m) + 1):
if n % i == 0 and m % i == 0:
gcd = i
lcm = (n * m) // gcd
return [gcd, lcm]
-> math 모듈에 있는 gcd 함수,lcm함수 사용하면 됨
def gcdlcm(n, m):
g = gcd(n,m) // 최대공약수반환
l = lcm(n,m) // 최소공배수반환
return [g,l]