Skip to content

Commit 8a775b3

Browse files
author
cascades-sjtu
committed
change clang-format style to WebKit
1 parent 34eef56 commit 8a775b3

45 files changed

Lines changed: 329 additions & 590 deletions

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

src/201312-1.cc

Lines changed: 7 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -3,36 +3,29 @@
33

44
using namespace std;
55

6-
int main(int argc, char const *argv[])
6+
int main(int argc, char const* argv[])
77
{
88
int n;
99
cin >> n;
1010
map<int, int> nums;
1111
map<int, int>::iterator it;
12-
for (int i = 0; i < n; i++)
13-
{
12+
for (int i = 0; i < n; i++) {
1413
int tmp;
1514
cin >> tmp;
1615
it = nums.find(tmp);
17-
if (it != nums.end())
18-
{
16+
if (it != nums.end()) {
1917
it->second++;
20-
}
21-
else
22-
{
18+
} else {
2319
nums.insert(pair<int, int>(tmp, 1));
2420
}
2521
}
2622
int max_num = 0;
27-
for (it = nums.begin(); it != nums.end(); it++)
28-
{
23+
for (it = nums.begin(); it != nums.end(); it++) {
2924
max_num = max(max_num, it->second);
3025
}
3126
int ans = 10000;
32-
for (it = nums.begin(); it != nums.end(); it++)
33-
{
34-
if (it->second == max_num)
35-
{
27+
for (it = nums.begin(); it != nums.end(); it++) {
28+
if (it->second == max_num) {
3629
ans = min(ans, it->first);
3730
}
3831
}

src/201312-2.cc

Lines changed: 5 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -2,26 +2,21 @@
22

33
using namespace std;
44

5-
int main(int argc, char const *argv[])
5+
int main(int argc, char const* argv[])
66
{
77
string ISBN;
88
getline(cin, ISBN);
99
int ID = 0, cnt = 0;
1010
int len = ISBN.size();
11-
for (int i = 0; i < len - 1; i++)
12-
{
13-
if (isdigit(ISBN[i]))
14-
{
11+
for (int i = 0; i < len - 1; i++) {
12+
if (isdigit(ISBN[i])) {
1513
ID += (++cnt) * (ISBN[i] - '0');
1614
}
1715
}
1816
char ID_char = (ID % 11 == 10) ? 'X' : ID % 11 + '0';
19-
if (ID_char == ISBN[len - 1])
20-
{
17+
if (ID_char == ISBN[len - 1]) {
2118
cout << "Right" << endl;
22-
}
23-
else
24-
{
19+
} else {
2520
ISBN[len - 1] = ID_char;
2621
cout << ISBN << endl;
2722
}

src/201403-1.cc

Lines changed: 5 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -2,22 +2,18 @@
22

33
using namespace std;
44

5-
int main(int argc, char const *argv[])
5+
int main(int argc, char const* argv[])
66
{
77
int n;
88
cin >> n;
99
int nums[n];
10-
for (int i = 0; i < n; i++)
11-
{
10+
for (int i = 0; i < n; i++) {
1211
cin >> nums[i];
1312
}
1413
int count = 0;
15-
for (int i = 0; i < n; i++)
16-
{
17-
for (int j = i; j < n; j++)
18-
{
19-
if (abs(nums[i] + nums[j]) == 0)
20-
{
14+
for (int i = 0; i < n; i++) {
15+
for (int j = i; j < n; j++) {
16+
if (abs(nums[i] + nums[j]) == 0) {
2117
count++;
2218
}
2319
}

src/201403-2.cc

Lines changed: 12 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -5,57 +5,49 @@ using namespace std;
55

66
bool inWindow(int click[2], vector<int> window)
77
{
8-
return (click[0] >= window[0] && click[0] <= window[2] &&
9-
click[1] >= window[1] && click[1] <= window[3])
10-
? true
11-
: false;
8+
return (click[0] >= window[0] && click[0] <= window[2] && click[1] >= window[1] && click[1] <= window[3])
9+
? true
10+
: false;
1211
}
1312

1413
// in-place rearrange
15-
void reArrange(vector<vector<int>> &windows, int i)
14+
void reArrange(vector<vector<int>>& windows, int i)
1615
{
1716
vector<int> window = windows[i];
1817
windows.erase(windows.begin() + i);
1918
windows.push_back(window);
2019
}
2120

22-
int main(int argc, char const *argv[])
21+
int main(int argc, char const* argv[])
2322
{
2423
int N, M;
2524
cin >> N >> M;
2625
vector<vector<int>> windows(N, vector<int>(5));
2726
// insert vector reversely
28-
for (int i = 0; i < N; i++)
29-
{
30-
for (int j = 0; j < 4; j++)
31-
{
27+
for (int i = 0; i < N; i++) {
28+
for (int j = 0; j < 4; j++) {
3229
cin >> windows[i][j];
3330
}
3431
// windows[i][4] represents window serial number
3532
windows[i][4] = i + 1;
3633
}
3734

3835
int clicks[M][2];
39-
for (int i = 0; i < M; i++)
40-
{
36+
for (int i = 0; i < M; i++) {
4137
cin >> clicks[i][0] >> clicks[i][1];
4238
}
4339

44-
for (int i = 0; i < M; i++)
45-
{
40+
for (int i = 0; i < M; i++) {
4641
int flag = 0;
47-
for (int j = N - 1; j >= 0; j--)
48-
{
49-
if (inWindow(clicks[i], windows[j]))
50-
{
42+
for (int j = N - 1; j >= 0; j--) {
43+
if (inWindow(clicks[i], windows[j])) {
5144
cout << windows[j][4] << endl;
5245
reArrange(windows, j);
5346
flag = 1;
5447
break;
5548
}
5649
}
57-
if (flag == 0)
58-
{
50+
if (flag == 0) {
5951
cout << "IGNORED" << endl;
6052
}
6153
}

src/201409-1.cc

Lines changed: 5 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -2,22 +2,18 @@
22

33
using namespace std;
44

5-
int main(int argc, char const *argv[])
5+
int main(int argc, char const* argv[])
66
{
77
int n;
88
cin >> n;
99
int nums[n];
10-
for (int i = 0; i < n; i++)
11-
{
10+
for (int i = 0; i < n; i++) {
1211
cin >> nums[i];
1312
}
1413
int count = 0;
15-
for (int i = 0; i < n; i++)
16-
{
17-
for (int j = i; j < n; j++)
18-
{
19-
if (abs(nums[i] - nums[j]) == 1)
20-
{
14+
for (int i = 0; i < n; i++) {
15+
for (int j = i; j < n; j++) {
16+
if (abs(nums[i] - nums[j]) == 1) {
2117
count++;
2218
}
2319
}

src/201409-2.cc

Lines changed: 9 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -2,34 +2,27 @@
22

33
using namespace std;
44

5-
int main(int argc, char const *argv[])
5+
int main(int argc, char const* argv[])
66
{
77
int n;
88
cin >> n;
99
int rectangle[4];
10-
int pixels[100][100] = {{0}};
11-
for (int i = 0; i < n; i++)
12-
{
13-
for (int j = 0; j < 4; j++)
14-
{
10+
int pixels[100][100] = { { 0 } };
11+
for (int i = 0; i < n; i++) {
12+
for (int j = 0; j < 4; j++) {
1513
cin >> rectangle[j];
1614
}
1715
// draw the pixels within rectangle
18-
for (int x = rectangle[0]; x < rectangle[2]; x++)
19-
{
20-
for (int y = rectangle[1]; y < rectangle[3]; y++)
21-
{
16+
for (int x = rectangle[0]; x < rectangle[2]; x++) {
17+
for (int y = rectangle[1]; y < rectangle[3]; y++) {
2218
pixels[x][y] = 1;
2319
}
2420
}
2521
}
2622
int count = 0;
27-
for (int i = 0; i < 100; i++)
28-
{
29-
for (int j = 0; j < 100; j++)
30-
{
31-
if (pixels[i][j] == 1)
32-
{
23+
for (int i = 0; i < 100; i++) {
24+
for (int j = 0; j < 100; j++) {
25+
if (pixels[i][j] == 1) {
3326
count++;
3427
}
3528
}

src/201412-1.cc

Lines changed: 4 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -3,23 +3,19 @@
33

44
using namespace std;
55

6-
int main(int argc, char const *argv[])
6+
int main(int argc, char const* argv[])
77
{
88
int n;
99
cin >> n;
1010
map<int, int> reader;
1111
map<int, int>::iterator it;
12-
for (int i = 0; i < n; i++)
13-
{
12+
for (int i = 0; i < n; i++) {
1413
int tmp;
1514
cin >> tmp;
1615
it = reader.find(tmp);
17-
if (it != reader.end())
18-
{
16+
if (it != reader.end()) {
1917
cout << ++(it->second) << " ";
20-
}
21-
else
22-
{
18+
} else {
2319
reader.insert(pair<int, int>(tmp, 1));
2420
cout << 1 << " ";
2521
}

src/201412-2.cc

Lines changed: 13 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -2,50 +2,35 @@
22

33
using namespace std;
44

5-
int main(int argc, char const *argv[])
5+
int main(int argc, char const* argv[])
66
{
77
int n;
88
cin >> n;
99
int matrix[n][n];
10-
for (int i = 0; i < n; i++)
11-
{
12-
for (int j = 0; j < n; j++)
13-
{
10+
for (int i = 0; i < n; i++) {
11+
for (int j = 0; j < n; j++) {
1412
cin >> matrix[i][j];
1513
}
1614
}
1715
int trace[2 * n - 1], order = 1;
18-
for (int i = 0; i < 2 * n - 1; i++)
19-
{
16+
for (int i = 0; i < 2 * n - 1; i++) {
2017
trace[i] = i;
2118
}
22-
for (int i = 0; i < 2 * n - 1; i++)
23-
{
24-
if (order == 0)
25-
{
26-
for (int x = 0; x <= trace[i]; x++)
27-
{
28-
if (x >= n || trace[i] - x >= n)
29-
{
19+
for (int i = 0; i < 2 * n - 1; i++) {
20+
if (order == 0) {
21+
for (int x = 0; x <= trace[i]; x++) {
22+
if (x >= n || trace[i] - x >= n) {
3023
continue;
31-
}
32-
else
33-
{
24+
} else {
3425
cout << matrix[x][trace[i] - x] << " ";
3526
}
3627
}
3728
order = 1;
38-
}
39-
else if (order == 1)
40-
{
41-
for (int y = 0; y <= trace[i]; y++)
42-
{
43-
if (y >= n || trace[i] - y >= n)
44-
{
29+
} else if (order == 1) {
30+
for (int y = 0; y <= trace[i]; y++) {
31+
if (y >= n || trace[i] - y >= n) {
4532
continue;
46-
}
47-
else
48-
{
33+
} else {
4934
cout << matrix[trace[i] - y][y] << " ";
5035
}
5136
}

src/201503-1.cc

Lines changed: 6 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -3,23 +3,19 @@
33

44
using namespace std;
55

6-
int main(int argc, char const *argv[])
6+
int main(int argc, char const* argv[])
77
{
88
int n, m;
99
cin >> n >> m;
10-
vector<vector<int> > pic(n, vector<int>(m));
11-
for (int i = 0; i < n; i++)
12-
{
13-
for (int j = 0; j < m; j++)
14-
{
10+
vector<vector<int>> pic(n, vector<int>(m));
11+
for (int i = 0; i < n; i++) {
12+
for (int j = 0; j < m; j++) {
1513
cin >> pic[i][j];
1614
}
1715
}
1816

19-
for (int i = 0; i < m; i++)
20-
{
21-
for (int j = 0; j < n; j++)
22-
{
17+
for (int i = 0; i < m; i++) {
18+
for (int j = 0; j < n; j++) {
2319
cout << pic[j][m - 1 - i] << " ";
2420
}
2521
cout << endl;

0 commit comments

Comments
 (0)