結果
問題 | No.1298 OR XOR |
ユーザー |
![]() |
提出日時 | 2020-11-27 21:30:59 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,497 bytes |
コンパイル時間 | 1,411 ms |
コンパイル使用メモリ | 129,296 KB |
最終ジャッジ日時 | 2025-01-16 06:32:10 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 13 |
ソースコード
#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cctype>#include <chrono>#include <cmath>#include <complex>#include <cstdint>#include <cstdlib>#include <deque>#include <functional>#include <iomanip>#include <iostream>#include <limits>#include <list>#include <map>#include <memory>#include <numeric>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <type_traits>#include <unordered_map>#include <utility>#include <vector>/* template start */using i64 = std::int_fast64_t;using u64 = std::uint_fast64_t;i64 operator"" _i64(unsigned long long num){return i64(num);}u64 operator"" _u64(unsigned long long num){return u64(num);}#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)#define all(i) i.begin(), i.end()#ifdef LOCAL#define debug(...) \std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \debug_out(__VA_ARGS__)#else#define debug(...)#endifvoid debug_out() { std::cerr << std::endl; }template <typename Head, typename... Tail>void debug_out(Head h, Tail... t) {std::cerr << " " << h;if (sizeof...(t) > 0) std::cout << " :";debug_out(t...);}template <typename T1, typename T2>std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {return os << pa.first << " " << pa.second;}template <typename T>std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template <typename T1, typename T2>inline bool chmax(T1& a, T2 b) {return a < b && (a = b, true);}template <typename T1, typename T2>inline bool chmin(T1& a, T2 b) {return a > b && (a = b, true);}template <typename Num>constexpr Num mypow(Num a, u64 b, Num id = 1) {if (b == 0) return id;Num x = id;while (b > 0) {if (b & 1) x *= a;a *= a;b >>= 1;}return x;}/* template end */int main() {std::cin.tie(nullptr);std::ios::sync_with_stdio(false);i64 n;std::cin>>n;i64 SIZE=31;i64 cnt=0;i64 a=0,b=0,c=0;rep(i,0,SIZE){if((n>>i)&1){cnt++;if(cnt%2){a += 1ull<<i;b += 1ull<<i;}else{a+= 1ull<<i;c += 1ull<<i;}}}if(cnt==1){std::cout<<"-1 -1 -1\n";return 0;}std::cout<<a<<" "<<b<<" "<<c<<"\n";return 0;}