/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 536.0 KiB
#2 Accepted 3ms 532.0 KiB
#3 Accepted 3ms 532.0 KiB
#4 Accepted 3ms 532.0 KiB
#5 Accepted 3ms 532.0 KiB
#6 Accepted 3ms 608.0 KiB
#7 Wrong Answer 3ms 576.0 KiB
#8 Wrong Answer 2ms 536.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
// #define cerr cout
#include "algo/debug.h"
#else
#define deb(...) 30
#endif
#define ll long long
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;
    while (t--)
    {
        int n, k;
        cin >> n >> k;
        vector<string> v(n);
        for (auto &a : v)
            cin >> a;
        // vector<string> final;
        string final = "";
        for (int i = 0; i <= n - k - 1; i++)
        {
            string temp = "";
            for (int j = 0; j <= k; j++)
            {
                temp += v[i + j];
            }
            // cout << ".\n";
            if (temp > final)
                final = temp;
        }
        int f = 1;
        deque<char> ans;
        for (auto a : final)
            ans.push_back(a);
        while (ans.front() == '0')
        {
            ans.pop_front();
        }
        if (ans.size())
        {
            for (auto a : ans)
                cout << a;
            cout << '\n';
        }
        else
            cout << "0\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:02:32
Judged At
2024-11-11 03:16:21
Judged By
Score
30
Total Time
3ms
Peak Memory
608.0 KiB