摘要：
K Kabaleo Lite Tired of boring WFH (work from home), Apollo decided to open a fast food restaurant, called Kabaleo Lite\textbf{Kabaleo Lite}Kabaleo Li 阅读全文
摘要：
Problem A. Game of Peace Program: numbers.(cpp|java)Input: numbers.inBalloon Color: PinkBob has learned a new magic trick that needs a very special pr 阅读全文
摘要：
Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones. Your task is counting the segme 阅读全文
摘要：
这题是真GOU了,改bug改到自闭了。 ‘ 同样都是预处理，人家加了个素数筛就能过，我没加就疯狂W，W到自闭，其实知道题简单的一批，只需要预处理一下，从n分解到1需要多少次，然后存到数组里就行了，真的是W吐了 #include <bits/stdc++.h> typedef long long ll 阅读全文
摘要：
In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic 阅读全文
摘要：
Given a positive integer y and a prime p, you are asked to find an integer x such that (x \times y)\ mod\ p= 1(x×y) mod p=1. If such x exists, output 阅读全文
摘要：
LIS定义： LIS（Longest Increasing Subsequence）最长上升子序列 一个数的序列bi，当b1 < b2 < … < bS的时候，我们称这个序列是上升的。 对于给定的一个序列(a1, a2, …, aN)，我们可以得到一些上升的子序列(ai1, ai2, …, aiK) 阅读全文
摘要：
A. Road To Zero time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given two integer 阅读全文
摘要：
You have integer nn. Calculate how many ways are there to fully cover belt-like area of 4n−24n−2 triangles with diamond shapes. Diamond shape consists 阅读全文
摘要：
A. Dreamoon and Ranking Collection time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Dreamo 阅读全文