StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Rating Stats for

Mikhail Kasparyan

Rating
1477.64 (4,504,662nd) 		Reputation
125 (622,564th)
Page: 1
Title Δ
How do I find mod of large C(n , r) +4.23
Read integer data from a file -3.03
getting TLE in Spoj-Hotels 0.00
Finding Squares on the chessboard attackable by a rook -3.82
Recursive merge sort of two Linked Lists using third reference -3.67
how to write recurrence equation for this algorithm? -1.92
How wrapper objects work? -2.76
TLE in codeforces's Dijkstra 0.00
maximum sum in IPL matches +0.81
Algorithm: NON-contiguous subsequence with the sum no greater than... +0.78
Find the biggest square constructed from a single number +0.38
How to calculate O(n) for two variables that increases differently... 0.00
Series for finding compound interest 0.00
3n+1 on UVa (C++) -3.57
`3n` distinct elements and finding two values, `x < y`? -1.11
if f(n) = o(g(n)), does g(n) + f(n)=Θ(g(n))? -2.04
Algorithm to divide a set of symbols with constraints into minimum... -4.45
Creating a Christmas tree using only while loops -2.18
Calculating Time Complexity of recursice function 0.00