/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 284.0 KiB
#2 Accepted 3ms 320.0 KiB
#3 Accepted 6ms 284.0 KiB
#4 Accepted 7ms 284.0 KiB
#5 Accepted 20ms 768.0 KiB
#6 Accepted 5ms 324.0 KiB
#7 Accepted 21ms 788.0 KiB
#8 Accepted 22ms 1.27 MiB

Code

#include <stdio.h>

int xorUpto(int n) {
    if (n % 4 == 0) return n;
    else if (n % 4 == 1) return 1;
    else if (n % 4 == 2) return n + 1;
    else return 0;
}

int main() {
    int t, n;
    scanf("%d", &t);
    while (t--) {
        scanf("%d", &n);
        printf("%d\n", xorUpto(n));
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1009 XOR Love
Language
C99 (GCC 13.2.0)
Submit At
2025-05-21 20:11:45
Judged At
2025-05-21 20:11:45
Judged By
Score
100
Total Time
22ms
Peak Memory
1.27 MiB