code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
vector<vector<int>> graph;
vector<vector<bool>> isReach;
int n,m;
void init() {
for (int i = 0; i < n; ++i)
{
isReach[i][i] = true;
queue<int> nxt;
nxt.push(i);
vector<bool> seen(n, false);
while (!nxt.empt... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int n, k;
cin >> n >> k;
vvec<int> t(n, vec<i... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<ll, ll>;
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b; cin >> a >> b;
if(b>a)
{
int sum=0;
int val=-1;
for(int i=0;i<b;i++)
{
cout << val << " ";
sum += val;
val -= 1;
}
int val2=1;
for(int i=0;i<a-1;i++)
{
cout << val2 << " ... |
#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1.1e5;
int n,m,ta,tb;
struct qj{
int l,r;
}a[N],b[N];
int main()
{
cin>>n>>m;int la=0;
for(int i=1,x;i<=n;i++){
scanf("%d",&x);if(la+1<=x-1)a[++ta]=(qj){la+1,x-1};la=x;}
int x=m;if(la+1<=x)a[++ta]=(qj){la+1,x};la=0;
for(int i=1,x;i<=n;i... |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main() {
string s; cin >> s;
int cnt = 0;
for (int i = 0; i < s.size(); ++i) {
string str = s.substr(i, 4);
if (str == "ZONe") cnt ++;
}
cout << cnt << endl;
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define p... |
#include<iostream>
#include<string>
using namespace std;
typedef long long ll;
int main() {
ll n,x;
ll a[100001];
ll b = 0,c=0;
cin >> n>>x;
for (ll i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == x) {
b += 1;
}
else {
c = i;
}
}
if (b == n) {
cout << " " << endl;
}else {
for (ll i = 0; i < ... | /**
* @author: adityasonani
* */
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#define ll long long
#define ld long double
#define ln "\n"
#define fastio ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define MOD ... |
# include <bits/stdc++.h>
using namespace std;
# define rep(i,a,n) for (int i=a; i<=n; ++i)
# define per(i,a,n) for (int i=a; i>=n; --i)
# define bug puts("H");
# define pb push_back
# define mp make_pair
# define all(x) (x).begin(), (x).end()
# define SZ(x) (int)x.size()
# define fi first
# define se second
# define l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
#define fst first
#define snd second
const int N = 1e5 + 5;
int a[N], b[N];
//ll dp[N][2][2];
//const ll INF = 1e18;
VI diff[2];
int main() {
#ifdef LOCAL_EXEC
// freopen("sample.in", "r", stdin);... |
#include<stdio.h>
#include<bits/stdc++.h>
#define ll long long int
#define inf 1000000000000
#define mod 998244353
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define scan(a) scanf("%d",&a)
#define scanl(a) scanf("%lld",&a)
#define print(a) printf("%d\n",a)
#define printl(a) printf("%lld\n",a)
#... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
struct __INIT{__INIT(){cin.tie(0);ios::sy... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<complex>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#d... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <string.h>
#include <assert.h>
#include <iomanip>
#include <bits... |
#pragma GCC optimize("O3")
#include <stdio.h>
#include <bits/stdc++.h>
int main()
{
int i, N, A[2][131072];
scanf("%d", &N);
for (i = 1; i <= N; i++) scanf("%d", &(A[0][i]));
for (i = 1; i <= N; i++) scanf("%d", &(A[1][i]));
int j, k, l, r;
const long long inf = -(1LL << 60);
long long dp[2][131072];
for (i ... | #include<bits/stdc++.h>
typedef long long ll;
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define all(x) (x).begin(),(x).end()
template<class T>void cxk(T&a,T b){a=a>b?a:b;}
template<class T>void cnk(T&a,T b){a=a... |
#include<iostream>
#include<algorithm>
#include<map>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<vector>
#include<set>
#define ll long long
#define pb push_back
#define forn(i,x,n) for(int i=x;i<=n;++i)
#define forr(i,x,n) for(int i=n;i>=x;--i)
#define lson (rt<< 1)
#define rson (rt<< 1 ... | #include<bits/stdc++.h>
#define f first
#define s second
#define int long long
using namespace std;
const int N=3e3+5,mod=1e9+7;
int t,a[N],pref[N],dp[N][N],n;
vector<int>c[N];
main(){
cin>>n;
for(int i=1;i<=n;i++){
cin >> a[i];
pref[i] = pref[i-1] + a[i] ;
}
dp[0][0] = 1;
int ans = 0;
for(int i=1;i<=n;i++) ... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define P pair<int,int>
#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
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define x first
#define y second
using namespace std;
int n,m,a[1001],b[1001],dp[1001][1001];
int main(){
cin>>n>>m;
for(int k=1;k<=n;k++){
cin>>a[k];
dp[k][0]=k;
}
for(int k=1;k<=m;k++){
cin>>b[k];
dp[0][k]=k;
}
if(a[1]!=b[1])
... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <set>
#include <unordered_map>
#include <cstring>
#include <string>
#include <queue>
#include <stack>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
#define int long long
#pragma GCC opt... | #include <bits/stdc++.h>
using namespace std;
#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 lg long long
#define vi vector<int>
template <class T> ostream& operator<<(ostream& os, vector<T>& x) {
os << '[';
bool first = true;
for (T& i : x) {
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n); ++i)
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; }
typedef long long ll;
const int mod... | // Created by ...
#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 vll vector< ll >
#define M 100000
#define MD 1000000007
#define pb push_back
#define rep(i,a,b) ... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define amax(a, b) a = std::max(a, b)
#define amin(a, b) a = std::min(a, b)
using ll = long long;
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... |
/*
{
######################
# Author #
# Gary #
# 2021 #
######################
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#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;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef tre... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N;
string S;
int A[110];
int ret[10010][110];
signed main()
{
cin >> N >> S;
rep(i, N + 1)cin >> A[i];
int ans = 1e10;
rep(i, N)ans = min(ans, abs(A[i] - A[i + 1]));
rep(i, N + 1)
{
... | #include <bits/stdc++.h>
using namespace std;
using int128 = __int128_t;
using int64 = long long;
using int32 = int;
using uint128 = __uint128_t;
using uint64 = unsigned long long;
using uint32 = unsigned int;
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_q... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
#define LOCAL 1;
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define dbg(x) true
#endif
template<typename T>
ostream... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5;
const int mod = 998244353;
int32_t main()
{
double a, b;
cin >> a >> b;
cout << (a * b) / 100;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i=0; i<(n); ++i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int) 2e5 + 7;
const int A = 18;
const int M = (int) 1e9 + 7;
int add(int a, int b) {
a += b;
if (a >= M) return a - M;
if (a < 0) return a + M;
return a;
}
int mul(int a, int b) {
return a * (ll) b ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define INF 2147483647
#define INFLL 1000000000000000000
#define MOD 998244353
#define MOD2 1000000007
#define PI 3.14159... | #include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
*/
typedef long long ll;
typedef long double ld;
typedef un... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,t;
cin >> n >> m;
vector<char> str;
for(int i=0; i<m; i++) {
string s;
cin >> s;
if(i == 0) t = s.size();
for(int j=0; j<s.size(); j++) str.push_back(s.at(j));
}
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define rng(i,l,r) for (int i=l; i<r; i++)
#define V(t) vector<t>
#define VV(t) V(vector<t>)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1 << 30;
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b; return t... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
//#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> s(n+1);
s.at(1) = 1;
cout << 1 << " ";
for(int i = 2; i <= n; ++i){
for(int j = i/2; j >= 1;--j){
if(i % j == 0){
int k = s[j] + 1;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<complex<double>> st(N), en(N);
for(int i = 0; i < N; i++) {
int a, b; cin >> a >> b;
st[i] = {a * 1.0 , b * 1.0};
}
set<pair<double, double>> in;
for(int i = 0; i < N; i++) {
int c, d; cin... | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf LLONG_MAX
#define int long long
#define mod 998244353
#define pi M_PI
struct _xy{
doubl... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0;i < (int)n;i++)
int main(){
double x, y, z;cin >> x >> y >> z;
double pur = z/x;
double n = pur * y;
if(n == (int)n) cout << n-1 << endl;
else cout << (int)n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int x, y, z;
cin >> x >> y >> z;
for (int i = 0; ; ++i)
if (i * x >= y * z)
return cout << i - 1, 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define int long long
#define ld long double
using namespace __gnu_pbds;
using namespace std;
template<class T> using oset = tree<T, null... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define ll long long
#define ld long double
#define sz(x) (ll)x.size()
#... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
#define Swap(a,b) (a+=b,b=a-b,a-=b)
static inline long Max(long a,long b){return a>b?a:b;}
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),... | #include <bits/stdc++.h>
#define debug(x) cout << ##x << ":\t" << (x) << endl;
using namespace std;
#define ll long long
const int N = 2e6 + 10;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const ll mod = 998244353;
int n;
ll a[N], b[N];
ll ans;
priority_queue<ll>q[2];
int main() {
scanf("%d", &n);
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
int res = 1;
for (int i = 1; i <= b; ++i) {
if (b / i - (a - 1) / i >= 2)
res = i;
}
cout << res << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)//iをaからn
#define per(i,n,a) for (int i=a-1;i>=n;i--)//iをnからa
#define db(x) cout << #x << " = " << x << endl//デバッグ用
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#define all(x) (x).beg... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<ll, ll>;
const ll INF = 4e18;
const ll mod = 1e9 + 7;
#define all(a) (a).begin(), (a).end()
// Print for debug
template<class T> ostream& operator<<(ostream &out, vector<T> const &v) { out << "["; for(int i = 0; i < v.size();... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N, T;
cin >> N >> T;
vector<ll> num(N);
... |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[311111];
ll sum[311111];
int main(){
int n;
while(scanf("%d",&n)!=EOF){
double ans = 0;
for(int i = 1 ; i <= n ; i++){
ans += (1.0/i)*n;
}
printf("%.6f\n",ans-1);
}
return 0;
} |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#... | #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;
constexpr ll mod=1e9+7;
vector<int> st[200010];
vector<int> que[200010];
struct UnionFind{
vector<int> par,num;
UnionFind(int n):par(n),num(n,1){
iota... |
/*input
10 165
82 94 21 65 28 22 61 80 81 79
93 35 59 85 96 1 78 72 43 5
12 15 97 49 69 53 18 73 6 58
60 14 23 19 44 99 64 17 29 67
24 39 56 92 88 7 48 75 36 91
74 16 26 10 40 63 45 76 86 3
9 66 42 84 38 51 25 2 33 41
87 54 57 62 47 31 68 11 83 8
46 27 55 70 52 98 20 77 89 34
32 71 30 50 90 4 37 95 13 100
*/
#include<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define t3 1000+10
#define t4 10000+10
#define t5 100000+10
#define t6 1000000+10
#define MOD 1000000007
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) for (ll i=n-1;i>=a;i--)
#define pb push_back
const double pi = acos(-1.0);
namespace X... |
#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>
using namespace std;
#ifndef ONLINE_JUDGE
#define DEBUG
//#define STRESS
#endif // ONLINE_JUDGE
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
os << "[";
for (int i = 0; i < v.size(); ++i)
{
os << v[i];
if (i != v.size() - 1)
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll mod = 1000000007;
const double pi = 3.14159265358979;
const ll INF = 1e18;
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i+... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define deb(x)cout << #x << " = " << x << " , " << '\n';
#define mod 100000000
int main(){
ll s, ans = 0;
cin >> s;
s *= 2;
for(ll i=1; i*i<=s; i++){
if(s%i==0){
ll tmp = (s/i) - (i-1);
if(tmp%2==0)ans++;
if(i!=(s/i)){
ll tmp = (s/... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
scanf("%d%d", &x, &y);
if (x > y) swap(x, y);
printf(x + 3 > y ? "Yes" : "No");
return 0;
} | #include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <unordered_set>
#include <queue>
#include <bits/stdc++.h>
#include <unordered_map>
#define fast_io \
ios::sync_with_st... |
/* Author: Tarun Kumar
E-mail: tarunkumar281200@gmail.com
" A code is like love,
it has created with clear intentions at the beginning,
but it can get complicated:) "
*/#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long... | #include <iostream>
#include <algorithm>
using namespace std;
inline bool cmp(pair<int, int> x, pair<int, int> y)
{
int up = x.second - y.second;
int dw = x.first - y.first;
if(dw < 0) dw = -dw, up = -up;
return up <= dw && up >= -dw;
}
const int maxn = 1111;
pair<int, int> arr[maxn];
int main()
{
... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define fz(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define foreach(it,v) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define all(a) a.begin(),a.end()
#define fill0(a) mems... | #include<bits/stdc++.h>
#define int long long
#define ri register signed
#define rd(x) x=read()
using namespace std;
const int N=1e7+5;
const int M=1e6+5;
const int maxn=5e6+5;
const int mod=998244353;
const int inf=0x3f3f3f3f3f3f3f3f;
inline int read(){int x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=... |
//
// Created by yamunaku on 2021/04/17.
//
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) f... | #include<bits/stdc++.h>
#define pb emplace_back
#define pf first
#define ps second
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define Endl '\n'
#define codejam cout<<"Case #"<<t<<": ";
#define pl pair<ll,ll>
#define mod 1000000007
#define INF 1000000001
#define forn(i,n) for(ll i=0;i<n;i++)
#d... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N = 17;
ll n;
ll a[1 << N];
int main()
{
scanf("%lld", &n);
vector<pair<ll, ll>>v;
for (ll i = 1 ; i <= (1 << n) ; i++)
{
scanf("%lld", &a[i]);
v.push_back({a[i], i});
}
while (v.size() > 2)
{
vector<pair<ll, ll>>test;
for (ll i =... | #include<bits/stdc++.h>
#define w(x) int x; cin>>x; for(int tc=1;tc<=x;tc++)
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define pb push_back
#define pqg priority_queue<int>
#define pqs priority_queue<in... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
//typedef long long ll;
const int M_ans = 0x3f3f3f3f;
const int M = 2e5 + 10;
int h[M], w[M], qsm[M], hsm[M];
int main()
{
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int ... | #include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef pair<int,int> pii;
typedef pair<long long int,long long int> plli;
typedef vector< vi > vvi ;
typedef vector< vlli > vvlli ;
... |
/**
* @created : April 11, 2021
* @handle : 🇨🇴 @SorKierkegaard
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define finally(value) {cout << (value) << '\n'; return 0;}
#define forn(i, b) for(int i = 0; i < (int) b; ++i)
#define rep(i, a, b) for(int i = int(a); i < (int) b; ++i)
#d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define all(A) A.begin(), A.end()
#define sz(A) (int)A.size()
typedef vector <int> vi;
typedef vector <ll> vl;
typedef pair <int, int> pii;
typedef t... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1<<30;
const long long LINF = 1LL<<60;
const long long MOD = (long long)1e9 + 7;
int main(){
int n, ans = INF;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
fo... | #include<bits/stdc++.h>
#define lli long long int
#define sz 10000010
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define in(x) scanf("%lld",&x)
#define ins(x) scanf("%s",x)
#define out(x) printf("%lld",x)
#define outs(x) printf("%s",x)
#define loop(x) for(lli i=0;i<x;i++)
#d... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >> s[i];
int result = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i][j] == '#') continue;
if (j < w - 1) {
if (s[i][j + 1] == '.') resul... | /*
© 2020-10-10 06:54:50 Franco1010 All Rights Reserved
*/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define in inline
namespace fast_io
{
char buf[1<<12],*p1=buf,*p2=buf,sr[1<<23],z[23],nc;int C=-1,Z=0,Bi=0,ny;
in char gc() {return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<12,stdin),p1==p2)?EOF:*p1++;}
in int read()
{
int x=0;ny=1;whi... | #include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <sstream>
#include <ostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <iomanip>
#include <set>
#include <bitset>
#include<unordered_map>
#define... |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define ok() put... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define ... |
#include<bits/stdc++.h>
using namespace std ;
int main()
{
string str ;
cin>>str ;
bool f = 1 ;
for(int i = 0 ; i < str.size() ; i++)
if(str[i] != str[str.size()-i-1])
f = 0 ;
if(f)
cout<<"Yes"<<endl ;
else
{
int j = str.size()-1 , i = 0 ;
while( j >= 0 && str[j] == '0' && str[str.size()-j-1] != 0)
j-- ... | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
if (n % 2) cout << "Black" << endl;
else
cout << "White" << endl;
} |
#include<bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define VAL 100000
#define ll long long
#define INF 0x3f3f3f3f
#define pll pair<long long , long long>
const int MAX=5e6+9;
const ll mod=1e9+7;
const int TOT_PRIMES=19;
const int MAX_A=70;
using namespace std;
vector<pair<int , int > >adj... | #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 = long long;
using P = pair<int, int>;
constexpr int INF = (int)2e9;
constexpr ll INFll = (ll)1e18;
constexpr int MOD = 1e9 + 7;
struct edge {
int to, cost;
... |
#include <cstdio>
#include <algorithm>
using namespace std;
long long a[200005],t[200005];
pair<long long,int> x[200005];
long long treemax[800005],treemin[800005],lazy[800005],sum,ans[200005];
bool flazy[800005];
int p;
void build(int p,int l,int r)
{
if(l==r)
{
treemax[p]=treemin[p]=x[l].first;
... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void debug(vector<T> item) {
for (auto i : item) {
cout << i << " ";
}
cout << endl;
}
int main() {
int N;
cin >> N;
int64_t mn = -(int64_t)1e9;
int64_t mx = 1e9;
int64_t sum = 0;
for (int i = 0; i < N; ++i) {
int64_t a, b;
cin >>... |
#include <iostream>
using namespace std;
int n, max_ = 1000, min_ = 1;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
int temp;
for(int i = 0;i < n;++i)
{
cin >> temp;
min_ = max(temp, min_);
}
for(int i = 0;i < n;++i)
{
... | #include <stdio.h>
long long int x[200010];
long long int sum[200010],sum2[200010],max[200010];
int main()
{
int a;
scanf("%d",&a);
for(int i=1;i<=a;i++) scanf("%lld",&x[i]);
for(int i=1;i<=a;i++) sum[i] = sum[i-1] + x[i];
for(int i=1;i<=a;i++) sum2[i] = sum2[i-1] + sum[i];
max[1] = x[1];
for(int i=1;i<=a;i++... |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, a, b, q, c[200007], buf, p[200007];
vector<pair<ll, ll>> e;
vector<pair<ll, bool>> op[200007];
vector<ll> adj[200007];
void find_parent(ll x, ll par) {
p[x] = par;
for(ll i : adj[x]) {
if(i != par) {
find_parent(... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = (ll)1000000007;
vector<ll> nums;
int occ[26];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t, m, n;
ll k, ans = 0;
string s1, s2;
bool sad = false;
cin >> s1;
for(int i = s1.size()-1; i >= 0; i--... | #include <bits/stdc++.h>
#include <cassert>
#include <functional>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) begin(c), e... |
#include <bits/stdc++.h>
using namespace std;
void setIO(string s) {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen((s + ".in").c_str(), "r", stdin);
// freopen((s + ".out").c_str(), "w", stdout);
}
int descending(string a)
{
int arr[a.length()];
for (int i = 0; i < a.length(); i++)
{
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int ak(int num){
string n = to_string(num);
sort(n.begin(), n.end());
int g2 = stoi(n);
reverse(n.begin(), n.end());
int g1 = stoi(n);
return g1- g2;
}
int main(){
int n; cin >> n;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> V;
#define F(N,S,E) for(int N=(int)(S);N<=(int)(E);N++)
#define R(N,S,E) for(int N=(int)(S);N>=(int)(E);N--)
#define D(N,E) for(int N=0;N<(int)(E);N++)
LL read(){LL x;scanf("%lld",&x);return x;}
const int N=2.1e5;
int a[N],b[N];
int... | // Good Bye rng_58
/**
* author: otera
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60;
#define rep(i, n) for(int i = 0; i < n; ++ i)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for... |
#include <bits/stdc++.h>
using namespace std;
long long power(int y) {
int i; long long power=1;
if(y == 0)
return 1;
for(i=1;i<=y;i++)
power=power*2;
return power;
}
int main() {
int n;
cin >> n;
string s[n];
for(int i = 0; i < n; i++) cin >> s[i];
long long x = 1;
for(int i = 0; i < n; i++){
... | #include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long> dp(2,1);
for(int i = 0; i < n;++i){
string s;
cin >> s;
vector <long long > p(2,0);
swap (dp,p);
for(int j = 0; j < 2;++j){
for(... |
#include <iostream>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
char** s = (char**)calloc(h, sizeof(char*));
for(int i = 0; i < h; i++){
s[i] = (char*)calloc(w+1, sizeof(char));
cin >> s[i];
}
//→と↓だけ見る
int count = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] == ... | #include<bits/stdc++.h>
#define ll long long
#define all(v) v.begin(),v.end()
#define rall(v) v.begin(),v.end()
#define sz(x) (int)sz.size()
#define PB push_back
#define PI 3.1415926535897932384626433832795
#define what(x) cout<<#x<<" is "<<x<<endl;
using namespace std;
#ifdef LOCAL//ONLINE_JUDGE
#include "D:\c_c++\te... |
// Code Written by Pinaki Bhattacharjee (pinakipb2)
#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;
// typedef
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long l... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin>>a>>b;
if(a+b>=15 && b>=8){
cout<<1;
}else if(a+b>=10 && b>=3){
cout<<2;
}else if(a+b>=3){
cout<<3;
}else{
cout<<4;
}
}
| #include <bits/stdc++.h>
// #include "atcoder/all"
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF = (ll)1e1... |
#include <bits/stdc++.h>
using namespace std;
typedef int8_t i8;
typedef int16_t i16;
typedef int32_t i32;
typedef int64_t i64;
typedef ptrdiff_t isize;
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef size_t usize;
typedef float f32;
typedef double f64;
#define unorder... | // 問題の URL を書いておく
//
#include <bits/stdc++.h>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: "... |
#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... | #include <bits/stdc++.h>
signed main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int v, tstart, tfinish, d;
std::cin >> v >> tstart >> tfinish >> d;
if (v * tstart <= d and d <= v * tfinish) {
printf("No\n");
}
else {
printf("Yes\n");
}
retur... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=400005;
const int logn=21;
const int inf=1ll<<60;
struct Edge {
int to,next;
Edge(int to=0,int next=0):to(to),next(next) {}
};
Edge a[maxn*2];
int cnt;
int top;
int Max;
int root;
int s[maxn];
int h[maxn];
int t[maxn];
int ss[maxn];
... | #include<algorithm>
#include<cstdio>
#define MaxN 400500
using namespace std;
int f[MaxN],o[MaxN],c[MaxN];
int find(int u)
{return f[u]==u ? u : f[u]=find(f[u]);}
void merge(int u,int v){
u=find(u);v=find(v);
if (u!=v){
o[f[u]=v]+=o[u];
c[v]+=c[u];
}o[v]++;
}
bool vis[MaxN];
int n;
int main()
{
scanf("%... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
typedef long long ll;
typedef pair<ll,ll> P;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vec... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define V vector
template <typename T> bool chmin(T &a, con... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
#define all(a) a.begin(),a.end()
#define pb push_back
#define pf push_front
#define popb pop_back
... | #include "bits/stdc++.h"
#include <chrono>
#include <random>
#define lli long long int
using namespace std;
#define mod 1000000007
#define MOD 1000000037
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define INF 1000000000
#define common cout << "Case #" << w+1 <<... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n, k;
cin >> n >> k;
while(k--)
{
if(n%200)
n = n*1000+200;
else
n /= 200;
}
cout << n;
return 0;
} | #include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <ctime>
#include <chrono>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <unorder... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define vi vector<int>
#define vii vector<vector<int>>
#define ll long long int
void testcase(){
double a,b,c,d;
cin>>a>>b>>c>>d;
cout << setprecision(12) << (a * d + c * ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define get(a) ll a ; cin >> a ;
#define show(a) cout << a << endl;
int main()
{
ios_base::sync_with_stdio(false);
cout << std::setprecision(12);
cin.tie(NULL);
get(sx);
get(sy);
get(gx);
get(gy);
double answer = double( sy*gx + sx*g... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define rep(i, n) for (int i... | #include <iostream>
using namespace std;
template <class T> T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
int main()
{
long long N;
cin >> N;
long long div = 1;
for (long long i = 2; i <= N; i++) {
div = lcm(i, div);
}
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define cm (1 << 17)
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
ret... | #include <bits/stdc++.h>
#define fo(i,a,b) for(int i=(a);i<=(b);++i)
#define __unique(V) (V).resize(unique((V).begin(),(V).end())-(V).begin())
#define cntbit(X) __builtin_popcount((X))
#define bit(S,i) (((S)>>(i - 1))&1)
#define PI acos(-1)
#define fi first
#define se second
#define LL long long
#define ii pai... |
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MAX 1000050
#define ll long long
#define ld long double
#define lli long long int
#define pb push_back
#define INF 100000000000000
#define mod 1000000007
// trignometric fun... | /* Nikkz99 */
#include <bits/stdc++.h>
#define ll long long
#define s string
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//string w,a; getline(cin,a);
// stringstream S(a);
//set<s> d;
//map<s,ll> F;
// while(S>>w) { }
ll A[102];
for(auto i=0;i<3... |
#include<bits/stdc++.h>
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define pii pair<int,int>
#define fi first
#define se second
#define PB push_back
#define ll long long
#define ull unsigned long long
#define y1 orzkcz
using namespace std;
const int N... | //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 <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
ll I=167167167167167167;
ll Q=1e9+7;
int main(){
ll N,X;
cin>>N>>X;
vector<ll> p(N);
vector<ll> high(N);
vector<ll> low(N);
for(int i=0;i<N;i++){
cin>>p[i];
high[i]=((X-1)/p[i]+1)*p[i];
low[i]=(X/p[i])*p[i];
}
vector<... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, X, Y;
cin >> H >> W >> X >> Y;
vector<string> data(H);
for (int i = 0; i < H; i++){
cin >> data.at(i);
}
int answer = 1;
for (int i = X-2; i >= 0; i--){
if (data.at(i).at(Y-1) == '#') break;
... | #pragma region
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
const int INF = INT_MAX;
const ll LLINF = LLONG_MAX;
#define all(x) x.begin(), x.end()
#define rep(i, s, e) for(ll i = s; i < e; ++i)
#define repr(i, s, e) for(ll i = s; i > e; --i)
t... |
#include<cmath>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<cstring>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<deque>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<string>
#include<sstream>
#i... | #include<bits/stdc++.h>
using namespace std;
#define I inline int
#define V inline void
#define ll long long int
#define isnum(ch) ('0'<=ch&&ch<='9')
#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 REP(u) for(int i=h[u],v;v=e[i].t,i;i=e[i].n)
#define gc (_op==_ed&&(_ed=(_op=_bu... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 998244353;
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) <<... | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))
#ifdef LOCAL
#define log(val) std::cerr << std::setw(3) << __LINE__ << "| " << #val << " = " << (val) << std::endl
#define dbg(proc) proc
#else
#de... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
using VV = vector<V>;
using SV = vector<string>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if((a*a)+(b*b)<(c*c)){
cout<<"Yes"<<endl;
}
else
cout<<"No";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n);
vector<long> b(n);
long ans = 0;
for(int i = 0; i < n; i++){
cin >> a.at(i);
cin >> b.at(i);
long total = (a.at(i) + b.at(i)) * (b.at(i) - a.at(i) + 1) / 2;
ans += total;
}
cout <... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#... |
#include<bits/stdc++.h>
typedef long long int ll ;
#define pb push_back
#define rep(i,k,n) for (i = k; i < n; i++)
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
using namespace std;
//const unsigned long long int M = 1000*100 ;
//ll sieve[M];
//vector<ll>ans;
//const unsigned int n=10000005;
ll ceil_div(ll a,... | #include<bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
long long sum = 0;
vector<int>vec(a);
for(int i = 0;i < a;i++)cin >> vec[i];
map<int,long long> mp;
for(int i = 0;i < a;i++){
mp[vec[i]]++;
}
for(int i = 0;i < a;i++){
sum += a - mp[vec[i]];
}
sum /=2;
cout << s... |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 3e3 + 5;
const int mod = 998244353;
int f[MAXN][MAXN];//use x numbers to get y
int gao(int x,int y)
{
if(y>x) return 0;
if... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplac... |
#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 <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#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 NEXT(i, x) for (int i = h[x]; i; i = e[i].u)
const int INF = 2e9;
inline int Max(const int &a, const int &b) { return a > b ? a : b;... |
/* Hardwork allways pays off */
//You never know how close to the solution you are ,so keep practicing
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int l... | // Powered by CP Editor (https://cpeditor.org)
//a+b = (a^b) + 2*(a&b)
//b^c = (a^b)^(a^c)
//gcd(x,y) = gcd(x-y,y)
//if n = 5000 then complexity cannot be (n^2*log(n)) means no map ,no sets
//check for long long overflow if input is large
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int lo... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define scl(n) scanf("%lld", &n)
#define pcl(n) printf("%lld\n", n)
#define pcl1(n) printf("%lld ", n)
#define nln pr... | #include<iostream>
#include<vector>
#include<map>
#include<stack>
#include<set>
#include<queue>
#include<stdlib.h>
#include<math.h>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<sstream>
#define endl "\n"
#define Doura() ios_base::sync_with_stdio(false),cin.tie(NULL), cout.tie(NULL)... |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
cout << N-1;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define REP(i,a,b) for(int i = (a); i < (b); i++)
#define MOD 1000000007
int main(void) {
int n;
cin >> n;
int ans;
cout << n+1-2 <... |
//#include<bits/stdc++.h>
#include<map>
#include<queue>
#include<time.h>
#include<limits.h>
#include<cmath>
#include<ostream>
#include<iterator>
#include<set>
#include<stack>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define rep_1(i,m,n) for(int i=m;i<=n;i++)
#define... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se seco... |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define ulli unsigned long long int
#define vi vector<int>
#define ii pair<int,int>
#define all(v) v.begin(),v.end()
#define getunique(v) {v.erase(unique(v.begin(),v.end()),v.e... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, ... |
#include <iostream>
#include <vector>
#include <cstring>
#include <set>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <stack>
using namespace std;
#define ll long long
#define pb push_back
#define pp pair<long long,long long>
#define ppp pair<pair<lon... | #include <iostream>
using namespace std;
typedef long long ll;
#define min(x,y) ((x)<(y)?(x):(y))
#define max(x,y) ((x)<(y)?(y):(x))
ll comb(ll n, ll k){
if (k == 0 || k == n) return 1;
if (k == 1 || k == n-1) return n;
return comb(n-1,k)+comb(n-1,k-1);
}
int main(){
ll n,k;cin >> n >> k;--k;
... |
#include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#defin... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define LOCAL
#endif
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<ll> vi;
typedef vector<pll> vpll;
const long infl=0x3f3f3f3f3f3f3f3fLL;
const int infi=0x3f3f3f3f;
#define endl '\n'
#define pb p... |
#include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> sz;
UnionFind(int n=0){ if(n>0) initialize(n); }
void initialize(int n){
par.resize(n);
sz.assign(n, 1);
for(int i=0; i<n; i++){
par[i] = i;
}
}
int find(i... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <numeric>
#include <ostream>
... |
#include <bits/stdc++.h>
using namespace std;
// Type alias
using ll=long long;
using ld=double;
using pi=pair<int,int>;
using pll=pair<ll,ll>;
using pld=pair<ld,ld>;
using ti3=tuple<int, int, int>;
using vi=vector<int>;
using vll=vector<ll>;
using vld=vector<ld>;
using vpi=vector<pi>;
using vpll=vector<ll>;
using v... | #include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <functional>
#include <queue>
#include <unordered_set>
#include <climits>
#include <set>
#include <list>
#include <cma... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
//const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10)... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1, a2, a3, a4; cin >> a1 >> a2 >> a3 >> a4;
int res = a1;
if(res > a2) res = a2;
if(res > a3) res = a3;
if(res > a4) res = a4;
cout << res;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
double a,b,c,d; cin >> a >> b >> c >> d;
d = - d;
double A = (b - d) / (a - c);
double B = b - A * a;
cout.precision(17);
c... |
#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print() { cout << endl; }
template<typename Head,typename... Tail> void print(Head head,Tail... tail){cout<<head;if(sizeof...(Tail)>0)cout<<" ";print(tail...);}
void print0() {}
template... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+5,M=1e9+7,OO=0x3f3f3f3f;
int n,q;
int arr[N];
int seg[4*N];
void build(int si=0,int ss=0,int se=n-1){
if(ss==se){
seg[si]=arr[ss];
return;
}
int md=ss+(se-ss)/2,lf=si*2+1,rt=si*2+2;
build(lf,ss,md);
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef tuple<int,int,int> i3;
int x[105], y[105], z[105], n, m;
ll fat[20], dp[(1 << 18) + 5][105];
vector<int> mask[25];
ll solve(int curmask, int pos){
int cursz = __builtin_popcount(curmask);
if(pos == m) return ... |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long int ll;
typed... | // Generated by 2.3.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
void solve(long long K, long long N, long long M, std::vector<long long> A){
vector<ll> B(K);
ll used = 0;
vector<pair<double, int>> ps... | #include <bits/stdc++.h>
int main(){
int K, N, M;
std::cin >> K >> N >> M;
std::vector< long long > A(K);
for(int i=0; i<K; i++){
std::cin >> A[i];
}
std::vector< long long > B(K);
std::vector< std::pair< long long, long long > > B_zan_i(K);
long long total = 0;
for(int... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b, c; cin >> a >> b >> c;
uint64_t abs_a = abs(a);
uint64_t abs_b = abs(b);
if (!(c & 1))
cout << (abs_a == abs_b ? "=" : (abs_a > abs_b ? ">" : "<"));
else
cout << (a == b ? "=" : (a > b ? ">" : "<"));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
double X0, Y0, XN2, YN2;
cin >> N >> X0 >> Y0 >> XN2 >> YN2;
double mX = (X0 + XN2) / 2, mY = (Y0 + YN2) / 2;
double oX = X0 - mX, oY = Y0 - mY;
double angle = 2 * M_PI / N;
double X1 = oX * cos(angle) - oY * sin(angle),
Y1 = oX ... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <iterator>
#include <numeric>
#include <cstdint>
#include <cmath>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include<bits/stdc++.h>
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define task "nondec"
#define pii pair<pll, ll>
using namespace std;
using ll = long long;
const int N = 1e5+5;
const ll mod = 1e9 + 7;
const ll base = 350;
const ll cs = 331;
const long double Exp = 1e-7;
ll m, n,... |
# include <iostream>
# include <vector>
# include <utility>
# include <algorithm>
using namespace std;
int main()
{
int n,m,q;
cin>>n>>m>>q;
vector<pair<int,int>>v;
for(int i=0; i<n; i++)
{
int a,b;
cin>>a>>b;
v.push_back(make_pair(a,b));
}
sort(v.begin(),v.end());
... | #include <bits/stdc++.h>
template <typename T>
T next() {
T temp; std::cin >> temp;
return temp;
}
template <>
int next() {
int temp; scanf("%d", &temp);
return temp;
}
template <>
long long next() {
long long temp; scanf("%lld", &temp);
return temp;
}
template <>
double next() {
double te... |
#include<bits/stdc++.h>
using namespace std;
//dengyaotriangle!
const int maxn=1005*2;
int n,m;
vector<int> adj[maxn];
bool vis[maxn];
void adde(int a,int b){
adj[a].push_back(b);
adj[b].push_back(a);
}
int dfs(int u){
vis[u]=1;
int msk=1<<(u<=n);
for(int i=0;i<(int)adj[u].size();i++){
in... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#def... |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vec... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\... |
#include <bits/stdc++.h>
#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;
typedef long long lint;
typ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define INF 0x3f3f3f3f
#define pi M_PI
typedef pair<ll, ll> llPair;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef priority_queue<ll> pqll;
ll MOD = 1000000007;
/*
Really doe, like really doe
Reall... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=int;
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<typename T1, ... | #include <bits/stdc++.h>
using namespace std;
const int Mod = 998244353;
int n, s, w[105];
long long ans, fac[105], dp[105][10005];
int main(){
scanf("%d", &n);
for(int i=1; i<=n; ++i){
scanf("%d", &w[i]);
s += w[i];
}
if(s&1){
puts("0");
return 0;
}
dp[0][0] = 1;
for(int i=1; i<=n; ++i){
for(int j=i... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF = 1001001001;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int main() {
long double n,d,h;
cin >> n >> d... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <map> //http://vivi.dyndns.org/tech/cpp/map.html
#include <set> //http://vivi.dyndns.org/tech/cpp/set.html
#include <vector>
#include <deque>
#include <queue>
#include <numeric> //gcd,lcm c++17
#include <tuple>
#include <iomanip> //set... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.