老程序员111 - 博客园

摘要： Problem Description You are given an integer sequence of length N, a1,a2,…,aN. For each 1≤i≤N, you have three choices: add 1 t... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(30) 评论(0) 推荐(0)

摘要： Problem Description We have a board with a 2×N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino c... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(41) 评论(0) 推荐(0)

摘要： Problem Description We have N sticks with negligible thickness. The length of the i-th stick is Ai. Snuke wants to select four... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(34) 评论(0) 推荐(0)

摘要： Problem Description We have a grid with H rows and W columns of squares. Snuke is painting these squares in colors 1, 2, …, N. ... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(35) 评论(0) 推荐(0)

摘要： Problem Description We have a sequence of length N, a=(a1,a2,…,aN). Each ai is a positive integer. Snuke's objective is to per... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(32) 评论(0) 推荐(0)

摘要： Problem Description We have a sequence of length N consisting of non-negative integers. Consider performing the following opera... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(25) 评论(0) 推荐(0)

摘要： Problem Description We have a sequence of length N consisting of non-negative integers. Consider performing the following opera... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(28) 评论(0) 推荐(0)

摘要：【运算符和表达式】 A+B问题（信息学奥赛一本通-T1006）：点击这里计算(a+b)*c的值（信息学奥赛一本通-T1007）：点击这里计算(a+b)/c的值（信息学奥赛一本通-T1008）：点击这里带余除法（信息学奥赛一本通-T1009）：点击这里计算分数的... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(40) 评论(0) 推荐(0)

摘要： Problem Description Fennec and Snuke are playing a board game. On the board, there are N cells numbered 1 through N, and N−1 r... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(20) 评论(0) 推荐(0)

摘要： Problem Description Snuke and Raccoon have a heap of N cards. The i-th card from the top has the integer ai written on it. The... 阅读全文

posted @ 2022-09-20 22:54 老程序员111 阅读(12) 评论(0) 推荐(0)

bianchengmao