#include<iostream>
#include<set>
using namespace std;
typedef long long LL;
set<LL>S;
char A[9999],B[9999];
LL Al,Bl,i,j,k;
LL H[30];
int main()
{
for(i=25,k=1;i>=0;i--,k*=(i+1))
H[i]=k;
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>A>>B;
for(Al=0;A[Al];Al++);
for(Bl=0;B[Bl];Bl++);
for(i=min(Al,Bl);i>0;i--)
{
S.clear();
k=0;
for(j=0;j<i;j++)
k+=H[A[j]-97];
S.insert(k);
for(j=0;j<Al-i;j++)
{
k+=H[A[j+i]-97]-H[A[j]-97];
S.insert(k);
}
k=0;
for(j=0;j<i;j++)
k+=H[B[j]-97];
if(S.find(k)!=S.end())
{
cout<<i<<endl;
return 0;
}
for(j=0;j<Bl-i;j++)
{
k+=H[B[j+i]-97]-H[B[j]-97];
if(S.find(k)!=S.end())
{
cout<<i<<endl;
return 0;
}
}
}
cout<<0<<endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
380 KB |
Output is correct |
2 |
Incorrect |
3 ms |
456 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
20 ms |
456 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
131 ms |
536 KB |
Output is correct |
2 |
Correct |
111 ms |
536 KB |
Output is correct |
3 |
Correct |
130 ms |
612 KB |
Output is correct |
4 |
Incorrect |
108 ms |
612 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
11 ms |
612 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |