Take input till enter is pressed in C++.

-

 I am assuming that you want to read distinct integer values from a line or a test case until enter is pressed. For example, you need to take space separated integers as input until there is a new line.  

First of all, to take input in C++ what we use is "cin". what "cin" does is that it only takes input until there is a space or new line. It do not reads space, so we can't check if the input is '\n' using only "cin", because it completely ignores this space character. 

So, to make our program read this space we need use a more lower version of function to take input. For this we have ".get()", ".getLine()", ".getChar()". We can use .get() to take any specific number of characters as input or .getLine() to take whole line as input untill enter key is pressed. But here is the thing that is going to help us, And that is .getChar(), which can read only a single character but this single character can also be  a space or a  newline character. 

Now whenever we need to take inputs like the following and we do not know there size :

1 2 3 4 6 7 
2 4 6 7
5 6 7 8 9 0

follow following steps:-

STEP1 : read and save a number using cin
STEP2 : read input using getChar()
STEP3 : check if input in STEP2 is space or newline
STEP4 : if input was space repeat from STEP1/ else if newline or '\n' than break from loop

to make such loop we will use do-while loop

do{
        cin >> a[i];
}while( getChar()!= '\n' )

Comments

Post a Comment

Popular posts from this blog

Multiply Strings Leetcode 43 question Correct Solution

-
 Question : Given two non-negative integers  num1  and  num2  represented as strings, return the product of  num1  and  num2 , also described as a string. Note:  You must not use any built-in BigInteger library or directly convert the inputs to integers. Constraints: 1 <= num1.length, num2.length <= 200 num1  and  num2  consist of digits only. Both  num1  and  num2  do not contain any leading zero, except the number  0  itself. /**  * @param {string} num1  * @param {string} num2  * @return {string}  */ var add = function ( a , b ){     // length of a should be smaller     if ( a . length > b . length ) return add ( b , a );     // iterate a     let i = a . length - 1 , j = b . length - 1 , carry = 0 , currAns = '' ;     while ( i >= 0 ){         // get nums        ...
Read more

In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute.

-
Image
Q1 (12 points) In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute. On the answer sheet, enter the values for nij, i = 1, 2, 3, j = 1, 2, 3, 4. Q1. Solution: Aim: Each entry denotes the largest integer n such that f(n) milliseconds do not exceed t. FIRST ROW........................................... i) Solving n11 :   Here , f(n) = 100n + 200 And t = 1 second. so,    where n is an integer   : [t = 1second = 1000ms]  Ans:  ii) Solving n12 Here , f(n) = 100n + 200 And t = 1minute = 60sec = 60000ms Ans :  iii) Solving n13 Here , ...
Read more

Longest Palindromic Substring Solution

-
Image
 Question:  Given a string  s , return  the longest palindromic substring  in  s . Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Solution : Let us create a Table. If the string size is n, then the table will have n rows and n columns. The element a(i, j) of the table will determine whether the substring from index i to j is a palindrome or not. So in this way, we will calculate the maximum length of the palindromic substring.  Now to fill this table we will use the following algorithm:  STEP 1: Create a Table, Where the Row index is the start of the palindrome substring and the column index is the end of the palindromic substring. STEP 2:  Fill the diagonal of the table with 1. Because (i, i) is itself a palindrome of length 1. STEP 3: Fill (i, i+1) by checking adjacent characters. If they are equal then 1, else 0. STEP 4: For every Distance other su...
Read more