Submission #14918529
Source Code Expand
cdef gcd(int p, int q): cdef int r while q: r = p % q p = q q = r return p def main(): cdef int ans, i, j, l, K K = int(input()) ans = 0 for i in range(1, K+1): for j in range(1, K+1): for l in range(1, K+1): ans = ans + gcd(gcd(i, j), l) print(ans) if __name__ == "__main__": main()
Submission Info
Submission Time | |
---|---|
Task | C - Sum of gcd of Tuples (Easy) |
User | nishiohirokazu |
Language | Cython (0.29.16) |
Score | 300 |
Code Size | 408 Byte |
Status | AC |
Exec Time | 785 ms |
Memory | 9332 KiB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01, sample_02 |
All | hand_01, large_01, large_02, large_03, large_04, large_05, random_01, random_02, random_03, random_04, random_05, sample_01, sample_02, small_01, small_02, small_03, small_04, small_05 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
hand_01 | AC | 53 ms | 9076 KiB |
large_01 | AC | 772 ms | 9004 KiB |
large_02 | AC | 760 ms | 9076 KiB |
large_03 | AC | 753 ms | 9004 KiB |
large_04 | AC | 738 ms | 9332 KiB |
large_05 | AC | 724 ms | 9136 KiB |
random_01 | AC | 36 ms | 9052 KiB |
random_02 | AC | 385 ms | 9192 KiB |
random_03 | AC | 178 ms | 9000 KiB |
random_04 | AC | 413 ms | 9000 KiB |
random_05 | AC | 107 ms | 9052 KiB |
sample_01 | AC | 24 ms | 9012 KiB |
sample_02 | AC | 785 ms | 8944 KiB |
small_01 | AC | 27 ms | 9008 KiB |
small_02 | AC | 23 ms | 9328 KiB |
small_03 | AC | 24 ms | 9136 KiB |
small_04 | AC | 24 ms | 9192 KiB |
small_05 | AC | 21 ms | 9188 KiB |