QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #691132 | #5149. Best Carry Player | tsai# | WA | 48ms | 7200kb | C++14 | 551b | 2024-10-31 10:03:00 | 2024-10-31 10:03:01 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
string s[N];
void solve(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
cin>>s[i];
while(s[i].length()<9){
s[i]='0'+s[i];
}
}
int cnt=0;
int go=0;
for(int i=8;i>=0;i--){
int now=go;
for(int j=1;j<=n;j++){
now+=(int)(s[j][i]-48);
// cout<<(int)(s[j][i]-48)<<"\...\n";
}
cnt+=now/10;
go=now/10;
}
printf("%d",cnt);
}
int main(){
int t;
scanf("%d",&t);
while(t--){
solve();
if(t) printf("\n");
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 7200kb
input:
2 3 9 99 999 1 12345
output:
5 0
result:
ok 2 number(s): "5 0"
Test #2:
score: 0
Accepted
time: 48ms
memory: 6912kb
input:
100000 1 481199252 1 634074578 1 740396295 1 579721198 1 503722503 1 202647942 1 268792718 1 443917727 1 125908043 1 717268783 1 150414369 1 519096230 1 856168102 1 674936674 1 274667941 1 527268921 1 421436316 1 286802932 1 646837311 1 451394766 1 105650419 1 302790137 1 254786900 1 76141081 1 7393...
output:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok 100000 numbers
Test #3:
score: 0
Accepted
time: 19ms
memory: 6976kb
input:
10000 10 598196518 640274071 983359971 71550121 96204862 799843967 446173607 796619138 402690754 223219513 10 312183499 905549873 673542337 566661387 879397647 434495917 631413076 150918417 579868000 224422012 10 525305826 535526356 404334728 653535984 998133227 879226371 59632864 356493387 62611196...
output:
42 41 42 35 43 35 44 38 39 46 31 40 42 38 38 41 39 39 37 42 38 41 38 42 41 39 40 45 35 41 37 40 41 41 40 35 50 39 42 33 44 43 46 41 35 42 39 41 39 38 34 44 39 43 38 40 41 36 35 45 37 39 40 41 43 44 41 43 40 42 37 41 38 43 40 40 42 42 41 40 37 41 36 42 41 40 44 35 37 43 40 36 36 43 41 41 43 44 32 38 ...
result:
ok 10000 numbers
Test #4:
score: -100
Wrong Answer
time: 17ms
memory: 6996kb
input:
1000 95 708441014 953465932 817091665 611120528 186861396 45214633 309108293 362222948 134971428 346366757 945798520 132315932 293683620 945425590 668726142 893155157 191896353 57521218 112217858 641511394 672365121 156197927 495345729 585777737 567289722 592583094 842472845 908714567 355422360 5153...
output:
416 411 401 413 419 426 435 451 437 419 408 430 431 410 423 422 445 411 416 415 433 432 440 415 413 410 404 408 428 409 416 414 433 429 431 407 424 441 432 408 443 409 430 407 441 437 452 412 391 441 412 401 426 393 444 430 419 397 445 420 398 438 433 407 399 394 421 411 425 431 424 423 422 441 421 ...
result:
wrong answer 1st numbers differ - expected: '421', found: '416'