Answers for "uri/beecrowd problem no - 1133 solution in C"

C
0

uri/beecrowd problem no - 1133 solution in C

#include<stdio.h>
int main(){
    int X,Y,i;
    
    scanf("%d%d", &X, &Y);
    
    if(X > Y){
        for(i = Y+1; i < X; i++){
            if(i % 5 == 2 || i % 5 == 3){
                printf("%dn", i);
            }
        }
    }else if(X < Y){
        for(i = X+1; i < Y; i++){
            if(i % 5 == 2 || i % 5 == 3){
                printf("%dn", i);
            }
        }
    }
    return 0;
}
Posted by: Guest on January-16-2022

Code answers related to "uri/beecrowd problem no - 1133 solution in C"

Code answers related to "C"

Browse Popular Code Answers by Language