Codeforces Round #350 (Div. 2) D1
2016-05-06 09:51
176 查看
D1. Magic Powder - 1
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
This problem is given in two versions that differ only by constraints. If you can solve this problem in large constraints, then you can just write a single solution to the both versions. If you find the problem too difficult in large constraints, you can write solution to the simplified version only.
Waking up in the morning, Apollinaria decided to bake cookies. To bake one cookie, she needs n ingredients, and for each ingredient she knows the value ai — how many grams of this ingredient one needs to bake a cookie. To prepare one cookie Apollinaria needs to use all n ingredients.
Apollinaria has bi gram of the i-th ingredient. Also she has k grams of a magic powder. Each gram of magic powder can be turned to exactly 1 gram of any of the n ingredients and can be used for baking cookies.
Your task is to determine the maximum number of cookies, which Apollinaria is able to bake using the ingredients that she has and the magic powder.
Input
The first line of the input contains two positive integers n and k (1 ≤ n, k ≤ 1000) — the number of ingredients and the number of grams of the magic powder.
The second line contains the sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where the i-th number is equal to the number of grams of the i-th ingredient, needed to bake one cookie.
The third line contains the sequence b1, b2, ..., bn (1 ≤ bi ≤ 1000), where the i-th number is equal to the number of grams of the i-th ingredient, which Apollinaria has.
Output
Print the maximum number of cookies, which Apollinaria will be able to bake using the ingredients that she has and the magic powder.
Examples
Input
Output
Input
Output
Note
In the first sample it is profitably for Apollinaria to make the existing 1 gram of her magic powder to ingredient with the index 2, then Apollinaria will be able to bake 4 cookies.
In the second sample Apollinaria should turn 1 gram of magic powder to ingredient with the index 1 and 1 gram of magic powder to ingredient with the index 3. Then Apollinaria will be able to bake 3 cookies. The remaining 1 gram of the magic powder can be left, because it can't be used to increase the answer.
题意:做一块曲奇需要n种原料 做一块需要每种a1..a2..an克 现拥有b1...bn每种原料 以及k克魔法面粉(可以代替1:1任何原料)
问 最多能做多少块曲奇?
题解: for循环暴力处理 每块每块地做
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
This problem is given in two versions that differ only by constraints. If you can solve this problem in large constraints, then you can just write a single solution to the both versions. If you find the problem too difficult in large constraints, you can write solution to the simplified version only.
Waking up in the morning, Apollinaria decided to bake cookies. To bake one cookie, she needs n ingredients, and for each ingredient she knows the value ai — how many grams of this ingredient one needs to bake a cookie. To prepare one cookie Apollinaria needs to use all n ingredients.
Apollinaria has bi gram of the i-th ingredient. Also she has k grams of a magic powder. Each gram of magic powder can be turned to exactly 1 gram of any of the n ingredients and can be used for baking cookies.
Your task is to determine the maximum number of cookies, which Apollinaria is able to bake using the ingredients that she has and the magic powder.
Input
The first line of the input contains two positive integers n and k (1 ≤ n, k ≤ 1000) — the number of ingredients and the number of grams of the magic powder.
The second line contains the sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where the i-th number is equal to the number of grams of the i-th ingredient, needed to bake one cookie.
The third line contains the sequence b1, b2, ..., bn (1 ≤ bi ≤ 1000), where the i-th number is equal to the number of grams of the i-th ingredient, which Apollinaria has.
Output
Print the maximum number of cookies, which Apollinaria will be able to bake using the ingredients that she has and the magic powder.
Examples
Input
3 1 2 1 4 11 3 16
Output
4
Input
4 3 4 3 5 6 11 12 14 20
Output
3
Note
In the first sample it is profitably for Apollinaria to make the existing 1 gram of her magic powder to ingredient with the index 2, then Apollinaria will be able to bake 4 cookies.
In the second sample Apollinaria should turn 1 gram of magic powder to ingredient with the index 1 and 1 gram of magic powder to ingredient with the index 3. Then Apollinaria will be able to bake 3 cookies. The remaining 1 gram of the magic powder can be left, because it can't be used to increase the answer.
题意:做一块曲奇需要n种原料 做一块需要每种a1..a2..an克 现拥有b1...bn每种原料 以及k克魔法面粉(可以代替1:1任何原料)
问 最多能做多少块曲奇?
题解: for循环暴力处理 每块每块地做
#include<bits/stdc++.h> #include<iostream> #include<cstring> #include<cstdio> #include<queue> #include<stack> #include<map> #define ll __int64 #define pi acos(-1.0) using namespace std; int n,k; struct node { int a; int b; }N[1005]; int ans; int main() { scanf("%d %d",&n,&k); for(int i=1;i<=n;i++) scanf("%d",&N[i].a); for(int i=1;i<=n;i++) scanf("%d",&N[i].b); ans=0; for(int j=1;j<=2000;j++) { for(int i=1;i<=n;i++) { if(N[i].b>=N[i].a) N[i].b=N[i].b-N[i].a; else { k=k-(N[i].a-N[i].b); N[i].b=0; } if(i==n&&k>=0) ans++; } if(k<=0) break; } printf("%d\n",ans); return 0; }
相关文章推荐
- 玩手机惹怒丈夫 男子用菜刀砍死怀孕8个月妻子
- 多线程不安全函数
- 如何看待sds?
- mac上配置多git源
- 121. Best Time to Buy and Sell Stock
- Android深入浅出之Audio 第一部分 AudioTrack分析
- 实战大数据读书笔记
- MVVM
- Previous Next Warning the Maximum Key Length is 900 bytes
- centos7 Nexus maven私有仓库
- vs12使用微软在线代码托管工具(Visual Studio Team Services)
- Java中可变长参数的使用及注意事项
- Python使用UUID库生成唯一ID
- zb的生日
- oracle 查询表空间使用情况
- zedgraph控件的一些比较有用的属性
- ubuntu14.04 gedit 打开 txt 文件乱码
- PHP字符串中插入子字符串方法总结[原创]_php技巧_脚本之家
- 汇报技术规划的技巧
- 7. Reverse Integer 反转int