Two Sawmills

This problem has been modified to allow for subtasks and minimum scoring.

For Subtask 1 (17%): 2 <= n <= 150

For Subtask 2 (33%): 2 <= n <= 1000

For Subtask 3 (50%): No additional constraints



Submitting to 'Two Sawmills'


You're not logged in! Click here to login


Submitting to 'Two Sawmills'


You're not logged in! Click here to login


Submitting .cpp to 'Two Sawmills'


You're not logged in! Click here to login


Compile Errors


							
Time Limit: 0.1 Seconds
Memory Limit: 256MB
No. of ACs: 9
Your best score: 0
Source: CEOI 2004

Subtask Score
1 17
2 33
3 50
4 0