https://ac.nowcoder.com/acm/contest/25080 第一题太简单略过 第二题 贪心：注意两种情况，5元纸币够用和5元纸币不够用； if从句搞定 #include <stdio.h> int main(){ long long int n,a,cnt5,cnt1; scanf("%d %d",&n,&a); cnt5 = a / 5; i
解析 10可以看成2*5，因此求出含有2的因子和含有5的因子这两种数的个数，求最小就可以了。 #include<bits/stdc++.h> using namespace std; void get_ans() { int cnt5=0,cnt2=0; ifstream infile; infile.open("input.txt"); for(int i=0;i<10;i++){
目录Lemonade Change 任务调度器思路tag Lemonade Change 任务调度器 At a lemonade stand, each lemonade costs $5. Customers are standing in a queue to buy from you, and order one at a time (in the order specified by bills). Each customer will only buy one lemonad
