Cody

Karl Ezra Pilario

16
Rank
60
Badges
20190
Score
1 – 50 of 1,824

Karl Ezra Pilario submitted Solution 2428751 to Problem 175. Double Deal

14 hours and 36 minutes ago

Karl Ezra Pilario submitted Solution 2428691 to Problem 2397. Leap Year

14 hours and 41 minutes ago

Karl Ezra Pilario received Matrix Manipulation III Master badge

on 28 May 2020 at 22:34

Karl Ezra Pilario submitted Solution 2406155 to Problem 42856. Block average

on 28 May 2020 at 18:32

Karl Ezra Pilario submitted Solution 2405063 to Problem 1641. ABBREVIATION

on 28 May 2020 at 17:36

Karl Ezra Pilario submitted Solution 2404771 to Problem 203. fly fly away

on 28 May 2020 at 17:23

Karl Ezra Pilario submitted Solution 2403475 to Problem 45345. Grazing-01

on 28 May 2020 at 15:47

Karl Ezra Pilario submitted Solution 2403407 to Problem 45345. Grazing-01

on 28 May 2020 at 15:40

Karl Ezra Pilario submitted a Comment to Solution 2290704

This solution can be improved if line 6 becomes: a(P(j,1),P(j,2)) = a(P(j,1),P(j,2)) + P(j,3); I'm sorry for the confusion. You see, there can be more than 1 path between two points.

on 28 May 2020 at 15:14

Karl Ezra Pilario submitted a Comment to Problem 45500. Maximize the production in a plant within equipment capacity

To clarify, here is a possible breakdown for Test Case 15: [34 goods can flow along path 1-2-10-11] + [2 goods can flow along path 1-3-4-8-11] + [8 goods can flow along path 1-3-7-9-11] = 34 + 2 + 8 = 44. Take note that we can flow 34 goods from Point 10 to Point 11.

on 28 May 2020 at 15:07

Karl Ezra Pilario submitted Solution 2397235 to Problem 42706. Step up

on 27 May 2020 at 23:14

1 – 50 of 1,824