code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
using namespace std;
#define rep(i, n) for (int ... | #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 ... |
//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... | #include <bits/stdc++.h>
#define int long long
#define mod 998244353
using namespace std;
main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
vector <int> d(3);
int ans = 0;
for (int i = 1; i <= n; ++ i){
int cnt = 0;
for (int j = 1; j <= m;... |
/*
author : Aryan Agarwal, IIT KGP
created : 08-March-2021 14:22:39 IST
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxn = 1e5;
const long long INF = 2e18;
const int32_t M = 1000000007; /*more than 1e9 */ /*7 + 1e9*/
// const int32_t M = 998244353; /*less than 1e9 */ /*1 ... | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false); cin.tie(0);
#define trav(x,a) for (auto& x: a)
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define mem(a,v) memset((a)... |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=10e9+7;
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
cout<<(((a*d)%mod)-((b*c)%mod))%mod<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << a*d - c*b << endl;
} |
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define inf 1000000000000000001
#define mod 1000000007
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair(x,y)
#define mem(a,... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vv = vector<vi>;
using Graph = vector<vector<int>>;
template<class T> bool chmax(T& a, T b){ if (a < b) { a = b; r... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int modu = 1e9 + 7;
const double eps = 1e-5;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
typedef long long LL;
char s[2][2];
LL f[1005];
int n;
int main() {
// freopen("my.txt", "w", stdout);
cin >> n;
g... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int powmod(int a, int b) {
int ret = 1;
for (; b; a = 1LL * a * a % mod, b >>= 1) {
if (b & 1) ret = 1LL * ret * a % mod;
}
return ret;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
int n; cin >> n;... |
#include <bits/stdc++.h>
using Int = long long; // clang-format off
using pii = std::pair<Int, Int>;
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define RREP_(i, a_, b_, a, b, ...) for (Int i = Int(b) - 1, low... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<double> a(N),b(N),c(N),d(N);
for(int _=0; _<2; _++){
for(int i=0; i<N; i++) cin >> a[i] >> b[i];
int x = 0, y = 0;
for(int i=0; i<N; i++){
x += a[i];
y += b[i];
a[i] ... |
#include <bits/stdc++.h>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define fast ios_base::sync_with_stdio(0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#d... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define fi first
#define sc second
#define ull unsigned long long
const int maxn=4e5+10;
const int mod=1e9+7;
char a[maxn],b[maxn];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
... |
#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<int,int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).e... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using Graph = vector<vector<int>>;
const long long INF = 1LL << 60... |
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>*/
#define ll long long
#define ld long double
#define vll vector <ll>
#define vvll vector <vll>
#define pll pair <ll, ll>
#define pld pair <ld, ld>
#define vpll vector <pll>
#define rep(i, a, b)... | #include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
const int MAXN = 110;
int N;
pair <double, double> loc[MAXN];
int edge[MAXN][MAXN];
bool works (double r)
{
for (int i = 0; i < MAXN; i++)
for (int j = 0; j < MAXN; j++)
edge[i][j] = 0;
for (int i = 0; i < N; i++)
{
... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define vi vector<ll>
#define vll vector<... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 200... |
/* All is Well */
#include <bits/stdc++.h>
using namespace std;
#define tera_baap_aaya main
#define TEZZ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);//
#define ll long long int
#define PB push_back
#define MP make_pair
const ll C=1e9+7;
////////////////////
bool checkprime(ll n)
{
for (ll ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int x, y;
vector<vector<int>> xmin(2, vector<int> {0, 1000000001});
vector<vector<int>> xmax(2, vector<int> {0, -1000000001});
vector<vector<int>> ymin(2, vector<int> {0, 1000000001});
vector<vector<int>> ymax(2, vector<int> {0... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int M, H;
cin >> M >> H;
if (H%M == 0) {
cout << "Yes";
}
else if (H%M != 0) {
cout << "No";
}
} | #include<bits/stdc++.h>
//Ctrl + B
using namespace std;
#define endl '\n'
#define nitro {std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);}
#define pi 3.141592653589793
#define mod 1000000007
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(), v.end()
#define debug(x) cout<<#x": "<<(x)<<end... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if (d>a*c||d<a*b)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vb = vector<bool>;
using vs = vector<string>;
using vvi = vector<vi>;
using vp = vector<pii>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(a) (int)((a)... |
#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 <bits/stdc++.h>
using namespace std;
typedef int int2;
#define int long long
#define pi pair<int, int>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define f first
#define s second
const int inf = 1e18;
int t;
const int maxn = 25;
int adj[maxn][maxn];
int n, m;
int color[maxn];
bool d... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
i... | // AtCoder :: Beginner Contest 182 :: D - Wandering
// https://atcoder.jp/contests/abc182/tasks/abc182_d
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<ll> A;
A.reserve(N);
copy_... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
#define ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define fun function
#define sz(x) (int)(x).size()
#define lowbit(x) (x)&(-x)
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
namespace FastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100... |
#include <bits/stdc++.h>
using namespace std;
long long int to_octal(long long int n)
{
long long int num = 0, cnt = 1;
while(n != 0) {
int r = n % 8;
num += r * cnt;
cnt = cnt * 10;
n /= 8;
}
return num;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007 // 998244353
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define all(v) v... |
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i, a, n) for (int i=(a); i<(n); i++)
#define per(i, a, n) for (int i=(a); i>(n); i--)
typedef long long ll;
const int maxn = 2e5+5;
const int mod = 998244353;
using namespace std;
ll fpow(ll base, ll exp) {
ll res = 1;
while(exp) {
if ( exp&1 )
res = (... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
constexpr int MOD = 998244353;
struct M {
int v;
M(int x = 0) {
if (x < -MOD || x >= MOD) x %= MOD;
v = (x >= 0) ? x : x + MOD;
}
explicit operator int() const { return v; }
bool oper... |
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
constexpr int N = 1e5 + 5;
constexpr LL MOD = 1e9 + 7;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int k;
string s;
cin >> s >> k;
for (char &c : s) c = isdigit(c)? (c - '0') : (c - 'A' + 10);
vector< LL> dp(17);
dp[1] = s[0] - ... | #include <bits/stdc++.h>
using namespace std;
//.define
// #define FILE_IN_OUT
#define RET(_x) cout << (_x) << '\n'; return;
#define all(_obj) (_obj).begin(), (_obj).end()
#define loop(_n) for (int i = 0; i < (_n); ++i)
#define sz(_obj) static_cast<int>((_obj).size())
#ifdef SHJ_LOCAL
#define debug(_x) std::c... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n;
cin >> n;
set<ll> st;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
st.insert(i);
st.insert(n/i);
}
}
for(auto u:st){
cout << u << endl;
}
}
| #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i, begin, end) for(int i = int(begin); i < int(end); i++)
using namespace std;
using ll = long long;
using ld = long ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T>
void chmin(T &a,T b){
if(a>b)a=b;
}
signed main(){
int n;cin>>n;
string s;cin>>s;
vector<int> v(n+1);
REP(i,n+1)cin>>v[i];
int mn=1000000;
REP(i,n)chmin(mn,abs(v[i... | #include <bits/stdc++.h>
using namespace std;
char s[200050];
char t[5]="110";
int check(int i)
{
int j;
for(j=0;s[j];j++,i++)
{
if(s[j]!=t[i%3]) return 0;
}
return 1;
}
int main(){
int64_t ans=1e10;
int n;
cin>>n;
scanf("%s",s);
int i;
for(i=0;i<3;i++)
if(ch... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, l, r) for (int i = l; i <= (int)(r); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define all(v) v.begin(), v.end()
#define MOD (... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int s=0,t=0;
while(a)
{s+=a%10;
a/=10;
}
while(b)
{t+=b%10;
b/=10;
}
cout<<max(s,t);
} |
/**
* author: Dooloper
* created: 15.05.2021 20:54:02
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repp(i,k, n) for(int i = (int)(k); i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()
using ll = long long;
using P = pair<int, int>;
struct Ed... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define F first
#define S second
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
int main(){
int n,m;... |
#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
template<class T> bool chmin(... | #include<bits/stdc++.h>
//#include <ext/pb_ds/detail/standard_policies.hpp>
#include<stdio.h>
#include<string.h>
const double pi=acos(-1.0);
using namespace std;
//using namespace __gnu_pbds;
#define endl '\n'
#define sl(n) scanf("%lld",&n)
#define mp make_pair
#define pb push_back
#define pp... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | /* C - Robot on Grid */
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using pii = pair<int, int>;
const int N = 5e3 + 10;
const int mod = 998244353;
int h, w, n, s[N][N];
char a[N][N];
int ksm(int a, int b, int p)
{
int res = 1 % p;
while (b) {
if (b & 1) res = (ll)res * a % p;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, b) for (ll i = a; i < b; ++i)
#define rep_down(i, a, b) for (ll i = a; i > b; --i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
#define vvvl... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
ll a[maxn] , b[maxn] , c[maxn] , d[maxn];
int main()
{
ios::sync_with_stdio(false);
int n; cin >> n;
for (int i = 1 ; i <= ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
double dp[101][101][101];
double f(int a, int b, int c){
if(dp[a][b][c])
return dp[a][b][c];
if(a==100||b==100||c==100)
return 0;
double ans=0;
ans += (f(a+1,b,c)+1)*a/(a+b+c);
ans += (f(a,b+1,c)+1)*b/(a+b+c);
ans += (f(a,b,c+1)+1)... | #include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(),a.end()
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forr(i,n) for(int i=int(n-1);i>=0;i--)
#define fora(i,a,b) for(int i=int(a);i<=int(b);i++)
#define forb(i,a,b) for(int i=int(a);i>=int(b);i--)
#define mod 1000000007
using namespace std;
us... |
#include <bits/stdc++.h>
const int phi10 = 4;// 1 3 7 9
int a, b, c;
int qpow(int a, int b, int p){
int res = 1;
a %= p;
while(b){
if(b & 1) res = res * a % p;
a = a * a % p, b >>= 1;
}
return res;
}
int main(){
std::scanf("%d%d%d", &a, &b, &c);
std::printf("%d\n", qpow(a, qpow(b, c, phi10) + phi10, 10));... | #include <cmath>
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,b) for(int i=a; i<b; ++i)
#define all(x) x.begin(),x.end()
const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;
void solve()
{
int a,b,c;
map<int,vector<int>> mp;
mp[2] = {6,2,4,8};
mp[... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n=0;
long long sum=0;
cin>>n;
vector <int> a(n);
vector <long long> b(401);
vector <long long> c(401);
for (int k=0;k<401;k++){
b.at(k)=k-200;
}
for (int k=0;k<401;k++){
c.at(k)=0;
}
for (int i... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
// int main(){
// int k;
// cin >> k;
// int ans = 0;
// for(int a=1;a<=k;a++){
// for(int b=a;b<=k;b++){
// for(int c=b;a*b*c<=k;c++){
// if(a==b && b==c){
// ans++;
// ... |
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 20 ;
int n , m ;
long long dp[1 << MAX] ;
vector< pair<int , int> >v[MAX] ;
long long solve(int mask)
{
if(mask == ((1 << n) - 1))
return 1 ;
long long &ret = dp[mask] ;
if(ret != -1)
return ret ;
ret = 0 ;
int idx = __builtin_popcount(mask) ;... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n)... |
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll inf = ll(1e18) + 1;
const ll mod = 1000000007;
int main() {
char win[222][222];
win['R']['R'] = win['R']['S'] = win['S']['R'] = 'R';
win... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
//const int dx[] = {-1,-1,-1, 0, 0, 1, 1... |
#include <bits/stdc++.h>
using namespace std;
const long long INF=1e19+7;
int main()
{
long long b,c; cin>>b>>c;
vector<pair<long long,long long> >a;
a.push_back(make_pair(b-c/2,b));
if(c>=1) a.push_back(make_pair(-b-(c-1)/2,-b));
if(c>=1) a.push_back(make_pair(-b,-b+(c-1)/2));
if(c>=2) a.push_back(make_pair(b,b... | #pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <algorithm>
#include <iostream>
#include <vector>
#include <array>
using namespace std;
#define f(x,y,z) for(int x=y;x<=z;++x)
vector<int> v[200001];
array<int, 200001> jr, dkt, tdk, at, uj;
int n, k, a, b, l, r, m, hit;
void jrk(int x) {
for(int &i:v[x... |
#include <bits/stdc++.h>
using namespace std;
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define K 400001
#define LL long long
#define mp make_pair
#define pb push_back
#define M 1000000007
#define pow qjwopjqp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v = {6, 10, 15, 12, 18, 20, 24, 30};
int cur = 0;
int plus = 0;
while (n--) {
cout << v[cur] + plus << " ";
cur++;
if (cur == 8) {
cur = 0;
plus += 30;
... |
#include<bits/stdc++.h>
#define REP(i,b,e) for(int i=b;i<e;i++)
int main(){
int n, m;
std::cin >> n >> m;
std::string ss[m];
REP(i, 0, m) std::cin >> ss[i];
std::string ans[n];
bool used[m] = {};
REP(si, 0, m){
int minrow = 0, crost = 50, min_add_len = ss[si].size();
REP(i, 0, n){
REP(j, 0, ans[i].siz... | #include<bits/stdc++.h>
using namespace std;
int main() {
mt19937 rng(48);
cout.tie(nullptr)->sync_with_stdio(false);
int N, M; cin >> N >> M;
array<array<bool, 20>, 20> graph{};
for (int i = 0; i < M; ++i) {
int a, b; cin >> a >> b;
--a, --b;
graph[a][b] = graph[b][a] ... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 200100
#define MOD 1000000007 //998244353
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#def... | #include <bits/stdc++.h>
using namespace std;
////////////////////////////////////////////////////////////////////////////<editor-fold desc="macros">
#define endl "\n"
#define long long long
#define all(v) (v).begin(),(v).end()
#define makeset(v) (v).resize(unique((v).begin(),(v).end())-(v).begin())
#define IOS ios::sy... |
#include <bits/stdc++.h>
/* #include <atcoder/all> */
#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)
using namespace std;
/* using namespace atcoder; */
using ll = long long;
usin... | /*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define lowbit(x) (x&-x)
#define reg register
#define mkpr make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigned long long uLL;
const LL INF=0x7f7f7f7f7f7f7f7f;
const int mo=998244353;
const int zero=500;
const LL jzm=2333;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fr first
#define sc second
int lg(ll n) {
assert(n > 0);
int ans = -1;
while (n) {
ans++;
n >>= 1;
}
r... |
#include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(), c.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, a, b) for (int i = a; i <= b; ++i)
#define rep3(i, a, b) for (int i = a; i >= b; --i)
#define endl '\n'
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define u... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y;
void exgcd(ll a,ll b,ll &x,ll &y)
{
if(!b) x=1,y=0;
else exgcd(b,a%b,y,x),y=y-(a/b)*x;
}
int main()
{
int t;
scanf("%d",&t);
while(t--){
ll n,s,k;
scanf("%lld%lld%lld",&n,&s,&k);
ll a=n-s;
ll b=__gcd(k,n);
if(a%b!=0){
printf... |
#pragma GCCoptimize("O3", "unroll-loops")
#include <cstring>
#include <iostream>
using namespace std;
using ll = long long;
const int MAXN = 102;
const int MAXC = 122505;
ll k, mod, table[MAXN][MAXC], ret[MAXN];
int n, now;
void calc() {
memset(table, 0, sizeof(table));
table[0][0] = 1;
for (int i = 1; ... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define ... |
#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;
//Arr.find_by_order(k-1):kth smallest
//Arr.order_of_key(X):no. of elements less than x
#define int long long
#define ld long double
#define dob double
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rept(i,n) for(int i=1;i<(int)(n);i++)
using intt = int64_t;
using ldou = long double;
int gcd(int a,int b){if(a%b==0){return b;}else{return gcd(b,a%b);}}
int lcm(int a,int b){return a*b/gcd(a,b);}
intt sum(const long &a,c... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define S second
#define F first
#define f(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int,int>
const int N = 105;
int n;
pair<double,doub... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <iomanip>
#include <utility>
typedef long long ll;
typedef long double ld;
using namespace std;
int x[110], y[110];
struct UnionFind{
vector<int> d... |
#pragma region おまじない
#include "bits/stdc++.h"
#pragma warning(disable : 4996)
typedef long long ll;
#define all(x) (x).begin(), (x).end() // sortなどの引数を省略
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER //デバッグ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int[2]> vec(N);
for (int i = 0; i < N; ++i) {
cin >> vec.at(i)[0] >> vec.at(i)[1];
}
bool isAns = false;
for (int i = 0; i < N - 2; ++i) {
for (int j = 1; j < N - 1; ++j) {
if (i == j) {
continue;
}
for (int... |
#include <bits/stdc++.h>
#define rep(i,n) for(LL i=0;i<n;++i)
#define repn(i,n) for(LL i=1;i<=n;++i)
#define LL long long
#define pii pair <LL,LL>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL qpow(LL x,LL a)
{
LL res=x,ret=1;
while(a>0)
... | #include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
template <typename T>
struct Matrix
{
using F = function<T(T, T)>;
int n;
int m;
vector<vector<T>> a;
const F add;
const F mul;
const T e0;
... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define re return
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define make_unique(x) sort(all(x)),x.resize(unique(all(x))-x.begin())
#define fi first
#define se second
#define ss second.second
#define sf ... | #include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <random>
#include <stack>
#include <set>
#include <list>
#include <unordered_set>
#define bug(x) cout<<"zdongdebug1: "<<x<<endl;
#define bug... |
#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 ... | #include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n) fo... |
#include<bits/stdc++.h>
#define print(x) cout << (#x) << ": " << (x) << endl
#define p1d(x) cout << (#x) << ": ["; for(auto& zz: x) cout << zz << " "; cout << "]\n"
#define p2d(x) cout << (#x) << ": \n["; for(auto& vec: x) {for(auto& v: vec) cout << v << " "; cout << ",\n";}
#define p2s(x) cout << (#x) << ": ["; for(au... | #include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long LL;
const int MAXN = 55;
const int MOD = 1E9 + 7;
LL n, x, a[MAXN], g[MAXN], dp[MAXN][2];
template <class T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (ch < '0' || ch ... | /*
ID: febrian3
TASK: test
LANG: C++
*/
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx", "avx2", "fma")
#pragma GCC optimization("unroll-loops")
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define debug(val) ... |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int mod=998244353;
int n,k,f[3010][3010];//ÌîÁ˼¸¸öÊý£¬µ±Ç°²î¶àÉÙ¸öÊý
int main()
{
scanf("%d %d",&n,&k);
//for(int i=0;i<=k;i++) f[i][k-i]=1;
f[0][k]=1;
for(int i=0;i<n;i++)
for(int j=1;j<=n;j++) if(f[i][j])
{
if(2*... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x <<": " << x << '\n';
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define pb push_back
#define sz(x) (int)(x).size()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++) // [0, b)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) /... | #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 ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
typedef tree <ll, null_type, ... |
#line 2 "header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
using namespace std;
#include <bits/stdc++.h>
// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1, _2, _3, name, ...) name
#define ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <util... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
//#define DIV 1000000007
//#define DIV 998244353
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, con... | #include <iostream>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <random>
#include <casser... |
#include <cstdio>
const int maxn = 100005;
int a[maxn];
int b[maxn];
int main(){
int n; scanf("%d", &n);
int x;
long long ret = 0ll;
for(int i = 0; i <= n; i++){a[i] = 0; b[i] = 0;}
for(int i = 0; i < n; i++){scanf("%d", &x); a[x]++;}
for(int i = 0; i < n; i++){scanf("%d", &x); b[i + 1]=x;}
... | /*{{{*/
#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... |
#include <bits/stdc++.h>
using namespace std;
template<typename T, typename Y> inline void mint(T & x,Y y) {if(y < x) exchange(x,y);}
template<typename T, typename Y> inline void maxt(T & x,Y y) {if(y > x) exchange(x,y);}
template<typename T> istream& operator>>(istream& is, vector<T> &v){for (auto& i : v) is >> i; re... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
// using namespace atcoder;
using ll = unsigned long long;
using P = pair<int, int>;
constexpr int INF = (int)2e9;
constexpr ll INFll = (ll)1e18;
constexpr int MOD = 1e9 + 7;
int main() {
int H,... |
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define F first
#define S second
#define mp make_pair
using namespace std;
const int N=1005;
int n,k,a[N][N],sum[N][N],ans=1e9;
bool check(int mid)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll INFLL = 2e18 + 5;
ll good(string x, ll n){
ll ans = 0;
for(char c: x){
if(ans > INFLL / n) return INFLL;
ans *= n;
ans += int(c - '0');
}
return ans;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t =... |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<set>
#include<cstdlib>
#include<cmath>
#include<numeric>
#include<iomanip>
#include<functional>
#include<cstdlib>
#include<queue>
#include<deque>
#include<cassert>
#include<stack>
#include <iterator> //... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<vector<int>> jyou(n+1,vector<int>(n+1,0));
for(int i=0;i<m;i++){
int a,b;
cin >> a >> b;
jyou.at(a).at(b)++;
jyou.at(b).at(a)++;
}
int k;
cin >> k;
vector<int> c(k);
vector<int> d(k);
for(int i=... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | /* -*- coding: utf-8 -*-
*
* e.cc: E - White and Black Balls
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A,B,C;
cin >> A >> B >> C;
// cout << C%2 << endl;
if (A < 0 || B < 0){
if(C%2 == 0){
if(abs(A) > abs(B)) cout << ">" << endl;
else if (abs(A) < abs(B))cout << "<" << endl;
else cout << "=" << endl;
}
el... |
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
using namespace std;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define Rrep(i,n) for(int i=((int)n-1); i>=0; i--)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define INF 2e15
#define MOD 1000000007
typedef vector<int> vint;
ty... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define lli long long int
#define double long double
#define all(x) x.begin(),x.end()
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi ... | #include <iostream>
#include <array>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functional>
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
#define pb push_back
#define bg begin
#define pob pop_back
#define sz size
#define SUM accumulate
#define SPACE " "
#define vr std::vector
#define que queue
#define dqu deque
#define stk stack
#define pqu priority_queue
#define ms... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#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
#define ll long long
#define ld long double
using namespace __gnu_pbds;
using namespace std;
template... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int a,b;
cin>>a>>b;
cout<<(double)(a-b)/a*100.0;
return 0;
} | #include<bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
long long N,M,K;
long long h,w;
long long X,Y,Z;
long long B;
const int MOD=1e9+7;
const int MAXN=5e5+5;
const int NAX=1005;
vector<int> adj[MAXN];
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
Int perform(Int... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const int MAX = 105;
int x[MAX], y[MAX];
int sq(int x) { return x * x; }
double dis(int i, int j) { return sqrt(1.0 * sq(x[i] - x[j]) + sq(y[i] - y[j])); }
int par[MAX], sz[MAX], n;
void init(int v) {
par[v] = v;
sz[v] = 1;
}
int find(int v) {
retur... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
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; retu... |
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int s1=a+b;
int s2=b+c;
int s3=c+a;
if((s1>s2)&&(s1>s3))
{
cout<<s1;
}
else if((s2>s3)&&(s2>s1))
{
cout<<s2;
}
else
{
cout<<s3;
}
return 0;
}
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int arr[3];
for(int i=0;i<3;i++){
cin>>arr[i];
}
sort(arr,arr+3);
int ans = arr[1] + arr[2];
cout<<ans;
return 0;
} |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define ppl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7;
const int N = 3005;
int add(int a, int b) {
return a + b < mod ? a + b : a + b - mod;
}
int dp[N][N];
ll ps[N], a[N];
vector<int> occ[N][N];
int n;
int f(int i, int j) {
if(i == n) return 1;
int &ans = dp[i][j];
... |
#include <bits/stdc++.h>
#define loop(n) for(ll i=0;i<n;i++)
#define loopj(n) for(ll j=0;j<n;j++)
#define loopR(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define rng(i,a,b,c) for(ll i = a; i<b;i+=c)
#define loop2(i,a,b) for(long long i = a; i>=b;i--)
#define loop3(j,a,b) for(int j = a; j<b;j++)
#define fast ios_base::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
const int N=1e5+50;
int a[N],b[N];
int main()
{
int n;scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++) scanf("%d",&b[i]);
int flag=0;
for(int i=1;i<=n;i++)
{
flag+=a[i]*b[i];
}
if(flag) puts("No");
else puts("Yes");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(2 * n);
for (auto& vi : v) cin >> vi;
priority_queue<int, vector<int>, greater<int>> pq;
long long ans = 0;
for (int i = n - 1, j = n; i >= 0; --i, ++j) {
ans += v[i] + v[j];
pq.push(v[... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#inc... |
#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>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typed... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int sum = 0;
// digit 1
int sum1 = 0;
for (int i = 0; i < K; i++) {
sum1 += i + 1;
}
// digit 3
int sum3 = 0;
for (int i = 0; i < N; i++) {
sum3 += K * (100 + i *... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
cout<<n/m<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
/* short */
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#defin... | ////JAI SHREE RAM////
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
const long long int INF = (long long)1e15;
const long long int mod = 1e9+7;
#define ll long long
#define f(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define all(c) c.begin(),c.end()
#define rall(c... |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define sz(v) (v).size()
#define all(v) (v).begin(),(v).end()
#define REP(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,a,b) fo... | /*
@uthor: Kashish Gilhotra
user: CodeChef, CodeForces, HackerEarth, HackerRank, SPOJ: kashish001
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long int
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
typedef vector<vi> vvi;
const int mod = 1e9 + 7;
#define FAST io... |
#include <bits/stdc++.h>
typedef long long int ll;
const int MOD = 1000000007;
using namespace std;
int mod_expo(ll x, ll y){
int res = 1;
while (y > 0){
if (y & 1) res = 1LL* (res*x) % MOD;
x = (x * x) % MOD; y = y >> 1;
}
return res % MOD;
}
int main(){
ll n, p; cin >> n >... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<vector<int>> mansion(N, vector<int>(K));
int count = 0;
for (int i = 1; i < N + 1; i++) {
for (int j = 1; j < K + 1; j++) {
count += 100*i + j;
}
}
cout << count << en... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll T,N;
vector<ll>a;
vector<string>ans;
void solve(){
if(N&1){
ans.push_back("Second");
}else{
bool judge=true;map<ll,ll>mp;
for(ll i=0;i<N;i++){
if(mp.count(a[i]))mp.at(a[i])++;else mp[a[i]]=1;
}for(auto p:mp)if(p.second%2==1)judg... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int a[N];
int n, m;
int main(){
int t;
cin>>t;
whil... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
int main(){
ll N; cin >> N;
ll A = 1e6;
ll tmp = 0;
rep(i,1,A){
tmp += i;
if(tmp >= N){
cout << i << endl;
break;
}... | // code by lynmisakura.wish to be accepted!
#include<bits/stdc++.h>
using namespace std;
#define REP(i,N) for(int i = 0;i < N;i++)
using ll = long long;
using db = long double;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define lb(x,k) lower_bound(all(x),k)
#define ub(x,k) upper_bou... |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
int state[200005];/// 1 means change in control
vector <int> graph[200005];
bool visited[200005];
int ch[100005];
void dfs1(int n){
visited[n] = 1;
int v = 1;
ch[n] = 1;
for(int i = 0;i<graph[n].size();i++){
if(visited[grap... | //#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
#include <array>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 998244353
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_b... |
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define swap(a,b) (a^=b^=a^=b)
#define ll long long int
#define ull unsigned long long int
#define uint unsigned int
#define format(a) memset(a,0,sizeof(a))
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define dec(x,y,z) for(int x=y;x>=z;x--)
#define mst(x... |
#include <string>
#include <algorithm>
#include <iostream>
int main()
{
std::string t = "ZONe";
std::string s;
std::cin >> s;
int letter_count = s.size();
int count = 0;
for(int i = 0; i < letter_count-1; i++)
{
if(std::equal(std::begin(t), std::end(t), std::begin(s)+i)){
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef long long ll;
const ll MOD = 1000000007;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define coutALL(x) for(auto i=x.begin();i!=--x.end();i++) cout<<*i<<" ";cout<<*--x.end()<<endl;
#define coutVEC2(x) rep(... | // This code wrote by chtholly_micromaker(MicroMaker)
#include <bits/stdc++.h>
#define reg register
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define mem(x,y) memset(x,y,sizeof x)
#define sz(x) (int)(x).size()
#define ln puts("")
#define lsp putchar(32)
#define pb push_back
#define MP make_pair
#define... |
//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const double eps = 1e-7;
const ll LINF = ll(1e18);... | #include <iostream>
#include <string>
#include <cmath>
#define rep(i, n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n, sum=0;
cin >> n;
double x[n], y[n];
double a;
rep(i, n){
cin >> x[i] >> y[i];
}
rep(i, n){
rep(j, i){
a = (y[j]-y[i])/(x[j]-x[i]... |
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
#include <array>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
vector<vector<char> > winner;
vector<int> powk2modn;
char solve... |
#include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(),(l).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using namespace std;
//const ll mod = 998244353;
//const ll maxn = 1000000000;
//const ll mod = 1000000007;
//-----------------... | #include<bits/stdc++.h>
using namespace std;
long n,i,j;
set<long>s;
int main(){
cin>>n;
for(i=2;i*i<=n;i++){
for(j=i*i;j<=n;j*=i)s.insert(j);
}
cout<<n-s.size()<<"\n";
}
|
#include <bits/stdc++.h>
using namespace std;
using gg = long long;
// MAX
// constexpr gg MAX = 25;
constexpr gg MAX = 1e6 + 5;
constexpr gg mod = 998244353;
constexpr gg INF = 2e18;
constexpr double thre = 1e-7;
gg ti, ni, mi, ki, di, pi, xi, yi;
//返回a^b%m
gg powMod(gg a, gg b, gg m) {
if (m == 1) {
retur... | #include <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define per(i,n) for(ll (i)=(n)-1;(i)>=0;--(i))
#define inf 9223372036854775807
#ifdef LOCAL
#de... |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
ll n;
cin>>n;
set<ll> s;
for(ll i=2; i*i<=n; i++){
ll x=i*i;
while(x<=n){
s.insert(x);
x*=i;
}
}
cout<<n-s.size()<<endl;
} | #include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b... |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> p(n + 1), pos(n + 1), ans;
set<int> s;
for (int i = 1; i <= n; ++i) {
cin >> p.at(i), pos.at(p.at(i)) = i;
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 2e5+5;
int n, a[sz], w[sz], bit[sz];
void add(int x) {
while(x <= n) {
bit[x]++;
x += x & (-x);
}
}
int quer(int x) {
int ans = 0;
while(x) {
ans += bit[x];
x -= x & (-x);
}
return ans;
}
int... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string n;
cin >> n;
long long sum = 0;
for(long long i=0;i<n.length();++i){
sum += n[i] - '0';
}
if(sum%3 == 0){
cout << 0 << endl;
return 0;
}
if(n.length() == 1){
cout << -1 << endl;
return 0;
}
for(long long i=0;i... | #include<iostream>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
int ceil2... |
#include <bits/stdc++.h>
#define ms(a,b) memset(a, b, sizeof(a))
#define rep(a,b,c) for(int a = (int)(b); a < (int)(c); a++)
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define m_p(a,b) make_pair(a, b)
#define lson l,mid,o << 1
#define rson mid + 1,r,o << 1 | 1
#define ls o << 1
#defi... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool ch... |
#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define INF 1e18
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
// typedef tree<pair<int, int>, null_type, less<pai... | #include<map>
#include<set>
#include<list>
#include<ctime>
#include<cmath>
#include<deque>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<iostream>
#include<algorithm>
#define rep(i,s,t) for(register int ... |
#include <bits/stdc++.h>
#define all(i) (i).begin(), (i).end()
#define debug(x) cerr << "Line(" << __LINE__ << ") -> " << #x << " is " << x << endl
using namespace std;
template<typename T1, typename T2>
ostream& operator << (ostream &i, pair<T1, T2> j) {
return i << j.first << ' ' << j.second;
}
template<typename ... | #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;
const int N=4e5+7;
typedef long long LL;
int a[N],id[N];
bool cmp(int x,int y){
return a[x]>a[y];
}
bool vis[N];
priority_queue<int> Q;
int n;
int tr(int i){
return i<=n?n-i+1:i-n;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=2*n;i++)scanf("%d",&a[i]),id[i]=i;
int tot=... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++... |
#include<bits/stdc++.h>
using namespace std;
#define ll int
#define inf 1e9
vector<pair<ll,ll> >ad[30];
bool cnt[30];
ll cost[2009][2009];
queue<pair<ll,ll> >q;
char vec[2009][2009];
bool vis[2009][2009];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a,b,c,d,e,i,j,k,l,n,m,x,y,t,... | //#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 bit(n) (1LL<<(n))
#define FI... |
#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... | #include<stdio.h>
#include<math.h>
#include<string.h>
#define ni(n) ((n) * (n))
#define rep(i,n) for(i=0;i<n;i++)
#define N 100
int main(void){
int n;
int i,ans = 0;
rep(i,3){
scanf("%d",&n);
ans += (7 - n);
}
printf("%d",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cout << setprecision(10) << fixed;
long long n, m;
cin >> n >> m;
vector<long long> a(n);
vector<vector<long long>> g(n);
for (long long i = 0; i < n; ++i)
cin >> a[i];
for (long long i = 0; i < m; ++i)
{
l... | #include <bits/stdc++.h>
using namespace std;
#define forn(i,m,n) for(int i=m;i<n;i++)
#define vv vector
#define vi vv<int>
#define ii pair<int,int>
#define vii vv<ii>
#define mp make_pair
#define pb push_back
#define PI 3.141592653589
#define ll long long
#define pll pair<ll,ll>
#define vl vv<ll>
#define ff first
#de... |
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define PQ priority_queue
#define lb lower_bound
#def... | #include <bits/stdc++.h>
#define int long long
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define w(x) int x; cin>>x; while(x--)
#define fr(i,a,b) for(int i = a; (int)i < b; i++)
#define frr(i,a,b) for(int i = a; (int)i >= b; i--)
#define FIO ios_base::sync_with_stdio... |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
//mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 mrand(42);
#define ii for(int i=1;i<=n;++i)
#define ji for(int j=1;j<=n;++j)
#define jj for(int j=1;j<=m;++j)
#define ij for(int i=1;i<=m;++i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define vec2(name,i,j,k) vector<vector<ll>> name(i,vect... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
ll ans = 0;
void dfs(ll p, vector<vector<ll>> &v, vector<bool> &visited)
{
for (ll i : v[p])
{
if (!visited[i])
{
// cout << "( " << p << " , " << i << " ) ";
... | #include <bits/stdc++.h>
#define rep(i,l,r) for(int i = (l); i <= (r); ++i)
#define per(i,r,l) for(int i = (r); i >= (l); --i)
using namespace std;
typedef long long ll;
inline int gi() {
int f = 1, x = 0; char ch = getchar();
while (ch < '0' || ch > '9') {if (ch == '-') f = -f;ch = getchar();}
while (ch >= '0' && c... |
#include <bits/stdc++.h>
using namespace std;
// #define LOCAL // 提出時はコメントアウト
#define DEBUG_
typedef long long ll;
const double EPS = 1e-9;
const ll INF = ((1LL<<62)-(1LL<<31));
typedef vector<ll> vecl;
typedef pair<ll, ll> pairl;
template<typename T> using uset = unordered_set<T>;
template<typename T, typename U> usi... | #include "bits/stdc++.h"
using namespace std;
using LLI = long long;
#define INF 999999999
#define MOD 1000000007
#define FOR(i, s, e) for(LLI i = s, i##_lim = (e); i < i##_lim; i++)
#define FORR(i, s, e) for(LLI i = s-1, i##_lim = (e); i##_lim<=i; i--)
#define REP(i, n) FOR(i,0,n)
#define REPR(i, n) FORR(i,n,0)
#defin... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
#define pll pair<ll,ll>
#define pii pair<int ,int>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pair<int, int>>
#define mems(x,y) memset(x,y,sizeof(x))
#define all(x) (x).begin(),(x).end()
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+100;
int dp[N][7], a[N], n;
string s, t;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> s >> t;
s = "@" + s;
t = "@" + t + "T";
int p = 1;
for(int i = n; i >= 1; --i) {
a[i] = p * (s[i] - '0') % 7;
p = p * 10 %... |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <climits>
#include <bitset>
#include <cassert>
#include <time.h>
#include <numer... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... |
//コンパイラ最適化用
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
//インクルード(アルファベット順)
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<chrono>//実行時間計測
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点... | #include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#define ll long long
#define ull unsigned long long
#define pll pair<long long,long long>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define forn(i, n) for(int i=0; i<int(n); i++)
#define Forn(i, n) for(int... |
#include <bits/stdc++.h>
#define INF 1000000007
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef long double ld;
typedef vector<int> vi;
typedef unordered_map<int,i... | #include<bits/stdc++.h>
using ll = int_fast64_t;
#define REP(i,b,e) for(ll i=b; i<e; i++)
int main(){
ll n, k;
scanf("%ld %ld", &n, &k);
ll ans = 0;
REP(i, 2, 2*n+1){
if(i-k < 2) continue;
ll j = i-k;
if(i > 2*n || j > 2*n) continue;
ll tmp = 1;
if(i < n+2) tmp *= i-1;
else tmp *= i - 1 - 2*(i-n-1);
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.