/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Time Exceeded ≥986ms ≥428.0 KiB
#2 Time Exceeded ≥986ms ≥416.0 KiB
#3 Time Exceeded ≥995ms ≥420.0 KiB
#4 Time Exceeded ≥997ms ≥412.0 KiB
#5 Time Exceeded ≥996ms ≥412.0 KiB
#6 Time Exceeded ≥985ms ≥420.0 KiB
#7 Time Exceeded ≥969ms ≥416.0 KiB
#8 Time Exceeded ≥1000ms ≥412.0 KiB

Code


#include <stdio.h>

int main() {
    int t,i,j,n,xr=0;
    scanf("%d",&t);
    for (i=1;i<=t;i++){
        scanf("%d",&n);
        for(j=1;j<=n;j++){
            xr=xr^j;
        }
        
        printf("%d\n",xr);
        xr=0;
        
        
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1009 XOR Love
Language
C99 (GCC 13.2.0)
Submit At
2023-12-31 11:35:55
Judged At
2023-12-31 11:35:55
Judged By
Score
0
Total Time
≥1000ms
Peak Memory
≥428.0 KiB