[Hdoj]_2081_ Phone cornet

Topic:

Problem description As we all know, mobile phone number is a 11-bit long digital string, at the same time, as a student, you can also apply to join the campus network, if you join the success, you will have another cornet. Suppose all the cornet is the 6+ mobile phone number of the latter 5, such as the number 13512345678 mobile phone, the corresponding cornet is 645678. Now, if I give you a 11-bit long mobile phone number, can you find the corresponding cornet? The first line of input data is an n (n <= 200), which indicates that there are n data, and the next N rows each act on a 11-bit mobile phone number The output should include N rows, each containing a corresponding cornet, and the output should match the input order. Sample input21351234567813787654321sample OUTPUT645678654321SOURCE2006/1/15 ACM Program Design Final Exam Recommendlcy

Code:

#include <stdio.h>intMainvoid) {unsignedintT, I;  for(SCANF ("%u", &t); T --T) { for(i =1; I <=7; ++i) {GetChar (); } printf ("6");  for(i =1; I <=5; ++i) {printf ("%c", GetChar ()); } printf ("\ n"); }    return 0;}

[Hdoj]_2081_ Phone cornet