ProjectEuler/P79.cpp at master · AbhishekYMCA/ProjectEuler · GitHub

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
#include<iostream>
#include<fstream>
#include<string>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<algorithm>
#include<math.h>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iomanip>
#define MAXN 50000000
#define MOD 1000000
#define LL long long
#define eps 1e-8
#define inf 0x3f3f3f3f
using namespace std;
//本方法没有考虑数字有重复的情况（如果有数字重复的话数字的顺序比较会出现冲突）
typedef struct List
{
    int val;
    List* next;
}List;
int Comp[10][10];

void ListInsert(int v, List* &p)
{
    List* q = p->next;
    List* t = (List*)malloc(sizeof(List));
    t->val = v;
    p->next = t;
    t->next = q;
    return;
}

void CodeAdjust(int v, List* &T)
{
    if(T->next == T)
    {
        for(int i = 0; i <= 9; i++)
        {
            if(Comp[v][i])
            {
                ListInsert(v, T);
                return;
            }
        }
        return;
    }
    List* p;
    List* q;//'*'只能对它之后的第一个变量起作用
    p = T->next;
    q = T;//v插入到q下一位置，故q初始化为头结点位置
    bool status = false;
    while(T != p)
    {
        if(Comp[v][p->val])
            status = true;
        if(1 == Comp[v][p->val])
            q = p;
        else if(-1 == Comp[v][p->val])
            break;
        p = p->next;
    }
    if(!status)
        return;
    ListInsert(v, q);
    return;
}

int main()
{
    clock_t start = clock();
    freopen("C:\\Users\\Leo Cheng\\Documents\\p079_keylog.txt", "r", stdin);
    int a, b, c;
    while(scanf("%1d%1d%1d", &a, &b, &c) != EOF)
    {
        if(1 == Comp[a][b] || 1 == Comp[a][c] || 1 == Comp[b][c])
        {
            printf("数字有重复，此方法不适用！\n");
            return 0;
        }
        Comp[a][b] = -1;
        Comp[a][c] = -1;
        Comp[b][c] = -1;
        Comp[b][a] = 1;
        Comp[c][a] = 1;
        Comp[c][b] = 1;
    }
    List* T = (List*)malloc(sizeof(List));
    T->next = T;//循环链表
    for(int i = 0; i <= 9; i++)
        CodeAdjust(i, T);
    List* p = T->next;
    while(p != T)
    {
        printf("%d", p->val);
        p = p->next;
    }
    printf("\n");
    printf("time cost: %lf", (double)( clock() - start) / CLOCKS_PER_SEC);
    return 0;
}