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

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

                                                                                            beecrowd | 1099

Sum of Consecutive Odd Numbers II

Adapted by Neilor Tonin, URI  Brazil

                                                                                             Timelimit: 1

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

Read an integer N that is the number of test cases. Each test case is a line containing two integer numbers X and Y. Print the sum of all odd values between them, not including X and Y.

Input

The first line of input is an integer N that is the number of test cases that follow. Each test case is a line containing two integer X and Y.

Output

Print the sum of all odd numbers between X and Y.

Input Sample	Output Sample
7 4 5 13 10 6 4 3 3 3 5 3 4 3 8	0 11 5 0 0 0 12

                                                          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 odds numbers by using condition in loop.

if(number%2 != 0) then it's an odd number. Then we add all those odd 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 1099 Solution in C :   

URI / BEECROWD Online Judge 1099 Solve  in C :

#include<stdio.h>

int main(){
    
    int n;
    int x, y, aux;
    int soma;
    
    scanf("%d",&n);
    
    while(1){
                if(n == 0) break;
                scanf("%d%d",&x,&y);

                if(x > y){
                     aux = x;
                     x = y;
                     y = aux;
                }
                soma = 0;
                for(int i = x+1; i < y; i++){
                       if(i%2 != 0) soma += i;
                }
                printf("%d\n",soma);
                n--;
    }
    return 0;
}

  URI / BEE 1099 Solution in C++ :   

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

#include <iostream>

using namespace std;

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

  URI / BEE 1099 Solution in Python :   

URI / BEECROWD Online Judge 1099 Solve  in Python :

n = int(input())
for i in range(n):
    a,b = list(map(int, input().split()))
    d = 0
    if(a==b):
        print(0)
    else:
        c = 0
        if (a > b):
            c = a
            a = b
            b = c
        while (a < ( b- 1)):
            a += 1
            if(a % 2 != 0):
                d+= a
        print(d)

Previous Problem:

URI / BEE CROWD 1098 - Sequence IJ 4 Solution in C,C++,Python | URI - BEECROWD - BEE 1098 Solution in C,C++,Python

Next Problem:

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

Ashraf URI/BEE Problem Solution