Ramsey's theorem: Difference between revisions

m
Line 919:
end
for i in nmin:nmax-1
for ni in 0nmin:depthnmax-1
ifm a[idx[n + 1] + 1, i + 1] != typ0
for n in break0:depth-1
if a[idx[n + 1] + 1, i + 1] != typ
break
end
m = n +1
end
if nm == depth
idx[nm + 1] = i
if findgroup(typ, 1, nmax, depth + 1)
return true
end
end
end
end
return false
Line 982 ⟶ 986:
All tests are OK.
</pre>
 
 
=={{header|Kotlin}}==
4,108

edits