fork download
  1. // بسم الله الرحمن الرحيم
  2.  
  3. // link:
  4. // NOTE:
  5.  
  6. #include <bits/stdc++.h>
  7. using namespace std;
  8.  
  9. template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { for (auto &i : v) os << i << ' '; return os; }
  10. template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &i : v) is >> i; return is; }
  11. #define endl '\n'
  12. #define int long long
  13. #define ull unsigned long long
  14. #define pii pair<int, int>
  15. #define vi vector<int>
  16. #define all(v) v.begin(), v.end()
  17. #define allr(v) v.rbegin(), v.rend()
  18. #define Num_of_Digits(n) ((int(log10(n)) + 1))
  19.  
  20. #define ElgamalyHowaAmaly ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cout << fixed << setprecision(10)
  21. const double EPS = 1e-9;
  22. const int Mod = 1e9+7; // 998244353;
  23. const int N = 2e5+7;
  24.  
  25.  
  26. void solve1()
  27. {
  28. string a, b; cin >> a >> b;
  29. map<string, int> m;
  30. for(int i = 0; i < a.size(); ++i){
  31. string s = "";
  32. for(int j = i; j < a.size(); ++j){
  33. s += a[j];
  34. m[s] = 1;
  35. }
  36. }
  37.  
  38. int x = 0;
  39. for(int i = 0; i < b.size(); ++i){
  40. string s = "";
  41. for(int j = i; j < b.size(); ++j){
  42. s += b[j];
  43. if(m[s] == 1){
  44. if(s.size() > x){
  45. x = s.size();
  46. }
  47. }
  48. }
  49. }
  50.  
  51. if(x == 0) cout << a.size() + b.size() << endl;
  52. else {
  53. cout << a.size() - x + b.size() - x << endl;
  54. }
  55. }
  56.  
  57. signed main(){
  58.  
  59. ElgamalyHowaAmaly;
  60.  
  61. int t = 1;
  62. cin >> t;
  63. for(int test = 1; test <= t; ++test)
  64. {
  65. solve1();
  66. }
  67. return 0;
  68. }
Success #stdin #stdout 0s 5320KB
stdin
Standard input is empty
stdout
0