_Wilbert

摘要： Wool Accepts: 109 Submissions: 770 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述黎明时，Venus为Psyche定下了第二个任务。她... 阅读全文

摘要： Arrange Accepts: 221 Submissions: 1401 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述Cupid一不小心将爱情之箭射到了自己，他爱... 阅读全文

摘要： Oracle Accepts: 599 Submissions: 2576 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述曾经有一位国王，统治着一片未名之地。他膝下有三... 阅读全文

摘要： Barney lives in country USC (United States of Charzeh). USC has n cities numbered from 1 through n and n - 1 roads between them. Cities and roads of U... 阅读全文

摘要： Barney is standing in a bar and starring at a pretty girl. He wants to shoot her with his heart arrow but he needs to know the distance between him an... 阅读全文

摘要： Barney lives in NYC. NYC has infinite number of intersections numbered with positive integers starting from 1. There exists a bidirectional road betwe... 阅读全文

摘要： Description给定自然数N和十进制集合X={x1,x2,...,xm}(0 q = new LinkedList(); int[] vis = new int[n]; q.clear(); for(int i = 0; i = 0) break; ... 阅读全文

摘要： Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci. The price of the chocolate is k, so Pari will t... 阅读全文

摘要： Today Pari and Arya are playing a game called Remainders.Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the ... 阅读全文

摘要： Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.Suppose the graph G ... 阅读全文