hihoCoder Challenge 18 register

Ended

Participants:318

Verdict:Accepted
Submitted:2016-02-14 20:13:16

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <cstdio>
#include <cstring>
int f(char *s1, char *s2)
{
        int times = 0;
        int l1;
        l1 = strlen(s1);
        int i, j, k;
        for (i = 0; i < l1; i++)
        {
                if (s1[i] != s2[i])
                {
                        for (j = i + 1; s1[j] != s2[i]; j++);
                        times += j - i;
                        for (k = j; k > i; k--)
                        {
                                s1[k] ^= s1[k-1];
                                s1[k-1] ^= s1[k];
                                s1[k] ^= s1[k-1];
                        }
                }
        }
        return times;
}
int main()
{
        char s1[1050], s2[1050];
        gets(s2);
        gets(s1);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX