摘要：
Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero an 阅读全文
摘要：
A card pyramid of height 11 is constructed by resting two cards against each other. For h>1h>1, a card pyramid of height hh is constructed by placing 阅读全文
摘要：
You are given a special jigsaw puzzle consisting of n⋅mn⋅m identical pieces. Every piece has three tabs and one blank, as pictured below. The jigsaw p 阅读全文
摘要：
A. Sum of Round Numbers 把一个数拆成几个整十/百/千...的数的和。 #include <bits/stdc++.h> using namespace std; int main() { int t; cin>>t; while(t--) { int i,num,ans=0; 阅读全文
摘要：
In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are for 阅读全文
摘要：
题目描述 There are exactly nnn towns in Byteotia. Some towns are connected by bidirectional roads. There are no crossroads outside towns, though there may 阅读全文
摘要：
题目描述 幼儿园里有 NNN 个小朋友，lxhgww\text{lxhgww}lxhgww 老师现在想要给这些小朋友们分配糖果，要求每个小朋友都要分到糖果。 但是小朋友们也有嫉妒心，总是会提出一些要求，比如小明不希望小红分到的糖果比他的多，于是在分配糖果的时候，lxhgww\text{lxhgww} 阅读全文
摘要：
A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools t 阅读全文
摘要：
题目背景 缩点+DP 题目描述 给定一个 nnn 个点 mmm 条边有向图，每个点有一个权值，求一条路径，使路径经过的点权值之和最大。你只需要求出这个权值和。 允许多次经过一条边或者一个点，但是，重复经过的点，权值只计算一次。 输入格式 第一行两个正整数 n,mn,mn,m 第二行 nnn 个整数， 阅读全文
摘要：
Phoenix has decided to become a scientist! He is currently investigating the growth of bacteria. Initially, on day 11, there is one bacterium with mas 阅读全文