code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) ((ll)(x).size())
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxl=3e5+10;
const ll inf=1ll<<60;
int n,m,k,cnt,tot,cas,ans;
struct node
{
int x,c;
}a[maxl];
int l[maxl],r[maxl];
ll dp[maxl][2];
bool vis[maxl];
char s[maxl];
inline bool cmp(const node &a,const node &b)
{
return a.x<b.x;
}
inline voi... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long n, a[100000], i; cin >> n;
long double dn = n, x2 = 2;
for(i = 0; i < n; i++) cin >> a[i];
if(n == 1) cout << fixed << setprecision(15)
<< a[0] / x2 << endl;
else if(n == 2) cout << fixed << setprecision(15)
... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_nod... |
#include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
using namespace std;
struct eq{
long double a, b; // a*f0 + b
eq(): a(0), b(0){}
eq(long double a, long double b): a(a), b(b){}
eq operator+(const eq &oth){
return eq(a + oth.a, b + oth.b);... | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T>
T gcd(T a, T b) { return ((a % b == 0) ? b : gcd(b, a % b)); }
template <typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL ... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vll = vector<long long>;
using vb = vector<bool>;
using vd = vector<double>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvc = ... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <stack>
#include <cstring>
#include <set>
#include <utility>
#include <iostream>
#include <iomanip>
#include <list>
#include <queue>
#include <algorithm>
#include <cmath>
//#include <boost/multiprecision/cpp_int.hpp>
#include <unordered_se... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
char getch()
{
static char buf[1 << 14], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 14, stdin), p1 == p2) ? EOF : *p1++;
}
void read(int &x)
{
x = 0;
char c = getch();
while(c < '0' || c > '9') c = getch();
wh... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll LINF = LLONG_MAX;
const int INF = INT_MAX;
const double PI=acos(-1);
template<class T... |
/*
author: blue_matrix
*/
#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); }... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a, b, c;
cin >> a >> b >> c;
cout << ((a * a + b * b < c * c) ? "Yes" : "No")
<< endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_stri... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
//#include <atcoder/all>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long... |
/**
* author: tomo0608
* created: 18.02.2021 21:47:19
**/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef pair<int,int> pii;
typedef pair<long long, l... | #include <algorithm>
#include <iostream>
#include <limits>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int numDog = N * 2;
unordered_map<char, vector<long long>> a;
a['R'];
a['B'];
a['G'];
for(int i = 0; i < numDog; i++) {
long long aa;
char c;
cin >> a... |
#include <bits/stdc++.h>
#define maxn 100005
#define INF 9223372036854775807LL
using namespace std;
using Road = tuple<int, int, int>;
using LL = long long;
using pli = pair<LL, int>;
vector<Road> G[maxn];
LL dist[maxn];
int main()
{
int n, m;
scanf("%d%d", &n, &m);
while(m--)
{
int a, b, c, d;
scanf("%d%d%d%d"... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... |
//SKD
// 16 32 108
#include<bits/stdc++.h>
#define ll long long int
#define pp push_back
#define pi 2*acos(0.0)
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout<<fixed;
cout<<setprecision(9);
double m=0,p=0,l,q=0,r=0,t;
int n,k,i,j;
cin>>n;ll a[n],... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... |
#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()
templa... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define FOR(i,f,n) for(int i=f;i<n;i++)
#define FORI(i,f,n) for(int i=f;i>=n;i--)
#define sz(a) ((int)(a).size())
#define ff first
#define ss second
#define all(a) (a).begin(),(a).end()
#define alli(a) (a).rbegin(),(a).rend()
#define approx(a) fixed<<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef double db;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vl;
typedef vector<pii> vpii; typedef vector<pll> vpll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR0(n) for(int i=0;i<n;++i... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = a; i < (int)(b); i++)
template<class T>bool chmax(T &... |
#include<bits/stdc++.h>
using namespace std ;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define ar array
#define inf() ifstream cin("d.txt")
#define onf() ofstream cout("test.txt")
#define mod 1000000007
#define pb push_back
#def... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cctype>
#include <fstream>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <string>
#include <sstream>
#include <stack>
#include <set>
#include ... |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include<bits/stdc++.h>
using namespace std;
const long long mod=998244353,INF=1e18;
#define ll long long
#define line cout<<"\n";
#define flush cout<<endl;
#define pll pair<ll,ll>
#define x first
#define y second
#define p_all(arr) for(auto i:arr){cout<<i<<" ";}cout<<"\n";
ll power(ll u,ll v)
{
ll res=1;
while... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
using ll = long long;
typedef pair<int, int> pii;
typedef unsigned long long ul;
const int mn = 200005;
const int mk = 302;
const int mod = 998244353;
int n, k;
ll... | #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 rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begi... |
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
const int N = 6666;
const long long MOD = 998244353;
int dp[N][N];
void solve()
{
int n, k;
cin >> n >> k;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = n + n; j >= 1; j--) {
dp[i][j] ... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <chrono>
#include <random>
#define rep(... |
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int tc, n;
string s[3];
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> tc;
while(tc--){
cin >> n;
for(int i=0;i<3;i++) cin >> s[i];
for(int i=0;i<n;i++) cout << 1;
for(int i=0;i<n;i++) cout << 0;
cout << "1\n";
}
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se secon... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
int n,x,i;
cin>>n>>x;
int ar[n];
vector<int>s;
for(auto &x: ar)cin>>x;
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const do... | #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;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<(a)<<endl
#define dumparr(a,n) cerr<<#a<<"["<<(n)<<"]="<<(a[n])<<endl
#else
#define dump(a)
#define dumparr(a,n)
#e... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int calc_min_delta(const vector<int> &a){
int ret = 1e9;
for(int i=1; i<int(a.size()); ++i){
ret = min(ret, abs(a[i] - a[i-1]));
}
return ret;
}
int main(){
int n;
string s;
cin >> n >> s;
vector<int> a(n+1);
... | #include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<cstdio>
#include<string>
#include<deque>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
int n;
char s[110];
int a[110];
int b[110];
int maxB[110];
int szA;
int step[110];
int r[110];... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define pf push_front
#define mp make_pair
#define mod 1000000007
#define vll vector<ll>
#define inf 3e15 +7
#define pll pair<ll,ll>
#define ff first
#define ... | //Template Created By: OptimalKnight
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <chrono>
using namespace std;
using namespace __gnu_pbds;
using namespace chrono;
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,ss... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,X,Y,a=-1e18,i=0;cin>>N>>X;
ll A[N+1],T[N+1],B[N+1];
for(int i=1;i<=N;B[i]=A[i],T[i]=a,i++)cin>>A[i];
vector<vector<int>>G(N+1);
for(;cin>>X>>Y;)G[X].push_back(Y);
for(i=1;i<=N;i++)for(auto v:G[i])T[v]=max(T[v],A[v]-B[i]),B... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define LOL cout << '\n';
#define kill(x) {cout << (x) << '\n'; return;}
#define sz(x) ((int)x.size())
#define INF 1e15
#... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long UINT64;
int n;
string s;
int main() {
scanf("%d", &n);
s.resize(n);
scanf("%s", &s[0]);
UINT64 res = 0;
if(n == 1) {
if(s == "1") res = 20000000000;
else res = 10000000000;
}
else if(n == 2) {
... | #include <bits/stdc++.h>
using namespace std;
template<typename T = int> vector<T> create(size_t n){ return vector<T>(n); }
template<typename T, typename... Args> auto create(size_t n, Args... args){ return vector<decltype(create<T>(args...))>(n, create<T>(args...)); }
int main(){
ios::sync_with_stdio(false);
cin.tie... |
//------HARSH------//
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define int long long
#define f(i,a,n) for(int i=a;i<n;i++)
#define rf(i,a,n) for(int i=n-1;i>=a;i--)
#define read(arr,n) for(int i=0;i<n;i++)cin>>arr[i];
#define in cin>>
#define out cout<<
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define fs first
#define sc second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define MP make_pair
mt19937 rng(chrono::steady_clock::now().time_... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vp> vvp;
// inp... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 105
char buf[SIZE],work[2*SIZE];
char calc(char a,char b){
switch(a){... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=2e5+100,mod=1e9+7;
int dp[nax][19];
int32_t main()
{
int t=1;
//cin>>t;
while(t--)
{
string a;
cin>>a;
int k;
cin>>k;
set<int> s;
s.clear();
for(int i=0;i<a.size();i+... | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<cstdlib>
#include<bitset>
using namespace std;
#define FAST ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef long long ll;
#define N 200005
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
int main()
{
int N;
cin >> N;
int mx = 0;
int mn = 1000;
for (int i = 0; i < N;++i) {
int a;
cin >> a;
mx = max(a, mx);
}
for (int i = 0;i < N;++i) {
int b;
... |
#include <iostream>
#include <array>
#include <vector>
#include <cassert>
#include <algorithm>
using namespace std;
using lint = long long;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; ++i)
{
int s, t;
cin >> s >> t;
s--;
t--... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int,int>> vpi;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0... |
#include <bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int64_t a=0;a<b;a++)
#define sor(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define ll int64_t
#define mod 1000000007
#define vl vector<int64_t>
#define vc vector<char>
#define vs vector<string>
#define np(vec) next_permutation(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
bool check(ll a, ll b, ll m)
{
if (a == 0 || b == 0)
return false;
if (a > m / b)
return true;
return false;
}
bool pos(vector<ll> &dig, ll x, ll m)
{
ll num = dig[0], cur = 1;
for (int i = 1;... |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define BUFF ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define IO freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define P(x) cout<<x<<endl
#define P2(x,y) cout<<x<<' '<<y<<endl
#define P3(x,y,z) cout<<x<<' '<<y<<' '<<z<<endl
#define P4(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = n - 1; i >= 0; i--)
struct Timer {
priva... |
#include <bits/stdc++.h>
int main() {
using namespace std;
ios_base::sync_with_stdio(false), cin.tie(nullptr);
const int INF = 1e9;
int N; cin >> N;
string S; cin >> S;
std::array<int, 26> dp; dp.fill(INF);
dp[S[0] - 'a'] = 0;
for (int i = 0; i < int(S.size()); i++) {
int best = INF;
for (int v = 0; v < ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m)
#define sqrt(n) sqrtl(n)
const ll MAX = 5000000000000000000;
const ll MOD = 0;
random_device rd;
mt19937 mt(rd());
int main(){
ll N;
string S;
cin >> N >> S;
if(S[0] != S[N - 1]){
... |
#include<iostream>
#include<string>
using namespace std;
string judge(long N) {
if (N == 0) return "Yes";
while (N % 10 == 0) {
N /= 10;
}
long reverse = 0;
long buf = N;
while (buf != 0) {
reverse = reverse * 10 + buf % 10;
buf /= 10;
}
if (N == reverse) return "Yes";
else return "No";
}
int main() {... | #include <iostream>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <bitset>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cassert>
#include <random>
using namespace std;
void solve();
int main() {
s... |
#include <iostream>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
double a,b;
cin>>a;
cin>>b;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rrep(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
void solve(long long A, long long B){
cout << (double) (A - B) * 100 / A << endl;
}
int main(){
long long A;
scanf(... |
#include <bits/stdc++.h>
#define debug(var) do{std::cout << #var << " :";std::cout << std::endl;view(var);}while(0)
template<typename T> void view(T e){ std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){ int c = v.size(); std::cout << "{"; for(const auto& e : v){ std::cout << e; if... | #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... |
// Problem: C - Unexpressed
// Contest: AtCoder - Caddi Programming Contest 2021(AtCoder Beginner Contest
// 193) URL: https://atcoder.jp/contests/abc193/tasks/abc193_c Memory Limit:
// 1024 MB Time Limit: 2000 ms Powered by CP Editor
// (https://github.com/cpeditor/cpeditor)
/*---------------------------------------... | //IQ134高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(... |
#include <iostream>
#include <algorithm>
#include <cstring>
#define NMAX 101
using namespace std;
int frecv[NMAX], n, m, k, ans;
pair<int, int> ab[NMAX], cd[NMAX];
int res(int start) {
memset(frecv, 0, sizeof(frecv));
for (int i = 0; i < k; ++i)
if (start & (1 << i))
++frecv[cd[i].first];... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
// Sieve of Eratosthenes
// https://youtu.be/UTVg7wzMWQc?t=2774
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = ... |
//#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <functional>
#include <utility>
#include <tuple>
#include <vector>
#include <string>
... | #include <bits/stdc++.h>
using namespace std;
vector<long>p(60);map<pair<long,int>,long> m;long n,x;
long z(long a,int i) {
if (i == n)return 1;
if (m.count({a, i}))return m[{a, i}];
long r, y = p[i], b = a-a%y;
if (a % y == 0)r = z(a, i + 1);
else if (a > 0)r = z(b, i + 1) + z(b + y, i + 1);
el... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <bits/stdc++.h>
typedef long int l;
typedef unsigned long int ul;
typedef long long int ll;
typedef unsigned long long int ull;
#define endl '\n'
#define PB push_back
#define MP make_pair
#define fs first
#define sd second
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#defin... |
#include <bits/stdc++.h>
using namespace std;
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); // __VA_ARGS__可変引数マクロ
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VA... | #include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define mod 1000000007
#define ff first
#define ss second
#define pi 3.1415926535
#define endl '\n'
using namespace std;
str... |
/*@author Vipen Loka*/
#include <bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
#define ll long long
#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 mod 1000000007
#define inf 1000000000000000001;
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n ;
cout << n - 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SZ(x) ((int)(x).size())
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, leng... | #include <cstdio>
int n, a[300006];
long long res, sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", a + i);
for (int i = 0; i < n; i++) res += (n - 1LL) * a[i] * a[i];
for (int i = 0; i < n; i++) res -= 2 * a[i] * sum, sum += a[i];
printf("%lld", res);
}
|
#include<bits/stdc++.h>
#define rep(i,m,n) for (int i=m;i<n;i++)
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int N,K,M;
cin>>N>>K>>M;
int sum=0;
rep(i,0,N-1){
int data;
cin>>data;
sum +=data;
}
if(sum/N>=M){
cout<<0<<endl;
return 0;
}
rep(i,0,K+1){
int d=(sum+i)/N=... | #include<bits/stdc++.h>
using namespace std;
#define foreach(i,n) for(auto&i:(n))
#define all(x) (x).begin(),(x).end()
using ll = long long;
template<class t>
auto collect(int n,t f){
vector<decltype(f())> res(n);
for(auto &i:res){
i = f();
}
return res;
}
template<class t,class f>
auto mapcar... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const ll INF=4e18;
const int inf=1e9;
const double pi=acos(-1);
ll n, ans;
ll cek(ll pos, ll pjg){
return pjg*(2*pos+(pjg-1))/2;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for(int len=1;... | // #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
#include "bits/stdc++.h"
#define ll long long
#define ul unsigned long long
#define ld long double
#define rep(i, a, b) for(int i=(a); i<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(int i = a; i<=b; i++)
void print(stack<char> st){
while(!st.empty()){
cout << st.top() << " "... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define loops(i, s, n) for (ll i = s; i < (ll)n; i++)
#define loop(i, n) loops(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define pub push_back
#define pob pop_back
#define mp make_pair
#define dump(... |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define _1a1ee int t;cin>>t;for(int tt=0; tt<t; ++tt)
#define MOD 1000000007
#define pb push_back
#define ppb pop_back
#define... |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
int N; cin >> N;
N = N * 108 / 100;
if(N < 206) cout << "Yay!";
else if(N == 206) cout << "so-so";
else cout << ":(";
cout << endl;
retu... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3fffffff;
void chmin(int& a, int b){ if(a > b){ a = b; } }
int main(){
int N, M;
cin >> N >> M;
vector<int> H(N);
for(auto& h : H) cin >> h;
vector<int> W(M);
for(auto& w : W) cin >> w;
sort(H.begin(), H.end());
vector<int... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)p... |
// author : lynmisakura
// TIMESTAMP: 2020-10-17, 20:07:37
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i = 0;i < n;i++)
#define RNG(i,s,n) for(int i = s;i < n;i++)
#define _RNG(i,s,e) for(int i=s;i>=e;i--)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define dup(x,y) (x ... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define jx 1000000
char s[100001];
int len,f[26];
int main(){
cin>>len;
scanf("%s",s);
fo(i,0,25)f[i]=jx;
f[s[0]-'a']=0;
if(len==1){
printf("-1");
return ... |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
#include <ctype.h>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const double eps = 1e-10;
const double INF = 1e9;
class Union_Find{
vector<int> par; vector<int> rank; vector<int> num;
public:
Union_Find(int n) {
par = vector<int>(n); rank = vector<int>(n,0);... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < int(NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD... | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, A[N], k = INT_MAX;
int main()
{
scanf("%d%*s", &n);
for(int i = 0; i <= n; ++i)
scanf("%d", &A[i]), k = min(k, i ? abs(A[i] - A[i - 1]) : k);
printf("%d\n", k);
for(int i = 1; i <= k; ++i)
for(int j = 0; j <= n; ++j)... |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main(){
fastIO;
int n;
cin >> n;
vector<vector<int>> sol;
sol.push_back({... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define P pair<ll, ll>
int main(){
ll K;
cin >> K;
string S, T;
cin >> S >> T;
vector<ll> card(9);
vector<ll> a_hand(9), t_hand(9);
... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<endl
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
using namespace std;
typedef long long int LL;
typedef pair<int,in... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=1e5+7;
const LL MOD=1e9+7;
LL rec[maxn];
int main()
{
int len;cin >> len;
string arr;
LL ans=1;
rec[3]=1;rec[4]=2;rec[2]==1;
for(int i=0;i<4;++i)
{
char tem; cin >> tem; arr+=tem;
}
if(len<4||arr[0]=='A'&&arr[1]=='A'||arr[1]==... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll t,i,endi=0,starti=0;
string s;
cin>>s;
string ss;
for(i=s.size()-1;i>=0;i--)
{
ss.push_back(s[i]);
}
if(ss==s)cout<<"Yes"<<endl;
else{
ss={};
//if()
for(i=s.size()-1;i>=0;i--)
{... |
#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | #include <stdio.h>
#include <string.h>
#include <vector>
#include <set>
#include <queue>
#include <string>
#include <map>
#include <stdlib.h>
#include <time.h>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <functional>
#include <numeric>
const int MAXN = 500010;
char str_s[MAXN];
char str_t[MAXN];
... |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
constexpr int INF = 1001001001... | #include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
const int N = 2e5 + 50;
struct Point{
int x, y;
}p[N];
int n, m, Q;
int r[N], x[N], y[N], nx[N], ny[N];
signed main(){
scanf("%lld", &n);
for(int i = 1; i <= n; ++i) scanf("%lld%lld", &p[i].x, &p[i].y);
scanf("%lld", &m)... |
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <utility>
#include <climits>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstring>
#include <iostream>
#include <fstream>
#include <iomanip... | #include <bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector <int> a(n);
vector <vector <int>> pos(n);
rep (i, n) {
cin >> a[i];
pos[a[i]].push_back(i);
}
i... |
#include<iostream>
using namespace std;
int main()
{
int x1,x2,x3;
cin>>x1>>x2>>x3;
if(x1== x2)
{
cout<<x3;
}
else if(x1==x3)
{
cout<<x2;
}
else if(x2==x3)
{
cout<<x1;
}
else
{
cout<< 0;
}
} | #include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
int main()
{
int a=rea... |
#include<bits/stdc++.h>
//#include<atcoder/all>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace atcoder;
//using namespace boost::multiprecision;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#de... | // E - 潜入
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
using PR = pair<int,int>;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
int V; // 頂点数
vec<vec<PR>> G; // [from]<to, cost> 隣接リスト
int INF = 1e9;
vi dijkstra(int s){
vi dist(V, INF);
dist[s] = 0;
priority_queue<PR, vec<PR>,... |
#include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define bits(x,i) (((x) >> (i)) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
int a[3];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> a[0] >> a[1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A+B+C - min(A,min(B,C)) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int h,w;
cin>>h>>w;
char c;
int in[h][w];
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
cin>>c;
if(c=='.')in[i][j]=0;
else in[i][j]=1;
}
}
int ans=0;
for(int ... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
// #define MOD 998'244'353
// #define MOD 1'000'000'007
// #define INF 1'000'000'000'000'000'000
using namespace std;
// using namespace atcoder;
typedef long long ll;
int ma... |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... | #include <bits/stdc++.h>
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; return 1; } return 0; }
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define inrange(a, x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
int main() {
// (4 3 2 1)
// (4-3) (4-2) (4-1) (3-2) (3-1) (2-1)
// 4 * 3 + 3 * 1 + 2 * (-1) + 1 * (-3)
cin >> N;
vector<ll> v;
ll m;
for(int i=0; i<N; ++i) {
cin >> m;
v.push_back(m);
}
sort(v.rbegin(), v.rend())... |
#include<bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,abm,mmx,avx,avx2")
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define req(i,a,b) for(int i=(a);i>=(b);--i)
#define rep_(i,a,b) for(int i=(a);i<(b).size();++i)
#define F(a) rep(a,1,n)
#define M(a,b) memset(a,b,sizeof a)
#define DC int T;cin>>T;while(... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 1010
#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
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i=0;i<n;i++)
#define INF 1000000001
#define lINF 1000000000000001
using ll = long long;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
//1e9<int型の最大値<1e10
//1e18<long型の最大値<1e19
//配列直入れ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TPP... |
#include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define size_t unsigned long long
#define ll long long
#define rep(i, a) for (int i = 0; i < (a); i++)
#define repr(i, a) for (int i = (int)(a)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>>S(H, vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++)cin >> S.at(i).at(j);
}
vector<vector<int>>A(H, vector<int>(W));
A.at(0).at(0)=1;
vector<vector<int>>tate(H, vector<int>(... |
#include <bits/stdc++.h>
using namespace std;
long long MOD=998244353;
long long MODpow(long long a,int b){
if(b==0)return 1;
if(b%2==0){
long long t=MODpow(a,b/2);
return (t*t)%MOD;
}
return (a*MODpow(a,b-1))%MOD;
}
int main(){
int N,M,K;
cin >> N >> M >> K;
vector<long long> A(K+1,0);
vector<long long>... | #include <bits/stdc++.h>
#define TRACE(x) cerr << #x << " = " << x << endl
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) (int)(x).size()
using namespace std;
typedef long long ll;
typede... |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define vi std::vector<ll>
#define si set<ll>
#define pb push_back
vi v[2020];
bool visited[2020];
ll ans;
void dfs(ll s){
if(visited[s])return;
visited[s] = true;
ans++;
f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, x, y) for (int i = x; i < y; i++)
vector<vector<bool>> ok;
void dfs(map<int, set<int>> &path, int i, int p)
{
if (ok[p][i])
return;
ok[p][i] = true;
for (auto v : path[i])
dfs(path, v, p);
}
int main()
{
... |
/* Hemant Gupta */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define show(v) \
for (int i = 0; i < (int)v.size(); i++) \
cout << v[i] << (i == (int)v.size() - 1 ? "\n" : " ");
#define pb push_back
#define INF 1e18 + 5
const int MOD = 1e9 + 7;
const int ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <sstream>
#include <iomanip>
#include <set>
#include <cmath>
#include <bitset>
#include <queue>
#include <climits>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
int right = c * d - b;
if (ri... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e, p) for (ll i = (ll)s; i < (ll)e; i += p)
#define ALL(vec) vec.begin(), vec.end()
int main(){
int n;
cin >> n;
ll l = pow(10, 9), s = -pow(10, 9), a, t, m = 0;
rep(i, 0, n, 1){
cin >> a >> t;
if (t ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,... |
#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... | /*
** author : Dhiraj Govindvira
** date : 02 May 2021 ~ Sunday
** time : 09:20:20 PM
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef DHIRAJ
#include "D:/dhiraj/Programming/debug.h"
#else
#define dbg(...) 1
#define cerr if(0) cerr
#endif
using ll = long long int;
#define endl '\n'
t... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
int ans = 0;
if (a == b) {
ans = x;
} else if (a < b) {
if (y < 2 * x) {
ans = (b - a) * y + x;
} else {
ans = (b - a) * 2 * x + x;
}
} else {
if (y < 2 * x) {
a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,j,n) for (int i=j; i < (int)(n); i++)
int h[200010];
int w[200010];
int main() {
int n,a,b,m,jj,jj2;
long long p,q,ans;
p=1e15;
ans=1e15;
cin >> n >> m ;
rep(i, n) cin >> h[i];
rep(i, m) cin >> w[i... |
#include<bits/stdc++.h>
//#define maxn
using namespace std;
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
void rein(char*str)
{
int n=0;char opt;
while((opt=getchar())<'a'||opt>'z');... | #include<bits/stdc++.h>
using namespace std;
long long n,dp[70][2]={0};
int main()
{
cin>>n;
string s[n];
for(int i=0;i<n;i++)
cin>>s[i];
dp[0][0]=1;
dp[0][1]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<2;j++)
{
for(int k=0;k<2;k++)
{
if(s[i]=="AND")
dp[i+1][j&k]+=dp[i][j];
els... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define endl "\n"
using ll=long long;
using ld=long double;
using namespace std;
ll mod= 1e9+7;
ll GCD(ll a, ll b) { return b ? GCD(b... | #include<bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
int count = 0;
for (int i = 0; i < s.size(); ++i)
{
if (s[i] == 'Z')
{
if (s[i+1] == 'O')
{
if (s[i+2] == 'N')
{
if ... |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... | #include <bits/stdc++.h>
using namespace std;
#define mxx 1e18
#define mnn -1e18
//#define int long long
#define Y() cout<< "YES" <<endl
#define N() cout << "NO"<<endl
#define endl "\n"
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using pii = pair<int,int>;
const ll mod = 1e9 + 7;
const int maxn = 1e5+5;
v... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int> vi;
const int limit = (int)1e18;
void build(vi &v, int f)
{
int b = f;
while (b <= limit)
v.push_back(b), b *= f;
}
int32_t main()
{
vi a, b;
build(a, 3);
build(b, 5);
int n;
cin >> n;
b... |
#include<bits/stdc++.h>
#define MAX 10000
typedef long long ll;
using namespace std;
void manak()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
int main()
{
manak();
int a[2][2];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
typedef long long ll;
int main()
{
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << a*d - b*c << endl;
} |
#include <iostream>
#define pb push_back
using namespace std;
long long n,nr,i,a,b,y,xp,c;
int main()
{
cin>>n>>y>>a>>b;
xp=0;
while(a <= (n + b) / n&&n*a<y)
{
xp++;
n*=a;
}
/*else
{
c=(y-n)/b;
xp+=c+1;
if((y-n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
// #define _GLIBCXX_DEBUG
template <class T> using V = vector<T>;
#define ALL(v) (v).begin(),(v).end()
#... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < int(NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD... | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(2*N);
int i;
for(i=0;i<2*N;i++)cin >> V[i];
priority_queue<int,vector<int>,greater<int>> q;
for(i=0;i<N;i++) {
q.push(V[N-i-1]);
q.push(V[N+i]);
q.pop();
}
long long ans = 0... |
#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;
typedef un... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
N = min(8, N);
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
A[i] %= 200;
}
vector<vector<int>> rs(200);
for (int i = 1; i < (1 << N); ++i) {
int acc = 0;
for (... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair <ll, ll>
long long GCD(long long a, long long b)
{
if (!b) return a;
return GCD(b, a % b);
}
vector <int> graph[2001];
queue <int> q;
int n;
pii arr[200001];
int main()
{
ll n, k;
scanf("%lld ... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' <... |
//#include <atcoder/maxflow.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#inclu... | #include <iostream>
#include <vector>
#include <numeric>
#include<cstdlib>
#include <map>
#include <set>
#include <math.h>
#define ll long long
#define MAXN 100000
using namespace std;
std::vector<std::tuple<int,ll,ll>> edges[MAXN+2];
ll GetOptTime(ll d) {
// t + d/(t+1) is minimized
ll topt = (ll)sqrt(d);
... |
#include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
template <class T> void input(T& a){
cin>>a;
}
int main(){
int A,B,C;
input(A);
input(B);
input(C);
if((A*A+B*B)<C*C){
cout <<"Yes"<<endl;
}
else{
cout <<"No"<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs(n) fixed << setprecision(n)
using ll = long long;
using ld = long double;
ll fact(ll x) { return x <= 1 ? 1 : x * fact(x - 1); }
//再帰処理で時間を食い過ぎるので階乗をメモ化する
map<ll, ll> factMemo;
ll memo_fact(ll x){
if(factMemo[x] != 0) return factMemo[x];
else return x <= ... |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void deb... | #include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);... |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1LL^60;
using ll = long long;
using vll = vector<ll>;
using mll = map<ll, ll>;
void solve(long long N, long long A, long long B){
cout << N - A + B<< endl;
}
int main(){
long long N;
scanf("%lld",&N);
long long A;
scanf("%lld",&A);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >> C;
if(A > B ){
cout << "Takahashi" << endl;
}
else if(A == B && C == 1){
cout << "Takahashi" << endl;
}
else{
cout << "Aoki" << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
vector<pair<int, int>> z;
pair<int, int> c;
for (int i=0; i<n; i++)
{
cin >> c.first >> c.second;
z.push_back(c);
}
bool flag = false;
for (int i1=0; i1<n; i1++)
{
for (int i2=i1+1; i... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
#include <functional>
using namespace std;
struct mountain
{
string name;
int height;
};
int main()
{
int n;
string input, most, second;
long input_height, most_height, second_height;
most_height = 0;
second_h... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define inF freopen("input.txt", "r", stdin);
#define outF freopen("output.txt", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#d... |
#include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#defin... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
return a<=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf,... |
/*
author : aryan57
created : 06-June-2021 18:04:35 IST
*/
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template <typename T_container, typename T = typename enab... | //This Code was made by Chinese_zjc_.
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <time.h>
// #include<w... |
#include<bits/stdc++.h>
using namespace std;
double k;
double a,b,c,d,s,p;
double f(double x)
{
return -b/k+a;
}
int main()
{
cin>>a>>b>>c>>d;
b=-b;
k=(b-d)/(a-c);
s=f(0);
printf("%.10lf",s);
return 0;
} | #include<bits/stdc++.h>
#define loop(i, n) for(int i = 0; i < n; i++)
#define pb push_back
#define ll long long int
#define vi vector<int>
#define pi pair<int, int>
#define W(t) int t; cin >> t; while(t--)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); +... | #include "bits/stdc++.h"
#define rep(i,b) for(ll i=0;i<b;i++)
#define ll long long
using namespace std;
/*--Input//////////////////////////////////////////////////*/
inline void IN(void){return;}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
cin >> first;
IN(rest...);
ret... |
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define Y imag()
#define X real()
#define clr(v,d) memset( v, d ,sizeof(... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include<bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define input(v) for (auto &i : v) cin >> i;
#define print(v) for (auto &j : v) cout << j << " "; cout << "\n";
void solve()
{
int n;
cin>>n;
vector<int>a(n),b(n);input(a);input(b);
int mx = max(a[0],b[0]);
int mn = min(a[0],b[0]);... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define quickread \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define hii cout << "Hii there Sparky! \n"
#define endl '... |
/*
* Written by: Richw818
* Lang: C++17
* main.cpp
*/
#include<bits/stdc++.h>
using namespace std;
//Macros
#define ll long long
#define ld long double
#define ull unsigned long long
#define uint unsigned int
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ef emplace_front
#define str ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,n) for (int i = 0;... |
#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 ... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
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); i++)
#define... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define setbits(x) __builtin_popcountll(x)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define int long long int
#define ff first
#define ss second
#define float long double
void solve()
{
int n=0,x=0,y=0;
cin>>n>>x... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int a,b,c;
cin >> a >> b >> c;
long long int x=(a*(a+1))/2,y=(b*(b+1))/2,z=(c*(c+1))/2;
x%=998244353;
y%=998244353;
z%=998244353;
long long int d=x*y%998244353;
cout << d*z%998244353 << endl;
} |
#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 <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(xs) xs.begin(), xs.end()
#define rall(xs) xs.rbegin(), xs.rend()
#define sz(x) (int)((x).size())
#define pb push_back
#define ppb pop_back
#define pf push_... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int ma... |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include ... | #include<iostream>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax... |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inc... | #include <bits/stdc++.h>
using namespace std;
void used_tile(vector<vector<int> > &t,int x,int y)
{
if(t[x][y]==t[x-1][y]) t[x-1][y]=-1;
else if(t[x][y]==t[x+1][y]) t[x+1][y]=-1;
else if(t[x][y]==t[x][y-1]) t[x][y-1]=-1;
else if(t[x][y]==t[x][y+1]) t[x][y+1]=-1;
t[x][y]=-1;
}
int cant_move(vector<vector<int>... |
/*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 <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <iomanip>
using namespace std;
int a,b,w;
#define PI 3.14159265359 ;
int main()
{
cin >> a >> b >> w;
w*=1000;
int min=0;
int max=0;
min = ceil((double)w/b);
max = w/a;
if(max < min){
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.