-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathP28.cpp
More file actions
227 lines (182 loc) · 3.39 KB
/
P28.cpp
File metadata and controls
227 lines (182 loc) · 3.39 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
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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
/*
* =====================================================================================
*
* Filename: test.cpp
*
* Description:
*
* Version: 1.0
* Created: 2016年03月31日 15时40分08秒
* Last Modified: 2016年03月31日 15时40分08秒
* Revision: none
* Compiler: gcc
*
* Author: zt (),
* Organization:
*
* =====================================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <iterator>
#include <ostream>
#include <iostream>
#include <string>
#include <sstream>
/* 19 */
int NStep ( int n )
{
if ( 0 == n )
return 1;
int res = 1;
for ( int i = 1; i <= n; ++i )
res *= i;
return res;
}
/* 20 */
int Fn ( int n )
{
int a[30] = { 0 };
int res = 0;
a[0] = 1;
a[1] = 1;
if ( n == 0 || n == 1 )
a[n];
for ( int i = 2; i <= n; ++i )
a[i] = a[i - 1] + a[i - 2];
return a[n];
}
/* 21 */
int F21 ( int n )
{
if ( n % 2 )
return F21 ( 3 * n + 1 );
else
return n / 2;
}
int F21_2 ( int n )
{
if ( n % 2 )
return ( 3 * n + 1 ) / 2;
else
return n / 2;
}
/* 24 */
template<typename T>
bool F24 ( T array[], int start, int end, T x )
{
if ( ( start == end ) && ( array[start] == x ) )
return true;
else
return false;
if ( array[start] == x )
return true;
else
return F24 ( array, start + 1, end, x );
}
/* 25 */
void SubSetGen ( int n, int* flag, int cnt )
{
if ( 0 == n )
{
for ( int i = 0; i < cnt; ++i )
{
if ( flag[i] )
std::cout << 1;
else
std::cout << 0;
}
std::cout << std::endl;
return ;
}
flag[n] = 1;
SubSetGen ( n - 1, flag, cnt );
flag[n] = 0;
SubSetGen ( n - 1, flag, cnt );
}
void SubSetGen2 ( char* str, int* tag, int n, int cnt )
{
if ( n == 0 )
{
std::cout << "{";
for ( int i = 0; i < cnt; ++i )
{
if ( tag[i] == 1 )
std::cout << str[i];
else
std::cout << ' ';
}
std::cout << "}" << std::endl;
return;
}
tag[n] = 0;
SubSetGen2 ( str, tag, n - 1, cnt );
tag[n] = 1;
SubSetGen2 ( str, tag, n - 1, cnt );
}
void SubSetGen3 ( char* str, int n, int cnt )
{
char temp = 0;
if ( n == 0 )
{
std::cout << "{";
for ( int i = 0; i < cnt; ++i )
std::cout << str[i];
std::cout << "}" << std::endl;
return;
}
temp = str[n];
SubSetGen3 ( str, n - 1, cnt );
str[n] = ' ';
SubSetGen3 ( str, n - 1, cnt );
str[n] = temp;
}
/* 26 */
void F26 ( int n )
{
if ( 1 == n )
{
std::cout << 1 << ',';
return ;
}
F26 ( n - 1 );
std::cout << n << ',';
F26 ( n - 1 );
}
std::string F262 ( int n )
{
std::string temp;
if ( 1 == n )
{
temp = "1 ";
return temp;
}
temp += F262 ( n - 1 );
std::stringstream ss;
ss << n;
temp += ss.str();
temp += " ";
temp += F262 ( n - 1 );
}
int a[] = { 1, 3, 5, 7, 2, 4, 6, 8};
char b[] = { 'a', 'b', 'c', 'd', 'e'};
int main ( int argc, char* argv[] )
{
//printf ( "%d\n", NStep ( 5 ) );
//printf ( "%d\n", Fn ( 5 ) );
//printf ( "%d %d\n", F21 ( 211 ) , F21_2 ( 211 ) );
#if 0
if ( F24 ( a, 0, 7, 28 ) )
printf ( "find!\n" );
else
printf ( "not find!\n" );
#endif
//int tag[5];
//SubSetGen2 ( b, tag, 0, 5 );
//int tag[5];
//SubSetGen ( 3, tag, 3 );
//SubSetGen3 ( b, 5, 5 );
//F26 ( 4 );
std::cout << F262 ( 4 );
return 0;
}