Codeforence 352A

最新推荐文章于 2019-02-05 14:42:03 发布

青苹之末

最新推荐文章于 2019-02-05 14:42:03 发布

阅读量777

点赞数

分类专栏：水题文章标签： algorithm cstring 遍历 each printf

本文链接：https://blog.csdn.net/were__wolf/article/details/22733697

版权

水题专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Jeff's got n cards, each card contains either digit 0, or digit 5. Jeff can choose several cards and put them in a line so that he gets some number. What is the largest possible number divisible by 90 Jeff can make from the cards he's got?

Jeff must make the number without leading zero. At that, we assume that number 0 doesn't contain any leading zeroes. Jeff doesn't have to use all the cards.

Input

The first line contains integer n (1 ≤ n ≤ 103). The next line contains n integers a1, a2, ..., an (ai = 0 or ai = 5). Number ai represents the digit that is written on the i-th card.

Output

In a single line print the answer to the problem — the maximum number, divisible by 90. If you can't make any divisible by 90 number from the cards, print -1.

   Sample test(s) 
 
     input 
   
4
5 0 5 0

     output 
   
0

     input 
   
11
5 5 5 5 5 5 5 5 0 5 5

     output 
   
5555555550

Note

In the first test you can make only one number that is a multiple of 90 — 0.

In the second test you can make number 5555555550, it is a multiple of 90.

这个题目是说在里面选择5,0组成数，使其最大才可以，为了能够可以让它被90除尽，必须包含0，然后五的数目相加

只要可以被9的整除就可以，从5最多的数目开始递减，然后遍历是否可以整除，若可以，则证明是行的。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int i,j,k,n;
    int num[1100];
    while(scanf("%d",&n)!=EOF)
    {

        for(i=0;i<n;i++)
        {
            scanf("%d",&num[i]);
        }
        int a,b;//a 5 b 0
        a=0;
        b=0;
        for(i=0;i<n;i++)
        {
            if(num[i]==5)
            a++;
            else
            b++;
        }
        if(b==0)
        {
            printf("-1\n");
            continue;

        }
        int c;
        int flag=0;
        for(i=a;i>=1;i--)
        {
            int sum=i*5;
           // printf("sssss  %d\n",sum);
            if(sum%9==0)
            {
               // printf("%d   fdfsfddfd\n",sum);
                c=i;
                //printf("fjdskljflsd");
                flag=1;
                break;

            }
        }
        if(flag==0)
        {
            c=0;
        }
        //printf("hhhhh  %d\n",c);
        for(i=1;i<=c;i++)
        {


            printf("5");

        }
        if(c==0)
        {
            printf("0\n");
            continue;
        }
        for(i=1;i<=b;i++)
        {
            printf("0");
        }
        printf("\n");
    }



    return 0;
}