每日一题第三十九期 Codeforces Round 931 (Div. 2)

最新推荐文章于 2024-11-11 23:32:39 发布

娇娇yyyyyy

最新推荐文章于 2024-11-11 23:32:39 发布

阅读量903

点赞数 10

分类专栏：每日一题 cf 文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/2301_80882026/article/details/137086759

版权

每日一题同时被 2 个专栏收录

98 篇文章 1 订阅

订阅专栏

31 篇文章 0 订阅

订阅专栏

B. Yet Another Coin Problem

time limit per test: 1 second

memory limit per test: 256 megabytes

input: standard input

output: standard output

You have $5$ different types of coins, each with a value equal to one of the first $5$ triangular numbers: $1$ , $3$ , $6$ , $10$ , and $15$ . These coin types are available in abundance. Your goal is to find the minimum number of these coins required such that their total value sums up to exactly $n$ .

We can show that the answer always exists.

Input

The first line contains one integer $t$ ( $\le t \le 10^4$ ) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer $n$ ( $\leq n \leq 10^9$ ) — the target value.

Output

For each test case, output a single number — the minimum number of coins required.

Example
inputCopy
14
1
2
3
5
7
11
12
14
16
17
18
20
98
402931328
outputCopy
1
2
1
3
2
2
2
3
2
3
2
2
8
26862090

Note

In the first test case, for $n = 1$ , the answer is $1$ since only one $1$ value coin is sufficient. $\cdot 1$ .

In the fourth test case, for $n = 5$ , the answer is $3$ , which can be achieved using two $1$ value coins and one $3$ value coin. $\cdot 1 + 1 \cdot 3$ .

In the seventh test case, for $n = 12$ , the answer is $2$ , which can be achieved using two $6$ value coins.

In the ninth test case, for $n = 16$ , the answer is $2$ , which can be achieved using one $1$ value coin and one $15$ value coin or using one $10$ value coin and one $6$ value coin. $\cdot 1 + 1 \cdot 15 = 1 \cdot 6 + 1 \cdot 10$ .

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=998244353;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e6 + 10;

int t;
int n;
int main()
{
	cin >> t;
	while(t --){
		int n;
		cin >> n;
		int mins = 1e9;
		for(int i = 0; i <= 2; i ++)
		{
			for(int j = 0; j <= 1; j ++)
			{
				for(int k = 0; k <= 4; k ++)
				{
					for(int l = 0; l <= 2; l ++)
					{
				        int sum = n - (i * 1 + j * 3 + k * 6 + l * 10);
						if(sum < 0 || sum % 15 != 0) continue;
						mins = min(mins, i + j + k + l + sum / 15);
					}
				}
			}
			
		}
		cout << mins << endl;
	}
	return 0;
}