SPOJ

Problem Link #include <iostream> #include <vector> #include <algorithm> #include <cmath> using namespace std; const long long N = 100005, INF = 2e9; long long ans[N], d[N]; long long B[N]; int bsearch(int x, int n) { int low = 1; int high = n; int mid, res; res = 0; while(low <= high) { mid = (low + high) / 2; if(ans[mid] <= x) { res = mid; low = mid + 1; } else { high = mid - 1; } } return res; } int main() { int t, n, q, x; std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> t; B[0] = 1;     for (int i = 1; i <= 60; i++)         B[i] = B[i - 1] + B[i - 1]; while(t--) { cin >> n >> q; long long a[n]; for(int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + n + 1); for(int i = 1; i <= n; i++) { if(d[i - 1] > a[i]) { ans[i] = ans[i - 1]; d[i] = 2 * (d[i - 1] - a[i

Problem Link #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int t, n, q, l, r; vector<int> v; string s; std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> t; while(t--) { cin >> n >> q; cin >> s; v.clear(); for(int i = 0; i < n - 2; i++) { if(s[i] == s[i + 1] || s[i + 1] == s[i + 2] || s[i] == s[i + 2]) { v.push_back(i); } } while(q--) { cin >> l >> r; l--; r--; if(r - l + 1 < 3) { cout << "NO\n"; continue; } auto x = upper_bound(v.begin(), v.end(), l - 1);     if(x == v.end())     {     cout << "NO\n";     }     else if(*x >= l && *x + 2 <= r)       cout << "YES" << endl;       else       cout << "NO\n"; } } }

Problem Link #include <iostream> #include <vector> using namespace std; int main() { int n, q, l, r; cin >> n >> q; long arr[n]; vector<long> b[n]; for(int i = 0; i < n; i++) { cin >> arr[i]; long temp = arr[i]; int x = 0; for(int j = 0; j < 32; j++) { b[i].push_back(0); } while(temp) { b[i][x] = temp % 2; temp /= 2; x++; } } for(int i = 1; i < n; i++) { for(int j = 0; j < 32; j++) { b[i][j] += b[i - 1][j]; } } while(q--) { cin >> l >> r; l --; r--; long res = 0; for(int i = 0; i < 31; i++) { int setBits, unsetBits; if(l > 0) { setBits = b[r][i] - b[l - 1][i]; unsetBits = r - l + 1 - setBits; } else { setBits = b[r][i]; unsetBits = r - l + 1 - setBits; } if(setBits < unsetBits) { res |= (1 << i); } } cout << res << endl;

Problem Link #include <iostream> using namespace std; int main() { int t, n, odd, even; cin >> t; while(t--) { cin >> n; int i,arr[n],freq[1100001]={0}; long res = 0; odd = even = 0; for(int i = 0; i < n; i++) { cin >> arr[i]; freq[arr[i]]++; } for(int i = 0; i < n; i++) { if(arr[i] & 1) { odd++; } else { even++; } } for(int i = 0; i < n; i++) { if(arr[i] % 2) { res += odd; } else { res += even; } res -= freq[arr[i] ^ 2]; res -= freq[arr[i]]; } cout << res / 2 << endl; } }

Problem Link #include <iostream> using namespace std; int main() { int t, n, k; cin >> t; while(t--) { cin >> n >> k; if(n == 1) { cout << k << endl; continue; } if(k == 1) { for(int j = 0; j < n; j++) { cout << "1 "; } cout << endl; continue; } if(k == 2) { cout << "2 "; for(int j = 1; j < n; j++) { cout << "1 "; } cout << endl; continue; } if(k == 3) { if(n % 2) { cout << "3 "; for(int j = 1; j < n; j++) { cout << "1 "; } cout << endl; } else { cout << "2 "; for(int j = 1; j < n; j++) { cout << "1 "; } cout << endl; } continue; } else { long res = 1; while(res <= k) { res =