skip to main
|
skip to sidebar
algorithms and random thoughts
Sunday, March 25, 2012
SRM 537 div2 clear
p925, find prerequisite chain and compute each element individually.
ans = sum of each a[i]
ans for a[i] = 1.0/length of prerequisite chain, if loop, then 0.0
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
Followers
Blog Archive
►
2019
(1)
►
February
(1)
►
2018
(3)
►
December
(1)
►
July
(2)
►
2016
(7)
►
June
(1)
►
March
(4)
►
February
(2)
►
2015
(5)
►
December
(1)
►
September
(1)
►
February
(1)
►
January
(2)
►
2013
(21)
►
November
(2)
►
August
(1)
►
June
(1)
►
May
(3)
►
April
(4)
►
March
(7)
►
February
(3)
▼
2012
(93)
►
December
(4)
►
November
(1)
►
October
(5)
►
September
(8)
►
August
(6)
►
July
(8)
►
June
(7)
►
May
(10)
►
April
(7)
▼
March
(13)
SRM 537 div2 clear
latex save/squeeze spacing
notes on linked list
SRM 537
bst to doubly linked list
check binary tree being binary search tree
list flatten
swap odd even position in linked list
sorting linked list
my facebook interview experience
emacs undo redo and cursor movement
SRM 536
my proof of Wilson's theorem
►
February
(14)
►
January
(10)
►
2011
(48)
►
December
(8)
►
November
(7)
►
October
(6)
►
September
(14)
►
August
(11)
►
July
(1)
►
June
(1)
►
2010
(14)
►
December
(1)
►
November
(4)
►
September
(2)
►
June
(5)
►
May
(1)
►
February
(1)
About Me
Li Yan
http://sites.google.com/site/lyan001002/topcoder
View my complete profile
No comments:
Post a Comment