Submission #65003055

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sd second
#define int long long
const int mod = 1e9 + 7;

int powOf(int l, int r)
{
    int c = 0;
    while (l > 0 && l % r == 0)
    {
        l /= r;
        c++;
    }
    return c;
}

int binpow(int n, int x)
{
    if (x == 0)
        return 1;
    int ans = binpow(n, x / 2);
    if (x % 2 == 0)
        return ans * ans;
    else
        return ans * ans * n;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    queue<int> q;
    while (t--)
    {
        int k;
        cin >> k;
        if (k == 1)
        {
            int a;
            cin >> a;
            q.push(a);
        }
        else
        {
            cout << q.front() << endl;
            q.pop();
        }
    }
    return 0;
}

Submission Info

Judge Result