We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://onlinejudge.u-aizu.ac.jp/courses/list
updated at 2023/10/27
The text was updated successfully, but these errors were encountered:
No branches or pull requests
https://onlinejudge.u-aizu.ac.jp/courses/list
updated at 2023/10/27
ITP1 - Introduction to Programming I
1_A : Hello World1_B : X Cubic1_C : Rectangle1_D : Watch2_A : Small, Large, or Equal2_B : Range2_C : Sorting Three Numbers2_D : Circle in a Rectangle3_A : Print Many Hello World3_B : Print Test Cases3_C : Swapping Two Numbers3_D : How Many Divisors?4_A : A / B Problem4_B : Circle4_C : Simple Calculator4_D : Min, Max and Sum5_A : Print a Rectangle5_B : Print a Frame5_C : Print a Chessboard5_D : Structured Programming6_A : Reversing Numbers6_B : Finding Missing Cards6_C : Official House7_A : Grading7_B : How many ways?7_C : Spreadsheet8_A : Toggling Cases8_B : Sum of Numbers8_C : Counting Characters9_B : Shuffle9_C : Card Game9_D : Transformation10_A : Distance10_B : Triangle10_C : Standard Deviation10_D : Distance II11_A : Dice I11_B : Dice II11_C : Dice III11_D : Dice IVALDS1 - Algorithms and Data Structures I
1_A : Insertion Sort1_D : Maximum Profit2_A : Bubble Sort2_B : Selection Sort2_C : Stable Sort2_D : Shell Sort3_A : Stack3_B : Queue3_C : Doubly Linked List3_D : Areas on the Cross-Section Diagram4_A : Linear Search4_B : Binary Search4_D : Allocation5_A : Exhaustive Search5_B : Merge Sort5_C : Koch Curve6_B : Partition6_C : Quick Sort6_D : Minimum Cost Sort7_A : Rooted Trees7_B : Binary Trees7_C : Tree Walk8_A : Binary Search Tree I8_B : Binary Search Tree II8_C : Binary Search Tree III8_D : Treap9_A : Complete Binary Tree9_D : Heap Sort10_A : Fibonacci Number10_B : Matrix Chain Multiplication10_C : Longest Common Subsequence10_D : Optimal Binary Search Tree11_A : Graph11_B : Depth First Search11_C : Breadth First Search11_D : Connected Components13_A : 8 Queens Problem13_C : 15 Puzzle15_A : Change Making15_B : Fractional Knapsack Problem15_C : Activity Selection ProblemITP2 - Introduction to Programming II
1_A : Vector1_B : Deque1_C : List1_D : Vector II2_A : Stack2_B : Queue2_D : Splice3_A : Min-Max3_B : Min-Max Element3_C : Count3_D : Lexicographical Comparison4_A : Reverse4_B : Rotate4_C : Swap4_D : Unique5_A : Sorting Pairs5_B : Sorting Tuples5_D : Permutation Enumeration6_A : Binary Search6_B : Includes6_C : Lower Bound6_D : Equal Range7_A : Set: Search7_B : Set: Delete7_C : Set: Range Search7_D : Multi-Set8_A : Map: Search8_B : Map: Delete8_C : Map: Range Search8_D : Multi-Map9_A : Set Union9_B : Set Intersection9_C : Set Difference9_D : Set Symmetric Difference10_A : Bit Operation I10_B : Bit Operation II10_C : Bit Flag10_D : Bit Mask11_A : Enumeration of Subsets IDSL - Data Sets and Queries
3_A : The Smallest Window I3_B : The Smallest Window II3_C : The Number of Windows5_A : The Maximum Number of CustomersDPL - Discrete Optimization Problems
1_A : Coin Changing Problem2_A : Traveling Salesman Problem2_B : Chinese Postman Problem2_C : Bitonic Traveling Salesman Problem4_A : Coin Combination Problem4_B : Coin Combination Problem IIGRL - Graph Algorithms
CGL - Computational Geometry
6_A : Segment Intersections: Manhattan GeometryNTL - Number Theory
INFO1 - Information
01_A : Output of an Integer01_B : Output of a String01_C : Output of Integers01_D : New Line01_E : Output of Integers with New Lines02_A : Variable02_B : Reassignment02_C : Two Variables02_D : Swap03_A : Echo 103_B : Echo 203_C : Echo 303_D : Echo 403_E : Echo 504_A : Sum04_B : Difference04_C : Product04_D : Quotient04_E : Remainder04_F : Tenth Power04_G : Expression 104_H : Expression 204_I : Expression 305_A : Equivalence05_B : Non-equivalence05_C : Comparison 105_D : Comparison 205_E : Evaluation 106_A : NOT06_B : AND06_C : OR06_D : Logical Expression 106_E : Logical Expression 206_F : Logical Expression 307_A : Branch 107_B : Branch 207_C : Branch 307_D : Branch 407_E : Selection 107_F : Selection 208_A : Repeat N times 108_B : Repeat N times 208_C : Infinite Loop 108_D : Infinite Loop 208_E : Nested Loop 108_F : Nested Loop 208_G : Structuring 108_H : Structuring 209_A : 1D Array: Reading Element09_B : 1D Array: Reading Continuous Elements09_C : 1D Array: Updating Elements09_D : 1D Array: Updating Continuous Elements09_E : 1D Array: As a List09_F : 1D Array: As a Bucket10_A : Character10_B : Character to ASCII Code10_C : ASCII Code to Character10_D : Character Type10_E : String10_F : Length of a String10_G : Characters in String10_H : Converting a String into a Numerical Value11_A : Input a Line11_B : Line Input and Reverse Order Output11_C : Multi-line Input11_D : Multi-line Input and Reverse Order11_E : Conversion of a Line to a Sequence of Numbers11_F : Conversion of Lines to Sequences of NumbersThe text was updated successfully, but these errors were encountered: