QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #594188 | #9355. Keeping Rabbits | zanq# | AC ✓ | 259ms | 4712kb | C++23 | 517b | 2024-09-27 20:04:16 | 2024-09-27 20:04:17 |
Judging History
answer
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,t, k;
void solve(){
scanf("%lld%lld", &n, &k);
int w[n + 1];
int sum=0;
for (int i = 1; i <= n;++i){
scanf("%lld", &w[i]);
sum += w[i];
}
for (int i = 1; i <= n;++i){
double aa = w[i] * 1.0 / sum*k+w[i];
printf("%.8lf ", aa);
}
puts("");
}
signed main()
{
scanf("%lld", &t);
while(t--){
solve();
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3868kb
input:
3 1 1 2 2 2 1 3 3 2 1 1 1
output:
3.00000000 1.50000000 4.50000000 1.66666667 1.66666667 1.66666667
result:
ok 6 numbers
Test #2:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
10 10 5 6 9 4 4 4 7 6 2 8 7 10 3 9 4 10 4 2 8 8 6 4 7 10 2 2 5 9 4 9 4 2 7 5 9 10 5 9 1 2 1 10 10 7 9 7 1 10 6 8 3 1 10 5 3 1 6 3 10 10 10 5 9 1 7 10 7 6 6 4 4 10 6 1 7 9 5 1 1 6 3 6 5 10 7 5 6 9 1 9 7 1 1 4 5 10 3 4 10 3 3 10 9 3 6 9 10 10 6 5 5 1 2 4 6 8 1 8 2
output:
6.52631579 9.78947368 4.35087719 4.35087719 4.35087719 7.61403509 6.52631579 2.17543860 8.70175439 7.61403509 9.43548387 4.19354839 10.48387097 4.19354839 2.09677419 8.38709677 8.38709677 6.29032258 4.19354839 7.33870968 2.07142857 5.17857143 9.32142857 4.14285714 9.32142857 4.14285714 2.07142857 ...
result:
ok 100 numbers
Test #3:
score: 0
Accepted
time: 0ms
memory: 3920kb
input:
10 10 2 18 23 74 43 31 61 59 9 82 39 10 6 82 44 26 99 29 100 24 45 14 8 10 3 10 76 15 14 73 94 48 83 84 20 10 1 35 20 48 6 17 75 57 78 76 39 10 9 13 92 32 23 32 93 13 38 34 64 10 9 45 41 26 90 96 9 20 37 93 14 10 9 81 3 56 89 58 30 21 2 93 28 10 4 69 4 11 77 81 24 19 70 4 85 10 8 5 39 89 36 82 37 12...
output:
18.08200456 23.10478360 74.33712984 43.19589977 31.14123007 61.27790433 59.26879271 9.04100228 82.37357631 39.17767654 83.04458599 44.56050955 26.33121019 100.26114650 29.36942675 101.27388535 24.30573248 45.57324841 14.17834395 8.10191083 10.05802708 76.44100580 15.08704062 14.08123791 73.4235976...
result:
ok 100 numbers
Test #4:
score: 0
Accepted
time: 1ms
memory: 3972kb
input:
10 100 28 54 29 35 99 52 7 52 91 49 4 71 33 22 90 11 73 28 13 43 64 26 47 53 56 32 76 40 80 90 84 18 90 24 96 81 66 82 21 75 58 46 52 45 38 36 82 66 33 4 54 2 57 43 9 64 43 72 10 1 31 80 89 49 100 35 61 44 45 51 51 39 80 80 11 31 95 65 59 81 43 81 2 46 60 90 65 83 55 52 93 80 66 61 29 23 99 2 64 22 ...
output:
54.28821960 29.15478460 35.18680900 99.52840259 52.27754480 7.03736180 52.27754480 91.48570339 49.26153260 4.02134960 71.37895539 33.17613420 22.11742280 90.48036599 11.05871140 73.38963019 28.14944720 13.06938620 43.22950820 64.34159360 26.13877240 47.25085780 53.28288220 56.29889440 32.17079680 76...
result:
ok 1000 numbers
Test #5:
score: 0
Accepted
time: 259ms
memory: 4712kb
input:
1005 89 48 24 95 46 14 50 35 66 24 31 84 66 39 16 80 14 78 49 46 8 19 2 33 97 37 40 85 13 19 51 58 24 87 87 69 77 62 65 5 10 5 15 75 12 32 35 24 13 90 64 89 71 22 94 31 70 93 38 89 56 26 78 56 74 32 28 52 35 61 87 17 1 54 2 88 62 34 74 27 47 18 12 57 88 39 37 76 36 24 31 89 70 71 4 27 56 36 65 33 6 ...
output:
24.27586207 96.09195402 46.52873563 14.16091954 50.57471264 35.40229885 66.75862069 24.27586207 31.35632184 84.96551724 66.75862069 39.44827586 16.18390805 80.91954023 14.16091954 78.89655172 49.56321839 46.52873563 8.09195402 19.21839080 2.02298851 33.37931034 98.11494253 37.42528736 40.45977011 85...
result:
ok 589000 numbers
Extra Test:
score: 0
Extra Test Passed