-
Notifications
You must be signed in to change notification settings - Fork 0
/
IITKWPCJ.cpp
82 lines (65 loc) · 1.56 KB
/
IITKWPCJ.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include<iostream>
#include<string>
#include<vector>
#include<stdio.h>
#define max 1000005
#include<string.h>
using namespace std;
int table[max];
int preprocess(string w,int n) {
int i,j,count;
table[0] = 0; i = 1; j = 0;
while(i<n){
if (w[i] == w[j])
table[i++] = ++j ;
else if(j == 0)
table[i++] = 0; //No prefix/suffix match
else
j = table[j-1];//That is, the suffix which is less than w[1..j]
}
if(table[n-1]>0 && (n)%(n-table[n-1])==0)
return n/((n)/(n-table[n-1])); //len/period
else
return -1;
}
int main( ) {
int t,i,n,count,flag;
string p,w,tstr;
int wroot,proot;
std::ios_base::sync_with_stdio(false);
cin>>t;
while(t--){
cin>>w;
cin>>p;
flag = 1;
if( w.size()>p.size()){
tstr = w;
w = p;
p = tstr;
}
wroot = preprocess(w,w.size() );
proot = preprocess(p,p.size() );
cout<<wroot<<" "<<proot<<endl;
if(wroot == -1 && proot == -1){
if(w==p) flag = 1; else flag = 0;
}
else if (wroot == -1 && proot != -1){
if(w.size()!=proot) flag=0;
else for(i=0;i<proot;i++) if(w[i]!=p[i]) flag = 0;
}
else if( wroot !=-1 && proot == -1)
flag = 0;
else {
if(wroot !=proot)
flag = 0;
else
for(i=0;i<wroot;i++)
if(w[i]!=p[i])
flag=0;
}
if(flag==0)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
}