Anonymous user
Ramsey's theorem: Difference between revisions
→{{header|PARI/GP}}: Add Python
(→{{header|PARI/GP}}: Add Python) |
|||
Line 130:
This takes the [[#C|C]] solution to its logical extreme.
<lang parigp>matrix(17,17,x,y,my(t=(x-y)%17);t==2^min(valuation(t,2),3))</lang>
=={{header|Python}}==
{{trans|C}}
<lang python>def main():
a = [[0] * 17 for i in range(17)]
mark = "01-"
for i in range(17):
a[i][i] = 2
k = 1
while k <=8:
for i in range(17):
j = (i + k) % 17
a[i][j] = a[j][i] = 1
k <<= 1
for i in range(17):
for j in range(17):
print(mark[a[i][j]], end=' ')
print()
if __name__ == '__main__':
main()</lang>
{{out|Output same as C}}
=={{header|REXX}}==
| |||