結果

問題 No.1674 Introduction to XOR
コンテスト
ユーザー Anshumann Garg
提出日時 2022-01-18 18:26:10
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 770 bytes
コンパイル時間 1,581 ms
コンパイル使用メモリ 166,684 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-23 13:24:59
合計ジャッジ時間 2,540 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:1:
In member function 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]',
    inlined from 'int32_t main()' at main.cpp:35:13:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:202:25: warning: 'ans' may be used uninitialized [-Wmaybe-uninitialized]
  202 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
main.cpp: In function 'int32_t main()':
main.cpp:20:9: note: 'ans' was declared here
   20 |     int ans;
      |         ^~~

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define oo (int)(1e17)

int32_t main() {
//     cin.sync_with_stdio(false);
//     cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("out1.txt", "w", stdout);
// #endif
    int n;
    cin >> n;
    int a[n + 3];
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int ans;
    for (int i = 0; i <= 63; i++) {
        int curr = (1ll << i);
        int ch = 0;
        for (int j = 1; j <= n; j++) {
            if ((curr ^ a[j]) != (curr + a[j])) {
                ch = 1;
                break;
            }
        }
        if (ch == 0) {
            ans = curr;
            break;
        }
    }
    cout << ans;
}
0