/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 404.0 KiB
#2 Accepted 3ms 532.0 KiB
#3 Accepted 3ms 532.0 KiB
#4 Accepted 4ms 532.0 KiB
#5 Accepted 3ms 484.0 KiB
#6 Accepted 4ms 628.0 KiB
#7 Accepted 4ms 624.0 KiB
#8 Accepted 2ms 532.0 KiB
#9 Accepted 2ms 320.0 KiB
#10 Accepted 4ms 532.0 KiB
#11 Accepted 2ms 324.0 KiB
#12 Accepted 3ms 600.0 KiB
#13 Accepted 3ms 576.0 KiB
#14 Accepted 3ms 588.0 KiB
#15 Accepted 3ms 532.0 KiB

Code

#include<bits/stdc++.h>          // --> Bismillahir_ Rahmanir_ Rahim <--
#define ll long long 
using namespace std;

string mx(string a,string b) {
	if(a.size()>b.size()) {
		return a;
	}
	else if(a.size()<b.size()) {
		return b;
	}
	else {
		return max(a,b);
	}
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
	
	ll tc; cin >> tc;
	while(tc--) {
		ll n,k; cin >> n >> k;
		string z[n+7];
		for(ll i=0 ; i<n ; i++) {
			cin >> z[i];
		}
		string ans = z[0];
		for(ll i=0 ; i<n-k ; i++) {
			string x = "";
		
			for(ll j=i ; j<=i+k ; j++) {
				x += z[j];
			}
			ans = mx(ans,x);
		}
		cout << ans << "\n";
	}
   
    return 0;
} 

Information

Submit By
Type
Submission
Problem
P1083 Number concatenation
Contest
Bangladesh 2.0
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 16:49:05
Judged At
2024-11-11 03:13:49
Judged By
Score
100
Total Time
4ms
Peak Memory
628.0 KiB