PAT_1048. Find Coins
来源:互联网 发布:java spring压缩 编辑:程序博客网 时间:2024/06/06 13:58
//// main.cpp// PAT_1048. Find Coins//// Created by wjq on 17/5/14.// Copyright © 2017年 wjq. All rights reserved.//#include <iostream>using namespace std;int num,sum,temp,i;int coin[100005];int main(int argc, const char * argv[]){ cin>>num>>sum; for(i=0;i<num;i++) { cin>>temp; coin[temp]++; } for(i=1;i<=sum;i++) { if(coin[i]!=0&&coin[sum-i]!=0&&i!=sum-i) { cout<<i<<" "<<sum-i<<endl; break; } else if(coin[i]!=0&&coin[sum-i]!=0&&i==sum-i&&coin[i]>=2) { cout<<i<<" "<<sum-i<<endl; break; } } if(i==sum+1) cout<<"No Solution"<<endl; return 0;}
简单题,思路有就能很快解决.
0 0
- PAT_1048: Find Coins
- PAT_1048. Find Coins
- 1048 Find Coins
- 1048. Find Coins (25)
- 1048. Find Coins
- 1048. Find Coins (25)
- 1068. Find More Coins
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048. Find Coins
- 1048. Find Coins (25)
- 1048. Find Coins
- 1068. Find More Coins
- PAT 1048.Find Coins
- 1048. Find Coins (25)
- 1048. Find Coins (25)
- 1048.Find Coins
- 1068.Find More Coins
- [leetcode]Rotate List
- 一张图随时查阅 iOS 各种设备屏幕显示转换
- 自定义View之头部可伸缩的ListView
- 【解决】virtualbox中安装centos7无法联网
- Problem E: 类模板Sample
- PAT_1048. Find Coins
- Problem F: 多少个最大值?
- Lottie初级教程:打造 iOS App 完美动画
- Problem G: 动物要吃饭
- C++ Boost signal2信号/插槽知识点
- 极客头条访问量的统计
- Problem H: 稀疏矩阵的表示和运算
- Lua模拟C#的类继承
- CSDN第一天