The Tower of Babylon

Perhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this tale have been forgotten. So now, in line with the educational nature of this contest, we will tell you the whole story:

The babylonians had n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions  tex2html_wrap_inline32 . A block could be reoriented so that any two of its three dimensions determined the dimensions of the base and the other dimension was the height. They wanted to construct the tallest tower possible by stacking blocks. The problem was that, in building a tower, one block could only be placed on top of another block as long as the two base dimensions of the upper block were both strictly smaller than the corresponding base dimensions of the lower block. This meant, for example, that blocks oriented to have equal-sized bases couldn't be stacked.

Your job is to write a program that determines the height of the tallest tower the babylonians can build with a given set of blocks.

Input and Output

The input file will contain one or more test cases. The first line of each test case contains an integer n, representing the number of different blocks in the following data set. The maximum value for n is 30. Each of the next n lines contains three integers representing the values  tex2html_wrap_inline40 ,  tex2html_wrap_inline42 and  tex2html_wrap_inline44 .

Input is terminated by a value of zero (0) for n.

For each test case, print one line containing the case number (they are numbered sequentially starting from 1) and the height of the tallest possible tower in the format "Case case: maximum height = height"

Sample Input

1
10 20 30
2
6 8 10
5 5 5
7
1 1 1
2 2 2
3 3 3
4 4 4
5 5 5
6 6 6
7 7 7
5
31 41 59
26 53 58
97 93 23
84 62 64
33 83 27
0
Sample Output

Case 1: maximum height = 40
Case 2: maximum height = 21
Case 3: maximum height = 28
Case 4: maximum height = 342

Yes
Yes
Yes
No

Yes
No
Yes
No

You have devised a new encryption technique which encodes a message by inserting between its characters
randomly generated strings in a clever way. Because of pending patent issues we will not discuss in
detail how the strings are generated and inserted into the original message. To validate your method,
however, it is necessary to write a program that checks if the message is really encoded in the final
string.
Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can remove
characters from t such that the concatenation of the remaining characters is s.
Input
The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII
characters separated by whitespace. Input is terminated by EOF.
Output
For each test case output, if s is a subsequence of t.
Sample Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Sample Output
Yes
No
Yes
No

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
/**
 * a->97 z->122 A->65 A->90
 *
 * @author qwery.azc
 */
public class Main {
 
    public String pertenecer(String cadenita, String cadenota) {
        int piv = 0;
        int cajaIndex=0;
        String res="No";
        for (int i = 0; i < cadenita.length(); i++) {
            char caracter=cadenita.charAt(i);
            for (int j = 0; j < cadenota.length() ; j++) {
                if (caracter == cadenota.charAt(j)) {
                    piv++;
                    i++;
 
                }
 
            }
        }
        if(piv==cadenita.length()){
            res="Yes";
        }
        System.out.println(res);
        return res;
    }
 
    public static void main(String argumentos[]) throws IOException {
        Main m = new Main();
         StringTokenizer stk;
         String line;
         String cad1,cad2;
        BufferedReader  scanner = new BufferedReader(new InputStreamReader(System.in));
        while ((line=scanner.readLine())!=null) {
            stk=new StringTokenizer(line," ");
           cad1=stk.nextToken();
           cad2=stk.nextToken();
           m.pertenecer(cad1, cad2);
        }
 
        scanner.close();
    }
    }