QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #858922 | #9675. 电池检测 | ydzr00000 | 5 | 1ms | 3840kb | C++14 | 377b | 2025-01-17 09:43:15 | 2025-01-17 09:43:17 |
answer
#include<bits/stdc++.h>
using namespace std;
inline void solve()
{
int a,b;
scanf("%d %d",&a,&b);
int ans=1e7,n=a+b;
int g=n/(a-1),r=n%(a-1);
int cnt=0;
if(r)
cnt+=r*(r-1)/2;
cnt+=(a-1)*(g*(g-1)/2);
printf("%d\n",cnt);
}
int main(){
int t;
scanf("%d",&t);
while(t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 1ms
memory: 3840kb
input:
3 2 1 3 1 2 2
output:
3 2 6
result:
ok 3 number(s): "3 2 6"
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 3712kb
input:
12 2 1 2 2 2 3 2 4 3 1 3 2 3 3 3 4 4 1 4 2 4 3 4 4
output:
3 6 10 15 2 2 6 6 1 3 3 4
result:
wrong answer 6th numbers differ - expected: '4', found: '2'
Subtask #2:
score: 5
Accepted
Test #3:
score: 5
Accepted
time: 0ms
memory: 3840kb
input:
1000 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 2 25 2 26 2 27 2 28 2 29 2 30 2 31 2 32 2 33 2 34 2 35 2 36 2 37 2 38 2 39 2 40 2 41 2 42 2 43 2 44 2 45 2 46 2 47 2 48 2 49 2 50 2 51 2 52 2 53 2 54 2 55 2 56 2 57 2 58 2 59 2 60 2 61...
output:
3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276 300 325 351 378 406 435 465 496 528 561 595 630 666 703 741 780 820 861 903 946 990 1035 1081 1128 1176 1225 1275 1326 1378 1431 1485 1540 1596 1653 1711 1770 1830 1891 1953 2016 2080 2145 2211 2278 2346 2415 2485 2556 2628 27...
result:
ok 1000 numbers
Subtask #3:
score: 0
Wrong Answer
Test #4:
score: 0
Wrong Answer
time: 1ms
memory: 3840kb
input:
1000 3 1 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 3 11 3 12 3 13 3 14 3 15 3 16 3 17 3 18 3 19 3 20 3 21 3 22 3 23 3 24 3 25 3 26 3 27 3 28 3 29 3 30 3 31 3 32 3 33 3 34 3 35 3 36 3 37 3 38 3 39 3 40 3 41 3 42 3 43 3 44 3 45 3 46 3 47 3 48 3 49 3 50 3 51 3 52 3 53 3 54 3 55 3 56 3 57 3 58 3 59 3 60 3 61...
output:
2 2 6 6 12 12 20 20 30 30 42 42 56 56 72 72 90 90 110 110 132 132 156 156 182 182 210 210 240 240 272 272 306 306 342 342 380 380 420 420 462 462 506 506 552 552 600 600 650 650 702 702 756 756 812 812 870 870 930 930 992 992 1056 1056 1122 1122 1190 1190 1260 1260 1332 1332 1406 1406 1482 1482 1560...
result:
wrong answer 2nd numbers differ - expected: '4', found: '2'
Subtask #4:
score: 0
Wrong Answer
Test #5:
score: 0
Wrong Answer
time: 0ms
memory: 3840kb
input:
1000 907 241 495 435 227 139 616 1 433 35 588 407 533 322 995 961 748 310 212 36 968 500 294 187 375 371 307 14 648 180 122 28 304 253 818 812 41 5 286 62 573 340 547 224 347 35 279 56 151 85 626 410 456 248 578 470 11 6 952 771 404 302 77 27 168 40 524 517 171 147 407 294 268 106 100 27 549 196 973...
output:
29161 94830 9730 1 630 83028 52003 462241 48205 666 125250 17578 69006 105 16290 406 32131 330078 15 1953 57970 25200 630 1596 3655 84255 30876 110685 21 297606 45753 378 820 133903 10878 43365 5671 378 19306 69751 595 56616 27730 4186 254541 345696 107880 70876 2415 122760 9870 1326 703 1081 199396...
result:
wrong answer 1st numbers differ - expected: '242', found: '29161'
Subtask #5:
score: 0
Skipped
Dependency #1:
0%
Subtask #6:
score: 0
Skipped
Dependency #5:
0%
Subtask #7:
score: 0
Skipped
Dependency #1:
0%