/*百度变态的另类游戏(组合问题)
*autor: zqh 2009.3.
*/
import java.util.*;
class Baidu_3
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("输入数据: 输入的数, 可能的排列情况:");
int count = 0;
while (count <4)
{
System.out.print("N : ");
int n = sc.nextInt();
System.out.print("K : ");
int k = sc.nextInt();
count ++;
if (k == n * (n - 1) / 2)
System.out.println("yes");
if (n % 2 == 0)
{
for (int i = 0; i <= n/2 ;i++ )
{
if (k == i*(n - i) )
System.out.println("yes");
}
}
else
{
for (int i = 1; i <= (n - 1) / 2;i++ )
{
if (k == i*(n - i) )
System.out.println("yes");
}
}
}
}
}
Baidu_star试题java实现(2)
最新推荐文章于 2024-08-12 15:45:48 发布