code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include<iostream>
using namespace std;
#define int long long
const int N=1e4;
const int MOD=998244353;
/**
* 设f[i][j]为用i个数凑出j的方案数
* 则有：
* f[i][j]=f[i-1][j-1]+f[i][2*j]
* f[i][j]=0 (j>i)
*
*/
int f[N][2*N];
int n,m;
signed main(){
cin>>n>>m;
f[0][0]=1;
for(int i=1;i<=n;i++)
for(int ... |
#include <bits/stdc++.h>
# define rep(i,l,n) for(int i=l,i##_end=n;i<i##_end;++i)
# define rrep(i,n,l) for(int i=((int)(n)-1),i##_end=l;i>=i##_end;--i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
using namespace std;
using ll = long long;
template<class T>bool chmax(T &... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define all(x) (x).begin(),(x).end()
#define int long long
#define double long double
void solve() {
int n;
cin >> n;
int count = 0;
int i = 0;
for (i = 1000; i <= n; i... |
/*input
37 450
*/
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define endl "\n"
#define sp " "
#define all(v) v.begin(),v.end()
#define makepr(a,b) make_pair(a, b)
#define loop(i,k,n) for(ll i=k;i<n;i++)
#define rlop(i... | #include <iostream>
using namespace std;
int main(){
float a,b;
cin >> a >> b;
cout << b/100 * a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long X, Y, A, B;
cin >> X >> Y >> A >> B;
long long ans = 0;
while (X < Y) {
if (X < Y / (double)A && X < Y - B) {
if (X * A < X + B) {
ans++;
X *= A;
} else {
... | /*/ Author: _Math.man /*/
#include<bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#... |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef double d;
typedef long double ld;
typedef vector<string> vs;
ty... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main(){
float X, Y, Z;
cin >> X >> Y >> Z;
float res = Z*Y / X;
if(res == floor(res)) cout << res - 1 << endl;
else cout << floor(res) << endl;
} |
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define mod
using ll = long long;
using P = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<numeric>
using namespace std;
#define INF (1 << 30) - 1
#define LINF 1LL << 60
const int MOD = 1000000007;
using ll = long long;
using P = pair<int, int>;
int ... |
#include <iostream>
#include <vector>
//#include <string>
//#include <algorithm>
//#include <math.h>
#include <queue>
//#include <stack>
#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long LL;
typ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pi 3.14159265358979323846
const ll INF=1e18;
const ll N=2e5+5;
const ll MOD=1e9+7;
using namespace std;
double dp[105][105][105];
ll POWER(ll base,ll expo)
{
ll... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e9;
#define mod 1000000007
#define what_is(x) cerr<<#x<<" is "<<x<<"\n";
#define read(x) freopen("in.txt","r",stdin);
#define write(x) freopen("out.txt","w",stdout);
#define Fast ios_base::sync... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define length size()
#define int long long
#define ll long long
#include <cstdint>
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t S, P;
cin >> S >> P;
for (int64_t N = 1; N * N <= P; N++) {
if (P % N != 0) {
continue;
}
int64_t M = P / N;
if (N + M == S) {
cout << "Yes" << endl;
return 0;
}
... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <complex>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include <queue>
#define INF... | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#include<cmath>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y,ll z){
if(y==0)
return 1;
else
{
ll p=power(x,y/2,z);
ll w=(p*p)%z;
if(y%2==0)
return w;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ford(i,a,b) for(int i=a;i<=b;i++)
#define foru(i,a,b) for(int i=a;i>=b;i--)
#define forv(i,a,b) for(int i=a;i<b;i++)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define bug(x) cout<<x<<'\n';
#define bit(x,i) ((x>... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
int n,m;
vector<int> G[20];
bool used[20];
int col[20];
vector<int> vs;
void dfs(int v)
{
if(used[v])return;
used[v]=true;
vs.push_back(v);
for(int u:G[v])dfs(u);
}
... | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long... |
//----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
type... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
#include <string>
#include <iostream>
#include <stack>
#include <queue> // priority_queue も入ってる
#include <set> // 要素数は size() で取得 multisetもある
#include <map>
#include <array> // sizeはコンパイル時定数で固定
#include <vector>
#include <numeric> // accumulate, gcd
#include <algorithm> // count_ifに必要
#include <iomanip> // cout <... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <iostream>
#include <fstream>
#include <chrono>
using namespace std;
void solve(int test, istream &in) {
int n; string s;
... |
// .------------------------------------------------------------.
// | K U S A Y A R O U |
// | |
// | ---|---|--- ___ ____ _\_ ___ |
// | _______ |_|_| / ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define int long long
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define ... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using cint = cpp_int;
#define fastio \
std::cin.tie(nullptr); \
std::ios::sync_with_stdio(false);
using ll = long long;
using ld = long double;
#define... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#define ll long long
using namespace std;
int main(){
ll n,a,b,c;
scanf("%lld%lld%lld",&n,&a,&b);
c=(ll)(sqrt(a*a+b*b));
if(c*c==a*a+b*b){
if(c==n)puts("1");
else if(c==0)puts("0");
else printf("%lld\n",max(2LL,(c+n-1)/n... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main(void) {
int N;
cin >> N;
int A[N], B[N], C[N];
for(int i = 0; i < N; i++) cin >> A[i];
for(int i = 0; i < N; i++) cin >> B[i];
for(int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define fora(i, x, n) for(int i=(x); i<(n) ; ++i)
#define trav(a, A) for(auto& a : A)
#define endl '\n'
#define ford(i, x) for(int i=(x); i>=0 ; --i)
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define INF (... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef string str;
#define all(x) (x).begin(),(x).end()
#define Sort(x) sort(all((x)))
#define ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXM = 1e4 + 5;
#define pb push_back
#define eb emplace_back
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define mod 1000000007
#define MAX 1e9
#define MIN -1e9
#define LINF 9223372036854775807
#define LMIN -922337203685477... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
void readFile(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main(){
readFile();
ios::sync_with_stdio(false);
cin.tie(NULL);
ll n, x;
cin >> n >> x;
vec... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <string>
#include <map>
#include <set>
#include <cstdio>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;
vector<ll> A;
ll calc(ll N, ll sep)
{
ll ret = 0;
//vector<ll> v;
... | // Problem: B - Mex Boxes
// Contest: AtCoder - KEYENCE Programming Contest 2021
// URL: https://atcoder.jp/contests/keyence2021/tasks/keyence2021_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
// Problem: A - Two Sequences 2
// Contest: AtCoder - KEYENCE Programmi... |
#include<bits/stdc++.h>
using namespace std;
int n,a[10005],b[10005],ans=12345678;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i]>>b[i];
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
if (i==j)
ans=min(ans,a[i]+b[i]);
else
ans=min(ans,max(a... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define pb push_back
#define endl '\n'
#define sa(x) sort((x).begin(), (x).end());
#define int long long
template<typename T, typename U> static inline void amin(T &x, U y){ if(y<x) x=y; }
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
struct edge{
ll to;
ll c;
};
vector<edge> g[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<pair<int, long long int>>> G(N);
for (int i = 0; i < N - 1; i++) {
int u, v;
long long int w;
cin >> u >> v >> w;
u--;
v--;
pair<int, long long int> p = make_pair(v, w), q = make_pair(u, w);
G.... |
#include <bits/stdc++.h>
using namespace std;
int n,m,bl[55][55],val[55][55],di[]={0,0,-1,1},dj[]={1,-1,0,0},nn,mm;
bool vis[2505],p;
int main()
{
//freopen("in.txt","r",stdin);
p=true;
scanf("%d %d",&n,&m);
for(int i=0;i<50;i++)
{
for(int j=0;j<50;j++)
{
scanf("%d",&bl[i... | #include <bits/stdc++.h>
clock_t start;
constexpr int H = 50, W = 50;
int si, sj;
int t[H][W], p[H][W];
struct cand {
std::string s;
int score, i, j;
std::vector<bool> seen;
bool operator<(const cand& rhs) const { return score < rhs.score; }
bool valid(const char& c) {
if (c == 'L') retur... |
#include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
int main() {
long long a,b,c;
cin>>a>>b>>c;
long long ans=(((a*(a+1)/2%mod) * (b*(b+1)/2%mod)%mod) * (c*(c+1)/2%mod))%mod;
cout<<ans<<endl;
}
| #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define tiii tuple<int, int, int>
#define pll pair<long long,long long>
#def... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int a,b;
cin>>a>>b;
cout<<(2*a+100)-b;
return 0;
} | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define MX 100005
#define inf INT_MAX
#define mod 1000000007
#define endl "... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define read(a) scanf("%d", &a)
#define x first
#define y second
#define N 1011
int n, m;
int ans;
char a[N][N], b[N][N];
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
bool vis[N];
bool v[N][N][4];
struct state {
int ... | //W4P3R
#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define pb push_back
#define re register ll
#define fr first
#define sd second
#define pa pair<ll,ll>
#define FOR(i,a,b) for(re i=a;i<=b;i++)
#define REP(i,a,b) for(re i=a;i>=b;i--)
#define MEM(a) memset(a,0,sizeof(a))
#define N 2010
... |
#include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i < n; i++)
using ll = long long;
using P = pair<int,int>;
const ll INF = 1e18;
const int MX = 2005;
int main() {
ll n;
cin >> n;
vector<ll>A(n);
rep(i,n) cin >> A[i];
vector<ll>maxS(n);
vector<ll>sumS(n);
rep(i,n... | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(int)(x);i<(int)(y);i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=2e5;
const int inf=1e9;
vector<pair<int,long>> g[siz];
long d... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define ll long long
#define ld long double
#define mod 1000000007
#define pb push_back
#define inf 1000000000000000000
#define ff firs... |
/*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <fstream>
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vect... | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<LL,int>;
const LL INF = (LL)1e18;
struct edge{
int to;
LL T, K;
edge(int to, LL T, LL K) : to(to), T(T), K(K) {}
};
int main(){
int N, M, X, Y;
cin >> N >> M >> X >> Y;
X-... | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
const int mod=1e9+7;
bool visited[N];
long long dist[N];
vector<pair<int,pair<int,int>>>adj[N];
priority_queue<pair<long long,int>>pq;
void Dijkstra()
{
int k,t,x,y;
long long val;
while(!pq.empty())
{
val=-pq.top().first;
... |
#include <bits/stdc++.h>
clock_t start;
constexpr int H = 50, W = 50;
int si, sj;
int t[H][W], p[H][W];
struct cand {
std::string s;
int score, i, j;
std::vector<bool> seen;
bool operator<(const cand& rhs) const { return score < rhs.score; }
bool valid(const char& c) {
if (c == 'L') retur... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define absdiff(a,b) (a>b)?a-b:b-a
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define fast ios_base::sync_with_stdio(false);cin.tie(0);
#define MOD 1000000007
#define ll_MAX 19223372036859
#define endl "\n"
ll f... |
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define NZB ios::sync_with_stdio(false)
typedef long long ll;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
const int MAX_N = 1e3 + 7;
using na... | #include<bits/stdc++.h>
using namespace std;
long long n,L,A[2];
string s[200005];
int main() {
cin>>n>>L;
for(int i=1;i<=n;i++)
cin>>s[i];
A[0]=1;
for(int i=2;i<=n;i++) {
int cnt=0;
for(int j=0;j<L;j++)
if(s[i][j]!=s[1][j])
cnt++;
A[cnt%2]++;
}
cout<<A[0]... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;//大きなint型
using ld = long double;//大きなdouble型
using P = pair<int,int>;//pair型の型エイリアス
#define rep(i,n) for (int i = 0; i < (n); ++i)//iをnまですすめる。
#define PI 3.14159265359
int main(){
int n,m;
int ans = 0;
int last_ans = 0;
cin>>n>>m;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 110;
int a[MAXN], b[MAXN];
int ball[MAXN];
int c[20], d[20];
int n, m, k;
int ans = 0;
void dfs(int x) {
if (x > k) {
int cnt = 0;
// for (int i = 1; i <= n; i++) {
// cout... |
# include<bits/stdc++.h>
using namespace std;
# define l long long
# define db double
# define rep(i,a,b) for(l i=a;i<b;i++)
# define vi vector<l>
# define vvi vector<vi>
# define vsi vector<set<l> >
# define pb push_back
# define mp make_pair
# define ss second
# define ff first
# define pii pair<l,l>
# define trvi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<pair<int,string>> v(n);
rep(i,n){
string s;
int t;
... |
#include<bits/stdc++.h>
using namespace std;
const int M=1e5+5;
const int P=1e9+7;
int n,A[M];
long long dp[M][2];
void Dp()
{
dp[0][0]=dp[1][0]=dp[1][1]=1;
for(int i=2;i<=n;i++)
{
dp[i][0]=(dp[i-1][0]+dp[i-1][1])%P;
dp[i][1]=dp[i-1][0];
// printf("%d dp [0] %lld [1] %lld\n",i,dp[i][0],dp[i][1]);
}
}
void S... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define nl "\n"
#define pb(k) push_back(k)
#define vi vector<int>
bool ispali(string s)
{
bool ispalin = true;
int i = 0 ;
int j = s.size() - 1 ;
while(i<j)
{
if(s[i]!=s[j])
{
ispalin = fa... |
#include <bits/stdc++.h>
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define M 1000000007
#define umap unordered_map
#define uset unordered_set
#define endl "\n"
#define ... | /*****************************
* Author :: Πρασαννα Κ. Ροι *
*****************************/
/***********************************
* Unus pro omnibus, omnes pro uno *
***********************************/
#include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define __AcHiLlEs ios_base::sync_with_s... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <stack>
#include <queue>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n,... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tej ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define ve vector<int>
#define vl vector<long long int>
#define vp vector<pair<long long int,long long int>>
#define pb push_back
#define fi first
#define se second
#define pb push... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a(m);
for (int mi = 0; mi < m; ++mi) std::cin >> a[mi];
std::vector<int> lengths;
std::sort(a.begin(), a.end());
for (int mi = 0; mi < m; ++mi) {
int prev = (mi ==... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall (x) x.rbegin(), x.rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const int MOD = 1e9+7;
int main(){... | #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <bitset>
#include <list>
#include<iomanip>
using namespace std;
using ll = long long;
using UL... |
// Problem: A - Not coprime
// Contest: AtCoder - AtCoder Regular Contest 114
// URL: https://atcoder.jp/contests/arc114/tasks/arc114_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
/* Author : Atahar Islam Shihab
ICT'16th Batch,MBSTU
*/
#include<bits/stdc++.h>
u... | #include<bits/stdc++.h>
#define L(i, j, k) for(int i = j, i##E = k; i <= i##E; i++)
#define R(i, j, k) for(int i = j, i##E = k; i >= i##E; i--)
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int, int>
#define mkp make_pair
#define sz(a) ((int) (a).size())
using namespace std;
con... |
#include<iostream>
#include<vector>
using namespace std;
using ll=long long;
int main(){
int n,k;cin>>n>>k;
vector<vector<ll>>f(n+1,vector<ll>(n+1,-1));
ll right=0,left=-1;
for(int y=0;y<n;y++){
for(int x=0;x<n;x++){
cin>>f.at(x+1).at(y+1);
right=max(right,f.at(x+1).at(y+1));
}
}
whil... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i,n) for(int i=0;i<n;i++)
#define fro(i,j,n) for(int i=j;i<n;i++)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
int main() {
int h,w;
cin >> h>>w;
string s[h];
int ans=0;
fr(i,h){
cin >> s[i];
}
fr... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
#define pri(str) cout << str << endl
using ll = long long;
using P = pair<int, int>;
const ll MX = 1e18;
const long double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include<bits/stdc++.h>
#define int long long
#define uc getchar()
#define ph putchar
#define R register
#define CN const
#define rint R int
#define cint CN int
#define ps ph(' ')
#define pe ph('\n')
using namespace std;
cint inf=1e9+7;
cint mix=2e7+5;
inline int in();
inline void out(rint x);
int n=in(),k=in();
int c[... |
//#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define SIZE(x) int(x.size())
using... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,n) for(int i=x;i<(int)n;++i)
#define sp(p) cout<<setprecision(16)<<fixed<<p<<endl;
#define out(a) cout<<a<<endl;
#define vout(v) rep(i,0,v.size())cout<<v[i]<<(i==v.size()-1?"\n":" ");
#define vvout(vv) rep(j,0,vv.size()){vout(vv[j])}
#define mout(m) for(auto... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int_;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; c=getchar())
if(c == '-') f = -f;
for(; '0'<=c&&c<='9'; c=getchar())
a = (a<<3)+(a<<1)+(c^48);
return a*f;
}
cons... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL n,t;
LL calc(LL sum)
{
LL lb=sum-n,ub=su... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> x(n);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
ll d1, d2;
ll d3;
d1 = 0;
d2 = 0;
d3 = 0;
for (int i = 0; i < n; i++) {
d1 += abs(x[i]);
d2... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, j, k) for (int i = j; i < k; i++)
#define RREP(i, j, k) for (int i = j; i >= k; i--)
typedef long long ll;
#define ALL(x) x.begin(), x.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
#define MAXN 5005
#define MOD 998244353
int n... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... |
/**
* author: pankaj_m05
* created: 19.12.2020 23:17:06
**/
#include<bits/stdc++.h>
#define sz(x) (int(x.size()))
using namespace std;
struct fenwick {
int n;
vector< int > bit;
fenwick(int n) {
this -> n = n;
bit.assign(n + 1, 0);
}
fenwick(vector< int >& a) : fenwick(sz(a)) {
for (int i... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<list>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int sol(const string& S) {
const ... |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=1e5+5,M=4e5+5;
int edge[M],Next[M],ver[M],head[N];
int tot=0,tmp=0;
int dfn[N],dis[N];
int n,m;
void add(int x,int y,int z){
ver[++tot]=y,edge[tot]=z,Next[tot]=head[x],head[x]=tot;
}
void dfs(int x){
dfn[x]=+... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using vt = vector<T>;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb p... |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define ll long long
#define ar array
const ll mxN=2e5;
const int mod=1e9+7;
const ll INF=1e18;
#define what_is(x) cerr << #x << " is " << x << endl;
ll a,b,n,k,q,m,x,y,h,l,r,t;
void solve(){
cin>>n;
ll A[n],B[n],aoki=0,delta;
vector<ll> ben... | #include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
//#include <boost/multiprecision/cpp_int.hpp>
//#include <boost/multiprecision/cpp_dec_float.hpp>
//using namespace boost::multiprecision;
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, i... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
typedef long long ll;
int main()
{
int n, maxcnt = 0, cnt = 0, ans = 0;
cin >> n;
vector<int> a(n),b(1000);
for(int i = 0; i <... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll,ll>
#define vi vector<ll>
#define mii map<ll,ll>
#define pqi ... |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include <bits/stdc++.h>
#define rep(i,x,y) for(int i=x;i<=y;++i)
#define per(i,x,y) for(int i=x;i>=y;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int inf = 1e9;
const int mod=1e9+7;
const int N = 3e5 + 5;
i... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/modint>
//using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) int(x.size())
const int INF = 1001001001;
const ll mod = 1000000007;
const ll INFL = 100100100100... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(a) int(a.size())
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) { out << "(" << a.first << "," << a.second << ")"; return out; }
template <typename T, size_t N> ostream& operator <<(ostream& out, con... |
#include <bits/stdc++.h>
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
using namespace std;
typedef double DB;
typedef long double LD;
typedef long long LL;
typedef unsigned long long ULL;
typedef p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repn(i,a,b) for(ll i=a;i>=b;i--)
#define ld long double
#define fi first
#define se second
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define pb push_back
#define mp make_p... |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> A;
vector<int> B;
vector<int> product;
int N,m;
int result = 0;
cin >> N;
for(int i = 0;i < N;i++){
cin >> m;
A.push_back(m);
}
for(int i = 0;i < N;i++){
cin >> m;
B.push_back(m);
}
for(int i = 0;i < N;i++){
... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int l,r;
cin >> l >> r;
long long marg = r-2*l;
long long ans = (marg+1)*(marg+2)/2;
if (marg < 0) ans = 0;
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
for (int i=0;i<t;i++) solve();
} |
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + t... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <iomanip>
#include <cassert>
#include <random... |
#include<bits/stdc++.h>
#define ll long long int
#define pii pair<int,pair<int,int> >
#define F first
#define S second
using namespace std;
#define mod 1000000007
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define print(a) for(int i=0;i<(a.size());i++){cout<<a[i]<<"\n";}
#define sortt(a) sort(a.begin(),a.end())
#define loop(i,a,b) for(int i=0;i<n;i++)
#define int lo... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
//#define debug(x) ;
#define debug(x) cerr << #x << " = " << x << "\n";
ostream& operator<<(ostream& cerr, vector<ll> a... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... |
#include <bits/stdc++.h>
using namespace std;
using cd = complex<double>;
const double EPS = 1e-9;
bool isEq(double a, double b) {
return abs(a - b) < EPS;
}
bool operator==(cd a, cd b) {
return isEq(a.imag(), b.imag()) && isEq(a.real(), b.real());
}
bool operator!=(cd a, cd b) {
return !(a == b);
}
#ifdef _DEBUG
#d... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << ... |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) ((ll)(x).size())
#define ... | #include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
typedef long long ll;
int n,s[N],t[N],from[N];
char str[N];
set<int> pos[2];
ll ans;
int main() {
#ifdef LOCAL
freopen("a.in","r",stdin);
freopen("a.out","w",stdout);
#endif
ios::sync_with_stdio(0);cin.tie(0);
cin>>n>>(str+1);
for(int i=1;i<=n;i++)... |
#include <bits/stdc++.h>
#define NIL (-1)
#define ll long long
using namespace std;
const double PI = acos(-1.0);
int main() {
int N;
cin >> N;
bitset<100001> dp;
dp[0] = 1;
int tot = 0;
for (int i = 0; i < N; i++) {
int T;
cin >> T;
tot += T;
dp |= dp << T;
}
//cout << dp << endl;
//cout << tot << ... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
int sum=0;
cin>>n;
int a[n],b[n];
for (int i = 0; i <n; i++)
{
cin>>a[i];
}
for (int i = 0; i <n; i++)
{
cin>>b[i];
}
for (int i = 0; i <n; i++)
{
if (a[0]<a[i])
{
a[0]=a[i];
}
if (b[0]>b[i])
{
b[0]=b[i];
}
}
for (int i = ... |
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define NN 60
constexpr ll M = 998244353;
vector<ll> edges[2][NN];
ll used[NN];
ll a[NN][NN];
ll f[NN];
ll dfs(ll u, bool t) ... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... |
#include <iostream>
#include <cmath>
#include <iomanip>
typedef long long ll;
using namespace std;
int main() {
int N, tmp;
ll mand = 0, powsum = 0, chebid = 0;
double eucd;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> tmp;
mand += abs(tmp);
powsum += pow(tmp, 2);
if (chebid < abs(tmp)) {
chebid = ab... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <stack>
#include <queue>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
#d... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int st[MAXN], ed[MAXN], idx;
vector<int> e[MAXN], h[MAXN];
void dfs(int u, int fa, int depth) {
st[u] = idx++;
h[depth].push_back(st[u]);
for (int v: e[u]) {
if (v == fa) continue;
dfs(v, u, depth + 1);
}
ed[u]... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define double long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
#defi... |
//Author: Fuadul Hasan(fuadul202@gmail.com)
//BSMRSTU,Gopalganj
//#include<bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <random>
... | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define ll long long
int main(){
ll int N;
cin >> N;
vector<ll int> a(N);
for( ll int i = 0; i < N; i++){
cin >> a.at(i);
}
vector<ll int> sum_each_step(N);
ll in... |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void print() { print0("\n"); }
template<typ... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <string>
#include <numeric>
#include <ctype.h>
#include <limits>
#include <iomanip>
#define rep(i,n) for (int i = 0; i < ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
a.push_back(2e18);
vector<ll> s(n + 2);
rep(i, n + 1) {
... |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
string s;
cin >> s;
long long int n = s.length();
long long int one = 0, two = 0, sum = 0;
for (long long int i = 0; i < n; i++)
{
int num = s[i] - 48;
if (num % 3 == 1)
one++;
else if (num % 3 =... | #include<bits/stdc++.h>
#define pu push
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define rrep(i,x) for(int i=1;i<=x;i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<ll,ll> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int n;
int Mat[550... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
bool solve() {
int n, m, t;
cin >> n >> m >> t;
vector<int> a(m), b(m);
int bat = n;
int time = 0;
rep(i, m) {
cin >> a[i] >> b[i];
bat -=... | #define rep(i, n) for(int i = 0; i < (int)(n); i++)
#include <iostream>
#include <string>
#include <algorithm>
#include<vector>
#include<cmath>
using namespace std;
int main(){
int n,m,t;
string ans = "Yes";
cin >> n >> m >> t;
int power = n;
int nt = 0;
rep(i,m){
int a,b;
cin >... |
#include <bits/stdc++.h>
using namespace std;
typedef pair<long long, int> P;
struct edge{
int to;
long long cost;
long long time;
};
int main(){
int N, M, X , Y;
cin >> N >> M >> X >> Y;
X--;
Y--;
vector<vector<edge>> G(N);
for(int i = 0; i < M; i++){
int A, B;
cin >... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n,m,x,y;
cin>>n>>m>>x>>y;
vector<ll> adj[n+1],dis[n+1],tim[n+1],ans(n+1);
for(ll i=0;i<m;i++){
ll a,b,c,d;
cin>>a>>b>>c>>d;
adj[a].push_back(b);
adj[b].push_back(a);
dis[a].push_back(c);
dis[b].push_back(c);
tim[a].... |
#include <bits/stdc++.h>
#include<vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main(){
string s;
cin>>s;
for(int i=s.size()-1;0<=i;i--){
if(s[i]=='6'){
cout<<'9';
}else if(s[i]=='9'){
cout<<'6';
}else{
cout<<s[i];
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define RE... |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define REP(i, L, R) for (int i = L; i < (R); ++i)
#define SZ(x) (int)x.size()
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template <typename T>
bool ckmin(T &a, const T &b) ... | #include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)){if(ch=='-'){f=true;}ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
x=f?-x:x;
return ;
}
template <typename T>
inline void write(T x){
if(x<0)... |
#include <bits/stdc++.h>
using namespace std;
int H, W;
char A[2000][2001];
int dp[2000][2000];
int main() {
scanf("%d %d", &H, &W);
for (int i = 0;i < H;i++) {
scanf("%s", A[i]);
}
dp[H - 1][W - 1] = 0;
for (int i = W - 2;i >= 0;i--) {
dp[H - 1][i] = (A[H - 1][i + 1] == '+' ? 1 : ... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int H,W;
vector<vector<char>> A;
vector<vector<ll>> dp(2000,vector<ll>(2000));
int f(int y,int x){
int p;
if(A[y][x] == '+') p=1;
else p=-1;
if((x+y)%2==0) p*=-1;
return p;
}
int main(){
cin>>H>>W;
A.resize(H);
for(int i=0;i<H;i++) A[i].r... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
string result = "";
for (int j = 0; j < n; j++) {
int i = n - 1 - j;
if (s[i] == '0')
result += "0";
if (s[i] == '1')
result += "1";
if (s[i] == '6')
result += "9";
if (... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.er... |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.be... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int i = 0; i < (int)(n) ; i++)
#define rep2(i,a,b) for (int i = (a); i < (int)(b); i++)
#define Rrep(i,n) for (int i = (n); i >= 0; i--)
#define ENDL '\n'
#define SZ(a) (int)(a.size())
#define all(a) a.begi... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF = 1001001001;
int main() {
int n, s, d;
cin >> n >> s >> d;
vector<int>x(n), y(n);
rep(i,n) cin >> x[i] >> y[i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
/*"itob" int to "N"base */ template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";s... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int modd=998244353;
int a,b,c;
cin>>a>>b>>c;
a=a*(a+1);
a=a/2;
b=b*(b+1);
b=b/2;
c=c*(c+1);
c=c/2;
a=a%modd;
b=b%modd;
c=c%modd;
a=(a*b)%modd;
a=(a*c)%modd;
cout<<a;
}
| #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// nam... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define llrep(i,n) for(ll i=0; i<(ll)n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortしてから使う
#define INF 2147483647
#define LLINF 9223372036854775807LL
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const int maxn=100000+10;
int main()
{
vector <P> vec,vecx,vecy;
int n; cin>>n;
for(int i=0;i<n;i++)
{
P a; cin>>a.first>>a.second;
vec.push_back(a);
}
vecx=vec;
vecy=vec;
sort(ve... |
#include<bits/stdc++.h>
using namespace std;
long long pow(int k){
if(k==0) return 1;
else{
long long a = 2*pow(k-1);
a %= 998244353;
return a;
}
}
int main(){
int h,w;
cin >> h >> w;
vector<int> red(h+w-1),blue(h+w-1),white(h+w-1);
for(int i = 0 ; i < h ; i++ ) {
... | #include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n = 0, p = 0, q = 0, mod = 1000000007, pi = 3.1415926535;
string s1, s2;
char moji;
cin >> a >> b;
vector<string> v(a);
for(int... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
... | #include<bits/stdc++.h>
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
char *fs,*ft,buf[1<<20];
#define gc() (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<20,stdin... |
///////////////////////Loading Payloads.......////////////////////////////
#include<bits/stdc++.h>
#define f(i,a,b) for(int i = a; i < b; i++)
#define fd(i,a,b) for(int i = a; i > b;i--)
#define ll long long
#define fl(i,a,b) for(ll i = a; i < b; i++)
#define VI vector<int>
#define VP vector<pair<int,int>>
#define VS v... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> v;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
cout << i << "\n";
if (i * i != n)v.push_back(n / i);
}
}
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int n;
cin>>n;
for(int i=1;i<=1000000;++i)
{
int k=log10(i);
int tmp=pow(10,k+1);
//cout<<i*tmp+i<<'\n';
if(i*tmp+i>n)
{
cout<<i-1<<'\n';
break;
}
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(void){
long long n;
cin >> n;
long long m = 1;
long long k = 10;
long long ans = 0;
for(int i=1;i<1000000;i++){
if(k <= i) k*=10;
if(i*k+i <= n){
ans++;
}
if(i*k+i > n) break;
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" <<... | #include <stdio.h>
int main(void) {
int in;
scanf("%d", &in);
printf("%d", (in > 0) ? in : 0);
} |
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_p(x) cerr<<#x": "<<(x).first<<' ... | #include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
map<int,int>Map;
int n, L, A[101000], w[101000], B[101000];
long long res = 0;
int LL[101000], RR[101000];
int PP[101000], QQ[101000];
int main(){
int i;
scanf("%d%d",&n,&L);
for(i=1;i<=n;i++)scanf("%d",&A[i]);
for(i=1;i<=n;i++)sca... |
#pragma clang optimize on
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
#define shift 30
inline int get_digit() {
int x = 0, f = 1;
char c = getchar();
while(c > '9' || c < '0') {
if(c == '-... | //For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456 a.cpp -o a.exe in cmd
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define ll long long int
#define ld long double
#define vi vector<int>
#define vll vecto... |
#define IOS ios::sync_with_stdio(false);
#define rep(i, a, n) for(ll i=a;i<=n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define endl "\n"
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
ll n, m, t, k, ans, cnt, sum, flag;
ll arr[N], v... | #pragma GCC target ("avx2")
//#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll v... |
#include<bits/stdc++.h>
#include<string>
using namespace std;
int main()
{
int i,j,n,k,m,l=0;
cin>>n>>k>>m;
int ara[n];
for(i=0;i<n-1;i++)
{
cin>>ara[i];
l+=ara[i];
}
if(l/n>=m)
{
cout<<"0";
return 0;
}
else
{
for(i=1;i<=k;i++)
{
l+=i;
if(l/n>=... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <cmath>
# include <functional>
# include <utility>
# include <queue>
# include <stack>
# define MOD 1000000007
# define INF 2000000000
#define rep(i,rept) for(ll i = 0; i<rept;i++)
typedef long long ll;
using name... |
#include <bits/stdc++.h>
#define SpeeD ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define ll long long
#define endl '\n'
using namespace std;
ll n , t , k , m;
bool nud(int n)
{
int a[100];
int c= 0 ;
// counter for octal number array
int i = 0... | #include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <vector>
using namespace std;
int X;
int main(){
cin >> X;
cout << 100-X%100;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
const int inf = 1e9 + 7;
int a[807][807],b[807][807];
int n,k;
bool check(int m){
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(a[i][j] > m) b[i][j] = b[i-1][j]-1;
else b[i][j] = b[i-1][j]+1;
}
}
for(... | #include <bits/stdc++.h>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##... |
#include <bits/stdc++.h>
using namespace std;
#ifdef __DEBUG__
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr << " " << H; debug_out(T...);}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#d... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define ll long long
#define rep(n) for(int i=0;i<n;i++)
void fastInOut() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#ifndef ONLINE_JU... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<stack>
#include <chrono>
#include <random>
#include <iterator>
#include <map>
#include<list>
#include<sstream>
#include <algorithm>
#include <fstream>
#include<unordered_map>
#include<set>
#include<queu... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc... | /* � Ashiq Uddin Pranto
Department of Computer Science and Engineering
BATCH 27
University Of Rajshahi,Bangladesh
*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define FOR(x,y) for(ll i=x;i<=y;i++)
#define pb(x) push_back(x)
#define mp make_pair
#define pii pair<int,int>
#define pll ... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#i... |
#include<bits/stdc++.h>
using namespace std;
#define light ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define pb push_back
#define cases() ll t;cin>>t;while(t--)
#define all(c) c.begin(),c.end()
#define PI 3.14159265358979323846
const ll MAX = 2e5+5;
const ll INF = 1e18;
const l... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define MAX 100010
#define MOD 1000000007
#define INF 1e15
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi 3.14159265358979323846
#define endl "\n"
#define coutflg if(flg){cout << ... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define sz(a) ((int) (a).size())
#define all(x) (x).begin(), (x).end()
const long double eps = 1e-9;
const int inf = (1 << 30) - 1;
const long long inf64 = ((long long)1 << 62) - 1;
const long d... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue... |
#include <bits/stdc++.h>
using namespace std;
int main() {
float x=0,y=0,z=0;
int a=0;
cin >> x >> y >> z;
while(y/x > a/z){
a++;
}
cout << a -1;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n)
using namespace std;
using ll = long long;
using vll = vector<... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
template <typename T>
void read(T &x) {
x = 0; char c = getchar(); int f = 0;
for (; !isdigit(c); c = getchar())
f |= c == '-';
for (; isdigit(c); c = getchar())
x = x * 10 + (c ^ '0');
if (f) x = -x;
}
template <typename T>
void write(T x, char... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string str;
cin >> str;
int i = 0;
int txtsize = str.size();
string after = "";
for (int j = txtsize; j >= 0; j--)
{
string ch = str.substr(j, 1);
if (ch == "6")
{
ch = "9";
}
e... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
if (s[i] == '6') {
cout << '9';
}
else if (s[i] == '9') {
cout << '6';
}
else {
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.