diff --git a/.gitignore b/.gitignore index 649b395..314ebcf 100644 --- a/.gitignore +++ b/.gitignore @@ -1,4 +1,3 @@ -* -!/Codes/** -!Assets/ -!Readme.md \ No newline at end of file +To solve/ +Generator.py +test.cpp diff --git a/Codes/1982 C - Boring Day/1982C.cpp b/Codes/1982 C - Boring Day/1982C.cpp new file mode 100644 index 0000000..5153144 --- /dev/null +++ b/Codes/1982 C - Boring Day/1982C.cpp @@ -0,0 +1,60 @@ +#include +using namespace std; +#ifdef ONLINE_JUDGE +#define dbg(...) +#else +#include "Assets/debug.h" +#endif +#define int long long +#define ll long long +#define endl '\n' +#define all(x) x.begin(), x.end() +#define sz(x) (int)(x).size() +#define yes cout << "YES" << endl +#define no cout << "NO" << endl +#define rep(i,a,b) for(int i=a; i=b; --i) +#define pb push_back +#define ppb pop_back +#define ins insert +#define ff first +#define ss second +#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr)); +ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} + +void solve() +{ + int n,l,r; + cin>>n>>l>>r; + vectorv(n); + for(auto &i:v) cin>>i; + int sum=0, ans=0, i=0; + for(int j=0; jr) + { + sum -= v[i]; + i++; + } + if(sum>=l && sum<=r) + { + ans++; + sum=0; + i = j+1; + } + } + cout<> TCS; + for (int TC = 1; TC <= TCS; ++TC) + { + // cout<<"Case "<