z-domine
The year is 2055. Little Z is now full grown man, and works in a successful programmers company called "Rainyday". One day when he came home, he found his little son Z with dominos. Z needed some time to remind himself for what those boards serve, but in the end he remembered and decided to have a liitle play with them (in them memory of old good times). Soon he realised that he had problem with their combining.Help little Z to combine the largest array possible of the dominos,considering the well-known rules.
InputInput is read from standard input.In the first line is number N (number of dominos, N<=100). In the next N lines are read two numbers( 0<= X,Y <= 6) which represent the numbers of a specific domino.
OutputTo the standard output you should output the largest possible array that can be combined with the given dominos.
Input:
Output:
3
1 3
3 2
2 6Output:
3Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.