A. Cinema Line
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The new "Die Hard" movie has just been released! There are n people at the cinema box office standing in a huge line. Each of them has a single 100, 50 or 25 ruble bill. A "Die Hard" ticket costs 25 rubles. Can the booking clerk sell a ticket to each person and give the change if he initially has no money and sells the tickets strictly in the order people follow in the line?

Input

The first line contains integer n (1≤n≤105) — the number of people in the line. The next line contains n integers, each of them equals 25, 50 or 100 — the values of the bills the people have. The numbers are given in the order from the beginning of the line (at the box office) to the end of the line.

Output

Print "YES" (without the quotes) if the booking clerk can sell a ticket to each person and give the change. Otherwise print "NO".

Sample test(s)
input

4
25 25 50 50

output

YES

input

2
25 100

output

NO

input

4
50 50 25 25

output

NO

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int ershiwu,wushi,n,money;

int main()
{
    ershiwu=0,wushi=0;
    scanf("%d",&n);
    bool flag=true;
    while(n--)
    {
        scanf("%d",&money);
        if(money==25)
            ershiwu++;
        else if(money==50)
        {
            if(ershiwu-1>=0)
            {
                ershiwu--;
                wushi++;
            }
            else
            {
                flag=false; break;
            }
        }
        else if(money==100)
        {
            if(wushi>=1&&ershiwu>=1)
            {
                wushi--; ershiwu--;
            }
            else if(ershiwu>=3)
            {
                ershiwu-=3;
            }
            else
            {
                flag=false;break;
            }
        }
    }
    if(flag)
        puts("YES");
    else
        puts("NO");

return 0;
}

* This source code was highlighted by YcdoiT. ( style: Codeblocks )

B. Color the Fence
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to win Tanya's heart he has.

Unfortunately, Igor could only get v liters of paint. He did the math and concluded that digit d requires ad liters of paint. Besides, Igor heard that Tanya doesn't like zeroes. That's why Igor won't use them in his number.

Help Igor find the maximum number he can write on the fence.

Input

The first line contains a positive integer v (0≤v≤106). The second line contains nine positive integers a1,a2,...,a9 (1≤ai≤105).

Output

Print the maximum number Igor can write on the fence. If he has too little paint for any digit (so, he cannot write anything), print -1.

Sample test(s)
input

5
5 4 3 2 1 2 3 4 5

output

55555

input

2
9 11 1 12 5 8 9 10 6

output

33

input

0
1 1 1 1 1 1 1 1 1

output

-1

先保证位数最大,然后使用余数尽量升级成大的数

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

struct nim
{
    int valu;
    int cost;
    int deta;
}a[10];

bool cmp(nim a,nim b)
{
    if(a.cost!=b.cost)
    {
        return a.cost<b.cost;
    }
    else return a.valu>b.valu;
}

bool cmp2(nim a,nim b)
{
    if(a.valu!=b.valu)
    {
        return a.valu>b.valu;
    }
    else
    {
        return a.cost<b.cost;
    }
}

int number[12];

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<9;i++)
    {
        a.valu=i+1;
        scanf("%d",&a.cost);
    }
    sort(a,a+9,cmp);

if(n<a[0].cost)
    {
        puts("-1");
        return 0;
    }

memset(number,0,sizeof(number));
    int number1=n/a[0].cost;
    int res=n%a[0].cost;
    number[a[0].valu]=number1;
    a[0].deta=0;
if(res!=0)
{
    for(int i=1;i<9;i++)
    {
        a.deta=a.cost-a[0].cost;
    }

sort(a+1,a+9,cmp2);

for(int i=1;i<9;i++)
    {
   //     printf("%d %d\n",a.valu,a.deta);
        if(a.valu>a[0].valu)
        while(res>=0)
        {
            if(res-a.deta<0) break;
            res-=a.deta;
            if(number[a[0].valu]-1>=0)
            {
                number[a[0].valu]--;
                number[a.valu]++;
            }
            else
            {
                break;
            }
        }
    }
}
    bool flag=false;
    for(int i=9;i>=1;i--)
    {
        while(number)
        {
            flag=true;
            printf("%d",i);
            number--;
        }
    }
    if(flag==false)
        printf("-1");
    putchar(10);
    return 0;
}

