Problems Description
<p class="MsoNormal"> <span style="font-family:宋体;font-weight:bold;font-size:15.0000pt;">相信五子棋大家都玩过吧,横着竖着斜着任意连成<span>5</span><span>items就获得了胜利,不过有一天</span><span>ZZT</span><span>和</span><span>ZX</span><span>两items人闲来无事在电脑上用画图玩起了一items新版的五子棋游戏,大概是这样的:他们先画了一items</span><span>N*M</span><span>的棋盘,然后</span><span>N*M</span><span>的棋盘上布满了相同的棋子,那么现在问,至少要在这items棋盘上拿走多少items棋子,可以使得整体局面都不能连成</span><span>5</span><span>items棋子。</span></span><span style="font-family:Calibri;font-weight:bold;font-size:15.0000pt;"></span> </p>
Input格式
<p class="MsoNormal"> <span style="font-family:宋体;font-size:12.0000pt;">输入File包含多组测试数据。Page 一行,给出一items整数 <span>T</span><span>(</span><span>T<=20</span><span>),为数据组数。</span></span><span style="font-family:Calibri;font-size:12.0000pt;"></span> </p> <p class="MsoNormal"> <span style="font-family:宋体;font-size:12.0000pt;">接下来有一行,points别代表<span>n,m</span><span>(</span><span>5<=n,m<=100</span><span>)。</span></span><span style="font-family:Calibri;font-size:12.0000pt;"></span> </p>
Output格式
<p class="MsoNormal"> <span style="font-family:宋体;font-size:12.0000pt;">输出一items答案,表示最少需要拿掉多少items棋子</span><span style="font-family:Calibri;font-size:12.0000pt;"></span> </p>
Sample
Sample Input 1
1
5 5
Sample Output 1
5
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