Question 2

 avatar
user_1944374
c_cpp
a year ago
1.3 kB
11
Indexable
Never
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define MOD (int) 1e9 + 7
#define all(x) begin(x), end(x)
typedef long long ll;
using namespace std;
template <typename T> // cin >> vector<T>
istream &operator>>(istream &istream, vector<T> &v) {
    for (auto &it : v)
        cin >> it;
    return istream;
}
template <typename T> // cout << vector<T>
ostream &operator<<(ostream &ostream, const vector<T> &c) {
    for (auto &it : c)
        cout << it << " ";
    return ostream;
}

/*  
    Problem Name: Cash
    Problem Statement:
    You are given a note. What will you say?
    Input format: 
    Number of testcases and for each testcase, one integer.
    Output format:
    Yes or No for each testcase 
    Sample Input:
    6
    2
    1000
    2000
    80
    90
    50
    Sample Output:
    No
    No
    Yes
    No
    No
    Yes
*/

void solve(void) {
    int n; cin >> n;
    if(n == 10 || n == 20 || n == 50 || n == 100 || n == 200 || n == 500 || n == 2000) {
        cout << "Yes\n";
    }
    else cout << "No\n";
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T; cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}