FlandreScarle7/Codeforces-SolutionsA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

added 474B

Browse Source
This commit is contained in:
ShazidMahsrafi 2023-12-22 14:48:15 +06:00
parent 8cf3625d02
commit 8553dcca72
2 changed files with 91 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

88
Codes/474B Worms/474B.cpp Normal file
View File

@ -0,0 +1,88 @@
#include<bits/stdc++.h>
using namespace std;
// Short forms
#define int long long
#define ll long long
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
// Outputs
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
// Constants
#define PI 3.141592653589793238
#define INF LONG_LONG_MAX
#define MOD 1e9+7
// Faster Input Output
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
// Maths
ll fact(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
ll mypow(ll a, ll b) { ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true; }
//Debugging
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
#else
#define dbg(x)
#define dbgin(x)
#endif
void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
void solve()
{
int n,last=1;
cin>>n;
vector<pair<int,int>>v;
for(int i=1; i<=n; ++i)
{
int m;
cin>>m;
for(int j=0; j<m; ++j,last++)
v.pb({last,i});
}
int q;
cin>>q;
while(q--)
{
int x;
cin>>x;
cout<<v[x-1].ss<<endl;
}
}
int32_t main()
{
FAST_IO;
int TC = 1;
//cin >> TC;
while (TC--) solve();
}

5
Readme.md
View File

@ -2,7 +2,7 @@
This repository contains my solutions of Codeforces problems. They are in C++ language.
#### If this repository helped you out, please consider giving it a :star:.
#### If this repository helped you out, please consider giving it a :star:
<div align="center">
@ -62,7 +62,8 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
| 421A | Pasha and Hamsters | [Question](https://codeforces.com/problemset/problem/421/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/421A%20Pasha%20and%20Hamsters)
| 456B | Fedya and Maths | [Question](https://codeforces.com/problemset/problem/456/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/456B%20Fedya%20and%20Maths)
| 460 | Plural Form of Nouns | [Question](https://codeforces.com/problemsets/acmsguru/problem/99999/460) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/460%20Plural%20Form%20of%20Nouns)
| 486A | Calculating Function | [Question](https://codeforces.com/contest/486/problem/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/486A%20Calculating%20Function)
| 474B | Worms | [Question](https://codeforces.com/problemset/problem/474/B) | [Solution]
| 486A | Calculating Function | [Question](https://codeforces.com/problemset/problem/486/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/486A%20Calculating%20Function)
| 492A | Vanya and Cubes | [Question](https://codeforces.com/problemset/problem/492/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/492A%20Vanya%20and%20Cubes)
| 492B | Vanya and Lanterns | [Question](https://codeforces.com/problemset/problem/492/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/492A%20Vanya%20and%20Cubes)
| 510A | Fox And Snake | [Question](https://codeforces.com/problemset/problem/510/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/510A%20Fox%20And%20Snake)