Algorithm/Implementation (751) 썸네일형 리스트형 (C++) - 백준(BOJ) 6437 : Golf https://www.acmicpc.net/problem/6437 6437번: Golf Whoever wants to learn the game of golf has to cope with several oddities first (as with every other game that originates from Great Britain). One of them is the way to count the number of strokes a player needed to put his golf ball in a hole. There is a www.acmicpc.net 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 정해진 par의 수 p, 실제 stroke 횟수 s, test case 번호 cn.. (C++) - 백준(BOJ) 6436 : Floppies https://www.acmicpc.net/problem/6436 6436번: Floppies In this age of Internet, on-line connections, instantaneous email, etc., there are still some people who need to work with floppy disks. John is one of those. Every evening he goes home and continues what he has been doing in his office on his private UNIX www.acmicpc.net 구현문제였습니다. 📕 풀이방법 📔 입력 및 초기화 SHAR file의 크기 sz, test case번호 cnt를 선언 후 whil.. (C++) - 백준(BOJ) 6249 : TV Reports https://www.acmicpc.net/problem/6249 6249번: TV Reports The first line of the input contains three positive integers n, p, and h (separated by a space), where n (1 ≤ n,p,h ≤ 10,000) specifies the number of days you are hired for to record the headlines, p is the price of Dollar one day before you start your www.acmicpc.net 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 정보의 수 n, 전날의 처음 달라 가격 p, 전날 달라의 최고가 h를 선언합.. (C++) - 백준(BOJ) 6190 : Another Cow Number Game https://www.acmicpc.net/problem/6190 6190번: Another Cow Number Game The cows are playing a silly number game again. Bessie is tired of losing and wants you to help her cheat. In this game, a cow supplies a number N (1 n; while(n != 1) { if(n % 2) n = 3 * n + 1; else n/=2; score++; } cout (C++) - 백준(BOJ) 6162 : Superlatives https://www.acmicpc.net/problem/6162 6162번: Superlatives Typically, droughts are classified into “abnormally dry”, “moderate drought”, “severe drought”, “extreme drought”, and “exceptional drought”. The current drought is so “exceptional” in most of California that there have been discuss www.acmicpc.net 구현문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 테스트 케이스 개수 t를 선언 후 입력해줍니다. 2. t만큼 for loop를 수행하며 expected, ac.. (C++) - 백준(BOJ) 6138 : Speed Reading 보호되어 있는 글입니다. (C++) - 백준(BOJ) 6060 : Wheel Rotation https://www.acmicpc.net/problem/6060 6060번: Wheel Rotation Farmer John has an old-time thresher (wheat harvester) that requires belts to be installed on various gears to turn the parts. The engine drives pulley 1 in a clockwise direction which attaches via a belt to pulley 2. Pulley 2 attaches via a belt to pulley www.acmicpc.net 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. n, 현재위치 cur, gear가 도는 방향 curDir을 선.. (C++) - 백준(BOJ) 5751 : Head or Tail https://www.acmicpc.net/problem/5751 5751번: Head or Tail John and Mary have been friends since nursery school. Since then, they have shared a playful routine: every time they meet, they play Head or Tail with a coin, and whoever wins has the privilege of deciding what they are going to play during the day. Mary www.acmicpc.net 구현문제였습니다. 📕 풀이방법 📔 입력 및 초기화 test case n을 선언 후 while loop를 수행하며 입력해줍니다.. 이전 1 ··· 64 65 66 67 68 69 70 ··· 94 다음