HOJ11525 Matchsticks

Matchsticks

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB

Total submit users: 174, Accepted users: 142

Problem 11525 : No special judgement

Problem description

Matchsticks are ideal tools to represent numbers. A common way to represent the ten decimal digits with matchsticks is the following:


  This is identical to how numbers are displayed on an ordinary alarm clock. With a given number of matchsticks you can generate a wide range of numbers. We are wondering what the smallest and largest numbers are that can be created by using all your matchsticks.

Input

On the first line one positive number: the number of testcases, at most 100. After that per testcase:

• One line with an integer n (2 ≤ n ≤ 100): the number of matchsticks you have

Output

Per testcase:

• One line with the smallest and largest numbers you can create, separated by a single space. Both numbers should be positive and contain no leading zeroes.

Sample Input

4
3
6
7
15

Sample Output

7 7
6 111
8 711
108 7111111

Problem Source

The 2008 ACM Northwestern Europe Programming Contest

水题，深刻的回忆，不解释。

code：

#include<stdio.h>          
int num[7]={10,18,20,20,28,68,88};
__int64 minnumber[100]={0,0,1,7,4,2,6,8,10,18,22,20,28,68,88,108,188,200};
int main() 
{ 
    int n;
    int k;
    int i;
    int temp;
    int t;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&k);
        if(k<=17)
            printf("%I64d",minnumber[k]);
        else
        {
            for(i=18;i<=k;i++)
            {
                minnumber[i]=minnumber[i-7]*10+8;
            }
            printf("%I64d",minnumber[k]);
        }
        if(k%2)
        {
            printf(" 7");
            for(i=0;i<(k-3)/2;i++)
                printf("1");
        }
        else
        {
            printf(" 1");
            for(i=0;i<(k-2)/2;i++)
                printf("1");
        }
        printf("\n");
    }
    return 0; 
} 

test data:
1 1 
7 7 
4 11 
2 71 
6 111 
8 711 
10 1111 
18 7111 
22 11111 
20 71111 
28 111111 
68 711111 
88 1111111 
108 7111111 
188 11111111 
228 71111111 
208 111111111 
288 711111111 
688 1111111111 
888 7111111111 
1088 11111111111 
1888 71111111111 
2008 111111111111 
2088 711111111111