# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
525804 | ali22413836 | Necklace (Subtask 1-3) (BOI19_necklace1) | C++14 | 1600 ms | 211592 KiB |
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>
#define endl "\n"
using namespace std ;
typedef long long ll;
typedef long double ld ;
const int N=2e7;
const ll inf=1e18 ;
const ll mod = 1e9 + 7 ;
ll mypower(ll x, ll y){
if(y == 0) return 1 ;
if(y == 1) return x ;
ll ret = mypower(x , y / 2);
ret = (ret * ret) % mod;
if(y % 2) ret = ( ret * x ) % mod ;
return ret ;
}
string s , s2 ;
ll n , m ;
map < string , ll > mp ;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> s >> s2 ; n = s.size() , m = s.size() ;
for(int i = 0 ; i < n ; i++){
for(int j = i ; j < n ; j++){
for(int q = i ; q <= j ; q++){
string s3 = "" ;
for(int k = q ; k <= j ;k++){
s3 += s[k] ;
}
for(int k = i ; k < q ; k++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |