├── README.md ├── 백준 ├── Bronze │ ├── 1000. A＋B │ │ ├── A＋B.cc │ │ └── README.md │ ├── 1001. A－B │ │ ├── A－B.cc │ │ └── README.md │ ├── 10039. 평균 점수 │ │ ├── README.md │ │ └── 평균 점수.c │ ├── 1008. A／B │ │ ├── A／B.cc │ │ └── README.md │ ├── 10101. 삼각형 외우기 │ │ ├── README.md │ │ └── 삼각형 외우기.c │ ├── 10156. 과자 │ │ ├── README.md │ │ └── 과자.c │ ├── 10170. NFC West vs North │ │ ├── NFC West vs North.txt │ │ └── README.md │ ├── 10171. 고양이 │ │ ├── README.md │ │ └── 고양이.cc │ ├── 10172. 개 │ │ ├── README.md │ │ └── 개.cc │ ├── 10189. Hook │ │ ├── Hook.cc │ │ └── README.md │ ├── 10430. 나머지 │ │ ├── README.md │ │ └── 나머지.cc │ ├── 10480. Oddities │ │ ├── Oddities.cc │ │ └── README.md │ ├── 10699. 오늘 날짜 │ │ ├── README.md │ │ └── 오늘 날짜.c │ ├── 10718. We love kriii │ │ ├── README.md │ │ └── We love kriii.cc │ ├── 10757. 큰 수 A＋B │ │ ├── README.md │ │ └── 큰 수 A＋B.py │ ├── 10768. 특별한 날 │ │ ├── README.md │ │ └── 특별한 날.c │ ├── 10797. 10부제 │ │ ├── 10부제.c │ │ └── README.md │ ├── 10798. 세로읽기 │ │ ├── README.md │ │ └── 세로읽기.cc │ ├── 10807. 개수 세기 │ │ ├── README.md │ │ └── 개수 세기.c │ ├── 10808. 알파벳 개수 │ │ ├── README.md │ │ └── 알파벳 개수.c │ ├── 10809. 알파벳 찾기 │ │ ├── README.md │ │ └── 알파벳 찾기.c │ ├── 10811. 바구니 뒤집기 │ │ ├── README.md │ │ └── 바구니 뒤집기.cc │ ├── 10817. 세 수 │ │ ├── README.md │ │ └── 세 수.c │ ├── 10818. 최소， 최대 │ │ ├── README.md │ │ └── 최소， 최대.cc │ ├── 10869. 사칙연산 │ │ ├── README.md │ │ └── 사칙연산.cc │ ├── 10870. 피보나치 수 5 │ │ ├── README.md │ │ └── 피보나치 수 5.cc │ ├── 10871. X보다 작은 수 │ │ ├── README.md │ │ └── X보다 작은 수.cc │ ├── 10872. 팩토리얼 │ │ ├── README.md │ │ └── 팩토리얼.c │ ├── 10886. 0 ＝ not cute ／ 1 ＝ cute │ │ ├── 0 ＝ not cute ／ 1 ＝ cute.c │ │ └── README.md │ ├── 10926. ？？！ │ │ ├── README.md │ │ └── ？？！.cc │ ├── 10950. A＋B － 3 │ │ ├── A＋B － 3.cc │ │ └── README.md │ ├── 10951. A＋B － 4 │ │ ├── A＋B － 4.cc │ │ └── README.md │ ├── 10952. A＋B － 5 │ │ ├── A＋B － 5.cc │ │ └── README.md │ ├── 10953. A＋B － 6 │ │ ├── A＋B － 6.c │ │ └── README.md │ ├── 10987. 모음의 개수 │ │ ├── README.md │ │ └── 모음의 개수.cc │ ├── 10989. 수 정렬하기 3 │ │ ├── README.md │ │ └── 수 정렬하기 3.cc │ ├── 10998. A×B │ │ ├── A×B.cc │ │ └── README.md │ ├── 11021. A＋B － 7 │ │ ├── A＋B － 7.cc │ │ └── README.md │ ├── 11022. A＋B － 8 │ │ ├── A＋B － 8.cc │ │ └── README.md │ ├── 11050. 이항 계수 1 │ │ ├── README.md │ │ └── 이항 계수 1.cc │ ├── 1110. 더하기 사이클 │ │ ├── README.md │ │ └── 더하기 사이클.cc │ ├── 11121. Communication Channels │ │ ├── Communication Channels.cc │ │ └── README.md │ ├── 11170. 0의 개수 │ │ ├── 0의 개수.cc │ │ └── README.md │ ├── 11257. IT Passport Examination │ │ ├── IT Passport Examination.cc │ │ └── README.md │ ├── 11282. 한글 │ │ ├── README.md │ │ └── 한글.py │ ├── 11283. 한글 2 │ │ ├── README.md │ │ └── 한글 2.py │ ├── 11365. ！밀비 급일 │ │ ├── README.md │ │ └── ！밀비 급일.c │ ├── 11382. 꼬마 정민 │ │ ├── README.md │ │ └── 꼬마 정민.c │ ├── 1152. 단어의 개수 │ │ ├── README.md │ │ └── 단어의 개수.cc │ ├── 11549. Identifying tea │ │ ├── Identifying tea.cc │ │ └── README.md │ ├── 1157. 단어 공부 │ │ ├── README.md │ │ └── 단어 공부.cc │ ├── 11654. 아스키 코드 │ │ ├── README.md │ │ └── 아스키 코드.c │ ├── 11718. 그대로 출력하기 │ │ ├── README.md │ │ └── 그대로 출력하기.c │ ├── 11719. 그대로 출력하기 2 │ │ ├── README.md │ │ └── 그대로 출력하기 2.cc │ ├── 11720. 숫자의 합 │ │ ├── README.md │ │ └── 숫자의 합.c │ ├── 11721. 열 개씩 끊어 출력하기 │ │ ├── README.md │ │ └── 열 개씩 끊어 출력하기.c │ ├── 11942. 고려대는 사랑입니다 │ │ ├── README.md │ │ └── 고려대는 사랑입니다.go │ ├── 11943. 파일 옮기기 │ │ ├── README.md │ │ └── 파일 옮기기.c │ ├── 11945. 뜨거운 붕어빵 │ │ ├── README.md │ │ └── 뜨거운 붕어빵.cc │ ├── 11948. 과목선택 │ │ ├── README.md │ │ └── 과목선택.c │ ├── 11966. 2의 제곱인가？ │ │ ├── 2의 제곱인가？.cc │ │ └── README.md │ ├── 1259. 팰린드롬수 │ │ ├── README.md │ │ └── 팰린드롬수.cc │ ├── 1264. 모음의 개수 │ │ ├── README.md │ │ └── 모음의 개수.c │ ├── 1271. 엄청난 부자2 │ │ ├── README.md │ │ └── 엄청난 부자2.py │ ├── 12833. XORXORXOR │ │ ├── README.md │ │ └── XORXORXOR.cc │ ├── 13118. 뉴턴과 사과 │ │ ├── README.md │ │ └── 뉴턴과 사과.cc │ ├── 13136. Do Not Touch Anything │ │ ├── Do Not Touch Anything.cc │ │ └── README.md │ ├── 13277. 큰 수 곱셈 │ │ ├── README.md │ │ └── 큰 수 곱셈.py │ ├── 1330. 두 수 비교하기 │ │ ├── README.md │ │ └── 두 수 비교하기.cc │ ├── 13580. Andando no tempo │ │ ├── Andando no tempo.cc │ │ └── README.md │ ├── 13597. Tri－du │ │ ├── README.md │ │ └── Tri－du.cc │ ├── 13752. 히스토그램 │ │ ├── README.md │ │ └── 히스토그램.c │ ├── 13866. 팀 나누기 │ │ ├── README.md │ │ └── 팀 나누기.cc │ ├── 13985. Equality │ │ ├── Equality.c │ │ └── README.md │ ├── 14038. Tournament Selection │ │ ├── README.md │ │ └── Tournament Selection.cc │ ├── 14065. Gorivo │ │ ├── Gorivo.cc │ │ └── README.md │ ├── 14173. Square Pasture │ │ ├── README.md │ │ └── Square Pasture.cc │ ├── 14337. Helicopter │ │ ├── Helicopter.vb │ │ └── README.md │ ├── 14470. 전자레인지 │ │ ├── README.md │ │ └── 전자레인지.c │ ├── 14489. 치킨 두 마리 （．．．） │ │ ├── README.md │ │ └── 치킨 두 마리 （．．．）.c │ ├── 1453. 피시방 알바 │ │ ├── README.md │ │ └── 피시방 알바.cc │ ├── 14581. 팬들에게 둘러싸인 홍준 │ │ ├── README.md │ │ └── 팬들에게 둘러싸인 홍준.go │ ├── 14645. 와이버스 부릉부릉 │ │ ├── README.md │ │ └── 와이버스 부릉부릉.go │ ├── 14652. 나는 행복합니다～ │ │ ├── README.md │ │ └── 나는 행복합니다～.c │ ├── 14656. 조교는 새디스트야！！ │ │ ├── README.md │ │ └── 조교는 새디스트야！！.cc │ ├── 14681. 사분면 고르기 │ │ ├── README.md │ │ └── 사분면 고르기.cc │ ├── 14928. 큰 수 （BIG） │ │ ├── README.md │ │ └── 큰 수 （BIG）.py │ ├── 15000. CAPS │ │ ├── CAPS.cc │ │ └── README.md │ ├── 15025. Judging Moose │ │ ├── Judging Moose.cc │ │ └── README.md │ ├── 15051. Máquina de café │ │ ├── Máquina de café.cc │ │ └── README.md │ ├── 15059. Hard choice │ │ ├── Hard choice.cc │ │ └── README.md │ ├── 15080. Every Second Counts │ │ ├── Every Second Counts.cc │ │ └── README.md │ ├── 15128. Congruent Numbers │ │ ├── Congruent Numbers.cc │ │ └── README.md │ ├── 15232. Rectangles │ │ ├── README.md │ │ └── Rectangles.cc │ ├── 15372. A Simple Problem． │ │ ├── A Simple Problem．.py │ │ └── README.md │ ├── 15439. Vera and Outfits │ │ ├── README.md │ │ └── Vera and Outfits.cc │ ├── 1546. 평균 │ │ ├── README.md │ │ └── 평균.cc │ ├── 15474. 鉛筆 （Pencils） │ │ ├── README.md │ │ └── 鉛筆 （Pencils）.cc │ ├── 15552. 빠른 A＋B │ │ ├── README.md │ │ └── 빠른 A＋B.cc │ ├── 15596. 정수 N개의 합 │ │ ├── README.md │ │ └── 정수 N개의 합.c │ ├── 15610. Abbey Courtyard │ │ ├── Abbey Courtyard.cc │ │ └── README.md │ ├── 15680. 연세대학교 │ │ ├── README.md │ │ └── 연세대학교.c │ ├── 15700. 타일 채우기 4 │ │ ├── README.md │ │ └── 타일 채우기 4.c │ ├── 15726. 이칙연산 │ │ ├── README.md │ │ └── 이칙연산.cc │ ├── 15727. 조별과제를 하려는데 조장이 사라졌다 │ │ ├── README.md │ │ └── 조별과제를 하려는데 조장이 사라졌다.c │ ├── 15733. 나는 누구인가 │ │ ├── README.md │ │ └── 나는 누구인가.go │ ├── 15740. A＋B － 9 │ │ ├── A＋B － 9.py │ │ └── README.md │ ├── 15873. 공백 없는 A＋B │ │ ├── README.md │ │ └── 공백 없는 A＋B.c │ ├── 15921. 수찬은 마린보이야！！ │ │ ├── README.md │ │ └── 수찬은 마린보이야！！.cc │ ├── 15962. 새로운 시작 │ │ ├── README.md │ │ └── 새로운 시작.go │ ├── 15963. CASIO │ │ ├── CASIO.cc │ │ └── README.md │ ├── 15964. 이상한 기호 │ │ ├── README.md │ │ └── 이상한 기호.c │ ├── 16017. Telemarketer or not？ │ │ ├── README.md │ │ └── Telemarketer or not？.cc │ ├── 16099. Larger Sport Facility │ │ ├── Larger Sport Facility.cc │ │ └── README.md │ ├── 16170. 오늘의 날짜는？ │ │ ├── README.md │ │ └── 오늘의 날짜는？.go │ ├── 16199. 나이 계산하기 │ │ ├── README.md │ │ └── 나이 계산하기.cc │ ├── 16204. 카드 뽑기 │ │ ├── README.md │ │ └── 카드 뽑기.c │ ├── 16394. 홍익대학교 │ │ ├── README.md │ │ └── 홍익대학교.c │ ├── 16430. 제리와 톰 │ │ ├── README.md │ │ └── 제리와 톰.c │ ├── 16486. 운동장 한 바퀴 │ │ ├── README.md │ │ └── 운동장 한 바퀴.cc │ ├── 16600. Contemporary Art │ │ ├── Contemporary Art.cc │ │ └── README.md │ ├── 16693. Pizza Deal │ │ ├── Pizza Deal.cc │ │ └── README.md │ ├── 16727. ICPC │ │ ├── ICPC.cc │ │ └── README.md │ ├── 17009. Winning Score │ │ ├── README.md │ │ └── Winning Score.cc │ ├── 1712. 손익분기점 │ │ ├── README.md │ │ └── 손익분기점.c │ ├── 17256. 달달함이 넘쳐흘러 │ │ ├── README.md │ │ └── 달달함이 넘쳐흘러.c │ ├── 17295. 엔드게임 스포일러 │ │ ├── README.md │ │ └── 엔드게임 스포일러.go │ ├── 17356. 욱 제 │ │ ├── README.md │ │ └── 욱 제.cc │ ├── 17362. 수학은 체육과목 입니다 2 │ │ ├── README.md │ │ └── 수학은 체육과목 입니다 2.cc │ ├── 17388. 와글와글 숭고한 │ │ ├── README.md │ │ └── 와글와글 숭고한.c │ ├── 17608. 막대기 │ │ ├── README.md │ │ └── 막대기.cc │ ├── 17614. 369 │ │ ├── 369.cc │ │ └── README.md │ ├── 17863. FYI │ │ ├── FYI.cc │ │ └── README.md │ ├── 17874. Piece of Cake！ │ │ ├── Piece of Cake！.cc │ │ └── README.md │ ├── 1809. Moo │ │ ├── Moo.gs │ │ └── README.md │ ├── 18096. Арифметическая магия │ │ ├── README.md │ │ └── Арифметическая магия.cc │ ├── 18108. 1998년생인 내가 태국에서는 2541년생？！ │ │ ├── 1998년생인 내가 태국에서는 2541년생？！.cc │ │ └── README.md │ ├── 18198. Basketball One－on－One │ │ ├── Basketball One－on－One.cc │ │ └── README.md │ ├── 18301. Rats │ │ ├── README.md │ │ └── Rats.cc │ ├── 18330. Petrol │ │ ├── Petrol.cc │ │ └── README.md │ ├── 18398. HOMWRK │ │ ├── HOMWRK.cc │ │ └── README.md │ ├── 18408. 3 つの整数 （Three Integers） │ │ ├── 3 つの整数 （Three Integers）.cc │ │ └── README.md │ ├── 18409. 母音を数える （Counting Vowels） │ │ ├── README.md │ │ └── 母音を数える （Counting Vowels）.cc │ ├── 18411. 試験 （Exam） │ │ ├── README.md │ │ └── 試験 （Exam）.cc │ ├── 18414. X に最も近い値 （The Nearest Value） │ │ ├── README.md │ │ └── X に最も近い値 （The Nearest Value）.cc │ ├── 18698. The Walking Adam │ │ ├── README.md │ │ └── The Walking Adam.cc │ ├── 1934. 최소공배수 │ │ ├── README.md │ │ └── 최소공배수.cc │ ├── 19602. Dog Treats │ │ ├── Dog Treats.cc │ │ └── README.md │ ├── 19698. 헛간 청약 │ │ ├── README.md │ │ └── 헛간 청약.cc │ ├── 19944. 뉴비의 기준은 뭘까？ │ │ ├── README.md │ │ └── 뉴비의 기준은 뭘까？.cc │ ├── 2010. 플러그 │ │ ├── README.md │ │ └── 플러그.cc │ ├── 20215. Cutting Corners │ │ ├── Cutting Corners.cc │ │ └── README.md │ ├── 20232. Archivist │ │ ├── Archivist.cc │ │ └── README.md │ ├── 20233. Bicycle │ │ ├── Bicycle.cc │ │ └── README.md │ ├── 20254. Site Score │ │ ├── README.md │ │ └── Site Score.c │ ├── 20352. Circus │ │ ├── Circus.cc │ │ └── README.md │ ├── 20353. Atrium │ │ ├── Atrium.cc │ │ └── README.md │ ├── 20492. 세금 │ │ ├── README.md │ │ └── 세금.c │ ├── 20499. Darius님 한타 안 함？ │ │ ├── Darius님 한타 안 함？.c │ │ └── README.md │ ├── 20673. Covid－19 │ │ ├── Covid－19.cc │ │ └── README.md │ ├── 2083. 럭비 클럽 │ │ ├── README.md │ │ └── 럭비 클럽.c │ ├── 20833. Kuber │ │ ├── Kuber.cc │ │ └── README.md │ ├── 20976. 2 番目に大きい整数 （The Second Largest Integer） │ │ ├── 2 番目に大きい整数 （The Second Largest Integer）.cc │ │ └── README.md │ ├── 20977. JOI ソート （JOI Sort） │ │ ├── JOI ソート （JOI Sort）.cc │ │ └── README.md │ ├── 21300. Bottle Return │ │ ├── Bottle Return.c │ │ └── README.md │ ├── 21335. Another Eruption │ │ ├── Another Eruption.cc │ │ └── README.md │ ├── 21354. Äpplen och päron │ │ ├── README.md │ │ └── Äpplen och päron.cc │ ├── 21591. Laptop Sticker │ │ ├── Laptop Sticker.cc │ │ └── README.md │ ├── 21598. SciComLove │ │ ├── README.md │ │ └── SciComLove.c │ ├── 21612. Boiling Water │ │ ├── Boiling Water.cc │ │ └── README.md │ ├── 21633. Bank Transfer │ │ ├── Bank Transfer.cc │ │ └── README.md │ ├── 21638. SMS from MCHS │ │ ├── README.md │ │ └── SMS from MCHS.cc │ ├── 21665. Миша и негатив │ │ ├── README.md │ │ └── Миша и негатив.cc │ ├── 21964. 선린인터넷고등학교 교가 │ │ ├── README.md │ │ └── 선린인터넷고등학교 교가.c │ ├── 22015. 金平糖 （Konpeito） │ │ ├── README.md │ │ └── 金平糖 （Konpeito）.cc │ ├── 22155. Простая задача │ │ ├── README.md │ │ └── Простая задача.cc │ ├── 22193. Multiply │ │ ├── Multiply.py │ │ └── README.md │ ├── 2231. 분해합 │ │ ├── README.md │ │ └── 분해합.cc │ ├── 2309. 일곱 난쟁이 │ │ ├── README.md │ │ └── 일곱 난쟁이.cc │ ├── 23234. The World Responds │ │ ├── README.md │ │ └── The World Responds.c │ ├── 23235. The Fastest Sorting Algorithm In The World │ │ ├── README.md │ │ └── The Fastest Sorting Algorithm In The World.cc │ ├── 23348. 스트릿 코딩 파이터 │ │ ├── README.md │ │ └── 스트릿 코딩 파이터.cc │ ├── 2338. 긴자리 계산 │ │ ├── README.md │ │ └── 긴자리 계산.py │ ├── 2372. Livestock Count │ │ ├── Livestock Count.ada │ │ └── README.md │ ├── 2377. Pottery │ │ ├── Pottery.bas │ │ └── README.md │ ├── 23795. 사장님 도박은 재미로 하셔야 합니다 │ │ ├── README.md │ │ └── 사장님 도박은 재미로 하셔야 합니다.c │ ├── 23825. SASA 모형을 만들어보자 │ │ ├── README.md │ │ └── SASA 모형을 만들어보자.cc │ ├── 2393. Rook │ │ ├── README.md │ │ └── Rook.cob │ ├── 24072. 帰省 （Homecoming） │ │ ├── README.md │ │ └── 帰省 （Homecoming）.cc │ ├── 24075. 計算 （Calculation） │ │ ├── README.md │ │ └── 計算 （Calculation）.cc │ ├── 24078. 余り （Remainder） │ │ ├── README.md │ │ └── 余り （Remainder）.c │ ├── 24079. 移動 （Moving） │ │ ├── README.md │ │ └── 移動 （Moving）.cc │ ├── 24082. 立方体 （Cube） │ │ ├── README.md │ │ └── 立方体 （Cube）.c │ ├── 24083. 短針 （Hour Hand） │ │ ├── README.md │ │ └── 短針 （Hour Hand）.cc │ ├── 24086. 身長 （Height） │ │ ├── README.md │ │ └── 身長 （Height）.c │ ├── 24087. アイスクリーム （Ice Cream） │ │ ├── README.md │ │ └── アイスクリーム （Ice Cream）.cc │ ├── 24183. Affischutskicket │ │ ├── Affischutskicket.cc │ │ └── README.md │ ├── 2420. 사파리월드 │ │ ├── README.md │ │ └── 사파리월드.c │ ├── 24262. 알고리즘 수업 － 알고리즘의 수행 시간 1 │ │ ├── README.md │ │ └── 알고리즘 수업 － 알고리즘의 수행 시간 1.c │ ├── 24294. ГРАДИНА │ │ ├── README.md │ │ └── ГРАДИНА.cc │ ├── 24309. РАВЕНСТВО │ │ ├── README.md │ │ └── РАВЕНСТВО.py │ ├── 24365. ПЧЕЛИЧКАТА МАЯ │ │ ├── README.md │ │ └── ПЧЕЛИЧКАТА МАЯ.cc │ ├── 2438. 별 찍기 － 1 │ │ ├── README.md │ │ └── 별 찍기 － 1.cc │ ├── 2439. 별 찍기 － 2 │ │ ├── README.md │ │ └── 별 찍기 － 2.cc │ ├── 2440. 별 찍기 － 3 │ │ ├── README.md │ │ └── 별 찍기 － 3.c │ ├── 2441. 별 찍기 － 4 │ │ ├── README.md │ │ └── 별 찍기 － 4.cc │ ├── 24416. 알고리즘 수업 － 피보나치 수 1 │ │ ├── README.md │ │ └── 알고리즘 수업 － 피보나치 수 1.cc │ ├── 2444. 별 찍기 － 7 │ │ ├── README.md │ │ └── 별 찍기 － 7.cc │ ├── 24568. Cupcake Party │ │ ├── Cupcake Party.cc │ │ └── README.md │ ├── 24723. 녹색거탑 │ │ ├── README.md │ │ └── 녹색거탑.c │ ├── 24736. Football Scoring │ │ ├── Football Scoring.cc │ │ └── README.md │ ├── 2475. 검증수 │ │ ├── README.md │ │ └── 검증수.cc │ ├── 24751. Betting │ │ ├── Betting.cc │ │ └── README.md │ ├── 2480. 주사위 세개 │ │ ├── README.md │ │ └── 주사위 세개.cc │ ├── 24860. Counting Antibodies │ │ ├── Counting Antibodies.cc │ │ └── README.md │ ├── 24883. 자동완성 │ │ ├── README.md │ │ └── 자동완성.c │ ├── 24900. 한별 찍기 │ │ ├── README.md │ │ └── 한별 찍기.txt │ ├── 25083. 새싹 │ │ ├── README.md │ │ └── 새싹.cc │ ├── 25191. 치킨댄스를 추는 곰곰이를 본 임스 │ │ ├── README.md │ │ └── 치킨댄스를 추는 곰곰이를 본 임스.c │ ├── 2523. 별 찍기 － 13 │ │ ├── README.md │ │ └── 별 찍기 － 13.cc │ ├── 25238. 가희와 방어율 무시 │ │ ├── README.md │ │ └── 가희와 방어율 무시.c │ ├── 2525. 오븐 시계 │ │ ├── README.md │ │ └── 오븐 시계.cc │ ├── 2530. 인공지능 시계 │ │ ├── README.md │ │ └── 인공지능 시계.cc │ ├── 25304. 영수증 │ │ ├── README.md │ │ └── 영수증.cc │ ├── 25305. 커트라인 │ │ ├── README.md │ │ └── 커트라인.cc │ ├── 25311. UCPC에서 가장 쉬운 문제 번호는？ │ │ ├── README.md │ │ └── UCPC에서 가장 쉬운 문제 번호는？.c │ ├── 25314. 코딩은 체육과목 입니다 │ │ ├── README.md │ │ └── 코딩은 체육과목 입니다.c │ ├── 25372. 성택이의 은밀한 비밀번호 │ │ ├── README.md │ │ └── 성택이의 은밀한 비밀번호.c │ ├── 25377. 빵 │ │ ├── README.md │ │ └── 빵.cc │ ├── 25494. 단순한 문제 （Small） │ │ ├── README.md │ │ └── 단순한 문제 （Small）.c │ ├── 2557. Hello World │ │ ├── Hello World.cc │ │ └── README.md │ ├── 2558. A＋B － 2 │ │ ├── A＋B － 2.c │ │ └── README.md │ ├── 25591. 푸앙이와 종윤이 │ │ ├── README.md │ │ └── 푸앙이와 종윤이.cc │ ├── 25600. Triathlon │ │ ├── README.md │ │ └── Triathlon.cc │ ├── 2562. 최댓값 │ │ ├── README.md │ │ └── 최댓값.cc │ ├── 25625. 샤틀버스 │ │ ├── README.md │ │ └── 샤틀버스.c │ ├── 25628. 햄버거 만들기 │ │ ├── README.md │ │ └── 햄버거 만들기.c │ ├── 25640. MBTI │ │ ├── MBTI.go │ │ └── README.md │ ├── 25703. 포인터 공부 │ │ ├── README.md │ │ └── 포인터 공부.c │ ├── 25704. 출석 이벤트 │ │ ├── README.md │ │ └── 출석 이벤트.c │ ├── 2576. 홀수 │ │ ├── README.md │ │ └── 홀수.cc │ ├── 2577. 숫자의 개수 │ │ ├── README.md │ │ └── 숫자의 개수.cc │ ├── 25784. Easy－to－Solve Expressions │ │ ├── Easy－to－Solve Expressions.cc │ │ └── README.md │ ├── 2587. 대표값2 │ │ ├── README.md │ │ └── 대표값2.cc │ ├── 2588. 곱셈 │ │ ├── README.md │ │ └── 곱셈.cc │ ├── 25881. Electric Bill │ │ ├── Electric Bill.cc │ │ └── README.md │ ├── 25893. Majestic 10 │ │ ├── Majestic 10.cc │ │ └── README.md │ ├── 26068. 치킨댄스를 추는 곰곰이를 본 임스 2 │ │ ├── README.md │ │ └── 치킨댄스를 추는 곰곰이를 본 임스 2.cc │ ├── 26082. WARBOY │ │ ├── README.md │ │ └── WARBOY.c │ ├── 2609. 최대공약수와 최소공배수 │ │ ├── README.md │ │ └── 최대공약수와 최소공배수.cc │ ├── 26209. Intercepting Information │ │ ├── Intercepting Information.cc │ │ └── README.md │ ├── 26307. Correct │ │ ├── Correct.cc │ │ └── README.md │ ├── 26332. Buying in Bulk │ │ ├── Buying in Bulk.cc │ │ └── README.md │ ├── 26350. Good Coin Denomination │ │ ├── Good Coin Denomination.cc │ │ └── README.md │ ├── 26489. Gum Gum for Jay Jay │ │ ├── Gum Gum for Jay Jay.cc │ │ └── README.md │ ├── 26531. Simple Sum │ │ ├── README.md │ │ └── Simple Sum.cc │ ├── 26545. Mathematics │ │ ├── Mathematics.cc │ │ └── README.md │ ├── 26566. Pizza │ │ ├── Pizza.cc │ │ └── README.md │ ├── 26574. Copier │ │ ├── Copier.cc │ │ └── README.md │ ├── 26575. Pups │ │ ├── Pups.cc │ │ └── README.md │ ├── 26711. A＋B │ │ ├── A＋B.py │ │ └── README.md │ ├── 26731. Zagubiona litera │ │ ├── README.md │ │ └── Zagubiona litera.cc │ ├── 26742. Skarpetki │ │ ├── README.md │ │ └── Skarpetki.cc │ ├── 2675. 문자열 반복 │ │ ├── README.md │ │ └── 문자열 반복.cc │ ├── 26766. Serca │ │ ├── README.md │ │ └── Serca.cc │ ├── 26768. H4x0r │ │ ├── H4x0r.cc │ │ └── README.md │ ├── 26772. Poziome serca │ │ ├── Poziome serca.cc │ │ └── README.md │ ├── 2693. N번째 큰 수 │ │ ├── N번째 큰 수.cc │ │ └── README.md │ ├── 27110. 특식 배부 │ │ ├── README.md │ │ └── 특식 배부.cc │ ├── 27182. Rain Diary │ │ ├── README.md │ │ └── Rain Diary.cc │ ├── 27213. Граничные клетки │ │ ├── README.md │ │ └── Граничные клетки.cc │ ├── 27219. Робинзон Крузо │ │ ├── README.md │ │ └── Робинзон Крузо.cc │ ├── 27257. Любитель нулей │ │ ├── README.md │ │ └── Любитель нулей.cc │ ├── 27294. 몇개고？ │ │ ├── README.md │ │ └── 몇개고？.cc │ ├── 27310. ：chino＿shock： │ │ ├── README.md │ │ └── ：chino＿shock：.c │ ├── 27323. 長方形 （Rectangle） │ │ ├── README.md │ │ └── 長方形 （Rectangle）.cc │ ├── 27324. ゾロ目 （Same Numbers） │ │ ├── README.md │ │ └── ゾロ目 （Same Numbers）.cc │ ├── 27327. 時間 （Hour） │ │ ├── README.md │ │ └── 時間 （Hour）.cc │ ├── 27328. 三方比較 （Three－Way Comparison） │ │ ├── README.md │ │ └── 三方比較 （Three－Way Comparison）.cc │ ├── 27331. 2 桁の整数 （Two－digit Integer） │ │ ├── 2 桁の整数 （Two－digit Integer）.cc │ │ └── README.md │ ├── 27332. 11 月 （November） │ │ ├── 11 月 （November）.cc │ │ └── README.md │ ├── 2738. 행렬 덧셈 │ │ ├── README.md │ │ └── 행렬 덧셈.c │ ├── 27389. Metronome │ │ ├── Metronome.cc │ │ └── README.md │ ├── 2739. 구구단 │ │ ├── README.md │ │ └── 구구단.cc │ ├── 2741. N 찍기 │ │ ├── N 찍기.cc │ │ └── README.md │ ├── 2742. 기찍 N │ │ ├── README.md │ │ └── 기찍 N.cc │ ├── 2743. 단어 길이 재기 │ │ ├── README.md │ │ └── 단어 길이 재기.c │ ├── 27433. 팩토리얼 2 │ │ ├── README.md │ │ └── 팩토리얼 2.cc │ ├── 27434. 팩토리얼 3 │ │ ├── README.md │ │ └── 팩토리얼 3.py │ ├── 2744. 대소문자 바꾸기 │ │ ├── README.md │ │ └── 대소문자 바꾸기.c │ ├── 2747. 피보나치 수 │ │ ├── README.md │ │ └── 피보나치 수.cc │ ├── 2748. 피보나치 수 2 │ │ ├── README.md │ │ └── 피보나치 수 2.cc │ ├── 2750. 수 정렬하기 │ │ ├── README.md │ │ └── 수 정렬하기.cc │ ├── 2752. 세수정렬 │ │ ├── README.md │ │ └── 세수정렬.c │ ├── 2753. 윤년 │ │ ├── README.md │ │ └── 윤년.cc │ ├── 2754. 학점계산 │ │ ├── README.md │ │ └── 학점계산.c │ ├── 27866. 문자와 문자열 │ │ ├── README.md │ │ └── 문자와 문자열.cc │ ├── 27889. 특별한 학교 이름 │ │ ├── README.md │ │ └── 특별한 학교 이름.cc │ ├── 27890. 특별한 작은 분수 │ │ ├── README.md │ │ └── 특별한 작은 분수.cc │ ├── 27918. 탁구 경기 │ │ ├── README.md │ │ └── 탁구 경기.cc │ ├── 27959. 초코바 │ │ ├── README.md │ │ └── 초코바.cc │ ├── 27960. 사격 내기 │ │ ├── README.md │ │ └── 사격 내기.cc │ ├── 27961. 고양이는 많을수록 좋다 │ │ ├── README.md │ │ └── 고양이는 많을수록 좋다.cc │ ├── 27962. 오렌지먹은지오랜지 │ │ ├── README.md │ │ └── 오렌지먹은지오랜지.cc │ ├── 27963. 합금 주화 │ │ ├── README.md │ │ └── 합금 주화.cc │ ├── 2798. 블랙잭 │ │ ├── README.md │ │ └── 블랙잭.cc │ ├── 28061. 레몬 따기 │ │ ├── README.md │ │ └── 레몬 따기.cc │ ├── 28062. 준석이의 사탕 사기 │ │ ├── README.md │ │ └── 준석이의 사탕 사기.cc │ ├── 28063. 동전 복사 │ │ ├── README.md │ │ └── 동전 복사.cc │ ├── 28074. 모비스 │ │ ├── README.md │ │ └── 모비스.cc │ ├── 28113. 정보섬의 대중교통 │ │ ├── README.md │ │ └── 정보섬의 대중교통.cc │ ├── 28235. 코드마스터 2023 │ │ ├── README.md │ │ └── 코드마스터 2023.cc │ ├── 28236. 점심시간 레이스 │ │ ├── README.md │ │ └── 점심시간 레이스.cc │ ├── 28431. 양말 짝 맞추기 │ │ ├── README.md │ │ └── 양말 짝 맞추기.cc │ ├── 2845. 파티가 끝나고 난 뒤 │ │ ├── README.md │ │ └── 파티가 끝나고 난 뒤.c │ ├── 2857. FBI │ │ ├── FBI.cc │ │ └── README.md │ ├── 2869. 달팽이는 올라가고 싶다 │ │ ├── README.md │ │ └── 달팽이는 올라가고 싶다.c │ ├── 28691. 정보보호학부 동아리 소개 │ │ ├── README.md │ │ └── 정보보호학부 동아리 소개.cc │ ├── 2884. 알람 시계 │ │ ├── README.md │ │ └── 알람 시계.cc │ ├── 2908. 상수 │ │ ├── README.md │ │ └── 상수.cc │ ├── 2920. 음계 │ │ ├── README.md │ │ └── 음계.cc │ ├── 29751. 삼각형 │ │ ├── README.md │ │ └── 삼각형.cc │ ├── 30007. 라면 공식 │ │ ├── README.md │ │ └── 라면 공식.cc │ ├── 3003. 킹， 퀸， 룩， 비숍， 나이트， 폰 │ │ ├── README.md │ │ └── 킹， 퀸， 룩， 비숍， 나이트， 폰.c │ ├── 30030. 스위트콘 가격 구하기 │ │ ├── README.md │ │ └── 스위트콘 가격 구하기.cc │ ├── 30087. 진흥원 세미나 │ │ ├── README.md │ │ └── 진흥원 세미나.cc │ ├── 3046. R2 │ │ ├── R2.c │ │ └── README.md │ ├── 3052. 나머지 │ │ ├── README.md │ │ └── 나머지.cc │ ├── 3058. 짝수를 찾아라 │ │ ├── README.md │ │ └── 짝수를 찾아라.cc │ ├── 30676. 이 별은 무슨 색일까 │ │ ├── README.md │ │ └── 이 별은 무슨 색일까.cc │ ├── 31403. $A ＋ B － C$ │ │ ├── $A ＋ B － C$.cc │ │ └── README.md │ ├── 3733. Shares │ │ ├── README.md │ │ └── Shares.cc │ ├── 3765. Celebrity jeopardy │ │ ├── Celebrity jeopardy.cc │ │ └── README.md │ ├── 4101. 크냐？ │ │ ├── README.md │ │ └── 크냐？.c │ ├── 4150. 피보나치 수 │ │ ├── README.md │ │ └── 피보나치 수.py │ ├── 4153. 직각삼각형 │ │ ├── README.md │ │ └── 직각삼각형.c │ ├── 4299. AFC 윔블던 │ │ ├── AFC 윔블던.cc │ │ └── README.md │ ├── 4470. 줄번호 │ │ ├── README.md │ │ └── 줄번호.c │ ├── 4589. Gnome Sequencing │ │ ├── Gnome Sequencing.cc │ │ └── README.md │ ├── 4696. St． Ives │ │ ├── README.md │ │ └── St． Ives.cc │ ├── 4714. Lunacy │ │ ├── Lunacy.cc │ │ └── README.md │ ├── 4999. 아！ │ │ ├── README.md │ │ └── 아！.c │ ├── 5086. 배수와 약수 │ │ ├── README.md │ │ └── 배수와 약수.c │ ├── 5300. Fill the Rowboats！ │ │ ├── Fill the Rowboats！.cc │ │ └── README.md │ ├── 5337. 웰컴 │ │ ├── README.md │ │ └── 웰컴.txt │ ├── 5338. 마이크로소프트 로고 │ │ ├── README.md │ │ └── 마이크로소프트 로고.txt │ ├── 5339. 콜센터 │ │ ├── README.md │ │ └── 콜센터.txt │ ├── 5341. Pyramids │ │ ├── Pyramids.cc │ │ └── README.md │ ├── 5357. Dedupe │ │ ├── Dedupe.cc │ │ └── README.md │ ├── 5358. Football Team │ │ ├── Football Team.cc │ │ └── README.md │ ├── 5522. 카드 게임 │ │ ├── README.md │ │ └── 카드 게임.c │ ├── 5524. 입실 관리 │ │ ├── README.md │ │ └── 입실 관리.cc │ ├── 5532. 방학 숙제 │ │ ├── README.md │ │ └── 방학 숙제.c │ ├── 5543. 상근날드 │ │ ├── README.md │ │ └── 상근날드.c │ ├── 5554. 심부름 가는 길 │ │ ├── README.md │ │ └── 심부름 가는 길.c │ ├── 5575. 타임 카드 │ │ ├── README.md │ │ └── 타임 카드.cc │ ├── 5576. 콘테스트 │ │ ├── README.md │ │ └── 콘테스트.cc │ ├── 5596. 시험 점수 │ │ ├── README.md │ │ └── 시험 점수.c │ ├── 5597. 과제 안 내신 분．．？ │ │ ├── README.md │ │ └── 과제 안 내신 분．．？.c │ ├── 5717. 상근이의 친구들 │ │ ├── README.md │ │ └── 상근이의 친구들.go │ ├── 5928. Contest Timing │ │ ├── Contest Timing.cc │ │ └── README.md │ ├── 5988. 홀수일까 짝수일까 │ │ ├── README.md │ │ └── 홀수일까 짝수일까.cc │ ├── 6749. Next in line │ │ ├── Next in line.cc │ │ └── README.md │ ├── 6763. Speed fines are not fine！ │ │ ├── README.md │ │ └── Speed fines are not fine！.cc │ ├── 6764. Sounds fishy！ │ │ ├── README.md │ │ └── Sounds fishy！.cc │ ├── 6778. Which Alien？ │ │ ├── README.md │ │ └── Which Alien？.cc │ ├── 6810. ISBN │ │ ├── ISBN.cc │ │ └── README.md │ ├── 6825. Body Mass Index │ │ ├── Body Mass Index.cc │ │ └── README.md │ ├── 6840. Who is in the middle？ │ │ ├── README.md │ │ └── Who is in the middle？.cc │ ├── 6841. I Speak TXTMSG │ │ ├── I Speak TXTMSG.cc │ │ └── README.md │ ├── 6887. Squares │ │ ├── README.md │ │ └── Squares.cc │ ├── 6916. 0123456789 │ │ ├── 0123456789.cc │ │ └── README.md │ ├── 7287. 등록 │ │ ├── README.md │ │ └── 등록.c │ ├── 7489. 팩토리얼 │ │ ├── README.md │ │ └── 팩토리얼.cc │ ├── 7510. 고급 수학 │ │ ├── README.md │ │ └── 고급 수학.cc │ ├── 7595. Triangles │ │ ├── README.md │ │ └── Triangles.cc │ ├── 7891. Can you add this？ │ │ ├── Can you add this？.cc │ │ └── README.md │ ├── 8370. Plane │ │ ├── Plane.c │ │ └── README.md │ ├── 8393. 합 │ │ ├── README.md │ │ └── 합.cc │ ├── 8437. Julka │ │ ├── Julka.py │ │ └── README.md │ ├── 8545. Zadanie próbne │ │ ├── README.md │ │ └── Zadanie próbne.cc │ ├── 8558. Silnia │ │ ├── README.md │ │ └── Silnia.cc │ ├── 8674. Tabliczka │ │ ├── README.md │ │ └── Tabliczka.cc │ ├── 8710. Koszykarz │ │ ├── Koszykarz.cc │ │ └── README.md │ ├── 8715. Permutacja │ │ ├── Permutacja.cc │ │ └── README.md │ ├── 8718. Bałwanek │ │ ├── Bałwanek.cc │ │ └── README.md │ ├── 8723. Patyki │ │ ├── Patyki.cc │ │ └── README.md │ ├── 8760. Schronisko │ │ ├── README.md │ │ └── Schronisko.cc │ ├── 8871. Zadanie próbne 2 │ │ ├── README.md │ │ └── Zadanie próbne 2.cc │ ├── 8958. OX퀴즈 │ │ ├── OX퀴즈.c │ │ └── README.md │ ├── 9076. 점수 집계 │ │ ├── README.md │ │ └── 점수 집계.cc │ ├── 9086. 문자열 │ │ ├── README.md │ │ └── 문자열.c │ ├── 9316. Hello Judge │ │ ├── Hello Judge.c │ │ └── README.md │ ├── 9498. 시험 성적 │ │ ├── README.md │ │ └── 시험 성적.cc │ ├── 9653. 스타워즈 로고 │ │ ├── README.md │ │ └── 스타워즈 로고.txt │ ├── 9654. 나부 함대 데이터 │ │ ├── README.md │ │ └── 나부 함대 데이터.txt │ └── 9783. Easy Encryption │ │ ├── Easy Encryption.c │ │ └── README.md ├── Gold │ ├── 1016. 제곱 ㄴㄴ 수 │ │ ├── README.md │ │ └── 제곱 ㄴㄴ 수.cc │ ├── 1033. 칵테일 │ │ ├── README.md │ │ └── 칵테일.cc │ ├── 1041. 주사위 │ │ ├── README.md │ │ └── 주사위.cc │ ├── 1043. 거짓말 │ │ ├── README.md │ │ └── 거짓말.cc │ ├── 10986. 나머지 합 │ │ ├── README.md │ │ └── 나머지 합.cc │ ├── 11404. 플로이드 │ │ ├── README.md │ │ └── 플로이드.cc │ ├── 1167. 트리의 지름 │ │ ├── README.md │ │ └── 트리의 지름.cc │ ├── 11689. GCD（n， k） ＝ 1 │ │ ├── GCD（n， k） ＝ 1.cc │ │ └── README.md │ ├── 11729. 하노이 탑 이동 순서 │ │ ├── README.md │ │ └── 하노이 탑 이동 순서.cc │ ├── 11779. 최소비용 구하기 2 │ │ ├── README.md │ │ └── 최소비용 구하기 2.cc │ ├── 1197. 최소 스패닝 트리 │ │ ├── README.md │ │ └── 최소 스패닝 트리.cc │ ├── 1202. 보석 도둑 │ │ ├── README.md │ │ └── 보석 도둑.cc │ ├── 1238. 파티 │ │ ├── README.md │ │ └── 파티.cc │ ├── 1253. 좋다 │ │ ├── README.md │ │ └── 좋다.cc │ ├── 12865. 평범한 배낭 │ │ ├── README.md │ │ └── 평범한 배낭.cc │ ├── 1300. K번째 수 │ │ ├── K번째 수.cc │ │ └── README.md │ ├── 13023. ABCDE │ │ ├── ABCDE.cc │ │ └── README.md │ ├── 13459. 구슬 탈출 │ │ ├── README.md │ │ └── 구슬 탈출.cc │ ├── 13460. 구슬 탈출 2 │ │ ├── README.md │ │ └── 구슬 탈출 2.cc │ ├── 1377. 버블 소트 │ │ ├── README.md │ │ └── 버블 소트.cc │ ├── 14502. 연구소 │ │ ├── README.md │ │ └── 연구소.cc │ ├── 1456. 거의 소수 │ │ ├── README.md │ │ └── 거의 소수.cc │ ├── 14567. 선수과목 （Prerequisite） │ │ ├── README.md │ │ └── 선수과목 （Prerequisite）.cc │ ├── 1504. 특정한 최단 경로 │ │ ├── README.md │ │ └── 특정한 최단 경로.cc │ ├── 15644. 구슬 탈출 3 │ │ ├── README.md │ │ └── 구슬 탈출 3.cc │ ├── 15653. 구슬 탈출 4 │ │ ├── README.md │ │ └── 구슬 탈출 4.cc │ ├── 15717. 떡파이어 │ │ ├── README.md │ │ └── 떡파이어.cc │ ├── 15926. 현욱은 괄호왕이야！！ │ │ ├── README.md │ │ └── 현욱은 괄호왕이야！！.cc │ ├── 16120. PPAP │ │ ├── PPAP.cc │ │ └── README.md │ ├── 1647. 도시 분할 계획 │ │ ├── README.md │ │ └── 도시 분할 계획.cc │ ├── 1707. 이분 그래프 │ │ ├── README.md │ │ └── 이분 그래프.cc │ ├── 1715. 카드 정렬하기 │ │ ├── README.md │ │ └── 카드 정렬하기.cc │ ├── 1717. 집합의 표현 │ │ ├── README.md │ │ └── 집합의 표현.cc │ ├── 17298. 오큰수 │ │ ├── README.md │ │ └── 오큰수.cc │ ├── 1744. 수 묶기 │ │ ├── README.md │ │ └── 수 묶기.cc │ ├── 1753. 최단경로 │ │ ├── README.md │ │ └── 최단경로.cc │ ├── 1806. 부분합 │ │ ├── README.md │ │ └── 부분합.cc │ ├── 18291. 비요뜨의 징검다리 건너기 │ │ ├── README.md │ │ └── 비요뜨의 징검다리 건너기.cc │ ├── 1889. 선물 교환 │ │ ├── README.md │ │ └── 선물 교환.cc │ ├── 1914. 하노이 탑 │ │ ├── README.md │ │ └── 하노이 탑.cc │ ├── 1916. 최소비용 구하기 │ │ ├── README.md │ │ └── 최소비용 구하기.cc │ ├── 1922. 네트워크 연결 │ │ ├── README.md │ │ └── 네트워크 연결.cc │ ├── 1967. 트리의 지름 │ │ ├── README.md │ │ └── 트리의 지름.cc │ ├── 1976. 여행 가자 │ │ ├── README.md │ │ └── 여행 가자.cc │ ├── 2023. 신기한 소수 │ │ ├── README.md │ │ └── 신기한 소수.cc │ ├── 2096. 내려가기 │ │ ├── README.md │ │ └── 내려가기.cc │ ├── 2251. 물통 │ │ ├── README.md │ │ └── 물통.cc │ ├── 2252. 줄 세우기 │ │ ├── README.md │ │ └── 줄 세우기.cc │ ├── 24552. 올바른 괄호 │ │ ├── README.md │ │ └── 올바른 괄호.cc │ ├── 2637. 장난감 조립 │ │ ├── README.md │ │ └── 장난감 조립.cc │ ├── 27440. 1로 만들기 3 │ │ ├── 1로 만들기 3.cc │ │ └── README.md │ ├── 27892. 특별한 큰 분수 │ │ ├── README.md │ │ └── 특별한 큰 분수.cc │ ├── 28683. 피타！ 피타！ 피타츄！ │ │ ├── README.md │ │ └── 피타！ 피타！ 피타츄！.cc │ ├── 28703. Double It │ │ ├── Double It.cc │ │ └── README.md │ ├── 4233. 가짜소수 │ │ ├── README.md │ │ └── 가짜소수.cc │ ├── 4386. 별자리 만들기 │ │ ├── README.md │ │ └── 별자리 만들기.cc │ └── 6497. 전력난 │ │ ├── README.md │ │ └── 전력난.cc ├── Platinum │ ├── 11003. 최솟값 찾기 │ │ ├── README.md │ │ └── 최솟값 찾기.cc │ ├── 13319. 가짜 소수 │ │ ├── README.md │ │ └── 가짜 소수.cc │ ├── 14939. 불 끄기 │ │ ├── README.md │ │ └── 불 끄기.cc │ ├── 1517. 버블 소트 │ │ ├── README.md │ │ └── 버블 소트.cc │ ├── 16496. 큰 수 만들기 │ │ ├── README.md │ │ └── 큰 수 만들기.cc │ ├── 1854. K번째 최단경로 찾기 │ │ ├── K번째 최단경로 찾기.cc │ │ └── README.md │ ├── 1948. 임계경로 │ │ ├── README.md │ │ └── 임계경로.cc │ ├── 28068. I Am Knowledge │ │ ├── I Am Knowledge.cc │ │ └── README.md │ ├── 28704. Sum＝Product │ │ ├── README.md │ │ └── Sum＝Product.cc │ └── 2887. 행성 터널 │ │ ├── README.md │ │ └── 행성 터널.cc ├── Silver │ ├── 1003. 피보나치 함수 │ │ ├── README.md │ │ └── 피보나치 함수.cc │ ├── 1012. 유기농 배추 │ │ ├── README.md │ │ └── 유기농 배추.cc │ ├── 1018. 체스판 다시 칠하기 │ │ ├── README.md │ │ └── 체스판 다시 칠하기.cc │ ├── 1065. 한수 │ │ ├── README.md │ │ └── 한수.cc │ ├── 10773. 제로 │ │ ├── README.md │ │ └── 제로.c │ ├── 10814. 나이순 정렬 │ │ ├── README.md │ │ └── 나이순 정렬.cc │ ├── 10815. 숫자 카드 │ │ ├── README.md │ │ └── 숫자 카드.cc │ ├── 10826. 피보나치 수 4 │ │ ├── README.md │ │ └── 피보나치 수 4.py │ ├── 10828. 스택 │ │ ├── README.md │ │ └── 스택.c │ ├── 10845. 큐 │ │ ├── README.md │ │ └── 큐.cc │ ├── 10866. 덱 │ │ ├── README.md │ │ └── 덱.cc │ ├── 10867. 중복 빼고 정렬하기 │ │ ├── README.md │ │ └── 중복 빼고 정렬하기.cc │ ├── 11004. K번째 수 │ │ ├── K번째 수.cc │ │ └── README.md │ ├── 11047. 동전 0 │ │ ├── README.md │ │ └── 동전 0.cc │ ├── 11053. 가장 긴 증가하는 부분 수열 │ │ ├── README.md │ │ └── 가장 긴 증가하는 부분 수열.cc │ ├── 11279. 최대 힙 │ │ ├── README.md │ │ └── 최대 힙.cc │ ├── 11286. 절댓값 힙 │ │ ├── README.md │ │ └── 절댓값 힙.cc │ ├── 11399. ATM │ │ ├── ATM.cc │ │ └── README.md │ ├── 1149. RGB거리 │ │ ├── README.md │ │ └── RGB거리.cc │ ├── 1158. 요세푸스 문제 │ │ ├── README.md │ │ └── 요세푸스 문제.cc │ ├── 11659. 구간 합 구하기 4 │ │ ├── README.md │ │ └── 구간 합 구하기 4.cc │ ├── 11660. 구간 합 구하기 5 │ │ ├── README.md │ │ └── 구간 합 구하기 5.cc │ ├── 11723. 집합 │ │ ├── README.md │ │ └── 집합.cc │ ├── 11724. 연결 요소의 개수 │ │ ├── README.md │ │ └── 연결 요소의 개수.cc │ ├── 11725. 트리의 부모 찾기 │ │ ├── README.md │ │ └── 트리의 부모 찾기.cc │ ├── 11726. 2×n 타일링 │ │ ├── 2×n 타일링.cc │ │ └── README.md │ ├── 11728. 배열 합치기 │ │ ├── README.md │ │ └── 배열 합치기.cc │ ├── 1181. 단어 정렬 │ │ ├── README.md │ │ └── 단어 정렬.cc │ ├── 11819. The Shortest does not Mean the Simplest │ │ ├── README.md │ │ └── The Shortest does not Mean the Simplest.cc │ ├── 11931. 수 정렬하기 4 │ │ ├── README.md │ │ └── 수 정렬하기 4.cc │ ├── 1260. DFS와 BFS │ │ ├── DFS와 BFS.cc │ │ └── README.md │ ├── 12789. 도키도키 간식드리미 │ │ ├── README.md │ │ └── 도키도키 간식드리미.cc │ ├── 12891. DNA 비밀번호 │ │ ├── DNA 비밀번호.cc │ │ └── README.md │ ├── 1316. 그룹 단어 체커 │ │ ├── README.md │ │ └── 그룹 단어 체커.cc │ ├── 13171. A │ │ ├── A.cc │ │ └── README.md │ ├── 13241. 최소공배수 │ │ ├── README.md │ │ └── 최소공배수.cc │ ├── 1325. 효율적인 해킹 │ │ ├── README.md │ │ └── 효율적인 해킹.cc │ ├── 13301. 타일 장식물 │ │ ├── README.md │ │ └── 타일 장식물.cc │ ├── 13699. 점화식 │ │ ├── README.md │ │ └── 점화식.cc │ ├── 14235. 크리스마스 선물 │ │ ├── README.md │ │ └── 크리스마스 선물.cc │ ├── 1427. 소트인사이드 │ │ ├── README.md │ │ └── 소트인사이드.cc │ ├── 14495. 피보나치 비스무리한 수열 │ │ ├── README.md │ │ └── 피보나치 비스무리한 수열.cc │ ├── 1463. 1로 만들기 │ │ ├── 1로 만들기.cc │ │ └── README.md │ ├── 14916. 거스름돈 │ │ ├── README.md │ │ └── 거스름돈.cc │ ├── 1541. 잃어버린 괄호 │ │ ├── README.md │ │ └── 잃어버린 괄호.cc │ ├── 1564. 팩토리얼5 │ │ ├── README.md │ │ └── 팩토리얼5.cc │ ├── 15650. N과 M （2） │ │ ├── N과 M （2）.cc │ │ └── README.md │ ├── 15652. N과 M （4） │ │ ├── N과 M （4）.cc │ │ └── README.md │ ├── 15688. 수 정렬하기 5 │ │ ├── README.md │ │ └── 수 정렬하기 5.cc │ ├── 1620. 나는야 포켓몬 마스터 이다솜 │ │ ├── README.md │ │ └── 나는야 포켓몬 마스터 이다솜.cc │ ├── 16212. 정열적인 정렬 │ │ ├── README.md │ │ └── 정열적인 정렬.cc │ ├── 1629. 곱셈 │ │ ├── README.md │ │ └── 곱셈.cc │ ├── 16953. A → B │ │ ├── A → B.cc │ │ └── README.md │ ├── 16955. 오목， 이길 수 있을까？ │ │ ├── README.md │ │ └── 오목， 이길 수 있을까？.cc │ ├── 17219. 비밀번호 찾기 │ │ ├── README.md │ │ └── 비밀번호 찾기.cc │ ├── 1735. 분수 합 │ │ ├── README.md │ │ └── 분수 합.cc │ ├── 1747. 소수＆팰린드롬 │ │ ├── README.md │ │ └── 소수＆팰린드롬.cc │ ├── 1764. 듣보잡 │ │ ├── README.md │ │ └── 듣보잡.cc │ ├── 18258. 큐 2 │ │ ├── README.md │ │ └── 큐 2.c │ ├── 18352. 특정 거리의 도시 찾기 │ │ ├── README.md │ │ └── 특정 거리의 도시 찾기.cc │ ├── 1850. 최대공약수 │ │ ├── README.md │ │ └── 최대공약수.cc │ ├── 1874. 스택 수열 │ │ ├── README.md │ │ └── 스택 수열.cc │ ├── 1912. 연속합 │ │ ├── README.md │ │ └── 연속합.cc │ ├── 1920. 수 찾기 │ │ ├── README.md │ │ └── 수 찾기.cc │ ├── 1926. 그림 │ │ ├── README.md │ │ └── 그림.cc │ ├── 1927. 최소 힙 │ │ ├── README.md │ │ └── 최소 힙.cc │ ├── 1929. 소수 구하기 │ │ ├── README.md │ │ └── 소수 구하기.cc │ ├── 1931. 회의실 배정 │ │ ├── README.md │ │ └── 회의실 배정.cc │ ├── 1932. 정수 삼각형 │ │ ├── README.md │ │ └── 정수 삼각형.cc │ ├── 1940. 주몽 │ │ ├── README.md │ │ └── 주몽.cc │ ├── 1978. 소수 찾기 │ │ ├── README.md │ │ └── 소수 찾기.cc │ ├── 2003. 수들의 합 2 │ │ ├── README.md │ │ └── 수들의 합 2.cc │ ├── 2018. 수들의 합 5 │ │ ├── README.md │ │ └── 수들의 합 5.cc │ ├── 2072. 오목 │ │ ├── README.md │ │ └── 오목.go │ ├── 2164. 카드2 │ │ ├── README.md │ │ └── 카드2.cc │ ├── 2178. 미로 탐색 │ │ ├── README.md │ │ └── 미로 탐색.cc │ ├── 21921. 블로그 │ │ ├── README.md │ │ └── 블로그.cc │ ├── 2343. 기타 레슨 │ │ ├── README.md │ │ └── 기타 레슨.cc │ ├── 24444. 알고리즘 수업 － 너비 우선 탐색 1 │ │ ├── README.md │ │ └── 알고리즘 수업 － 너비 우선 탐색 1.cc │ ├── 24445. 알고리즘 수업 － 너비 우선 탐색 2 │ │ ├── README.md │ │ └── 알고리즘 수업 － 너비 우선 탐색 2.cc │ ├── 24446. 알고리즘 수업 － 너비 우선 탐색 3 │ │ ├── README.md │ │ └── 알고리즘 수업 － 너비 우선 탐색 3.cc │ ├── 24447. 알고리즘 수업 － 너비 우선 탐색 4 │ │ ├── README.md │ │ └── 알고리즘 수업 － 너비 우선 탐색 4.cc │ ├── 24479. 알고리즘 수업 － 깊이 우선 탐색 1 │ │ ├── README.md │ │ └── 알고리즘 수업 － 깊이 우선 탐색 1.cc │ ├── 24480. 알고리즘 수업 － 깊이 우선 탐색 2 │ │ ├── README.md │ │ └── 알고리즘 수업 － 깊이 우선 탐색 2.cc │ ├── 24481. 알고리즘 수업 － 깊이 우선 탐색 3 │ │ ├── README.md │ │ └── 알고리즘 수업 － 깊이 우선 탐색 3.cc │ ├── 24482. 알고리즘 수업 － 깊이 우선 탐색 4 │ │ ├── README.md │ │ └── 알고리즘 수업 － 깊이 우선 탐색 4.cc │ ├── 24483. 알고리즘 수업 － 깊이 우선 탐색 5 │ │ ├── README.md │ │ └── 알고리즘 수업 － 깊이 우선 탐색 5.cc │ ├── 24484. 알고리즘 수업 － 깊이 우선 탐색 6 │ │ ├── README.md │ │ └── 알고리즘 수업 － 깊이 우선 탐색 6.cc │ ├── 25379. 피하자 │ │ ├── README.md │ │ └── 피하자.cc │ ├── 2553. 마지막 팩토리얼 수 │ │ ├── README.md │ │ └── 마지막 팩토리얼 수.cc │ ├── 2579. 계단 오르기 │ │ ├── README.md │ │ └── 계단 오르기.cc │ ├── 2606. 바이러스 │ │ ├── README.md │ │ └── 바이러스.cc │ ├── 2667. 단지번호붙이기 │ │ ├── README.md │ │ └── 단지번호붙이기.cc │ ├── 27446. 랩실에서 잘 자요 │ │ ├── README.md │ │ └── 랩실에서 잘 자요.cc │ ├── 2751. 수 정렬하기 2 │ │ ├── README.md │ │ └── 수 정렬하기 2.cc │ ├── 2776. 암기왕 │ │ ├── README.md │ │ └── 암기왕.cc │ ├── 27964. 콰트로치즈피자 │ │ ├── README.md │ │ └── 콰트로치즈피자.cc │ ├── 27965. N결수 │ │ ├── N결수.cc │ │ └── README.md │ ├── 28064. 이민희진 │ │ ├── README.md │ │ └── 이민희진.cc │ ├── 28238. 정보 선생님의 야망 │ │ ├── README.md │ │ └── 정보 선생님의 야망.cc │ ├── 2839. 설탕 배달 │ │ ├── README.md │ │ └── 설탕 배달.cc │ ├── 28432. 끝말잇기 │ │ ├── README.md │ │ └── 끝말잇기.cc │ ├── 2941. 크로아티아 알파벳 │ │ ├── README.md │ │ └── 크로아티아 알파벳.cc │ ├── 3273. 두 수의 합 │ │ ├── README.md │ │ └── 두 수의 합.cc │ ├── 4134. 다음 소수 │ │ ├── README.md │ │ └── 다음 소수.cc │ ├── 4378. 트ㅏㅊ； │ │ ├── README.md │ │ └── 트ㅏㅊ；.cc │ ├── 4673. 셀프 넘버 │ │ ├── README.md │ │ └── 셀프 넘버.c │ ├── 5555. 반지 │ │ ├── README.md │ │ └── 반지.cc │ ├── 9012. 괄호 │ │ ├── README.md │ │ └── 괄호.cc │ ├── 9095. 1， 2， 3 더하기 │ │ ├── 1， 2， 3 더하기.cc │ │ └── README.md │ ├── 9461. 파도반 수열 │ │ ├── README.md │ │ └── 파도반 수열.cc │ └── 9655. 돌 게임 │ │ ├── README.md │ │ └── 돌 게임.cc └── Unrated │ ├── 11506. 占쏙옙 │ ├── README.md │ └── 占쏙옙.txt │ ├── 1237. 정ㅋ벅ㅋ │ ├── README.md │ └── 정ㅋ벅ㅋ.c │ ├── 15643. Yee │ ├── README.md │ └── Yee.txt │ ├── 15802. 타노스 │ ├── README.md │ └── 타노스.c │ └── 2555. 생일 출력하기 │ ├── README.md │ └── 생일 출력하기.txt └── 프로그래머스 ├── 0 ├── 120808. 분수의 덧셈 │ ├── README.md │ └── 분수의 덧셈.cpp ├── 120815. 피자 나눠 먹기 （2） │ ├── README.md │ └── 피자 나눠 먹기 （2）.cpp ├── 120837. 개미 군단 │ ├── README.md │ └── 개미 군단.cpp └── 120863. 다항식 더하기 │ ├── README.md │ └── 다항식 더하기.cpp ├── 1 ├── 118666. 성격 유형 검사하기 │ ├── README.md │ └── 성격 유형 검사하기.cpp ├── 12906. 같은 숫자는 싫어 │ ├── README.md │ └── 같은 숫자는 싫어.cpp ├── 131112. 강원도에 위치한 생산공장 목록 출력하기 │ ├── README.md │ └── 강원도에 위치한 생산공장 목록 출력하기.sql ├── 131114. 경기도에 위치한 식품창고 목록 출력하기 │ ├── README.md │ └── 경기도에 위치한 식품창고 목록 출력하기.sql ├── 131528. 나이 정보가 없는 회원 수 구하기 │ ├── README.md │ └── 나이 정보가 없는 회원 수 구하기.sql ├── 131535. 조건에 맞는 회원수 구하기 │ ├── README.md │ └── 조건에 맞는 회원수 구하기.sql ├── 131697. 가장 비싼 상품 구하기 │ ├── README.md │ └── 가장 비싼 상품 구하기.sql ├── 132201. 12세 이하인 여자 환자 목록 출력하기 │ ├── 12세 이하인 여자 환자 목록 출력하기.sql │ └── README.md ├── 132203. 흉부외과 또는 일반외과 의사 목록 출력하기 │ ├── README.md │ └── 흉부외과 또는 일반외과 의사 목록 출력하기.sql ├── 133024. 인기있는 아이스크림 │ ├── README.md │ └── 인기있는 아이스크림.sql ├── 133025. 과일로 만든 아이스크림 고르기 │ ├── README.md │ └── 과일로 만든 아이스크림 고르기.sql ├── 144853. 조건에 맞는 도서 리스트 출력하기 │ ├── README.md │ └── 조건에 맞는 도서 리스트 출력하기.sql ├── 150370. 개인정보 수집 유효기간 │ ├── README.md │ └── 개인정보 수집 유효기간.cpp ├── 151136. 평균 일일 대여 요금 구하기 │ ├── README.md │ └── 평균 일일 대여 요금 구하기.sql ├── 151138. 자동차 대여 기록에서 장기／단기 대여 구분하기 │ ├── README.md │ └── 자동차 대여 기록에서 장기／단기 대여 구분하기.sql ├── 157343. 특정 옵션이 포함된 자동차 리스트 구하기 │ ├── README.md │ └── 특정 옵션이 포함된 자동차 리스트 구하기.sql ├── 164673. 조건에 부합하는 중고거래 댓글 조회하기 │ ├── README.md │ └── 조건에 부합하는 중고거래 댓글 조회하기.sql ├── 17682. ［1차］ 다트 게임 │ ├── README.md │ └── ［1차］ 다트 게임.cpp ├── 1845. 폰켓몬 │ ├── README.md │ └── 폰켓몬.cpp ├── 250121. ［PCCE 기출문제］ 10번 ／ 데이터 분석 │ ├── README.md │ └── ［PCCE 기출문제］ 10번 ／ 데이터 분석.cpp ├── 250125. ［PCCE 기출문제］ 9번 ／ 이웃한 칸 │ ├── README.md │ └── ［PCCE 기출문제］ 9번 ／ 이웃한 칸.cpp ├── 276013. Python 개발자 찾기 │ ├── Python 개발자 찾기.sql │ └── README.md ├── 293258. 잔챙이 잡은 수 구하기 │ ├── README.md │ └── 잔챙이 잡은 수 구하기.sql ├── 293259. 잡은 물고기의 평균 길이 구하기 │ ├── README.md │ └── 잡은 물고기의 평균 길이 구하기.sql ├── 298515. 잡은 물고기 중 가장 큰 물고기의 길이 구하기 │ ├── README.md │ └── 잡은 물고기 중 가장 큰 물고기의 길이 구하기.sql ├── 298516. 한 해에 잡은 물고기 수 구하기 │ ├── README.md │ └── 한 해에 잡은 물고기 수 구하기.sql ├── 298517. 가장 큰 물고기 10마리 구하기 │ ├── README.md │ └── 가장 큰 물고기 10마리 구하기.sql ├── 301646. 특정 형질을 가지는 대장균 찾기 │ ├── README.md │ └── 특정 형질을 가지는 대장균 찾기.sql ├── 42576. 완주하지 못한 선수 │ ├── README.md │ └── 완주하지 못한 선수.cpp ├── 59034. 모든 레코드 조회하기 │ ├── README.md │ └── 모든 레코드 조회하기.sql ├── 59035. 역순 정렬하기 │ ├── README.md │ └── 역순 정렬하기.sql ├── 59036. 아픈 동물 찾기 │ ├── README.md │ └── 아픈 동물 찾기.sql ├── 59037. 어린 동물 찾기 │ ├── README.md │ └── 어린 동물 찾기.sql ├── 59039. 이름이 없는 동물의 아이디 │ ├── README.md │ └── 이름이 없는 동물의 아이디.sql ├── 59403. 동물의 아이디와 이름 │ ├── README.md │ └── 동물의 아이디와 이름.sql ├── 59404. 여러 기준으로 정렬하기 │ ├── README.md │ └── 여러 기준으로 정렬하기.sql ├── 59407. 이름이 있는 동물의 아이디 │ ├── README.md │ └── 이름이 있는 동물의 아이디.sql ├── 59415. 최댓값 구하기 │ ├── README.md │ └── 최댓값 구하기.sql └── 64061. 크레인 인형뽑기 게임 │ ├── README.md │ └── 크레인 인형뽑기 게임.cpp ├── 2 ├── 12909. 올바른 괄호 │ ├── README.md │ └── 올바른 괄호.cpp ├── 131536. 재구매가 일어난 상품과 회원 리스트 구하기 │ ├── README.md │ └── 재구매가 일어난 상품과 회원 리스트 구하기.sql ├── 42577. 전화번호 목록 │ ├── README.md │ └── 전화번호 목록.cpp ├── 42584. 주식가격 │ ├── README.md │ └── 주식가격.cpp ├── 42586. 기능개발 │ ├── README.md │ └── 기능개발.cpp ├── 42587. 프로세스 │ ├── README.md │ └── 프로세스.cpp ├── 42626. 더 맵게 │ ├── README.md │ └── 더 맵게.cpp ├── 42883. 큰 수 만들기 │ ├── README.md │ └── 큰 수 만들기.cpp ├── 42885. 구명보트 │ ├── README.md │ └── 구명보트.cpp ├── 59410. NULL 처리하기 │ ├── NULL 처리하기.sql │ └── README.md └── 68645. 삼각 달팽이 │ ├── README.md │ └── 삼각 달팽이.cpp ├── 3 └── 49189. 가장 먼 노드 │ ├── README.md │ └── 가장 먼 노드.cpp └── unrated ├── 181829. 이차원 배열 대각선 순회하기 ├── README.md └── 이차원 배열 대각선 순회하기.cpp ├── 181830. 정사각형으로 만들기 ├── README.md └── 정사각형으로 만들기.cpp ├── 181831. 특별한 이차원 배열 2 ├── README.md └── 특별한 이차원 배열 2.cpp ├── 181832. 정수를 나선형으로 배치하기 ├── README.md └── 정수를 나선형으로 배치하기.cpp ├── 181833. 특별한 이차원 배열 1 ├── README.md └── 특별한 이차원 배열 1.cpp ├── 181834. l로 만들기 ├── README.md └── l로 만들기.cpp ├── 181835. 조건에 맞게 수열 변환하기 3 ├── README.md └── 조건에 맞게 수열 변환하기 3.cpp ├── 181836. 그림 확대 ├── README.md └── 그림 확대.cpp ├── 181837. 커피 심부름 ├── README.md └── 커피 심부름.cpp ├── 181838. 날짜 비교하기 ├── README.md └── 날짜 비교하기.cpp ├── 181839. 주사위 게임 1 ├── README.md └── 주사위 게임 1.cpp ├── 181840. 정수 찾기 ├── README.md └── 정수 찾기.cpp ├── 181841. 꼬리 문자열 ├── README.md └── 꼬리 문자열.cpp ├── 181842. 부분 문자열 ├── README.md └── 부분 문자열.cpp ├── 181843. 부분 문자열인지 확인하기 ├── README.md └── 부분 문자열인지 확인하기.cpp ├── 181844. 배열의 원소 삭제하기 ├── README.md └── 배열의 원소 삭제하기.cpp ├── 181845. 문자열로 변환 ├── README.md └── 문자열로 변환.cpp ├── 181846. 두 수의 합 ├── README.md └── 두 수의 합.py ├── 181847. 0 떼기 ├── 0 떼기.cpp └── README.md ├── 181848. 문자열을 정수로 변환하기 ├── README.md └── 문자열을 정수로 변환하기.cpp ├── 181849. 문자열 정수의 합 ├── README.md └── 문자열 정수의 합.cpp ├── 181850. 정수 부분 ├── README.md └── 정수 부분.cpp ├── 181851. 전국 대회 선발 고사 ├── README.md └── 전국 대회 선발 고사.cpp ├── 181852. 뒤에서 5등 위로 ├── README.md └── 뒤에서 5등 위로.cpp ├── 181853. 뒤에서 5등까지 ├── README.md └── 뒤에서 5등까지.cpp ├── 181854. 배열의 길이에 따라 다른 연산하기 ├── README.md └── 배열의 길이에 따라 다른 연산하기.cpp ├── 181855. 문자열 묶기 ├── README.md └── 문자열 묶기.cpp ├── 181856. 배열 비교하기 ├── README.md └── 배열 비교하기.cpp ├── 181857. 배열의 길이를 2의 거듭제곱으로 만들기 ├── README.md └── 배열의 길이를 2의 거듭제곱으로 만들기.cpp ├── 181858. 무작위로 K개의 수 뽑기 ├── README.md └── 무작위로 K개의 수 뽑기.cpp ├── 181859. 배열 만들기 6 ├── README.md └── 배열 만들기 6.cpp ├── 181860. 빈 배열에 추가， 삭제하기 ├── README.md └── 빈 배열에 추가， 삭제하기.cpp ├── 181861. 배열의 원소만큼 추가하기 ├── README.md └── 배열의 원소만큼 추가하기.cpp ├── 181862. 세 개의 구분자 ├── README.md └── 세 개의 구분자.cpp ├── 181863. rny＿string ├── README.md └── rny＿string.cpp ├── 181864. 문자열 바꿔서 찾기 ├── README.md └── 문자열 바꿔서 찾기.cpp ├── 181865. 간단한 식 계산하기 ├── README.md └── 간단한 식 계산하기.cpp ├── 181866. 문자열 잘라서 정렬하기 ├── README.md └── 문자열 잘라서 정렬하기.cpp ├── 181867. x 사이의 개수 ├── README.md └── x 사이의 개수.cpp ├── 181868. 공백으로 구분하기 2 ├── README.md └── 공백으로 구분하기 2.cpp ├── 181869. 공백으로 구분하기 1 ├── README.md └── 공백으로 구분하기 1.cpp ├── 181870. ad 제거하기 ├── README.md └── ad 제거하기.cpp ├── 181871. 문자열이 몇 번 등장하는지 세기 ├── README.md └── 문자열이 몇 번 등장하는지 세기.cpp ├── 181872. 특정 문자열로 끝나는 가장 긴 부분 문자열 찾기 ├── README.md └── 특정 문자열로 끝나는 가장 긴 부분 문자열 찾기.cpp ├── 181873. 특정한 문자를 대문자로 바꾸기 ├── README.md └── 특정한 문자를 대문자로 바꾸기.cpp ├── 181874. A 강조하기 ├── A 강조하기.cpp └── README.md ├── 181875. 배열에서 문자열 대소문자 변환하기 ├── README.md └── 배열에서 문자열 대소문자 변환하기.cpp ├── 181876. 소문자로 바꾸기 ├── README.md └── 소문자로 바꾸기.cpp ├── 181877. 대문자로 바꾸기 ├── README.md └── 대문자로 바꾸기.cpp ├── 181878. 원하는 문자열 찾기 ├── README.md └── 원하는 문자열 찾기.cpp ├── 181879. 길이에 따른 연산 ├── README.md └── 길이에 따른 연산.cpp ├── 181880. 1로 만들기 ├── 1로 만들기.cpp └── README.md ├── 181881. 조건에 맞게 수열 변환하기 2 ├── README.md └── 조건에 맞게 수열 변환하기 2.cpp ├── 181882. 조건에 맞게 수열 변환하기 1 ├── README.md └── 조건에 맞게 수열 변환하기 1.cpp ├── 181883. 수열과 구간 쿼리 1 ├── README.md └── 수열과 구간 쿼리 1.cpp ├── 181884. n보다 커질 때까지 더하기 ├── README.md └── n보다 커질 때까지 더하기.cpp ├── 181885. 할 일 목록 ├── README.md └── 할 일 목록.cpp ├── 181886. 5명씩 ├── 5명씩.cpp └── README.md ├── 181887. 홀수 vs 짝수 ├── README.md └── 홀수 vs 짝수.cpp ├── 181888. n개 간격의 원소들 ├── README.md └── n개 간격의 원소들.cpp ├── 181889. n 번째 원소까지 ├── README.md └── n 번째 원소까지.cpp ├── 181890. 왼쪽 오른쪽 ├── README.md └── 왼쪽 오른쪽.cpp ├── 181891. 순서 바꾸기 ├── README.md └── 순서 바꾸기.cpp ├── 181892. n 번째 원소부터 ├── README.md └── n 번째 원소부터.cpp ├── 181893. 배열 조각하기 ├── README.md └── 배열 조각하기.cpp ├── 181894. 2의 영역 ├── 2의 영역.cpp └── README.md ├── 181895. 배열 만들기 3 ├── README.md └── 배열 만들기 3.cpp ├── 181896. 첫 번째로 나오는 음수 ├── README.md └── 첫 번째로 나오는 음수.cpp ├── 181897. 리스트 자르기 ├── README.md └── 리스트 자르기.cpp ├── 181898. 가까운 1 찾기 ├── README.md └── 가까운 1 찾기.cpp ├── 181899. 카운트 다운 ├── README.md └── 카운트 다운.cpp ├── 181900. 글자 지우기 ├── README.md └── 글자 지우기.cpp ├── 181901. 배열 만들기 1 ├── README.md └── 배열 만들기 1.cpp ├── 181902. 문자 개수 세기 ├── README.md └── 문자 개수 세기.cpp ├── 181903. qr code ├── README.md └── qr code.cpp ├── 181904. 세로 읽기 ├── README.md └── 세로 읽기.cpp ├── 181905. 문자열 뒤집기 ├── README.md └── 문자열 뒤집기.cpp ├── 181906. 접두사인지 확인하기 ├── README.md └── 접두사인지 확인하기.cpp ├── 181907. 문자열의 앞의 n글자 ├── README.md └── 문자열의 앞의 n글자.cpp ├── 181908. 접미사인지 확인하기 ├── README.md └── 접미사인지 확인하기.cpp ├── 181909. 접미사 배열 ├── README.md └── 접미사 배열.cpp ├── 181910. 문자열의 뒤의 n글자 ├── README.md └── 문자열의 뒤의 n글자.cpp ├── 181911. 부분 문자열 이어 붙여 문자열 만들기 ├── README.md └── 부분 문자열 이어 붙여 문자열 만들기.cpp ├── 181912. 배열 만들기 5 ├── README.md └── 배열 만들기 5.cpp ├── 181913. 문자열 여러 번 뒤집기 ├── README.md └── 문자열 여러 번 뒤집기.cpp ├── 181914. 9로 나눈 나머지 ├── 9로 나눈 나머지.cpp └── README.md ├── 181915. 글자 이어 붙여 문자열 만들기 ├── README.md └── 글자 이어 붙여 문자열 만들기.cpp ├── 181916. 주사위 게임 3 ├── README.md └── 주사위 게임 3.cpp ├── 181917. 간단한 논리 연산 ├── README.md └── 간단한 논리 연산.cpp ├── 181918. 배열 만들기 4 ├── README.md └── 배열 만들기 4.cpp ├── 181919. 콜라츠 수열 만들기 ├── README.md └── 콜라츠 수열 만들기.cpp ├── 181920. 카운트 업 ├── README.md └── 카운트 업.cpp ├── 181921. 배열 만들기 2 ├── README.md └── 배열 만들기 2.cpp ├── 181922. 수열과 구간 쿼리 4 ├── README.md └── 수열과 구간 쿼리 4.cpp ├── 181923. 수열과 구간 쿼리 2 ├── README.md └── 수열과 구간 쿼리 2.cpp ├── 181924. 수열과 구간 쿼리 3 ├── README.md └── 수열과 구간 쿼리 3.cpp ├── 181925. 수 조작하기 2 ├── README.md └── 수 조작하기 2.cpp ├── 181926. 수 조작하기 1 ├── README.md └── 수 조작하기 1.cpp ├── 181927. 마지막 두 원소 ├── README.md └── 마지막 두 원소.cpp ├── 181928. 이어 붙인 수 ├── README.md └── 이어 붙인 수.cpp ├── 181929. 원소들의 곱과 합 ├── README.md └── 원소들의 곱과 합.cpp ├── 181930. 주사위 게임 2 ├── README.md └── 주사위 게임 2.cpp ├── 181931. 등차수열의 특정한 항만 더하기 ├── README.md └── 등차수열의 특정한 항만 더하기.cpp ├── 181932. 코드 처리하기 ├── README.md └── 코드 처리하기.cpp ├── 181933. flag에 따라 다른 값 반환하기 ├── README.md └── flag에 따라 다른 값 반환하기.cpp ├── 181934. 조건 문자열 ├── README.md └── 조건 문자열.cpp ├── 181935. 홀짝에 따라 다른 값 반환하기 ├── README.md └── 홀짝에 따라 다른 값 반환하기.cpp ├── 181936. 공배수 ├── README.md └── 공배수.cpp ├── 181937. n의 배수 ├── README.md └── n의 배수.cpp ├── 181938. 두 수의 연산값 비교하기 ├── README.md └── 두 수의 연산값 비교하기.cpp ├── 181939. 더 크게 합치기 ├── README.md └── 더 크게 합치기.cpp ├── 181940. 문자열 곱하기 ├── README.md └── 문자열 곱하기.cpp ├── 181941. 문자 리스트를 문자열로 변환하기 ├── README.md └── 문자 리스트를 문자열로 변환하기.cpp ├── 181942. 문자열 섞기 ├── README.md └── 문자열 섞기.cpp ├── 181943. 문자열 겹쳐쓰기 ├── README.md └── 문자열 겹쳐쓰기.cpp ├── 181944. 홀짝 구분하기 ├── README.md └── 홀짝 구분하기.cpp ├── 181945. 문자열 돌리기 ├── README.md └── 문자열 돌리기.cpp ├── 181946. 문자열 붙여서 출력하기 ├── README.md └── 문자열 붙여서 출력하기.cpp ├── 181947. 덧셈식 출력하기 ├── README.md └── 덧셈식 출력하기.cpp ├── 181948. 특수문자 출력하기 ├── README.md └── 특수문자 출력하기.cpp ├── 181949. 대소문자 바꿔서 출력하기 ├── README.md └── 대소문자 바꿔서 출력하기.cpp ├── 181950. 문자열 반복해서 출력하기 ├── README.md └── 문자열 반복해서 출력하기.cpp ├── 181951. a와 b 출력하기 ├── README.md └── a와 b 출력하기.cpp └── 181952. 문자열 출력하기 ├── README.md └── 문자열 출력하기.cpp /README.md: -------------------------------------------------------------------------------- 1 |
2 | 3 | ![](https://github-readme-solvedac.hyp3rflow.vercel.app/api/?handle=dlswns) 4 | 5 | # 6 | 7 | This is a auto push repository for Baekjoon Online 8 | 9 |
10 | -------------------------------------------------------------------------------- /백준/Bronze/1000. A＋B/A＋B.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | scanf("%d %d", &a, &b); 8 | printf("%d", a+b); 9 | } -------------------------------------------------------------------------------- /백준/Bronze/1000. A＋B/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] A+B - 1000 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/1000) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation), 사칙연산(arithmetic), 수학(math) 12 | 13 | ### 문제 설명 14 | 15 |

