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": "你知道 11417 GCD 的解法嗎？ ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n \nint GCD(int x, int y) {\n while ((x %= y) && (y %= x));\n return x + y;\n}\n \nint main() {\n int N, G;\n while (cin >> N && N) {\n G = 0;\n ... | 11417 GCD | Given the value of N, you will have to find the value of G. The definition of G is given below:
G = Σ from i=1 to i<N Σ from j=i+1 to j≤N GCD(i,j)
Here GCD(i,j) means the greatest common divisor of integer i and integer j.
For those who have trouble understanding summation notation, the meaning of G is given in the ... | The input file contains at most 100 lines of inputs. Each line contains an integer N (1 < N < 501). The meaning of N is given in the problem statement. Input is terminated by a line containing a single zero. This zero should not be processed. | For each line of input produce one line of output. This line contains the value of G for corresponding N. | 10
100
500
0 | 67
13015
442011 | 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": "撰寫 11417 GCD 的程式碼並附帶說明。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n \nint GCD(int x, int y) {\n while ((x %= y) && (y %= x));\n return x + y;\n}\n \nint main() {\n int N, G;\n while (cin >> N && N) {\n G = 0;... | 11417 GCD | Given the value of N, you will have to find the value of G. The definition of G is given below:
G = Σ from i=1 to i<N Σ from j=i+1 to j≤N GCD(i,j)
Here GCD(i,j) means the greatest common divisor of integer i and integer j.
For those who have trouble understanding summation notation, the meaning of G is given in the ... | The input file contains at most 100 lines of inputs. Each line contains an integer N (1 < N < 501). The meaning of N is given in the problem statement. Input is terminated by a line containing a single zero. This zero should not be processed. | For each line of input produce one line of output. This line contains the value of G for corresponding N. | 10
100
500
0 | 67
13015
442011 | 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": "生成 11417 GCD 的程式碼解答。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n \nint GCD(int x, int y) {\n while ((x %= y) && (y %= x));\n return x + y;\n}\n \nint main() {\n int N, G;\n while (cin >> N && N) {\n G = 0;\n ... | 11417 GCD | Given the value of N, you will have to find the value of G. The definition of G is given below:
G = Σ from i=1 to i<N Σ from j=i+1 to j≤N GCD(i,j)
Here GCD(i,j) means the greatest common divisor of integer i and integer j.
For those who have trouble understanding summation notation, the meaning of G is given in the ... | The input file contains at most 100 lines of inputs. Each line contains an integer N (1 < N < 501). The meaning of N is given in the problem statement. Input is terminated by a line containing a single zero. This zero should not be processed. | For each line of input produce one line of output. This line contains the value of G for corresponding N. | 10
100
500
0 | 67
13015
442011 | 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": "我需要 11417 GCD 的C++程式碼，幫我生成一個。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n \nint GCD(int x, int y) {\n while ((x %= y) && (y %= x));\n return x + y;\n}\n \nint main() {\n int N, G;\n while (cin >> N && N) {\n ... | 11417 GCD | Given the value of N, you will have to find the value of G. The definition of G is given below:
G = Σ from i=1 to i<N Σ from j=i+1 to j≤N GCD(i,j)
Here GCD(i,j) means the greatest common divisor of integer i and integer j.
For those who have trouble understanding summation notation, the meaning of G is given in the ... | The input file contains at most 100 lines of inputs. Each line contains an integer N (1 < N < 501). The meaning of N is given in the problem statement. Input is terminated by a line containing a single zero. This zero should not be processed. | For each line of input produce one line of output. This line contains the value of G for corresponding N. | 10
100
500
0 | 67
13015
442011 | 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 \"11461 Square Numbers\"?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 \"11461 Square Numbers\"?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 \"11461 Square Numbers\" in C++?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 \"11461 Square Numbers\".",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 \"11461 Square Numbers\".",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 \"11461 Square Numbers\" with explanations.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 \"11461 Square Numbers\".",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 \"11461 Square Numbers\", generate it for me.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 11461 Square Numbers?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 11461 Square Numbers?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 !=... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 11461 Square Numbers in C++?",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 11461 Square Numbers.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 11461 Square Numbers.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 11461 Square Numbers with explanations.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 11461 Square Numbers.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 11461 Square Numbers, generate it for me.",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "「11461 Square Numbers」要怎麼解? ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "「11461 Square Numbers」的解答是什麼？",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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++實作「11461 Square Numbers」？ ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "給我一個「11461 Square Numbers」的C++程式碼。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "你知道「11461 Square Numbers」的解法嗎？ ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "撰寫「11461 Square Numbers」的程式碼並附帶說明。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "生成「11461 Square Numbers」的程式碼解答。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "我需要「11461 Square Numbers」的C++程式碼，幫我生成一個。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "11461 Square Numbers 要怎麼解? ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "11461 Square Numbers 的解答是什麼？",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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++實作 11461 Square Numbers？ ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "給我一個 11461 Square Numbers 的C++程式碼。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "你知道 11461 Square Numbers 的解法嗎？ ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "撰寫 11461 Square Numbers 的程式碼並附帶說明。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "生成 11461 Square Numbers 的程式碼解答。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n1++;\n ... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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": "我需要 11461 Square Numbers 的C++程式碼，幫我生成一個。 ",
"role": "user"
},
{
"content": "#include <iostream>\n#include <cmath>\nusing namespace std;\n \nint main() {\n int a, b;\n while (cin >> a >> b && a + b){\n int n1 = sqrt(a);\n int n2 = sqrt(b);\n if (n1*n1 != a) n... | 11461 Square Numbers | A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some square numbers. Given two numbers a and b you will have to find out how many square numbers are there between a and b (inclusive). | The input file contains at most 201 lines of inputs. Each line contains two integers a and b (0 < a ≤ b ≤ 100000). Input is terminated by a line containing two zeroes. This line should not be processed. | For each line of input produce one line of output. This line contains an integer which denotes how many square numbers are there between a and b (inclusive). | 1 4
1 10
0 0 | 2
3 | 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 \"12019 Doom's Day Algorithm\"?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\",... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 \"12019 Doom's Day Algorithm\"?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 \"12019 Doom's Day Algorithm\" in C++?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 \"12019 Doom's Day Algorithm\".",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"S... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 \"12019 Doom's Day Algorithm\".",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 \"12019 Doom's Day Algorithm\" with explanations.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\",... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 \"12019 Doom's Day Algorithm\".",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 \"12019 Doom's Day Algorithm\", generate it for me.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 12019 Doom's Day Algorithm?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"S... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 12019 Doom's Day Algorithm?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Sat... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 12019 Doom's Day Algorithm in C++?",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Satu... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 12019 Doom's Day Algorithm.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Satur... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 12019 Doom's Day Algorithm.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 12019 Doom's Day Algorithm with explanations.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"F... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 12019 Doom's Day Algorithm.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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 12019 Doom's Day Algorithm, generate it for me.",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", ... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "「12019 Doom's Day Algorithm」要怎麼解? ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sunday\... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "「12019 Doom's Day Algorithm」的解答是什麼？",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sunday... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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++實作「12019 Doom's Day Algorithm」？ ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sun... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "給我一個「12019 Doom's Day Algorithm」的C++程式碼。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "你知道「12019 Doom's Day Algorithm」的解法嗎？ ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sund... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "撰寫「12019 Doom's Day Algorithm」的程式碼並附帶說明。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "生成「12019 Doom's Day Algorithm」的程式碼解答。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sun... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "我需要「12019 Doom's Day Algorithm」的C++程式碼，幫我生成一個。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "12019 Doom's Day Algorithm 要怎麼解? ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sunday\"... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "12019 Doom's Day Algorithm 的解答是什麼？",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sunday\... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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++實作 12019 Doom's Day Algorithm？ ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sund... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "給我一個 12019 Doom's Day Algorithm 的C++程式碼。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "你知道 12019 Doom's Day Algorithm 的解法嗎？ ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sund... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "撰寫 12019 Doom's Day Algorithm 的程式碼並附帶說明。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "生成 12019 Doom's Day Algorithm 的程式碼解答。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday\", \"Sun... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "我需要 12019 Doom's Day Algorithm 的C++程式碼，幫我生成一個。 ",
"role": "user"
},
{
"content": "#include <iostream>\nusing namespace std;\nint doom[13] = {-1, 10, 21, 7, 4, 9, 6, 11, 8, 5, 10, 7, 12};\nstring date[] = {\"Monday\", \"Tuesday\", \"Wednesday\",\n \"Thursday\", \"Friday\", \"Saturday... | 12019 Doom's Day Algorithm | No. Doom's day algorithm is not a method to compute which day the world will end. It is an algorithm created by the mathematician John Horton Conway, to calculate which day of the week (Monday, Tuesday, etc.) corresponds to a certain date.
This algorithm is based in the idea of the doomsday, a certain day of the week ... | The input can contain different test cases. The first line of the input indicates the number of test cases.
For each test case, there is a line with two numbers: M D. M represents the month (from 1 to 12) and D represents the day (from 1 to 31). The date will always be valid. | For each test case, you have to output the day of the week where that date occurs in 2011. The days of the week will be: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday. | 8
1 6
2 28
4 5
5 26
8 1
11 1
12 25
12 31 | Thursday
Monday
Tuesday
Thursday
Monday
Tuesday
Sunday
Saturday | 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": "什麼是CPE程式檢定?",
"role": "user"
},
{
"content": "大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以上的程度。 \n國立虎尾科... | null | null | null | null | null | null | null | null | null | null | null | Collegiate Programming Examination (CPE) | 大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。2010 年 6 月開辦 CPE，2012 年以及之後，每年均舉辦四次 CPE。最近的 CPE，每一次都有四十餘校參與協辦，考生超過 2000 人(最多一次考生，已超過 2700 人)。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以... | https://cpe.mcu.edu.tw/ |
[
{
"content": "介紹一下CPE程式檢定。",
"role": "user"
},
{
"content": "大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以上的程度。 \n國立虎尾... | null | null | null | null | null | null | null | null | null | null | null | Collegiate Programming Examination (CPE) | 大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。2010 年 6 月開辦 CPE，2012 年以及之後，每年均舉辦四次 CPE。最近的 CPE，每一次都有四十餘校參與協辦，考生超過 2000 人(最多一次考生，已超過 2700 人)。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以... | https://cpe.mcu.edu.tw/ |
[
{
"content": "什麼是CPE檢定?",
"role": "user"
},
{
"content": "大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以上的程度。 \n國立虎尾科技大... | null | null | null | null | null | null | null | null | null | null | null | Collegiate Programming Examination (CPE) | 大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。2010 年 6 月開辦 CPE，2012 年以及之後，每年均舉辦四次 CPE。最近的 CPE，每一次都有四十餘校參與協辦，考生超過 2000 人(最多一次考生，已超過 2700 人)。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以... | https://cpe.mcu.edu.tw/ |
[
{
"content": "介紹一下CPE檢定。",
"role": "user"
},
{
"content": "大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以上的程度。 \n國立虎尾科技... | null | null | null | null | null | null | null | null | null | null | null | Collegiate Programming Examination (CPE) | 大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。2010 年 6 月開辦 CPE，2012 年以及之後，每年均舉辦四次 CPE。最近的 CPE，每一次都有四十餘校參與協辦，考生超過 2000 人(最多一次考生，已超過 2700 人)。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以... | https://cpe.mcu.edu.tw/ |
[
{
"content": "CPE檢定是什麼?",
"role": "user"
},
{
"content": "大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以上的程度。 \n國立虎尾科技大... | null | null | null | null | null | null | null | null | null | null | null | Collegiate Programming Examination (CPE) | 大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。2010 年 6 月開辦 CPE，2012 年以及之後，每年均舉辦四次 CPE。最近的 CPE，每一次都有四十餘校參與協辦，考生超過 2000 人(最多一次考生，已超過 2700 人)。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以... | https://cpe.mcu.edu.tw/ |
[
{
"content": "什麼是CPE?",
"role": "user"
},
{
"content": "大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以上的程度。 \n國立虎尾科技大學資... | null | null | null | null | null | null | null | null | null | null | null | Collegiate Programming Examination (CPE) | 大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。2010 年 6 月開辦 CPE，2012 年以及之後，每年均舉辦四次 CPE。最近的 CPE，每一次都有四十餘校參與協辦，考生超過 2000 人(最多一次考生，已超過 2700 人)。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以... | https://cpe.mcu.edu.tw/ |
[
{
"content": "CPE是什麼?",
"role": "user"
},
{
"content": "大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以上的程度。 \n國立虎尾科技大學資... | null | null | null | null | null | null | null | null | null | null | null | Collegiate Programming Examination (CPE) | 大學程式能力檢定 (Collegiate Programming Examination, 簡稱CPE)旨在提升大專學生與相關人員的程式設計能力，由考生透過線上程式設計，利用電腦自動評判，以檢測程式設計能力。2010 年 6 月開辦 CPE，2012 年以及之後，每年均舉辦四次 CPE。最近的 CPE，每一次都有四十餘校參與協辦，考生超過 2000 人(最多一次考生，已超過 2700 人)。CPE 採取現場程式上機考試，封閉與考試無關之網路。目前題目來自著名 Online judge 網站https://onlinejudge.org/ (超過 4500 題，收集自歷次程式競賽題目)，涵蓋難、中、易範圍，極適合大二「資料結構」課程以... | https://cpe.mcu.edu.tw/ |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.