{"id":"964b7a2d-47de-424d-b9ad-394b3e140eb2","name":"Take A Guess","description":"<a href=\"https://codeforces.com/problemset/problem/1556/D\">https://codeforces.com/problemset/problem/1556/D</a>","inputFormat":".","outputFormat":".","constraints":".","sampleCode":{"cpp":{"code":""},"java":{"code":"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\r\n public static void main(String[] args) throws IOException {\r\n\r\n }\r\n}"},"ruby":{"code":""},"python":{"code":""},"javascript":{"code":""}},"points":10,"difficulty":"medium","sampleInput":"1","sampleOutput":"1","questionVideo":"","hints":[],"associated":[],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"13407d1b-a1ba-4b3f-aea1-547250154b34","name":"Interactive problems For Experts","slug":"interactive-problems-for-experts-978","type":0},{"id":"dca2d353-6de3-4324-bd16-0236dde7dac0","name":"Take A Guess","slug":"take-a-guess","type":1}],"next":{"id":"9ccef653-1f0e-4334-a6ab-69d65110fd7c","name":"Nastia And A Hidden Permutation","type":1,"slug":"nastia-and-a-hidden-permutation"},"prev":{"id":"da19ccd7-2ca0-43d9-b64a-8ed65ffd00d2","name":"Tree Diameter","type":1,"slug":"tree-diameter"}}}

Take A Guess

<a href="https://codeforces.com/problemset/problem/1556/D">https://codeforces.com/problemset/problem/1556/D</a>

{"id":"964b7a2d-47de-424d-b9ad-394b3e140eb2","name":"Take A Guess","description":"<a href=\"https://codeforces.com/problemset/problem/1556/D\">https://codeforces.com/problemset/problem/1556/D</a>","inputFormat":".","outputFormat":".","constraints":".","sampleCode":{"cpp":{"code":""},"java":{"code":"import java.io.*;\r\nimport java.util.*;\r\n\r\npublic class Main {\r\n\r\n public static void main(String[] args) throws IOException {\r\n\r\n }\r\n}"},"ruby":{"code":""},"python":{"code":""},"javascript":{"code":""}},"points":10,"difficulty":"medium","sampleInput":"1","sampleOutput":"1","questionVideo":"","hints":[],"associated":[],"solutionSeen":false,"tags":[],"meta":{"path":[{"id":0,"name":"home"},{"id":"0c54b191-7b99-4f2c-acb3-e7f2ec748b2a","name":"Data Structures and Algorithms","slug":"data-structures-and-algorithms","type":0},{"id":"13407d1b-a1ba-4b3f-aea1-547250154b34","name":"Interactive problems For Experts","slug":"interactive-problems-for-experts-978","type":0},{"id":"dca2d353-6de3-4324-bd16-0236dde7dac0","name":"Take A Guess","slug":"take-a-guess","type":1}],"next":{"id":"9ccef653-1f0e-4334-a6ab-69d65110fd7c","name":"Nastia And A Hidden Permutation","type":1,"slug":"nastia-and-a-hidden-permutation"},"prev":{"id":"da19ccd7-2ca0-43d9-b64a-8ed65ffd00d2","name":"Tree Diameter","type":1,"slug":"tree-diameter"}}}
plane

Editor

Loading...

Take A Guess

medium

https://codeforces.com/problemset/problem/1556/D

Constraints

.

Format

Input

.

Output

.

Example

Sample Input

1

Sample Output

1

Discussions

Show Discussion

Related Resources

related resources

Turning Off Zen Mode