-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain
More file actions
90 lines (78 loc) · 1.16 KB
/
main
File metadata and controls
90 lines (78 loc) · 1.16 KB
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
int main()
{
int a, b, c;
c = a + b;
return 0;
}
int main() {}
void main() {}
//int[] a = new int[4];
int main()
{
int[] b = new int[4];
//a=b;
}
class CLASS
{
//CLASS a;
//CLASS b;
int c;
}
int main()
{
CLASS a = new CLASS;
/*a.c = 0;
println(toString(a.c));
a.a = a;
println(toString(a.a.a.a.a.a.a.a.a.a.a.c));
CLASS b = new CLASS;
b.a = a;
b.b = b;
a.b = b;
println(toString(a.b.a.b.a.b.a.c));*/
return 0;
}
class A
{
int c;
}
int main()
{
A a = new A;
return 0;
}
//int a[10100];
int[] a = new int[10100];
int n = 10000;
int qsrt(int l, int r) {
int i = l;
int j = r;
int x = a[(l + r) / 2];
while (i <= j) {
while (a[i] < x) i++;
while (a[j] > x) j--;
if (i <= j) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
i++;
j--;
}
}
if (l < j) qsrt(l, j);
if (i < r) qsrt(i, r);
return 0;
}
int main() {
int i;
for (i = 1; i <= n; i++)
a[i] = n + 1 - i;
qsrt(1, n);
for (i = 1; i <= n; i++) {
// printf("%d ", a[i]);
print(toString(a[i]));
print(" ");
}
print("\n");
return 0;
}