Changed format of time-traveler answer to one line and updated prob.md

Author: TianLangHin

competition/time-traveler/prob.md

@@ -25,38 +25,44 @@ To avoid raising suspicions from ASIC or impacting the market significantly, you
 
 ## Input
 
-- The first line contains `T` - the number of testcases
-- For the next `T` pairs of lines (each representing a seperate testcase):
-	- The  first line contains an integer `N` - the number of days
-	- The  second line contains `N` integers `price[1], price[2], ..., price[n]` - the stock prices for the next `N` days, seperated by space.
+- The first line contains `T` - the number of test cases
+- For the next `T` pairs of lines (each representing a separate test case):
+	- The first line contains an integer `N` - the number of days
+	- The second line contains `N` integers `price[1], price[2], ..., price[n]` - the stock prices for the next `N` days, separated by space.
 
 ## Output
 
-Output `T` lines of number, each contains a single integer representing the maximum profit you can make for each test case.
+Output a single line, containing `T` space-separated integers.
+Each integer will represent the maximum profit that you can make in each test case,
+corresponding in the order by which the test cases were provided.
 
 ## Constraints
 
-- `2 <= N <= 3 * 10^5`
-- `1 <= price[i] <= 10^6`
-- The sum of `N` over all test cases will not exceed `3*10^5`
+- `2 <= N <= 3 * 10^5`,
+- `1 <= price[i] <= 10^6`,
+- The sum of `N` over all test cases will not exceed `3*10^5`.
 
 ## Example
 
-#### Input
+### Input
 
+In this example, `T` is `1`.
+The next two lines are thus part of the one and only test case in this example.
+Here, `N` is `9`, followed by a single line with 9 space-separated integers.
 ```
 1
-9  
+9
 10 5 4 7 9 12 6 2 10
 ```
 
-#### Output
+### Output
 
+Here, the solution is a single line containing the solution of the one test case we are provided.
 ```
 20
 ```
 
-#### Explanation
+### Explanation
 
 To get the maximum profit, we will make these transactions:
 - Buy a share at day `2` at price `5`
@@ -66,4 +72,4 @@ To get the maximum profit, we will make these transactions:
 - Buy a share at day `8` at price `2`
 - Sell a share at day `9` at price `10`
 
-The total profit is `0 - 5 - 4 + 9 + 12 - 2 + 10 = 20`
+The total profit is `0 - 5 - 4 + 9 + 12 - 2 + 10 = 20`.

competition/time-traveler/src/main.cpp

@@ -149,26 +149,31 @@ int main(int argc, char* argv[]){
         // To retrieve submitted answers, query each line one by one until no more lines are found.
         std::vector<long long> submittedAnswers;
 
+        std::stringstream ss;
         std::string line;
         std::getline(std::cin, line);
-        for (int i = 0; !line.empty(); ++i, std::getline(std::cin, line)){
+        ss << line << ' ';
+
+        std::getline(ss, line, ' ');
+        while (!line.empty()) {
             try {
                 submittedAnswers.push_back(std::stoll(line));
             } catch (const std::invalid_argument& error){
-                std::cerr << "Line " << (i + 1) << " of your answer is not a valid integer.\n";
+                std::cerr << "Your solution contains an invalid integer: " << line << "\n";
                 return 1;
             } catch (const std::out_of_range& error){
-                std::cerr << "Line " << (i + 1) << " contains an invalid 64-bit integer.\n";
+                std::cerr << "Your solution contains an out-of-range value for 64-bit integers: " << line << "\n";
                 return 1;
             }
+            std::getline(ss, line, ' ');
         }
 
         // Compare the submitted answers with the expected answers.
         if (submittedAnswers == answers){
             return 0;
         }
         else if (submittedAnswers.size() != answers.size()){
-            std::cerr << "Wrong solution format: there should be " << NUM_TESTCASES << " lines.\n";
+            std::cerr << "There should be " << NUM_TESTCASES << " entries, but got " << submittedAnswers.size() << ".\n";
             return 1;
         }
         else{