/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

0 vote351 views1 answer
Lcm of 2 numbers in c
C
0 vote310 views1 answer
Tuples in C
C
8 votes359 views2 answers
Millis()
C
2 votes314 views2 answers
Nginx reverse proxy nextcloud
C
0 vote341 views2 answers
C &= operator
C
0 vote317 views1 answer
Sdl close ev
C
0 vote268 views1 answer
Postgres random choice
C
17 votes310 views2 answers
What is chocolatey
C
-1 vote378 views1 answer
Bash while loop n times
C
1 vote312 views1 answer
Markdown empty line
C