Daddy's Journey to Platinum

Additional Problems

1. Shortest Subsequence 
2. Counting Bits 
3. Swap Game 
4. Prufer Code 
5. Acyclic Graph Edges 
6. Strongly Connected Edges 
7. Even Outdegree Edges 
8. Multiplication Table 
9. Advertisement
10. Special Substrings 
11. Permutation Inversions 
12. Maximum Xor Subarray 
13. Movie Festival Queries 
14. Chess Tournament 
15. Tree Traversals 
16. Network Renovation 
17. Graph Girth 
18. Intersection Points 
19. Inverse Inversions 
20. Monotone Subsequences 
21. String Reorder 
22. Stack Weights 
23. Pyramid Array 
24. Increasing Subsequence II 
25. String Removals 
26. Bit Inversions 
27. Xor Pyramid 
28. Writing Numbers 
29. String Transform 
30. Letter Pair Move Game 
31. Maximum Building I 
32. Sorting Methods 
33. Cyclic Array
34. List of Sums 
35. Increasing Array II 
36. Food Division 
37. Bit Problem 
38. Swap Round Sorting 
39. Binary Subsequences 
40. Tree Isomorphism I 
41. Counting Sequences 
42. Critical Cities 
43. School Excursion 
44. Coin Grid 
45. Robot Path 
46. Programmers and Artists 
47. Course Schedule II
48. Removing Digits II 
49. Coin Arrangement 
50. Counting Bishops 
51. Grid Puzzle I 
52. Grid Puzzle II 
53. Empty String 
54. Grid Paths 
55. Bit Substrings 
56. Reversal Sorting 
57. Counting Reorders 
58. Book Shop II 
59. Network Breakdown 
60. Visiting Cities 
61. Missing Coin Sum Queries 
62. Number Grid 
63. Maximum Building II 
64. Filling Trominos 
65. Stick Divisions 
66. Coding Company 
67. Flight Route Requests 
68. Two Stacks Sorting 
69. Tree Isomorphism II 
70. Forbidden Cities 
71. Area of Rectangles 
72. Grid Completion 
73. Creating Offices 
74. Permutations II 
75. Functional Graph Distribution 
76. New Flight Routes 
77. Grid Path Construction 

CSES Problem Set 소개 (link)

출처: https://train.usaco.org/usacogate

문제 설명

입력 양식

출력

입력 예 

출력 예

문제 풀이 내용

프로그램 내용

#define MAX_M 161

/// check co-prime a, b -> gcd(a, b) == 1
int CoPrime(int a, int b);

vector <pair<int, int>> sequence;

int main() {
    sequence.push_back(make_pair(0,1));

	for (int denominator = 1; denominator < M+1 ; ++denominator)
        for (int numerator  = 1; numerator < denominator ; ++numerator)
            if( CoPrime(numerator, denominator) == 1)
                sequence.push_back(make_pair(numerator, denominator));

	sequence.push_back(make_pair(1,1));

    sort(sequence.begin()+1, sequence.end()-1, compare2);

    for (int idx= 0; idx < sequence.size(); ++idx)
        fout << sequence[idx].first << "/" << sequence[idx].second << endl;

Chapter 2.  Bigger Challenges