prithivMLmods/Coder-Stat

1 2 3<H1>4Get a Rectangular Field5</H1>6 7<P>8Karnaugh is a poor farmer who has a very small field.9He wants to reclaim wasteland in the kingdom to get a new field.10But the king who loves regular shape11made a rule that a settler can only get a rectangular land as his field.12Thus, Karnaugh should get the largest rectangular land suitable for13reclamation.14</P>15<P>16The map of the wasteland is represented with a 5 x 5 grid as shown17in the following figures, where '1' represents a place suitable for18reclamation and '0' represents a sandy place.19Your task is to find the largest rectangle consisting only of 1's in the map,20and to report the size of the rectangle.21The size of a rectangle is defined by the number of 1's in it.22Note that there may be two or more largest rectangles of the same size.23</P>24<pre>25                <img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_sample1s">26Figure 1. The size of the largest rectangles is 4.27        There are two largest rectangles (shaded).28 29 30                <img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_sample2s">31Figure 2. The size of the largest rectangle is 3.32        There is one largest rectangle (shaded).33 34</pre>35<P>36 37<H2>Input</H2>38<p>39The input consists of maps preceded by an integer <I>m</I> 40indicating the number of input maps.41</p>42 43<dir>44<pre>45<I>m</I>46<I>map</I><SUB>1</SUB>47 48<I>map</I><SUB>2</SUB>49 50<I>map</I><SUB>3</SUB>51 52...53 54<I>map</I><SUB><I>m</I></SUB>55 56</pre>57</dir>58<p>59Two maps are separated by an empty line.<br>60Each  <I>map</I><SUB><I>k</I></SUB>  is in the following format:61</p>62<dir>63<pre>64<I> p p p p p </I>65<I> p p p p p </I>66<I> p p p p p </I>67<I> p p p p p </I>68<I> p p p p p </I>69</pre>70</dir>71<p>72Each <I>p</I> is a character either '1' or '0'.73Two <I>p</I>'s in the same line are separated by a space character.74Here, the character '1' shows a place suitable for reclamation75and '0' shows a sandy place.76Each map contains at least one '1'.77</p>78<H2>Output</H2>79<p>80The size of the largest81rectangle(s) for each input map should be shown each in a separate line.82</p>83<H2>Sample Input</H2>84<pre>853861 1 0 1 0870 1 1 1 1881 0 1 0 1890 1 1 1 0900 1 1 0 091 920 1 0 1 1930 1 0 1 0940 0 1 0 0950 0 1 1 0961 0 1 0 097 981 1 1 1 0990 1 1 1 01000 1 1 0 11010 1 1 1 01020 0 0 0 1103</pre>104 105<H2>Output for the Sample Input</H2>106<PRE>107410831098110</PRE>111 112 113