Coding Problems
127 problems · 127 shown
| XP | Status | ||||||
|---|---|---|---|---|---|---|---|
| CT944 | Distribute n Items With Lower Bounds on Each Bin | — | — | — | — | Unsolved | |
| CT943 | Solve x1+x2+...+xk = n With xi <= b (Inclusion-Exclusion) | — | — | — | — | Unsolved | |
| CT942 | Count Multisets of Size k From n Types | — | — | — | — | Unsolved | |
| CT940 | Count Ways to Distribute n Candies Among k Children | — | — | — | — | Unsolved | |
| CT939 | Bitmask Inclusion-Exclusion Over Subsets | — | — | — | — | Unsolved | |
| CT938 | Count Surjections (Onto Functions) from m to n | — | — | — | — | Unsolved | |
| CT937 | Count Integers <= N Divisible by at Least One of k Primes | — | — | — | — | Unsolved | |
| CT936 | Solve Linear Recurrence with Kitamasa | — | — | — | — | Unsolved | |
| CT935 | Compute Catalan Numbers mod p | — | — | — | — | Unsolved | |
| CT934 | Count the Number of Partitions of n | — | — | — | — | Unsolved | |
| CT933 | Random Walk: Expected Steps to Return | — | — | — | — | Unsolved | |
| CT932 | Bayes: Spam Classification | — | — | — | — | Unsolved | |
| CT931 | Expected Value of Dice Sum Simulation | — | — | — | — | Unsolved | |
| CT930 | Monte Carlo: Estimate ¤Ç by Random Points | — | — | — | — | Unsolved | |
| CT929 | Binomial Coefficients: Pascal's Triangle mod p | — | — | — | — | Unsolved | |
| CT928 | Derangements: Count Permutations with No Fixed Points | — | — | — | — | Unsolved | |
| CT927 | Count the Number of Distinct Subsequences | — | — | — | — | Unsolved | |
| CT926 | Compute nCr mod p Using Precomputed Factorials | — | — | — | — | Unsolved | |
| CT925 | The Sorted Matrix: Search in a Row-Column Sorted Matrix | — | — | — | — | Unsolved | |
| CT924 | The Range Finder: Locate the Search Range Efficiently | — | — | — | — | Unsolved |
Showing 1–20 of 127
…