sailor

This problem has been modified to allow subtask grading.

Subtask 1 (13%): 1 <= N <= 1000

Subtask 2 (27%): 1 <= N <= 20000

Subtask 3 (60%): No additional constraints

Subtask 4 (0%): Sample Testcases


Time Limit: 4 Seconds
Memory Limit: 256MB
Your best score: 0
Source: CPSPC 2010

Subtask Score
1 13
2 27
3 60
4 0