QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #274794 | #6407. Classical A+B Problem | ucup-team2262# | WA | 1ms | 3768kb | C++23 | 1.8kb | 2023-12-03 23:08:36 | 2023-12-03 23:08:37 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
6 2 786 1332 89110 2333333 10000000000000000000000000001
output:
1 1 777 9 333 999 222 88888 111111 2222222 2 9999999999999999999999999999
result:
ok ok (6 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3768kb
input:
100 854 77777777781111111111111111110 44444450 11111111111111333 2310 5 333333333333333333333343332 888999 10 11113333 335 77779 88888888888888888888889111111111111111111110 55555555555555777777 72222222222222222222221 666 5777 1111555555 444444444544444444443 88888888888891111111111110 673332 97 77...
output:
777 77 3333333333333333333 77777777777777777777777777777 44444444 6 11111111111111111 222 2222 88 1 4 333333333333333333333333333 9999 111 888888 1 9 11111111 2222 2 333 2 77777 222222222222222222222 88888888888888888888888888888888888888888888 222222 55555555555555555555 5555555555555555555555 6666...
result:
wrong answer Token parameter [name=y] equals to "88888888888", doesn't correspond to pattern "[1-9]{1,2}" (test case 77)