CoolFace
Datasetpublic

FPEvalDataset/LeetCodeProblem

sourceHugging Faceupdated 8mo agoView on Hugging Face
0likes305downloads
1{2    "id": 3626,3    "name": "smallest_divisible_digit_product_i",4    "difficulty": "Easy",5    "link": "https://leetcode.com/problems/smallest-divisible-digit-product-i/",6    "date": "2024-10-26 00:00:00",7    "task_description": "You are given two integers `n` and `t`. Return the **smallest** number greater than or equal to `n` such that the **product of its digits** is divisible by `t`. **Example 1:** **Input:** n = 10, t = 2 **Output:** 10 **Explanation:** The digit product of 10 is 0, which is divisible by 2, making it the smallest number greater than or equal to 10 that satisfies the condition. **Example 2:** **Input:** n = 15, t = 3 **Output:** 16 **Explanation:** The digit product of 16 is 6, which is divisible by 3, making it the smallest number greater than or equal to 15 that satisfies the condition. **Constraints:** `1 <= n <= 100` `1 <= t <= 10`",8    "public_test_cases": [9        {10            "label": "Example 1",11            "input": "n = 10, t = 2",12            "output": "10 "13        },14        {15            "label": "Example 2",16            "input": "n = 15, t = 3",17            "output": "16 "18        }19    ],20    "private_test_cases": [21        {22            "input": [23                80,24                1025            ],26            "output": 8027        },28        {29            "input": [30                95,31                1032            ],33            "output": 10034        },35        {36            "input": [37                79,38                539            ],40            "output": 8041        },42        {43            "input": [44                61,45                146            ],47            "output": 6148        },49        {50            "input": [51                79,52                253            ],54            "output": 8055        },56        {57            "input": [58                96,59                1060            ],61            "output": 10062        },63        {64            "input": [65                97,66                267            ],68            "output": 9869        },70        {71            "input": [72                9,73                574            ],75            "output": 1076        },77        {78            "input": [79                92,80                781            ],82            "output": 9783        },84        {85            "input": [86                41,87                488            ],89            "output": 4190        }91    ],92    "haskell_template": "smallestNumber :: Int -> Int -> Int\nsmallestNumber n t ",93    "ocaml_template": "let smallestNumber (n: int) (t: int) : int =  ",94    "scala_template": "def smallestNumber(n: Int,t: Int): Int = { \n    \n}",95    "java_template": "class Solution {\n    public int smallestNumber(int n, int t) {\n        \n    }\n}",96    "python_template": "class Solution(object):\n    def smallestNumber(self, n, t):\n        \"\"\"\n        :type n: int\n        :type t: int\n        :rtype: int\n        \"\"\"\n        "97}