zoukankan      html  css  js  c++  java
  • PAT Advanced 1048 Find Coins (25 分)

    Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she could only use exactly two coins to pay the exact amount. Since she has as many as 1 coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find two coins to pay for it.

    Input Specification:

    Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (≤, the total number of coins) and M (≤, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers no more than 500. All the numbers in a line are separated by a space.

    Output Specification:

    For each test case, print in one line the two face values V1​​ and V2​​ (separated by a space) such that V1​​+V2​​=M and V1​​V2​​. If such a solution is not unique, output the one with the smallest V1​​. If there is no solution, output No Solution instead.

    Sample Input 1:

    8 15
    1 2 8 7 2 4 11 15
    

    Sample Output 1:

    4 11
    

    Sample Input 2:

    7 14
    1 8 7 2 4 11 15
    

    Sample Output 2:

    No Solution
    #include <iostream>
    #include <vector>
    #define E 1000
    using namespace std;
    int main(){
        int N,M,tmp;
        cin>>N>>M;
        int val[E]={0};
        while(N--){
            scanf("%d",&tmp);
            val[tmp]++;
        }
        bool flag=true;
        for(int i=0;i<E;i++){
            if(val[i]!=0&&val[M-i]!=0&&(M-i)>=0) {
                if(i!=(M-i)||(i==(M-i)&&val[i]>1)){
                    cout<<i<<" "<<(M-i);
                    flag=false;
                    break;
                }
            }
        }
        if(flag) cout<<"No Solution";
        system("pause");
        return 0;
    }
  • 相关阅读:
    ASP.NET中读取Excel内容,并显示在界面上
    SQL SERVER 的 CLR表值函数
    nowrap要与回车换行符结合才有意义
    何时使用 FILESTREAM?
    case 用在 UPDATE
    查看分区在哪个文件组
    C#里面的随机对象Random
    CLR程序里引用System.Web.dll
    不用写成 if @i=1 OR @i=2 OR ... 这么蠢
    SQL SERVER定期转移海量数据方案
  • 原文地址:https://www.cnblogs.com/littlepage/p/11355709.html
Copyright © 2011-2022 走看看