무니화니

https://www.acmicpc.net/problem/2852[English Translation]Donghyuk enjoys watching NBA basketball games. Donghyuk has this weird hobby, where a team scores a goal, he records the time the goal got in and the team who scored. Basketball game goes on for 48 minutes. Return the time how long each team was winning. [Input]In the first line, total count of that each goal is given.Starting from the sec..

https://www.acmicpc.net/problem/11066 #include #include #include #include #include using namespace std;int main() { int t; cin >> t; int n; for (int i = 0; i map; int dp[501][501]; memset(dp, 0, sizeof(dp)); cin >> n; int temp; map.push_back(0); for (int j = 1; j > temp; map.push_back(map[j - 1] + temp); } for (in..

https://www.acmicpc.net/problem/18235[English Translation]On the way returning to their home country "Quack Quack Land" , Duck and Buck (Author's translation: duck is 'ori' in korean language, and the syllable 'o' means number 5, and this problem decided to call a different duck yuk-ri, which literally translates into 6-ri, since 'yuk' is 6 in korean. just a word pun, and I just decided to call ..

[English Translation]There is an array length of N filled wih zeros, named A. Young-sun can do two types of calculations.Increment by 1 on one value of the arrayMultiply every values by 2If array B is given, Make a program that calculates least amount of calculations that have to be made, in order to make array A into B. [Input]In the first line, size of array N is given. In the second line, ele..

https://www.acmicpc.net/problem/11438[English Translation]Tree with N vertices is given. Each vertex of a tree is number from 1 to N, and the root is number 1.If M pairs of nodes are given, return the closest LCA of these two nodes.[Input]in the first line, count of nodes N is given.After that, n-1 lines of two connected vertices of tree is given. After that, desired count of the LCA of two node..

https://www.acmicpc.net/problem/2022 [English Translation available through pressing 한국어 button and checking English] 해당 문제는 Binary Search를 이용하여 오차 범위 이내에서 두 빌딩 사이의 거리를 구하는 문제이다.먼저, 해당 문제를 diagram으로 나타내보겠다.x,y,c의 값은 문제와 같게 고정된 값으로 정해진다.x_h란 x를 빗변으로 갖는 삼각형의 높이, y_h는 y를 빗변으로 갖는 삼각형의 높이로 정의하였다.mid는 두 삼각형의 공통 밑변으로 정의하였다.mid의 값이 커지면 빗변의 길이가 고정되어 있기 때문에, x_h와 y_h의 값이 작아진다.mid의 값이 작아지면, x_h와 y_h의 값이 커질..

https://www.acmicpc.net/problem/4969 [English] -> Click on the [영어] button on the side #include #include #include #include using namespace std;int main(){ int nums[300001]={}; fill(nums,nums+300001,0); for (int i=2;i>n; if (n==1) return 0; vector answer={}; for (int i = 2; i  해당 문제는 에라토스테네스의 체의 변형을 이용하여 풀었다.먼저, 숫자의 최대 사이즈인 30만을 배열로 저장하여, 월요일-토요일 소수 여부를 파악하였다.월요일-토요..

https://www.acmicpc.net/problem/2343 [English]Gang-to wants to sell his own Guitar-lesson videos by making them into Blu-ray. In Blu-ray, total of N lessons need to be saved, but when recording Blu-ray, the order of the lessons must not be switched. When the order gets swapped, it makes the students confused. So, in order to record i-th and j-th lesson in the same blu-ray, all of the lessons bet..

[English]N**2 Numbers are filled in a N by N size Table. There is a unique characteristic, that every number is bigger than the one above. Take a look at the table when N is 5.When a table is given like this, Find a Program where you can find a Nth biggest number in the table. Every number in the table is different.[Input]In the first line (1for the next N rows, there are N numbers given. Every..

[English]Hansoo and Moonbin are in love.Hansoo loves Palindrome Strings more than anyone else in this world, so Moonbin decided to give a Palindrome to Hansoo for their 100th day as a couple.Moonbin tries to make a palindrome with Hansoo's English name, by mixing up Hansoo's English Alphabets accordingly.Help Moonbin making Hansoo's English name into a palindrome.[Input]On the first line, there ..