摘要:
MatrixTime Limit:3000MSMemory Limit:65536KTotal Submissions:17976Accepted:6737DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i,... 阅读全文
摘要:
DescriptionYou haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each ... 阅读全文
摘要:
Time Limit:5000MSMemory Limit:65536KTotal Submissions:33389Accepted:15665Case Time Limit:2000MSDescriptionFor the daily milking, Farmer John'sNcows (1... 阅读全文
摘要:
食物链Time Limit:1000MSMemory Limit:10000KTotal Submissions:43846Accepted:12773Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。现有N个动物,以1-N编号。每个... 阅读全文
摘要:
Time Limit:2000MSMemory Limit:30000KTotal Submissions:18514Accepted:6426Case Time Limit:1000MSDescriptionFarmer John and Betsy are playing a game with... 阅读全文
摘要:
有n(n>=1&&n1&&node[i]>n) { node[0]=0; for(i=1;i>node[i]; inheap(node[i]); } __int64 ans=0; for(i=1;i... 阅读全文
摘要:
There are N integers (1A[j].InputThe first line of the input contains the number N. The second line contains N numbers A1...AN.OutputWrite amount of s... 阅读全文
摘要:
DescriptionLet {xi} be the infinite sequence of integers:1) x0= A;2) xi= (alpha * xi-1^2 + beta * xi-1+ gamma) mod M, for i >= 1.Your task is to find ... 阅读全文
摘要:
Little BishopsA bishop is a piece used in the game of chess which is played on a board of square grids. A bishop can only move diagonally from its cur... 阅读全文
摘要:
Description 1942Transmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A w... 阅读全文