-
Notifications
You must be signed in to change notification settings - Fork 0
/
leiras.txt
96 lines (65 loc) · 1.05 KB
/
leiras.txt
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
91
92
93
94
95
96
Példa:
-- input --
1,0,1,0,1,0
-- input --
Program.cs - main()
beolvasas utan:
s = "1,0,1,0,1,0"
int[] input = 1,0,1,0,1,0
int cnt = ReorderInput(input)
Function hivas:
int n = 6
int cnt = 0
int i = 0
int j = 5
seq = 1,0,1,0,1,0
innentol:
i = 0
j = 5
cnt = 0
if (seq[i] == 1 && seq[j] == 0) IGAZ
seq = 0,0,1,0,1,0
cnt++
if (seq[i] == 0) HAMIS
if (seq[j] == 1) HAMIS
i = 0
j = 5
cnt = 1
seq = 0,0,1,0,1,1
if (seq[i] == 1 && seq[j] == 0) HAMIS
if (seq[i] == 0) IGAZ
if (seq[j] == 1) IGAZ
i = 1
j = 4
cnt = 1
seq = 0,0,1,0,1,1
if (seq[i] == 1 && seq[j] == 0) HAMIS
if (seq[i] == 0) IGAZ
if (seq[j] == 1) IGAZ
i = 2
j = 3
cnt = 1
seq = 0,0,1,0,1,1
if (seq[i] == 1 && seq[j] == 0) IGAZ
seq = 0,0,0,1,1,1
cnt++
if (seq[i] == 0) HAMIS
if (seq[j] == 1) HAMIS
i = 2
j = 3
cnt = 2
seq = 0,0,0,1,1,1
if (seq[i] == 1 && seq[j] == 0) HAMIS
if (seq[i] == 0) IGAZ
if (seq[j] == 1) IGAZ
i = 3
j = 2
cnt = 2
seq = 0,0,0,1,1,1
for loop vege mivel i nem < j
cnt visszaadasa es visszalepes a main()-be
cnt kiirasa
vege a main()-nek
-- output --
2
-- output --