CodeForces 524 C.The Art of Dealing with ATM(枚举)
2017-07-20 10:21
465 查看
Description
一家银行的ATM机中有n种纸币,每种纸币面额为a[i],数量无限,但每次取款只能取最多k张最多两种面额的纸币,有q次查询,每次查询是否可以取x元,如果可以那最少取多少张纸币可以取到x元
Input
第一行两个整数n,k分别表示纸币种类数和每次取款数量上限,之后n个整数a[i]表示这n种纸币的面额,然后输入一整数q表示查询数,每次查询输入一整数x(1<=n<=5000,1<=k<=20,1<=a[i]<=1e7,1<=q<=20,1<=x<=2e8)
Output
如果不能取到x则输出-1,否则输出要取的最少纸币数量
Sample Input
6 20
10 50 100 500 1000 5000
8
4200
100000
95000
96000
99000
10100
2015
9950
Sample Output
6
20
19
20
-1
3
-1
-1
Solution
把纸币的面额放到map里,枚举第一种纸币的种类和数量,如果恰好是x则更新答案,否则枚举第二种纸币的数量,那么第二种纸币的面额就确定了,从map找这种面额是否存在如果存在则更新答案
Code
一家银行的ATM机中有n种纸币,每种纸币面额为a[i],数量无限,但每次取款只能取最多k张最多两种面额的纸币,有q次查询,每次查询是否可以取x元,如果可以那最少取多少张纸币可以取到x元
Input
第一行两个整数n,k分别表示纸币种类数和每次取款数量上限,之后n个整数a[i]表示这n种纸币的面额,然后输入一整数q表示查询数,每次查询输入一整数x(1<=n<=5000,1<=k<=20,1<=a[i]<=1e7,1<=q<=20,1<=x<=2e8)
Output
如果不能取到x则输出-1,否则输出要取的最少纸币数量
Sample Input
6 20
10 50 100 500 1000 5000
8
4200
100000
95000
96000
99000
10100
2015
9950
Sample Output
6
20
19
20
-1
3
-1
-1
Solution
把纸币的面额放到map里,枚举第一种纸币的种类和数量,如果恰好是x则更新答案,否则枚举第二种纸币的数量,那么第二种纸币的面额就确定了,从map找这种面额是否存在如果存在则更新答案
Code
#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<cmath> #include<vector> #include<queue> #include<map> #include<set> #include<ctime> using namespace std; typedef long long ll; #define INF 0x3f3f3f3f #define maxn 5555 map<ll,int>m; int n,k,a[maxn],q; int main() { while(~scanf("%d%d",&n,&k)) { m.clear(); for(int i=1;i<=n;i++)scanf("%d",&a[i]),m[a[i]]=1; scanf("%d",&q); while(q--) { int ans=-1; ll x; scanf("%I64d",&x); for(int i=1;i<=n;i++) for(int j=1;j<=k&&1ll*a[i]*j<=x;j++) { ll t=x-1ll*a[i]*j; if(t==0) { if(ans==-1)ans=j; else ans=min(ans,j); } else { for(int l=1;l+j<=k;l++) if(t%l==0&&m.find(t/l)!=m.end()) { if(ans==-1)ans=j+l; else ans=min(ans,j+l); } } } printf("%d\n",ans); } } return 0; }
相关文章推荐
- VK Cup 2015 - Round 1 C. The Art of Dealing with ATM
- Codeforces Round VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)E. The Art of Dealing with ATM 暴力出奇迹!
- CF524C:The Art of Dealing with ATM(打表 + 二分)
- VK Cup 2015 - Round 1 (unofficial online mirror, Div. 1 only)E---The Art of Dealing with ATM
- CodeForces - 27E--Number With The Given Amount Of Divisors(反素数)
- Codeforces 27E. Number With The Given Amount Of Divisors (暴力)
- codeforces 27 E. Number With The Given Amount Of Divisors(反素数)
- 强参数 Strong parameters: Dealing with mass assignment in the controller instead of the model
- The Art of Debugging with GDB
- CodeForces 27 E.Number With The Given Amount Of Divisors(dfs)
- Codeforces 27E - Number With The Given Amount Of Divisors
- CodeForces 27E Number With The Given Amount Of Divisors
- Codeforces 451C Predict Outcome of the Game (枚举+YY)
- CF-27E - Number With The Given Amount Of Divisors(枚举+dfs)
- CF-27E - Number With The Given Amount Of Divisors(枚举+dfs)
- Codeforces 27 E Number With The Given Amount Of Divisors
- [CodeForces 27E] Number With The Given Amount Of Divisors (数论 + 反素数)
- codeforces 27E - Number With The Given Amount Of Divisors (数论 dfs)
- Codeforces 27E Number With The Given Amount Of Divisors (求约数个数为n的最小数)
- codeforces 27E Number With The Given Amount Of Divisors(反素数)