Reputation
1,047
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
2 15 28
Impact
~62k people reached

  • 0 posts edited
  • 1 helpful flag
  • 1,451 votes cast
Aug
25
awarded  Notable Question
Apr
22
awarded  Citizen Patrol
Apr
13
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
Apr
13
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.
Apr
13
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
Feb
27
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.
Nov
22
awarded  Popular Question
Sep
16
awarded  Yearling
Jul
2
awarded  Curious
May
3
awarded  Favorite Question
Feb
19
awarded  Good Answer
Feb
14
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.
Feb
14
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)
Feb
4
awarded  Notable Question
Jan
11
accepted Looking for counterexample in graph theory
Jan
11
comment Looking for counterexample in graph theory
thanks, the first one was the bolder one :)
Jan
11
asked Looking for counterexample in graph theory
Jan
10
awarded  Favorite Question
Dec
17
awarded  Organizer
Dec
17
revised Why does the exponential generating function approach fail here?
added 'generating-functions' tag