File size: 3,781 Bytes
24e07f8 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 | {
"id": 3279,
"name": "alice_and_bob_playing_flower_game",
"difficulty": "Medium",
"link": "https://leetcode.com/problems/alice-and-bob-playing-flower-game/",
"date": "2024-01-21 00:00:00",
"task_description": "Alice and Bob are playing a turn-based game on a circular field surrounded by flowers. The circle represents the field, and there are `x` flowers in the clockwise direction between Alice and Bob, and `y` flowers in the anti-clockwise direction between them. The game proceeds as follows: Alice takes the first turn. In each turn, a player must choose either the clockwise or anti-clockwise direction and pick one flower from that side. At the end of the turn, if there are no flowers left at all, the **current** player captures their opponent and wins the game. Given two integers, `n` and `m`, the task is to compute the number of possible pairs `(x, y)` that satisfy the conditions: Alice must win the game according to the described rules. The number of flowers `x` in the clockwise direction must be in the range `[1,n]`. The number of flowers `y` in the anti-clockwise direction must be in the range `[1,m]`. Return _the number of possible pairs_ `(x, y)` _that satisfy the conditions mentioned in the statement_. **Example 1:** ``` **Input:** n = 3, m = 2 **Output:** 3 **Explanation:** The following pairs satisfy conditions described in the statement: (1,2), (3,2), (2,1). ``` **Example 2:** ``` **Input:** n = 1, m = 1 **Output:** 0 **Explanation:** No pairs satisfy the conditions described in the statement. ``` **Constraints:** `1 <= n, m <= 105`",
"public_test_cases": [
{
"label": "Example 1",
"input": "n = 3, m = 2",
"output": "3 "
},
{
"label": "Example 2",
"input": "n = 1, m = 1",
"output": "0 "
}
],
"private_test_cases": [
{
"input": [
76449,
82807
],
"output": 3165256171
},
{
"input": [
37149,
7947
],
"output": 147611551
},
{
"input": [
65876,
54651
],
"output": 1800094638
},
{
"input": [
83462,
43930
],
"output": 1833242830
},
{
"input": [
85778,
70262
],
"output": 3013466918
},
{
"input": [
85146,
43396
],
"output": 1847497908
},
{
"input": [
31445,
22823
],
"output": 358834617
},
{
"input": [
15704,
32979
],
"output": 258951108
},
{
"input": [
74462,
73807
],
"output": 2747908417
},
{
"input": [
53354,
74360
],
"output": 1983701720
}
],
"haskell_template": "flowerGame :: Int -> Int -> Int\nflowerGame n m ",
"ocaml_template": "let flowerGame (n: int) (m: int) : int = ",
"scala_template": "def flowerGame(n: Int,m: Int): Int = { \n \n}",
"java_template": "class Solution {\n public long flowerGame(int n, int m) {\n \n }\n}",
"python_template": "class Solution(object):\n def flowerGame(self, n, m):\n \"\"\"\n :type n: int\n :type m: int\n :rtype: int\n \"\"\"\n "
} |