-
Notifications
You must be signed in to change notification settings - Fork 0
/
分类排序.cpp
185 lines (170 loc) · 2.89 KB
/
分类排序.cpp
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
#include<stdio.h>
#define odd 1
#define even 0
#define exist 1
#define inexist 0
void sort(int a[],int n);
int find(int a[],int n,int value);
void display (int a[],int n);
void reverse(int a[],int n);
void deleted(int a[],int index,int n);
void special_fuction(int a[],int even_number,int odd_number,int n);
int main()
{
int n ,number[10] ,a_number ,i ,m ,flagoe ,flagexist ,index ;
int even_number ,odd_number ;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
even_number=odd_number=0;
for (m=0;m<=9;m++)
{
scanf("%d",&number[m]);
}
scanf("%d",&a_number);
if (a_number%2==0)
{
flagoe=even;
}
else
{
flagoe=odd;
}
index=find(number,10,a_number);
if (index!=-1)
{
flagexist=exist;
}
else
{
flagexist=inexist;
}
if (flagoe==odd&&flagexist==exist)
{
deleted(number,index,10);
sort(number,9);
display(number,9);
if (i!=n)
printf("\n");
}
else if (flagoe==even&&flagexist==inexist)
{
number[10]=a_number;
sort(number,11);
reverse(number,11);
display(number,11);
if (i!=n)
printf("\n");
}
else
{
for (m=0;m<=9;m++)
{
if (number[m]%2==even)
{
even_number++;
}
else
{
odd_number++;
}
}
special_fuction(number,even_number,odd_number,10);
display(number,10);
if (i!=n)
printf("\n");
}
}
}
void display (int a[],int n)
{
int i ;
for (i=0;i<=n-1;i++)
{
printf(i==n-1?"%d":"%d ",a[i]);
}
}
void deleted (int a[],int index,int n)
{
int i ;
for (i=index;i<=n-2;i++)
{
a[i]=a[i+1];
}
}
int find(int a[],int n,int value)
{
int i;
for (i=0;i<=n-1;i++)
{
if (a[i]==value)
{
return i;
}
}
return -1;
}
void sort(int a[],int n)
{
int i ,middle ,m ;
for (m=0;m<=n-2;m++)
for (i=m+1;i<=n-1;i++)
{
if (a[i]<a[m])
{
middle=a[i];
a[i]=a[m];
a[m]=middle;
}
}
}
void reverse(int a[],int n)
{
int i ,m ,middle ;
for (i=0,m=n-1;i<=n/2;i++,m--)
{
middle=a[i];
a[i]=a[m];
a[m]=middle;
}
}
void special_fuction(int a[],int even_number,int odd_number,int n)
{
int i ,m ,y ,middle ,j ,k ;
m=even_number;
y=0;
for (i=0;i<=n-1;i++)
{
if (a[i]%2!=even)
{
middle=a[i];
a[i]=a[y];
a[y]=middle;
y++;
}
}
for (j=0;j<=even_number-2;j++)
{
for (k=j+1;k<=even_number-1;k++)
{
if (a[j]<a[k])
{
middle=a[j];
a[j]=a[k];
a[k]=middle;
}
}
}
for (j=odd_number;j<=n-2;j++)
{
for (k=j+1;k<=n-1;k++)
{
if (a[j]<a[k])
{
middle=a[j];
a[j]=a[k];
a[k]=middle;
}
}
}
}