codeforces 12B - Correct Solution?

细心即可

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define M 200000+5
char a[15],b[15];
int main(){
    int x,y,i,j,cnt,tmp;
    while(~scanf("%s %s",a,b)){
cnt=strlen(a);
sort(a,a+cnt);
i=0;
while(a[i]=='0'&&i<cnt)i++;
if(i<cnt)swap(a[i],a[0]);
if(strcmp(a,b)==0)puts("OK");
else puts("WRONG_ANSWER");
}
    return 0;
}