-
Notifications
You must be signed in to change notification settings - Fork 47
/
Copy path1088.c
67 lines (49 loc) · 879 Bytes
/
1088.c
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/*
@autor: Malbolge;
@data: 27/04/2019;
@nome: Bolhas e Baldes;
*/
#include <stdio.h>
#include <string.h>
int merge(int *a, int n, int *inv);
void main ()
{
int i, n, inv;
while(scanf("%d", &n), n)
{
int a[n];
for(i = 0; i < n; ++i)
scanf("%d", &a[i]);
inv = 0;
merge(a, n, &inv);
printf("%s\n", inv & 1 ? "Marcelo" : "Carlos");
}
}
int merge(int *a, int n, int *inv)
{
if (n > 1)
{
merge(a, n / 2, inv);
merge(a + (n / 2), (n + 1) / 2, inv);
int i = 0, k;
int j = n / 2;
int b[n];
for (k = 0; k < n; ++k)
{
if (i < n / 2 && j < n)
{
if (a[i] < a[j])
b[k] = a[i], ++i;
else if (a[j] < a[i])
b[k] = a[j], ++j, *inv += (n / 2) - i;
else
b[k] = a[i], ++i;
}
else if (i < n / 2)
b[k] = a[i], ++i;
else
b[k] = a[j], ++j;
}
memcpy(a, b, sizeof(int) * n);
}
}