# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
761447 | lis05st | Sum Zero (RMI20_sumzero) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "brperm.h"
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll inv(ll n, ll sz){
if(sz == 0)
return 0;
ll res = 0;
for(int i = 0; i < sz; i++){
res += ((n>>i)&1)<<(sz-i);
}
return res;
}
string a;
void init(int n, const char s[]) {
for(int i = 0; i < n; i++)
a.push_back(s[i]);
return;
}
int query(int l, int k) {
for(int i = 0; i < (1 << k); i++)
if(a[l + i] != a[l + inv(i, k)])
return 0;
return 1;
}