/C/Uri/beecrowd problem no - 1099 solution in C

Uri/beecrowd problem no - 1099 solution in C

#include<stdio.h>
int main(){
    int N,X,Y,i,j,sum = 0;
    scanf("%d", &N);
    
    for(i = 1; i <= N; i++){
        scanf("%d%d", &X, &Y);
        if(X > Y){
            for(j = Y+1,sum = 0; j < X; j++){
                if(j % 2 != 0){
                    sum += j;
                }
            }
        }else if(X <= Y){
            for(j = X+1,sum = 0; j < Y; j++){
                if(j % 2 != 0){
                    sum += j;
                }
            }
        }
        printf("%d\n", sum);
    }
    return 0;
}

Source: beecrowd.com.br

Similar codes

8 votes136 views3 answers
Swap using third variable
C
0 vote108 views1 answer
Relational Operator in C language
C
33 votes240 views2 answers
Latex font sizes
C
0 vote108 views2 answers
#0000ff
C
0 vote120 views1 answer
(avar == 1) ? (bvar == 2 ? result = 3 : (result = 5);) : (result = 0);
C
0 vote107 views1 answer
C 2d array dimensions
C
0 vote150 views1 answer
Parsing using strtok
C
4 votes111 views2 answers
Bash find only list directories
C
0 vote151 views2 answers
String array input in c
C
0 vote114 views1 answer
Wpdb add temporary while drop table
C