Oh, got it, thanks!
Just 1 more query....regarding your print statement in the main function
Shouldn't you just print nonPeriodicStrs % m?
Read more… (23 words)
Active In
International Olympiad in Informatics
Indian Computing Olympiad (ICO)
Competitive Programming
Artificial Intelligence
Featured Contributions
NaN.
discussion
Periodic Strings (INOI 2015: India)
Problem in short: Given a positive integer N, find the number of binary strings of length N which are not periodic. Report the answer modulo M. The non-periodic strings of length 3 are 001, 010, 011, 100, 101, and 110. N <= 150,000.
Indian National Olympiad in Informatics (INOI) is ro...
Read more…(66 words)
reply in this discussion
NaN.
discussion
Periodic Strings (INOI 2015: India)
Problem in short: Given a positive integer N, find the number of binary strings of length N which are not periodic. Report the answer modulo M. The non-periodic strings of length 3 are 001, 010, 011, 100, 101, and 110. N <= 150,000.
Indian National Olympiad in Informatics (INOI) is ro...
Read more…(66 words)
reply in this discussion
Thanks a lot. It's mostly clear, but I didn't understand your modMexp function....
Like, for n=m=3,
res=1, then res=2 and then res=2; res=4, res=1; res=2, res=2 (finally)
So, for 2^2, isn't your program calculating ((2 mod m)2)mod m instead of (2 mod m)(2 mod m)mod m
Read more… (46 words)
NaN.
discussion
Periodic Strings (INOI 2015: India)
Problem in short: Given a positive integer N, find the number of binary strings of length N which are not periodic. Report the answer modulo M. The non-periodic strings of length 3 are 001, 010, 011, 100, 101, and 110. N <= 150,000.
Indian National Olympiad in Informatics (INOI) is ro...
Read more…(66 words)
reply in this discussion