Create a gist now

Instantly share code, notes, and snippets.

int N(int n, int k) {
if (n == 0) return k == 0 ? 1 : 0;
return (N(n-1, k-1) + N(n-1, k)*(n-1-k)) + N(n-1, k+1)*(k+1) % 2810;
}
int num[] = {N(3,6)+105,N(8,5)-2,102,N(8,5)-1,64,97+N(3,6),
108,98,101,N(8,5)+2,116,N(8,5)-1,N(8,5),
97,115,99,97,(N(8,6)*2)-10,105,N(8,5)+4};
for ( auto n : num )
printf ( "%c", n );
printf ( "\n" );
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment