All submissions for this problem are available.
Himanshu just got acquainted with the Diffie-Hellman key agreement protocol. He got so excited that he wanted to try out the protocol with Himanshu (the other one). He was all set to exchange the key just when he realized that he doesn't know how to find the generator of a multiplicative group Zp given a large prime number p.
Can you help Himanshu in calculating the kth generator greater than a = 6969696969696969696969 of the multiplicative group Zp given p = 671998030559713968361666935769 and k = 10000.
kth generator greater than a of the multiplicative group Zp.
Info about Submission
You just have to print the final answer. Rest you have to put the source code/ abstract of your solution inside the comments for plagiarism checking.
Sample Submission (c++)
using namespace std;
/* Put your source code here inside comments for plagiarism checking */
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, NODEJS, SCALA, PERL, JS, PERL6, PYP3|
Fetching successful submissions
If you are still having problems, see a sample solution here.