/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 0ms 284.0 KiB
#2 Accepted 38ms 1.02 MiB
#3 Accepted 41ms 1.52 MiB
#4 Accepted 47ms 2.27 MiB

Code

#include <stdio.h>

int main() {
    int t;
    scanf("%d", &t);

    while (t--) {
        int l, r, x;
        scanf("%d %d %d", &l, &r, &x);

        int count = 0;


        if (l + x >= l && l + x <= r) {
            printf("%d %d\n", l + x, l);
            count = 1;
        }

        else if (l - x >= l && l - x <= r) {
            printf("%d %d\n", l, l - x);
            count = 1;
        }

        else if (r + x >= l && r + x <= r) {
            printf("%d %d\n", r + x, r);
            count = 1;
        }

        else if (r - x >= l && r - x <= r) {
            printf("%d %d\n", r, r - x);
            count = 1;
        }

        else if (x == 0 && l <= r) {
            printf("%d %d\n", l, l);
            count = 1;
        }

        if (!count) {
            printf("-1 -1\n");
        }
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1186 Equal to X
Contest
Brain Booster #9
Language
C99 (GCC 13.2.0)
Submit At
2025-04-06 16:41:27
Judged At
2025-04-06 16:41:27
Judged By
Score
100
Total Time
47ms
Peak Memory
2.27 MiB