You have n problems. You have estimated the difficulty of the i-th one as integer c**i. Now you want to prepare a problemset for a contest, using some of the pr...
Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number ...
Problem Description Write a program to read in a list of integers and determine whether or not each number is prime. A number, n, is prime if its only divisor...
Problem Description One day, winnie received a box and a letter. In the letter, there are three integers and five operations(+,-,*,/,%). If one of the three i...
Problem Description We once did a lot of recursional problem . I think some of them is easy for you and some if hard for you. Now there is a very easy probl...