QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#156300 | #7112. XOR Clique | ucup-team1448# | WA | 1ms | 3780kb | C++14 | 588b | 2023-09-02 13:24:31 | 2023-09-02 14:33:30 |
Judging History
answer
#include<bits/stdc++.h>
#define rp(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
template<typename T>void rd(T&x){
x=0;int f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-48;c=getchar();}
x*=f;
}
template<typename T,typename...T2>void rd(T&x,T2&...y){rd(x),rd(y...);}
int bit[32];
int main() {
int n;
rd(n);
rp(i, 1, n) {
int x;
rd(x);
++bit[__lg(x)];
}
int ans = 0;
rp(i, 0, 31) {
ans = max(ans, bit[i]);
}
printf("%d", ans);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3780kb
input:
3 3 1 2 3 3 1 1 1 5 1 2323 534 534 5
output:
result:
wrong output format Output file not found: "/opt/uoj/judger/uoj_judger/work/1.ans"