/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 vote185 views1 answer
Google business customer care number india 24/7
C
0 vote191 views1 answer
C program to compare 2 strings using user defined function
C
0 vote190 views1 answer
Recursion c prime number
C
1 vote203 views1 answer
Grepper VSCode Add On
C
0 vote199 views1 answer
Data breach
C
7 votes186 views3 answers
C type conversion
C
0 vote213 views1 answer
1000000000
C
0 vote233 views1 answer
Router solicitation and advertisement magic is used by
C
4 votes203 views1 answer
What is ide?
C
1 vote195 views2 answers
Get chunks of a mp4 in ffmpeg
C