Sandbox::https://github.com/KSH-code/Problem-Solving/blob/master/10840.cpp

Visitar URL original

Problem-Solving/10840.cpp at master · KSH-code/Problem-Solving · GitHub

Repository navigation

61 lines (47 loc) · 1.12 KB

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

#include <bits/stdc++.h>

#pragma GCC optimize ("O3")

#pragma GCC optimize ("Ofast")

#pragma GCC optimize ("unroll-loops")

#pragma GCC target("avx,avx2,fma")

using namespace std;

typedef long long ll;

int xxxx[]={-1,0,1,0};

int yyyy[]={0,1,0,-1};

const ll m=1001;

typedef pair<ll,ll> pll;

ll pow(ll b) {

if (!b) return 1;

ll t = 1;

if (b & 1) t *= m;

auto z = pow(b/2);

return t*z*z;

}

void solve(){

string A, B; cin >> A >> B;

vector<ll> v;

for (int i = 0; i < A.size(); i++) {

ll f = 0;

for (int j = i; j < A.size(); j++) {

f += pow(A[j]-'a');

v.push_back(f);

}

}

sort(v.begin(), v.end());

int result = 0;

for (int i = 0; i < B.size(); i++) {

ll f = 0;

for (int j = i; j < B.size(); j++) {

f += pow(B[j]-'a');

if (binary_search(v.begin(), v.end(), f)) {

result = max(result, j-i+1);

}

}

}

cout << result;

}

int main()

{

cin.tie(0)->sync_with_stdio(false);

solve();

return 0;

}