Hello, I was asked this in my ICPC qualifiers. Are there any good algorithms to solve Cryptarithmetic problems http://en.wikipedia.org/wiki/Send%2Bmore%3Dmoney
likeSEND+MOREMONEYwhere each character should be assigned a unique digit.One more constraint i got was to sort the answer by
Pardon the newbie who was so into implementing it as DP, But could someone tell me the Binary Search method for this problem?On 10/12/06, Prunthaban Kanthakumar
[EMAIL PROTECTED] wrote:
Yep.
It is Binary Search.
Greedy will not work :-(
My quick thuoght had dome flaws... :(
On 10/11/06,
.
On 12/24/05, Rave Hanker [EMAIL PROTECTED]
wrote:
Hello,I came across this prob.
acm.mipt.ru/judge. Well a good permutation for any number n in a permutation containing 2...n+1 where each A[i] is divisible by i for 1=i=n. The problem is to find all Good pems. I tried two techniques 1. Dynamic
