/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 14ms 3.102 MiB
#2 Wrong Answer 14ms 3.062 MiB
#3 Accepted 16ms 3.207 MiB
#4 Accepted 17ms 3.117 MiB
#5 Wrong Answer 24ms 3.227 MiB

Code

t=int(input())
p=[]
u=0
for i in range(t):
    n=int(input())
    lst=list(map(int,input().split()))
    for z in range(n):
        p.append((lst[z]) % 3)
    if sum(lst) % 3 == 0 or sum(lst) == 0:
        u += len(lst)
        print(u)
        u = 0
    elif sum(lst) % 3 == 1:
        if 1 in p:
            u += len(lst) - 1
            print(u)
            u = 0
        elif 2 in p:
            u += len(lst) - 4
            if u>=0:
                print(u)
                u = 0
            
    elif sum(lst) % 3 == 2:
        if 2 in p:
            u += len(lst) - 1
            print(u)
            u = 0
        elif 1 in p:
            u += len(lst) - 2
            print(u)
            u = 0










Information

Submit By
Type
Submission
Problem
P1013 Divisible by 3
Language
Python 3 (Python 3.12.3)
Submit At
2024-01-06 13:03:40
Judged At
2024-11-11 03:43:49
Judged By
Score
50
Total Time
24ms
Peak Memory
3.227 MiB