Haskell, 56(削除) 56 (削除ここまで) 55 bytes
Another one bytes the dust thanks to DLosc .
f m=maximum[(c,(y,x))|(y,r)<-zip[0..]me m,(x,c)<-zip[0e r]
e=zip[0..]r]]
Heh, this is technically a built-in solution. Outputs as (max, (y, x)).
Weird output solution, 46(削除) 46 (削除ここまで) 39 bytes
-7 bytes thanks to to DLosc .
maximum.(`zip`[0..])e.map(maximum.e)
e=(`zip`[0..]))
This effectively does the same thing but outputs as ((max, x), y).
Haskell, 56 bytes
f m=maximum[(c,(y,x))|(y,r)<-zip[0..]m,(x,c)<-zip[0..]r]
Heh, this is technically a built-in solution. Outputs as (max, (y, x)).
Weird output solution, 46 bytes
maximum.(`zip`[0..]).map(maximum.(`zip`[0..]))
This effectively does the same thing but outputs as ((max, x), y).
Haskell, (削除) 56 (削除ここまで) 55 bytes
Another one bytes the dust thanks to DLosc .
f m=maximum[(c,(y,x))|(y,r)<-e m,(x,c)<-e r]
e=zip[0..]
Heh, this is technically a built-in solution. Outputs as (max, (y, x)).
Weird output solution, (削除) 46 (削除ここまで) 39 bytes
-7 bytes thanks to to DLosc .
maximum.e.map(maximum.e)
e=(`zip`[0..])
This effectively does the same thing but outputs as ((max, x), y).
Haskell, 56 bytes
f m=maximum[(c,(y,x))|(y,r)<-zip[0..]m,(x,c)<-zip[0..]r]
Heh, this is technically aa built-in solution. Outputs as (max, (y, x)).
Weird output solution, 46 bytes
maximum.(`zip`[0..]).map(maximum.(`zip`[0..]))
This effectively does the same thing but outputs as ((max, x), y).
Haskell, 56 bytes
f m=maximum[(c,(y,x))|(y,r)<-zip[0..]m,(x,c)<-zip[0..]r]
Heh, this is technically a built-in solution.
Weird output solution, 46 bytes
maximum.(`zip`[0..]).map(maximum.(`zip`[0..]))
This effectively does the same thing but outputs as ((max, x), y).
Haskell, 56 bytes
f m=maximum[(c,(y,x))|(y,r)<-zip[0..]m,(x,c)<-zip[0..]r]
Heh, this is technically a built-in solution. Outputs as (max, (y, x)).
Weird output solution, 46 bytes
maximum.(`zip`[0..]).map(maximum.(`zip`[0..]))
This effectively does the same thing but outputs as ((max, x), y).