/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 0ms 324.0 KiB
#2 Wrong Answer 0ms 284.0 KiB

Code

#include<stdio.h>
int main(){
    int n,k;
    scanf("%d%d",&n,&k);
    char a[n];

    for(int i=0; i<n;i++){
    scanf(" %c",&a[i]);
    }
    for(int z=n; z>n; z=z-k){
    for( int j=k; j>0; j--){
        for( int i=0; i<k-j; i++){
            char temp;

            if(a[i]>a[i+1]){
                temp= a[i];
                a[i]=a[i+1];
                a[i+1]=temp;
            }


        }

    }


    }
    for(int i=0; i<n; i++){
    printf(" %c",a[i]);
}


return 0;
}


Information

Submit By
Type
Submission
Problem
P1230 Lexicographically Smallest Rearrangement
Contest
LUCC Presents Kick & Code Intra LU Programming Contest
Language
C99 (GCC 13.2.0)
Submit At
2025-09-01 07:32:19
Judged At
2025-09-01 07:32:19
Judged By
Score
0
Total Time
0ms
Peak Memory
324.0 KiB