conversations listlengths 2 2 | Question Name stringclasses 49
values | Question Description stringclasses 49
values | Input Requirements stringclasses 49
values | Output Requirements stringclasses 49
values | Sample Input stringclasses 49
values | Sample Output stringclasses 49
values | Difficulty stringclasses 1
value | Question Source stringclasses 1
value | Question Source URL stringclasses 1
value | Answer Source stringclasses 1
value | Answer Source URL stringclasses 1
value | Exam name stringclasses 1
value | Exam Description stringclasses 1
value | CPE Website stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
[
{
"content": "How to solve \"100 – The 3n + 1 problem\"?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "What is the solution for \"100 – The 3n + 1 problem\"?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "How to implement \"100 – The 3n + 1 problem\" in C++?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Give me a C++ code for \"100 – The 3n + 1 problem\".",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 =... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Do you know the solution for \"100 – The 3n + 1 problem\".",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n in... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Show me the code for \"100 – The 3n + 1 problem\" with explanations.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Generate a code solution for \"100 – The 3n + 1 problem\".",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n in... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "I need a C++ code for \"100 – The 3n + 1 problem\", generate it for me.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "How to solve 100 – The 3n + 1 problem?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "What is the solution for 100 – The 3n + 1 problem?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "How to implement 100 – The 3n + 1 problem in C++?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n,... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Give me a C++ code for 100 – The 3n + 1 problem.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Do you know the solution for 100 – The 3n + 1 problem.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Show me the code for 100 – The 3n + 1 problem with explanations.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Generate a code solution for 100 – The 3n + 1 problem.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "I need a C++ code for 100 – The 3n + 1 problem, generate it for me.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "「100 – The 3n + 1 problem」要怎麼解? ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "「100 – The 3n + 1 problem」的解答是什麼？",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "如何用C++實作「100 – The 3n + 1 problem」？ ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "給我一個「100 – The 3n + 1 problem」的C++程式碼。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "你知道「100 – The 3n + 1 problem」的解法嗎？ ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "撰寫「100 – The 3n + 1 problem」的程式碼並附帶說明。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "生成「100 – The 3n + 1 problem」的程式碼解答。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "我需要「100 – The 3n + 1 problem」的C++程式碼，幫我生成一個。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "100 – The 3n + 1 problem 要怎麼解? ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "100 – The 3n + 1 problem 的解答是什麼？",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "如何用C++實作 100 – The 3n + 1 problem？ ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "給我一個 100 – The 3n + 1 problem 的C++程式碼。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "你知道 100 – The 3n + 1 problem 的解法嗎？ ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "撰寫 100 – The 3n + 1 problem 的程式碼並附帶說明。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "生成 100 – The 3n + 1 problem 的程式碼解答。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt = 1;\n ... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "我需要 100 – The 3n + 1 problem 的C++程式碼，幫我生成一個。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\n \nint main() {\n int i, j;\n while (cin >> i >> j){\n int mx = 0;\n for (int n = min(i, j); n <= max(i, j); n++){\n int n1 = n, cnt... | 100 – The 3n + 1 problem | Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
1. input n
2.... | The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0. You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j. You can assume that no ... | For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear i... | 1 10
100 200
201 210
900 1000
| 1 10 20
100 200 125
201 210 89
900 1000 174
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "How to solve \"118 Mutant Flatworld Explorers\"?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, nC;\n char... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "What is the solution for \"118 Mutant Flatworld Explorers\"?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, n... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "How to implement \"118 Mutant Flatworld Explorers\" in C++?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, nC... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Give me a C++ code for \"118 Mutant Flatworld Explorers\".",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, nC;... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Do you know the solution for \"118 Mutant Flatworld Explorers\".",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, n... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Show me the code for \"118 Mutant Flatworld Explorers\" with explanations.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, ... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Generate a code solution for \"118 Mutant Flatworld Explorers\".",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, n... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "I need a C++ code for \"118 Mutant Flatworld Explorers\", generate it for me.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, co... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "How to solve 118 Mutant Flatworld Explorers?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, nC;\n char d;\... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "What is the solution for 118 Mutant Flatworld Explorers?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, nC;\n... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "How to implement 118 Mutant Flatworld Explorers in C++?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, nC;\n ... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Give me a C++ code for 118 Mutant Flatworld Explorers.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, nC;\n ... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Do you know the solution for 118 Mutant Flatworld Explorers.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, n... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Show me the code for 118 Mutant Flatworld Explorers with explanations.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "Generate a code solution for 118 Mutant Flatworld Explorers.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, n... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "I need a C++ code for 118 Mutant Flatworld Explorers, generate it for me.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
[
{
"content": "「118 Mutant Flatworld Explorers」要怎麼解? ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <map>\nusing namespace std;\nint a[55][55];\nint dx[] = {0, 1, 0, -1}; //N, E, S, W\nint dy[] = {1, 0, -1, 0};\n \nint main() {\n int row, col, R, C, D, nR, nC;\n char d;\n b... | 118 Mutant Flatworld Explorers | Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: artificial intelligence, algorithms and complexity, electrical and mechanical engineering to name a few. In addition, robots as "turtles" (inspired by work by Papert, A... | The first line of input is the upper-right coordinates of the rectangular world, the lower-left coordinates are assumed to be 0,0.
The remaining input consists of a sequence of robot positions and instructions (two lines per robot). A position consists of two integers specifying the initial coordinates of the robot an... | For each robot position/instruction in the input, the output should indicate the final grid position and orientation of the robot. If a robot falls off the edge of the grid the word 'LOST' should be printed after the position and orientation. | 5 3
1 1 E
RFRFRFRF
3 2 N
FRRFLLFFRRFLL
0 3 W
LLFFFLFLFL
| 1 1 E
3 3 N LOST
2 3 S
| One star | Online Judge | https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=0 | Yui Huang's Website | https://yuihuang.com/cpe-level-1/ | null | null | null |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8