text stringlengths 49 983k |
|---|
#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define pii pair <int , int>
#define mp make_pair
#define fs first
#define sc second
using namespace std;
typedef long long LL;
template <typename T>
void read(T &x) {
T f=1;x=0;char s=getchar();
while(s<'0'||s>'9') {if(s=... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
int x=0;
bool flag=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));
... |
#include <cstdio>
#include <algorithm>
const int N=205, MOD=1000000007;
inline int mval(int x) { return x>=MOD?x-MOD:x; }
inline int fix(int x) { return x+(x>>31&MOD); }
inline void inc(int &x, int a) { x=mval(x+a); }
inline void dec(int &x, int a) { x=fix(x-a); }
int n, q, c[N], b[N], f[N][N*N], lim[N], ans[N], prod=... |
#include<bits/stdc++.h>
using namespace std;
const int N=105,M=1000000007,iv=(M+1)/2;
int n,t,c[N],b[N],q,x,s[N],f[N][N*N],i;
int dfs(int i,int p)
{
if(i>n)
return 1;
if(f[i][p]!=-1)
return f[i][p];
int j;
long long ss=0;
for(j=0;j<=c[i];++j)
if(p+j-s[i]>=i*x)
ss+=dfs(i+1,p+j);
return f[i][p]=ss%M;
}
int... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repn(i,a,b) for(int i=a;i>=b;i--)
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define vi vector<int>
#define vl vector<long long>
#de... |
#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 105, MOD = 1e9 + 7;
int n, f[N * N], g[N * N], b[N], sb[N], c[N];
map<int, int> ans;
int Solve(int x)
{
fill(g, g + N * N, 1);
for(int i = 1, sumc = c[1], lim; i <= n; i++, sumc += c[i])
{
lim = i * x + sb[i]; memset(f, 0, sizeof(f)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define y1 y114514
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define all(a) a.begin(), a.end()
const int M = 1000000007;
const int maxn = 105;
int n;
int c[maxn];
int b[maxn];
int sum... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define per(i,a,b) for(ll i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define Max(a,b) (a>b?a:b)
#define Min(a,b) (a<b?a:b)
#define... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int MAXN = 100;
constexpr int MOD = 1000000007;
constexpr int MAXTOLERANCE = 10000001; //10001; // really? TODO
int c[MAXN], b[MAXN], magic[MAXN];
int dp1[MAXTOLERANCE], dp2[MAXTOLERANCE];
int coalesce[MAXTOLERANCE+1];
int* const coal=coalesc... |
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define ROF(i,a,b) for(int i=(a); i>=(b); --i)
#define pb push_back
#define eb emplace_back
#define SZ(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define make_unique(a) sort(all((a))), (a).erase(unique(all((a))),(a).end())
#define x fi... |
/**
* author: tourist
* created: 25.06.2021 18:57:29
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a; swap(a, m);
u -= t * v; swap(u, v);
}
assert(m == 1);
return u;
}
template... |
#include <bits/stdc++.h>
#define fr first
#define sc second
#define m_p make_pair
#define all(x) (x).begin(), (x).end()
#define unique(a) a.resize(unique(a.begin(), a.end()) - a.begin())
#define low_bo(a, x) ((int)(lower_bound(a.begin(), a.end(), x) - a.begin()))
#define up_bo(a, x) ((int)(upper_bound(a.begin(), a.end(... |
#include <bits/stdc++.h>
using namespace std;
const int N = 110;
const int MOD = (int)1e9 + 7;
inline int add(int u, int v, int mod = MOD) {
return (u += v) >= mod ? u - mod : u;
}
inline int sub(int u, int v, int mod = MOD) {
return (u -= v) < 0 ? u + mod : u;
}
inline int mul(int u, int v, int mod = MOD) { ret... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define RANGE(x) x.begin(),x.end()
void one(){
}
int main(){
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int> b(n-1);
vector<int> c(n);
ll allways= 1;
vector<int> cpre(n+1);
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 105;
const int maxm = 10005;
const int mod = 1e9 + 7;
inline int add(int x, int y) {
x += y;
return x >= mod ? x - mod : x;
}
inline int sub(int x, int y) {
x -= y;
return x < 0 ? x + mod : x;
}
inline int mul(int x, int y) {
retur... |
#include<bits/stdc++.h>
using namespace std;
#define sz(s) (int)s.size()
#define f first
#define s second
#define pb push_back
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define vvi vector<vi>
#define ll long long
#define vll vector<ll>
#define ii pair<int, int>
#define vii vector<ii>
#define vvii vec... |
#include<bits/stdc++.h>
using namespace std;
const int N=109,M=10009,P=1e9+7;
int s[N],c[N],b[N],f[M],g[M],n;
map<int,int>mp;
int wk(int x){
int i,j,k;
for(memset(f,0,s[n]*4+4),i=f[0]=1;i<=n;++i){
for(g[0]=f[0],j=1;j<=s[i];++j)if(g[j]=g[j-1]+f[j],g[j]>=P)g[j]-=P;
for(j=0,k=x*i+b[i];j<=s[i];++j)if(j<k)f[j]=0;else ... |
#pragma GCC optimize("-Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <rando... |
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)(a).size()
#define rep(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(a) cerr << #a << ": " << (a) << '\n';
#define debug_arr(a, n) { cerr << #a << " "; rep(i, 0, n) cerr << a[i] << " \n"[(i + 1) == n]; }
#define debug_two(a, b) cerr << ... |
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)(a).size()
#define rep(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(a) cerr << #a << ": " << (a) << '\n';
#define debug_arr(a, n) { cerr << #a << " "; rep(i, 0, n) cerr << a[i] << " \n"[(i + 1) == n]; }
#define debug_two(a, b) cerr << ... |
#include<bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int,int>pi;
const int maxn=1e6+10;
const int M=1000000007;
int n,x,b[105],s[105],c[105],dp[105][10005],sum,ans,tot,q;
void add(int &x,int y){x+... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
// https://github.com/nweeks1/UltiSnips
template <const int32_t MOD> struct ModInt {
int32_t x;
ModInt() : x(0) {}
ModInt(long long u) : x(u) {
x %= MOD;
if (x < 0)
x += MOD;
}
friend bool operator==(const ModInt &a, const ModI... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
... |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define mod 1000000007
using namespace std;
int n,m;
int c[109],b[109];
int smb[109],ssb[109];
int f[109][10009],sf[109][10009],g[10009];
int pt[109],smc[109];
pii q[100009];
int ans[100009];
int mo(int x)
{
f[0][... |
#include <bits/stdc++.h>
#define mp std::make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define gc getchar
#define pc putchar
typedef unsigned char u8;
typedef unsigned short u16;
typedef unsigned int u32;
typedef long long ll;
typedef long double ld;
typedef unsigned long l... |
#include <iostream>
#include <algorithm>
constexpr int N = 105;
constexpr int p = 1000000007;
int add(int x, int y) { return (x += y) >= p ? x - p : x; }
int sub(int x, int y) { return (x -= y) < 0 ? x + p : x; }
int n, q, k;
int c[N], b[N];
int f[N][N * N];
int s[2][N * N];
int l[N];
int main() {
std::ios::syn... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
#define range(x) (x).begin(),(x).end()
std::mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int sj(int n)
{
unsigned int x... |
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long i64;
const int N = 100 + 10, P = 1e9 + 7;
int n, b[N], c[N];
int dp[N][N * N];
int query(int x) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
int s = 0, sum = 0;
for(int i = 1; i <= n; i++) {
for(int j = 0; j <= s;... |
#include <cstdio>
#include <algorithm>
using namespace std;
#define ADD(x) ((x>=mod)?x-mod:x)
const int mod=1e9+7;
int n,c[110],b[110],sum[110],sum1[110],sumc[110],dp[110][10010],ans,Min,T,x;
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&c[i]),sumc[i]=sumc[i-1]+c[i];
for (int i=1;i<n;i++) scanf("%d... |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define mod 1000000007
using namespace std;
int n,m;
int c[109],b[109];
int smb[109],ssb[109];
int f[109][10009],g[10009];
int pt[109],smc[109];
pii q[100009];
int ans[100009];
void dp()
{
f[0][0]=1;
for(int i=1;... |
#include <bits/stdc++.h>
#define mp std::make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define gc getchar
#define pc putchar
typedef unsigned char u8;
typedef unsigned short u16;
typedef unsigned int u32;
typedef long long ll;
typedef long double ld;
typedef unsigned long... |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
using namespace std;
#define MD (1000000007U)
template<class T> struct cLtraits_identity{
using type = T;
}
;
template<class T> using cLtraits_try_make_signed =
typename conditional<
is_inte... |
#include <bits/stdc++.h>
using namespace std;
const int md=1000000007,MID=111*111;
int n,q,x,i,ii,i1,j,lst,len,lensum,cur,r,b[111],c[111];
long long f[2][MID];
int main() {
scanf("%d",&n);
for (i=1; i<=n; i++) scanf("%d",&c[i]);
for (i=1; i<n; i++) scanf("%d",&b[i]);
scanf("%d",&q);
while (q--) {
scanf("%... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const ll MOD = 1e9+7;
int N, Q;
ll C[110], CS[110];
ll B[110];
ll T[110];
ll X[100100];
ll D[110][10100];
ll solve(ll X) {
memset(... |
#include <iostream>
#include <cstdio>
#define maxn 105
using namespace std;
const int mo = 1e9 + 7;
int n, f[maxn][maxn * maxn];
int b[maxn], c[maxn], q, x;
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
for (int i = 1; i < n; i++) scanf("%d", &b[i]);
scanf("%d", &q);
scanf("%d", &x... |
#include <bits/stdc++.h>
const int N = 105, M = 3e6 + 10, offset = 1.5e6 + 5, P = 1e9 + 7;
int n, c[N], b[N], f[M], g[M], Q, x;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
for (int i = 1; i < n; i++)
scanf("%d", &b[i]);
scanf("%d%d", &Q, &x);
int mx = c[1], mn = x;
if (mx < ... |
#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define forn(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int N = 103;
const int SUM = 101 * 101;
int dp[N][SUM];
int n, a[N], b[N];
int pb[N];
void solve() {
// for all i sum - ((i-1)*b_1 + ... |
#include <bits/stdc++.h>
#define maxn 105
#define maxN 10086
using namespace std;
const int p = 1e9 + 7;
int n, q, x;
int b[maxn], c[maxn], f[maxN], g[maxN], sb[maxn];
int cal(int x){
for(int i = 0;i < maxN;i++) g[i] = 1;
for(int i = 1;i <= n;i++){
for(int j = 0;j < maxN;j++) f[j] = 0;
for(int j = max(0, i * ... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... |
#include <iostream>
#include <algorithm>
constexpr int N = 105;
constexpr int p = 1000000007;
int add(int x, int y) { return (x += y) >= p ? x - p : x; }
int sub(int x, int y) { return (x -= y) < 0 ? x + p : x; }
int n, q, k;
int c[N], b[N];
int f[N][N * N];
int s[2][N * N];
int l[N];
int main() {
std::ios::syn... |
#include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7;
int n, x, ans, a[105], b[105], c[105], s1[105], s2[105], dp[105][10005];
int main(){
scanf("%d", &n);
for(int i=1; i<=n; ++i){
scanf("%d", &c[i]);
s1[i] = s1[i-1] + c[i];
}
for(int i=1, s=0; i<n; ++i) scanf("%d", &b[i]);
scanf("%*d%d", &x... |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define mod 1000000007
using namespace std;
int n,m;
int c[109],b[109];
int smb[109],ssb[109];
int f[109][10009],sf[109][10009],g[10009];
int pt[109],smc[109];
pii q[100009];
int ans[100009];
int mo(int x)
{
f[0][... |
#pragma comment(linker, "/STACK:512000000")
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <deque>
#include <memory>
#include <chrono>
#include <cassert>
#include <random>
#include <queue>
#include <set>
#include <map>
#include <array>
using n... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
int n;
const int maxn = 105;
int c[maxn], b[maxn];
ll pb[maxn], ppb[maxn];
ll dp[maxn][maxn * maxn];
ll pre[maxn][maxn * maxn];
ll S;
const ... |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define mod 1000000007
using namespace std;
int n,m;
int c[109],b[109];
int smb[109],ssb[109];
int f[109][10009],sf[109][10009],g[10009];
int pt[109],smc[109];
pii q[100009];
int ans[100009];
int mo(int x)
{
f[0][... |
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int c[110],b[110],sumb[110],sumc[110],f[110][11000];
signed main() {
int n,x;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",c+i);
for(int i=1;i<n;i++)
scanf("%d",b+i);
for(int i=1;i<=n;i++)
sumc[i]=sumc[i-1]+c[i];
for(int i=2;i<=n;i++)
s... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <array>
#include <random>
#include <chrono>
#include <string>
#include <queue>
#include <cassert>
#define int long long
#define pb push_back
#define pp pair<int,int>
#define ff first
#define dd second
#define mp make_pair
using namespac... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
const int inf = 1e9;
const ll inf64 = 1e18;
const int mod = inf + 7;
inline int _mul(int a, int b)... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
int n;
const int maxn = 105;
int c[maxn], b[maxn];
ll dp[maxn][maxn * maxn];
const int mod = 1e9 + 7;
void add(ll &a, l... |
#include<bits/stdc++.h>
#define ll long long
#define sz(x) ((int)x.size())
#define fi first
#define se second
#define pii pair<int,int>
#define pk push_back
const int maxn=1e2+5;
const int mo=1e9+7;
const int Max=1e5;
const int maxm=2e5+5;
using namespace std;
int rd(){
int x=0,f=1;char c=getchar();
while(!isdigit(c)... |
// #pragma comment(linker, "/stack:200000000000")
#pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using i128 = __int128_t;
using u128 = __uint128_t;
using u64 = uint64_t;
//define
#define int long long
#defi... |
#include<bits/stdc++.h>
using namespace std;
const int N = 105;
const int mod = 1e9+7;
int n,c[N],b[N],q,f[N][N*N],ans;
int main() {
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&c[i]);
for(int i=1;i<n;i++) scanf("%d",&b[i]);
for(int i=1;i<n;i++) b[i] += b[i-1];
for(int i=1;i<n;i++) b[i] += b[i-1];
scanf("%d"... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define RANGE(x) x.begin(),x.end()
void one(){
}
int main(){
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int> b(n-1);
vector<int> c(n);
ll allways= 1;
for(int i=0;i<n;++i){
... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxl=105,maxs=10005,mod=1e9+7;
int read(){
int s=0,w=1;char ch=getchar();
while (ch<'0'||ch>'9'){if (ch=='-') w=-w;ch=getchar();}
while (ch>='0'&&ch<='9'){s=(s<<1)+(s<<3)+(ch^'0');ch=getchar();}
return s*w;
}
int n,l,r,L,ans;
int c[maxl... |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=105;
const int MOD=1000000007;
int n,q;
int c[N];
int b[N];
long long sb[N];
int f[N][N*N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&c[i]);
for(int i=1;i<n;i++)
scanf("%d",&b[i]);
for(int i=1;i<n;i... |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <bitset>
#include <unordered_map>
#incl... |
#include <bits/stdc++.h>
using namespace std;
#define sz(a) (int)(a).size()
#define rep(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define debug(a) cerr << #a << ": " << (a) << '\n';
#define debug_arr(a, n) { cerr << #a << " "; rep(i, 0, n) cerr << a[i] << " \n"[(i + 1) == n]; }
#define debug_two(a, b) cerr << ... |
#include <bits/stdc++.h>
using namespace std;
const int md=1000000007,MID=111*111;
int n,q,x,i,ii,i1,j,lst,len,lensum,cur,r,b[111],c[111];
long long f[2][MID];
map<int,int> was;
int main() {
scanf("%d",&n);
for (i=1; i<=n; i++) scanf("%d",&c[i]);
for (i=1; i<n; i++) scanf("%d",&b[i]);
scanf("%d",&q);
while (q... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int MOD = 1e9+7;
ll dp[101][10010];
int a[101], b[101];
int main(){
int n;
scanf("%d", &n);
for (int i=0;i<n;i++){
scanf("%d", a+i);
}
for (int i=0;i<n-1;i++){
scanf("%d", b+i);
}
int q, x;
scanf(... |
#ifndef __APPLE__
#include <bits/stdc++.h>
#else
#include <iostream>
#include <cstring>
#include <algorithm>
#endif
using namespace std;
typedef long long ll;
const int N = 105;
const int M = 1e9 + 7;
int n, c[N], b[N], q, x, bp[N], bpp[N];
ll dp[N][N * N], sdp[N][N * N], cp[N];
int main()
{
cin >> n;
for (i... |
#include <bits/stdc++.h>
using namespace std;
const int N = 105, mod = 1000000007;
int n, m, x, b[N], c[N], l, r, ans, f[N][N * N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
for (int i = 1; i < n; i++) scanf("%d", &b[i]);
scanf("%d%d", &m, &x), f[0][0] = 1;
for (int i =... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
/* SOLVE NOTES
(S + a) / n >= (T - b) / m
then
S / n < T / m
we have
S / n - T / m >= - a / n - b / m
S / n - T / m < 0
3 -3
1 5 -5 2 => 1 0 0 2
1/2 1/2 0 2
1/2 1/4 1/4 2
... |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define INF 2001001001
#define MOD 1000000007
ll N,X,C[105],B[105],D[105],D1[105];
int Q;
ll dp[105][10005];
ll C2[105];
int main()
{
ios_base::sync_with_... |
#include <bits/stdc++.h>
using namespace std;
const int BASE = 1e9 + 7;
int n, c[111], b[111], q, x[100100], sumB[111];
long long f[111][10100];
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
cin >> c[i];
for (int i = 0; i < n - 1; i++)
{
cin >> b[i];
if (i)
b[i] += b[i - 1];
sumB[i]... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 105;
const int MOD = 1000000007;
int n;
int suff[N];
int dp[N][N * N];
int pref[N][N * N];
int val[N], c[N], b[N];
int cnt = 0;
int x[N];
void backtrack(int k) {
for (int i = 0; i <= c[k]; i++) {
x[k] = i;
if (k ==... |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
inline int read()
{
int f = 1, x = 0;
char ch;
do{
ch = getchar();
if (ch == '-')
f = -1;
}while(ch < '0' || ch > '9');
do{
x = x * 10 + ch - '0';
ch = getchar();
}while(ch >= '0' && ch <=... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int mod = 1000000007;
const int m = 101, mxk = m * m;
int n, k, q;
int a[m], b[m], f[m], dp[mxk];
int main(){
ios... |
#include<bits/stdc++.h>
using namespace std;
const int N=105,mod=1e9+7;
inline int add(int a,int b){return a+b>=mod?a+b-mod:a+b;}
inline int mul(int a,int b){return 1ll*a*b%mod;}
int n,m,l,r;
int b[N],c[N],p[N];
int f[N*N],g[N*N];
map<int,int> ans;
inline int solve(int x){
for(int i=0;i<=n*100;i++)g[i]=1;
for(int i=1... |
#include <iostream>
#include <algorithm>
constexpr int N = 105;
constexpr int p = 1000000007;
int add(int x, int y) { return (x += y) >= p ? x - p : x; }
int sub(int x, int y) { return (x -= y) < 0 ? x + p : x; }
int n, q, k;
int c[N], b[N];
int f[N][N * N];
int s[2][N * N];
int l[N];
int main() {
std::ios::syn... |
#include<cmath>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
int main() {
int n, M=1000000007, tmp, maxc=100;
vector<int> c;
scanf("%d", &n);
int sumc=0;
for(int i=0;i<n;++i) {
scanf("%d", &tmp);
c.push_back(tmp);
sumc+=tmp;
}... |
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif
#define sz(x) ((int) (x).size())
#define TASK "text"
const int inf = (int) 1.01e9;
con... |
/**
* @brief codeforces
* @author yao
*/
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <utility>
#include <algorithm>
#include <functional>
#include <climits>
#define ft first
#define sd second
#ifdef DBG
# define dbg_pri(x...) fprintf(stderr,x)
#else
# define dbg_pri(x...... |
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 105;
const int MOD = (int)1e9 + 7;
... |
/*~Rainybunny~*/
#include <cstdio>
#include <cstring>
#define rep( i, l, r ) for ( int i = l, rep##i = r; i <= rep##i; ++i )
#define per( i, r, l ) for ( int i = r, per##i = l; i >= per##i; --i )
const int MAXN = 101, MOD = 1e9 + 7;
int n, c[MAXN + 5], b[MAXN + 5];
int sc[MAXN + 5], sb[MAXN + 5], sb2[MAXN + 5];
int... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x,T y){x<y?x=y:T();}
template <typename T> void chkmin(T &x,T y){y<x?x=y:T();}
te... |
// Bhagya Kamal Jain
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define mii map<ll int,ll int>
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a) (a).begin(),(a).end()
#define F first
#defin... |
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <fstream>
#include <random>
#include <iomanip>
#include <clocale>
#include <bitset>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#inclu... |
#include<bits/stdc++.h>
namespace my_std{
using namespace std;
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,x,y) for (int i=(x);i>=(y);i--)
#define go(x) for (int i=head[x];i;i=edge[i].nxt)
#define templ templat... |
#include <bits/stdc++.h>
// #pragma GCC optimize("trapv")
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
ty... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)
const int MN = 105, MOD = 1e9 + 7;
int n, a[MN], b[MN], c[MN], psa[MN], psum[MN], q, x, dp[12000005], ... |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
/*
Author: QAQAutoMaton
Lang: C++
Code: C1.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(qaq...) fprintf(stderr,qaq)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all... |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int mod=1e9+7;
inline int addmod(int x)
{
return x>=mod?x-mod:x;
}
inline int submod(int x)
{
return x<0?x+mod:x;
}
int n,m,q,b[105],c[105],sum[105],f[105][10005],qans[1005],pn;
int solve(int x)
{
memset(f,0,sizeof(f));
f[0][0]=1;
i... |
#include <stdio.h>
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <time.h>
#include <map>
#include <stack>
#include <unordered_set>
#include <bitset... |
#include <bits/stdc++.h>
using namespace std;
static struct FastInput {
static constexpr int BUF_SIZE = 1 << 20;
char buf[BUF_SIZE];
size_t chars_read = 0;
size_t buf_pos = 0;
FILE *in = stdin;
char cur = 0;
inline char get_char() {
if (buf_pos >= chars_read) {
chars_read = fread(buf, 1, BUF... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int MAXN = 100;
constexpr int MOD = 1000000007;
constexpr int MAXTOLERANCE = 10000001; //10001; // really? TODO
int c[MAXN], b[MAXN], magic[MAXN];
int dp1[MAXTOLERANCE], dp2[MAXTOLERANCE];
int coalesce[MAXTOLERANCE+1];
int* const coal=coalesc... |
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, y, p, q, r;
int a;
cin >> n >> x >> y;
p = y / 100;
q = n * p;
r = q - x;
a = r;
if (r > a) {
cout << a + 1;
} else if (a < 0) {
cout << "0";
} else {
cout << a;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, x, y;
cin >> n >> x >> y;
if (y * n / 100 <= x)
cout << 0;
else
cout << ceil(y * n / 100 - x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, x, y;
cin >> n >> x >> y;
if ((ceil(y * n / 100.0) - x) < 0)
cout << 0 << endl;
else
cout << ceil(y * n / 100.0) - x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n, x, y, c = 0;
cin >> n >> x >> y;
double p = ceil((y * n) / 100.00);
p = (int)p;
c = p - x;
if (c <= 0) c = 0;
cout << c;
cout << '\n';
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
float n, x, y;
cin >> n >> x >> y;
int ans = ceil((y * n / 100) - x);
cout << max(ans, 0);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
while (cin >> n >> x >> y) {
int sum = n * y;
if (sum % 100) sum += 100;
sum /= 100;
sum -= x;
if (sum > 0)
cout << sum << endl;
else
cout << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, x, y;
scanf("%d", &n);
scanf("%d", &x);
scanf("%d", &y);
int dy = 0;
if ((y * n) % 100 == 0)
dy = ((y * n) / 100);
else
dy = ((y * n) / 100) + 1;
int ans = 0;
if (dy - x <= 0)
ans = 0;
else
ans = dy - x;
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x, y;
int main() {
scanf("%d%d%d", &n, &x, &y);
int req = (int)ceil((double)(n * y) / 100);
if (req <= x)
printf("%d\n", 0);
else
printf("%d\n", req - x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int citizens, wizards, percentage, result;
scanf("%d %d %d", &citizens, &wizards, &percentage);
result = ceil((percentage * citizens) / 100.0);
result = max(result - wizards, 0);
printf("%d\n", result);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
if ((ceil(n * (y / 100.0)) - x) <= 0)
cout << 0 << endl;
else
cout << (ceil(n * (y / 100.0)) - x) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
cin >> n >> x >> y;
cout << max(0, (n * y + 99) / 100 - x) << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.