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;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

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

题目1048. Find Coins (25)时间限制 50 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Eva loves ...

PAT 1048. Find Coins (25)

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

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

PAT A1048. Find Coins (25)

Eva loves to collect coins from all over the universe, including some other planets like Mars. One d...

pat 1048. Find Coins (25)

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

【PAT】1048. Find Coins (25)

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

PAT 1048. Find Coins (25)

我用二分法做的~复杂度是nlogn,下面附上同学做的简洁版本。代码如下#include //二分法 #include using namespace std; #define MAXN 100008...

PAT-A 1048. Find Coins (25)

HashTable配对 Or 二分查找 or Two pointers

1048. Find Coins (25)

有N个钱币,要付账15, 在N个钱币里面看看有没有两个正好和为15的。如果有多个,那么找V1比较小的那个,要自己先排个序。 (PS:一开始理解错了以为在原来的队伍里面找相邻的)

1048. Find Coins (25)

题目如下: Eva loves to collect coins from all over the universe, including some other planets lik...

1048. Find Coins (25)

1048. Find Coins (25) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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