Hangzhou Electric HDU ACM 1395 2^x mod n = 1

Source: Internet
Author: User

2^X mod n = 1 Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 13610 Accepted Submission (s): 4208


Problem descriptiongive a number n, find the minimum x (x>0) that satisfies 2^x mod n = 1.

Inputone positive integer on each line, the value of N.

Outputif the minimum x exists, print a line with 2^x mod n = 1.

Print 2^? MoD n = 1 otherwise.

You should replace x and n with specific numbers.

Sample Input
25

Sample Output
2^? MoD 2 = 12^4 MoD 5 = 1

Authorma, Xiao to x increments, each step modulo, ls array records whether this remainder has occurred, if there has been, then the next bound to loop, so there is a repetition can jump.
#include <iostream>using namespace Std;int main () {int N,i,j;while (cin>>n) {int Ls[10000];int sum=1;memset ( Ls,0,sizeof (LS)), for (i=1;; i++) {sum*=2;sum%=n;if (sum==1) {cout<< "2^" <<i<< "mod" <<n< < "= 1" <<endl;break;} if (Ls[sum]) {cout<< "2^ mod" <<n<< "=" << "1" <<endl; break;} ls[sum]=1;}} return 0;}

Hangzhou Electric HDU ACM 1395 2^x mod n = 1

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.