/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 532.0 KiB
#2 Wrong Answer 4ms 532.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);

int main () {
    FASTIO
    int n, m;
    cin>>n>>m;
    string s;
    cin>>s;
    ll a = 0;
    for (ll i = 1; i < 100000000; i++) {
        a += i;
        for (ll j = 1; j < 100000000; j++) {
            a -= j;
        }
    }
    cout<<s;
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1230 Lexicographically Smallest Rearrangement
Contest
Testing - Intra LU Programming contest 25
Language
C++17 (G++ 13.2.0)
Submit At
2025-08-31 07:45:54
Judged At
2025-08-31 07:45:54
Judged By
Score
0
Total Time
4ms
Peak Memory
532.0 KiB