text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
using INT = long long;
int a[100100];
map<int, int> mp;
INT solve(int L, int R) {
if (L > R) return 0;
int md = (L + R) / 2;
INT ans = solve(L, md - 1) + solve(md + 1, R);
mp.clear();
int sum = 0;
for (int i = md; i >= L; i--) {
sum += a[i];
mp[sum]++;
}
ans += mp[0];
sum = 0;
for (int i = md + 1; i <= R; i++) {
sum += a[i];
if (mp.count(-sum)) ans += mp[-sum];
}
return ans;
}
int main() {
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%1d", a + i);
a[i]--;
}
cout << solve(1, n) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 29;
const long long LLINF = (1LL << 60LL);
const long long MOD = 1000000007;
const long long MAX_V = 500;
const long long MAX = 2100000;
const double pi = acos(-1);
const double eps = 1e-10;
long long dx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
long long dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void solve() {
string s;
long long n;
cin >> n >> s;
long long a[100010];
for (long long i = 0; i < n; i++) {
a[i] = s[i] - '0';
a[i]--;
}
map<long long, long long> mp;
long long sum[100010] = {};
for (long long i = 0; i < n; i++) {
sum[i + 1] = sum[i] + a[i];
}
mp[sum[n]]++;
long long ans = 0;
for (long long i = n - 1; i >= 0; i--) {
ans += mp[sum[i]];
mp[sum[i]]++;
}
cout << ans << endl;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
long long t;
cin >> t;
for (long long i = 0; i < t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t-- > 0) {
string s;
int n;
cin >> n;
cin >> s;
mp.clear();
int sum = 0;
long long ans = 0;
for (int i = 1; i <= n; ++i) {
int x = s[i - 1] - '0';
++mp[sum - i + 1];
sum += x;
ans += mp[sum - i];
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double P = 3.141592653589793;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
string s;
cin >> n >> s;
int pref[n + 1];
pref[0] = 0;
for (int i = 1; i <= n; i++) {
pref[i] = pref[i - 1] + s[i - 1] - '0' - 1;
}
vector<int> res;
long long ans = 0;
for (int i = 0; i < n + 1; i++) {
res.push_back(pref[i]);
}
sort(res.begin(), res.end());
long long x = 0;
int cur = res[0];
for (int i = 0; i < n + 1; i++) {
if (cur == res[i])
x++;
else {
cur = res[i];
ans += (((x) - (1)) * (x)) / 2;
x = 1;
}
}
if (x) {
ans += (((x) - (1)) * (x)) / 2;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long res;
long long arr[100010];
unordered_map<long long, long long> cnt;
int main() {
ios_base::sync_with_stdio(false);
int T;
cin >> T;
while (T--) {
cin >> n;
res = 0;
for (int i = 0; i < n; i++) {
char c;
cin >> c;
arr[i] = (c - '0');
arr[i]--;
}
long long currsum = 0;
for (int i = 0; i < n; i++) {
currsum += arr[i];
if (currsum == 0) res++;
res += cnt[currsum];
cnt[currsum]++;
}
cout << res << endl;
cnt.clear();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void input(vector<T> &arr, long long int n) {
T temp;
for (long long int i = 0; i < n; i++) cin >> temp, arr.push_back(temp);
}
template <typename T>
void output(vector<T> arr) {
T temp;
for (auto x : arr) cout << x << " ";
cout << endl;
}
template <typename T>
void input_set(set<T> &arr, long long int n) {
T temp;
for (long long int i = 0; i < n; i++) cin >> temp, arr.insert(temp);
}
long long int power(long long int num, long long int base) {
if (base == 0) return 1;
if (base % 2)
return (num % 1000000007 * power(num, base - 1) % 1000000007) % 1000000007;
else {
long long int x = power(num, base / 2);
x = (x * x) % 1000000007;
return x;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int testcases;
cin >> testcases;
while (testcases--) {
long long int ans = 0, s = 0, n, i, x1 = INT_MAX, x2 = -INT_MAX;
map<long long int, long long int> m;
string a;
cin >> n;
cin >> a;
for (i = 0; i < a.length(); i++) {
m[s - i]++;
x1 = min(x1, s - i);
x2 = max(x2, s - i);
s = s + (a[i] - '0');
}
m[s - i]++;
for (i = x1; i <= x2; i++) {
ans = ans + (m[i] * (m[i] - 1)) / 2;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int sum(std::vector<long long int> arr, long long int n,
long long int givensum) {
unordered_map<long long int, long long int> pSum;
long long int res = 0;
long long int csum = 0;
for (long long int i = 0; i < n; i++) {
csum += arr[i];
if (csum == givensum) res++;
if (pSum.find(csum - givensum) != pSum.end())
res += (pSum[csum - givensum]);
pSum[csum]++;
}
return res;
}
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
long long int ttt;
cin >> ttt;
while (ttt--) {
long long int n;
cin >> n;
string input;
cin >> input;
vector<long long int> arr(n);
for (long long int i = 0; i < n; i++) arr[i] = input[i] - 49;
cout << sum(arr, n, 0) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator+(ostream &out, const vector<T> &vec) {
for (const auto &x : vec) {
out << x << " ";
}
out << "\n";
return out;
}
template <typename T>
ostream &operator*(ostream &out, const vector<T> &vec) {
for (const auto &x : vec) {
out + x;
}
return out;
}
template <typename T>
istream &operator>>(istream &in, vector<T> &vec) {
for (auto &x : vec) {
in >> x;
}
return in;
}
void DBG() {
cerr << "]"
<< "\n";
}
template <class H, class... T>
void DBG(H h, T... t) {
cerr << ts(h);
if (sizeof...(t)) cerr << ", ";
DBG(t...);
}
template <class T>
bool ckmin(T &a, const T &b) {
return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T &a, const T &b) {
return a < b ? a = b, 1 : 0;
}
const int mod = 1e9 + 7;
const int mod2 = 998244353;
const long long INF = 1e9 + 6;
long long add(long long a, long long b) {
a += b;
return a % mod;
}
long long mul(long long a, long long b) {
a *= b;
return a % mod;
}
inline void lprint(int a) {
long long i = 0;
char S[20];
if (a == 0) {
putchar('0');
putchar('\n');
return;
}
while (a > 0) {
S[i++] = a % 10 + '0';
a = a / 10;
}
--i;
while (i >= 0) putchar(S[i--]);
putchar('\n');
}
inline long long readInt() {
register bool minus = false;
long long result = 0;
register char ch;
ch = getchar();
while (true) {
if (ch == '-') break;
if (ch >= '0' && ch <= '9') break;
ch = getchar();
}
if (ch == '-')
minus = true;
else
result = ch - '0';
while (true) {
ch = getchar();
if (ch < '0' || ch > '9') break;
result = result * 10 + (ch - '0');
}
if (minus)
return -result;
else
return result;
}
inline long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MXN = 3e3 + 5;
void solve() {
int long long n;
cin >> n;
string s;
cin >> s;
unordered_map<long long, long long> mp;
mp[0] = 1;
long long ans = 0;
long long a = 0;
for (int i = 0; i < n; i++) {
a += s[i] - '0';
ans += mp[a - i - 1];
mp[a - i - 1]++;
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> v(n);
for (int i = 0; i < n; i++) v[i] = s[i] - '0' - 1;
map<int, int> m;
long long sum = 0, ans = 0;
m[0] = 1;
for (int i = 0; i < n; i++) {
sum += v[i];
if (m[sum] != 0) {
ans += m[sum];
}
m[sum]++;
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
cin >> t;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
std ::ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
string s;
cin >> s;
long long pref = 0, res = 0;
unordered_map<long long, long long> mp;
mp[0] = 1;
for (long long i = 0; i < n; i++) {
pref += s[i] - '0';
if (mp.find(pref - (i + 1)) != mp.end()) res += mp[pref - (i + 1)];
mp[pref - (i + 1)]++;
}
cout << res << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
char s[n];
cin >> s;
map<int, int> mp;
mp[0] = 1;
long long ans = 0;
for (int i = 0, sum = 0; i < n; i++) {
int x = s[i] - '0' - 1;
sum += x;
ans += mp[sum];
mp[sum]++;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using uint = unsigned int;
int main() {
int t;
scanf("%i", &t);
while (t--) {
int n;
scanf("%i", &n);
std::string a(n, (char)0);
std::cin >> a;
int sumset[900009]{};
long long out{};
int sum{};
for (int i{}; i < n; ++i) {
sum += a[i] - 49;
++sumset[sum + 100000];
}
for (int i{0}; i < 900009; ++i)
out += (((long long)sumset[i] * (sumset[i] - 1)) >> 1);
out += sumset[100000];
std::cout << out << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
const long long N = 100010;
long long a[N];
long long ans[N];
signed main() {
long long _;
cin >> _;
while (_--) {
long long n;
cin >> n;
for (long long i = 1; i <= n; i++) scanf("%1d", &a[i]);
for (long long i = 1; i <= n; i++) ans[i] = a[i] + ans[i - 1];
long long res = 0;
for (long long i = 1; i <= n; i++)
for (long long j = i; j <= n; j++) {
if (ans[j] - ans[i - 1] == j - i + 1) res++;
}
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
string s;
cin >> s;
vector<int> p(n + 1);
for (int i = 0; i < n; i++) {
p[i + 1] = p[i] + s[i] - '0';
}
long long int ans = 0;
map<long long int, long long int> mp;
for (int i = 0; i <= n; i++) {
ans += mp[p[i] - i];
mp[p[i] - i]++;
}
cout << ans << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
void st() {
int n;
string s;
cin >> n >> s;
map<int, int> M;
M[1] = 1;
ll ans = 0;
int sp = 1;
for (int i = 0; i < n; ++i) {
sp += s[i] - 49;
ans += M[sp];
M[sp]++;
}
cout << ans << (char)10;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
for (int i = 0; i < t; ++i) {
if (t < 50) {
cerr << "-------------------" << (char)10;
}
st();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
map<long long, int> mp;
mp[0]++;
long long sum = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
sum += (s[i] - '0');
ans += mp[sum - (i + 1)];
mp[sum - (i + 1)]++;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
const double pi = 2.0 * acos(0.0);
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
int t, kase = 1;
cin >> t;
A:
while (t--) {
long long n, i, j, k;
string s;
cin >> n >> s;
map<long long, long long> mp;
long long ans = 0, sum = 0;
mp[sum] = 1;
for (i = 0; i < n; i++) {
sum += (s[i] - '1');
ans += mp[sum];
mp[sum]++;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100010];
int sum[100010];
map<int, int> mp;
int main() {
int t;
cin >> t;
while (t--) {
mp.clear();
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) a[i + 1] = s[i] - '0' - 1;
int sum = 0;
long long res = 0;
for (int i = 1; i <= n; i++) {
sum += a[i];
if (sum == 0) res++;
res += mp[sum]++;
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 100010;
long long a[N];
long long ans[N];
signed main() {
long long _;
cin >> _;
while (_--) {
long long n;
cin >> n;
string s;
cin >> s;
long long cnt = 0;
for (auto x : s) a[++cnt] = x - '0';
long long sum = 0, ans = 0;
;
map<long long, long long> m;
m[0] = 1;
for (long long i = 1; i <= n; i++)
sum += a[i], ans += m[sum - i], m[sum - i]++;
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
char s[N];
int main() {
int t;
scanf("%d", &t);
while (t--) {
map<long long, long long> mp;
long long n;
scanf("%lld", &n);
scanf("%s", s);
long long sum = 0, ans = 0;
long long x;
for (int i = 1; i <= n; i++) {
x = s[i - 1] - '0' - 1;
sum += x;
if (sum == 0) ans++;
ans += mp[sum];
mp[sum]++;
}
printf("%lld\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
int t, n;
map<long long, int> mp;
map<long long, int>::iterator it;
int main() {
cin >> t;
while (t--) {
scanf("%d", &n);
long long sum = 0;
mp[0] = 1;
for (int i = 1; i <= n; i++) {
char x;
scanf(" %c", &x);
sum += x - '0';
mp[sum - i]++;
}
long long answ = 0;
for (it = mp.begin(); it != mp.end(); ++it) {
int val = (*it).second;
answ += val * 1ll * (val - 1) / 2;
}
printf("%lld\n", answ);
mp.clear();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long int t = 1;
cin >> t;
while (t--) {
long long int n;
cin >> n;
string s;
cin >> s;
long long int sum;
long long int ans = 0;
sum = 0;
map<long long int, long long int> m;
m[0] = 1;
vector<long long int> p;
for (long long int i = 0; i < s.length(); i++) {
long long int d = s[i] - 48 - 1;
p.push_back(d);
}
for (long long int i = 0; i < n; i++) {
sum += p[i];
if (m.find(sum) != m.end()) ans += m[sum];
m[sum]++;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
void solve() {
long long n;
cin >> n;
string s;
cin >> s;
map<int, int> cnt;
cnt[0] = 1;
long long sum = 0, ans = 0;
for (int i = 1; i <= n; i++) {
sum += s[i - 1] - '0';
ans += cnt[sum - i];
cnt[sum - i]++;
}
cout << ans << endl;
}
int main() {
int tc = 1;
cin >> tc;
while (tc--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long t, n, a[100005], dd[3000005];
char c;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
while (t--) {
cin >> n;
long long tong = 0;
long long ans = 0;
dd[100000] = 1;
for (int i = 1; i <= n; i++)
cin >> c, a[i] = c - '0', tong += a[i], ans += dd[tong - i + 100000],
dd[tong - i + 100000]++;
tong = 0;
for (int i = 1; i <= n; i++) tong += a[i], dd[tong - i + 100000] = 0;
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T, n, t;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++) {
scanf("%1d", &t);
v[i] = v[i - 1] + t;
}
unordered_map<int, long long> m;
for (int i = 1; i <= n; i++) {
v[i] -= i;
if (m.find(v[i]) != m.end())
m[v[i]]++;
else
m[v[i]] = 1;
}
long long cnt = 0;
for (auto i = m.begin(); i != m.end(); i++) {
cnt += (*i).second * ((*i).second - 1) / 2;
if ((*i).first == 0) cnt += (*i).second;
}
printf("%lld\n", cnt);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
ll n;
cin >> n;
string s;
cin >> s;
map<ll, ll> mp;
mp[0]++;
ll ans = 0, sum = 0;
for (int i = 0; i < n; i++) {
sum += (int)s[i] - '0';
ans += mp[sum - (i + 1)];
mp[sum - (i + 1)]++;
}
cout << ans << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
string s;
cin >> n >> s;
map<int, int> m;
long long sm = 0, cnt = 0;
m[0] = 1;
for (int i = 0; i < n; i++) {
sm += s[i] - '0';
cnt += m[sm - (i + 1)];
m[sm - (i + 1)]++;
}
cout << cnt << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int inf = 2e9;
const long long MOD = 998244353;
const int MAX = 2e8 + 1;
const long long int N = 1000000;
using namespace std;
void solve() {
int n;
string s;
cin >> n >> s;
long long ans = 0, prefixSum = 0;
map<int, int> map;
map[prefixSum]++;
for (int i = 0; i < n; ++i) {
prefixSum += s[i] - '0';
ans += map[prefixSum - i - 1];
map[prefixSum - i - 1]++;
}
cout << ans << endl;
}
int main() {
int tc;
cin >> tc;
while (tc--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long tc;
cin >> tc;
while (tc--) {
long long n;
cin >> n;
string s;
cin >> s;
vector<long long> pref(n + 1);
pref[0] = 0;
for (long long i = 0; i < (long long)n; ++i) {
pref[i + 1] = pref[i] + s[i] - '1';
}
vector<long long> data;
map<long long, long long> mp;
long long now = 0;
for (long long i = 0; i < (long long)n + 1; ++i) {
if (mp.count(pref[i]) == 0) {
mp[pref[i]] = now++;
data.push_back(1);
} else {
data[mp[pref[i]]]++;
}
}
long long ans = 0;
for (long long i = 0; i < (long long)data.size(); ++i) {
ans = ans + data[i] * (data[i] - 1) / 2;
}
cout << ans << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
string s;
cin >> s;
vector<long long> a(n);
for (long long i = 0; i < n; i++) {
long long x = s[i] - '0';
a[i] = x;
}
vector<long long> pre(n + 1);
pre[0] = 0;
map<long long, long long> freqs;
for (long long i = 0; i < n; i++) {
pre[i + 1] = a[i] + pre[i];
}
for (long long i = 0; i <= n; i++) {
pre[i] = pre[i] - i;
freqs[pre[i]]++;
}
cout << endl;
long long cnt = 0;
for (auto i : freqs) {
long long val = i.second;
cnt += (val * (val - 1)) / 2;
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N], sum[N];
map<long long, long long> mp;
int main() {
int T;
cin >> T;
while (T--) {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) a[i] = s[i] - '0' - 1;
sum[0] = a[0];
for (int i = 1; i < n; i++) sum[i] = sum[i - 1] + a[i];
long long res = 0;
for (int i = 0; i < n; i++) mp[sum[i]]++;
for (auto i : mp) {
long long t = i.second;
if (i.first == 0)
res += t + t * (t - 1) / 2;
else if (t > 1)
res += t * (t - 1) / 2;
}
cout << res << endl;
mp.clear();
}
}
|
#include <bits/stdc++.h>
const double pi = acos(-1.0);
using namespace std;
int fact(int n) { return (n == 0) || (n == 1) ? 1 : n * fact(n - 1); }
void sieve(long long n) {
bool check[n + 1];
memset(check, true, sizeof(check));
for (long long i = 2; i * i <= n; i++)
if (check[i] == true)
for (long long j = i * i; j <= n; j += i) check[j] = false;
for (long long i = 2; i <= n; i++) {
if (check[i] == true) {
cout << i << " ";
}
}
}
bool isprime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
int n;
cin >> n;
string a;
cin >> a;
map<long long int, long long int> mp;
long long sum = 0, ans = 0;
mp[0] = 1;
for (int i = 0; i < n; i++) {
sum += (a[i] - '0') - 1;
mp[sum]++;
}
for (auto x : mp) {
ans += (x.second * (x.second - 1)) / 2;
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
const long long M = 1e9 + 7;
long long power(long long a, long long n) {
if (n == 0) return 1;
if (n == 1) return a;
if (n & 1) return (a * power(a, n - 1)) % M;
long long res = power(a, n / 2);
return (res * res) % M;
}
void test_case() {
long long n;
cin >> n;
string s;
cin >> s;
unordered_map<long long, long long, custom_hash> mp;
mp[0] = 1;
long long sum = 0;
for (long long i = 0; i < n; i++) {
long long d = s[i] - '0';
sum += d - 1;
mp[sum]++;
}
long long res = 0;
for (auto i : mp) {
res += (i.second * (i.second - 1)) / 2;
}
cout << res << '\n';
return;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cout.setf(ios::fixed);
cout.precision(32);
;
long long tc = 1;
cin >> tc;
while (tc--) {
test_case();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int KINF = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int _;
cin >> _;
while (_--) {
int n;
cin >> n;
string s;
cin >> s;
unordered_map<int, int> mp;
long long ans = 0;
int sum = 0;
mp[0] = 1;
for (int i = (int)0; i < (int)n; ++i) {
sum += s[i] - '1';
if (mp.count(sum)) ans += mp[sum];
mp[sum] += 1;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int n, i, sum = 0;
cin >> n;
string s;
cin >> s;
unordered_map<long long int, long long int> m;
m[1] = 1;
for (i = 0; i < n; i++) {
sum += s[i] - '0';
m[sum - i]++;
}
long long int ans = 0;
for (auto i : m) {
ans += ((i.second) * (i.second - 1) / 2);
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 910001;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t, n;
string s;
cin >> t;
while (t--) {
cin >> n >> s;
map<int, int> m;
m[n]++;
int cnt = n;
long long ans = 0;
for (int i = 0; i < (int)n; i++) {
cnt += s[i] - '1';
ans += m[cnt];
m[cnt]++;
}
cout << ans << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
void solve() {
long long n;
cin >> n;
string s;
cin >> s;
vector<long long> pre(n + 2, 0);
for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + (s[i - 1] - '0');
long long ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
ans += (pre[j] - pre[i - 1]) == (j - i + 1);
}
}
cout << ans << endl;
}
int main() {
int tc = 1;
cin >> tc;
while (tc--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[100001];
void solve() {
long long int n, ans = 0;
string s;
cin >> n >> s;
for (int i = int(1); i <= int(n); i++) a[i] = s[i - 1] - '0' - 1;
unordered_map<long long int, long long int> prev;
long long int curr = 0;
for (int i = int(1); i <= int(n); i++) {
curr += a[i];
if (curr == 0) ans++;
if (prev.find(curr) != prev.end()) ans += (prev[curr]);
prev[curr]++;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
string s;
cin >> t;
for (int i = 0; i != t; i++) {
long long res = 0;
unordered_map<int, int> subsums;
subsums[0]++;
cin >> n >> s;
int curr = 0;
for (char x : s) {
curr += x - '0' - 1;
res += subsums[curr];
(subsums[curr])++;
}
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void print(T t) {
cout << t << endl;
}
int n = 0;
long long solve(int n, string s) {
long long ans = 0;
vector<int> a(n);
for (int i = 0; i < n; ++i) a[i] = s[i] - '1';
long long sum = 0;
map<long long, int> countMap;
countMap[0] = 1;
for (int i = 0; i < n; ++i) {
sum += a[i];
ans += countMap[sum];
countMap[sum] += 1;
}
return ans;
}
int main() {
int t = 0;
cin >> t;
while (t--) {
cin >> n;
string s;
cin >> s;
print(solve(n, s));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long a = 0, b = getchar(), c = 1;
while (!isdigit(b)) c = b == '-' ? -1 : 1, b = getchar();
while (isdigit(b)) a = a * 10 + b - '0', b = getchar();
return a * c;
}
long long T, n, sum, ans, a[100005], dp[1100005];
string s;
int main() {
T = read();
while (T--) {
n = read();
ans = sum = 0;
cin >> s;
for (int i = 0; i < s.size(); i++) a[i] = s[i] - '0';
for (int i = 0; i < n; i++) sum += a[i];
for (int i = 0; i <= sum + n + 1; i++) dp[i] = 0;
sum = n + 1, dp[n + 1] = 1;
for (int i = 0; i < n; i++) {
sum += a[i] - 1;
ans += dp[sum];
dp[sum]++;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 1, 0, 0, 0, 0, 0, 0};
int dy[] = {0, 0, 1, -1, 0, 0, 0, 0};
const long long inf = 10000000000;
const int seivesize = 1000005;
const double eps = 0.000000009;
int* seive;
vector<int> primes;
void fill() {
seive = new int[seivesize];
primes.clear();
for (int i = 0; i < seivesize; i++) {
seive[i] = 1;
}
seive[0] = seive[1] = 0;
for (int i = 2; i < seivesize; i++) {
if (seive[i] == 1) {
primes.push_back(i);
for (int j = i + i; j < seivesize; j = j + i) {
seive[j] = 0;
}
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n];
string s;
cin >> s;
for (int i = 0; i < n; i++) {
a[i] = s[i] - '0' - 1;
}
map<long long, long long> f;
long long ans = 0;
f[a[0]]++;
if (a[0] == 0) ans++;
for (int i = 1; i < n; i++) {
a[i] += a[i - 1];
if (a[i] == 0) ans++;
ans += f[a[i]];
f[a[i]]++;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, i, j;
cin >> t;
while (t-- > 0) {
int n;
cin >> n;
int a[n];
vector<long long int> pre(n + 1, 0), map(10 * n + 1, 0);
for (i = 0; i < n; i++) {
char c;
cin >> c;
a[i] = c - '0';
a[i]--;
}
map[n]++;
for (i = 1; i < n + 1; i++) {
pre[i] = pre[i - 1] + a[i - 1];
map[pre[i] + n]++;
}
long long int sum = 0;
for (i = 0; i < (10 * n) + 1; i++) {
sum += map[i] * (map[i] - 1) / 2;
}
cout << sum << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T, n, t;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++) {
scanf("%1d", &t);
v[i] = v[i - 1] + t;
}
unordered_map<int, long long> m;
m[0] = 1;
for (int i = 1; i <= n; i++) {
v[i] -= i;
if (m.find(v[i]) != m.end())
m[v[i]]++;
else
m[v[i]] = 1;
}
long long cnt = 0;
for (auto i = m.begin(); i != m.end(); i++) {
cnt += (*i).second * ((*i).second - 1) / 2;
}
printf("%lld\n", cnt);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long PM(long long a, long long b) { return ((a % b) + b) % b; }
void solve() {
int n;
cin >> n;
string a;
cin >> a;
long long sum = 0;
long long ans = 0;
map<long long, long long> m;
m[0] = 1;
for (int i = 0; i < n; i++) {
sum += a[i] - '0';
ans += m[sum - i - 1];
m[sum - i - 1]++;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
long long MM = 1e9 + 7;
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0 || b == 0) return abs(a - b);
long long res = a % b;
while (res) {
a = b;
b = res;
res = a % b;
}
return b;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
long long min(long long a, long long b) {
if (a < b)
return a;
else
return b;
}
long long numberofdiviser(long long a) {
long long ans = 0;
long long i;
for (i = 1; i * i < a; i++) {
if (a % i == 0) ans += 2;
}
if (i * i == a) ans++;
return ans;
}
void fival(long long* a, long long b, long long n) {
for (int i = 0; i < n; i++) {
a[i] = b;
}
}
long long sum, ans, l, r, x;
long long ss(vector<long long> a, vector<long long>& b, int ii) {
for (int i = ii; i < a.size(); i++) {
b.push_back(a[i]);
sum += a[i];
if (b.size() > 1 && sum >= l && sum <= r && b[b.size() - 1] - b[0] >= x)
ans++;
ss(a, b, i + 1);
sum -= b[b.size() - 1];
b.pop_back();
}
return ans;
}
unsigned long long fact(long long n) {
if (n == 0) return 1;
long long r = n * fact(n - 1);
r %= MM;
return r;
}
unsigned long long Combinations(unsigned long long n, unsigned long long r) {
if (r > n) return 0;
if (r * 2 > n) r = n - r;
if (r == 0) return 1;
unsigned long long res = n;
for (int i = 2; i <= r; ++i) {
res *= (n - i + 1);
res /= i;
}
return res;
}
long long pow(long long a, long long b, long long m) {
if (b == 0) return 1;
if (b == 1) return a;
long long x = pow(a, b / 2, m);
x = (x * x) % m;
if (b % 2) x = (x * a);
return x % m;
}
int solve() {
int n;
cin >> n;
string s;
cin >> s;
long long sum = 0;
map<long long, long long> mp;
long long res = 0;
mp[1] = 1;
for (int i = 0; i < n; i++) {
sum += s[i] - 48;
res += mp[sum - i];
mp[sum - i]++;
}
cout << res << '\n';
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int nax = 1e5 + 10;
void solve() {
int n;
cin >> n;
int a[nax];
string s;
cin >> s;
long long ans = 0;
for (int i = 1; i <= n; ++i) {
a[i] = (s[i - 1] - '0');
}
map<int, int> mp;
long long sum = 0;
mp[0] = 1;
for (int i = 1; i <= n; ++i) {
sum += a[i] - 1;
ans += mp[sum];
mp[sum]++;
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, e, i, j, ii, jj, zx, xc, f[100009], tes, t;
string s;
long long pas;
map<int, int> k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> tes;
for (t = 1; t <= tes; t++) {
cin >> a;
cin >> s;
s.insert(0, "0");
for (i = 1; i <= a; i++) {
f[i] = s[i] - '0';
}
k.clear();
pas = 0;
for (i = 1; i <= a; i++) {
f[i] += f[i - 1];
k[f[i - 1] - i + 1]++;
pas += k[f[i] - i];
}
cout << pas << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
const int MX = 100005;
int a[MX];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
long long ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%1d", &a[i]);
a[i] += a[i - 1];
}
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
ans += (long long)(a[j] - a[i - 1] == j - i + 1);
}
}
printf("%lld\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x == 0) return y;
return (gcd(y % x, x));
}
string Tolower(string s) {
transform(s.begin(), s.end(), s.begin(), ::tolower);
return s;
}
string Toupper(string s) {
transform(s.begin(), s.end(), s.begin(), ::toupper);
return s;
}
bool prime[100001];
void sieve() {
memset(prime, true, sizeof(prime));
prime[0] = prime[1] = false;
for (long long i = 2; i * i < 100001; i++)
if (prime[i] == true)
for (long long j = i * i; j < 100001; j += i) prime[j] = false;
return;
}
vector<long long> primef(5000001, -1);
void primefact() {
for (long long i = 2; i < 5000001; i++) {
if (primef[i] == -1) {
primef[i] = i;
for (long long j = i * i; j < 5000001; j += i)
if (primef[j] == -1) primef[j] = i;
}
}
return;
}
bool lenaplcheck(pair<string, int> &a, pair<string, int> &b) {
return (a.first).size() < (b.first).size();
}
bool mycomp(pair<long long, long long> &p, pair<long long, long long> &p1) {
double a, b;
a = (double)p.second / (double)p.first;
b = (double)p1.second / (double)p1.first;
return (a < b);
}
long long fib(long long n) {
double b = (sqrt(5) + 1) / 2;
return round(pow(b, n) / sqrt(5));
}
void solve() {
long long t;
cin >> t;
while (t--) {
long long n, ans = 0;
cin >> n;
string s;
cin >> s;
vector<long long> a(n + 1);
map<long long, long long> m;
for (long long i = 1; i <= n; i++) {
a[i] = (long long)(s[i - 1] - '0');
a[i] += a[i - 1];
}
m[0] = 1;
for (long long i = 1; i <= n; i++) {
if (m.find(a[i] - i) != m.end()) ans += m[a[i] - i];
m[a[i] - i]++;
}
cout << ans << "\n";
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n, ans = 0;
cin >> n;
vector<long long int> v(n + 1, 0);
map<long long int, long long int> mp;
string s;
cin >> s;
mp[0] = 1;
for (long long int i = 1; i <= n; i++) {
v[i] = s[i - 1] - '0' - 1;
v[i] += v[i - 1];
mp[v[i]]++;
}
for (auto i : mp) ans += i.second * (i.second - 1) / 2;
cout << ans << endl;
}
signed main() {
long long int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
int long long MAX_SIZE = 1000006;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(6);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
unordered_map<long long int, long long int> make_pair;
make_pair[0] = 1;
long long int sum = 0;
long long int res = 0;
for (int i = 0; i < n; i++) {
int x = s[i] - '0';
x--;
sum += x;
res += (long long)make_pair[sum];
make_pair[sum]++;
}
cout << res << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
char c[100010];
long long i, q, n, a[100010], s[100010];
int main() {
cin >> q;
while (q--) {
cin >> n;
memset(s, 0, sizeof(s));
for (i = 1; i <= n; i++) {
cin >> c[i];
a[i] = (c[i] - '0');
s[i] = s[i - 1] + a[i];
}
map<long long, long long> Q;
Q[0] = 1;
long long cur = 0, res = 0;
for (i = 1; i <= n; i++) {
cur += a[i] - 1;
res += Q[cur];
Q[cur]++;
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
const long long M = 1e9 + 7;
long long power(long long a, long long n) {
if (n == 0) return 1;
if (n == 1) return a;
if (n & 1) return (a * power(a, n - 1)) % M;
long long res = power(a, n / 2);
return (res * res) % M;
}
void test_case() {
long long n;
cin >> n;
string s;
cin >> s;
long long sum = 0;
unordered_map<long long, long long, custom_hash> mp;
mp[0] = 1;
for (long long i = 0; i < n; i++) {
long long digit = s[i] - '0';
sum += digit;
mp[sum - (i + 1)]++;
}
long long res = 0;
for (auto i : mp) {
res += (i.second * (i.second - 1)) / 2;
}
cout << res << '\n';
return;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cout.setf(ios::fixed);
cout.precision(32);
;
long long tc = 1;
cin >> tc;
while (tc--) {
test_case();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long findSubarraySum(vector<long long> arr, long long n, long long sum) {
unordered_map<long long, long long> prevSum;
long long res = 0;
long long currsum = 0;
for (long long i = 0; i < n; i++) {
currsum += arr[i];
if (currsum == sum) res++;
if (prevSum.find(currsum - sum) != prevSum.end())
res += (prevSum[currsum - sum]);
prevSum[currsum]++;
}
return res;
}
void GetSol() {
long long n;
cin >> n;
string s;
cin >> s;
long long ans = 0, cnt = 0;
vector<long long> v, t;
for (long long i = 0; i < s.size(); i++) {
v.push_back(s[i] - '0' - 1);
}
cout << findSubarraySum(v, v.size(), 0) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t = 1;
cin >> t;
while (t--) {
GetSol();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100004;
const int INF = 0x3f3f3f3f;
int a[MAXN];
int pre[MAXN];
char s[MAXN];
map<int, int> mp;
int main() {
int T;
scanf("%d", &T);
while (T--) {
int n;
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i) {
a[i] = s[i] - '0';
pre[i] = pre[i - 1] + a[i] - 1;
}
long long ans = 0;
mp[0] = 1;
for (int i = 1; i <= n; ++i) {
ans += mp[pre[i]];
++mp[pre[i]];
}
printf("%lld\n", ans);
mp.clear();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void adde(vector<long long int> adj[], long long int u, long long int v) {
adj[u].push_back(v);
adj[v].push_back(u);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
string s;
cin >> s;
map<long long int, long long int> m;
m[0] = 1;
long long int ans = 0;
long long int sum = 0;
for (long long int i = 0; i < n; i++) {
long long int temp = s[i];
temp -= 49;
sum += temp;
if (m.find(sum) == m.end()) {
m[sum] = 1;
} else {
ans += m[sum];
m[sum]++;
}
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
vector<int> v(n);
for (int i = 0; i < n; i++) {
v[i] = (s[i] - '0' - 1);
}
unordered_map<int, int> umap;
int sum = 0;
long long count = 0;
for (int i = 0; i < n; i++) {
sum += v[i];
if (sum == 0) {
count++;
}
if (umap.find(sum) != umap.end()) {
count += (long long)umap[sum];
}
umap[sum]++;
}
cout << count << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
string s;
cin >> s;
long long int a[n];
for (long long int i = 0; i < n; i++) {
a[i] = s[i] - '0';
}
long long int x = n + 1;
long long int b[x];
b[0] = 0;
for (long long int i = 1; i < x; i++) {
b[i] = a[i - 1] + b[i - 1];
}
long long int c[n + 1];
for (long long int i = 0; i < x; i++) {
c[i] = b[i] - i;
}
map<long long int, long long int> m;
for (long long int i = 0; i < x; i++) {
m[c[i]]++;
}
long long int count = 0;
for (auto itr : m) {
count = count + (itr.second * (itr.second - 1)) / 2;
}
cout << count << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-3;
inline int sgn(const double &x) { return x < -eps ? -1 : x > eps; }
const long long INF = 0x3f3f3f3f;
template <class T>
inline void cmin(T &a, T b) {
((a > b) && (a = b));
}
template <class T>
inline void cmax(T &a, T b) {
((a < b) && (a = b));
}
long long PRIMES[223] = {
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37,
41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89,
97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,
157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223,
227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359,
367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433,
439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,
509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593,
599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,
661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743,
751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827,
829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911,
919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997,
1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069,
1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163,
1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249,
1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321,
1327, 1361, 1367, 1373, 1381, 1399, 1409};
const int maxn = 2e5 + 5;
const long long mode = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long GC(pair<long long, long long> x) {
long long a = x.first;
long long b = x.second;
return b ? gcd(b, a % b) : a;
}
long long Pow(long long a, long long b) {
long long sum = 1;
a = a % mode;
b = b % (mode - 1);
while (b) {
if (b & 1) sum = sum * a % mode;
b >>= 1;
a = a * a % mode;
}
return sum;
}
long long mul(long long a, long long b) {
long long ans = 0;
a %= mode, b %= mode;
while (b) {
if (b & 1) ans = (ans + a) % mode;
a = (a * 2) % mode;
b >>= 1;
}
return ans;
}
string s;
unordered_map<long long, long long> mp;
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int t;
cin >> t;
while (t--) {
mp.clear();
int n;
cin >> n;
cin >> s;
long long ans = 0;
long long sum = 0;
mp[0] = 1;
for (int i = 0; i <= n - 1; ++i) {
long long num = s[i] - '1';
sum += num;
if (mp[sum]) ans += mp[sum];
mp[sum]++;
}
cout << ans << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int biomialCoeff(long long int n, long long int k) {
long long int res = 1;
if (k > n - k) k = n - k;
for (long long int i = 0; i < k; ++i) {
res *= (n - i);
res /= (i + 1);
res %= 1000000007;
}
return res;
}
long long int binomialCoeff(long long int n, long long int k) {
long long int res = 1;
if (k > n - k) k = n - k;
for (long long int i = 0; i < k; ++i) {
res *= (n - i);
res /= (i + 1);
res %= 1000000007;
}
return res;
}
signed main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t = 1;
cin >> t;
while (t--) {
long long int n;
long long int global = 0;
cin >> n;
string str;
cin >> str;
map<long long int, vector<long long int> > m;
long long int second = 0;
for (long long int(i) = (0); (i) < (n); (i)++) {
second += 1 - (str[i] - '0');
m[second].push_back(i);
}
long long int ans = 0;
second = 0;
for (long long int(i) = (0); (i) < (n); (i)++) {
second += 1 - (str[i] - '0');
if ((str[i] - '0') == 1) ans++;
long long int k = 0;
k = second;
k += (str[i] - '0') - 1;
if (m.find(k) == m.end()) continue;
vector<long long int>::iterator it =
upper_bound(m[k].begin(), m[k].end(), i);
if (it != m[k].end()) ans += distance(it, m[k].end());
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string str;
cin >> str;
long long int dp[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) dp[i] = dp[i - 1] + str[i - 1] - '0';
map<long long int, long long int> mp;
mp[0]++;
long long int cnt = 0;
for (int i = 1; i <= n; i++) {
if (mp.find(dp[i] - i) != mp.end()) cnt += mp[dp[i] - i];
mp[dp[i] - i]++;
}
cout << cnt << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> vec[1000009], vec2[1000009];
long long int arr[100009];
int main() {
long long int a, b, c, d, e, i, j, k, l, n, m, x, y, t, p;
string st;
cin >> t;
for (p = 1; p <= t; p++) {
cin >> n;
m = n * 10;
for (i = 0; i <= m; i++) {
vec[i].clear();
vec2[i].clear();
}
cin >> st;
for (i = 1; i <= n; i++) {
arr[i] = st[i - 1] - '0';
}
x = 0;
for (i = 1; i <= n; i++) {
x += arr[i];
if (x >= i) {
a = x - i;
vec[a].push_back(i);
} else {
a = i - x;
vec2[a].push_back(i);
}
}
x = 0;
long long int ans = 0;
for (i = 1; i <= n; i++) {
if (x >= (i - 1)) {
a = x - (i - 1);
l = vec[a].size();
if (l > 0) {
b = lower_bound(vec[a].begin(), vec[a].end(), i) - vec[a].begin();
ans += (l - b);
}
} else {
a = (i - 1) - x;
l = vec2[a].size();
if (l > 0) {
b = lower_bound(vec2[a].begin(), vec2[a].end(), i) - vec2[a].begin();
ans += (l - b);
}
}
x += arr[i];
}
printf("%lld\n", ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
const double PI = acos(-1);
const long long MOD = 200003;
int v[4000000];
void solve() {
int n;
cin >> n;
map<int, int> dp;
dp[0] = 1;
long long tot = 0, formas = 0;
string txt;
cin >> txt;
for (int i = 0; i < n; i++) {
v[i] = txt[i] - '0';
v[i]--;
tot += v[i];
formas += dp[tot];
dp[tot]++;
}
cout << formas << endl;
}
int main() {
ios::sync_with_stdio(false);
int casos;
cin >> casos;
while (casos--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int t;
int n;
string s;
map<int, int> cnt;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> t;
while (t--) {
cin >> n >> s;
cnt.clear();
long long ans = 0;
int cur = 0;
for (int i = 0; i < s.size(); i++) {
cur += s[i] - '0' - 1;
if (cur == 0)
ans += cnt[cur] + 1;
else
ans += cnt[cur];
cnt[cur]++;
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long min(long long a, long long b) {
if (a < b)
return a;
else
return b;
}
long long max(long long a, long long b) {
if (a < b)
return b;
else
return a;
}
long long min3(long long a, long long b, long long c) {
return min(a, min(b, c));
}
long long max3(long long a, long long b, long long c) {
return max(a, max(b, c));
}
long long ceil1(long long x, long long y) {
if (x % y)
return (x + y) / y;
else
return x / y;
}
long long NC = 100;
long long N = 1e7 + 9;
const long long second = 1e6 + 7;
long long mod(long long n);
long long gcd(long long a, long long b);
long long modM(long long n, long long m);
long long modA(long long n, long long m);
long long modS(long long n, long long m);
long long power(long long a, long long b);
void pra(long long a[], long long n);
void ipgraph(long long n, long long m);
vector<vector<long long> > v;
vector<bool> vis;
void solve() {
long long n;
cin >> n;
string s;
cin >> s;
vector<long long> sum(n + 1);
sum[0] = 0;
for (long long i = 0; i < n; i++) {
sum[i + 1] = sum[i] + s[i] - '0';
}
map<long long, long long> mp;
for (long long i = 0; i < n; i++) mp[sum[i + 1] - i - 1]++;
long long ans = 0;
mp[0]++;
for (auto x : mp) {
ans += (x.second) * (x.second - 1) / 2;
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
cin >> t;
while (t--) solve();
cerr << endl
<< "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
<< "ms\n";
return 0;
}
void ipgraph(long long n, long long m) {
v.assign(n, {});
vis.assign(n, 0);
long long x, y;
char ch;
for (long long i = 0; i < m; i++) {
cin >> x >> ch >> y;
x--, y--;
v[y].push_back(x);
v[x].push_back(y);
}
}
long long gcd(long long a, long long b) {
if (b > a) return gcd(b, a);
if (b == 0) return a;
return gcd(b, a % b);
}
long long power(long long a, long long b) {
if (b == 0) return 1;
long long c = power(a, b / 2);
if (b % 2 == 0)
return modM(c, c);
else
return modM(modM(c, c), a);
}
void pra(long long a[], long long n) {
for (long long i = 0; i < n; i++) cout << a[i] << " ";
cout << '\n';
}
long long mod(long long n) { return (n % N + N) % N; }
long long modM(long long n, long long m) { return ((n % N * m % N) + N) % N; }
long long modA(long long n, long long m) { return ((n % N + m % N) + N) % N; }
long long modS(long long n, long long m) { return ((n % N - m % N) + N) % N; }
|
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e5 + 100;
long long n, ar[MAX], p[MAX], l[10 * MAX], ans = 0;
string cad;
void solve() {
cin >> n >> cad;
ans = 0;
for (long long i = 0; i < n; ++i) ar[i] = cad[i] - '0';
long long sum = 0;
p[0] = n;
for (long long i = 0; i < n; ++i) {
sum += ar[i];
p[i + 1] = sum - (i + 1) + n;
}
for (long long i = 0; i < n + 1; ++i) l[p[i]]++;
for (long long i = 0; i < 10 * n + 1; ++i) ans += (l[i] * (l[i] - 1)) >> 1;
cout << ans << '\n';
for (long long i = 0; i < n + 1; ++i) p[i] = 0;
for (long long i = 0; i < 9 * n + 1; ++i) l[i] = 0;
}
int main() {
ios_base::sync_with_stdio;
int tc;
cin >> tc;
while (tc--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long num[100005];
string s;
int main() {
ios::sync_with_stdio(false);
int t, n;
cin >> t;
while (t--) {
cin >> n;
map<long long, long long> m;
long long ans = 0;
cin >> s;
int len = s.length();
num[0] = s[0] - '0' - 1;
m[0] = 1;
m[num[0]]++;
for (int i = 1; i < len; ++i) {
num[i] = num[i - 1] + s[i] - '0' - 1;
m[num[i]]++;
}
for (auto a : m) {
ans += (a.second - 1) * a.second / 2;
}
cout << ans << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, sx = 0, sy = 0, sz = 0, j, jj, cnt = 0, t, m, u = 0, l = 0;
cin >> t;
while (t--) {
cin >> n;
string s;
cin >> s;
vector<int> v(n);
for (i = 0; i < n; i++) {
v[i] = s[i] - '0' - 1;
}
map<long long int, long long int> mp;
long long int sum = 0, cnt = 0;
for (i = 0; i < n; i++) {
sum += v[i];
if (sum == 0) {
cnt++;
}
if (mp.find(sum) != mp.end()) {
cnt += mp[sum];
}
if (mp.find(sum) != mp.end()) {
mp[sum]++;
} else
mp[sum] = 1;
}
cout << cnt << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
mp.clear();
int n;
cin >> n;
int ar[n + 2];
ar[0] = 0;
long long ans = 0;
string s;
cin >> s;
for (int i = 1; i <= n; i++) {
ar[i] = s[i - 1] - '0';
ar[i] += ar[i - 1];
if (ar[i] == i) ans++;
ans += mp[ar[i] - i];
mp[ar[i] - i]++;
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long t;
cin >> t;
while (t--) {
long long n;
string str;
cin >> n >> str;
vector<long long> a(n), pref(n + 1, 0);
map<long long, long long> m;
for (long long i = 0; i < n; i++) {
a[i] = str[i] - '0';
pref[i + 1] = pref[i] + a[i];
m[pref[i + 1] - (i + 1)]++;
}
long long ans = 0;
for (long long i = 0; i < n; i++) {
long long curr = pref[i + 1] - (i + 1);
if (curr == 0) {
ans += m[curr];
} else {
if (m[curr] != 1) ans += m[curr] - 1;
}
if (m[curr] == 1) {
m.erase(curr);
} else
m[curr]--;
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const long long N = 2e6 + 10;
const long long dx[8] = {1, 0, -1, 0, 1, 1, -1, -1},
dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
bool TC = 1;
void test_case() {
long long n;
cin >> n;
string s;
cin >> s;
long long pr[n + 1];
pr[0] = 0;
map<long long, long long> m;
m[pr[0]]++;
for (long long i = 1; i <= n; i++) {
pr[i] = pr[i - 1] + s[i - 1] - '0';
m[pr[i] - i]++;
}
long long res = 0;
for (auto x : m) {
res += x.second * (x.second - 1) / 2;
}
cout << res << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (TC) {
long long T;
cin >> T;
while (T--) test_case();
} else
test_case();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937_64 mt(time(0));
const int MAXN = 1e5 + 10;
int nums[MAXN];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
nums[i] = s[i] - '0' - 1;
}
map<long long, int> table;
table[0] = 1;
long long ret = 0, sum = 0;
for (int i = 0; i < n; i++) {
sum += nums[i];
ret += table[sum];
table[sum]++;
}
cout << ret << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
ll count(int arr[], int n) {
unordered_map<ll, ll> mp;
ll res = 0;
ll currSum = 0;
for (int i = 0; i < n; i++) {
currSum += arr[i];
if (currSum == 0) res++;
auto it = mp.find(currSum);
if (it != mp.end()) {
res += it->second;
}
mp[currSum]++;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
;
cout.setf(ios::fixed);
cout.precision(32);
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[n];
string str;
cin >> str;
for (int i = 0; i < n; i++) {
arr[i] = str[i] - '0';
arr[i]--;
}
cout << count(arr, n) << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long gcd(long long a, long long b) { return (!b ? a : gcd(b, a % b)); }
bool cmp(int a, int b) { return a > b; }
const long long mod = 1e9 + 7;
const int INF32 = 1 << 30;
const long long INF64 = 1LL << 60;
const long double pi = 3.141592653589793;
void solve() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
vector<long long> pre(n + 1);
map<long long, long long> mp;
long long ans = 0;
for (int i = 1; i <= n; i++) {
long long t = s[i - 1] - '0';
pre[i] = pre[i - 1] + t;
mp[pre[i] - i]++;
}
mp[0]++;
for (auto it : mp) {
if (it.second > 1) {
ans += it.second * (it.second - 1) / 2;
}
}
cout << ans << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MIN_N = -(1e9);
int main() {
int t, i, n;
string s;
cin >> t;
while (t--) {
cin >> n;
cin >> s;
int a[n + 1];
long long ans[12 * n + 2];
long long sum = 0;
memset(ans, 0, sizeof(ans));
a[1] = int(s[0] - '0');
for (i = 2; i <= n; i++) {
a[i] = a[i - 1] + int(s[i - 1] - '0');
}
ans[2 * n]++;
for (i = 1; i <= n; i++) {
ans[a[i] - i + 2 * n]++;
}
for (i = 0; i <= 12 * n; i++) {
if (ans[i] > 1) sum += ans[i] * (ans[i] - 1) / 2;
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n, i, j;
string s;
cin >> n;
cin >> s;
long long int pre = 0, ans = 0;
map<long long int, long long int> m;
for (i = 0; i < n; ++i) {
m[pre]++;
pre += (s[i] - '1');
ans += m[pre];
}
cout << ans << '\n';
}
void preCompute() {}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long int t = 1, tc;
cin >> t;
for (tc = 1; tc <= t; ++tc) {
preCompute();
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long abso(long long a) { return (a > 0) ? a : -a; }
void solve() {
int t;
cin >> t;
string s;
cin >> s;
long long sum = 0;
long long res = 0;
map<int, int> m;
m[0] = 1;
for (int i = 0; i < int(t); i++) {
sum += s[i] - '0';
int x = sum - i - 1;
m[x]++;
res += m[x] - 1;
}
cout << res << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int const N = 2e3 + 5, M = 200 + 5, MOD = 1e9 + 7, OO = 0x3f3f3f3f;
int t, n, sum;
long long ans;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> t;
while (t--) {
ans = sum = 0;
unordered_map<int, int> mp;
mp[0]++;
cin >> n >> s;
for (int i = 0; i < n; i++) {
sum += s[i] - '0';
ans += mp[i + 1 - sum];
mp[i + 1 - sum]++;
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int i, j, x, n, k, t, l, y, z, a, b, h;
cin >> t;
string s;
for (i = 0; i < t; i++) {
cin >> n >> s;
h = 0;
long long int a[n + 1];
a[0] = 0;
for (j = 1; j <= n; j++) {
a[j] = a[j - 1] + (s[j - 1] - '0');
}
for (j = 1; j <= n; j++) {
for (k = j; k <= n; k++) {
h += (long long int)(a[k] - a[j - 1] == k - j + 1);
}
}
cout << h << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n, x, i, ap[900004];
long long sol;
char s[100004];
int main() {
scanf("%d", &t);
while (t > 0) {
scanf("%d\n", &n);
scanf("%s", &s);
x = 0;
sol = 0;
for (i = 0; i <= (9 * n); i++) ap[i] = 0;
ap[n] = 1;
for (i = 0; i < n; i++) {
x += s[i] - '1';
sol = (0LL) + sol + ap[x + n];
ap[x + n]++;
}
printf("%I64d\n", sol);
t--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
vector<int> A(n);
for (int i = 0; i < n; i++) {
A[i] = s[i] - 48;
}
vector<int> Presum(n + 1);
Presum[0] = 0;
for (int i = 1; i <= n; i++) Presum[i] = Presum[i - 1] + A[i - 1];
for (int i = 0; i <= n; i++) Presum[i] -= i;
unordered_map<int, int> Count;
for (int i = 0; i <= n; i++) {
if (Count.find(Presum[i]) == Count.end())
Count[Presum[i]] = 1;
else
Count[Presum[i]] += 1;
}
long long int ans = 0;
for (auto pair : Count) {
long long int occ = pair.second;
long long int temp = (occ * (occ - 1)) / 2;
ans += temp;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
string s;
cin >> t;
vector<long long int> ans(t, 0);
unordered_map<int, int> m;
for (int i = 0; i < t; i++) {
cin >> n;
cin >> s;
vector<int> arr(n), sum(n, 0);
vector<int> eq;
for (int j = 0; j < n; j++) {
arr[j] = s[j] - '0';
if (j)
sum[j] = sum[j - 1] + arr[j];
else
sum[j] = arr[j];
}
m[1] = 1;
for (int j = 0; j < n; j++) {
sum[j] = sum[j] - j;
if (m.find(sum[j]) == m.end())
m[sum[j]] = 1;
else
m[sum[j]]++;
}
for (auto e : m) {
if (e.second > 1) {
ans[i] += ((long long int)e.second) * (e.second - 1) / 2;
}
}
m.clear();
}
for (int i = 0; i < t; i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long t;
cin >> t;
while (t--) {
long long n, S = 0, ans = 0;
cin >> n;
string s;
cin >> s;
map<long long, long long> mp;
mp[0]++;
for (long long i = 0; i < s.size(); i++) {
S += s[i] - '0';
ans += mp[S - (i + 1)];
mp[S - (i + 1)]++;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long binpow(long long a, long long b, long long c) {
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a % c;
a = a * a % c;
b >>= 1;
}
return res % c;
}
void extend_gcd(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1, y = 0;
return;
}
extend_gcd(b, a % b, x, y);
long long tmp = x;
x = y;
y = tmp - (a / b) * y;
}
long long mod_inverse(long long a, long long m) {
long long x, y;
extend_gcd(a, m, x, y);
return (m + x % m) % m;
}
long long eulor(long long x) {
long long cnt = x;
long long ma = sqrt(x);
for (int i = 2; i <= ma; i++) {
if (x % i == 0) cnt = cnt / i * (i - 1);
while (x % i == 0) x /= i;
}
if (x > 1) cnt = cnt / x * (x - 1);
return cnt;
}
char s[101];
int ans[110];
bool cmp(int a, int b) { return (a > b); }
int main() {
int T;
cin >> T;
while (T--) {
map<int, int> M;
int n;
scanf("%d", &n);
string str;
cin >> str;
long long ans = 0;
int sum = 0;
int x;
for (int i = 1; i <= n; i++) {
x = str[i - 1] - '0' - 1;
sum += x;
if (sum == 0) ans++;
ans += M[sum];
M[sum]++;
}
printf("%lld\n", ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
auto clk = clock();
void solve() {
long long n;
cin >> n;
string s;
cin >> s;
vector<long long> a(n);
for (long long i = 0; i < n; i++) a[i] = s[i] - '0';
map<long long, long long> m;
long long sum = 0, len = 0;
long long ans = 0;
m[0] = 1;
for (long long i = 0; i < n; i++) {
sum += a[i];
len++;
long long diff = sum - len;
ans += m[diff];
m[diff]++;
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed << setprecision(8);
long long t = 1;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long t = 1;
cin >> t;
while (t--) {
long long n, m;
cin >> n;
string s;
cin >> s;
unordered_map<long long, long long> make_pair;
make_pair[0]++;
long long ans = 0, sm = 0;
for (long long j = 0; j < n; j++) {
sm += (s[j] - '0') - 1;
ans += make_pair[sm];
make_pair[sm]++;
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
const int MAX{200010};
const ll MOD{1000000007}, oo{1LL << 62};
ll solve(int N, const string& s) {
vector<int> ps(N + 1, 0);
for (int i = 1; i <= N; ++i) ps[i] = ps[i - 1] + (s[i - 1] - '0');
map<int, int> hs;
hs[0]++;
ll ans = 0;
for (int i = 1; i <= N; ++i) {
ans += hs[ps[i] - i];
++hs[ps[i] - i];
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
int T;
cin >> T;
while (T--) {
int N;
cin >> N;
string s;
cin >> s;
auto ans = solve(N, s);
cout << ans << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
const long long INF = numeric_limits<long long>::max();
const long long MOD = 1000000007;
const long double PI = 3.1415926535898;
const long long LIM = 100005;
long long fpow(long long x, long long y) {
long long temp;
if (y == 0) return 1;
temp = fpow(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return x * temp * temp;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
void sieve(long long n) {
bool prime[5 * LIM];
memset(prime, true, sizeof(prime));
for (long long p = 2; p * p <= n; p++)
if (prime[p] == true)
for (long long i = p * p; i <= n; i += p) prime[i] = false;
prime[1] = 0;
}
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
map<long long, long long> primeFactors(long long n) {
map<long long, long long> mp;
while (n % 2 == 0) {
if (mp.count(2) == 1)
mp[2]++;
else
mp.insert({2, 1});
n = n / 2;
}
for (long long i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
if (mp.count(i) == 1)
mp[i]++;
else
mp.insert({i, 1});
n = n / i;
}
}
if (n > 2) {
if (mp.count(n) == 1)
mp[n]++;
else
mp.insert({n, 1});
}
return mp;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
for (long long tt = 1; tt <= t; ++tt) {
long long n, ans = 0;
cin >> n;
string s;
cin >> s;
vector<long long> v(n), pre(n), dp(n);
map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
v[i] = s[i] - '0';
}
pre[0] = v[0];
for (long long i = 1; i < n; i++) {
pre[i] = pre[i - 1] + v[i];
}
for (long long i = 0; i < n; i++) {
if (pre[i] == i + 1) ans++;
dp[i] = pre[i] - i;
}
for (long long x : dp) mp[x]++;
for (auto x : mp) {
long long n = x.second - 1;
n = (n * (n + 1)) / 2;
ans += n;
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void oj() {}
void solve() {
long long n;
cin >> n;
vector<long long> v;
string s;
cin >> s;
for (long long i = 0; i < n; i++) {
long long x = s[i] - '0' - 1;
v.push_back(x);
}
long long ans = 0, currsum = 0;
unordered_map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
currsum += v[i];
if (currsum == 0) ans++;
ans += mp[currsum];
mp[currsum]++;
}
cout << ans << endl;
}
signed main() {
oj();
ios::sync_with_stdio(0);
cin.tie(0);
;
long long t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const long long mod = 1e9 + 7;
void __p(long long x) { cout << x; }
void __p(int32_t x) { cout << x; }
void __p(float x) { cout << x; }
void __p(double x) { cout << x; }
void __p(long double x) { cout << x; }
void __p(char x) { cout << '\'' << x << '\''; }
void __p(const char *x) { cout << '\"' << x << '\"'; }
void __p(const string &x) { cout << '\"' << x << '\"'; }
void __p(bool x) { cout << (x ? "true" : "false"); }
void _p() { cout << "]\n"; }
template <typename T, typename V>
void __p(const pair<T, V> &x) {
cout << '{';
__p(x.first);
cout << ',';
__p(x.second);
cout << '}';
}
template <typename T>
void __p(const T &x) {
long long f = 0;
cout << '{';
for (auto &i : x) cout << (f++ ? "," : ""), __p(i);
cout << "}";
}
template <typename T, typename... V>
void _p(T t, V... v) {
__p(t);
if (sizeof...(v)) cout << ", ";
_p(v...);
}
long long po(long long x, long long p) {
long long ans = 1;
x %= mod;
while (p > 0) {
if (p & 1) ans = (ans * x) % mod;
p = p >> 1;
x = (x * x) % mod;
}
return ans;
}
long long inv(long long x) { return po(x, mod - 2) % mod; }
const long long N = 1e6 + 6;
long long n, m, k, x, y, z, a, b, c, d, i, j, l, r, f, q;
void sol() {
string s;
cin >> n >> s;
map<long long, long long> m;
m[0] = 1;
long long pre = 0;
long long ans = 0;
for (i = 0; i < n; i++) {
pre += s[i] - '0';
ans += m[pre - (i + 1)];
m[pre - (i + 1)]++;
}
cout << ans << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) sol();
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
const long long INF = 2e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t;
cin >> t;
while (t--) {
long long n, i, j;
cin >> n;
long long tab[n], x, ans = 0, pre[n + 1];
string s;
cin >> s;
for (i = 0; i < n; i++) {
tab[i] = s[i] - '0';
}
for (i = 1; i <= n; i++) {
pre[i] = pre[i - 1] + tab[i - 1];
}
for (i = 1; i <= n; i++) {
for (j = i; j <= n; j++) {
ans += (pre[j] - pre[i - 1] == j - i + 1);
}
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
string s;
cin >> s;
map<long long int, long long int> make_pair;
make_pair[0] = 1;
long long int sum = 0;
long long int ans = 0;
for (long long int i = 0; i < n; i++) {
long long int x = s[i] - '1';
sum += x;
ans += make_pair[sum];
make_pair[sum]++;
}
cout << ans << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
vector<int> num;
for (int i = 0; i < n; i++) num.emplace_back(s[i] - '0' - 1);
unordered_map<int, int> m;
long long ans = 0, sum = 0;
for (int i = 0; i < n; i++) {
sum += num[i];
if (sum == 0) ans++;
ans += m[sum];
m[sum]++;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
signed main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
string s;
cin >> s;
map<long long, long long> maps;
long long sum = 0;
for (auto &i : s) {
sum += i - '0' - 1;
maps[sum]++;
}
sum = 0;
long long ans = 0;
for (auto &i : s) {
ans += maps[sum];
sum += i - '0' - 1;
maps[sum]--;
}
cout << ans << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
;
long long int te;
cin >> te;
while (te--) {
long long int n, ans = 0;
cin >> n;
string s;
cin >> s;
map<int, int> m;
vector<long long int> p(n);
p[0] = s[0] - '0';
m[1 - p[0]]++;
m[0]++;
if (p[0] == 1) ans++;
for (long long int i = 1; i <= n - 1; i++) {
long long int x = s[i] - '0';
p[i] = p[i - 1] + x;
long long int d = i + 1 - p[i];
ans += m[d];
m[d]++;
}
cout << ans << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = INT_MAX;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
string s;
cin >> s;
map<long long, long long> mp;
mp[0] = 1;
long long sum = 0, ans = 0;
for (long long i = 0; i < n; i++) {
sum += (s[i] - '0');
ans += mp[sum - (i + 1)];
mp[sum - (i + 1)]++;
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string second;
cin >> second;
map<int, int> mp;
long long int ans = 0, ad = 0;
for (int i = 0; i < second.length(); i++) {
int cur = second[i] - '0';
cur--;
ad += cur;
mp[cur - ad]++;
ans += mp[-ad];
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100001];
bool visit[100001];
const int mod = 1000000007;
long long mod_mult(long long a, long long b) {
return ((a % mod) * (b % mod)) % mod;
}
long long mult(long long x, long long y) {
long long prod = 1;
while (y > 0) {
if (y & 1) prod = mod_mult(prod, x);
x = mod_mult(x, x);
y /= 2;
}
return prod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, i, t, a, m;
cin >> t;
while (t--) {
cin >> n;
vector<int> v;
vector<int> carr, cr;
map<long long, long long> mk;
string s;
cin >> s;
for (auto it : s) v.push_back(it - '0');
cr.push_back(v[0]);
for (long long i = 1; i < n; i += 1) cr.push_back(v[i] + cr[i - 1]);
long long ans = 0;
mk[0] = 1;
for (int i = 0; i < cr.size(); i++) {
if (i - 1 >= 0) mk[cr[i - 1] - i]++;
ans += mk[cr[i] - i - 1];
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n;
long long int sum = 0;
map<long long int, long long int> mapp;
cin >> n;
long long int arr1[n], i;
string arr;
cin >> arr;
for (i = 0; i < n; i++) arr1[i] = (arr[i] - '0') - 1;
long long int ans = 0;
for (i = 0; i < n; i++) {
sum += arr1[i];
if (mapp.find(sum) != mapp.end()) ans = ans + (mapp[sum]);
if (sum == 0) ans++;
mapp[sum]++;
}
cout << ans << endl;
}
int main() {
long long int t;
cin >> t;
while (t--) {
solve();
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.