PAT 1037 Find Coins (25)(dp子序列)

原创 2016年08月30日 12:59:13

题目

1048. Find Coins (25)

时间限制
50 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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.

Input Specification:

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.

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

解题思路

  • 1.先排序,然后从计算a[i]+a[j],i,j分别以数列的首尾为初始值,然后比较他们和与m的大小,然后再相应的i++或者j--

代码

#include<cstdio>
#include<algorithm>
using namespace std;
int num[100000+5];
int main(int argc, char *argv[])
{
    int n,m;
    scanf("%d %d",&n,&m);
    for (int i = 0; i < n; ++i) {
        scanf("%d",&num[i]);
    }
    sort(num,num+n);
    for (int i = 0,j = n - 1; i < j; ) {
        if (num[i] + num[j] > m) {
            j--;
        }else if (num[i] + num[j] < m) {
            i++;
        }else {
            printf("%d %d\n",num[i],num[j]);
            return 0;
        }
    }
    printf("No Solution\n");
    return 0;
}

下面这段段错误错在哪?始终没找到==

#include<cstdio>
#include<algorithm>
using namespace std;
int num[100000+5];
int main(int argc, char *argv[])
{
    int n,m;
    scanf("%d %d",&n,&m);
    for (int i = 0; i < n; ++i) {
        scanf("%d",&num[i]);
    }
    if (n<=1) {
        printf("No Solution\n");
    }else {
        sort(num,num+n);
        bool isFind = false;
        for (int i = 0; i < n - 1,num[i]<m; i++) {

            for (int j = i+1; j < n,num[j]<m; j++) {
                if (num[i]+num[j]==m) {
                    printf("%d %d\n",num[i],num[j]);
                    isFind = true;
                    break;
                }
            }
            if (isFind) {
                break;
            }
        }
        if (!isFind) {
            printf("No Solution\n");
        }
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

pat1048Find Coins (25)

题意分析: (1)给出若干个面值不同的硬币,可以重复,再给出任意一个金额,问是否能在这些硬币当中找出两个面值之和等于所给的金额,若有多种组合,给出具有面值最小的那个组合。 (2)这题是一种超级经典...

浙江大学PAT_甲级_1048. Find Coins (25)

题目链接:点击打开链接 Eva loves to collect coins from all over the universe, including some other plane...

pat 1048. Find Coins (25)

1048. Find Coins (25) 时间限制 50 ms 内存限制 65536 kB 代码长度限制 16000 B ...
  • wyh7280
  • wyh7280
  • 2015年07月20日 22:12
  • 281

【PAT】1048. Find Coins (25)

题目链接:http://pat.zju.edu.cn/contests/pat-a-practise/1048 题目描述: Eva loves to collect coins from al...

PAT A1048. Find Coins (25)

Eva loves to collect coins from all over the universe, including some other planets like Mars. One d...
  • jolivan
  • jolivan
  • 2017年02月12日 14:00
  • 67

PAT-A 1048. Find Coins (25)

HashTable配对 Or 二分查找 or Two pointers

PAT 1048. Find Coins (25)

1048. Find Coins (25) 时间限制 50 ms 内存限制 65536 kB 代码长度限制 16000 B ...

PAT (Advanced Level) Practise 1048 Find Coins (25)

1048. Find Coins (25) 时间限制 50 ms 内存限制 65536 kB 代码长度限制 16000 B ...

PAT 1068. Find More Coins (用dp -- 若用dfs测试点6会超时)

先用dfs, 测试点6超时 看了http://blog.csdn.net/sup_heaven/article/details/20133423的题解。写下自己的解法和感受: 和那篇博文相...

PAT 1033 Shopping in Mars (25)(子序列)

题目1044. Shopping in Mars (25)时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Sho...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:PAT 1037 Find Coins (25)(dp子序列)
举报原因:
原因补充:

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