---学习ing---

摘要： What-The-Fatherland is a strange country! All phone numbers there are strings consisting of lowercase English letters. What is double strange that a p 阅读全文

摘要： The best programmers of Embezzland compete to develop a part of the project called "e-Government" — the system of automated statistic collecting and p 阅读全文

摘要： Limak is an old brown bear. He often goes bowling with his friends. Today he feels really good and tries to beat his own record! For rolling a ball on 阅读全文

摘要： Zxr960115 is owner of a large farm. He feeds m cute cats and employs p feeders. There's a straight road across the farm and n hills along the road, nu 阅读全文

摘要： 机器上有N个需要处理的任务，它们构成了一个序列。这些任务被标号为1到N，因此序列的排列为1,2,3...N。这N个任务被分成若干批，每批包含相邻的若干任务。从时刻0开始，这些任务被分批加工，第i个任务单独完成所需的时间是Ti。在每批任务开始前，机器需要启动时间S，而完成这批任务所需的时间是各个任务需 阅读全文

摘要： The sequence of integers a1,a2,…,aka1,a2,…,ak is called a good array if a1=k−1a1=k−1 and a1>0a1>0. For example, the sequences [3,−1,44,0],[1,−99][3,−1 阅读全文

摘要： Your friend is developing a computer game. He has already decided how the game world should look like — it should consist of nn locations connected by 阅读全文

摘要： I have an undirected graph consisting of n nodes, numbered 1 through n. Each node has at most two incident edges. For each pair of nodes, there is at 阅读全文

摘要： 题意：给出N，以及三个矩阵A，B，C，大小都为N*N。问是否满足A*B=C； N<1000； 思路：由于矩阵乘法的复杂度为O(N^3)；而部分验证又不能保证结果正确。我们巧妙地利用矩阵乘法的结合律：使其变为1*N和N*N的矩阵乘法，使复杂度降低为O(N^2)； 即随机构造矩阵X（1*N），Y（N*1 阅读全文

摘要： Allen and Bessie are playing a simple number game. They both know a function f:{0,1}n→Rf:{0,1}n→R, i. e. the function takes nn binary arguments and re 阅读全文