Problem StatementMathew is developing a program to determine whether the digits of a given integer form an arithmetic sequence. An arithmetic sequence is a sequence of numbers in which the difference between consecutive terms is constant.Write a program that accomplishes this task using the auto keyword for local variable declarations.Example: Let us assume the number is 1234, the difference between all consecutive digits is 1, which is constant. So it forms an arithmetic sequence.Input format :The input consists of an integer N declared as an auto variable, representing the number to be checked.Output format :If the digits of N form an arithmetic sequence, the output prints "Yes".Otherwise, the output prints "No".Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:1 ≤ N ≤ 106Sample test cases :Input 1 :1234Output 1 :YesInput 2 :369Output 2 :YesInput 3 :3214Output 3 :No

Question

...expand

🧐 Not the exact question you are looking for?Go ask a question

Solution

Here is a simple C++ program that accomplishes the task:

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    auto N = 0;
    std::cin >> N;

    std::vector<int> digits;
    while (N > 0) {
        digits.push_back(N % 10);
        N /= 10;
    }

    std::reverse(digits.begin(), digits.end());

    auto diff = digits[1] - digits[0];
    for (int i = 2; i < digits.size(); i++) {
        if (digits[i] - digits[i - 1] != diff) {
            std::cout << "No" << std::endl;
            return 0;
        }
    }

    std::cout << "Yes" << std::endl;
    return 0;
}

This program works by first reading the input number and extracting its digits into a vector. It then checks if the difference between each pair of consecutive digits is the same. If it finds a pair where the difference is not the same, it prints "No" and exits. If it checks all pairs and doesn't find any such pair, it prints "Yes".

This problem has been solved

Similar Questions

Jessi wants to write a program where a recursive function, recursiveFunc, is called with an input integer n. Inside the function, a local variable m is initialized to 3 using the auto keyword. The program prints the value of m before and after each recursive call. The input integer n is obtained from the user in the main function.Input format :The input consists of an integer n.

Problem StatementGiven three integers A, B, C where 'A' denotes the first term of an arithmetic sequence, 'C' denotes the common difference between an arithmetic sequence and an integer 'B'. You need to tell whether 'B' exists in the arithmetic sequence or not. Return 1 if B is present in the sequence. Otherwise, return 0. Example 1Input: A = 1, B = 3, C = 2Output: 1Explanation: 3 is the second term of the sequence starting with 1 and having a common difference of 2.Example 2Input: A = 1, B = 2, C = 3Output: 0Explanation: 2 is not present in the sequence. Example 3Input: A = 2, B = 4, C = 0Output: 0Explanation: In arithmetic progression starting from 2 with common difference 0, 4 cannot be reached since the sequence remains constant. Hence, the output is 0.Note: This question was used in the FactSet coding test.Input format :The input consists of three space-separated integers values A, B, and C, representing the first term 'A' of the arithmetic sequence, 'B' to check, and the common difference 'C' of the arithmetic sequence.Output format :The output displays 1 if 'B' is present in the arithmetic sequence, otherwise, it displays 0.Refer to the sample output for the formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:-100 ≤ A, B, C ≤ 100Sample test cases :Input 1 :1 3 2Output 1 :1Input 2 :1 2 3Output 2 :0Input 3 :-3 -9 -3Output 3 :1Input 4 :2 4 0Output 4 :0

Philip is given the following expression: (++n) * (--m). Design a program for Philip that takes initial values for variables m and n, evaluates the expression, and prints the result. Ensure that the program handles pre-increment (++n) and pre-decrement (--m) operations correctly.Input format :The input consists of two space-separated integers representing the values of m and n.Output format :The output displays an integer representing the result of the given expression.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:10 ≤ m, n ≤ 500Sample test cases :Input 1 :10 12Output 1 :117Input 2 :485 500Output 2 :242484Input 3 :100 25Output 3 :2574

Marshall, the eager young programmer, is excited to tackle a coding challenge. He aims to write a program that checks if the digits of an integer form an arithmetic sequence. Help Marshall design and write this program using a do-while loop.Input format :The input consists of an integer N, representing the number to be checked.Output format :If the digits of N form an arithmetic sequence, then print "The digits of N form an arithmetic sequence."Else, print "The digits of N do not form an arithmetic sequence."Refer to the sample output for formatting specifications.Code constraints :1 ≤ N ≤ 109Sample test cases :Input 1 :1234Output 1 :The digits of 1234 form an arithmetic sequence.Input 2 :3214Output 2 :The digits of 3214 do not for

Single File Programming QuestionProblem StatementImagine Mary is developing a program to calculate the digital root of a positive integer. The digital root of a positive integer is the number obtained by repeatedly summing the digits until a one-digit sum is obtained. For example, for the number 873597, the digital root is calculated in the following steps:-> 8 + 7 + 3 + 5 + 9 + 7 = 39 -> 3 + 9 = 12 -> 1 + 2 = 3 Write a program that will read in a positive integer and write both its digital root and the number of steps required to obtain it.Note: This question was asked in ACM-ISPC contest.Input format :The input consists of a positive integer n.Output format :The first line displays "Digital Root: " followed by the digital root of n.The second line displays "Number of Steps: " followed by the number of steps required to reach a single-digit digital root.Refer to the sample output for the formatting specificationsCode constraints :In the given scenario, the test cases fall under the following constraints:2 ≤ n ≤ 106Sample test cases :Input 1 :123Output 1 :Digital Root: 6Number of Steps: 1Input 2 :2Output 2 :Digital Root: 2Number of Steps: 0Input 3 :873597Output 3 :Digital Root: 3Number of Steps: 3Input 4 :1000000Output 4 :Digital Root: 1Number of Steps: 1

1/2

Upgrade your grade with Knowee

Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.