
2017CCPC
白雪黑夜我不停歇
这个作者很懒,什么都没留下…
展开
-
2017年ICPC中国大陆区域赛真题(下)B题
题目网址:点击进入 problem: When I was young, my father is a senior gaming enthusiast. One day, we saw a old man in the street . He had a dice and played with other people . Every turn the gambler gives k RMB ...原创 2019-08-19 14:49:15 · 1242 阅读 · 0 评论 -
2017年ICPC中国大陆区域赛真题(下)E题
题目网址:点击进入 problem: Little boxes on the hillside. Little boxes made of ticky-tacky. Little boxes. Little boxes. Little boxes all the same. There are a green boxes, and b pink boxes. And c blue boxes an...原创 2019-08-19 15:52:13 · 168 阅读 · 0 评论 -
2017年ICPC中国大陆区域赛真题(下)F题
题目网址:点击进入 problem: Here N (N ≥ 3) rabbits are playing by the river. They are playing on a number line, each occupying a different integer. In a single move, one of the outer rabbits jumps into a space...原创 2019-08-19 17:03:15 · 163 阅读 · 0 评论 -
2017年ICPC中国大陆区域赛真题(上)A题
#include <bits/stdc++.h> using namespace std; int main() { int k=666; scanf("%d",&k); for (int i = 0;i <=k; i++) { int space = k - i; for (int j = 0; j < space; j++) { printf(" "); } for (int j = 0; j <= i; j++) { prin原创 2019-08-15 15:34:19 · 366 阅读 · 0 评论 -
2017年ICPC中国大陆区域赛真题(下)I题
题目网址:点击进入 problem: It is said that a dormitory with 6 persons has 7 chat groups _. But the number can be even larger: since every 3 or more persons could make a chat group, there can be 42 different c...原创 2019-08-20 18:19:16 · 258 阅读 · 0 评论 -
2017年ICPC中国大陆区域赛真题(上)B题
题目网址:点击进入 problem: The Yongzheng Emperor (13 December 1678 – 8 October 1735), was the fifth emperor of the Qing dynasty of China. He was a very hard-working ruler. He cracked down on corruption and hi...原创 2019-08-15 21:20:16 · 491 阅读 · 0 评论 -
2017年ICPC中国大陆区域赛真题(下)A题
题目网址:点击进入 problem: One day n girls and n boys come to Xi’an to look for a mate. Each girl has a value a[i], each boy has a value b[i]. Girl i and boy j will fall in love only if a[i] + b[j] ≥ k. Pleas...原创 2019-08-18 15:24:40 · 336 阅读 · 0 评论