Advertisement
Guest User

Untitled

a guest
Jan 17th, 2019
59
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.65 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class prob9 {
  4. public static void main(String[] args) {
  5. Scanner in = new Scanner(System.in);
  6. int T = in.nextInt();
  7. while(T-->0) {
  8. String s1 = in.next();
  9. String s2 = in.next();
  10. if(s1.length()!=s2.length()) {
  11. System.out.println("NO");continue;
  12. }
  13.  
  14. s1+=s1;
  15. int key = hash(s2);
  16. System.out.println(key);
  17. System.out.println(mod);
  18. }
  19. }
  20.  
  21. final static int mod = (int) (1e9+7);
  22. private static int hash(String s2) {
  23. int x = 34;
  24. int ret = 0;
  25. for(int i=s2.length()-1; i>=0; i--) {
  26. ret += s2.charAt(i) * x;
  27. ret = ret % mod;
  28. x*=x;
  29. }
  30. return ret;
  31. }
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement