当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2849：For Kisses

题目描述
WisKey has a little lovely sister named Sweet. One day Sweet wants play a game with him. The game rules like this, in the N*N girds, you can choose K girds to make any 4 of grids not rectangles vertexes, Sweet say if WisKey can find out the max K, she will give him a Kiss !!
WoW, this is a funny and cute challenge, everybody rise UP~
This is not rectangle.
This is a rectangle.
输入解释
The Sweet just has 9 questions, any questions have an N(N<=21). and WisKey want 9 Kisses!
输出解释
For each questions, output the max possible K.
输入样例 
1
2
3
4
5
6
7
13
21
输出样例 
1
3
.
.
.
提示
When N = 2, the one of the solutions is , so the max K is 3.
来自杭电HDUOJ的附加信息
Recommend gaojie
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2009 Multi-University Training Contest 4 - Host by HDU
源链接： HDU-2849
最后修改于 2020-10-25T22:57:28+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)