두 정수 A와 B를 입력받은 다음, A+B를 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 A와 B가 주어진다. (0 < A, B < 10)

20 | 21 | ### 출력 22 | 23 |

첫째 줄에 A+B를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/1001. A－B/A－B.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | scanf("%d %d", &a,&b); 8 | printf("%d", a-b); 9 | return 0; 10 | } -------------------------------------------------------------------------------- /백준/Bronze/1001. A－B/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] A-B - 1001 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/1001) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation), 사칙연산(arithmetic), 수학(math) 12 | 13 | ### 문제 설명 14 | 15 |

두 정수 A와 B를 입력받은 다음, A-B를 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 A와 B가 주어진다. (0 < A, B < 10)

20 | 21 | ### 출력 22 | 23 |

첫째 줄에 A-B를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/10039. 평균 점수/평균 점수.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a[5]; 6 | scanf("%d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4]); 7 | for (int i = 0; i < 5; i++) 8 | { 9 | if (a[i]<40) 10 | { 11 | a[i]=40; 12 | } 13 | 14 | } 15 | printf("%d", ((a[0]+a[1]+a[2]+a[3]+a[4])/5)); 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/1008. A／B/A／B.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | double a; 6 | double b; 7 | 8 | scanf("%lf %lf", &a, &b); 9 | printf("%.10lf", a/b); 10 | 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/10156. 과자/과자.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b,c; 6 | 7 | scanf("%d%d%d",&a,&b,&c); 8 | 9 | if ((a*b)<=c) 10 | { 11 | printf("0"); 12 | } 13 | else 14 | { 15 | printf("%d",(a*b)-c); 16 | } 17 | 18 | return 0; 19 | } 20 | 21 | -------------------------------------------------------------------------------- /백준/Bronze/10170. NFC West vs North/NFC West vs North.txt: -------------------------------------------------------------------------------- 1 | NFC West W L T 2 | ----------------------- 3 | Seattle 13 3 0 4 | San Francisco 12 4 0 5 | Arizona 10 6 0 6 | St. Louis 7 9 0 7 | 8 | NFC North W L T 9 | ----------------------- 10 | Green Bay 8 7 1 11 | Chicago 8 8 0 12 | Detroit 7 9 0 13 | Minnesota 5 10 1 -------------------------------------------------------------------------------- /백준/Bronze/10170. NFC West vs North/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] NFC West vs North - 10170 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/10170) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 4528 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

동혁이를 위해 NFC 서부와 북부 디비전 순위를 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

없음

20 | 21 | ### 출력 22 | 23 |

예제와 같이 NFC 서부와 북부 디비전 순위를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/10171. 고양이/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 고양이 - 10171 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/10171) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

