200000
697299172 717335728 886698790 788633118 338380054 658189362 318413416 421063238 391867470 24
<1974165 bytes omitted>| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #81623 | #1256. 200的倍数 | Memory Limit Exceeded | 0 | 6231 ms | 655364 K | Python 3 / 268 B | Propofol | 2022-12-18 14:23:10 |
from itertools import combinations
n = int(input())
L = tuple(map(int, input().split()))
K = range(len(L))
a = 0
for j, i in list(combinations(K, 2)):
if L[i] == L[j] and i != j:
a += 1
elif (L[i] - L[j]) % 200 == 0:
a += 1
print(a)
200000
697299172 717335728 886698790 788633118 338380054 658189362 318413416 421063238 391867470 24
<1974165 bytes omitted>200000
83682743 482125053 618392125 101207256 118502872 887790373 341125255 325529258 953724886 346
<1974054 bytes omitted>200000
495151484 556049701 335050199 398291879 83168103 445632741 906958208 928057778 890219895 324
<1974312 bytes omitted>200000
264997735 511027750 237030956 516685855 407031075 24224959 170014875 964725939 884552540 487
<1973901 bytes omitted>200000
62409279 913524997 914964027 713926908 197508890 273479156 755634901 399695938 254695139 392
<1973999 bytes omitted>200000
242910353 364217454 978179711 312683769 565850228 405932645 441338085 803273601 796258031 56
<1974055 bytes omitted>200000
870582931 457126162 404306703 122019221 887706396 970755941 835189807 244460829 879347655 15
<1974165 bytes omitted>200000
914506175 206515749 865306688 952944916 83757259 550802052 818788398 598879030 196471132 146
<1974248 bytes omitted>200000
198272215 227911917 102725927 298039233 652672970 32325750 229435920 790388950 875081549 205
<1974261 bytes omitted>