UVA - 10276
2018-03-25 09:44
260 查看
PS:刚开始没读请题,后来多列几个就可以发现规律了。
AC:
#include<stdio.h>
int main()
{
int t,n,m,s;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
if(n%2==0)
{
m=n/2;
s=n*m+n-1;
}
else
{
m=n/2+1;
s=n*m+m-1;
}
printf("%d\n",s);
}
return 0;
}
AC:
#include<stdio.h>
int main()
{
int t,n,m,s;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
if(n%2==0)
{
m=n/2;
s=n*m+n-1;
}
else
{
m=n/2+1;
s=n*m+m-1;
}
printf("%d\n",s);
}
return 0;
}
相关文章推荐
- uva 10276 汉诺塔卷土重来
- UVa10276 HDU1329 ZOJ1239 Hanoi Tower Troubles Again!【递推函数+打表】
- uva10276 hanoi tower troubles again
- UVA 10276 - Hanoi Tower Troubles Again!
- UVa Problem 10276 Hanoi Tower Troubles Again! (汉诺塔卷土重来!)
- Uva-10276-Hanoi Tower Troubles Again!
- uva 10276 / pc 110908
- UVA - 12171 Sculpture(离散化+bfs)
- uva10404 - Bachet's Game(博弈,递推)
- UVA - 10905 Children's Game
- 3-11 uva 1588 - Kickdown
- UVa 11586 - Train Tracks
- UVA 11198 Dancing Digits
- uva 10972 - RevolC FaeLoN(边双连通分量)
- UVA 1339 Ancient Cipher——快速排序
- Uva 10387 Billiard
- uva 993 Product of digits
- UVA 10917 Walk Through the Forest SPFA
- UVa 387 - A Puzzling Problem
- UVALive 6811 Irrigation Lines(匈牙利算法)