/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 512.0 KiB
#2 Accepted 5ms 604.0 KiB
#3 Accepted 5ms 588.0 KiB
#4 Accepted 5ms 616.0 KiB
#5 Accepted 5ms 444.0 KiB
#6 Accepted 5ms 488.0 KiB
#7 Wrong Answer 5ms 628.0 KiB
#8 Wrong Answer 3ms 544.0 KiB
#9 Wrong Answer 2ms 504.0 KiB
#10 Wrong Answer 5ms 632.0 KiB
#11 Wrong Answer 2ms 328.0 KiB
#12 Wrong Answer 4ms 584.0 KiB
#13 Wrong Answer 5ms 592.0 KiB
#14 Wrong Answer 4ms 592.0 KiB
#15 Wrong Answer 5ms 588.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 10;
const ll MOD = 1e9 + 7;

void solve()
{
  ll n, k;
  cin >> n >> k;
  vector<string>v(n);
  for(ll i = 0; i < n; i++) {
    cin >> v[i];
  }
  string ans = "";
  for(ll i = 0; i < (n - k); i++) {
    string temp = "";
    for(ll j = i; j <= (i + k); j++) {
      temp += v[j];
    }
    if(temp.size() > ans.size()) ans = temp;
    else ans = max(ans, temp);
  }

  cout << ans << "\n";
}

int main()
{
  ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);

  int t;
  cin >> t;
  while(t--){
    solve();
  }
}

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 15:52:54
Judged At
2024-10-03 13:29:36
Judged By
Score
30
Total Time
5ms
Peak Memory
632.0 KiB