| 14564 | 2025-01-16 10:26:49 | AGergo | IntervallumXOR kihívás | cpp17 | Accepted 100/100 | 451ms | 3636 KiB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
//cin.tie(0);
//iostream::sync_with_stdio(0);
int q,d,z; cin >>q;
for(int i = 0; i < q; i++)
{
cin >> d;
z = d & 3;
if(z == 0)
{
cout << d << " " << (int)pow(2,32-(int)__builtin_clz(d))-1 <<endl;
}
else if(z == 1)
{
cout << 1 << " " << d << endl;
}
else if(z == 2)
{
cout << d+1 << " " << (int)pow(2,32-(int)__builtin_clz(d))-1 <<endl;;
}
else if(z == 3)
{
cout << 0 << " " << d << endl;
}
}
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| subtask2 | 15/15 | ||||||
| 2 | Accepted | 3ms | 316 KiB | ||||
| subtask3 | 15/15 | ||||||
| 3 | Accepted | 352ms | 2036 KiB | ||||
| subtask4 | 20/20 | ||||||
| 4 | Accepted | 1ms | 316 KiB | ||||
| subtask5 | 50/50 | ||||||
| 5 | Accepted | 433ms | 3380 KiB | ||||
| 6 | Accepted | 451ms | 3636 KiB | ||||