【PAT】Find Coins (25)

原创 2018年04月17日 15:22:57

题目描述

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 105 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.

翻译:Eva喜欢收集来自宇宙各地的硬币,包括一些其他的星球比如火星。一天她在一个可以支付所有类型的硬币的购物广场逛街。但是,每次支付都有一个很奇怪的要求,她只能用两个硬币支付且价值要一模一样。由于她带了10^5个硬币,她十分需要你的帮助。你需要告诉她,对于给出的价格,她是否可以找到两个硬币去支付。

INPUT FORMAT

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (<=105, the total number of coins) and M(<=103, 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.

翻译:每个输入文件包含一组测试数据。对于每组输入数据,第一行包括2个正整数N(<=10^5)代表硬币总数,和M(<=10^3),代表Eva需要支付的价格。第二行包括N个硬币的表面价值,均为不超过500的正整数。一行内所有数字之间都用空格隔开。

OUTPUT FORMAT

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.

翻译:对于每组输入数据,输出一行两个价值V1和V2(用空格隔开),V1 + V2 = M and V1 <= V2。如果答案不唯一,输出最小的V1。如果没有结果,输出”No Solution”。


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


解题思路

由于这道题M<=1000,N<=100000,所以选择用哈希记录数字M出现次数,然后从1—M/2枚举,判断i和M-i是否出现过。注意如果i==M-i,则i出现次数要大于等于2次。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#define INF 99999999
using namespace std;
int N,M,m[1010];
int main(){
    scanf("%d%d",&N,&M);
    int a;
    for(int i=0;i<N;i++){
        scanf("%d",&a);
        m[a]++;
    }
    int flag=0;
    for(int i=1;i<=M/2;i++){
        int temp=M-i;
        if(temp==i&&m[temp]>=2||(temp!=i&&m[temp]&&m[i])){
            printf("%d %d\n",i,temp);
            flag=1;
            break;      
        }   
    }
    if(!flag)printf("No Solution\n");
    return 0;
}


华为路由交换精讲系列25:ISIS技术简介 肖哥视频课程

华为路由器、交换机配置 单个技术详细介绍。本课程是一个系列,每个系列讲解一个类型的技术。对于只需要某几个技术的朋友,可以考虑。整个系列课程包含知识点:路由器交换机升级操作系统、备份恢复配置、系统口令恢复、系统升级失败拯救、 IP子网划分、arp、vlan、trunk、telnet、dhcp、acl、stp、Rip、ospf、bgp、vpn、防火墙等等。
  • 2017年09月17日 21:23

【PAT】1048. Find Coins (25)

题目链接:http://pat.zju.edu.cn/contests/pat-a-practise/1048 题目描述: Eva loves to collect coins from al...
  • realxuejin
  • realxuejin
  • 2013-08-26 19:44:58
  • 1448

PAT-Find Coins (25)

题意: 解答: 经典2-sum,问题,从一串数里找到两个和为m。做法: 把数组排序,然后用两头扫的办法。 i = 0, j = n - 1 如果a[i] + a[j] 如果a[i] + a...
  • zhouyufei0001
  • zhouyufei0001
  • 2016-03-10 10:15:15
  • 154

【PAT 1068】 Find More Coins 背包问题

1068. Find More Coins (30) 时间限制 150 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard...
  • tiantangrenjian
  • tiantangrenjian
  • 2013-12-15 15:13:25
  • 4188

PAT 1076. Forwards on Weibo

题目:http://pat.zju.edu.cn/contests/pat-a-practise/1076 题解: 共有n个微博号,第i行表明有k个人关注i,问x再转发m层的范围内可以转发多少人的微博...
  • ACM_Ted
  • ACM_Ted
  • 2014-03-09 02:14:21
  • 1785

【C++】PAT(advanced level)1048. Find Coins (25)

1048. Find Coins (25) 时间限制 50 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN...
  • artemisrj
  • artemisrj
  • 2014-03-09 21:46:18
  • 574

【PAT Advanced Level】1068. Find More Coins (30)

最近在学习动态规划,PAT中的这一题就是一个典型的dp问题。 这一题和01背包问题很类似,M相当于背包问题中的背包容量,硬币面值相当于每件物品的重量,背包问题中要求物品价值最大,这里要求物品总重(面值...
  • gzxcyy
  • gzxcyy
  • 2013-11-01 19:53:17
  • 1248

1068. Find More Coins (30)-PAT甲级真题(01背包)

1068. Find More Coins (30) Eva loves to collect coins from all over the universe, including som...
  • liuchuo
  • liuchuo
  • 2016-08-22 17:37:42
  • 271

PAT_A 1048. Find Coins (25)

1048. Find Coins (25)
  • scylhy
  • scylhy
  • 2017-09-01 23:40:48
  • 155

PAT-A1048. Find Coins (25)

two pointer做的 #include #include #include #include using namespace std; #define MAX 100000+10 i...
  • WeiJJ6608
  • WeiJJ6608
  • 2016-03-05 23:05:34
  • 174
收藏助手
不良信息举报
您举报文章:【PAT】Find Coins (25)
举报原因:
原因补充:

(最多只允许输入30个字)