So this is a problem. You have number N (N<=10^100000). You need to change smallest possible number of digits in that number to make that number GOOD. Number is GOOD if the digits on I th and J th positiona are same, and every number between them is same with them too.(all same digits in number m...

Set of subsets without subsubsets You are given two integers \$n\$ and \$k\$, and are to output a random collection of \$k\$ sets \$\mathcal A_1,\ldots,\mathcal A_k\$ such that: each \$\mathcal A_i\$ is a subset of \$\{1, 2, \ldots, n\}\$; no \$\mathcal A_i\$ is a subset of another \$\mathcal A_...