当前位置：网站首页>[CCF CSP] 201709-1 dozen soy sauce

[CCF CSP] 201709-1 dozen soy sauce

2022-07-22 04:01:00 【Jenny, Jenny】

Problem description

Question number ：201709-1
The title of the test question ： get some soy sauce
The time limit ：1.0s
Memory limit ：256.0MB
Problem description ：

Problem description

　　 Xiao Ming takes N Yuan to buy soy sauce . The soy sauce 10 A bottle for $1 , Business promotion , Every purchase 3 Bottle delivery 1 bottle , Or every time you buy 5 Bottle delivery 2 bottle . How many bottles of soy sauce can Xiao Ming get at most .

Input format

　　 The first line of input contains an integer N, It means the amount of money Xiao Ming can use to buy soy sauce .N yes 10 Integer multiple ,N No more than 300.

Output format

　　 Output an integer , It means how many bottles of soy sauce Xiao Ming can get at most .

The sample input

40

Sample output

5

Sample explanation

　　 hold 40 Yuan divided into 30 Genna 10 element , Buy separately 3 Bottle and 1 bottle , among 3 Bottle delivery 1 bottle , Get... Together 5 bottle .

The sample input

80

Sample output

11

Sample explanation

　　 hold 80 Yuan divided into 30 Genna 50 element , Buy separately 3 Bottle and 5 bottle , among 3 Bottle delivery 1 bottle ,5 Bottle delivery 2 bottle , Get... Together 11 bottle .

#include<bits/stdc++.h>
using namespace std;

int main() {
	int n,res;
	cin >> n;
	res = (n / 50) * 7;
	n %= 50;
	res += (n / 30)*4 ;
	n %= 30;
	res += (n / 10);
	cout << res;
	return 0;
}
原网站

版权声明
本文为[Jenny, Jenny]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/203/202207211127029781.html

边栏推荐

猜你喜欢

随机推荐