Supposing he had 2 friends.
The bottom row shows the maximum amount they can use the site without exceeding their limit. 0 + 1 = 1. If C is 1 or less than no one has come in to many times.
How about 3 friends:
The maximum amout is 0 + 1 + 2 = 3
For 4 friends:
The maximum number without anyone exceeding his limit is 0 + 1 + 2 + 3 = 6
For 5 friends:
0 + 1 + 2 + 3 + 4 = 10
if their is one more than this number than someone has reached his limit.
Can you finish now?
]]>
I am not following you. The first friend ( i = 1 ) can visit at most 1 time. So wouldn't the minimum value of C be 1? That could mean friend #1 has been here the maximum.
]]>