아래 예제와 같이 고양이를 출력하시오.

16 | 17 | ### 입력 18 | 19 |

없음.

20 | 21 | ### 출력 22 | 23 |

고양이를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/10171. 고양이/고양이.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | printf("\\ /\\\n"); 6 | printf(" ) ( ')\n"); 7 | printf("( / )\n"); 8 | printf(" \\(__)|"); 9 | 10 | return 0; 11 | 12 | } -------------------------------------------------------------------------------- /백준/Bronze/10172. 개/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 개 - 10172 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/10172) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

아래 예제와 같이 개를 출력하시오.

16 | 17 | ### 입력 18 | 19 |

없음.

20 | 21 | ### 출력 22 | 23 |

개를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/10172. 개/개.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | printf("|\\_/|\n"); 6 | printf("|q p| /}\n"); 7 | printf("( 0 )\"\"\"\\\n"); 8 | printf("|\"^\"` |\n"); 9 | printf("||_/=\\\\__|"); 10 | return 0; 11 | 12 | } -------------------------------------------------------------------------------- /백준/Bronze/10189. Hook/Hook.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cout; 3 | int main() 4 | { 5 | cout << "# # #### #### # #" 6 | << "\n"; 7 | cout << "#### # # # # # #" 8 | << "\n"; 9 | cout << "#### # # # # # #" 10 | << "\n"; 11 | cout << "# # #### #### # #" 12 | << "\n"; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/10189. Hook/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] Hook - 10189 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/10189) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 2020 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

Print out the word Hook as shown below.

16 | 17 | ### 입력 18 | 19 | Empty 20 | 21 | ### 출력 22 | 23 |

