URI / BEE CROWD 1101 - Sequence of Numbers and Sum - Solution in C,C++,Python

URI / BEE CROWD 1101 - Sequence of Numbers and Sum - Solution in C,C++,Python | URI - BEECROWD - BEE 1101 Solution in C,C++,Python

                                                                                        beecrowd | 1101

Sequence of Numbers and Sum

Adapted by Neilor Tonin, URI  Brazil

                                                                                             Timelimit: 1

URI / BEE CROWD 1101 - Sequence of Numbers and Sum - Solution in C,C++,Python | URI - BEECROWD - BEE 1099 Solution in C,C++,Python:

Read an undetermined number of pairs values M and N (stop when any of these values is less or equal to zero). For each pair, print the sequence from the smallest to the biggest (including both) and the sum of consecutive integers between them (including both).

Input

The input file contains pairs of integer values M and N. The last line of the file contains a number zero or negative, or both.

Output

For each pair of numbers, print the sequence from the smallest to the biggest and the sum of these values, as shown below.

Input Sample	Output Sample
5 2 6 3 5 0	2 3 4 5 Sum=14 3 4 5 6 Sum=18

                                                          Demonstration:

This program takes user inputs . Then check the conditions for each test case contains two integer number x and y and compare those two numbers if x is greater than y , then swapping in ascending order and calculating the sum of all  numbers .

Finally print the result.

N.B: Don't copy paste the code as same. Just try to understand it and try yourself.

  URI / BEE 1101 Solution in C :   

URI / BEECROWD Online Judge 1101 Solve  in C :

#include <stdio.h>

int main(){
    
    int n;
    int x, y, aux;
    int soma;
    
    while(1){
 
                scanf("%d%d",&x,&y);
                if(x <= 0) break;
                if(y <= 0) break;
                
                if(x > y){
                     aux = x;
                     x = y;
                     y = aux;
                }
                soma = 0;
                for(int i = x; i <= y; i++){
                       printf("%d ",i);
                       soma += i;
                }
                printf("Sum=%d\n",soma);

    }
    return 0;
}

  URI / BEE 1101 Solution in C++ :   

URI / BEECROWD Online Judge 1101 Solve  in C++ :

#include <iostream>

using namespace std;

int main(){
    
    int n;
    int x, y, aux;
    int soma;
    
    while(true){
                
                cin >> x;
                cin >> y;
                if(x <= 0) break;
                if(y <= 0) break;
                
                if(x > y){
                     aux = x;
                     x = y;
                     y = aux;
                }
                soma = 0;
                for(int i = x; i <= y; i++){
                        cout << i << " ";
                       soma += i;
                }
                cout << "Sum=" << soma << endl;
    }
    return 0;
}

  URI / BEE 1101 Solution in Python :   

URI / BEECROWD Online Judge 1101 Solve  in Python :

while(True):
    try:
        a,b=list(map(int,input().split()))
        x = min(a,b)
        y = max(a,b)
        if(a<=0 or b<=0):
            break
        else:
            sum=0
            result = ''
            for i in range(x,y+1):
                result += str(i)+' '
                sum = sum + i
            result+= 'Sum=%d'
            print(result %sum)
    except EOFError:
        break

Next Problem:

URI / BEE CROWD 1113 - Ascending and Descending - Solution in C,C++,Python | URI - BEECROWD - BEE 1113 Solution in C,C++,Python

Previous Problem:

URI / BEE CROWD 1099 - Sum of Consecutive Odd Numbers II Solution in C,C++,Python 

Ashraf URI/BEE Problem Solution