Never__give__up的博客

There are n games in a football tournament. Three teams are participating in it. Currently k games had already been played.You are an avid football fan, but recently you missed the whole k games. Fort...

链接：https://www.nowcoder.com/acm/contest/90/L来源：牛客网时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 32768K，其他语言65536K64bit IO Format: %lld题目描述    在一个风雨交加的夜晚，来自异世界的不愿透露姓名的TMK同学获得了两种超强药水A、B。根据说明书，T

Imp is in a magic forest, where xorangles grow (wut?)A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceedingn, and the xor-sum of the leng

A closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are called the vertices of the polygon. When one starts at any vertex of a clo

题目链接：点击打开链接题意：a个球装在一个盒子里，再拿一个新的盒子，在所有旧盒子中取一个球放入新的盒子中，然后将这些盒子里的球数量从小到大排序，若连着两次盒子个数以及每个盒子中的球的个数相同，那么这个数就是我们要的。（举个栗子：a=2-->1,1-->2(出现了相同的数但不是连着的，那么2不是我们要的数)， 再如a=3-->1,2-->1,2 , 那么3就是我们要的数，再如a=6-->1,5-

Tina Town is a friendly place. People there care about each other. Tina has a ball called zball. Zball is magic. It grows larger every day. On the first day, it becomes1 time as large as its

ConvexTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1482    Accepted Submission(s): 990Problem DescriptionWe have a special co

B. 数螃蟹 Time limit per test: 2.0 seconds Memory limit: 512 megabytes kblack 在做数螃蟹的实验。按照「螃蟹爷爷的秘诀」一书上介绍的：由于东方神秘力量的影响，螃蟹的个数是一个完美的等差数列，例如：−2,−1,0,1,2,…。是的，kblac...