sealddr

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
    // Here your code !
    unsigned int MAX_N=100000;
    unsigned int n;
    int s[MAX_N]; // source
    int t[MAX_N]; // sink

sealddr

#include <iostream>
using namespace std;

int main(void){
    int c1, c5, c10, c50, c100, c500;
    int A;
    cin >> c1 >> c5 >> c10 >> c50 >> c100 >> c500 >> A;
    int n1, n5, n10, n50, n100, n500;
    int sum=0;
    

sealddr

#include <iostream>
using namespace std;
int main(void){
    // Here your code !
    int n=4;
    int a[]={1,2,4,7};
    int k=15;
    unsigned int maxbmap=(1 << n);
    
    for(int bmap=0; bmap<maxbmap; bmap++){

sealddr

#include <iostream>
#include <queue>
using namespace std;
int main(void){
    // Here your code !
    queue<int> q;
    int n=10;
    for(int i=0; i<n; i++){
        std::cout << "enqueue " << i << std::endl;
        q.push(i);