/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

2 votes168 views3 answers
Realloc in c
C
0 vote138 views1 answer
Balanced binary tree
C
0 vote160 views1 answer
Memset c
C
3 votes139 views3 answers
Remove element from np array
C
13 votes151 views5 answers
Pandas index
C
1 vote156 views1 answer
Prime number c program
C
0 vote152 views1 answer
C program boilerplate code
C
1 vote105 views6 answers
Linked list
C
3 votes149 views1 answer
Traceroute windows command
C
0 vote167 views1 answer
Vifm preview images
C