We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Project Euler #76: Counting summations
Project Euler #76: Counting summations
Sort by
recency
|
16 Discussions
|
Please Login in order to post a comment
C# Code
using System;
class Program { static ulong GetWays(int n) { ulong[] a = new ulong[n + 1]; a[0] = 1;
}
Python 3 solution:
For reference visit Partition of Integers.
Python O(1) sol:
the number of partitions from [0-1000] is here for check some testcase