UVA/arrange.cpp at master · SunTalk/UVA · 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
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
#include <bits/stdc++.h>

using namespace std;

int catch_num(string tmp){

	int num = 0;
	string check;
	for(int i = 0 ; i < tmp.size()-3 ; i++ ){
		if( i+3 < tmp.size() )
			check = tmp.substr(i,3);
		else
			return 0;
		check = tmp.substr(i,3);
		if( check == "uva" ){
			for(int j = i+3 ; j < tmp.size() ; j++ ){
				if( tmp[j] >= '0' && tmp[j] <= '9' )
					num = num*10 + tmp[j]-'0';
				else
					break;
			}
			break;
		}
	}
	return num;
}

int catch_str(string tmp){
	string check;
	for(int i = 0 ; i < tmp.size()-3 ; i++ ){
		if( i+3 < tmp.size() )
			check = tmp.substr(i,3);
		else
			return 0;
		if( check == "[x]" || check == "[X]" )
			return 1;
		if( check == "[ ]" )
			return 2;
	}
	return 0;
}

int main(int argc, char const *argv[])
{

	freopen("README.md","r",stdin);
	// freopen("READMEk.md","w",stdout);

	string str;
	vector <string> finish;
	vector <string> not_finish;
	while( getline(cin,str) ){
		int f_or_nf = catch_str(str);
		if( f_or_nf == 1 )
			finish.push_back(str);
		if( f_or_nf == 2 )
			not_finish.push_back(str);
	}

	sort(finish.begin(),finish.end());
	sort(not_finish.begin(),not_finish.end());

	vector<int> num_nf;
	vector<int> num_f;

	for(int i = 0 ; i < finish.size() ; i++ )
		num_f.push_back(catch_num(finish[i]));
	for(int i = 0 ; i < not_finish.size() ; i++ )
		num_nf.push_back(catch_num(not_finish[i]));


	freopen("README.md","w",stdout);
	printf("# UVA\n\n");

	printf("## Total\n\n");
	printf("* Not Finish: %d\n",num_nf.size() );
	printf("* Finish: %d\n\n",num_f.size() );

	printf("## Not Finish\n\n");
	printf("* part one\n");
	for(int i = 0 ; i < not_finish.size() ; i++ ){
		if( num_nf[i] < 1000 ){
			if( not_finish[i][0] != '\t' )
				cout << "\t";
			cout << not_finish[i] << endl;
		}
	}
	printf("\n");
	printf("* part two\n");
	for(int i = 0 ; i < not_finish.size() ; i++ ){
		if( num_nf[i] >= 1000 && num_nf[i] < 10000 ){
			if( not_finish[i][0] != '\t' )
				cout << "\t";
			cout << not_finish[i] << endl;
		}
	}
	printf("\n");
	printf("* part three\n");
	for(int i = 0 ; i < not_finish.size() ; i++ ){
		if( num_nf[i] >= 10000 && num_nf[i] < 100000 ){
			if( not_finish[i][0] != '\t' )
				cout << "\t";
			cout << not_finish[i] << endl;
		}
	}
	printf("\n");

	printf("## Finish\n\n");
	printf("* part one\n");
	for(int i = 0 ; i < finish.size() ; i++ ){
		if( num_f[i] < 1000 ){
			if( finish[i][0] != '\t' )
				cout << "\t";
			cout << finish[i] << endl;
		}
	}
	printf("\n");
	printf("* part two\n");
	for(int i = 0 ; i < finish.size() ; i++ ){
		if( num_f[i] >= 1000 && num_f[i] < 10000 ){
			if( finish[i][0] != '\t' )
				cout << "\t";
			cout << finish[i] << endl;
		}
	}
	printf("\n");
	printf("* part three\n");
	for(int i = 0 ; i < finish.size() ; i++ ){
		if( num_f[i] >= 10000 && num_f[i] < 100000 ){
			if( finish[i][0] != '\t' )
				cout << "\t";
			cout << finish[i] << endl;
		}
	}
	printf("\n");

	return 0;
}