Revision History Date Issue Description Author 15/May/2015 1.0 Finish most of the designed function. Only the Windows application is finished. litianpeng.yanwenxiongandyuxuehui 21/May/2015 V1.1 Finish all of the function on windows store and windowsp…

1881. Long problem statement Time limit: 0.5 secondMemory limit: 64 MB While Fedya was writing the statement of the problem GOV Chronicles, he realized that there might be not enough paper to print the statements. He also discovered that his text edi…

题目链接:https://vjudge.net/contest/239445#problem/E     E - Problem Statement You are given nn strings str1,str2,…,strnstr1,str2,…,strn , each consisting of ( and ). The objective is to determine whether it is possible to permute the nn strings so that…

https://code.google.com/codejam/contest/544101/dashboard#s=p0     Problem In the exciting game of Join-K, red and blue pieces are dropped into an N-by-N table. The table stands up vertically so that pieces drop down to the bottom-most empty slots in…

https://code.google.com/codejam/contest/635101/dashboard#s=p0   Problem On Unix computers, data is stored in directories. There is one root directory, and this might have several directories contained inside of it, each with different names. These di…

A. Warrior and Archer time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output In the official contest this problem has a different statement, for which jury's solution was working incorrectly, and…

B. Clique Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The clique problem is one of the most well-known NP-complete problems. Under some simplification it can be formulated as f…

Problem A permutation of size N is a sequence of N numbers, each between 0 and N-1, where each number appears exactly once. They may appear in any order. There are many (N factorial, to be precise, but it doesn't matter in this problem) permutations…

Introduction Cookie Clicker is a Javascript game by Orteil, where players click on a picture of a giant cookie. Clicking on the giant cookie gives them cookies. They can spend those cookies to buy buildings. Those buildings help them get even more co…

Problem statement Given n items with size Ai and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack? Solution 0/1 knapsack problem is a classical dynamic programming model. There is a knapsack with the capaci…