HDU5874

最新推荐文章于 2019-05-23 20:50:42 发布

weixin_30263073

最新推荐文章于 2019-05-23 20:50:42 发布

阅读量109

点赞数

CC 4.0 BY-SA版权

文章标签： java

原文链接：http://www.cnblogs.com/Penn000/p/5861017.html

Friends and Enemies

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 171 Accepted Submission(s): 100

Problem Description

On an isolated island, lived some dwarves. A king (not a dwarf) ruled the island and the seas nearby, there are abundant cobblestones of varying colors on the island. Every two dwarves on the island are either friends or enemies. One day, the king demanded that each dwarf on the island (not including the king himself, of course) wear a stone necklace according to the following rules:

  For any two dwarves, if they are friends, at least one of the stones from each of their necklaces are of the same color; and if they are enemies, any two stones from each of their necklaces should be of different colors. Note that a necklace can be empty.

  Now, given the population and the number of colors of stones on the island, you are going to judge if it's possible for each dwarf to prepare himself a necklace.

Input

Multiple test cases, process till end of the input.

For each test case, the one and only line contains 2 positive integers

Output

For each test case, The one and only line of output should contain a character indicating if it is possible to finish the king's assignment. Output ``T" (without quotes) if possible, ``F" (without quotes) otherwise.

Sample Input

20 100

Sample Output

Source

2016 ACM/ICPC Asia Regional Dalian Online

最后竟成了找规律。。

1 0

2 1

3 2

4 4

5 6

6 9

7 12

8 16

9 20

10 25

11 30

12 36

13 42

......

 1 //2016.9.10
 2 #include <iostream>
 3 #include <cstdio>
 4 
 5 using namespace std;
 6 
 7 long long fun(int m)
 8 {
 9     long long ans;
10     ans = (m/2)*(m/2);
11     if(m%2)ans += (m/2);
12     return ans;
13 }
14 
15 int main()
16 {
17     long long n, m, res;
18     while(scanf("%lld%lld", &m, &n)!=EOF)
19     {
20         res = fun(m);
21         if(n>=res)
22           printf("T\n");
23         else printf("F\n");
24     }
25 
26     return 0;
27 }