{"problem":{"name":"Exactly N points","description":{"content":"The problem set at _CODE FESTIVAL 20XX Finals_ consists of $N$ problems. The score allocated to the $i$\\-th $(1≦i≦N)$ problem is $i$ points. Takahashi, a contestant, is trying to score exactly $N$ poi","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"codefestival_2016_final_b"},"statements":[{"statement_type":"Markdown","content":"The problem set at _CODE FESTIVAL 20XX Finals_ consists of $N$ problems.\nThe score allocated to the $i$\\-th $(1≦i≦N)$ problem is $i$ points.\nTakahashi, a contestant, is trying to score exactly $N$ points. For that, he is deciding which problems to solve.\nAs problems with higher scores are harder, he wants to minimize the highest score of a problem among the ones solved by him.\nDetermine the set of problems that should be solved.\n\n## Constraints\n\n*   $1≦N≦10^7$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n\n## Partial Score\n\n*   $200$ points will be awarded for passing the test set satisfying $1≦N≦1000$.\n*   Additional $100$ points will be awarded for passing the test set without additional constraints.\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"codefestival_2016_final_b","tags":[],"sample_group":[["4","1\n3\n\nSolving only the $4$\\-th problem will also result in the total score of $4$ points, but solving the $1$\\-st and $3$\\-rd problems will lower the highest score of a solved problem."],["7","1\n2\n4\n\nThe set ${3,4}$ will also be accepted."],["1","1"]],"created_at":"2026-03-03 11:01:13"}}