using System;
using System.Collections.Generic;
using System.Linq;
/*
Generate k random positive integers that sum to n.
Algorithm (stick-breaking / random composition):
------------------------------------------------
1. We choose (k - 1) random "cut points" in the range [1, n - 1].
These represent where we "break" the integer n into k parts.
2. Sort the cut points.
3. Compute the differences between consecutive points
(including 0 and n as boundaries). These differences
are the k positive integers that sum to n.
This produces a uniformly random composition of n.
*/
/*
Paper Run (Dry Run) of the Random-Sum Program
---------------------------------------------
Input:
n = 50
k = 7
We need (k - 1) = 6 random cut points in the range [1, 49].
Simulated rand() outputs (rand() % 49):
12, 3, 40, 25, 7, 33
After adding +1 (because the code uses 1 + rand() % (n - 1)):
cuts = {13, 4, 41, 26, 8, 34}
Step 1: Sort the cut points
cuts → {4, 8, 13, 26, 34, 41}
Step 2: Convert cut points into segment lengths
prev = 0
out[0] = 4 - 0 = 4
prev = 4
out[1] = 8 - 4 = 4
prev = 8
out[2] = 13 - 8 = 5
prev = 13
out[3] = 26 - 13 = 13
prev = 26
out[4] = 34 - 26 = 8
prev = 34
out[5] = 41 - 34 = 7
prev = 41
out[6] = 50 - 41 = 9 (final segment)
Final result:
parts = {4, 4, 5, 13, 8, 7, 9}
Verification:
4 + 4 + 5 + 13 + 8 + 7 + 9 = 50
Output:
Random parts that sum to 50:
4 4 5 13 8 7 9
Sum = 50
*/
class Program
{
// Generate k random positive integers that sum to n
static List<int> GenerateRandomSum(int n, int k)
{
if (k <= 0 || n < k) {
// k positive integers must sum to n → minimum sum is k
throw new ArgumentException("Invalid n or k");
}
Random rng = new Random(); // .NET's standard PRNG
List<int> cuts = new List<int>(capacity: k - 1);
// Generate (k - 1) random cut points in [1, n - 1]
for (int i = 0; i < k - 1; i++) {
cuts.Add(1 + rng.Next(n - 1));
}
// Sort the cut points so we can compute segment lengths
cuts.Sort();
List<int> result = new List<int>(capacity: k);
int prev = 0;
// Convert cut points into segment lengths
foreach (int c in cuts) {
result.Add(c - prev);
prev = c;
}
// Last segment: from last cut to n
result.Add(n - prev);
return result;
}
static void Main()
{
int n = 50; // total sum
int k = 7; // number of random parts
List<int> parts = GenerateRandomSum(n, k);
Console.WriteLine("Random parts that sum to " + n + ":");
foreach (int x in parts) {
Console.Write(x + " ");
}
Console.WriteLine();
// Verify sum
int sum = parts.Sum();
Console.WriteLine("Sum = " + sum);
}
}
/*
run:
Random parts that sum to 50:
10 2 22 2 2 11 1
Sum = 50
*/
