/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 0ms 284.0 KiB
#2 Accepted 35ms 1.055 MiB
#3 Accepted 65ms 1.496 MiB
#4 Accepted 45ms 2.227 MiB

Code

#include <stdio.h>

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

    while (T--) {
        long long l, r, x;
        scanf("%lld %lld %lld", &l, &r, &x);

        // Try p = l, then q = l - x or l + x
        long long p1 = l + x;
        long long q1 = l - x;

        if (p1 >= l && p1 <= r) {
            printf("%lld %lld\n", p1, l);
        }
        else if (q1 >= l && q1 <= r) {
            printf("%lld %lld\n", l, q1);
        }
        else {
            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:14:21
Judged At
2025-04-06 16:14:21
Judged By
Score
100
Total Time
65ms
Peak Memory
2.227 MiB