Haiku vs Deepseek
yes
Prompt
Write a function to find the number of ways to partition a set of Bell numbers. Your function should satisfy these tests: ```python assert bell_number(2)==2 assert bell_number(10)==115975 assert bell_number(56)==6775685320645824322581483068371419745979053216268760300 ```
Answer guidance
Reference solution: def bell_number(n): bell = [[0 for i in range(n+1)] for j in range(n+1)] bell[0][0] = 1 for i in range(1, n+1): bell[i][0] = bell[i-1][i-1] for j in range(1, i+1): bell[i][j] = bell[i-1][j-1] + bell[i][j-1] return bell[n][0]
AnthropicDrag to resize
DeepSeekDrag to resize