Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
150358 | Guotongzhou | 二进制半整数 | C++ | Wrong Answer | 0 | 4 MS | 272 KB | 408 | 2024-06-02 21:04:11 |
#include <iostream> #include <set> using namespace std; typedef unsigned long long ull; set <ull> book; void add() { for(int i = 0; i <= 31; i++) for(int j = 0; j <= 31; j++) book.insert((1 << i) + (1 << j)); return ; } int main() { add(); int t; ull n; cin >> t; while(t--) { cin >> n; if(book.count(n) != 0) cout << "yes" << endl; else cout << "no"; } return 0; }