Print out the word Hook as shown below.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/10430. 나머지/나머지.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int A; 6 | int B; 7 | int C; 8 | 9 | scanf("%d %d %d", &A, &B, &C); 10 | 11 | printf("%d\n", (A+B)%C); 12 | printf("%d\n", ((A%C) + (B%C))%C); 13 | printf("%d\n", (A*B)%C); 14 | printf("%d\n", ((A%C) * (B%C))%C); 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/10480. Oddities/Oddities.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, x; 8 | cin >> n; 9 | while (n--) 10 | { 11 | cin >> x; 12 | cout << x << ((x % 2) ? " is odd" : " is even") << '\n'; 13 | } 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/10699. 오늘 날짜/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 오늘 날짜 - 10699 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/10699) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

서울의 오늘 날짜를 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

입력은 없다.

20 | 21 | ### 출력 22 | 23 |

서울의 오늘 날짜를 "YYYY-MM-DD" 형식으로 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/10699. 오늘 날짜/오늘 날짜.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | printf("2022-08-10"); 7 | return 0; 8 | } 9 | -------------------------------------------------------------------------------- /백준/Bronze/10718. We love kriii/We love kriii.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | printf("강한친구 대한육군\n"); 7 | printf("강한친구 대한육군"); 8 | 9 | 10 | return 0; 11 | 12 | } -------------------------------------------------------------------------------- /백준/Bronze/10757. 큰 수 A＋B/큰 수 A＋B.py: -------------------------------------------------------------------------------- 1 | a, b = input().split() 2 | print(int(a)+int(b)) 3 | -------------------------------------------------------------------------------- /백준/Bronze/10797. 10부제/10부제.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b[5],c=0; 6 | scanf("%d%d%d%d%d%d",&a,&b[0],&b[1],&b[2],&b[3],&b[4]); 7 | for (int i = 0; i < 5; i++) 8 | { 9 | if (b[i]==a) 10 | { 11 | c++; 12 | } 13 | } 14 | printf("%d",c); 15 | return 0; 16 | } 17 | 18 | -------------------------------------------------------------------------------- /백준/Bronze/10798. 세로읽기/세로읽기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | string str[5]; 9 | char c; 10 | for (int i = 0; i < 5; i++) 11 | cin >> str[i]; 12 | for (int i = 0; i < 15; i++) 13 | for (int j = 0; j < 5; j++) 14 | if (i < str[j].length()) 15 | cout << str[j][i]; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/10807. 개수 세기/개수 세기.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,c,out=0; 6 | scanf("%d",&a); 7 | int b[a]; 8 | for (int i = 0; i < a; i++) 9 | { 10 | scanf("%d",&b[i]); 11 | } 12 | scanf("%d",&c); 13 | for (int j = 0; j < a; j++) 14 | { 15 | if (b[j]==c) 16 | { 17 | out++; 18 | } 19 | } 20 | 21 | printf("%d",out); 22 | 23 | return 0; 24 | } 25 | 26 | -------------------------------------------------------------------------------- /백준/Bronze/10808. 알파벳 개수/알파벳 개수.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int a[26] = { 0, }; 7 | char str[101]; 8 | 9 | scanf("%s", str); 10 | for (int i = 0; i < strlen(str); i++) 11 | { 12 | a[str[i] - 97]++; 13 | } 14 | for (int i = 0; i < 26; i++) 15 | { 16 | printf("%d ", a[i]); 17 | } 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Bronze/10817. 세 수/세 수.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c; 6 | scanf("%d %d %d", &a, &b, &c); 7 | printf("%d", a > b ? (a > c ? (b > c ? b : c) : a) : (b > c ? (c > a ? c : a) : b)); 8 | return 0; 9 | } 10 | 11 | -------------------------------------------------------------------------------- /백준/Bronze/10869. 사칙연산/사칙연산.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | scanf("%d %d", &a, &b); 8 | printf("%d\n", a+b); 9 | printf("%d\n", a-b); 10 | printf("%d\n", a*b); 11 | printf("%d\n", a/b); 12 | printf("%d", a%b); 13 | } -------------------------------------------------------------------------------- /백준/Bronze/10870. 피보나치 수 5/피보나치 수 5.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | int a = 0, b = 1, c; 9 | cin >> n; 10 | if (n == 0) 11 | { 12 | cout << 0; 13 | return 0; 14 | } 15 | for (int i = 1; i < n; i++) 16 | { 17 | c = a + b; 18 | a = b; 19 | b = c; 20 | } 21 | cout << b; 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /백준/Bronze/10871. X보다 작은 수/X보다 작은 수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int a; 5 | int b; 6 | int c; 7 | 8 | scanf("%d %d", &a, &b); 9 | 10 | for(int i=0;ic) 14 | { 15 | printf("%d ", c); 16 | } 17 | 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Bronze/10872. 팩토리얼/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 팩토리얼 - 10872 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/10872) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation), 수학(math), 조합론(combinatorics) 12 | 13 | ### 문제 설명 14 | 15 |

0보다 크거나 같은 정수 N이 주어진다. 이때, N!을 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 정수 N(0 ≤ N ≤ 12)이 주어진다.

20 | 21 | ### 출력 22 | 23 |

첫째 줄에 N!을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/10872. 팩토리얼/팩토리얼.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int output = 1; 7 | scanf("%d",&a); 8 | while (1) 9 | { 10 | if (a==0) 11 | { 12 | break; 13 | } 14 | output = a*output; 15 | a--; 16 | } 17 | printf("%d",output); 18 | } -------------------------------------------------------------------------------- /백준/Bronze/10886. 0 ＝ not cute ／ 1 ＝ cute/0 ＝ not cute ／ 1 ＝ cute.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, n, count = 0; 6 | scanf("%d", &n); 7 | for (int i = 0; i < n; i++) 8 | { 9 | scanf("%d", &a); 10 | count += a; 11 | } 12 | printf("%s", (n - count < count) ? "Junhee is cute!" : "Junhee is not cute!"); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /백준/Bronze/10926. ？？！/？？！.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | char str[50]; 6 | 7 | scanf("%s", (char*)str); 8 | printf("%s\?\?!", str); 9 | return 0; 10 | } -------------------------------------------------------------------------------- /백준/Bronze/10950. A＋B － 3/A＋B － 3.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | int c; 8 | scanf("%d", &a); 9 | for (int i = 0; i < a; i++) 10 | { 11 | scanf("%d %d", &b, &c); 12 | printf("%d\n", b+c); 13 | } 14 | 15 | 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/10951. A＋B － 4/A＋B － 4.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | int a,b; 4 | while(scanf("%d %d", &a, &b)!=EOF) { 5 | 6 | printf("%d\n", a+b); 7 | } 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/10952. A＋B － 5/A＋B － 5.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int a; 5 | int b; 6 | int c; 7 | 8 | 9 | 10 | for(;;) 11 | { 12 | scanf("%d %d", &a, &b); 13 | 14 | if ((a+b)==0) 15 | { 16 | break; 17 | } 18 | else 19 | { 20 | printf("%d\n", a+b); 21 | } 22 | 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /백준/Bronze/10953. A＋B － 6/A＋B － 6.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a,b,c; 5 | scanf("%d",&c); 6 | for (int i = 0; i < c; i++) 7 | { 8 | scanf("%d,%d",&a,&b); 9 | printf("%d\n",a+b); 10 | } 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/10987. 모음의 개수/모음의 개수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | string str; 9 | cin >> str; 10 | 11 | int count = 0; 12 | for(char c : str) 13 | { 14 | if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') 15 | { 16 | count++; 17 | } 18 | } 19 | 20 | cout << count; 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /백준/Bronze/10989. 수 정렬하기 3/수 정렬하기 3.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n, input, arr[10001] = {0}; 6 | scanf("%d", &n); 7 | for (int i = 0; i < n; i++) 8 | { 9 | scanf("%d", &input); 10 | arr[input] += 1; 11 | } 12 | for (int i = 1; i <= 10000; i++) 13 | for (int j = 0; j < arr[i]; j++) 14 | printf("%d\n", i); 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/10998. A×B/A×B.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | scanf("%d %d", &a, &b); 8 | printf("%d", a*b); 9 | } -------------------------------------------------------------------------------- /백준/Bronze/10998. A×B/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] A×B - 10998 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/10998) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation), 사칙연산(arithmetic), 수학(math) 12 | 13 | ### 문제 설명 14 | 15 |

두 정수 A와 B를 입력받은 다음, A×B를 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 A와 B가 주어진다. (0 < A, B < 10)

20 | 21 | ### 출력 22 | 23 |

첫째 줄에 A×B를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/11021. A＋B － 7/A＋B － 7.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | int c; 8 | scanf("%d", &a); 9 | 10 | for (int i = 1; i <= a; i++) 11 | { 12 | scanf("%d %d", &b, &c); 13 | printf("Case #%d: %d\n", i, b+c); 14 | } 15 | 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /백준/Bronze/11022. A＋B － 8/A＋B － 8.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | int c; 8 | scanf("%d", &a); 9 | 10 | for (int i = 1; i <= a; i++) 11 | { 12 | scanf("%d %d", &b, &c); 13 | printf("Case #%d: %d + %d = %d\n", i, b, c, b+c); 14 | } 15 | 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /백준/Bronze/11050. 이항 계수 1/이항 계수 1.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int C(int n, int k) 6 | { 7 | if (k == 0 || k == n) 8 | return 1; 9 | else 10 | return C(n - 1, k - 1) + C(n - 1, k); 11 | } 12 | 13 | int main() 14 | { 15 | int n, k; 16 | cin >> n >> k; 17 | cout << C(n, k); 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Bronze/11282. 한글/한글.py: -------------------------------------------------------------------------------- 1 | print(chr(int(input())+44031)) -------------------------------------------------------------------------------- /백준/Bronze/11283. 한글 2/한글 2.py: -------------------------------------------------------------------------------- 1 | print(ord(input())-44031) -------------------------------------------------------------------------------- /백준/Bronze/11365. ！밀비 급일/！밀비 급일.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | char a[501]; 6 | 7 | while (1) 8 | { 9 | scanf("%[^\n]s", a); 10 | 11 | if (a[0] == 'E' && a[1] == 'N' && a[2] == 'D') 12 | { 13 | break; 14 | } 15 | 16 | for (int j = strlen(a) - 1; j >= 0; j--) 17 | { 18 | printf("%c", a[j]); 19 | } 20 | printf("\n"); 21 | getchar(); 22 | } 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /백준/Bronze/11382. 꼬마 정민/꼬마 정민.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | 5 | long long a, b, c; 6 | scanf("%lld %lld %lld", &a, &b, &c); 7 | printf("%lld", a+b+c); 8 | return 0; 9 | 10 | } -------------------------------------------------------------------------------- /백준/Bronze/11549. Identifying tea/Identifying tea.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int t, input, count = 0; 8 | cin >> t; 9 | for (int i = 0; i < 5; i++) 10 | { 11 | cin >> input; 12 | if (input == t) 13 | count++; 14 | } 15 | cout << count; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/11654. 아스키 코드/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 아스키 코드 - 11654 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/11654) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

알파벳 소문자, 대문자, 숫자 0-9중 하나가 주어졌을 때, 주어진 글자의 아스키 코드값을 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

알파벳 소문자, 대문자, 숫자 0-9 중 하나가 첫째 줄에 주어진다.

20 | 21 | ### 출력 22 | 23 |

입력으로 주어진 글자의 아스키 코드 값을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/11654. 아스키 코드/아스키 코드.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | char a; 6 | scanf("%c", &a); 7 | printf("%d",a); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /백준/Bronze/11718. 그대로 출력하기/그대로 출력하기.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | char a; 6 | 7 | while (scanf("%c",&a)!=-1) 8 | { 9 | printf("%c",a); 10 | } 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/11719. 그대로 출력하기 2/그대로 출력하기 2.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | string str; 9 | while (getline(cin, str)) 10 | cout << str << '\n'; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/11720. 숫자의 합/숫자의 합.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int N; 6 | int output=0; 7 | scanf("%d",&N); 8 | 9 | char input[N]; 10 | 11 | scanf("%s",input); 12 | 13 | for (int i = 0; i < N; i++) 14 | { 15 | output+=(input[i]-'0'); 16 | } 17 | 18 | printf("%d",output); 19 | 20 | return 0; 21 | } 22 | 23 | -------------------------------------------------------------------------------- /백준/Bronze/11721. 열 개씩 끊어 출력하기/열 개씩 끊어 출력하기.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | char b[101]; 7 | 8 | scanf("%s",b); 9 | for (int i = 0; i < strlen(b);i++) 10 | { 11 | if (i!=0&&i%10==0) 12 | { 13 | printf("\n"); 14 | } 15 | 16 | printf("%c",b[i]); 17 | } 18 | return 0; 19 | } 20 | 21 | -------------------------------------------------------------------------------- /백준/Bronze/11942. 고려대는 사랑입니다/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 고려대는 사랑입니다 - 11942 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/11942) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 836 KB, 시간: 4 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

고려대학교는 사랑입니다.

16 | 17 | ### 입력 18 | 19 | Empty 20 | 21 | ### 출력 22 | 23 |

첫째 줄에 “고려대학교”를 출력하세요.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/11942. 고려대는 사랑입니다/고려대는 사랑입니다.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import "fmt" 4 | 5 | func main() { 6 | fmt.Printf("고려대학교") 7 | } 8 | -------------------------------------------------------------------------------- /백준/Bronze/11943. 파일 옮기기/파일 옮기기.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b; 6 | int c, d; 7 | 8 | scanf("%d%d%d%d", &a, &b, &c, &d); 9 | if (a + d <= b + c) 10 | { 11 | printf("%d", a + d); 12 | 13 | } 14 | else 15 | { 16 | printf("%d", b + c); 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Bronze/11945. 뜨거운 붕어빵/뜨거운 붕어빵.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | char input[10]; 8 | int n, m; 9 | cin >> n >> m; 10 | for (int j = 0; j < n; j++) 11 | { 12 | for (int i = 0; i < m; i++) 13 | cin >> input[i]; 14 | for (int i = m - 1; i >= 0; i--) 15 | cout << input[i]; 16 | cout << '\n'; 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Bronze/11948. 과목선택/과목선택.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c, d, e, f; 6 | scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f); 7 | printf("%d", (a + b + c + d) - (a < ((d < c ? d : c) < b ? (d < c ? d : c) : b) ? a : ((d < c ? d : c) < b ? (d < c ? d : c) : b)) + (e > f ? e : f)); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/11966. 2의 제곱인가？/2의 제곱인가？.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | cout << (n && !(n & (n - 1))); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/11966. 2의 제곱인가？/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze III] 2의 제곱인가? - 11966 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/11966) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 2020 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 수학 12 | 13 | ### 문제 설명 14 | 15 |

자연수 N이 주어졌을 때, 2의 제곱수면 1을 아니면 0을 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 N(1 ≤ N ≤ 230)이 주어진다.

20 | 21 | ### 출력 22 | 23 |

