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 10^​5 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 (≤10^​5​​ , the total number of coins) and M (≤10^​3​​ , 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 V​1 and V​2(separated by a space) such that V​1+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

题意:
在一个长度为n序列a[]中寻找出两个数相加的结果为指定的m,输出这两个数。如果不存在这样的两个数,输出No Solution。

思路:
1.哈希,用hashtable[i]记录数字i出现的个数,每读入一个数字a,hashtable[a++],如果i存在于数列(hashtable[i]>0)且m-i存在于数列(hashtable[m-i]>0),则找到了一对数i和m-i,但是要注意i == m - i时,必须保证数字i的个数大于等于2
2.twopoints,先将序列从下到达排序,令i = 0, j = n - 1;i++和j–,直到i>=j或满足条件时结束,结束时根据i>=j是否成立来判断解是否存在。

code1

#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 1005;
int hashtable[maxn];

int main()
{
    int n, m, a;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &a);
        hashtable[a]++;
    }
    for(int i = 1; i < m; i++)  //从1~m中枚举
    {
        if(hashtable[i] && hashtable[m-i])  //i和m-i出现的次数都大于0
        {
            if(i == m - i && hashtable[m-i] <= 1)   //i==m-i  此时m-i至少需要出现两次 如7=14-7,则7至少出现两次
                continue;
            printf("%d %d\n", i, m - i);
            return 0;
        }

    }
    printf("No Solution\n");
    return 0;
}

code2

#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int a[maxn];

//n为元素个数,m为所求的和
void twoPoints(int n, int m)
{
    int i = 0, j = n - 1;
    while(i < j)
    {
        if(a[i] + a[j] == m)
            break;
        else if(a[i] + a[j] < m)
            i++;
        else
            j--;
    }
    if(i < j)
        printf("%d %d\n", a[i], a[j]);	//如果上面的循环结束了还是i < j,说明在上面的循环中找到了答案
    else
        printf("No Solution\n");
}

int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    sort(a, a + n);
    twoPoints(n, m);
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值