思路:
代码实现:
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int t, n, m, p;
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> n >> m >> p;
int x = m * p / 100 + (m * p % 100 != 0);
// cout << x << endl;
int ans = 0;
while(n >= m){
int cnt = n / m;
n -= cnt * x;
ans += cnt;
// cout << "n:" << n << endl;
}
cout << ans << endl;
}
return 0;
}
本文地址:https://blog.csdn.net/Satur9/article/details/107583868
如对本文有疑问, 点击进行留言回复!!
Harmony Pairs 2020牛客暑期多校训练营(第六场)
Codeforces Round #659 (Div. 2) 题解
清华大学《数据结构与算法》笔记(从02-D3-1到02-D4-5)
洛谷:P2585 [ZJOI2006]三色二叉树(树dp,提高+/省选-)
贪吃蛇C/C++面向过程源码分析(双缓冲区 | 248行代码)
网友评论