OJ Board

Thank you for your response, bradd123. :] I have fixed my code to handle the test case you mentioned, but after submitting my code, I was given another WA. I have tested my code on ideone on a few other test cases: https://ideone.com/xf0xyO Code: #include "bits/stdc++.h" #define maxn 105 u...

Hello. I've been having trouble solving this problem. It seems to require simply trying all possible combinations and using a BFS to find the shortest distance. Perhaps I am getting stuck on a corner case. https://ideone.com/fMSQW5 #include "bits/stdc++.h" #define maxn 105 using namespace ...

I have passed all of Brianfry's test cases, but my code is still getting the Wrong Answer verdict. Are there any corner cases? I basically find N's two divisors, calculate the phi( N ), and find e's modular inverse with respect to phi( N ) using Extended Euclid. After that we are able to simple use ...