* This source code was highlighted by YcdoiT. ( style: Codeblocks )

Codeforces Round #202 (Div. 2) A,B的更多相关文章

  1. Codeforces Round #202 (Div. 2)

    第一题水题但是wa了一发,排队记录下收到的25,50,100,看能不能找零,要注意100可以找25*3 复杂度O(n) 第二题贪心,先找出最小的花费,然后就能得出最长的位数,然后循环对每个位上的数看能 ...

  2. Codeforces Round #202 (Div. 1) A. Mafia 贪心

    A. Mafia Time Limit: 20 Sec  Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/348/problem/A D ...

  3. Codeforces Round #202 (Div. 1) A. Mafia 推公式 + 二分答案

    http://codeforces.com/problemset/problem/348/A A. Mafia time limit per test 2 seconds memory limit p ...

  4. Codeforces Round #202 (Div. 1) D. Turtles DP

    D. Turtles Time Limit: 20 Sec  Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/547/problem/B ...

  5. Codeforces Round #202 (Div. 2) B,C,D,E

    贪心 B. Color the Fence time limit per test 2 seconds memory limit per test 256 megabytes input standa ...

  6. Codeforces Round #633 (Div. 2)

    Codeforces Round #633(Div.2) \(A.Filling\ Diamonds\) 答案就是构成的六边形数量+1 //#pragma GCC optimize("O3& ...

  7. Codeforces Round #366 (Div. 2) ABC

    Codeforces Round #366 (Div. 2) A I hate that I love that I hate it水题 #I hate that I love that I hate ...

  8. Codeforces Round #354 (Div. 2) ABCD

    Codeforces Round #354 (Div. 2) Problems     # Name     A Nicholas and Permutation standard input/out ...

  9. Codeforces Round #368 (Div. 2)

    直达–>Codeforces Round #368 (Div. 2) A Brain’s Photos 给你一个NxM的矩阵,一个字母代表一种颜色,如果有”C”,”M”,”Y”三种中任意一种就输 ...

随机推荐

  1. css优化

    >>.li设置了display:inline-block,会有空隙,可在父元素ul下设置font-size:0 >>.ie下不支持margin:0 auto; >> ...

  2. linux系统安装jdk

    OpenJdk8安装: sudo add-apt-repository ppa:openjdk-r/ppa sudo apt-get update sudo apt-get install openj ...

  3. LaTeX test

    \begin{equation} x^2+1=2 \end{equation} \begin{equation} x^2+y=3 \end{equation} $\dfrac{2\pi}{N}$

  4. Android Studio目录结构浅析

    让我们来简单了解下Android Studio中不同目录(文件)的位置和用途.首先看下一个App的最简单的目录结构 OK,我们这么看,第一,把这么多文件先分成这么三块1. 编译系统(Gradle)2. ...

  5. Opencv中将CvMat转为IplImage

    Opencv中将CvMat转为IplImage,并在内存获得起头指针,而不用cvSaveImage(),贴上代码 IplImage * imgg = NULL; imgg = cvCreateImag ...

  6. centos7 hostname

    在CentOS中,有三种定义的主机名:静态的(static),瞬态的(transient),和灵活的(pretty)."静态"主机名也称为内核主机名,是系统在启动时从/etc/ho ...

  7. 自然语言9_NLTK计算中文高频词

    以下代码仅限于python2 NLTK计算中文高频词 >>> sinica_fd=nltk.FreqDist(sinica_treebank.words()) >>> ...

  8. codeforces 712C C. Memory and De-Evolution(贪心)

    题目链接:http://codeforces.com/problemset/problem/712/C 题目大意: 给连个值x,y (3 ≤ y < x ≤ 100 000), x,y都为等边三 ...

  9. ajax传输 基础一

    一个简单页面的传输 index.php <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" &quo ...

  10. Swift控制器加载xib Swift Controller'view load from xib

    override func loadView() { NSBundle.mainBundle().loadNibNamed("ViewController", owner: sel ...