| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1161933 | buraphon_numberone | Intercastellar (JOI22_ho_t1) | C++20 | 806 ms | 589824 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const char nl = '\n';
int main()
{
cin.tie(nullptr); ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> o;
while(n--)
{
int x, y = 1;
cin >> x;
while(x%2 == 0)
{
x /= 2;
y *= 2;
}
while(y--)
{
o.push_back(x);
}
}
int q;
cin >> q;
while(q--)
{
int j;
cin >> j;
cout << o[j-1] << nl;
}
return (0);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
