2017 Mini Competition 0 M1701-5: Tony Wong M1706: Alex Tung (Story by Tony Wong) Yuju Sinb /News/End?Id=7941357
2017 Mini Competition 0 M1701-5: Tony Wong M1706: Alex Tung (story by Tony Wong) http://m.star.naver.com/GFRIEND Yuju SinB /news/end?id=7941357 Eunha Yerin Sowon “ Umji M1701 - Hearts https://youtu.be/bwTVerz9X3c 2017 Mini Competition 0 3 M1701 - Hearts ▸ Each small heart and large heart requires exactly 1 Buddy ▸ Each extra large heart requires 2 extra Buddies ▸ These 2퐷 Buddies can make 2퐷 mini hearts ▹ 퐴 ← max(0, 퐴 − 2퐷) ▸ Finally, 퐴/2 additional Buddies are required to make the remaining mini hearts ▸ long long is required 2017 Mini Competition 0 4 M1702 – Archery http://ent.mbc.co.kr/content/4918 2017 Mini Competition 0 5 M1702 - Archery ▸ Compute the Euclidean distance of the center of the arrow to the origin: 푑 = 푥2 + 푦2 ▸ The score of the arrow is the max 푝 ∈ 1, 2, 3, … , 10 such that 푑 − 푟 ≤ 40(11 − 푝) ▸ To avoid precision error, we square both sides of the inequality 푥2 + 푦2 ≤ [40 11 − 푝 + 푟]2 ▸ To further avoid precision error, we store 푥, 푦 and 푟 using integers by multiplying the numbers by 10 (i.e. 푟 = 12for 1.2mm) 푥2 + 푦2 ≤ [400 11 − 푝 + 푟]2 2017 Mini Competition 0 6 M1703 – Photo Collage Jeremy's favourite photo http://childyenni.tistory.com/11 2017 Mini Competition 0 7 M1703 – Photo Collage ▸ How to represent the photos? ▹ Sowon, Yerin, Eunha, Yuju, SinB, Umji ▹ Method 1: Index the members using 0, 1, 2, 3, 4, 5. Create a 2D boolean array A of size N x 6. Set A[i][j] to true if member j is present in photo i ▹ Method 2 (better): Index the members using 1, 2, 4, 8, 16, 32.
[Show full text]