PAT 1037Find Coins (25)(dp子序列)
来源:互联网 发布:linux ps命令中括号 编辑:程序博客网 时间:2024/06/06 04:57
题目
1048. Find Coins (25)时间限制50 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueEva 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 151 2 8 7 2 4 11 15Sample Output 1:4 11Sample Input 2:7 141 8 7 2 4 11 15Sample 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;}
0 0
- PAT 1037Find Coins (25)(dp子序列)
- 动态规划--PAT.A1068.Find More Coins【输出DP序列】
- PAT-Find Coins (25)
- PAT(甲级)1048. Find Coins (25)
- 1048. Find Coins (25)-PAT
- 【PAT】1048. Find Coins (25)
- PAT 1048. Find Coins (25)
- pat 1048. Find Coins (25)
- PAT 1048. Find Coins (25)
- PAT-A1048. Find Coins (25)
- PAT 1048. Find Coins (25)
- PAT A1048. Find Coins (25)
- pat 1048. Find Coins (25)
- PAT (Advanced) 1048. Find Coins (25)
- PAT甲 1048. Find Coins (25)
- PAT(A) - 1048. Find Coins (25)
- 【PAT甲级】1048. Find Coins (25)
- 1048. Find Coins (25) PAT 甲级
- UNP-基本TCP编程-3 (tcpdump)
- Io 异常: Got minus one from a read call
- sp、dp、dip、pt、px等单位的区别?【重点】
- cxf无法处理类型解决方法
- 关系模型
- PAT 1037Find Coins (25)(dp子序列)
- LeetCode 209 Minimum Size Subarray Sum
- 给自己一个新起点
- scalaTest的使用
- Hibernate 框架学习整理(一)
- 如何在Mac OS X上安装 Ruby运行环境
- web service 权限控制以及cxf拦截器
- mysql 表的操作
- asprin