Codeforces Round #117 (Div. 2)-D. Common Divisors(KMP)

原题链接

D. Common Divisors

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has recently learned at school what a number's divisor is and decided to determine a string's divisor. Here is what he came up with.

String a is the divisor of string b if and only if there exists a positive integer x such that if we write out string a consecutively x times, we get string b. For example, string "abab" has two divisors — "ab" and "abab".

Now Vasya wants to write a program that calculates the number of common divisors of two strings. Please help him.

Input

The first input line contains a non-empty string s1.

The second input line contains a non-empty string s2.

Lengths of strings s1 and s2 are positive and do not exceed 105. The strings only consist of lowercase Latin letters.

Output

Print the number of common divisors of strings s1 and s2.

Examples

input

abcdabcd
abcdabcdabcdabcd

output

2

input

aaa
aa

output

1

用KMP求出每个字符串的next数组，再求字符串s的最小divisors的长度，设字符串长度len, divisor长度d = len - next[len], 若len % d != 0, 则d = len

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#define maxn 1000005
#define MOD 1000000007
using namespace std;
typedef long long ll;

char s1[maxn], s2[maxn];
int next1[maxn], next2[maxn];
void KMP(char *str, int *next){
	
	int i = 0, k = -1;
	next[0] = -1;
	while(str[i]){
		if(k == -1 || str[k] == str[i]){
			k++;
			i++;
			next[i] = k;
		}
		else
		 k = next[k];
	}
}
int main(){
//	freopen("in.txt", "r", stdin);
	scanf("%s%s", s1, s2);
	KMP(s1, next1);
	KMP(s2, next2);
	int len1 = strlen(s1);
	int len2 = strlen(s2);
	int m1 = len1 - next1[len1];
	int m2 = len2 - next2[len2];
	if(len1 % m1 == 0){
		s1[m1] = 0;
		m1 = len1 / m1;
	}
	else{
		m1 = 1;
	}
	if(len2 % m2 == 0){
		s2[m2] = 0;
		m2 = len2 / m2;
	}
	else{
		m2 = 1;
	}
	if(strcmp(s1, s2)){
		puts("0");
	}
	else{
	    int ans = 0;
	    for(int i = 1; i <= min(m1, m2); i++){
	    	if(m1 % i == 0 && m2 % i == 0)
	    	 ans++;
	    }
	    printf("%d\n", ans);
	}
	return 0;
}