6 PM – USACO – Bronze – Gamas

Today We Did

1. We finished Milk Pails problem
2. We started with Roundabout Rounding problem.

Homework

1. Also try to implement two problems with difficulties of 800 from codeforces.com
   1. https://codeforces.com/problemset/problem/2172/A
   2. https://codeforces.com/problemset/problem/2167/C
2. Continue working on Roundabout Rounding problem https://usaco.org/index.php?page=viewproblem2&cpid=1443
   1. Just to clarify, the meaning of this problem statement “She tasks you to count how many integers x at least 2 and at most N (1≤N≤109) exist such that rounding x to the nearest 10P is different than chain rounding to the nearest 10P” this means, you need to compare the discrepancy between Bessie and Elsie for the number provided rounded to 10, 100, 1000, 10,000, 100,000…. 10^9. If the number provided is 4567, we are counting the discrepancy for number from 0 to 4449 which means
      1. 44, 45, 46, 47, 48, 49 – 5 discrepancies when rounding to either 0 or 100.
      2. 444 to 499 – 55 discrepancies when rounding to either 0 or 1000.
      3. 4444 to 4567 – 123 discrepancies (4567 – 4444) when rounding to either 0 or 10000.
      4. Total discrepancy is 5 + 55 + 123 = 183
   2. See if you can figure out the pattern and the formula for the number of discrepancies for rounding to 100,000, 1,000,0000 until 10 ^ 9.and try to implement a solution.