{"categories":["AtCoder","\u5c3a\u53d6\u308a\u6cd5"],"author_url":"https://blog.hatena.ne.jp/tic40/","url":"https://tic40.hatenablog.com/entry/2020/09/29/001447","type":"rich","height":"190","description":"\u554f\u984c D - Xor Sum 2 \u89e3\u6cd5 \u5168\u63a2\u7d22\u3059\u308b\u3068 $O(N{^2})$\u3068\u306a\u308a\u9593\u306b\u5408\u308f\u306a\u3044\u305f\u3081\u3001\u8a08\u7b97\u91cf\u3092\u6e1b\u3089\u3059\u5de5\u592b\u304c\u5fc5\u8981\u306b\u306a\u308b\u3002 \u3053\u306e\u554f\u984c\u306f\u5358\u8abf\u5897\u52a0\u3059\u308b\u533a\u9593\u306e\u6570\u3048\u4e0a\u3052\u306a\u306e\u3067\u3001\u5c3a\u53d6\u308a\u6cd5\u306e\u8981\u9818\u3067\u89e3\u304f\u3053\u3068\u304c\u3067\u304d\u308b\u3002 #include <bits/stdc++.h> using namespace std; using ll = long long; #define REP(i,n) for(int i=0;i<n;i++) int main() { int n,sum=0,r=0; cin >> n; vector<int> a(n); REP(i,n) cin >> a[i]; ll ans=0\u2026","blog_title":"Do Something","version":"1.0","width":"100%","provider_url":"https://hatena.blog","blog_url":"https://tic40.hatenablog.com/","image_url":null,"provider_name":"Hatena Blog","title":"atcoder ABC 098 D - Xor Sum 2","published":"2020-09-29 00:14:47","author_name":"tic40","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftic40.hatenablog.com%2Fentry%2F2020%2F09%2F29%2F001447\" title=\"atcoder ABC 098 D - Xor Sum 2 - Do Something\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}