N이 2의 제곱수면 1을 아니면 0을 출력하는 프로그램을 작성하시오.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/1259. 팰린드롬수/팰린드롬수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | while (1) 9 | { 10 | string str; 11 | cin >> str; 12 | if (str == "0") 13 | break; 14 | string reversed(str.rbegin(), str.rend()); 15 | cout << ((str == reversed) ? "yes\n" : "no\n"); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/1271. 엄청난 부자2/엄청난 부자2.py: -------------------------------------------------------------------------------- 1 | n, m = input().split() 2 | n = int(n) 3 | m = int(m) 4 | 5 | print(n//m) 6 | print(n%m) -------------------------------------------------------------------------------- /백준/Bronze/12833. XORXORXOR/XORXORXOR.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c; 8 | cin >> a >> b >> c; 9 | cout << ((c & 1) ? a ^ b : a); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/13118. 뉴턴과 사과/뉴턴과 사과.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int p[4], x; 8 | cin >> p[0] >> p[1] >> p[2] >> p[3] >> x; 9 | for (int i = 0; i < 4; i++) 10 | { 11 | if (p[i] == x) 12 | { 13 | cout << i + 1; 14 | return 0; 15 | } 16 | } 17 | cout << 0; 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Bronze/13136. Do Not Touch Anything/Do Not Touch Anything.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | long long int r, c, n; 8 | cin >> r >> c >> n; 9 | cout << ((r / n) + (r % n != 0)) * ((c / n) + (c % n != 0)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/13277. 큰 수 곱셈/큰 수 곱셈.py: -------------------------------------------------------------------------------- 1 | a, b = input().split() 2 | a=int(a) 3 | b=int(b) 4 | print(a*b) -------------------------------------------------------------------------------- /백준/Bronze/1330. 두 수 비교하기/두 수 비교하기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b; 6 | scanf("%d %d", &a, &b); 7 | 8 | if(ab) 13 | { 14 | printf(">"); 15 | } 16 | if(a == b) 17 | { 18 | printf("=="); 19 | } 20 | 21 | return 0; 22 | } -------------------------------------------------------------------------------- /백준/Bronze/13580. Andando no tempo/Andando no tempo.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int input[3]; 10 | cin >> input[0] >> input[1] >> input[2]; 11 | sort(input, input + 3); 12 | cout << ((input[0] == input[1] || input[1] == input[2] || input[0] + input[1] == input[2]) ? 'S' : 'N'); 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/13597. Tri－du/Tri－du.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::max; 5 | 6 | int main() 7 | { 8 | int a, b; 9 | cin >> a >> b; 10 | cout << std::max(a, b); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/13752. 히스토그램/히스토그램.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b; 6 | scanf("%d", &a); 7 | for (int i = 0; i < a; i++) 8 | { 9 | scanf("%d", &b); 10 | for (int i = 0; i < b; i++) 11 | { 12 | printf("="); 13 | } 14 | printf("\n"); 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/13866. 팀 나누기/팀 나누기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c, d; 8 | cin >> a >> b >> c >> d; 9 | cout << abs((a + d) - (b + c)); 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /백준/Bronze/13985. Equality/Equality.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c; 6 | scanf("%d + %d = %d", &a, &b, &c); 7 | printf("%s", (a + b == c) ? "YES" : "NO"); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /백준/Bronze/14038. Tournament Selection/Tournament Selection.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int win = 0; 8 | const int arr[7]{-1, 3, 3, 2, 2, 1, 1}; 9 | char input; 10 | for (int i = 0; i < 6; i++) 11 | { 12 | cin >> input; 13 | if (input == 'W') 14 | win++; 15 | } 16 | cout << arr[win]; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/14065. Gorivo/Gorivo.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | const double liter = 3.785411784; 8 | const double km = 1.609344; 9 | double x; 10 | cin >> x; 11 | printf("%f", 100 / ((km / liter) * x)); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/14173. Square Pasture/Square Pasture.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::max; 5 | using std::min; 6 | int main() 7 | { 8 | int x[4], y[4], a; 9 | cin >> x[0] >> y[0] >> x[1] >> y[1]; 10 | cin >> x[2] >> y[2] >> x[3] >> y[3]; 11 | a = max(max(x[1], x[3]) - min(x[0], x[2]), max(y[1], y[3]) - min(y[0], y[2])); 12 | cout << (a * a); 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/14337. Helicopter/Helicopter.vb: -------------------------------------------------------------------------------- 1 | Module Main 2 | Sub Main() 3 | Console.WriteLine(" ===================") 4 | Console.WriteLine(" ____||___") 5 | Console.WriteLine("\ / / []\") 6 | Console.WriteLine(" X======= \__") 7 | Console.WriteLine("/ \ \____________|") 8 | Console.WriteLine(" || ||") 9 | Console.WriteLine(" \-----------/") 10 | End Sub 11 | End Module -------------------------------------------------------------------------------- /백준/Bronze/14470. 전자레인지/전자레인지.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b,c,d,e; 6 | scanf("%d%d%d%d%d",&a,&b,&c,&d,&e); 7 | if (a<0) 8 | { 9 | printf("%d",(-1*(a*c))+d+(b*e)); 10 | } 11 | else 12 | { 13 | if (a==0) 14 | { 15 | printf("%d",d+(b*e)); 16 | } 17 | else 18 | { 19 | printf("%d",((b-a)*e)); 20 | } 21 | } 22 | return 0; 23 | } 24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/14489. 치킨 두 마리 （．．．）/치킨 두 마리 （．．．）.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b,c; 6 | scanf("%d%d%d",&a,&b,&c); 7 | 8 | if (a+b>=c*2) 9 | { 10 | printf("%d",(a+b)-(c*2)); 11 | } 12 | else 13 | { 14 | printf("%d",a+b); 15 | } 16 | 17 | return 0; 18 | } 19 | 20 | -------------------------------------------------------------------------------- /백준/Bronze/14581. 팬들에게 둘러싸인 홍준/팬들에게 둘러싸인 홍준.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import "fmt" 4 | 5 | func main() { 6 | a := "gg" 7 | fmt.Scanf("%s", &a) 8 | fmt.Printf(":fan::fan::fan:\n") 9 | fmt.Printf(":fan::%s::fan:\n", a) 10 | fmt.Printf(":fan::fan::fan:\n") 11 | } 12 | -------------------------------------------------------------------------------- /백준/Bronze/14645. 와이버스 부릉부릉/와이버스 부릉부릉.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import "fmt" 4 | 5 | func main() { 6 | fmt.Printf("비와이") 7 | } 8 | -------------------------------------------------------------------------------- /백준/Bronze/14652. 나는 행복합니다～/나는 행복합니다～.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c, d = 0; 6 | scanf("%d %d %d", &a, &b, &c); 7 | 8 | for (int i = 0; i < a; i++) 9 | { 10 | for (int j = 0; j < b; j++) 11 | { 12 | if (d == c) 13 | { 14 | printf("%d %d", i, j); 15 | } 16 | d++; 17 | } 18 | } 19 | 20 | return 0; 21 | } -------------------------------------------------------------------------------- /백준/Bronze/14656. 조교는 새디스트야！！/조교는 새디스트야！！.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | int main() 5 | { 6 | int n; 7 | int input; 8 | int count = 0; 9 | cin >> n; 10 | for (int i = 1; i <= n; i++) 11 | { 12 | cin >> input; 13 | count += (input != i) ? 1 : 0; 14 | } 15 | cout << count; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/14928. 큰 수 （BIG）/큰 수 （BIG）.py: -------------------------------------------------------------------------------- 1 | print(int(input()) % 20000303) -------------------------------------------------------------------------------- /백준/Bronze/15000. CAPS/CAPS.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cout; 3 | 4 | int main() 5 | { 6 | char n; 7 | while (scanf("%c", &n) && n != '\n') 8 | cout << char(n - 32); 9 | return 0; 10 | } -------------------------------------------------------------------------------- /백준/Bronze/15025. Judging Moose/Judging Moose.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::max; 5 | 6 | int main() 7 | { 8 | int l, r; 9 | cin >> l >> r; 10 | if (l || r) 11 | cout << ((l == r) ? "Even " : "Odd ") << (max(l, r) * 2); 12 | else 13 | cout << "Not a moose"; 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/15051. Máquina de café/Máquina de café.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::min; 6 | 7 | int main() 8 | { 9 | int a1, a2, a3, i1, i2, i3; 10 | cin >> a1 >> a2 >> a3; 11 | i1 = a2 * 2 + a3 * 4; 12 | i2 = a1 * 2 + a3 * 2; 13 | i3 = a1 * 4 + a2 * 2; 14 | cout << min({i1, i2, i3}); 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/15059. Hard choice/Hard choice.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int c1, p1, b1, c2, p2, b2; 8 | cin >> c1 >> p1 >> b1 >> c2 >> p2 >> b2; 9 | cout << (((c2 - c1) > 0) * (c2 - c1)) + (((b2 - b1) > 0) * (b2 - b1)) + (((p2 - p1) > 0) * (p2 - p1)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/15080. Every Second Counts/Every Second Counts.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cout; 3 | 4 | int main() 5 | { 6 | int h1, m1, s1, h2, m2, s2, a, b; 7 | scanf("%d : %d : %d", &h1, &m1, &s1); 8 | scanf("%d : %d : %d", &h2, &m2, &s2); 9 | a = h1 * 3600 + m1 * 60 + s1; 10 | b = h2 * 3600 + m2 * 60 + s2; 11 | cout << (((b - a) < 0) ? (b - a + 86400) : (b - a)); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/15128. Congruent Numbers/Congruent Numbers.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | long int p1, q1, p2, q2; 8 | cin >> p1 >> q1 >> p2 >> q2; 9 | cout << !((p1 * p2) % (q1 * q2 * 2)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/15232. Rectangles/Rectangles.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int r, c; 8 | cin >> r >> c; 9 | for (int i = 0; i < r; i++) 10 | { 11 | for (int i = 0; i < c; i++) 12 | cout << '*'; 13 | cout << '\n'; 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/15372. A Simple Problem．/A Simple Problem．.py: -------------------------------------------------------------------------------- 1 | import sys 2 | for _ in range(int(input())): 3 | print(int(sys.stdin.readline())**2) -------------------------------------------------------------------------------- /백준/Bronze/15439. Vera and Outfits/Vera and Outfits.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | cout << (n * n) - n; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/15474. 鉛筆 （Pencils）/鉛筆 （Pencils）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, a, b, c, d, x, y; 8 | cin >> n >> a >> b >> c >> d; 9 | x = (((n / a) + (n % a != 0)) * b); 10 | y = (((n / c) + (n % c != 0)) * d); 11 | cout << (x < y ? x : y); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/15552. 빠른 A＋B/빠른 A＋B.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | int c; 8 | 9 | scanf("%d", &a); 10 | 11 | for (int i = 0; i < a; i++) 12 | { 13 | scanf("%d %d", &b, &c); 14 | printf("%d\n", b+c); 15 | } 16 | 17 | 18 | 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /백준/Bronze/15596. 정수 N개의 합/정수 N개의 합.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | long long sum(int *a, int n) 4 | { 5 | long long add = 0; 6 | for (int i = 0; i < n; i++) 7 | { 8 | add = add + a[i]; 9 | } 10 | return add; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/15610. Abbey Courtyard/Abbey Courtyard.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | 5 | int main() 6 | { 7 | long long int a; 8 | cin >> a; 9 | printf("%f", sqrt(a) * 4); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/15680. 연세대학교/연세대학교.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d",&a); 7 | if (a==0) 8 | { 9 | printf("YONSEI"); 10 | } 11 | if (a==1) 12 | { 13 | printf("Leading the Way to the Future"); 14 | } 15 | 16 | return 0; 17 | 18 | } -------------------------------------------------------------------------------- /백준/Bronze/15700. 타일 채우기 4/타일 채우기 4.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | long n, m; 6 | scanf("%ld %ld", &n, &m); 7 | printf("%ld", (m * n) / 2); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /백준/Bronze/15726. 이칙연산/이칙연산.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | double a, b, c; 8 | cin >> a >> b >> c; 9 | cout << int((a * b / c > a / b * c) ? (a * b / c) : (a / b * c)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/15727. 조별과제를 하려는데 조장이 사라졌다/조별과제를 하려는데 조장이 사라졌다.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d", &a); 7 | printf("%d", a / 5 + (a % 5 != 0)); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/15733. 나는 누구인가/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 나는 누구인가 - 15733 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/15733) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 872 KB, 시간: 4 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

당신은 지금 코딩을 하고있다. 그럼 당신은 어떤 사람인가.

16 | 17 | ### 입력 18 | 19 |

없다.

20 | 21 | ### 출력 22 | 23 |

“I'm Sexy”를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/15733. 나는 누구인가/나는 누구인가.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import "fmt" 4 | 5 | func main() { 6 | fmt.Printf("I'm Sexy") 7 | } 8 | -------------------------------------------------------------------------------- /백준/Bronze/15740. A＋B － 9/A＋B － 9.py: -------------------------------------------------------------------------------- 1 | a, b = input().split() 2 | a=int(a) 3 | b=int(b) 4 | print(a+b) -------------------------------------------------------------------------------- /백준/Bronze/15873. 공백 없는 A＋B/공백 없는 A＋B.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int input; 5 | int a; 6 | int b; 7 | 8 | scanf("%d", &input); 9 | 10 | if((input%100)==10) 11 | { 12 | a = input/100; 13 | b = 10; 14 | } 15 | else 16 | { 17 | a = input/10; 18 | b = input%10; 19 | } 20 | 21 | printf("%d",a+b); 22 | 23 | return 0; 24 | } -------------------------------------------------------------------------------- /백준/Bronze/15921. 수찬은 마린보이야！！/수찬은 마린보이야！！.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, input; 8 | cin >> n; 9 | for (int i = 0; i < n; i++) 10 | cin >> input; 11 | cout << ((n == 0) ? "divide by zero" : "1.00"); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/15962. 새로운 시작/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 새로운 시작 - 15962 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/15962) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 892 KB, 시간: 4 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

부산일과학고등학교는 태어난지 얼마 안 된 킹-갓 과학고등학교다. 우리들을 위해 응원의 한마디를 출력하자.

16 | 17 | ### 입력 18 | 19 |

입력은 없다.

20 | 21 | ### 출력 22 | 23 |

파이팅!!을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/15962. 새로운 시작/새로운 시작.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import "fmt" 4 | 5 | func main() { 6 | fmt.Printf("파이팅!!") 7 | } 8 | -------------------------------------------------------------------------------- /백준/Bronze/15963. CASIO/CASIO.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | long long int a, b; 8 | cin >> a >> b; 9 | cout << ((a == b) ? 1 : 0); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/15964. 이상한 기호/이상한 기호.c: -------------------------------------------------------------------------------- 1 | #include 2 | long long h(int a,int b) 3 | { 4 | return (a+b)*(a-b); 5 | } 6 | 7 | int main(){ 8 | int a; 9 | int b; 10 | 11 | scanf("%d %d",&a,&b); 12 | printf("%lld",h(a,b)); 13 | 14 | 15 | 16 | } -------------------------------------------------------------------------------- /백준/Bronze/16017. Telemarketer or not？/Telemarketer or not？.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c, d; 8 | cin >> a >> b >> c >> d; 9 | if ((a == 8 || a == 9) && (b == c) && (d == 8 || d == 9)) 10 | cout << "ignore"; 11 | else 12 | cout << "answer"; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/16099. Larger Sport Facility/Larger Sport Facility.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | unsigned long long int a, b, c, d; 9 | cin >> n; 10 | for (int i = 0; i < n; i++) 11 | { 12 | cin >> a >> b >> c >> d; 13 | cout << (((a * b) == (c * d)) ? "Tie" : ((a * b) > (c * d) ? "TelecomParisTech" : "Eurecom")) << '\n'; 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/16170. 오늘의 날짜는？/오늘의 날짜는？.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import "fmt" 4 | 5 | func main() { 6 | fmt.Printf("2022\n08\n15") 7 | } 8 | -------------------------------------------------------------------------------- /백준/Bronze/16199. 나이 계산하기/나이 계산하기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c, d, e, f; 8 | cin >> a >> b >> c >> d >> e >> f; 9 | cout << (((d - a) * 365 + (e - b) * 30 + (f - c)) / 365) << '\n'; 10 | cout << (d - a + 1) << '\n'; 11 | cout << (d - a); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/16204. 카드 뽑기/카드 뽑기.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n, m, k; 6 | scanf("%d %d %d", &n, &m, &k); 7 | printf("%d", ((m < k) ? m : k) + ((n - m < n - k) ? n - m : n - k)); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /백준/Bronze/16394. 홍익대학교/홍익대학교.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int a; 6 | scanf("%d",&a); 7 | printf("%d",a-1946); 8 | return 0; 9 | 10 | } -------------------------------------------------------------------------------- /백준/Bronze/16430. 제리와 톰/제리와 톰.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b; 6 | scanf("%d%d",&a,&b); 7 | printf("%d %d",b-a,b); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/16486. 운동장 한 바퀴/운동장 한 바퀴.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | 4 | int main() 5 | { 6 | double a, b; 7 | cin >> a >> b; 8 | printf("%f", (a * 2) + (b * 2 * 3.141592)); 9 | return 0; 10 | } -------------------------------------------------------------------------------- /백준/Bronze/16600. Contemporary Art/Contemporary Art.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | int main() 6 | { 7 | long long int a; 8 | cin >> a; 9 | printf("%f", sqrt(a) * 4); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/16693. Pizza Deal/Pizza Deal.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | double a1, p1, r1, p2; 8 | const double pi = 3.14159265359; 9 | cin >> a1 >> p1 >> r1 >> p2; 10 | cout << (((p1 / a1) < (p2 / (r1 * r1 * pi))) ? "Slice of pizza" : "Whole pizza"); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/17009. Winning Score/Winning Score.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a[3], b[3], apples, bananas; 8 | cin >> a[0] >> a[1] >> a[2] >> b[0] >> b[1] >> b[2]; 9 | apples = (a[0] * 3 + a[1] * 2 + a[2]); 10 | bananas = (b[0] * 3 + b[1] * 2 + b[2]); 11 | cout << ((apples == bananas) ? 'T' : ((apples > bananas) ? 'A' : 'B')); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/1712. 손익분기점/손익분기점.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int i = 0; 6 | int a; 7 | int b; 8 | int c; 9 | 10 | 11 | scanf("%d", &a); 12 | scanf("%d", &b); 13 | scanf("%d", &c); 14 | if (b>=c) 15 | { 16 | printf("-1"); 17 | } 18 | else 19 | { 20 | printf("%d\n",a/(c-b)+1); 21 | } 22 | 23 | 24 | return 0; 25 | 26 | } 27 | -------------------------------------------------------------------------------- /백준/Bronze/17256. 달달함이 넘쳐흘러/달달함이 넘쳐흘러.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c, d, e, f; 6 | scanf("%d%d%d\n%d%d%d", &a, &b, &c, &d, &e, &f); 7 | printf("%d %d %d", d - c, e / b, f - a); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /백준/Bronze/17295. 엔드게임 스포일러/엔드게임 스포일러.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import "fmt" 4 | 5 | func main() { 6 | fmt.Printf("Avengers: Endgame") 7 | } 8 | -------------------------------------------------------------------------------- /백준/Bronze/17356. 욱 제/욱 제.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | 6 | int main() 7 | { 8 | double a, b; 9 | cin >> a >> b; 10 | cout << 1 / (1 + pow(10, ((b - a) / 400))); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/17362. 수학은 체육과목 입니다 2/수학은 체육과목 입니다 2.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | const int arr[8]{2, 1, 2, 3, 4, 5, 4, 3}; 9 | cin >> n; 10 | cout << arr[n % 8]; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/17863. FYI/FYI.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | int count = 0; 9 | string n; 10 | cin >> n; 11 | for (int i = 0; i < n.length() && n[i] == '5'; i++) 12 | count++; 13 | if (count >= 3) 14 | cout << "YES"; 15 | else 16 | cout << "NO"; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/17874. Piece of Cake！/Piece of Cake！.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, h, v; 8 | cin >> n >> h >> v; 9 | h = ((n - h) > h) ? n - h : h; 10 | v = ((n - v) > v) ? n - v : v; 11 | cout << v * h * 4; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/1809. Moo/Moo.gs: -------------------------------------------------------------------------------- 1 | '(___) 2 | (o o)____/ 3 | @@ \ 4 | \ ____,/ 5 | // // 6 | ^^ ^^' -------------------------------------------------------------------------------- /백준/Bronze/18096. Арифметическая магия/Арифметическая магия.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | cout << 1; 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/18108. 1998년생인 내가 태국에서는 2541년생？！/1998년생인 내가 태국에서는 2541년생？！.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d", &a); 7 | printf("%d",a-543); 8 | 9 | 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/18301. Rats/Rats.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c; 8 | cin >> a >> b >> c; 9 | cout << ((((a + 1) * (b + 1)) / (c + 1)) - 1); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/18330. Petrol/Petrol.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, k; 8 | cin >> n >> k; 9 | cout << ((n <= (60 + k)) ? n * 1500 : (((60 + k) * 1500) + ((n - (60 + k)) * 3000))); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/18398. HOMWRK/HOMWRK.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int t, n, a, b; 8 | cin >> t; 9 | for (int i = 0; i < t; i++) 10 | { 11 | cin >> n; 12 | for (int j = 0; j < n; j++) 13 | { 14 | cin >> a >> b; 15 | cout << a + b << ' ' << a * b << '\n'; 16 | } 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Bronze/18408. 3 つの整数 （Three Integers）/3 つの整数 （Three Integers）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int input, arr[2]{0}; 8 | for (int i = 0; i < 3; i++) 9 | { 10 | cin >> input; 11 | arr[input - 1]++; 12 | } 13 | cout << ((arr[0] > arr[1]) ? 1 : 2); 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/18409. 母音を数える （Counting Vowels）/母音を数える （Counting Vowels）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, count = 0; 8 | char s[51]; 9 | cin >> n >> s; 10 | for (int i = 0; i < n; i++) 11 | if ((s[i] == 'a') || (s[i] == 'i') || (s[i] == 'u') || (s[i] == 'e') || (s[i] == 'o')) 12 | count++; 13 | cout << count; 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/18411. 試験 （Exam）/試験 （Exam）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int arr[3]; 10 | cin >> arr[0] >> arr[1] >> arr[2]; 11 | sort(arr, arr + 3); 12 | cout << arr[1] + arr[2]; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/18414. X に最も近い値 （The Nearest Value）/X に最も近い値 （The Nearest Value）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int x, l, r; 8 | cin >> x >> l >> r; 9 | cout << ((l <= x && x <= r) ? x : ((x < l) ? l : r)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/18698. The Walking Adam/The Walking Adam.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | int t; 9 | cin >> t; 10 | while (t--) 11 | { 12 | int count = 0; 13 | string str; 14 | cin >> str; 15 | for (char &c : str) 16 | { 17 | if (c == 'U') 18 | count++; 19 | else 20 | break; 21 | } 22 | cout << count << '\n'; 23 | } 24 | return 0; 25 | } -------------------------------------------------------------------------------- /백준/Bronze/1934. 최소공배수/최소공배수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int gcd(int a, int b) { return (!b ? a : gcd(b, a % b)); } 6 | 7 | int main() 8 | { 9 | int t, a, b; 10 | cin >> t; 11 | while (t--) 12 | { 13 | cin >> a >> b; 14 | cout << a * b / gcd(a, b) << '\n'; 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/19602. Dog Treats/Dog Treats.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int s, m, l; 8 | cin >> s >> m >> l; 9 | if ((s + (m * 2) + (l * 3)) >= 10) 10 | cout << "happy"; 11 | else 12 | cout << "sad"; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/19698. 헛간 청약/헛간 청약.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, w, h, l; 8 | cin >> n >> w >> h >> l; 9 | cout << ((n < ((w / l) * (h / l))) ? (n) : ((w / l) * (h / l))); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/19944. 뉴비의 기준은 뭘까？/뉴비의 기준은 뭘까？.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, m; 8 | cin >> n >> m; 9 | if (m == 1 || m == 2) 10 | cout << "NEWBIE!"; 11 | else if (m <= n) 12 | cout << "OLDBIE!"; 13 | else 14 | cout << "TLE!"; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/2010. 플러그/플러그.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | 10 | int sum = 0; 11 | for (int i = 0; i < n; i++) 12 | { 13 | int input; 14 | cin >> input; 15 | sum += input; 16 | } 17 | 18 | cout << sum - (n - 1); 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Bronze/20215. Cutting Corners/Cutting Corners.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | 5 | int main() 6 | { 7 | double w, h; 8 | cin >> w >> h; 9 | printf("%f", ((w + h) - sqrt(w * w + h * h))); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/20233. Bicycle/Bicycle.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, x, b, y, t; 8 | cin >> a >> x >> b >> y >> t; 9 | cout << (a + (((((t - 30) > 0) * (t - 30)) * x) * 21)) << ' ' << (b + (((((t - 45) > 0) * (t - 45)) * y) * 21)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/20254. Site Score/Site Score.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c, d; 6 | scanf("%d%d%d%d", &a, &b, &c, &d); 7 | printf("%d", (a * 56) + (b * 24) + (c * 14) + (d * 6)); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/20352. Circus/Circus.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | 6 | int main() 7 | { 8 | const double pi(3.14159265359); 9 | double a; 10 | cin >> a; 11 | printf("%f", sqrt(a / pi) * 2 * pi); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/20353. Atrium/Atrium.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | 5 | int main() 6 | { 7 | unsigned long long int a; 8 | cin >> a; 9 | printf("%f", (sqrt(a) * 4)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/20492. 세금/세금.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d", &a); 7 | printf("%d %d", a - ((a * 22) / 100), a - ((((a * 20) / 100) * 22) / 100)); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/20499. Darius님 한타 안 함？/Darius님 한타 안 함？.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c; 6 | scanf("%d/%d/%d", &a, &b, &c); 7 | if (a + c < b || b == 0) 8 | { 9 | printf("hasu"); 10 | } 11 | else 12 | { 13 | printf("gosu"); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/20673. Covid－19/Covid－19.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int p, q; 8 | cin >> p >> q; 9 | if (p <= 50 && q <= 10) 10 | cout << "White"; 11 | else if (q > 30) 12 | cout << "Red"; 13 | else 14 | cout << "Yellow"; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/20833. Kuber/Kuber.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, count = 0; 8 | cin >> n; 9 | for (int i = 1; i <= n; i++) 10 | count += i * i * i; 11 | cout << count; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/20976. 2 番目に大きい整数 （The Second Largest Integer）/2 番目に大きい整数 （The Second Largest Integer）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int input[3]; 10 | cin >> input[0] >> input[1] >> input[2]; 11 | sort(input, input + 3); 12 | cout << input[1]; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/21300. Bottle Return/Bottle Return.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c, d, e, f; 6 | scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f); 7 | printf("%d", (a * 5) + (b * 5) + (c * 5) + (d * 5) + (e * 5) + (f * 5)); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/21335. Another Eruption/Another Eruption.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | 6 | int main() 7 | { 8 | unsigned long long int a; 9 | const double pi = 3.14159265359; 10 | cin >> a; 11 | printf("%f", 2 * pi * sqrt(a / pi)); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/21354. Äpplen och päron/Äpplen och päron.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, p; 8 | cin >> a >> p; 9 | a *= 7; 10 | p *= 13; 11 | cout << ((a == p) ? "lika" : ((a > p) ? "Axel" : "Petra")); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/21591. Laptop Sticker/Laptop Sticker.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int wc, hc, ws, hs; 8 | cin >> wc >> hc >> ws >> hs; 9 | cout << ((wc > (ws + 1)) && (hc > (hs + 1))); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/21598. SciComLove/SciComLove.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n = 0; 6 | scanf("%d", &n); 7 | for (int i = 0; i < n; i++) 8 | { 9 | printf("SciComLove\n"); 10 | } 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/21612. Boiling Water/Boiling Water.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int b, p; 8 | cin >> b; 9 | p = (b * 5) - 400; 10 | cout << p << '\n'; 11 | cout << (p == 100 ? 0 : ((p < 100) ? 1 : -1)); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/21633. Bank Transfer/Bank Transfer.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | double k; 8 | cin >> k; 9 | if ((k / 100 + 25) < 100) 10 | printf("%.2f", double(100)); 11 | else if ((k / 100 + 25) > 2000) 12 | printf("%.2f", double(2000)); 13 | else 14 | printf("%.2f", (k / 100 + 25)); 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/21964. 선린인터넷고등학교 교가/선린인터넷고등학교 교가.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int b; 6 | scanf("%d", &b); 7 | char a[b]; 8 | getchar(); 9 | scanf("%s", a); 10 | 11 | for (int i = b - 5; i < b; i++) 12 | { 13 | printf("%c", a[i]); 14 | } 15 | 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/22015. 金平糖 （Konpeito）/金平糖 （Konpeito）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::max; 6 | int main() 7 | { 8 | int a, b, c; 9 | cin >> a >> b >> c; 10 | cout << ((max({a, b, c}) * 3) - (a + b + c)); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/22155. Простая задача/Простая задача.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, i, f; 8 | cin >> n; 9 | while (n--) 10 | { 11 | cin >> i >> f; 12 | cout << (((i <= 1 && f <= 2) || (i <= 2 && f <= 1)) ? "Yes" : "No") << '\n'; 13 | } 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/22193. Multiply/Multiply.py: -------------------------------------------------------------------------------- 1 | n,m = map(int,input().split()) 2 | a = int(input()) 3 | b = int(input()) 4 | print(a*b) -------------------------------------------------------------------------------- /백준/Bronze/23234. The World Responds/The World Responds.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | printf("The world says hello!"); 7 | return 0; 8 | 9 | } -------------------------------------------------------------------------------- /백준/Bronze/2338. 긴자리 계산/긴자리 계산.py: -------------------------------------------------------------------------------- 1 | a = int(input()) 2 | b = int(input()) 3 | 4 | print(a+b) 5 | print(a-b) 6 | print(a*b) -------------------------------------------------------------------------------- /백준/Bronze/2377. Pottery/Pottery.bas: -------------------------------------------------------------------------------- 1 | print" _________" 2 | print" \_ _/" 3 | print" \ /" 4 | print" | |" 5 | print" / \" 6 | print" / \" 7 | print" | |" 8 | print"/---------\" 9 | print"| \-/ \-/ |" 10 | print"\---------/" 11 | print" \_______/" -------------------------------------------------------------------------------- /백준/Bronze/23795. 사장님 도박은 재미로 하셔야 합니다/사장님 도박은 재미로 하셔야 합니다.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,out=0; 6 | while (1) 7 | { 8 | scanf("%d",&a); 9 | if (a==-1) 10 | { 11 | break; 12 | } 13 | out=a+out; 14 | } 15 | printf("%d",out); 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /백준/Bronze/23825. SASA 모형을 만들어보자/SASA 모형을 만들어보자.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, m; 8 | cin >> n >> m; 9 | cout << ((n / 2) < (m / 2) ? (n / 2) : (m / 2)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/24072. 帰省 （Homecoming）/帰省 （Homecoming）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c; 8 | cin >> a >> b >> c; 9 | cout << (a <= c && c < b); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/24075. 計算 （Calculation）/計算 （Calculation）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::max; 5 | using std::min; 6 | 7 | int main() 8 | { 9 | int a, b; 10 | cin >> a >> b; 11 | cout << max(a + b, a - b) << ' ' << min(a + b, a - b); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/24078. 余り （Remainder）/余り （Remainder）.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int x; 5 | scanf("%d",&x); 6 | printf("%d",x%21); 7 | return 0; 8 | } -------------------------------------------------------------------------------- /백준/Bronze/24079. 移動 （Moving）/移動 （Moving）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int x, y, z; 8 | cin >> x >> y >> z; 9 | cout << (((x + y) * 60) <= (z * 60 + 30)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/24082. 立方体 （Cube）/立方体 （Cube）.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d",&a); 7 | printf("%d",a*a*a); 8 | return 0; 9 | 10 | } -------------------------------------------------------------------------------- /백준/Bronze/24083. 短針 （Hour Hand）/短針 （Hour Hand）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | cout << ((a + b) % 12 + (!((a + b) % 12) * 12)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/24086. 身長 （Height）/身長 （Height）.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int a,b; 6 | scanf("%d %d",&a,&b); 7 | printf("%d",b-a); 8 | return 0; 9 | 10 | } -------------------------------------------------------------------------------- /백준/Bronze/24087. アイスクリーム （Ice Cream）/アイスクリーム （Ice Cream）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int s, a, b; 8 | cin >> s >> a >> b; 9 | cout << (250 + ((s - a) / b + !!((s - a) % b)) * (s > a) * 100); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/24183. Affischutskicket/Affischutskicket.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int c4, a3, a4; 8 | cin >> c4 >> a3 >> a4; 9 | cout << ((c4 * 148392 + a3 * 249480 + a4 * 62370) * 0.000001); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/2420. 사파리월드/사파리월드.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | long long a; 5 | long long b; 6 | 7 | scanf("%lld %lld",&a,&b); 8 | 9 | if (0>a-b) 10 | { 11 | printf("%lld",-(a-b)); 12 | } 13 | else 14 | { 15 | printf("%lld",(a-b)); 16 | } 17 | 18 | 19 | 20 | 21 | } -------------------------------------------------------------------------------- /백준/Bronze/24262. 알고리즘 수업 － 알고리즘의 수행 시간 1/알고리즘 수업 － 알고리즘의 수행 시간 1.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d", &a); 7 | printf("1\n0"); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/24294. ГРАДИНА/ГРАДИНА.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::max; 5 | 6 | int main() 7 | { 8 | int w1, h1, w2, h2; 9 | cin >> w1 >> h1 >> w2 >> h2; 10 | cout << ((max(w1, w2) + h1 + h2) * 2) + 4; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/24309. РАВЕНСТВО/РАВЕНСТВО.py: -------------------------------------------------------------------------------- 1 | a = int(input()) 2 | b = int(input()) 3 | c = int(input()) 4 | print((b-c)//a) -------------------------------------------------------------------------------- /백준/Bronze/24365. ПЧЕЛИЧКАТА МАЯ/ПЧЕЛИЧКАТА МАЯ.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c, average; 8 | cin >> a >> b >> c; 9 | average = (a + b + c) / 3; 10 | cout << (b - average) + (c - average) * 2; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/2438. 별 찍기 － 1/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 별 찍기 - 1 - 2438 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2438) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

첫째 줄에는 별 1개, 둘째 줄에는 별 2개, N번째 줄에는 별 N개를 찍는 문제

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 N(1 ≤ N ≤ 100)이 주어진다.

20 | 21 | ### 출력 22 | 23 |

첫째 줄부터 N번째 줄까지 차례대로 별을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/2438. 별 찍기 － 1/별 찍기 － 1.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | int c; 8 | scanf("%d", &a); 9 | 10 | for (int i = 1; i <= a; i++) 11 | { 12 | for (int in = 0; in < i; in++) 13 | { 14 | printf("*"); 15 | } 16 | printf("\n"); 17 | } 18 | 19 | 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /백준/Bronze/2440. 별 찍기 － 3/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze IV] 별 찍기 - 3 - 2440 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2440) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

첫째 줄에는 별 N개, 둘째 줄에는 별 N-1개, ..., N번째 줄에는 별 1개를 찍는 문제

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 N(1 ≤ N ≤ 100)이 주어진다.

20 | 21 | ### 출력 22 | 23 |

첫째 줄부터 N번째 줄까지 차례대로 별을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/2440. 별 찍기 － 3/별 찍기 － 3.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | int N; 5 | scanf("%d", &N); 6 | for (int i = N; i > 0; i--) { 7 | for (int j = 0; j < i; j++)printf("*"); 8 | printf("\n"); 9 | } 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/2441. 별 찍기 － 4/별 찍기 － 4.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | for (int i = 0; i < n; i++) 10 | { 11 | for (int j = 0; j < i; j++) 12 | cout << ' '; 13 | for (int j = 0; j < n - i; j++) 14 | cout << '*'; 15 | cout << '\n'; 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/24416. 알고리즘 수업 － 피보나치 수 1/알고리즘 수업 － 피보나치 수 1.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int dp(int n) 6 | { 7 | if (n == 1 || n == 2) 8 | return 1; 9 | else if (n > 2) 10 | return dp(n - 1) + dp(n - 2); 11 | return 0; 12 | } 13 | 14 | int main() 15 | { 16 | int n; 17 | cin >> n; 18 | cout << dp(n) << ' ' << n - 2; 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Bronze/2444. 별 찍기 － 7/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze III] 별 찍기 - 7 - 2444 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2444) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 2020 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현 12 | 13 | ### 제출 일자 14 | 15 | 2024년 4월 27일 23:10:16 16 | 17 | ### 문제 설명 18 | 19 |

예제를 보고 규칙을 유추한 뒤에 별을 찍어 보세요.

20 | 21 | ### 입력 22 | 23 |

첫째 줄에 N(1 ≤ N ≤ 100)이 주어진다.

24 | 25 | ### 출력 26 | 27 |

첫째 줄부터 2×N-1번째 줄까지 차례대로 별을 출력한다.

28 | 29 | -------------------------------------------------------------------------------- /백준/Bronze/24568. Cupcake Party/Cupcake Party.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | cout << ((a * 8) + (b * 3)) - 28; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/24723. 녹색거탑/녹색거탑.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b = 1; 6 | scanf("%d", &a); 7 | for (int i = 0; i < a; i++) 8 | { 9 | b = b * 2; 10 | } 11 | printf("%d", b); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/24736. Football Scoring/Football Scoring.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c, d, e; 8 | for (int i = 0; i < 2; i++) 9 | { 10 | cin >> a >> b >> c >> d >> e; 11 | cout << (a * 6 + b * 3 + c * 2 + d + e * 2) << '\n'; 12 | } 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/2475. 검증수/검증수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b,c,d,e; 6 | scanf("%d %d %d %d %d",&a,&b,&c,&d,&e); 7 | printf("%d",((a*a)+(b*b)+(c*c)+(d*d)+(e*e))%10); 8 | return 0; 9 | } 10 | 11 | -------------------------------------------------------------------------------- /백준/Bronze/24751. Betting/Betting.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | double a; 8 | cin >> a; 9 | cout << 100 / a << ' ' << 100 / (100 - a); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/24860. Counting Antibodies/Counting Antibodies.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | long long int vk, jk, va, ja, vh, dh, jh; 8 | cin >> vk >> jk >> va >> ja >> vh >> dh >> jh; 9 | cout<<(vh * dh * jh)*((vk * jk)+(va * ja)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/24883. 자동완성/자동완성.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | char a; 6 | scanf("%c", &a); 7 | if (a == 'n' || a == 'N') 8 | { 9 | printf("Naver D2"); 10 | } 11 | else 12 | { 13 | printf("Naver Whale"); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/24900. 한별 찍기/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 한별 찍기 - 24900 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/24900) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 4528 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

한별이를 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 | Empty 20 | 21 | ### 출력 22 | 23 |

한별이를 아래 예제 출력과 같이 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/25083. 새싹/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 새싹 - 25083 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/25083) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

아래 예제와 같이 새싹을 출력하시오.

16 | 17 | ### 입력 18 | 19 |

입력은 없다.

20 | 21 | ### 출력 22 | 23 |

새싹을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/25083. 새싹/새싹.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | printf(" ,r'\"7\n"); 6 | printf("r`-_ ,' ,/\n"); 7 | printf(" \\. \". L_r'\n"); 8 | printf(" `~\\/\n"); 9 | printf(" |\n"); 10 | printf(" |"); 11 | 12 | 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/25191. 치킨댄스를 추는 곰곰이를 본 임스/치킨댄스를 추는 곰곰이를 본 임스.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c; 6 | scanf("%d%d%d", &a, &b, &c); 7 | if (a >= b / 2 + c) 8 | { 9 | printf("%d", b / 2 + c); 10 | } 11 | else 12 | { 13 | printf("%d", a); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/25238. 가희와 방어율 무시/가희와 방어율 무시.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b; 7 | scanf("%d %d", &a, &b); 8 | if ((a * (100 - b)) / 100 >= 100) 9 | { 10 | printf("0"); 11 | } 12 | else 13 | { 14 | printf("1"); 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/2530. 인공지능 시계/인공지능 시계.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c, d, S; 8 | cin >> a >> b >> c >> d; 9 | S = a * 3600 + b * 60 + c + d; 10 | cout << ((S / 3600) % 24) << ' ' << ((S % 3600) / 60) << ' ' << ((S % 3600) % 60); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/25305. 커트라인/커트라인.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int arr[1000], n, k; 10 | cin >> n >> k; 11 | for (int i = 0; i < n; i++) 12 | cin >> arr[i]; 13 | sort(arr, arr + n); 14 | cout << arr[n - k]; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/25311. UCPC에서 가장 쉬운 문제 번호는？/UCPC에서 가장 쉬운 문제 번호는？.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d",&a); 7 | printf("A"); 8 | return 0; 9 | 10 | } -------------------------------------------------------------------------------- /백준/Bronze/25314. 코딩은 체육과목 입니다/코딩은 체육과목 입니다.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d", &a); 7 | for (int i = 0; i < a / 4 + (a % 4 != 0); i++) 8 | { 9 | printf("long "); 10 | } 11 | printf("int"); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/25377. 빵/빵.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, a, b, min = 1001; 8 | cin >> n; 9 | while (n--) 10 | { 11 | cin >> a >> b; 12 | min = ((a <= b) && (b < min)) ? b : min; 13 | } 14 | cout << min; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/2557. Hello World/Hello World.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | printf("Hello World!"); 7 | 8 | 9 | return 0; 10 | 11 | } -------------------------------------------------------------------------------- /백준/Bronze/2557. Hello World/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] Hello World - 2557 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2557) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

16 | Hello World!를 출력하시오.

17 | 18 | ### 입력 19 | 20 |

21 | 없음

22 | 23 | ### 출력 24 | 25 |

26 | Hello World!를 출력하시오.

27 | 28 | -------------------------------------------------------------------------------- /백준/Bronze/2558. A＋B － 2/A＋B － 2.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int a,b; 6 | scanf("%d %d",&a,&b); 7 | printf("%d",a+b); 8 | return 0; 9 | 10 | } -------------------------------------------------------------------------------- /백준/Bronze/2558. A＋B － 2/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] A+B - 2 - 2558 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2558) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation), 사칙연산(arithmetic), 수학(math) 12 | 13 | ### 문제 설명 14 | 15 |

두 정수 A와 B를 입력받은 다음, A+B를 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 A, 둘째 줄에 B가 주어진다. (0 < A, B < 10)

20 | 21 | ### 출력 22 | 23 |

