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
|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef long double ld;
#define mp make_pair
const int maxn = 1e5 + 7;
int sg[maxn];
int t[maxn];
int f[maxn] = {1, 3, 4};
int p = 3;
void (int n)
{
sg[0] = 0;
for (int i = 1; i <= n; i++)
{
memset(t, 0, sizeof t);
for (int j = 0; j < p; j++)
{
if (i - f[j] >= 0)
t[sg[i - f[j]]]++;
}
for (int j = 0;; j++)
{
if (!t[j])
{
sg[i] = j;
break;
}
}
}
}
int main(void)
{
getSG(7);
for (int i = 0; i <= 7; i++)
{
cout << sg[i] << endl;
}
system("pause");
return 0;
}
|
近期评论