output stringlengths 52 181k | instruction stringlengths 296 182k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100009] = {0};
cin >> n >> a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int m;
cin >> m;
while (m--) {
int k;
cin >> k;
int t = (int)(lower_bound(a, a + n, k) - a + 1);
cout << t << endl;
... | ### Prompt
Please create a solution in cpp to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solution() {
int n;
cin >> n;
int *a = new int[1000001]{};
int last = 0;
for (int i = 1; i <= n; ++i) {
int w;
cin >> w;
int beg = last + 1, end = last + w;
for (int j = beg; j <= end; ++j) a[j] = i;
last += w;
}
... | ### Prompt
Please provide a cpp coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n;
vector<long long> a, q, pp;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
a.push_back(x);
}
cin >> m;
for (long long i = 0; i < m; i++) {
long long x;
cin >> x;
q.push_back(x);
}
v... | ### Prompt
In CPP, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
int n, m;
int a[N];
int main() {
std::ios::sync_with_stdio(0);
;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
while (x--) {
a[++cnt] = i;
}
}
cin >> m;
while (m--) {
int x;
cin >>... | ### Prompt
Construct a Cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
int n, q;
int p[100005];
int search(int x) {
int in;
int l, r, mid;
l = 1, r = n;
while (l < r) {
mid = l + r;
mid >>= 1;
if (p[mid] >= x)
r = mid;
else
l = mid + 1;
}
return l;
}
int main() {
ios_base::sync_with_stdio(false);
cin... | ### Prompt
Construct a CPP code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[100000], n, m, q;
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
for (int i = 1; i < n; i++) arr[i] += arr[i - 1];
cin >> m;
for (int i = 0; i < m; i++) {
cin >> q;
int low = lower_bound(arr, arr + n, q) - arr;
cout << low ... | ### Prompt
Construct a Cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
void printList(vector<long long> v) {
for (long long i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long n;
cin >> n;
vector<long long> arr(n);
for (long lon... | ### Prompt
Construct a CPP code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, a, q, label = 0, pile[(int)1e6 + 1];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
for (int j = 1; j <= a; j++) {
pile[label + j] = i;
}
label += a;
}
cin >> m;
for (... | ### Prompt
Construct a cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
int A[100001];
int binS(int A[], int l, int r, int key) {
if (l >= r) return l;
int mid = (l + r) / 2;
if (A[mid] == key) return mid;
if (key > A[mid]) return binS(A, mid + 1, r, key);
return binS(A, l, mid, key);
}
int main() {
int n, t;
cin >> n;
cin >> A[... | ### Prompt
In CPP, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
using namespace std;
int a[10000001], n, m, x;
int main() {
cin >> n;
int beg = 1;
int prev = 0;
for (int i = 0; i < n; i++) {
cin >> x;
for (int j = beg; j <= prev + x; j++) a[j] = i + 1;
prev += x;
beg += x;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> x;... | ### Prompt
In Cpp, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
using namespace std;
const unsigned int x = 1000000007;
int n[5] = {0, 1, 2};
map<int, int> m;
int cnt = 0;
int a, b;
int z, y;
int low, high, mid;
void solve(int y) {
while (low <= high) {
mid = (high + low) / 2;
if (m[mid] >= y && m[mid - 1] < y)
return;
else if (m[mid] < ... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n;
long long partialSum[n];
long long sum = 0;
long long x = 0;
while (x < n) {
long long wormQty;
cin >> wormQty;
sum += wormQty;
partialSum[x] = sum;
x++;
}
cin >> m;
long long labelArray[m];
for ... | ### Prompt
Generate a Cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled wit... |
#include <bits/stdc++.h>
using namespace std;
long long n, i, x, q, query, pos;
vector<long long> t;
vector<long long>::iterator iter;
int main() {
ios::sync_with_stdio(false);
cin >> n;
t.push_back(0);
for (i = 1; i <= n; i++) {
cin >> x;
t.push_back(x + t[i - 1]);
}
cin >> q;
for (i = 0; i < q; ... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
clock_t start;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const long long N = 1e6 + 10;
long long pile[N];
void solve() {
long long n;
cin >> n;
long long a, curr = 1, sum = 0;
for (long long i = 0; i < n; i++) {
cin >> a;
sum +=... | ### Prompt
Please create a solution in cpp to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n;
int arr[n];
int z = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
z += arr[i];
arr[i] = z;
}
cin >> m;
for (int j = 0; j < m; j++) {
cin >> z;
z = lower_bound(arr, arr + n, z) - arr;
cout << z + 1 <<... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int binSearch(int a, int* numSet, int setSize) {
int initial = 0;
int final = setSize - 1;
int i = 0;
while (true) {
i++;
if (i == 20) break;
int mid = initial + (final - initial) / 2;
if (final - initial <= 1) {
if (a < numSet[final] && a > nu... | ### Prompt
Your task is to create a Cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile a... |
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, m, k;
while (scanf("%d", &n) != EOF) {
a[0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
a[i] += a[i - 1];
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
scanf("%d", &k);
printf(... | ### Prompt
Create a solution in CPP for the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled w... |
#include <bits/stdc++.h>
using namespace std;
vector<int> vec;
int main() {
long long int n, sum = 0, t;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
sum += t;
vec.push_back(sum);
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
if (t <= vec[0]) {
cout << "1\n";
conti... | ### Prompt
Please formulate a Cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int n, a[100000], m, q, sp[100000];
int cautbin(int val) {
int left = 0, right = n - 1, best = -1;
while (left <= right) {
int mid = (left + right) / 2;
if (sp[mid] >= val) {
best = mid;
right = mid - 1;
} else {
left = mid + 1;
}
}
... | ### Prompt
Please formulate a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
int m;
cin >> m;
while (m--) {
int x;
cin >> x;
int l = -1, r = n + 1;
while (r - l > 1)... | ### Prompt
Please create a solution in Cpp to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n], s[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> ar[i];
sum += ar[i];
if (i == 0)
s[i] = 1;
else
s[i] = s[i - 1] + ar[i - 1];
}
int st[sum + 1];
int p = 1;
for (int i = 0; i < n; i... | ### Prompt
Develop a solution in CPP to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n;
int a[n], sum[n];
sum[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
int j;
n += 1;
cin >> w;
while (w--) {
cin >> j;
cout << (lower_bound(sum, sum + n, j) - sum) << endl;... | ### Prompt
Your task is to create a Cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile a... |
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long n, m, x, ans = 0;
cin >> n;
long long arr[n + 1];
arr[0] = 1;
cin >> arr[1];
for (long long i = 2; i < n + 1; i++) {
cin >> x;
arr[i] = arr[i - 1] + x;
}
cin >> m;
long long q[m];
for (long long i = 0; i < m; i++) {
... | ### Prompt
Please provide a CPP coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int bs(int ar[], int le, int ri, int x) {
int mid;
mid = (le + ri) / 2;
if (ri >= le) {
if (x == ar[mid])
return mid;
else if (x < ar[0])
return 0;
else if (x < ar[mid] && x > ar[mid - 1]) {
return mid;
} else if (x > ar[mid] && x < a... | ### Prompt
Develop a solution in Cpp to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[1000003], n, x = 1, t;
cin >> n;
for (int i = 1; i < n + 1; i++) {
cin >> t;
while (t--) {
a[x] = i;
x++;
}
}
int m;
cin >> m;
for (int i = 0; i < m; i++) {
cin >> t;
cout << a[t] << endl;
}
}
| ### Prompt
Please create a solution in CPP to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, numbers1;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> numbers1;
a[i] = numbers1;
}
int m, numbers2;
cin >> m;
int q[m];
for (int i = 0; i < m; i++) {
cin >> numbers2;
... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
long st[100005];
long bSearch(long v, long s, long e) {
long mid;
while (s <= e) {
mid = (s + e) / 2;
if (st[mid] == v)
return mid;
else if (st[mid] <= v && st[mid + 1] > v)
return mid;
else if (st[mid] > v && st[mid + 1] > v) {
e = mid... | ### Prompt
Please provide a cpp coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
int n;
cin >> n;
int sum = 1;
vector<int> v;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
v.push_back(sum);
}
v.push_back(sum + 1);
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int x;
sc... | ### Prompt
Your task is to create a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile a... |
#include <bits/stdc++.h>
using namespace std;
const int M = 1000 * 1000 + 1000;
int n;
int a[M];
int m;
int q[M];
int sum[M];
int search(int f, int e, int k) {
if (f == e) return f;
int mid = (f + e) / 2;
if (sum[mid] >= k) return search(f, mid, k);
return search(mid + 1, e, k);
}
int main() {
cin >> n;
for... | ### Prompt
Generate a Cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled wit... |
#include <bits/stdc++.h>
const int MAXN = 100 + 10;
const int MAXT = 100000 + 10;
const int INF = 0x7f7f7f7f;
const double pi = acos(-1.0);
const double EPS = 1e-6;
using namespace std;
int n, a[MAXT], l[MAXT], r[MAXT], q;
void init() {
l[0] = 1;
r[0] = a[0];
for (int i = 1; i < n; ++i) {
l[i] = r[i - 1] + 1;... | ### Prompt
Create a solution in cpp for the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled w... |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct query {
int x, id;
} q[N];
int n;
int a[N];
int sum = 0, uk = 0;
int m;
int ans[N];
bool cmp(query A, query B) { return A.x < B.x; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
scanf("%d", &m);
for (i... | ### Prompt
Please create a solution in CPP to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int p[n];
cin >> p[0];
for (int i = 1; i < n; i++) {
int x;
cin >> x;
p[i] = p[i - 1] + x;
}
int t;
cin >> t;
while (t--) {
int key;
cin >> key;
int ... | ### Prompt
Please formulate a CPP solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
long long n, x, r = 0, m;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> x;
r += x;
v.push_back(r);
}
cin >> m;
for (long long i = 0; i < m; i+... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int arr[1000000 + 10];
int a[1000000 + 10];
int main() {
int t, i, j, b, c, n, m, k;
scanf("%d", &n);
k = 1;
c = 0;
for (i = 0; i < n; ++i) {
scanf("%d", &a[i]);
if (i > 0) a[i] += a[i - 1];
}
j = 1;
for (i = 0; i < n; ++i)
for (; j <= a[i]; ++j)... | ### Prompt
Please create a solution in Cpp to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
long long ara[100010];
vector<long long> v;
vector<long long> v1;
long long val, sum, val1;
int main() {
long long n, m;
sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> val;
v.push_back(val);
}
for (int i = 0; i < n; i++) {
sum += v.at(i);
... | ### Prompt
Please create a solution in cpp to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int n, a[1000005], i, k, m;
int main() {
cin >> n;
a[0] = 1;
for (i = 0; i < n; i++) {
cin >> m;
k += m;
a[k + 1]++;
}
for (i = 1; i < 1000003; i++) a[i] += a[i - 1];
cin >> m;
for (i = 0; i < m; i++) {
cin >> k;
cout << a[k] << endl;
}
}... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
int w[100002];
int main() {
int i, j, n, m, q, first, last, mid;
while (scanf("%d", &n) == 1) {
for (i = 1; i <= n; i++) {
scanf("%d", &j);
w[i] = w[i - 1] + j;
}
scanf("%d", &m);
for (i = 1; i <= m; i++) {
scanf("%d", &q);
first = 1;
last = n;
... | ### Prompt
Construct a CPP code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> v;
v.push_back(0);
int cur = 0;
for (int i = 1, x; i <= n; i++) {
cin >> x;
x += cur;
v.push_back(x);
cur = v[i];
}
int m;
cin >> m;
for (int i = 0, a;... | ### Prompt
Construct a cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using vt = vector<T>;
const int N = 1e5 + 5;
int n, a[N];
int binary_search(int q) {
int lo = 1, hi = n;
while (lo < hi) {
int mid = (lo + hi) / 2;
if (a[mid] < q)
lo = mid + 1;
else if (a[mid] > q)
hi = mid;
else
... | ### Prompt
Develop a solution in CPP to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:367721060")
using namespace std;
int a[1010000];
int ans[1010000];
int main() {
std::ios::sync_with_stdio(0);
int n, m, query;
long long sum = 0;
int cnt = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
int tmp = a... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int ceilSearch(int arr[], int low, int high, int x) {
int mid;
if (x <= arr[low]) return low;
if (x > arr[high]) return -1;
mid = (low + high) / 2;
if (arr[mid] == x)
return mid;
else if (arr[mid] < x) {
if (mid + 1 <= high && x <= arr[mid + 1])
re... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int pile_num, pile[100001], label_num, label[100001];
int prefix[100001];
int main() {
while (scanf("%d", &pile_num) == 1) {
for (int i = 0; i < pile_num; i++) scanf("%d", &pile[i]);
scanf("%d", &label_num);
memset(prefix, 0, sizeof(prefix));
prefix[0] = p... | ### Prompt
Construct a cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long Ar[100005] = {0};
for (int i = 1; i <= n; i++) cin >> Ar[i];
for (int i = 2; i <= n; i++) {
Ar[i] += Ar[i - 1];
}
long long q;
cin >> q;
long long ans = INT_MAX;
while (q--) {
long long x;
cin >> ... | ### Prompt
Construct a Cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
long long A[100001], n;
long long search1(long long p) {
long long lo = 0, hi = n - 1, mid;
while (lo <= hi) {
mid = (lo + hi) / 2;
if (mid == 0) {
if (A[0] >= p) {
return 1;
}
if (A[0] < p) {
lo = mid + 1;
}
} else if... | ### Prompt
In cpp, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
int a[1000001], n, x, k = 1, i, j, m;
using namespace std;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> x;
for (j = k; j < x + k; j++) a[j] = i;
k = k + x;
}
cin >> m;
while (m--) {
cin >> x;
cout << a[x] << "\n";
}
}
| ### Prompt
In Cpp, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
using namespace std;
long long dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
long long ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1},
ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
long long gcd(long long a, long long b) {
if (!a) return b;
return gcd(b % a, a);
}
long long lcm(long long a, long lo... | ### Prompt
Please formulate a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int search(int a[], int x, int n) {
int lo = 0;
int hi = n;
while (lo <= hi) {
int mid = (lo + hi) / 2;
if (a[mid] >= x && a[mid - 1] < x)
return mid;
else if (a[mid] > x)
hi = mid - 1;
else
lo = mid + 1;
}
return 0;
}
int main() ... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int count(int* a, int i, int j, int b) {
if ((j - i) == 1) {
return i;
}
if ((j - i) == 2) {
int c;
if (b <= a[i])
c = i;
else
c = i + 1;
return c;
}
int m = (i + j) / 2;
if (b > a[m - 1])
return count(a, m, j, b);
else
... | ### Prompt
In CPP, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
using namespace std;
int *A;
int bin_s(int val, int left, int right) {
int m = (left + right) / 2;
if (A[m] >= val) {
if (A[m - 1] < val)
return m;
else
return bin_s(val, left, m - 1);
} else
return bin_s(val, m + 1, right);
}
int main() {
int n, q, x;
cin >> n... | ### Prompt
Construct a Cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100010];
int sum = 0;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
sum += temp;
a[i + 1] = sum;
}
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int temp;
cin >> temp;
cout << lower_bo... | ### Prompt
Please create a solution in CPP to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> vec(n);
for (int i = 0; i < n; i++) scanf("%d", &vec[i]);
vector<int> cs(n);
cs[0] = vec[0];
for (int i = 1; i < n; i++) cs[i] = cs[i - 1] + vec[i];
int t;
scanf("%d", &t);
int find;
for (int i = 0; i < ... | ### Prompt
Develop a solution in cpp to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
int main() {
int n, i, a[1000000], k, j = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &k);
while (k--) {
a[j] = i + 1;
j++;
}
}
int m;
scanf("%d", &m);
while (m--) {
int g;
scanf("%d", &g);
printf("%d\n", a[g]);
}
return 0;
}
| ### Prompt
Please create a solution in cpp to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
vector<bool> isprime(1000007 + 1, true);
int small[1000007 + 1];
void sieve() {
isprime[0] = isprime[1] = 0;
int i, j;
for (i = 4; i <= 1000007; i += 2) isprime[i] = 0;
for (i = 3; i <= 1000; i += 2)
if (isprime[i])
for (j = i * i; j <= 1000007; j += (i + ... | ### Prompt
Generate a CPP solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled wit... |
#include <bits/stdc++.h>
using namespace std;
int d[100][100], i, j, k = 1, t, n, m, a[1111111], b, x, s;
char ch;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> x;
s = s + x;
for (j = 1; j <= x; j++) {
a[k++] = i;
}
}
cin >> m;
for (i = 1; i <= m; i++) {
cin >> b;
cout... | ### Prompt
Please create a solution in CPP to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int prf[n + 1];
prf[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> prf[i];
if (i > 0) prf[i] += prf[i - 1];
}
int q, f;
cin >> q;
while (q--) {
cin >> f;
int l = 0, r = n, m;
while (r - l > 1) {
m ... | ### Prompt
Develop a solution in cpp to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long int n, x;
cin >> n;
long int a[n];
cin >> a[0];
for (long int i = 1; i < n; i++) {
cin >> x;
a[i] = a[i - 1] + x;
}
long int m;
cin >> m;
while (m--) {
cin >> x;
long in... | ### Prompt
Generate a CPP solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled wit... |
#include <bits/stdc++.h>
using namespace std;
int binarySearch(int* arr, int start, int end, int x) {
if (start > end) {
return -1;
}
int mid = (start + end) / 2;
if (arr[mid] >= x && (mid == 0 || arr[mid - 1] < x)) return mid;
if (arr[mid] > x) {
return binarySearch(arr, start, mid - 1, x);
}
if ... | ### Prompt
Generate a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled wit... |
#include <bits/stdc++.h>
using namespace std;
int pos[1000100];
int n, m, x, sum, y;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
cin >> n;
cin >> x;
sum = x;
y = x;
for (int i = 1; i <= x; i++) pos[i] = 1;
for (int i = 2; i <= n; i++) {
cin >> x;
sum += x;
for (int j = y + 1; j <=... | ### Prompt
Create a solution in CPP for the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled w... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 1; i < n; i++) a[i] += a[i - 1];
int q;
scanf("%d", &q);
while (q--) {
int x;
scanf("%d", &x);
int pos = lower_bound(a.begin(), a.... | ### Prompt
Please create a solution in cpp to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int m;
cin >> m;
int q[m];
for (int i = 0; i < m; ++i) {
cin >> q[i];
}
int f[n];
int u = 0;
for (int i = 0; i < n; ++i) {
u = u + a[i];
f[i] = u;
... | ### Prompt
Create a solution in CPP for the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled w... |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int a[n + 1], i, j;
a[0] = 0;
int p[1000001];
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
for (j = a[i - 1] + 1; j <= a[i] + a[i - 1]; j++) p[j] = i;
a[i] += a[i - 1];
}
int m;
scanf("%d", &m);
int q;
for (i = 0; i < m; i... | ### Prompt
Develop a solution in Cpp to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, otv[1000000], j, a, z, q[100000];
cin >> n;
int s = 0;
j = 0;
for (i = 0; i < n; i++) {
cin >> a;
z = j + 1;
s += a;
for (z; z <= s; z++) {
otv[z] = i + 1;
j++;
}
}
cin >> n;
for (i = 0; i < n; i++) cin ... | ### Prompt
Develop a solution in CPP to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, sum = 0, t;
vector<int> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> t;
sum += t;
a.push_back(sum);
}
cin >> n;
for (i = 0; i < n; i++) {
cin >> t;
cout << lower_bound(a.begin(), a.end(), t) - a.begin() + 1 << '\n';
... | ### Prompt
Your task is to create a Cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile a... |
#include <bits/stdc++.h>
using namespace std;
long int a[100000], n;
int main() {
long int i, m, x, ind;
long int a[100000], n;
vector<long int> v;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 1; i < n; i++) {
a[i] = a[i] + a[i - 1];
}
cin >> m;
for (i = 0; i < m; i++) {
c... | ### Prompt
In CPP, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
using namespace std;
int a[100001], w[1000001];
int main() {
int n, m, q;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] = a[i] + a[i - 1];
for (int j = a[i - 1] + 1; j <= a[i]; j++) {
w[j] = i;
}
}
cin >> m;
for (int i = 1; i <= m; i++) {
cin >... | ### Prompt
Construct a cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t, n, x, Q, q;
cin >> n;
long long a[n];
for (long long i = 0; i < n; ++i) cin >> a[i];
long long sum[n];
sum[0] = a[0];
for (long long i = 1; i < n; ++i) sum[i] = sum[i - 1] + a[i]... | ### Prompt
Construct a cpp code solution to the problem outlined:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labele... |
#include <bits/stdc++.h>
int binary_search(long long int a[], int n, long long int x) {
int left, right, mid, i;
left = 1;
right = n;
while (left <= right) {
mid = (right + left) / 2;
if (a[mid] == x) return mid;
if (a[mid] > x)
right = mid - 1;
else
left = mid + 1;
}
return left... | ### Prompt
In Cpp, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
using namespace std;
unsigned long long ull;
int main() {
ull = 0;
int n;
cin >> n;
int *A = new int[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
int m;
cin >> m;
int zn;
vector<pair<int, int> > ip(m);
for (int i = 0; i < m; i++) {
cin >> zn;
ip[i].first = ... | ### Prompt
Please create a solution in cpp to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, q, a;
cin >> n;
std::vector<long long> x(n);
long long sum = 0;
for (long long i = 0; i < n; i++) {
cin >> x[i];
sum += x[i];
x[i] = sum;
}
cin >> q;
long long ans = 0;
while (q--) {
cin >> a;
ans = (lower_boun... | ### Prompt
Generate a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled wit... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, sum = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
b[i] = sum;
}
cin >> m;
int c[m];
for (int i = 0; i < m; i++) {
cin >> c[i];
cout << lower_bound(b, b + n, c[i]) - b + 1 << ... | ### Prompt
Develop a solution in Cpp to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, z = 1;
cin >> n;
int a[n];
int tot[n];
cin >> a[0];
tot[0] = a[0];
for (int i = 1; i < n; i++) {
cin >> a[i];
tot[i] = tot[i - 1] + a[i];
}
int m;
cin >> m;
int q[m];
for (int i = 0; i < m; i++) {
cin >> q[i];
}
fo... | ### Prompt
Please formulate a CPP solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are lab... |
#include <bits/stdc++.h>
using namespace std;
int f[100000];
int main() {
int n;
cin >> n;
int a;
cin >> a;
f[0] = a;
for (int i = 1; i < n; i++) {
int a;
cin >> a;
f[i] = a + f[i - 1];
}
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
cout << lower_bound(f, f... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int n, a[100009], sum[100009];
int bin(int L, int R, int x) {
while (L < R) {
int M = (L + R) >> 1;
if (sum[M] >= x)
R = M;
else
L = M + 1;
}
return R;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (... | ### Prompt
Generate a Cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled wit... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 3;
const int N = 4e5 + 10;
int a[N];
int main() {
a[0] = 0;
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i], a[i] += a[i - 1];
int m;
cin >> m;
while (m--) {
int q;
cin >> q;
int ans = -1;
int l = 1;
int r = ... | ### Prompt
In CPP, your task is to solve the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled ... |
#include <bits/stdc++.h>
int w[1000000];
int main() {
int n, pre = 0, cur, cur_worm, m, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &cur);
for (j = pre + 1; j <= pre + cur; j++) w[j] = i + 1;
pre += cur;
}
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &cur_worm);
... | ### Prompt
Generate a CPP solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled wit... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<long long> v(n);
for (long long i = 0; i < n; i++) cin >> v[i];
;
for (long long i = 1; i < n; i++) {
v[i] += v[i - 1];
}
int m;
cin >> m;
long long a;
int ans;
while (m--) {
cin >> a;
ans = lower_bo... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int x[1000003], p = 1, t, q, n, m;
int main() {
cin >> n;
for (q = 1; q <= n; q++) {
cin >> t;
while (t--) x[p] = q, p++;
}
cin >> m;
while (m--) cin >> t, cout << x[t] << endl;
}
| ### Prompt
Your challenge is to write a cpp solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
if (i > 0) arr[i] += arr[i - 1];
}
int q;
cin >> q;
int x, l, r, mid;
while (q--) {
cin >> x;
l = 0, r = n - 1;
while (l < r) {
mid = l +... | ### Prompt
Please provide a cpp coded solution to the problem described below:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, x, temp;
vector<long long> sum;
vector<long long> search;
vector<long long> ans;
long long cur = 0;
sum.push_back(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
temp = x + sum[sum.size() - 1];
sum.push_back(tem... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, piles[100000], q;
cin >> n;
cin >> q;
piles[0] = q;
for (int i = int(1); i < int(n); i++) {
cin >> q;
piles[i] = piles[i - 1] + q;
}
cin >> m;
for (int i = int(0); i < int(m); i++) {
cin >> q;
int ans = upper_bound(pile... | ### Prompt
Create a solution in CPP for the following problem:
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled w... |
#include <bits/stdc++.h>
using namespace std;
inline bool Ok(long double a, long double b, long double c) {}
int main() {
long double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
int n, ret = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
long double a, b, c;
cin >> a >> b >> c;
long double Y1 = (-a ... | ### Prompt
Develop a solution in Cpp to the problem described below:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. L... |
#include <bits/stdc++.h>
const int maxn = 500;
int ax, ay, bx, by;
int n;
int a[maxn], b[maxn], c[maxn];
int side[maxn];
int main() {
scanf("%d%d", &ax, &ay);
scanf("%d%d", &bx, &by);
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d%d%d", &a[i], &b[i], &c[i]);
if (1LL * a[i] * ax + 1LL * b[i] * ... | ### Prompt
Create a solution in cpp for the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's c... |
#include <bits/stdc++.h>
using namespace std;
struct point {
long long x, y;
} w[2];
int32_t main() {
long long ans = 0;
for (long long i = 0; i < 2; i++) {
scanf("%lld%lld", &w[i].x, &w[i].y);
}
long long n;
scanf("%lld", &n);
for (long long i = 0; i < n; i++) {
long long a, b, c;
scanf("%lld... | ### Prompt
Create a solution in Cpp for the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's c... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c;
long long x1, y1, x2, y2;
int n, cnt = 0;
cin >> x1 >> y1 >> x2 >> y2;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
long long t1 = a * x1 + b * y1 + c;
long long t2 = a * x2 + b * y2 + c;
if ((t1 < 0... | ### Prompt
Generate a Cpp solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's cal... |
#include <bits/stdc++.h>
using namespace std;
long long a[305], b[305], c[305];
int main() {
int n;
pair<long long, long long> p[2];
long long r[2];
for (int i = 0; i < 2; i++) scanf("%lld%lld", &p[i].first, &p[i].second);
scanf("%d", &n);
int ans = 0;
for (int i = 0; i < n; i++) {
scanf("%lld%lld%lld... | ### Prompt
Please create a solution in cpp to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. L... |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double pi = acos(-1.0);
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
struct point_i {
int x, y;
point_i() { x = y = 0; };
point_i(int x_, int y_) : x(x_), y(y_) {}
};
struct line {
double a, b, c;
};
... | ### Prompt
Your task is to create a cpp solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite sp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x1, y1, x2, y2, cs = 0, a, b, c, v1, v2;
scanf("%lld %lld", &x1, &y1);
scanf("%lld %lld", &x2, &y2);
scanf("%lld", &n);
while (n--) {
scanf("%lld %lld %lld", &a, &b, &c);
v1 = x1 * a + y1 * b + c;
v2 = x2 * a + y2 * b + c;
... | ### Prompt
Please formulate a cpp solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. L... |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8, oo = 1e18, PI = acos(-1.0);
struct point {
double x, y;
point(double _x, double _y) : x(_x), y(_y) {}
};
struct line {
double a, b, c;
line(double _a, double _b, double _c) : a(_a), b(_b), c(_c) {}
line(point u, point v) {
a = u.y - v.... | ### Prompt
In Cpp, your task is to solve the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's ... |
#include <bits/stdc++.h>
using namespace std;
struct rec {
double a, b, c;
};
rec d[100000];
int n;
double x11, y11, x2, y2;
double dis(double u, double v, double x, double y) {
return (u - x) * (u - x) + (v - y) * (v - y);
}
void process() {
cin >> x11 >> y11 >> x2 >> y2;
cin >> n;
for (int i = 1; i <= n; i+... | ### Prompt
Create a solution in cpp for the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's c... |
#include <bits/stdc++.h>
struct point {
long double x, y;
point() {}
point(long double _x, long double _y) : x(_x), y(_y) {}
};
point p1, p2, p3, p4;
int a, b, c;
int n, ans;
long double cross(point a, point b) { return a.x * b.y - a.y * b.x; }
point tovec(point a, point b) { return point(b.x - a.x, b.y - a.y); }... | ### Prompt
Your task is to create a cpp solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite sp... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x, y, xx, yy, dax[500], day[500], dac[500], i, j, k, l, n, q1,
q2, a;
while (cin >> x >> y >> xx >> yy >> n) {
for (i = 0; i < n; i++) {
cin >> dax[i] >> day[i] >> dac[i];
}
a = 0;
for (i = 0; i < n; i++) {
q1... | ### Prompt
Develop a solution in Cpp to the problem described below:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. L... |
#include <bits/stdc++.h>
using namespace std;
bool res(long long a, long long b, long long c, long long x, long long y) {
return ((long long)a * x + b * y + c) > 0;
}
bool mismatch(int a, int b, int c, int x1, int x2, int y1, int y2) {
return res(a, b, c, x1, y1) ^ res(a, b, c, x2, y2);
}
int main() {
int t = 1;
... | ### Prompt
Generate a CPP solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's cal... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 10000000;
int sgn(long long x, long long y) {
if (!x || !y) return 0;
int a, b;
if (x < 0)
a = -1;
else
a = 1;
if (y < 0)
b = -1;
else
b = 1;
return a * b;
}
int main() {
long long x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2... | ### Prompt
Construct a cpp code solution to the problem outlined:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let'... |
#include <bits/stdc++.h>
using namespace std;
int st(int x, int pos) { return x = x | (1 << pos); }
int Reset(int x, int pos) { return x = x & ~(1 << pos); }
long long x, y, xx, yy;
long long fn(long long a, long long b, long long c) {
return ((a * x + b * y + c) / abs((a * x + b * y + c))) *
((a * xx + b * ... | ### Prompt
Generate a CPP solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's cal... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x1, x2, y1, y2, a, b, c, n, ans = 0;
cin >> x1 >> y1 >> x2 >> y2;
cin >> n;
while (n--) {
cin >> a >> b >> c;
long long z1 = a * x1 + b * y1 + c;
long long z2 = a * x2 + b * y2 + c;
if ((z1 > 0 && z2 < 0) || (z1 < 0 && z2 > 0))... | ### Prompt
Please provide a cpp coded solution to the problem described below:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinit... |
#include <bits/stdc++.h>
using namespace std;
inline int nxt() {
int n;
scanf("%d", &n);
return n;
}
template <class T>
T sqr(T a) {
return a * a;
}
inline bool check(long long a, long long b, long long c, pair<int, int> first,
pair<int, int> second) {
if (a * first.first + b * first.second ... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinit... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int n;
cin >> n;
int count = 0;
while (n--) {
long long int ax, by, c;
cin >> ax >> by >> c;
if (((ax * x1 + by * y1 + c) > 0 && (ax * x2 + by * y2 + c) < 0) ||
((ax * x1... | ### Prompt
Generate a cpp solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's cal... |
#include <bits/stdc++.h>
namespace chtholly {
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar()) f ^= c == '-';
for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
return f ? x : -x;
}
template <typename mitsuha>
inline bool read(mitsuha &x) {
x =... | ### Prompt
Please create a solution in CPP to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. L... |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1000000000,1000000000")
using namespace std;
struct point {
long double x;
long double y;
};
int main() {
point p1, p2;
cin >> p1.x >> p1.y >> p2.x >> p2.y;
int n;
int k = 0;
cin >> n;
for (int i = 0; i < n; i++) {
long double a, b, c;
cin... | ### Prompt
Generate a cpp solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's cal... |
#include <bits/stdc++.h>
using namespace std;
int main() {
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
double a, b, c;
cin >> a >> b >> c;
if ((a * x1 + b * y1 + c < 0 && a * x2 + b * y2 + c > 0) ||
(a * x1 + b * y1 + c > 0 &&... | ### Prompt
Generate a Cpp solution to the following problem:
Crazy Town is a plane on which there are n infinite line roads. Each road is defined by the equation aix + biy + ci = 0, where ai and bi are not both equal to the zero. The roads divide the plane into connected regions, possibly of infinite space. Let's cal... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.