HDU5874-Friends and Enemies

Friends and Enemies

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

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  M,N (M,N<231)  representing the total number of dwarves (not including the king) and the number of colors of stones on the island.

 

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

  
  

   
   T
  
  

 

Source

2016 ACM/ICPC Asia Regional Dalian Online

    题目大意: 就是有m个人n种颜色的石头m个人中每两个人不是朋友就是敌人现在他们每个人要用石头要串一条项链，要求是 
    1.朋友之间的项链至少有一个相同颜色的石头 
    2.敌人之间没有颜色相同的石头 
    3.项链可以使空的就是不串石头 
    问n种颜色的石头能不能满足这m个人
    解题思路：x中的人互相敌对，y中的人互相敌对，并且x和y中的人互相友好时需要的颜色为x*y，而x+y=m,所以颜色n要大于等于m/2*(m-m/2)才行。

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>

using namespace std;

#define ll long long

int main()
{
    int n,m;
    while(~scanf("%d %d",&m,&n))
    {
        if(n>=1ll*m*m/4) printf("T\n");
        else printf("F\n");
    }
    return 0;
}