Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class prob9 {
- public static void main(String[] args) {
- Scanner in = new Scanner(System.in);
- int T = in.nextInt();
- while(T-->0) {
- String s1 = in.next();
- String s2 = in.next();
- if(s1.length()!=s2.length()) {
- System.out.println("NO");continue;
- }
- s1+=s1;
- int key = hash(s2);
- System.out.println(key);
- System.out.println(mod);
- }
- }
- final static int mod = (int) (1e9+7);
- private static int hash(String s2) {
- int x = 34;
- int ret = 0;
- for(int i=s2.length()-1; i>=0; i--) {
- ret += s2.charAt(i) * x;
- ret = ret % mod;
- x*=x;
- }
- return ret;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement