QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #189366 | #6855. Assertion | spoonjunxi# | AC ✓ | 21ms | 3472kb | C++14 | 667b | 2023-09-27 13:37:41 | 2023-09-27 13:37:42 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i, j, k) for (int i = (j); i <= (k); i++)
#define per(i, j, k) for (int i = (k); i >= (j); i--)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
using VI = std::vector<int>;
using ll = long long;
using PII = std::pair<int, int>;
using db = double;
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n, m, d;
cin >> n >> m >> d;
int mx = m / n;
if (m % n) mx += 1;
cout << (mx >= d ? "Yes" : "No") << "\n";
}
}
详细
Test #1:
score: 100
Accepted
time: 21ms
memory: 3472kb
input:
100000 357307304 363942958 1 662576913 905718124 995220611 453416937 526170453 0 119873136 154256418 1 41415817 125860824 705825857 200416889 827676915 3 176598443 191432743 294885355 215284443 380024466 389737003 578805740 738635880 0 22343465 928072945 1 73751065 983487501 572309207 511276117 7047...
output:
Yes No Yes Yes No Yes No No Yes Yes No Yes No No No Yes Yes Yes No Yes Yes No No No No No Yes Yes No Yes Yes Yes No Yes Yes No No Yes No Yes Yes No No Yes No Yes No No Yes No No Yes No Yes No Yes No Yes No Yes Yes Yes No Yes Yes Yes No Yes Yes Yes Yes No Yes Yes No No No No Yes No No Yes Yes Yes No ...
result:
ok 100000 lines