Thursday, December 8, 2011
TopCoder - SRM 515 DIV 2 - FortunateNumbers - getFortunate
As you can see in the problem statement just a simple brute force is enough to pass the time limit. I produce all combinations of a[i] + b[j] + c[k] for all i, j, k and check whether it is a fortunate number or not, if yes I insert the number in a set and finally I return the size of the set.
Subscribe to:
Post Comments (Atom)
-
Prime Cryptarithm The following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set ...
-
I don't know why, but I had a great misunderstanding of the problem statement from this sentence "FJ pours milk from one bucket t... -
Palindromic Squares Rob Kolstad Palindromes are numbers that read the same forwards as backwards. The number 12321 is a typical palindr...
No comments:
Post a Comment