백준 15917번: 노솔브 방지문제야!!

https://www.acmicpc.net/problem/15917

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n; cin >> n;
    
    while(n--) {
        int d; cin >> d;
 
        if (!(d & (d-1)) ? 1:0) {
            cout << 1;
        } else {
            cout << 0;
        }
        cout << CENDL;
    }
    return 0;
}