2020年USACO 2月比赛铜级获奖名单
Final Results: USACO 2020 February Contest, Bronze Key: * = Correct x = Wrong Answer (including possibly empty or missing output file) t = Timeout c = Didn't Compile ! = Run-time error or exceeded ...
USACO 2020 February Contest, Bronze Problem 1. Triangles
USACO 2020 February Contest, Bronze Problem 1. Triangles Farmer John would like to create a triangular pasture for his cows. There are NN fence posts (3≤N≤1003≤N≤100) at distinct points (X1,Y1)…(XN...
10个最受美国学生欢迎的写作竞赛！
对未来计划进入英美高校的孩子而言，写作的重要性再怎么强调都不为过。 无论是申请中最关键的文书，日常动不动就要来一篇的essay，还是期末决定一个学期成绩的paper…… 无论是哪种形式的考察，其实核心都是考察学...
USACO 2020 February Contest, Bronze Problem 2. Mad Scientist
USACO 2020 February Contest, Bronze Problem 2. Mad Scientist Farmer John's cousin Ben happens to be a mad scientist. Normally, this creates a good bit of friction at family gatherings, but it can o...
USACO 2020 February Contest, Bronze Problem 3. Swapity Swap
USACO 2020 February Contest, Bronze Problem 3. Swapity Swap Farmer John's NN cows (1≤N≤1001≤N≤100) are standing in a line. The iith cow from the left has label ii, for each 1≤i≤N1≤i≤N. Farmer John ...
2020年USACO 2月比赛银级获奖名单
Final Results: USACO 2020 February Contest, Silver Key: * = Correct x = Wrong Answer (including possibly empty or missing output file) t = Timeout c = Didn't Compile ! = Run-time error or exceeded ...
USACO 2020 February Contest, Silver Problem 1. Swapity Swapity Swap
USACO 2020 February Contest, Silver Problem 1. Swapity Swapity Swap Farmer John's NN cows (1≤N≤1051≤N≤105) are standing in a line. The iith cow from the left has label ii for each 1≤i≤N1≤i≤N. Farme...
USACO 2020 February Contest, Silver Problem 2. Triangles
Farmer John would like to create a triangular pasture for his cows. There are NN fence posts (3≤N≤1053≤N≤105) at distinct points (X1,Y1)…(XN,YN)(X1,Y1)…(XN,YN) on the 2D map of his farm. He can cho...
USACO 2020 February Contest, Silver Problem 3. Clock Tree
USACO 2020 February Contest, Silver Problem 3. Clock Tree Farmer John's new barn has a truly strange design: it consists of NN rooms (2≤N≤25002≤N≤2500), conveniently numbered 1…N1…N, and N−1N−1 cor...
