/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 13ms 2.895 MiB
#2 Wrong Answer 16ms 2.875 MiB
#3 Wrong Answer 16ms 2.758 MiB
#4 Wrong Answer 16ms 2.77 MiB
#5 Wrong Answer 16ms 2.859 MiB
#6 Wrong Answer 16ms 2.828 MiB
#7 Accepted 16ms 2.699 MiB
#8 Accepted 16ms 2.75 MiB
#9 Wrong Answer 16ms 2.75 MiB
#10 Wrong Answer 16ms 2.855 MiB
#11 Accepted 16ms 2.754 MiB

Code

'''CODED BY mahmudulsakib2019
 DATE:-13/03/2024; TIME:-19:31 PM
  BANGALDESH , SYLHET'''
import math 
for i in range(int(input())):
    p=[]
    n=int(input())
    for j in range(1,1001):
        c= (n*n) + (j*j)
        C=math.sqrt(c)
        if(C%1==0):
            perimeter = int(C+n+j)
            p.append(perimeter)
    if(len(p)==0):
        print(-1)
    else:
        print(max(p))

            
  

Information

Submit By
Type
Submission
Problem
P1027 Right triangle
Language
Python 3 (Python 3.12.3)
Submit At
2024-03-12 13:31:42
Judged At
2024-03-12 13:31:42
Judged By
Score
35
Total Time
16ms
Peak Memory
2.895 MiB