QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#882621 | #9129. Quotient Sum | suo | WA | 0ms | 3584kb | C++20 | 848b | 2025-02-05 09:57:57 | 2025-02-05 09:58:06 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n); i >= 0; i--)
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "[";
for (int i = 0; i < v.size(); i++) {
os << v[i] << (i == (v.size() - 1) ? "" : ", ");
}
os << "]";
return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2> p) {
os << "{" << p.first << ", " << p.second << "}";
return os;
}
int main() {
int n;
cin >> n;
vector<long long> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
long long ans = 0;
rep(i, n - 1) ans += a[i + 1] / a[i];
ans += a[0] / a[n - 1];
cout << ans << endl;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
3 2 3 6
output:
3
result:
ok "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3456kb
input:
2 15 4
output:
3
result:
ok "3"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
9 284791808 107902 13660981249408 4622332661 13405199 24590921 361 244448137 16077087227955422
output:
4580
result:
ok "4580"
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3584kb
input:
9 12 9 5 17 2 6 7 1 15
output:
10
result:
wrong answer 1st words differ - expected: '6', found: '10'