摘要:
Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the 阅读全文
摘要:
Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901) 阅读全文
摘要:
FJ's N (1 ≤ N ≤ 10,000) cows conveniently indexed 1..N are standing in a line. Each cow has a positive integer height (which is a bit of secret). You 阅读全文
摘要:
题目描述 一种新型的激光炸弹,可以摧毁一个边长为R的正方形内的所有的目标。现在地图上有n(n≤10000)个目标,用整数xi,yi(0≤xi,yi≤5000)表示目标在地图上的位置,每个目标都有一个价值0<vi<100。激光炸弹的投放是通过卫星定位的,但其有一个缺点,就是其爆破范围,即那个边长为R的 阅读全文
摘要:
题意:就是让你求出4个塔的汉诺塔的最小移动步数,(1 <= n <= 12) 那么我们知道3个塔的汉诺塔问题的解为:d[n] = 2*d[n-1] + 1 ,可以解释为把n-1个圆盘移动到一个临时柱子上,然后将1个最大圆盘移动到目标的主子,最后再将n-1个圆盘移动到目标柱子。 为什么是n-1和1的组 阅读全文
摘要:
1、如果双显卡无法安装系统可以进如BIOS屏蔽显卡后进入安装 2、如果安装kde版本后容易冻屏、死机,可以尝试安装闭源驱动 3、如果出现resolving time out 10000ms 这样的问题,可以尝试进入 /etc/resolv.conf 修改dns地址 4、如若发现屏幕菜单界面过大问题, 阅读全文
摘要:
D. Petya and Array time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Petya has an array aa 阅读全文
摘要:
odeforces 1051 D. Bicolorings (DP) D. Bicolorings time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa 阅读全文
摘要:
In Programming Land, there are several pathways called Philosopher’s Walks for philosophers to have a rest. A Philosopher’s Walk is a pathway in a squ 阅读全文
摘要:
BaoBao and DreamGrid are playing a game using a strange button. This button is attached to an LED light (the light is initially off), a counter and a 阅读全文