The Way To My Dream

// Input: STAMPS{TYPES 0}\nCUSTOMERS{NUMS 0}\n// Output: CUTSOMER_NUM (TYPE_NUM):{ TYPES | tie} | ---- none// max_type_num == 4,fewest TYPE_NUM best, the with highest single-value best// Method:

// Input: CASE_NUM\n CASE{A..L A..L w\n A..L A..L w\n A..L w\n}// w = up down even// Output: K is the counterfeit coin and it is light.// Method: 12 coins, 11 true#include #include #include #

// Input: n1 n2 n3 n4 n5 n6\n// max_n = 20000// Output: Collection #1:// Can't be divided.// Method: calc total sum, test get half#include #include #include #include // STRUCTS// VAR

// Input: imageNum * IMAGE{ width, PAIRS{ pixel, length} }// 1000 0-255 1-10^9// Output: max(pixel, pixelNear)// Method: get enough lines to calc current line#include #include #include