QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#646676#7694. Cornhuskerzeyu#AC ✓0ms3832kbC++231.8kb2024-10-17 03:06:272024-10-17 03:06:29

Judging History

你现在查看的是最新测评结果

  • [2024-10-17 03:06:29]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3832kb
  • [2024-10-17 03:06:27]
  • 提交

answer

#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	vector<int> a(10); for (int i = 0; i < 10; i ++) cin >> a[i];
	int n, m; cin >> n >> m;
	int ans = 0;
	for (int i = 0; i < 10; i += 2) ans += a[i] * a[i + 1];
	ans /= 5;
	cout << n * ans / m << '\n';
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3832kb

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: 3600kb

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: 3568kb

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: 3532kb

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: 3564kb

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: 3532kb

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: 3532kb

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: 3544kb

input:

10 21 21 41 22 30 21 39 13 37
29 75

output:

234

result:

ok single line: '234'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3820kb

input:

19 34 9 44 14 45 12 47 13 37
38 89

output:

231

result:

ok single line: '231'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3532kb

input:

21 41 15 34 24 47 24 32 22 25
25 78

output:

244

result:

ok single line: '244'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3540kb

input:

21 30 24 41 9 28 20 36 12 35
30 89

output:

202

result:

ok single line: '202'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3484kb

input:

23 21 16 29 24 37 23 42 18 48
22 90

output:

179

result:

ok single line: '179'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3524kb

input:

18 41 19 36 23 23 15 29 24 30
26 83

output:

194

result:

ok single line: '194'

Test #14:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

14 20 23 26 21 22 15 42 10 23
22 88

output:

110

result:

ok single line: '110'

Test #15:

score: 0
Accepted
time: 0ms
memory: 3536kb

input:

18 36 9 47 21 30 23 23 10 38
45 87

output:

270

result:

ok single line: '270'

Test #16:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

19 27 22 23 23 20 21 23 23 24
41 87

output:

236

result:

ok single line: '236'

Test #17:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

21 48 19 26 19 22 12 40 9 46
21 92

output:

128

result:

ok single line: '128'

Test #18:

score: 0
Accepted
time: 0ms
memory: 3592kb

input:

14 50 15 21 14 41 19 26 11 46
24 82

output:

151

result:

ok single line: '151'

Test #19:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

19 40 17 44 14 40 16 50 15 29
14 82

output:

112

result:

ok single line: '112'

Test #20:

score: 0
Accepted
time: 0ms
memory: 3532kb

input:

10 44 18 48 22 44 14 43 22 47
19 78

output:

190

result:

ok single line: '190'

Test #21:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

18 37 14 30 14 41 9 26 21 24
40 90

output:

212

result:

ok single line: '212'

Test #22:

score: 0
Accepted
time: 0ms
memory: 3756kb

input:

17 23 18 31 19 23 11 42 16 25
35 89

output:

176

result:

ok single line: '176'

Test #23:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

9 31 22 38 23 48 14 38 21 29
27 84

output:

216

result:

ok single line: '216'

Test #24:

score: 0
Accepted
time: 0ms
memory: 3564kb

input:

8 20 8 20 8 20 8 20 8 20
10 75

output:

21

result:

ok single line: '21'

Test #25:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

24 50 24 50 24 50 24 50 24 50
50 95

output:

631

result:

ok single line: '631'