/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
//#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()
//#pragma GCC optimize ("Ofast,unroll-loops")
//#pragma GCC target ("avx2")
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;
template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;
constexpr int MOD = 1e9 + 7, N = 2e5 + 8, M = 1e5, SQ = 300, INF = 2e9 + 8, LGN = 21, mod = 998244353, P = 131113;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int ans, ind1, ind2;
string s, t;
int32_t main(){
fast_io;
cin >> s >> t;
if (max (s.size(), t.size()) > 50){
cout << "NO\n";
}
for (int len = 1; len < s.size(); ++ len){
for (int i = 0; i < s.size() - len + 1; ++ i){
for (int j = 0; j < t.size(); ++ j){
for (int k = 1; k < len; ++ k){
if (j + k < t.size() && j - (len - k) >= 0){ ///
}
if (j - k + 1 >= 0 && j + (len - k) < t.size()){
}
}
}
}
}
cout << ans << '\n';
cout << ind1 << " "<< ind2 << '\n';
return 0;
}
// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present
Compilation message
necklace.cpp: In function 'int32_t main()':
necklace.cpp:52:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for (int len = 1; len < s.size(); ++ len){
| ~~~~^~~~~~~~~~
necklace.cpp:53:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | for (int i = 0; i < s.size() - len + 1; ++ i){
| ~~^~~~~~~~~~~~~~~~~~~~
necklace.cpp:54:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
54 | for (int j = 0; j < t.size(); ++ j){
| ~~^~~~~~~~~~
necklace.cpp:56:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
56 | if (j + k < t.size() && j - (len - k) >= 0){ ///
| ~~~~~~^~~~~~~~~~
necklace.cpp:59:47: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
59 | if (j - k + 1 >= 0 && j + (len - k) < t.size()){
| ~~~~~~~~~~~~~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Expected integer, but "NO" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Expected integer, but "NO" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
344 KB |
Expected integer, but "NO" found |
| 2 |
Halted |
0 ms |
0 KB |
- |
