QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#359439 | #7694. Cornhusker | warner1129# | WA | 0ms | 3736kb | C++20 | 1.6kb | 2024-03-20 17:52:21 | 2024-03-20 17:52:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
template <ranges::range T,
class = enable_if_t<!is_convertible_v<T, string_view>>>
istream &operator>>(istream &s, T &&v) {
for (auto &&x : v)
s >> x;
return s;
}
template <ranges::range T,
class = enable_if_t<!is_convertible_v<T, string_view>>>
ostream &operator<<(ostream &s, T &&v) {
for (auto &&x : v)
s << x << ' ';
return s;
}
#ifdef LOCAL
template <class... T> void dbg(T... x) {
char e{};
((cerr << e << x, e = ' '), ...);
}
#define debug(x...) dbg(#x, '=', x, '\n')
#else
#define debug(...) ((void)0)
#endif
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second
template <class T> inline constexpr T inf = numeric_limits<T>::max() / 2;
template <class T> bool chmin(T &a, T b) { return (b < a and (a = b, true)); }
template <class T> bool chmax(T &a, T b) { return (a < b and (a = b, true)); }
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
// constexpr i64 mod = 1e9 + 7;
void solve() {
const int n = 5;
i64 ans = 0;
for (int i = 0; i < n; i++) {
i64 a, b;
cin >> a >> b;
ans += a * b;
}
i64 x, y;
cin >> x >> y;
ans = ans * x / y / 5;
cout << ans << '\n';
}
signed main() {
cin.tie(0)->sync_with_stdio(false);
cin.exceptions(cin.failbit);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3688kb
input:
16 32 16 32 16 32 16 32 16 32 25 85
output:
150
result:
ok single line: '150'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
14 30 15 32 15 34 14 34 16 32 27 75
output:
172
result:
ok single line: '172'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
16 24 16 34 16 40 14 30 16 35 28 95
output:
150
result:
ok single line: '150'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
10 20 18 36 17 31 20 44 21 23 46 91
output:
276
result:
ok single line: '276'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
16 38 22 40 18 25 14 34 22 29 26 87
output:
182
result:
ok single line: '182'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
11 48 11 48 11 22 13 50 14 37 44 87
output:
249
result:
ok single line: '249'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
13 29 15 32 12 42 24 20 12 45 16 75
output:
101
result:
ok single line: '101'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
10 21 21 41 22 30 21 39 13 37 29 75
output:
234
result:
ok single line: '234'
Test #9:
score: -100
Wrong Answer
time: 0ms
memory: 3612kb
input:
19 34 9 44 14 45 12 47 13 37 38 89
output:
232
result:
wrong answer 1st lines differ - expected: '231', found: '232'