Vicfred
Reputation
1,012
Top tag
Next privilege 2,000 Rep.
 Apr13 comment Determine if a rectagle is fully “compatible” with a given Polyomino code.google.com/codejam/contests.html scroll down, there's analysis for every major past contest Apr13 comment Determine if a rectagle is fully “compatible” with a given Polyomino They provided analysis of past contests' (as you can see on the page), I don't see why they wouldn't provide it this year. Apr13 comment Determine if a rectagle is fully “compatible” with a given Polyomino this was problem D of the last google code jam, I guess they will post an analysis of the solution Feb27 comment Elementary algebraic question about finite-fields. Since you can have polynomials of every degree F[x] must be infinite and F^n is finite so F[x] can't be a subset of F^n. Nov22 awarded Popular Question Sep16 awarded Yearling Jul2 awarded Curious May3 awarded Favorite Question Feb19 awarded Good Answer Feb14 comment How many positive integers $< 1{,}000{,}000$ contain the digit $2$? @WinMc yeah, I take part in codeforces and topcoder that's why I'm trying to improve my dynamic programming skills with problems like this so I'm looking where can I learn. Feb14 comment How many positive integers $< 1{,}000{,}000$ contain the digit $2$? can you give me one reference where I can learn this kind of things? (counting+recurrences) Feb4 awarded Notable Question Jan11 accepted Looking for counterexample in graph theory Jan11 comment Looking for counterexample in graph theory thanks, the first one was the bolder one :) Jan11 asked Looking for counterexample in graph theory Jan10 awarded Favorite Question Dec17 awarded Organizer Dec17 revised Why does the exponential generating function approach fail here? added 'generating-functions' tag Dec17 suggested approved edit on Why does the exponential generating function approach fail here? Nov9 awarded Popular Question