첫째 줄에 A+B를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/25600. Triathlon/Triathlon.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, a, d, g, max = 0, score; 8 | cin >> n; 9 | while (n--) 10 | { 11 | cin >> a >> d >> g; 12 | score = a * (d + g); 13 | score *= (a == (d + g)) + 1; 14 | max = (max < score) ? score : max; 15 | } 16 | cout << max; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/25625. 샤틀버스/샤틀버스.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int x, y; 6 | scanf("%d %d", &x, &y); 7 | printf("%d", (x - y) <= 0 ? y - x : x + y); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /백준/Bronze/25628. 햄버거 만들기/햄버거 만들기.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b; 6 | scanf("%d%d", &a, &b); 7 | if (a / 2 <= b) 8 | { 9 | printf("%d\n", a / 2); 10 | } 11 | else 12 | { 13 | printf("%d", b); 14 | } 15 | 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/25640. MBTI/MBTI.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import "fmt" 4 | 5 | func main() { 6 | var n int 7 | var count int = 0 8 | var a, b string 9 | fmt.Scanf("%s", &a) 10 | fmt.Scanf("%d", &n) 11 | for i := 0; i < n; i++ { 12 | fmt.Scanf("%s", &b) 13 | if a == b { 14 | count++ 15 | } 16 | } 17 | fmt.Printf("%d", count) 18 | } 19 | -------------------------------------------------------------------------------- /백준/Bronze/2577. 숫자의 개수/숫자의 개수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int count[10]; 4 | 5 | int main(){ 6 | int a; 7 | int b; 8 | int c; 9 | 10 | int num; 11 | 12 | scanf("%d %d %d",&a,&b,&c); 13 | 14 | num = a*b*c; 15 | 16 | for(int i=num;i>0;i/=10) 17 | count[i%10]++; 18 | 19 | for(int i=0;i<10;i++) 20 | printf("%d\n",count[i]); 21 | 22 | return 0; 23 | } -------------------------------------------------------------------------------- /백준/Bronze/25784. Easy－to－Solve Expressions/Easy－to－Solve Expressions.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c; 8 | cin >> a >> b >> c; 9 | if (b + c == a || a + c == b || a + b == c) 10 | cout << 1; 11 | else if (b * c == a || a * c == b || a * b == c) 12 | cout << 2; 13 | else 14 | cout << 3; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/2587. 대표값2/대표값2.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int arr[5]; 10 | for (int i = 0; i < 5; i++) 11 | cin >> arr[i]; 12 | sort(arr, arr + 5); 13 | cout << (arr[0] + arr[1] + arr[2] + arr[3] + arr[4]) / 5 << '\n'; 14 | cout << arr[2]; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/25881. Electric Bill/Electric Bill.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, n; 8 | cin >> a >> b >> n; 9 | 10 | for (int i = 0; i < n; i++) 11 | { 12 | int c; 13 | cin >> c; 14 | cout << c << ' ' << (c <= 1000 ? (c * a) : (1000 * a + (c - 1000) * b)) << '\n'; 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/26082. WARBOY/WARBOY.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c; 6 | scanf("%d %d %d", &a, &b, &c); 7 | printf("%d", ((b / a) * 3) * c); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/26209. Intercepting Information/Intercepting Information.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | for (int i = 0; i < 8; i++) 9 | { 10 | cin >> n; 11 | if (n == 9) 12 | { 13 | cout << 'F'; 14 | return 0; 15 | } 16 | } 17 | cout << 'S'; 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Bronze/26307. Correct/Correct.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int h, m; 8 | cin >> h >> m; 9 | cout << (((h - 9) * 60) + m); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/26332. Buying in Bulk/Buying in Bulk.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, c, p; 8 | cin >> n; 9 | while (n--) 10 | { 11 | cin >> c >> p; 12 | cout << c << ' ' << p << '\n'; 13 | cout << (p + ((c - 1) * (p - 2))) << '\n'; 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/26489. Gum Gum for Jay Jay/Gum Gum for Jay Jay.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int count = 0; 8 | char s[21]; 9 | while (scanf("%[^\n]%*c", s) != EOF) 10 | count++; 11 | cout << count; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/26531. Simple Sum/Simple Sum.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cout; 3 | 4 | int main() 5 | { 6 | int a, b, c; 7 | scanf("%d + %d = %d", &a, &b, &c); 8 | cout << (((a + b) == c) ? "YES" : "NO"); 9 | return 0; 10 | } -------------------------------------------------------------------------------- /백준/Bronze/26545. Mathematics/Mathematics.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, a, count = 0; 8 | cin >> n; 9 | for (int i = 0; i < n; i++) 10 | { 11 | cin >> a; 12 | count += a; 13 | } 14 | cout << count; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/26566. Pizza/Pizza.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | double n, a1, p1, r1, p2; 8 | const double pi = 3.14159265359; 9 | cin >> n; 10 | while (n--) 11 | { 12 | cin >> a1 >> p1 >> r1 >> p2; 13 | cout << (((p1 / a1) < (p2 / (r1 * r1 * pi))) ? "Slice of pizza" : "Whole pizza") << '\n'; 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/26574. Copier/Copier.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, copy; 8 | cin >> n; 9 | while (n--) 10 | { 11 | cin >> copy; 12 | cout << copy << ' ' << copy << '\n'; 13 | } 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/26575. Pups/Pups.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | double a, b, c; 9 | cin >> n; 10 | while (n--) 11 | { 12 | cin >> a >> b >> c; 13 | printf("$%.2f\n", a * b * c); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/26711. A＋B/A＋B.py: -------------------------------------------------------------------------------- 1 | a=int(input()) 2 | b=int(input()) 3 | print(a+b) -------------------------------------------------------------------------------- /백준/Bronze/26731. Zagubiona litera/Zagubiona litera.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | char c; 8 | bool check[26]{false}; 9 | for (int i = 0; i < 25; i++) 10 | { 11 | cin >> c; 12 | check[c - 65] = true; 13 | } 14 | for (int i = 0; i < 26; i++) 15 | if (!check[i]) 16 | cout << char(i + 65); 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/26742. Skarpetki/Skarpetki.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | char input; 8 | int black = 0, white = 0; 9 | while (scanf("%c", &input) && input != '\n') 10 | { 11 | if (input == 'B') 12 | black++; 13 | else 14 | white++; 15 | } 16 | cout << ((black / 2) + (white / 2)); 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/2675. 문자열 반복/문자열 반복.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | int t, r; 9 | string s; 10 | cin >> t; 11 | while (t--) 12 | { 13 | cin >> r >> s; 14 | for (int i = 0; i < s.length(); i++) 15 | for (int j = 0; j < r; j++) 16 | cout << s[i]; 17 | cout << '\n'; 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Bronze/2693. N번째 큰 수/N번째 큰 수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int t, arr[10]; 10 | cin >> t; 11 | while (t--) 12 | { 13 | for (int i = 0; i < 10; i++) 14 | cin >> arr[i]; 15 | sort(arr, arr + 10); 16 | cout << arr[7] << '\n'; 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Bronze/27110. 특식 배부/특식 배부.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | int main() 5 | { 6 | int n, a, b, c; 7 | cin >> n; 8 | cin >> a >> b >> c; 9 | cout << (((n <= a) ? n : a) + ((n <= b) ? n : b) + ((n <= c) ? n : c)); 10 | } -------------------------------------------------------------------------------- /백준/Bronze/27182. Rain Diary/Rain Diary.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, m; 8 | cin >> n >> m; 9 | if (0 < (n - 7)) 10 | cout << n - 7; 11 | else 12 | cout << m + 7; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/27213. Граничные клетки/Граничные клетки.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::max; 5 | int main() 6 | { 7 | int m, n; 8 | cin >> m >> n; 9 | cout << ((m == 1 || n == 1) ? max(m, n) : ((m + n) * 2 - 4)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27219. Робинзон Крузо/Робинзон Крузо.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | for (int i = 0; i < (n / 5); i++) 10 | cout << 'V'; 11 | for (int i = 0; i < (n % 5); i++) 12 | cout << 'I'; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/27294. 몇개고？/몇개고？.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cout; 3 | int main() 4 | { 5 | int t, s; 6 | scanf("%d %d", &t, &s); 7 | cout << (((12 <= t) & (t <= 16) & !s) ? 320 : 280); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/27323. 長方形 （Rectangle）/長方形 （Rectangle）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | cout << a * b; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27324. ゾロ目 （Same Numbers）/ゾロ目 （Same Numbers）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | cout << (((n / 10) == (n % 10)) ? 1 : 0); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27327. 時間 （Hour）/時間 （Hour）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int x; 8 | cin >> x; 9 | cout << x * 24; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27328. 三方比較 （Three－Way Comparison）/三方比較 （Three－Way Comparison）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | cout << ((a == b) ? 0 : ((a < b) ? -1 : 1)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27331. 2 桁の整数 （Two－digit Integer）/2 桁の整数 （Two－digit Integer）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | cout << a << b; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27332. 11 月 （November）/11 月 （November）.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | cout << (a + b * 7 <= 30); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27389. Metronome/Metronome.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | float n; 8 | cin >> n; 9 | printf("%0.2f", n / 4); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/2739. 구구단/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 구구단 - 2739 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2739) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation), 수학(math) 12 | 13 | ### 문제 설명 14 | 15 |

N을 입력받은 뒤, 구구단 N단을 출력하는 프로그램을 작성하시오. 출력 형식에 맞춰서 출력하면 된다.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 N이 주어진다. N은 1보다 크거나 같고, 9보다 작거나 같다.

20 | 21 | ### 출력 22 | 23 |

출력형식과 같게 N*1부터 N*9까지 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/2739. 구구단/구구단.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d", &a); 7 | for (int i = 1; i <= 9; i++) 8 | { 9 | printf("%d * %d = %d\n", a, i, a*i); 10 | } 11 | 12 | 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/2741. N 찍기/N 찍기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | scanf("%d", &a); 7 | 8 | for (int i = 1; i <= a; i++) 9 | { 10 | printf("%d\n", i); 11 | } 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /백준/Bronze/2741. N 찍기/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] N 찍기 - 2741 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2741) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 12 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

자연수 N이 주어졌을 때, 1부터 N까지 한 줄에 하나씩 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 100,000보다 작거나 같은 자연수 N이 주어진다.

20 | 21 | ### 출력 22 | 23 |

첫째 줄부터 N번째 줄 까지 차례대로 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/2742. 기찍 N/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze IV] 기찍 N - 2742 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2742) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 12 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

자연수 N이 주어졌을 때, N부터 1까지 한 줄에 하나씩 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 100,000보다 작거나 같은 자연수 N이 주어진다.

20 | 21 | ### 출력 22 | 23 |

첫째 줄부터 N번째 줄 까지 차례대로 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/2742. 기찍 N/기찍 N.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | 7 | scanf("%d", &a); 8 | 9 | for (int i = a; i >= 1; i--) 10 | { 11 | a=a-i; 12 | printf("%d\n", i); 13 | } 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /백준/Bronze/2743. 단어 길이 재기/단어 길이 재기.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a=0; 6 | char b[101]; 7 | scanf("%s",b); 8 | while (1) 9 | { 10 | if (b[a] !=0) 11 | { 12 | a++; 13 | } 14 | else 15 | { 16 | break; 17 | } 18 | 19 | } 20 | printf("%d", a); 21 | 22 | } -------------------------------------------------------------------------------- /백준/Bronze/27433. 팩토리얼 2/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 팩토리얼 2 - 27433 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/27433) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 2020 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 사칙연산(arithmetic), 수학(math) 12 | 13 | ### 문제 설명 14 | 15 |

0보다 크거나 같은 정수 N이 주어진다. 이때, N!을 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 정수 N(0 ≤ N ≤ 20)이 주어진다.

20 | 21 | ### 출력 22 | 23 |

첫째 줄에 N!을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/27433. 팩토리얼 2/팩토리얼 2.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | unsigned long long int a = 1; 9 | cin >> n; 10 | for (long long int i = 1; i <= n; i++) 11 | a *= i; 12 | cout << a; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/27434. 팩토리얼 3/팩토리얼 3.py: -------------------------------------------------------------------------------- 1 | import math 2 | a = int(input()) 3 | print(math.factorial(a)) 4 | -------------------------------------------------------------------------------- /백준/Bronze/2744. 대소문자 바꾸기/대소문자 바꾸기.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | char s[101]; 6 | scanf("%s", s); 7 | for (int i = 0; i < strlen(s); i++) 8 | { 9 | if ('a' <= s[i] && s[i] <= 'z') 10 | { 11 | s[i] -= 32; 12 | } 13 | else 14 | { 15 | s[i] += 32; 16 | } 17 | 18 | } 19 | printf("%s", s); 20 | return 0; 21 | } -------------------------------------------------------------------------------- /백준/Bronze/2747. 피보나치 수/피보나치 수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, a = 0, b = 1, c; 8 | cin >> n; 9 | if (n == 0) 10 | { 11 | cout << 0; 12 | return 0; 13 | } 14 | for (int i = 1; i < n; i++) 15 | { 16 | c = a + b; 17 | a = b; 18 | b = c; 19 | } 20 | cout << b; 21 | return 0; 22 | } -------------------------------------------------------------------------------- /백준/Bronze/2750. 수 정렬하기/수 정렬하기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int n, arr[1000]; 10 | cin >> n; 11 | for (int i = 0; i < n; i++) 12 | cin >> arr[i]; 13 | sort(arr, arr + n); 14 | for (int i = 0; i < n; i++) 15 | cout << arr[i] << '\n'; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/27866. 문자와 문자열/문자와 문자열.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | int n; 9 | string str; 10 | cin >> str >> n; 11 | cout << str[n - 1]; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/27890. 특별한 작은 분수/특별한 작은 분수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int x, n; 8 | cin >> x >> n; 9 | while (n--) 10 | x = (x & 1) ? (x << 1) ^ 6 : (x >> 1) ^ 6; 11 | cout << x; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/27918. 탁구 경기/탁구 경기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, d = 0, p = 0; 8 | char input; 9 | cin >> n; 10 | while (n-- && ((d - p) < 2) && ((p - d) < 2)) 11 | { 12 | cin >> input; 13 | if (input == 'D') 14 | d++; 15 | else 16 | p++; 17 | } 18 | cout << d << ':' << p; 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Bronze/27959. 초코바/초코바.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, m; 8 | cin >> n >> m; 9 | cout << ((n * 100 >= m) ? "Yes" : "No"); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27960. 사격 내기/사격 내기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | cout << int(a ^ b); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/27961. 고양이는 많을수록 좋다/고양이는 많을수록 좋다.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | long long int n, sum = 1, count = 1; 8 | cin >> n; 9 | if (!n) 10 | { 11 | cout << 0; 12 | return 0; 13 | } 14 | while (n > sum) 15 | { 16 | sum += sum; 17 | count++; 18 | } 19 | cout << count; 20 | return 0; 21 | } -------------------------------------------------------------------------------- /백준/Bronze/27963. 합금 주화/합금 주화.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | double d1, d2, x; 8 | cin >> d1 >> d2 >> x; 9 | if (d1 < d2) 10 | printf("%lf", 100 / (x / d2 + (100 - x) / d1)); 11 | else 12 | printf("%lf", 100 / (x / d1 + (100 - x) / d2)); 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/28061. 레몬 따기/레몬 따기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::max; 5 | 6 | int main() 7 | { 8 | int n, a, Max = 0; 9 | cin >> n; 10 | for (int i = n; i > 0; i--) 11 | cin >> a, Max = max(Max, a - i); 12 | cout << Max; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/28062. 준석이의 사탕 사기/준석이의 사탕 사기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::min; 5 | 6 | int main() 7 | { 8 | int n, a, Min = 1001, sum = 0; 9 | cin >> n; 10 | for (int i = 0; i < n; i++) 11 | { 12 | cin >> a; 13 | sum += a; 14 | if (a % 2) 15 | Min = min(Min, a); 16 | } 17 | if (sum % 2) 18 | cout << sum - Min; 19 | else 20 | cout << sum; 21 | return 0; 22 | } -------------------------------------------------------------------------------- /백준/Bronze/28063. 동전 복사/동전 복사.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, x, y; 8 | cin >> n >> x >> y; 9 | if (n == 1) 10 | cout << 0; 11 | else if ((x == 1 && y == 1) || (x == 1 && y == n) || (x == n && y == 1) || (x == n && y == n)) 12 | cout << 2; 13 | else if ((x == 1) || (x == n) || (y == 1) || (y == n)) 14 | cout << 3; 15 | else 16 | cout << 4; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/28113. 정보섬의 대중교통/정보섬의 대중교통.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, a, b; 8 | cin >> n >> a >> b; 9 | if (a == b) 10 | { 11 | cout << "Anything"; 12 | return 0; 13 | } 14 | cout << ((a < b) ? "Bus" : "Subway"); 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/2845. 파티가 끝나고 난 뒤/파티가 끝나고 난 뒤.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b, c, d, e, f, g; 6 | scanf("%d %d %d %d %d %d %d", &a, &b, &c, &d, &e, &f, &g); 7 | printf("%d %d %d %d %d", c - (a * b), d - (a * b), e - (a * b), f - (a * b), g - (a * b)); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/2869. 달팽이는 올라가고 싶다/달팽이는 올라가고 싶다.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | int v; 7 | int a; 8 | int b; 9 | 10 | 11 | scanf("%d %d %d", &a, &b, &v); 12 | printf("%d",(v-b-1)/(a-b)+1); 13 | 14 | } 15 | -------------------------------------------------------------------------------- /백준/Bronze/2884. 알람 시계/알람 시계.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int h; 6 | int m; 7 | int i; 8 | scanf("%d %d", &h, &m); 9 | i = ((60*h)+m)-45; 10 | if (i%60<0) 11 | { 12 | printf("%d %d", 24-((i/60)+1), 60+(i%60)); 13 | } 14 | else 15 | { 16 | printf("%d %d", i/60, i%60); 17 | } 18 | 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Bronze/2908. 상수/상수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::stoi; 5 | using std::string; 6 | 7 | int main() 8 | { 9 | string a, b, c; 10 | cin >> a >> b; 11 | c[0] = a[0]; 12 | a[0] = a[2]; 13 | a[2] = c[0]; 14 | c[0] = b[0]; 15 | b[0] = b[2]; 16 | b[2] = c[0]; 17 | cout << ((stoi(a) > stoi(b)) ? a : b); 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Bronze/29751. 삼각형/삼각형.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::fixed; 6 | using std::setprecision; 7 | 8 | int main() 9 | { 10 | float a, b; 11 | cin >> a >> b; 12 | cout << std::fixed << setprecision(1) << (a * b) / 2; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/30007. 라면 공식/라면 공식.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | for (int i = 0; i < n; i++) 10 | { 11 | int a, b, x; 12 | cin >> a >> b >> x; 13 | cout << a * (x - 1) + b << '\n'; 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/3003. 킹， 퀸， 룩， 비숍， 나이트， 폰/킹， 퀸， 룩， 비숍， 나이트， 폰.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int i[6]; 5 | scanf("%d %d %d %d %d %d", &i[0], &i[1], &i[2], &i[3], &i[4], &i[5]); 6 | printf("%d %d %d %d %d %d", 1-i[0], 1-i[1], 2-i[2], 2-i[3], 2-i[4], 8-i[5]); 7 | 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /백준/Bronze/30030. 스위트콘 가격 구하기/스위트콘 가격 구하기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | cout << n * 10 / 11; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/3046. R2/R2.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b; 6 | scanf("%d%d", &a, &b); 7 | printf("%d", (b * 2) - a); 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Bronze/31403. $A ＋ B － C$/$A ＋ B － C$.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::stoi; 5 | using std::to_string; 6 | 7 | int main() 8 | { 9 | int a, b, c; 10 | cin >> a >> b >> c; 11 | cout << a + b - c << '\n'; 12 | cout << stoi(to_string(a) + to_string(b)) - c; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/3733. Shares/Shares.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | while (cin >> a >> b) 9 | cout << (b / (a + 1)) << '\n'; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/3765. Celebrity jeopardy/Celebrity jeopardy.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | string s; 9 | while (getline(cin, s)) 10 | cout << s << '\n'; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/4101. 크냐？/크냐？.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void) 4 | { 5 | int a,b; 6 | while (1) 7 | { 8 | scanf("%d %d", &a, &b); 9 | if(a>b) 10 | { 11 | printf("Yes\n"); 12 | } 13 | else 14 | { 15 | if (a==0&&b==0) 16 | { 17 | break; 18 | } 19 | 20 | printf("No\n"); 21 | } 22 | } 23 | return 0; 24 | 25 | } -------------------------------------------------------------------------------- /백준/Bronze/4150. 피보나치 수/피보나치 수.py: -------------------------------------------------------------------------------- 1 | a=0 2 | b=1 3 | n = int(input()) 4 | if n == 0 : 5 | print(0) 6 | else: 7 | for i in range(n-1): 8 | c = a + b; 9 | a = b; 10 | b = c; 11 | print(b) 12 | -------------------------------------------------------------------------------- /백준/Bronze/4299. AFC 윔블던/AFC 윔블던.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a; 8 | int b; 9 | cin >> a >> b; 10 | if ((a + b) % 2 != 0 || (a - b) % 2 != 0) 11 | cout << -1; 12 | else if (b > a) 13 | cout << -1; 14 | else 15 | cout << ((a + b) / 2) << ' ' << ((a - b) / 2); 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/4470. 줄번호/줄번호.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a; 5 | char b[51]; 6 | 7 | scanf("%d",&a); 8 | 9 | for (int i = 1; i <= a; i++) 10 | { 11 | getchar(); 12 | scanf("%[^\n]s", b); 13 | printf("%d. %s\n",i,b); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/4589. Gnome Sequencing/Gnome Sequencing.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, a, b, c; 8 | cout << "Gnomes:\n"; 9 | cin >> n; 10 | for (int i = 0; i < n; i++) 11 | { 12 | cin >> a >> b >> c; 13 | cout << (((a <= b && b <= c) || (a >= b && b >= c)) ? "Ordered\n" : "Unordered\n"); 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/4696. St． Ives/St． Ives.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | double n; 8 | while (cin >> n && n != 0) 9 | printf("%0.2f\n", 1 + n + n * n + n * n * n + n * n * n * n); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/4714. Lunacy/Lunacy.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | 4 | int main() 5 | { 6 | double x; 7 | while (cin >> x && (x >= 0)) 8 | printf("Objects weighing %.2f on Earth will weigh %.2f on the moon.\n", x, x * 0.167); 9 | return 0; 10 | } -------------------------------------------------------------------------------- /백준/Bronze/4999. 아！/아！.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | char a[1000]; 4 | char b[1000]; 5 | int main() 6 | { 7 | scanf("%s %s",a,b); 8 | if (strlen(a) >= strlen(b)) 9 | { 10 | printf("go"); 11 | } 12 | else 13 | { 14 | printf("no"); 15 | } 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/5086. 배수와 약수/배수와 약수.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a, b; 6 | while (scanf("%d %d", &a, &b) && a != 0 && b != 0) 7 | { 8 | printf("%s\n", a % b == 0 || b % a == 0 ? (a < b ? "factor" : "multiple") : "neither"); 9 | } 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /백준/Bronze/5300. Fill the Rowboats！/Fill the Rowboats！.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | for (int i = 1; i <= n; i++) 10 | cout << i << (!(i % 6) || i == n ? " Go! " : " "); 11 | return 0; 12 | } -------------------------------------------------------------------------------- /백준/Bronze/5337. 웰컴/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 웰컴 - 5337 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/5337) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 4528 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

16 | Welcome을 예제 출력처럼 출력하는 프로그램을 작성하시오.

17 | 18 | ### 입력 19 | 20 | Empty 21 | 22 | ### 출력 23 | 24 |

25 | Welcome을 아래 예제 출력처럼 출력한다.

26 | 27 | -------------------------------------------------------------------------------- /백준/Bronze/5337. 웰컴/웰컴.txt: -------------------------------------------------------------------------------- 1 | . . . 2 | | | _ | _. _ ._ _ _ 3 | |/\|(/.|(_.(_)[ | )(/. -------------------------------------------------------------------------------- /백준/Bronze/5338. 마이크로소프트 로고/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 마이크로소프트 로고 - 5338 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/5338) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 4528 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

16 | 마이크로소프트 로고를 예제 출력처럼 출력하는 프로그램을 작성하시오.

17 | 18 | ### 입력 19 | 20 | Empty 21 | 22 | ### 출력 23 | 24 |

25 | 마이크로소프트 로고를 예제 출력처럼 출력한다.

26 | 27 | -------------------------------------------------------------------------------- /백준/Bronze/5338. 마이크로소프트 로고/마이크로소프트 로고.txt: -------------------------------------------------------------------------------- 1 | _.-;;-._ 2 | '-..-'| || | 3 | '-..-'|_.-;;-._| 4 | '-..-'| || | 5 | '-..-'|_.-''-._| -------------------------------------------------------------------------------- /백준/Bronze/5339. 콜센터/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 콜센터 - 5339 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/5339) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 4528 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

스타워즈에 등장하는 로봇인 C3PO는 요즘 콜센터에 근무하고 있다. 콜센터에 앉아있는 C3PO를 그리는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 | Empty 20 | 21 | ### 출력 22 | 23 |

예제 출력처럼 콜센터에 앉아있는 C3PO를 출력한다. 마지막 세 줄의 두 '|' 사이에는 공백이 10개 있다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/5339. 콜센터/콜센터.txt: -------------------------------------------------------------------------------- 1 | /~\ 2 | ( oo| 3 | _\=/_ 4 | / _ \ 5 | //|/.\|\\ 6 | || \ / || 7 | ============ 8 | | | 9 | | | 10 | | | -------------------------------------------------------------------------------- /백준/Bronze/5341. Pyramids/Pyramids.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, count; 8 | while (cin >> n && n != 0) 9 | { 10 | count = 0; 11 | for (int i = 1; i <= n; i++) 12 | count += i; 13 | cout << count<<'\n'; 14 | } 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/5522. 카드 게임/카드 게임.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b=0; 6 | for (int i = 0; i < 5; i++) 7 | { 8 | scanf("%d",&a); 9 | b = b+a; 10 | } 11 | printf("%d",b); 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/5524. 입실 관리/입실 관리.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::string; 5 | 6 | int main() 7 | { 8 | string s; 9 | int n; 10 | cin >> n; 11 | while (n--) 12 | { 13 | cin >> s; 14 | for (int i = 0; i < s.length(); i++) 15 | if (s[i] >= 'A' && s[i] < 'a') 16 | s[i] = s[i] + 32; 17 | cout << s << '\n'; 18 | } 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Bronze/5532. 방학 숙제/방학 숙제.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a,b,c,d,e; 5 | 6 | scanf("%d%d%d%d%d",&a,&b,&c,&d,&e); 7 | 8 | if (((b+d-1)/d) > ((c+e-1)/e)) 9 | { 10 | printf("%d",a-((b+d-1)/d)); 11 | } 12 | if (((b+d-1)/d) < ((c+e-1)/e)) 13 | { 14 | printf("%d",a-((c+e-1)/e)); 15 | } 16 | if (((b+d-1)/d) == ((c+e-1)/e)) 17 | { 18 | printf("%d",a-((c+e-1)/e)); 19 | } 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /백준/Bronze/5543. 상근날드/상근날드.c: -------------------------------------------------------------------------------- 1 | #include 2 | int min(int a[], int cont) 3 | { 4 | int min = 2000; 5 | for (int i = 0; i < cont; i++) 6 | { 7 | if (min > a[i]) 8 | { 9 | min = a[i]; 10 | } 11 | } 12 | return min; 13 | } 14 | int main() 15 | { 16 | int a[3], b[2]; 17 | 18 | scanf("%d %d %d %d %d", &a[0], &a[1], &a[2], &b[0], &b[1]); 19 | printf("%d", min(a, 3) + min(b, 2) - 50); 20 | return 0; 21 | } -------------------------------------------------------------------------------- /백준/Bronze/5554. 심부름 가는 길/심부름 가는 길.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b,c,d; 6 | scanf("%d%d%d%d",&a,&b,&c,&d); 7 | printf("%d\n%d",(a+b+c+d)/60,(a+b+c+d)%60); 8 | return 0; 9 | } 10 | 11 | -------------------------------------------------------------------------------- /백준/Bronze/5575. 타임 카드/타임 카드.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c, d, e, f, S; 8 | for (int i = 0; i < 3; i++) 9 | { 10 | cin >> a >> b >> c >> d >> e >> f; 11 | S = (d * 3600 + e * 60 + f) - (a * 3600 + b * 60 + c); 12 | cout << ((S / 3600) % 24) << ' ' << ((S % 3600) / 60) << ' ' << ((S % 3600) % 60) << '\n'; 13 | } 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/5596. 시험 점수/시험 점수.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a[4]; 6 | int b[4]; 7 | scanf("%d%d%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&b[0],&b[1],&b[2],&b[3]); 8 | if (a[0]+a[1]+a[2]+a[3]>=b[0]+b[1]+b[2]+b[3]) 9 | { 10 | printf("%d",a[0]+a[1]+a[2]+a[3]); 11 | } 12 | else 13 | { 14 | printf("%d",b[0]+b[1]+b[2]+b[3]); 15 | } 16 | 17 | return 0; 18 | } 19 | 20 | -------------------------------------------------------------------------------- /백준/Bronze/5597. 과제 안 내신 분．．？/과제 안 내신 분．．？.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int s[31] = { 0, }; 5 | int a; 6 | 7 | for (int i = 0; i < 28; i++) 8 | { 9 | scanf("%d", &a); 10 | s[a] = 1; 11 | } 12 | 13 | for (int i = 1; i < 31; i++) 14 | { 15 | if (s[i] == 0) 16 | { 17 | printf("%d\n", i); 18 | } 19 | } 20 | return 0; 21 | } -------------------------------------------------------------------------------- /백준/Bronze/5717. 상근이의 친구들/상근이의 친구들.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | import ( 4 | "fmt" 5 | ) 6 | 7 | func main() { 8 | var a int 9 | var b int 10 | for i := 0; ; i++ { 11 | a = 0 12 | b = 0 13 | fmt.Scanf("%d %d", &a, &b) 14 | if a == 0 && b == 0 { 15 | break 16 | } 17 | fmt.Printf("%d\n", a+b) 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /백준/Bronze/5928. Contest Timing/Contest Timing.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c; 8 | cin >> a >> b >> c; 9 | cout << (((a * 1440 + b * 60 + c) - 16511) < 0 ? -1 : ((a * 1440 + b * 60 + c) - 16511)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/5988. 홀수일까 짝수일까/홀수일까 짝수일까.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | 6 | int main() 7 | { 8 | int n; 9 | cin >> n; 10 | for (int i = 0; i < n; i++) 11 | { 12 | char k[70]; 13 | scanf("%s", k); 14 | cout << (((k[strlen(k) - 1] - '0') % 2) ? "odd" : "even") << "\n"; 15 | } 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/6749. Next in line/Next in line.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | cout << (b - a) + b; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/6778. Which Alien？/Which Alien？.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b; 8 | cin >> a >> b; 9 | if (a >= 3 && b <= 4) 10 | cout << "TroyMartian" << '\n'; 11 | if (a <= 6 && b >= 2) 12 | cout << "VladSaturnian" << '\n'; 13 | if (a <= 2 && b <= 3) 14 | cout << "GraemeMercurian" << '\n'; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/6810. ISBN/ISBN.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c; 8 | cin >> a >> b >> c; 9 | cout << "The 1-3-sum is " << (a + (b * 3) + c + 91); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/6825. Body Mass Index/Body Mass Index.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | double w, h, bmi; 8 | cin >> w >> h; 9 | bmi = w / (h * h); 10 | if (bmi < 18.5) 11 | cout << "Underweight"; 12 | else if (bmi >= 18.5 && bmi < 25) 13 | cout << "Normal weight"; 14 | else 15 | cout << "Overweight"; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Bronze/6840. Who is in the middle？/Who is in the middle？.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int a[3]; 10 | cin >> a[0] >> a[1] >> a[2]; 11 | sort(a, a + 3); 12 | cout << a[1]; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Bronze/6887. Squares/Squares.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sqrt; 6 | 7 | int main() 8 | { 9 | int n; 10 | cin >> n; 11 | cout << "The largest square has side length " << int(sqrt(n)) << '.'; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Bronze/7287. 등록/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 등록 - 7287 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/7287) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

자신이 백준 온라인 저지(BOJ)에서 맞은 문제의 수와 아이디를 그대로 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

이 문제는 입력이 없다.

20 | 21 | ### 출력 22 | 23 |

첫 줄에 자신이 맞은 문제의 수, 둘째 줄에 아이디를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/7287. 등록/등록.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | printf("49\ndlswns"); 7 | 8 | } 9 | -------------------------------------------------------------------------------- /백준/Bronze/7595. Triangles/Triangles.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | while (cin >> n && n != 0) 9 | { 10 | for (int i = 1; i <= n; i++) 11 | { 12 | for (int j = 0; j < i; j++) 13 | cout << '*'; 14 | cout << '\n'; 15 | } 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/7891. Can you add this？/Can you add this？.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | int a, b; 9 | cin >> n; 10 | for (int i = 0; i < n; i++) 11 | { 12 | cin >> a >> b; 13 | cout << a + b<< '\n'; 14 | } 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /백준/Bronze/8370. Plane/Plane.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a,b,c,d; 6 | scanf("%d %d %d %d",&a,&b,&c,&d); 7 | printf("%d",(a*b)+(c*d)); 8 | return 0; 9 | 10 | } -------------------------------------------------------------------------------- /백준/Bronze/8393. 합/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 합 - 8393 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/8393) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation), 수학(math) 12 | 13 | ### 문제 설명 14 | 15 |

n이 주어졌을 때, 1부터 n까지 합을 구하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 |

첫째 줄에 n (1 ≤ n ≤ 10,000)이 주어진다.

20 | 21 | ### 출력 22 | 23 |

1부터 n까지 합을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/8393. 합/합.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | int b=0; 7 | scanf("%d", &a); 8 | for (int i = 1; i <= a; i++) 9 | { 10 | b=b+i; 11 | 12 | } 13 | printf("%d", b); 14 | 15 | 16 | 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /백준/Bronze/8437. Julka/Julka.py: -------------------------------------------------------------------------------- 1 | a = int(input()) 2 | b = int(input()) 3 | print(int((a+b)//2), int((a-b)//2)) 4 | -------------------------------------------------------------------------------- /백준/Bronze/8545. Zadanie próbne/Zadanie próbne.cc: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | char a[3]; 5 | scanf("%s", a); 6 | printf("%c%c%c", a[2], a[1], a[0]); 7 | return 0; 8 | } -------------------------------------------------------------------------------- /백준/Bronze/8558. Silnia/Silnia.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, output = 1; 8 | cin >> n; 9 | for (int i = 1; i <= n; i++) 10 | { 11 | output *= i; 12 | output %= 10; 13 | } 14 | cout << output; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/8674. Tabliczka/Tabliczka.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | unsigned int a, b; 8 | cin >> a >> b; 9 | cout << ((!(a % 2) || !(b % 2)) ? 0 : ((a < b) ? a : b)); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/8710. Koszykarz/Koszykarz.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int k, w, m; 8 | cin >> k >> w >> m; 9 | cout << ((w - k) / m) + (((w - k) % m) != 0); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/8718. Bałwanek/Bałwanek.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | long long int x, k; 8 | cin >> x >> k; 9 | if (7000 * k <= 1000 * x) 10 | cout << 7000 * k; 11 | else if (3500 * k <= 1000 * x) 12 | cout << 3500 * k; 13 | else if (1750 * k <= 1000 * x) 14 | cout << 1750 * k; 15 | else 16 | cout << 0; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Bronze/8723. Patyki/Patyki.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int a, b, c; 8 | cin >> a >> b >> c; 9 | if (a == b && b == c) 10 | cout << 2; 11 | else if (((b * b + c * c) == a * a) || ((a * a + c * c) == b * b) || ((a * a + b * b) == c * c)) 12 | cout << 1; 13 | else 14 | cout << 0; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Bronze/8760. Schronisko/Schronisko.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, w, k; 8 | cin >> n; 9 | for (int i = 0; i < n; i++) 10 | { 11 | cin >> w >> k; 12 | cout << (w * k) / 2 << '\n'; 13 | } 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/8871. Zadanie próbne 2/Zadanie próbne 2.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | cout << (n + 1) * 2 << ' ' << (n + 1) * 3; 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Bronze/9086. 문자열/문자열.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int a; 7 | char b[1001]; 8 | scanf("%d",&a); 9 | 10 | for (int i = 0; i < a;i++) 11 | { 12 | getchar(); 13 | scanf("%s",b); 14 | printf("%c%c\n",b[0],b[strlen(b)-1]); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /백준/Bronze/9316. Hello Judge/Hello Judge.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a; 6 | 7 | scanf("%d", &a); 8 | 9 | for (int i = 1; i <= a; i++) 10 | { 11 | printf("Hello World, Judge %d!\n", i); 12 | } 13 | 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Bronze/9653. 스타워즈 로고/README.md: -------------------------------------------------------------------------------- 1 | # [Bronze V] 스타워즈 로고 - 9653 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/9653) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 4528 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | 구현(implementation) 12 | 13 | ### 문제 설명 14 | 15 |

스타워즈 로고를 예제 출력과 같이 출력하는 프로그램을 작성하시오.

16 | 17 | ### 입력 18 | 19 | Empty 20 | 21 | ### 출력 22 | 23 |

스타워즈 로고를 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Bronze/9653. 스타워즈 로고/스타워즈 로고.txt: -------------------------------------------------------------------------------- 1 | 8888888888 888 88888 2 | 88 88 88 88 88 88 3 | 8888 88 88 88 88888 4 | 88 88 888888888 88 88 5 | 88888888 88 88 88 88 888888 6 | 7 | 88 88 88 888 88888 888888 8 | 88 88 88 88 88 88 88 88 9 | 88 8888 88 88 88 88888 8888 10 | 888 888 888888888 88 88 88 11 | 88 88 88 88 88 88888888 -------------------------------------------------------------------------------- /백준/Bronze/9654. 나부 함대 데이터/나부 함대 데이터.txt: -------------------------------------------------------------------------------- 1 | SHIP NAME CLASS DEPLOYMENT IN SERVICE 2 | N2 Bomber Heavy Fighter Limited 21 3 | J-Type 327 Light Combat Unlimited 1 4 | NX Cruiser Medium Fighter Limited 18 5 | N1 Starfighter Medium Fighter Unlimited 25 6 | Royal Cruiser Light Combat Limited 4 -------------------------------------------------------------------------------- /백준/Gold/11689. GCD（n， k） ＝ 1/GCD（n， k） ＝ 1.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | long int n; 8 | cin >> n; 9 | 10 | long int ans = n; 11 | for (long int p = 2; p * p <= n; p++) 12 | { 13 | if (!(n % p)) 14 | { 15 | ans -= ans / p; 16 | while (!(n % p)) 17 | n /= p; 18 | } 19 | } 20 | 21 | ans -= (n > 1) * (ans / n); 22 | 23 | cout << ans; 24 | return 0; 25 | } -------------------------------------------------------------------------------- /백준/Platinum/13319. 가짜 소수/가짜 소수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | cout << 413138881 << ' ' << 617; 8 | return 0; 9 | } -------------------------------------------------------------------------------- /백준/Silver/10826. 피보나치 수 4/피보나치 수 4.py: -------------------------------------------------------------------------------- 1 | a=0 2 | b=1 3 | n = int(input()) 4 | if n == 0 : 5 | print(0) 6 | else: 7 | for i in range(n-1): 8 | c = a + b; 9 | a = b; 10 | b = c; 11 | print(b) 12 | -------------------------------------------------------------------------------- /백준/Silver/11004. K번째 수/K번째 수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int n, k, a[5000000]; 10 | cin >> n >> k; 11 | for (int i = 0; i < n; i++) 12 | scanf("%d", &a[i]); 13 | sort(a, a + n); 14 | cout << a[k - 1]; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Silver/11726. 2×n 타일링/2×n 타일링.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | 10 | int a = 1, b = 2, c; 11 | for (int i = 1; i < n; i++) 12 | { 13 | c = (a + b) % 10007; 14 | a = b; 15 | b = c; 16 | } 17 | 18 | cout << a % 10007; 19 | return 0; 20 | } -------------------------------------------------------------------------------- /백준/Silver/11728. 배열 합치기/배열 합치기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::sort; 5 | 6 | int main() 7 | { 8 | int n, m, arr[2000000]; 9 | cin >> n >> m; 10 | for (int i = 0; i < n + m; i++) 11 | scanf("%d", &arr[i]); 12 | sort(arr, arr + (n + m)); 13 | for (int i = 0; i < n + m; i++) 14 | printf("%d ", arr[i]); 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Silver/11931. 수 정렬하기 4/수 정렬하기 4.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int n, arr[1000000]; 10 | cin >> n; 11 | for (int i = 0; i < n; i++) 12 | cin >> arr[i]; 13 | sort(arr, arr + n); 14 | for (int i = n - 1; i >= 0; i--) 15 | cout << arr[i] << '\n'; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Silver/13241. 최소공배수/최소공배수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | long long int a, b, tmp, input1, input2; 8 | cin >> input1 >> input2; 9 | a = input1; 10 | b = input2; 11 | while (b) 12 | { 13 | tmp = a % b; 14 | a = b; 15 | b = tmp; 16 | } 17 | cout << (input1 * input2) / a; 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Silver/13699. 점화식/점화식.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | unsigned long long int n, dp[36]{0}; 8 | dp[0] = 1; 9 | cin >> n; 10 | for (int i = 1; i <= n; i++) 11 | for (int j = 0; j < i; j++) 12 | dp[i] += dp[j] * dp[(i - j) - 1]; 13 | cout << dp[n]; 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Silver/1427. 소트인사이드/소트인사이드.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::greater; 6 | using std::sort; 7 | using std::string; 8 | 9 | int main() 10 | { 11 | string str; 12 | cin >> str; 13 | sort(str.begin(), str.end(), greater()); 14 | cout << str; 15 | return 0; 16 | } -------------------------------------------------------------------------------- /백준/Silver/14495. 피보나치 비스무리한 수열/피보나치 비스무리한 수열.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | unsigned long long int n, dp[116]{1, 1, 1}; 8 | cin >> n; 9 | for (int i = 3; i < n; i++) 10 | dp[i] = dp[i - 1] + dp[i - 3]; 11 | cout << dp[n - 1]; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /백준/Silver/14916. 거스름돈/거스름돈.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, count = 0; 8 | cin >> n; 9 | while (n >= 0) 10 | { 11 | if (!(n % 5 && n)) 12 | { 13 | cout << ((n / 5) + count); 14 | return 0; 15 | } 16 | n -= 2; 17 | count++; 18 | } 19 | cout << -1; 20 | return 0; 21 | } -------------------------------------------------------------------------------- /백준/Silver/1564. 팩토리얼5/팩토리얼5.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | 4 | int main() 5 | { 6 | unsigned long long int n, f; 7 | f = 1; 8 | cin >> n; 9 | for (int i = 1; i <= n; i++) 10 | { 11 | f *= i; 12 | f %= 10000000000000; 13 | while (!(f % 10)) 14 | f /= 10; 15 | } 16 | printf("%05lld", f % 100000); 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Silver/15688. 수 정렬하기 5/수 정렬하기 5.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::sort; 4 | 5 | int main() 6 | { 7 | int n, arr[1000000]; 8 | scanf("%d", &n); 9 | for (int i = 0; i < n; i++) 10 | scanf("%d", &arr[i]); 11 | sort(arr, arr + n); 12 | for (int i = 0; i < n; i++) 13 | printf("%d\n", arr[i]); 14 | return 0; 15 | } -------------------------------------------------------------------------------- /백준/Silver/16212. 정열적인 정렬/정열적인 정렬.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int n, arr[500000]; 10 | cin >> n; 11 | for (int i = 0; i < n; i++) 12 | cin >> arr[i]; 13 | sort(arr, arr + n); 14 | for (int i = 0; i < n; i++) 15 | cout << arr[i] << ' '; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Silver/1850. 최대공약수/최대공약수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int gcd(long int a, long int b) { return (!b ? a : gcd(b, a % b)); } 6 | 7 | int main() 8 | { 9 | long int a, b; 10 | cin >> a >> b; 11 | 12 | long int n = gcd(a, b); 13 | 14 | while (n--) 15 | cout << 1; 16 | 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Silver/1912. 연속합/연속합.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n, input, sum = 0, max = -1000; 8 | cin >> n; 9 | while (n--) 10 | { 11 | cin >> input; 12 | sum += input; 13 | max = (max < sum) ? sum : max; 14 | sum = (sum > 0) * sum; 15 | } 16 | cout << max; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /백준/Silver/25379. 피하자/피하자.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | using std::min; 5 | 6 | int main() 7 | { 8 | int n, input, ans[2]{0}, arr[2]{0}; 9 | cin >> n; 10 | for (int i = 0; i < n; i++) 11 | cin >> input, arr[input % 2]++, ans[input % 2] += arr[!(input % 2)]; 12 | cout << min(ans[0], ans[1]); 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Silver/2553. 마지막 팩토리얼 수/마지막 팩토리얼 수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | unsigned long long int n, f; 8 | f = 1; 9 | cin >> n; 10 | for (int i = 1; i <= n; i++) 11 | { 12 | f *= i; 13 | f %= 100000000; 14 | while (!(f % 10)) 15 | f /= 10; 16 | } 17 | cout << f % 10; 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Silver/2751. 수 정렬하기 2/수 정렬하기 2.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | using std::sort; 6 | 7 | int main() 8 | { 9 | int n, input[1000000]{0}; 10 | cin >> n; 11 | for (int i = 0; i < n; i++) 12 | cin >> input[i]; 13 | sort(input, input + n); 14 | for (int i = 0; i < n; i++) 15 | cout << input[i] << '\n'; 16 | return 0; 17 | } -------------------------------------------------------------------------------- /백준/Silver/27965. N결수/N결수.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using std::cin; 4 | using std::cout; 5 | 6 | int main() 7 | { 8 | unsigned long long int n, k, num = 0; 9 | cin >> n >> k; 10 | for (unsigned long long int i = 1; i <= n; i++) 11 | num = ((num * int(pow(10, int((log10(i) + 1))))) + i) % k; 12 | cout << num; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /백준/Silver/2839. 설탕 배달/설탕 배달.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | int main() 5 | { 6 | int n; 7 | cin >> n; 8 | int i(0); 9 | while (n >= 0) 10 | { 11 | if (n % 5 == 0) 12 | { 13 | cout << i + (n / 5); 14 | return 0; 15 | } 16 | i++; 17 | n -= 3; 18 | } 19 | cout << -1; 20 | } -------------------------------------------------------------------------------- /백준/Silver/9095. 1， 2， 3 더하기/1， 2， 3 더하기.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | const int ans[]{0, 1, 2, 4, 7, 13, 24, 44, 81, 149, 274}; 8 | 9 | int n; 10 | cin >> n; 11 | 12 | for (int i = 0; i < n; i++) 13 | { 14 | int input; 15 | cin >> input; 16 | cout << ans[input] << '\n'; 17 | } 18 | return 0; 19 | } -------------------------------------------------------------------------------- /백준/Silver/9655. 돌 게임/돌 게임.cc: -------------------------------------------------------------------------------- 1 | #include 2 | using std::cin; 3 | using std::cout; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin >> n; 9 | cout << ((n % 2) ? "SK" : "CY"); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /백준/Unrated/11506. 占쏙옙/占쏙옙.txt: -------------------------------------------------------------------------------- 1 | � -------------------------------------------------------------------------------- /백준/Unrated/1237. 정ㅋ벅ㅋ/README.md: -------------------------------------------------------------------------------- 1 | # [Unrated] 정ㅋ벅ㅋ - 1237 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/1237) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 1112 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | Empty 12 | 13 | ### 문제 설명 14 | 15 |

이 문제를 푸는 자 우주를 정ㅋ벅ㅋ한다.

16 | 17 | ### 입력 18 | 19 |

우주를 정ㅋ벅ㅋ하는 자에겐 입력 따위 필요 없다.

20 | 21 | ### 출력 22 | 23 |

첫째 줄에 문제의 정답을 출력한다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Unrated/1237. 정ㅋ벅ㅋ/정ㅋ벅ㅋ.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | printf("문제의 정답"); 5 | return 0; 6 | } -------------------------------------------------------------------------------- /백준/Unrated/15643. Yee/Yee.txt: -------------------------------------------------------------------------------- 1 | 86642467 -------------------------------------------------------------------------------- /백준/Unrated/15802. 타노스/타노스.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | printf("0"); 4 | } -------------------------------------------------------------------------------- /백준/Unrated/2555. 생일 출력하기/README.md: -------------------------------------------------------------------------------- 1 | # [Unrated] 생일 출력하기 - 2555 2 | 3 | [문제 링크](https://www.acmicpc.net/problem/2555) 4 | 5 | ### 성능 요약 6 | 7 | 메모리: 4528 KB, 시간: 0 ms 8 | 9 | ### 분류 10 | 11 | Empty 12 | 13 | ### 문제 설명 14 | 15 |

이 문제가 있는 사이트의 생일을 출력하시오.

16 | 17 | ### 입력 18 | 19 | Empty 20 | 21 | ### 출력 22 | 23 |

월/일 형식으로 출력하면 된다. 예를 들어, 7월 4일인 경우에는 7/4, 9월 20일인 경우에는 9/20, 11월 4일인 경우에는 11/4와 같이 출력하면 된다.

24 | 25 | -------------------------------------------------------------------------------- /백준/Unrated/2555. 생일 출력하기/생일 출력하기.txt: -------------------------------------------------------------------------------- 1 | 3/19 -------------------------------------------------------------------------------- /프로그래머스/0/120808. 분수의 덧셈/분수의 덧셈.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(int numer1, int denom1, int numer2, int denom2) 7 | { 8 | int a = denom1 * denom2; 9 | int b = denom1 * numer2 + denom2 * numer1; 10 | 11 | for (int i = 2; i <= a; i++) 12 | if (!(a % i) && !(b % i)) 13 | a /= i, b /= i, i = 1; 14 | 15 | return {b, a}; 16 | } -------------------------------------------------------------------------------- /프로그래머스/0/120815. 피자 나눠 먹기 （2）/피자 나눠 먹기 （2）.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int gcd(int a, int b) 7 | { 8 | int c; 9 | while (b != 0) 10 | { 11 | c = a % b; 12 | a = b; 13 | b = c; 14 | } 15 | return a; 16 | } 17 | 18 | int lcm(int a, int b) 19 | { 20 | return a * b / gcd(a, b); 21 | } 22 | 23 | int solution(int n) 24 | { 25 | return lcm(6, n) / 6; 26 | } 27 | -------------------------------------------------------------------------------- /프로그래머스/0/120837. 개미 군단/개미 군단.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(int hp) { 7 | return (hp / 5) + ((hp % 5) / 3) + ((hp % 5) % 3); 8 | } -------------------------------------------------------------------------------- /프로그래머스/1/12906. 같은 숫자는 싫어/같은 숫자는 싫어.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr) 7 | { 8 | vector answer; 9 | 10 | int temp = 10; 11 | for (int i = 0; i < arr.size(); i++) 12 | { 13 | if (arr[i] != temp) 14 | { 15 | answer.push_back(arr[i]); 16 | temp = arr[i]; 17 | } 18 | } 19 | 20 | return answer; 21 | } -------------------------------------------------------------------------------- /프로그래머스/1/131112. 강원도에 위치한 생산공장 목록 출력하기/강원도에 위치한 생산공장 목록 출력하기.sql: -------------------------------------------------------------------------------- 1 | SELECT FACTORY_ID, FACTORY_NAME, ADDRESS 2 | FROM FOOD_FACTORY 3 | WHERE ADDRESS LIKE "강원도%" 4 | ORDER BY FACTORY_ID ASC -------------------------------------------------------------------------------- /프로그래머스/1/131114. 경기도에 위치한 식품창고 목록 출력하기/경기도에 위치한 식품창고 목록 출력하기.sql: -------------------------------------------------------------------------------- 1 | SELECT WAREHOUSE_ID, WAREHOUSE_NAME, ADDRESS, CASE WHEN FREEZER_YN IS NULL THEN 'N' ELSE FREEZER_YN END 2 | FROM FOOD_WAREHOUSE 3 | WHERE ADDRESS LIKE "경기도%" 4 | ORDER BY WAREHOUSE_NAME ASC 5 | -------------------------------------------------------------------------------- /프로그래머스/1/131528. 나이 정보가 없는 회원 수 구하기/나이 정보가 없는 회원 수 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT COUNT(USER_ID) 2 | FROM USER_INFO 3 | WHERE AGE IS NULL 4 | -------------------------------------------------------------------------------- /프로그래머스/1/131535. 조건에 맞는 회원수 구하기/조건에 맞는 회원수 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT COUNT(USER_ID) 2 | FROM USER_INFO 3 | WHERE JOINED LIKE "2021%" AND AGE >= 20 AND AGE <= 29 4 | -------------------------------------------------------------------------------- /프로그래머스/1/131697. 가장 비싼 상품 구하기/가장 비싼 상품 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT MAX(PRICE) 2 | FROM PRODUCT 3 | -------------------------------------------------------------------------------- /프로그래머스/1/132201. 12세 이하인 여자 환자 목록 출력하기/12세 이하인 여자 환자 목록 출력하기.sql: -------------------------------------------------------------------------------- 1 | SELECT PT_NAME, PT_NO, GEND_CD, AGE, CASE WHEN TLNO IS NULL THEN "NONE" ELSE TLNO END 2 | FROM PATIENT 3 | WHERE AGE <= 12 AND GEND_CD = 'W' 4 | ORDER BY AGE DESC, PT_NAME ASC -------------------------------------------------------------------------------- /프로그래머스/1/132203. 흉부외과 또는 일반외과 의사 목록 출력하기/흉부외과 또는 일반외과 의사 목록 출력하기.sql: -------------------------------------------------------------------------------- 1 | SELECT DR_NAME, DR_ID, MCDP_CD, DATE_FORMAT(HIRE_YMD, "%Y-%m-%d") 2 | FROM DOCTOR 3 | WHERE MCDP_CD = "CS" OR MCDP_CD = "GS" 4 | ORDER BY HIRE_YMD DESC, DR_NAME ASC -------------------------------------------------------------------------------- /프로그래머스/1/133024. 인기있는 아이스크림/인기있는 아이스크림.sql: -------------------------------------------------------------------------------- 1 | SELECT FLAVOR 2 | FROM FIRST_HALF 3 | ORDER BY TOTAL_ORDER DESC, SHIPMENT_ID ASC -------------------------------------------------------------------------------- /프로그래머스/1/133025. 과일로 만든 아이스크림 고르기/과일로 만든 아이스크림 고르기.sql: -------------------------------------------------------------------------------- 1 | SELECT A.FLAVOR 2 | FROM FIRST_HALF A 3 | JOIN ICECREAM_INFO B ON A.FLAVOR = B.FLAVOR 4 | WHERE A.TOTAL_ORDER > 3000 AND B.INGREDIENT_TYPE = "fruit_based" 5 | ORDER BY A.TOTAL_ORDER DESC -------------------------------------------------------------------------------- /프로그래머스/1/144853. 조건에 맞는 도서 리스트 출력하기/조건에 맞는 도서 리스트 출력하기.sql: -------------------------------------------------------------------------------- 1 | SELECT BOOK_ID, DATE_FORMAT(PUBLISHED_DATE, "%Y-%m-%d") 2 | FROM BOOK 3 | WHERE PUBLISHED_DATE LIKE "2021%" AND CATEGORY = "인문" 4 | -------------------------------------------------------------------------------- /프로그래머스/1/151136. 평균 일일 대여 요금 구하기/평균 일일 대여 요금 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT ROUND(AVG(DAILY_FEE)) AS AVERAGE_FEE 2 | FROM CAR_RENTAL_COMPANY_CAR 3 | WHERE CAR_TYPE = "SUV" 4 | 5 | -------------------------------------------------------------------------------- /프로그래머스/1/151138. 자동차 대여 기록에서 장기／단기 대여 구분하기/자동차 대여 기록에서 장기／단기 대여 구분하기.sql: -------------------------------------------------------------------------------- 1 | SELECT 2 | HISTORY_ID, 3 | CAR_ID, 4 | DATE_FORMAT(START_DATE, "%Y-%m-%d") AS START_DATE, 5 | DATE_FORMAT(END_DATE, "%Y-%m-%d") AS END_DATE, 6 | CASE WHEN DATEDIFF(END_DATE, START_DATE) >= 29 THEN "장기 대여" ELSE "단기 대여" END AS RENT_TYPE 7 | FROM CAR_RENTAL_COMPANY_RENTAL_HISTORY 8 | WHERE START_DATE LIKE "2022-09%" 9 | ORDER BY HISTORY_ID DESC -------------------------------------------------------------------------------- /프로그래머스/1/157343. 특정 옵션이 포함된 자동차 리스트 구하기/특정 옵션이 포함된 자동차 리스트 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT CAR_ID, CAR_TYPE, DAILY_FEE, OPTIONS 2 | FROM CAR_RENTAL_COMPANY_CAR 3 | WHERE OPTIONS LIKE "%네비게이션%" 4 | ORDER BY CAR_ID DESC -------------------------------------------------------------------------------- /프로그래머스/1/164673. 조건에 부합하는 중고거래 댓글 조회하기/조건에 부합하는 중고거래 댓글 조회하기.sql: -------------------------------------------------------------------------------- 1 | SELECT A.TITLE, A.BOARD_ID, B.REPLY_ID, B.WRITER_ID, B.CONTENTS, DATE_FORMAT(B.CREATED_DATE, "%Y-%m-%d") AS CREATED_DATE 2 | FROM USED_GOODS_BOARD A 3 | JOIN USED_GOODS_REPLY B ON A.BOARD_ID = B.BOARD_ID 4 | WHERE A.CREATED_DATE LIKE "2022-10%" 5 | ORDER BY B.CREATED_DATE ASC, A.TITLE ASC -------------------------------------------------------------------------------- /프로그래머스/1/1845. 폰켓몬/폰켓몬.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int solution(vector nums) 6 | { 7 | set s; 8 | 9 | for (int n : nums) 10 | s.insert(n); 11 | 12 | return ((s.size() < nums.size() / 2) ? (s.size()) : (nums.size() / 2)); 13 | } -------------------------------------------------------------------------------- /프로그래머스/1/276013. Python 개발자 찾기/Python 개발자 찾기.sql: -------------------------------------------------------------------------------- 1 | SELECT ID, EMAIL, FIRST_NAME, LAST_NAME 2 | FROM DEVELOPER_INFOS 3 | WHERE SKILL_1 = "Python" OR SKILL_2 = "Python" OR SKILL_3 = "Python" 4 | ORDER BY ID ASC -------------------------------------------------------------------------------- /프로그래머스/1/293258. 잔챙이 잡은 수 구하기/잔챙이 잡은 수 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT COUNT(*) AS FISH_COUNT 2 | FROM FISH_INFO 3 | WHERE LENGTH <= 10 OR LENGTH IS NULL 4 | -------------------------------------------------------------------------------- /프로그래머스/1/293259. 잡은 물고기의 평균 길이 구하기/잡은 물고기의 평균 길이 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT ROUND(AVG(IFNULL(LENGTH, 10)), 2) AS AVERAGE_LENGTH 2 | FROM FISH_INFO -------------------------------------------------------------------------------- /프로그래머스/1/298515. 잡은 물고기 중 가장 큰 물고기의 길이 구하기/잡은 물고기 중 가장 큰 물고기의 길이 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT CONCAT(MAX(LENGTH), "cm") AS MAX_LENGTH 2 | FROM FISH_INFO -------------------------------------------------------------------------------- /프로그래머스/1/298516. 한 해에 잡은 물고기 수 구하기/한 해에 잡은 물고기 수 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT COUNT(*) AS FISH_COUNT 2 | FROM FISH_INFO 3 | WHERE TIME LIKE "2021%" 4 | 5 | -------------------------------------------------------------------------------- /프로그래머스/1/298517. 가장 큰 물고기 10마리 구하기/가장 큰 물고기 10마리 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT ID, LENGTH 2 | FROM FISH_INFO 3 | ORDER BY LENGTH DESC, ID ASC 4 | LIMIT 10 5 | -------------------------------------------------------------------------------- /프로그래머스/1/301646. 특정 형질을 가지는 대장균 찾기/특정 형질을 가지는 대장균 찾기.sql: -------------------------------------------------------------------------------- 1 | SELECT COUNT(*) AS COUNT 2 | FROM ECOLI_DATA 3 | WHERE (GENOTYPE & 2 = 0) AND ((GENOTYPE & 1 != 0) OR (GENOTYPE & 4 != 0)) -------------------------------------------------------------------------------- /프로그래머스/1/59034. 모든 레코드 조회하기/모든 레코드 조회하기.sql: -------------------------------------------------------------------------------- 1 | SELECT * 2 | FROM ANIMAL_INS 3 | ORDER BY ANIMAL_ID -------------------------------------------------------------------------------- /프로그래머스/1/59035. 역순 정렬하기/역순 정렬하기.sql: -------------------------------------------------------------------------------- 1 | -- 코드를 입력하세요 2 | SELECT NAME, DATETIME 3 | FROM ANIMAL_INS 4 | ORDER BY ANIMAL_ID DESC 5 | -------------------------------------------------------------------------------- /프로그래머스/1/59036. 아픈 동물 찾기/아픈 동물 찾기.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME 2 | FROM ANIMAL_INS 3 | WHERE INTAKE_CONDITION LIKE 'Sick' 4 | ORDER BY ANIMAL_ID ASC -------------------------------------------------------------------------------- /프로그래머스/1/59037. 어린 동물 찾기/어린 동물 찾기.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME 2 | FROM ANIMAL_INS 3 | WHERE INTAKE_CONDITION != 'Aged' 4 | ORDER BY ANIMAL_ID ASC -------------------------------------------------------------------------------- /프로그래머스/1/59039. 이름이 없는 동물의 아이디/이름이 없는 동물의 아이디.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID 2 | FROM ANIMAL_INS 3 | WHERE NAME IS NULL 4 | ORDER BY ANIMAL_ID ASC -------------------------------------------------------------------------------- /프로그래머스/1/59403. 동물의 아이디와 이름/동물의 아이디와 이름.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME 2 | FROM ANIMAL_INS 3 | ORDER BY ANIMAL_ID -------------------------------------------------------------------------------- /프로그래머스/1/59404. 여러 기준으로 정렬하기/여러 기준으로 정렬하기.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, DATETIME 2 | FROM ANIMAL_INS 3 | ORDER BY NAME ASC, DATETIME DESC -------------------------------------------------------------------------------- /프로그래머스/1/59407. 이름이 있는 동물의 아이디/이름이 있는 동물의 아이디.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID 2 | FROM ANIMAL_INS 3 | WHERE NAME IS NOT NULL 4 | ORDER BY ANIMAL_ID ASC -------------------------------------------------------------------------------- /프로그래머스/1/59415. 최댓값 구하기/최댓값 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT MAX(DATETIME) 2 | FROM ANIMAL_INS -------------------------------------------------------------------------------- /프로그래머스/2/131536. 재구매가 일어난 상품과 회원 리스트 구하기/재구매가 일어난 상품과 회원 리스트 구하기.sql: -------------------------------------------------------------------------------- 1 | SELECT USER_ID, PRODUCT_ID 2 | FROM ONLINE_SALE 3 | GROUP BY USER_ID, PRODUCT_ID 4 | HAVING COUNT(*) > 1 5 | ORDER BY USER_ID ASC, PRODUCT_ID DESC -------------------------------------------------------------------------------- /프로그래머스/2/42577. 전화번호 목록/전화번호 목록.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | bool solution(vector phone_book) 8 | { 9 | sort(phone_book.begin(), phone_book.end()); 10 | for (int i = 0; i < phone_book.size() - 1; i++) 11 | { 12 | if (phone_book[i] == phone_book[i + 1].substr(0, phone_book[i].size())) 13 | return false; 14 | } 15 | return true; 16 | } -------------------------------------------------------------------------------- /프로그래머스/2/59410. NULL 처리하기/NULL 처리하기.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_TYPE, CASE WHEN NAME IS NULL THEN "No name" ELSE NAME END, SEX_UPON_INTAKE 2 | FROM ANIMAL_INS 3 | -------------------------------------------------------------------------------- /프로그래머스/unrated/181829. 이차원 배열 대각선 순회하기/이차원 배열 대각선 순회하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector> board, int k) 7 | { 8 | int answer = 0; 9 | 10 | for (int i = 0; i < board.size(); i++) 11 | for (int j = 0; j < board[0].size(); j++) 12 | if (i + j <= k) 13 | answer += board[i][j]; 14 | 15 | return answer; 16 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181830. 정사각형으로 만들기/정사각형으로 만들기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector> solution(vector> arr) 7 | { 8 | int rows = arr.size(), cols = arr[0].size(); 9 | 10 | if (rows > cols) 11 | for (vector &row : arr) 12 | row.resize(rows, 0); 13 | else if (rows < cols) 14 | arr.resize(cols, vector(cols, 0)); 15 | 16 | return arr; 17 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181831. 특별한 이차원 배열 2/특별한 이차원 배열 2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector> arr) 7 | { 8 | for (int i = 0; i < arr.size(); i++) 9 | for (int j = i + 1; j < arr.size(); j++) 10 | if (arr[i][j] != arr[j][i]) 11 | return false; 12 | return true; 13 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181833. 특별한 이차원 배열 1/특별한 이차원 배열 1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector> solution(int n) 7 | { 8 | vector> answer(n, vector(n)); 9 | 10 | for (int i = 0; i < n; i++) 11 | answer[i][i] = 1; 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181834. l로 만들기/l로 만들기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string myString) 7 | { 8 | string answer = myString; 9 | 10 | for (char &c : answer) 11 | if (c < 'l') 12 | c = 'l'; 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181835. 조건에 맞게 수열 변환하기 3/조건에 맞게 수열 변환하기 3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr, int k) 7 | { 8 | vector answer; 9 | 10 | if (k % 2) 11 | for (int n : arr) 12 | answer.push_back(n * k); 13 | else 14 | for (int n : arr) 15 | answer.push_back(n + k); 16 | 17 | return answer; 18 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181838. 날짜 비교하기/날짜 비교하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector date1, vector date2) 7 | { 8 | return date1 < date2; 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181839. 주사위 게임 1/주사위 게임 1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(int a, int b) 7 | { 8 | int answer = 0; 9 | 10 | if (a % 2 && b % 2) 11 | answer = a * a + b * b; 12 | else if (a % 2 || b % 2) 13 | answer = 2 * (a + b); 14 | else 15 | answer = abs(a - b); 16 | 17 | return answer; 18 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181840. 정수 찾기/정수 찾기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int solution(vector num_list, int n) 8 | { 9 | return find(num_list.begin(), num_list.end(), n) != num_list.end(); 10 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181841. 꼬리 문자열/꼬리 문자열.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(vector str_list, string ex) 7 | { 8 | string answer = ""; 9 | 10 | for (const string s : str_list) 11 | if (s.find(ex) == string::npos) 12 | answer += s; 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181842. 부분 문자열/부분 문자열.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string str1, string str2) 7 | { 8 | return str2.find(str1) != string::npos; 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181843. 부분 문자열인지 확인하기/부분 문자열인지 확인하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string my_string, string target) 7 | { 8 | return my_string.find(target) != string::npos; 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181844. 배열의 원소 삭제하기/배열의 원소 삭제하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | vector solution(vector arr, vector delete_list) 8 | { 9 | vector answer; 10 | 11 | for (int n : arr) 12 | if (find(delete_list.begin(), delete_list.end(), n) == delete_list.end()) 13 | answer.push_back(n); 14 | 15 | return answer; 16 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181845. 문자열로 변환/문자열로 변환.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(int n) 7 | { 8 | return to_string(n); 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181846. 두 수의 합/두 수의 합.py: -------------------------------------------------------------------------------- 1 | def solution(a, b): 2 | answer = str(int(a) + int(b)) 3 | return answer -------------------------------------------------------------------------------- /프로그래머스/unrated/181847. 0 떼기/0 떼기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string n_str) 7 | { 8 | return to_string(stoi(n_str)); 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181848. 문자열을 정수로 변환하기/문자열을 정수로 변환하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string n_str) 7 | { 8 | return stoi(n_str); 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181849. 문자열 정수의 합/문자열 정수의 합.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string num_str) 7 | { 8 | int answer = 0; 9 | 10 | for (char c : num_str) 11 | answer += c - '0'; 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181850. 정수 부분/정수 부분.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(double flo) 7 | { 8 | int answer = flo; 9 | return answer; 10 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181852. 뒤에서 5등 위로/뒤에서 5등 위로.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | vector solution(vector num_list) 8 | { 9 | vector answer; 10 | 11 | sort(num_list.begin(), num_list.end()); 12 | 13 | for (int i = 5; i < num_list.size(); i++) 14 | answer.push_back(num_list[i]); 15 | 16 | return answer; 17 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181853. 뒤에서 5등까지/뒤에서 5등까지.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | vector solution(vector num_list) 8 | { 9 | vector answer; 10 | 11 | sort(num_list.begin(), num_list.end()); 12 | 13 | for (int i = 0; i < 5; i++) 14 | answer.push_back(num_list[i]); 15 | 16 | return answer; 17 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181854. 배열의 길이에 따라 다른 연산하기/배열의 길이에 따라 다른 연산하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr, int n) 7 | { 8 | vector answer = arr; 9 | 10 | for (int i = !(arr.size() % 2); i < arr.size(); i += 2) 11 | answer[i] += n; 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181855. 문자열 묶기/문자열 묶기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector strArr) 7 | { 8 | int answer = 0; 9 | int arr[31]{0}; 10 | 11 | for (string str : strArr) 12 | answer = max(answer, ++arr[str.length()]); 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181857. 배열의 길이를 2의 거듭제곱으로 만들기/배열의 길이를 2의 거듭제곱으로 만들기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr) 7 | { 8 | int n = 1; 9 | 10 | while (n < arr.size()) 11 | n *= 2; 12 | 13 | arr.resize(n, 0); 14 | 15 | return arr; 16 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181861. 배열의 원소만큼 추가하기/배열의 원소만큼 추가하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr) 7 | { 8 | vector answer; 9 | 10 | for (int n : arr) 11 | for (int i = 0; i < n; i++) 12 | answer.push_back(n); 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181863. rny＿string/rny＿string.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string rny_string) 7 | { 8 | string answer = ""; 9 | 10 | for (char c : rny_string) 11 | { 12 | if (c == 'm') 13 | answer += "rn"; 14 | else 15 | answer += c; 16 | } 17 | 18 | return answer; 19 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181864. 문자열 바꿔서 찾기/문자열 바꿔서 찾기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int solution(string myString, string pat) 8 | { 9 | for (char &c : myString) 10 | { 11 | if (c == 'A') 12 | c = 'B'; 13 | else if (c == 'B') 14 | c = 'A'; 15 | } 16 | return myString.find(pat) != string::npos; 17 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181865. 간단한 식 계산하기/간단한 식 계산하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string binomial) 7 | { 8 | int i = binomial.find_first_of("+-*"); 9 | 10 | char op = binomial[i]; 11 | int a = stoi(binomial.substr(0, i)); 12 | int b = stoi(binomial.substr(i + 1)); 13 | 14 | return (op == '+') ? a + b : ((op == '-') ? a - b : a * b); 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181870. ad 제거하기/ad 제거하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector strArr) 7 | { 8 | vector answer; 9 | 10 | for (const string &str : strArr) 11 | if (str.find("ad") == string::npos) 12 | answer.push_back(str); 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181871. 문자열이 몇 번 등장하는지 세기/문자열이 몇 번 등장하는지 세기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string myString, string pat) 7 | { 8 | int answer = 0; 9 | 10 | for (int i = 0; i <= myString.length() - pat.length(); i++) 11 | if (myString.substr(i, pat.length()) == pat) 12 | answer++; 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181872. 특정 문자열로 끝나는 가장 긴 부분 문자열 찾기/특정 문자열로 끝나는 가장 긴 부분 문자열 찾기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string myString, string pat) 7 | { 8 | return myString.substr(0, myString.rfind(pat) + pat.length()); 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181873. 특정한 문자를 대문자로 바꾸기/특정한 문자를 대문자로 바꾸기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string my_string, string alp) 7 | { 8 | string answer = my_string; 9 | 10 | for (char &c : answer) 11 | if (c == alp[0]) 12 | c -= 32; 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181874. A 강조하기/A 강조하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string myString) 7 | { 8 | string answer = myString; 9 | 10 | for (char &c : answer) 11 | if ('a' <= c && 'z' >= c) 12 | c -= 32; 13 | 14 | for (char &c : answer) 15 | if ('A' <= c && 'Z' >= c && c != 'A') 16 | c += 32; 17 | 18 | return answer; 19 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181876. 소문자로 바꾸기/소문자로 바꾸기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string myString) 7 | { 8 | string answer = myString; 9 | 10 | for (char &c : answer) 11 | if ('A' <= c && 'Z' >= c) 12 | c += 32; 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181877. 대문자로 바꾸기/대문자로 바꾸기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string myString) 7 | { 8 | string answer = myString; 9 | 10 | for (char &c : answer) 11 | if ('a' <= c && 'z' >= c) 12 | c -= 32; 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181878. 원하는 문자열 찾기/원하는 문자열 찾기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string myString, string pat) 7 | { 8 | for (char &c : myString) 9 | if ('A' <= c && 'Z' >= c) 10 | c += 32; 11 | 12 | for (char &c : pat) 13 | if ('A' <= c && 'Z' >= c) 14 | c += 32; 15 | 16 | return myString.find(pat) != string::npos; 17 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181883. 수열과 구간 쿼리 1/수열과 구간 쿼리 1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr, vector> queries) 7 | { 8 | vector answer = arr; 9 | 10 | for (vector q : queries) 11 | { 12 | int s = q[0], e = q[1]; 13 | 14 | for (int i = s; i <= e; i++) 15 | answer[i]++; 16 | } 17 | 18 | return answer; 19 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181884. n보다 커질 때까지 더하기/n보다 커질 때까지 더하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector numbers, int n) 7 | { 8 | int answer = 0; 9 | 10 | for (int i = 0; i < numbers.size() && answer <= n; i++) 11 | answer += numbers[i]; 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181885. 할 일 목록/할 일 목록.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector todo_list, vector finished) 7 | { 8 | vector answer; 9 | 10 | for (int i = 0; i < todo_list.size(); i++) 11 | if (!finished[i]) 12 | answer.push_back(todo_list[i]); 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181886. 5명씩/5명씩.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector names) 7 | { 8 | vector answer; 9 | 10 | for (int i = 0; i < names.size(); i += 5) 11 | answer.push_back(names[i]); 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181887. 홀수 vs 짝수/홀수 vs 짝수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector num_list) 7 | { 8 | int e = 0, o = 0; 9 | 10 | for (int i = 0; i < num_list.size(); i++) 11 | { 12 | if (i % 2) 13 | e += num_list[i]; 14 | else 15 | o += num_list[i]; 16 | } 17 | 18 | return max(e, o); 19 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181888. n개 간격의 원소들/n개 간격의 원소들.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector num_list, int n) 7 | { 8 | vector answer; 9 | 10 | for (int i = 0; i < num_list.size(); i += n) 11 | answer.push_back(num_list[i]); 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181889. n 번째 원소까지/n 번째 원소까지.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector num_list, int n) 7 | { 8 | vector answer; 9 | 10 | for (int i = 0; i < n; i++) 11 | answer.push_back(num_list[i]); 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181891. 순서 바꾸기/순서 바꾸기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | vector solution(vector num_list, int n) 8 | { 9 | rotate(num_list.begin(), num_list.begin() + n, num_list.end()); 10 | return num_list; 11 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181892. n 번째 원소부터/n 번째 원소부터.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector num_list, int n) 7 | { 8 | vector answer; 9 | 10 | for (int i = n - 1; i < num_list.size(); i++) 11 | answer.push_back(num_list[i]); 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181894. 2의 영역/2의 영역.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr) 7 | { 8 | auto a = find(arr.begin(), arr.end(), 2); 9 | auto b = find(arr.rbegin(), arr.rend(), 2).base(); 10 | 11 | if (a == arr.end()) 12 | return {-1}; 13 | 14 | return {a, b}; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181895. 배열 만들기 3/배열 만들기 3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr, vector> intervals) 7 | { 8 | vector answer; 9 | 10 | for (vector v : intervals) 11 | { 12 | int a = v[0], b = v[1]; 13 | 14 | for (int i = a; i <= b; i++) 15 | answer.push_back(arr[i]); 16 | } 17 | 18 | return answer; 19 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181896. 첫 번째로 나오는 음수/첫 번째로 나오는 음수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector num_list) 7 | { 8 | for (int i = 0; i < num_list.size(); i++) 9 | if (num_list[i] < 0) 10 | return i; 11 | 12 | return -1; 13 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181898. 가까운 1 찾기/가까운 1 찾기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector arr, int idx) 7 | { 8 | for (int i = idx; i < arr.size(); i++) 9 | if (arr[i]) 10 | return i; 11 | 12 | return -1; 13 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181899. 카운트 다운/카운트 다운.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(int start, int end_num) 7 | { 8 | vector answer; 9 | 10 | for (int i = start; i >= end_num; i--) 11 | answer.push_back(i); 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181900. 글자 지우기/글자 지우기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | string solution(string my_string, vector indices) 8 | { 9 | string answer = ""; 10 | 11 | for (int i = 0; i < my_string.length(); i++) 12 | if (find(indices.begin(), indices.end(), i) == indices.end()) 13 | answer += my_string[i]; 14 | 15 | return answer; 16 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181901. 배열 만들기 1/배열 만들기 1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | vector solution(int n, int k) 8 | { 9 | vector answer; 10 | 11 | for (int i = k; i <= n; i += k) 12 | answer.push_back(i); 13 | 14 | sort(answer.begin(), answer.end()); 15 | 16 | return answer; 17 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181902. 문자 개수 세기/문자 개수 세기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(string my_string) 7 | { 8 | vector answer(52, 0); 9 | 10 | for (char c : my_string) 11 | answer[c - (c >= 'A' && c <= 'Z' ? 'A' : 'G')]++; 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181903. qr code/qr code.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(int q, int r, string code) 7 | { 8 | string answer = ""; 9 | 10 | for (int i = 0; i < code.length(); i++) 11 | if (i % q == r) 12 | answer += code[i]; 13 | 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181904. 세로 읽기/세로 읽기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string my_string, int m, int c) 7 | { 8 | string answer = ""; 9 | 10 | for (int i = c - 1; i < my_string.length(); i += m) 11 | answer += my_string[i]; 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181905. 문자열 뒤집기/문자열 뒤집기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | string solution(string my_string, int s, int e) 8 | { 9 | string answer = my_string; 10 | 11 | reverse(answer.begin() + s, answer.begin() + e + 1); 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181906. 접두사인지 확인하기/접두사인지 확인하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string my_string, string is_prefix) 7 | { 8 | for (int i = 0; i < my_string.length(); i++) 9 | if (is_prefix == my_string.substr(0, i)) 10 | return 1; 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181907. 문자열의 앞의 n글자/문자열의 앞의 n글자.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string my_string, int n) 7 | { 8 | string answer = my_string.substr(0, n); 9 | return answer; 10 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181908. 접미사인지 확인하기/접미사인지 확인하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string my_string, string is_suffix) 7 | { 8 | for (int i = 0; i < my_string.length(); i++) 9 | if (is_suffix == my_string.substr(i)) 10 | return 1; 11 | 12 | return 0; 13 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181909. 접미사 배열/접미사 배열.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | vector solution(string my_string) 8 | { 9 | vector answer; 10 | 11 | for (int i = 0; i < my_string.length(); ++i) 12 | answer.push_back(my_string.substr(i)); 13 | 14 | sort(answer.begin(), answer.end()); 15 | 16 | return answer; 17 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181910. 문자열의 뒤의 n글자/문자열의 뒤의 n글자.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string my_string, int n) 7 | { 8 | string answer = my_string.substr(my_string.size() - n, n); 9 | return answer; 10 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181911. 부분 문자열 이어 붙여 문자열 만들기/부분 문자열 이어 붙여 문자열 만들기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(vector my_strings, vector> parts) 7 | { 8 | string answer = ""; 9 | 10 | for (int i = 0; i < parts.size(); i++) 11 | answer += my_strings[i].substr(parts[i][0], parts[i][1] - parts[i][0] + 1); 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181912. 배열 만들기 5/배열 만들기 5.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector intStrs, int k, int s, int l) 7 | { 8 | vector answer; 9 | 10 | for (string str : intStrs) 11 | { 12 | int n = stoi(str.substr(s, l)); 13 | 14 | if (n > k) 15 | answer.push_back(n); 16 | } 17 | 18 | return answer; 19 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181914. 9로 나눈 나머지/9로 나눈 나머지.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string number) 7 | { 8 | int answer = 0; 9 | 10 | for (char n : number) 11 | answer += n - '0'; 12 | 13 | answer %= 9; 14 | 15 | return answer; 16 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181915. 글자 이어 붙여 문자열 만들기/글자 이어 붙여 문자열 만들기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string my_string, vector index_list) 7 | { 8 | string answer = ""; 9 | 10 | for (int n : index_list) 11 | answer += my_string[n]; 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181917. 간단한 논리 연산/간단한 논리 연산.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | bool solution(bool x1, bool x2, bool x3, bool x4) 7 | { 8 | bool answer = (x1 || x2) && (x3 || x4); 9 | return answer; 10 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181919. 콜라츠 수열 만들기/콜라츠 수열 만들기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(int n) 7 | { 8 | vector answer; 9 | answer.push_back(n); 10 | 11 | while (answer.back() != 1) 12 | { 13 | int x = answer.back(); 14 | answer.push_back(x % 2 ? 3 * x + 1 : x / 2); 15 | } 16 | 17 | return answer; 18 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181920. 카운트 업/카운트 업.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(int start_num, int end_num) 7 | { 8 | vector answer; 9 | 10 | for (int i = start_num; i <= end_num; i++) 11 | answer.push_back(i); 12 | 13 | return answer; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181924. 수열과 구간 쿼리 3/수열과 구간 쿼리 3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector arr, vector> queries) { 7 | vector answer; 8 | return answer; 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181926. 수 조작하기 1/수 조작하기 1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int solution(int n, string control) 7 | { 8 | int answer = n; 9 | 10 | map m; 11 | m['w'] = 1; 12 | m['s'] = -1; 13 | m['d'] = 10; 14 | m['a'] = -10; 15 | 16 | for (char c : control) 17 | answer += m[c]; 18 | 19 | return answer; 20 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181927. 마지막 두 원소/마지막 두 원소.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | vector solution(vector num_list) 7 | { 8 | vector answer = num_list; 9 | 10 | int a = num_list[num_list.size() - 2]; 11 | int b = num_list[num_list.size() - 1]; 12 | 13 | answer.push_back(a < b ? b - a : b * 2); 14 | return answer; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181928. 이어 붙인 수/이어 붙인 수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector num_list) 7 | { 8 | int e = 0, o = 0; 9 | for (int n : num_list) 10 | { 11 | if (n % 2) 12 | o = o * 10 + n; 13 | else 14 | e = e * 10 + n; 15 | } 16 | return e + o; 17 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181929. 원소들의 곱과 합/원소들의 곱과 합.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(vector num_list) 7 | { 8 | int sum = 0, product = 1; 9 | for (int n : num_list) 10 | sum += n, product *= n; 11 | return product < sum * sum; 12 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181930. 주사위 게임 2/주사위 게임 2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(int a, int b, int c) 7 | { 8 | if (a == b && b == c) 9 | return (a + b + c) * (a * a + b * b + c * c) * (a * a * a + b * b * b + c * c * c); 10 | 11 | if (a != b && b != c && c != a) 12 | return (a + b + c); 13 | 14 | return (a + b + c) * (a * a + b * b + c * c); 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181931. 등차수열의 특정한 항만 더하기/등차수열의 특정한 항만 더하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(int a, int d, vector included) 7 | { 8 | int sum = a; 9 | int answer = 0; 10 | 11 | for (bool b : included) 12 | { 13 | answer += b * sum; 14 | sum += d; 15 | } 16 | 17 | return answer; 18 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181933. flag에 따라 다른 값 반환하기/flag에 따라 다른 값 반환하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(int a, int b, bool flag) 7 | { 8 | int answer = 0; 9 | answer = a + (flag ? b : -b); 10 | return answer; 11 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181934. 조건 문자열/조건 문자열.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(string ineq, string eq, int n, int m) 7 | { 8 | if (eq == "!" && n == m) 9 | return 0; 10 | if (ineq == "<" && n > m) 11 | return 0; 12 | if (ineq == ">" && n < m) 13 | return 0; 14 | return 1; 15 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181935. 홀짝에 따라 다른 값 반환하기/홀짝에 따라 다른 값 반환하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(int n) 7 | { 8 | int answer = 0; 9 | answer = (n % 2 ? (n / 2 + 1) * (n / 2 + 1) : (n * (n + 1) * (n + 2)) / 6); 10 | return answer; 11 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181936. 공배수/공배수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(int number, int n, int m) 7 | { 8 | return !(number % n || number % m); 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181937. n의 배수/n의 배수.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int solution(int num, int n) 7 | { 8 | return !(num % n); 9 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181938. 두 수의 연산값 비교하기/두 수의 연산값 비교하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int solution(int a, int b) 8 | { 9 | int answer = 0; 10 | answer = max(answer, a * int(pow(10, int(log10(b) + 1))) + b); 11 | answer = max(answer, 2 * a * b); 12 | return answer; 13 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181939. 더 크게 합치기/더 크게 합치기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int solution(int a, int b) 8 | { 9 | int answer = 0; 10 | answer = max(a * int(pow(10, int(log10(b) + 1))) + b, b * int(pow(10, int(log10(a) + 1))) + a); 11 | return answer; 12 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181940. 문자열 곱하기/문자열 곱하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string my_string, int k) 7 | { 8 | string answer; 9 | for (int i = 0; i < k; i++) 10 | answer += my_string; 11 | return answer; 12 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181941. 문자 리스트를 문자열로 변환하기/문자 리스트를 문자열로 변환하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(vector arr) 7 | { 8 | string answer; 9 | for (string str : arr) 10 | answer += str; 11 | return answer; 12 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181942. 문자열 섞기/문자열 섞기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string str1, string str2) 7 | { 8 | string answer; 9 | for (int i = 0; i < str1.length(); i++) 10 | answer += str1[i], answer += str2[i]; 11 | return answer; 12 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181943. 문자열 겹쳐쓰기/문자열 겹쳐쓰기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | string solution(string my_string, string overwrite_string, int s) 7 | { 8 | string answer = my_string; 9 | answer.replace(s, overwrite_string.length(), overwrite_string); 10 | return answer; 11 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181944. 홀짝 구분하기/홀짝 구분하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | int n; 8 | cin >> n; 9 | cout << n << (n % 2 ? " is odd" : " is even"); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181945. 문자열 돌리기/문자열 돌리기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main(void) 7 | { 8 | string str; 9 | cin >> str; 10 | for (char c : str) 11 | cout << c << endl; 12 | return 0; 13 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181946. 문자열 붙여서 출력하기/문자열 붙여서 출력하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main(void) 7 | { 8 | string str1, str2; 9 | cin >> str1 >> str2; 10 | cout << str1 << str2; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181947. 덧셈식 출력하기/덧셈식 출력하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) 6 | { 7 | int a; 8 | int b; 9 | cin >> a >> b; 10 | cout << a << " + " << b << " = " << a + b << endl; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181948. 특수문자 출력하기/특수문자 출력하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) { 6 | cout << "!@#$%^&*(\\\'\"<>\?:;"; 7 | return 0; 8 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181949. 대소문자 바꿔서 출력하기/대소문자 바꿔서 출력하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main(void) 7 | { 8 | string str; 9 | cin >> str; 10 | for (int i = 0; i < str.length(); i++) 11 | str[i] += 'A' <= str[i] && str[i] <= 'Z' ? 32 : -32; 12 | cout << str; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181950. 문자열 반복해서 출력하기/문자열 반복해서 출력하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main(void) 7 | { 8 | string str; 9 | int n; 10 | cin >> str >> n; 11 | for (int i = 0; i < n; i++) 12 | cout << str; 13 | return 0; 14 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181951. a와 b 출력하기/a와 b 출력하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main(void) { 6 | int a; 7 | int b; 8 | cin >> a >> b; 9 | cout << "a = " << a << endl; 10 | cout << "b = " << b << endl; 11 | return 0; 12 | } -------------------------------------------------------------------------------- /프로그래머스/unrated/181952. 문자열 출력하기/문자열 출력하기.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main(void) { 7 | string str; 8 | cin >> str; 9 | cout << str; 10 | return 0; 11 | } --------------------------------------------------------------------------------