This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std ;
//#define int long long
int MOD = 1e9+7 ;
int freq[200] ;
vector < int > v[200] ;
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n ; cin >> n ;
string s ; cin >> s ;
if ( n % 2 == 0 )
{
cout << "NOT POSSIBLE" << endl ;
return 0 ;
}
int counter = 0 , bo = 0 ;
for ( int i = 0 , j = (n/2) ; i < (n/2) ; i++ , j++ )
{
if ( s[i] == s[j] ) counter++ ;
else if ( !bo )
{
bo = 1 ;
i-- ;
}
else break ;
}
string ans = "-" ;
if ( counter == (n/2) ) ans = s.substr(0,(n/2)) ;
//====================================================
counter = bo = 0 ;
for ( int i = (n/2)+1 , j = 0 ; i < n ; i++ , j++ )
{
if ( s[i] == s[j] ) counter++ ;
else if ( !bo )
{
bo = 1 ;
i-- ;
}
else break ;
}
if ( counter == (n/2) )
{
if ( ans == "-" ) ans = s.substr((n/2)+1) ;
else
{
cout << "NOT UNIQUE" << endl ;
return 0 ;
}
}
if ( ans == "-" ) cout << "NOT POSSIBLE" << endl ;
else cout << ans << endl ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |