Description: 2 ^ x mod n = 1 acm contest Give a number n, find the minimum that satisfies 2 x ^ x mod n = 1. In One positive integer put on each line. the value of n. Output If the minimum x exists, print a line with 2 ^ x mod n = 1. Print mod n ^ 2 = 1 oth erwise. You should replace x and n with specific numbers. Sample Sample Input Output 2 5 2 ^ = 2 mod 1 2 ^ 4 = mod 5 1
File list (Check if you may need any files):
Download