code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
#define int long long
#define mod 1000000007
using namespace std;
main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n; cin >> n;
int ans = 1e18;
for (int i = 0; i < 60; ++ i){
int c = n % (1ll << i);
int b = i;
int a = (n - c) / (1l... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define FOR(i,f,n) for... |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef pair<int,int> pii;
const int N = 1e5+10;
int n, A, B, sum, a[N], b[N], tot;
pii tmp[N];
signed main() {
cin >> n >> A >> B; sum = B;
for(int i = 1; i <= n; i ++) {
scanf("%d", &a[i]);
b[i] = 1ll * a[i] * B / A;
sum -= b[i];
if(1ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<=(int)(n); i++)
#define rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
typedef vector<vl> wl;
const... |
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define ll long long
using namespace std;
// cout << fixed << setprecision(8) << result << endl;
int main() {
int n, k, ans=0;
cin >> n >> k;
ans = n*(n+1)*k*100/2;
ans += n*k*(k+1)/2;
cout << ans << end... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, k;
cin >> n >> k;
int ans = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= k; j++)
{
ans += 100 * i + j;
}
}
cout << ans;
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<string>
#include<set>
#include<bitset>
#include<cassert>
#include<numeric>
#define ll long long
#define MOD 1000000007
using namespace std;
//aのb乗
ll mypow(ll a,ll b){
ll ans=1;
for(ll i=0;i<b;i++){
ans*=a;
}
return... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
using namespace std;
int main()
{
int N = 0;
cin >> N;
vector<int>A;
int a = 0;
for (int i = 0; i < N; i++)
{
cin >> a;
A... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
int n;
int a[1000005];
priority_queue <int, vector<int>, greater<int> > pq;
int res;
void solve(){
cin >> n;
for(int i = 1; i <= 2 * n; i++){... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// Segment tree for range minimum and addition.
class SegTree {
private:
const ll NEUT = 4 * (ll)1e18;
vector<ll> seg, tag;
int h = 1;
void apply(int i, ll v) {
seg[i] += v;
if (i < h) tag[i] += v;
}
void push(int i) {
if (tag[... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = 998244353ll;
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... | //#include <GOD>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define pb push_back
#define len length
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define freo freopen("output.txt","w",stdout)
#define frei freopen("input.txt","r",stdin)
const ll inf=... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vec... | #include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32_t... |
#include <iostream>
#include <string>
#define rep(I, N) for (int I = 0; I < (N); ++I)
using namespace std;
int main() {
string s;
cin >> s;
string t = "ZONe";
int c = 0;
size_t pos = -1;
while ((pos = s.find(t, pos + 1)) != string::npos) {
c++;
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const ll inf = 1e18;
int n;
const int N = 2e5 + 5;
vector<string> arr;
set<string> dang;
void init() {
}
void input() {
cin >> n;
for (int i = 0; i < n; i++) {
... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
/... | #include<bits/stdc++.h>
using namespace std;
int main(){
int x,y;cin>>x>>y;
if(min(x,y)+3>max(x,y)){cout<<"Yes";}
else{cout<<"No";}
} |
/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);... | #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;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
#define rep(i, n) for (int i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(ll)(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 60) -123456789;
#define fastio cin.tie(0); ios_base::s... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int64_t N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> B(N);
vector<int64_t> max(N);
vector<int64_t> sum(N);
vector<int64_t> total(N);
for(int i=0;i<N;i++){
cin >> A[i];
if(i==0... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#ifdef dremix
#define p(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
long long m = 0;
long long y = 0;
int t = 0;
for(int i = 0; i < x; i++){
int a;
cin >> a;
if(i == 0) t = abs(a);
m += abs(a);
y += pow(a,2);
t = max(t,abs(a));
}
double yu = sqrt(y);
cout << m << endl... |
#include<bits/stdc++.h>
using namespace std;
int a[200010],pos[200010],vis[200010],f[200010];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,tot=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
pos[a[i]]=i;
}
for(int i=n;i>=1;i--){
while(pos[i]!=i){
... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
int a[N],b[N],c[N];
int main(void)
{
int n;
cin >> n;
for(int i = 1;i<=n;i++)
{
cin >> a[i];
}
for(int i = 1;i<=n;i++)
{
cin >> b[i];
}
for(int i = 1;i<=n;i++)
{
cin >> c[i];
}
vecto... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
//bool vis[1000];
//int x[]={1,-1,0,0};
//int y[]={0,0,1,-1};
//int f=0;
//"'';
int main(){
ll n,k;
cin>>n>>k;
ll sum=3*n;
vector<vector<ll> > dp(4,vector<ll>(sum+1,0));
vector<vector<ll> > sm(4,vector<ll>(sum+1,0));
dp[0][... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
long long N, K; cin >> N >> K;
long long A[3000010] = {};
long long S[3000010] = {};
for(long long i = 3; i <= N+2; i++){
A[i] = (i-1) * (i-2) / 2; S[i] = A[i] + S[i-1];
}
for(long long i = N+3; i ... |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
bool testOverlap(ll x1, ll x2, ll y1, ll y2) {
return (x1 >= y1 && x1 <= y2) ||
(x2 >= y1 && x2 <= y2) ||
(y1 >= x1 && y1 <= x2) ||
(y2 >= x1 && y2 <= x2);
}
bool is_overlapping(double x1,double x2,double ... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#define debug(x) \
for(auto element:x) \
cout<<element<<" "; \
cout<<endl
#define debugp(x) \
for (auto element : x) \
cout << element.first ... |
#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 all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vec... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define int long long
#define pb push_back
#de... |
#include<iostream>
#include<vector>
#include<unordered_set>
std::vector<int> diameter_path(const std::vector<std::vector<int>> &g){
const int n=g.size();
std::vector<int> d(n);
std::vector<int> par(n);
const auto dfs=[&](auto &Self,int v,int p,int pval)->void{
par[v]=p;
d[v]=pval;
... | #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <functional>
void solve() {
int n;
std::cin >> n;
std::vector<int> a(n), b(n);
std::vector<int> in(n, -1);
std::vector<int64_t> ans(n + 1, 0);
std::vector<std::pair<int, int>> io(n, std::pair<int, int>(-1, -1));
std::vector... |
#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<int, int>;
int n;
struct xyr {
int x;
int y;
int r;
};
struct sq {
int x1;
int y1;
int x2;
int y2;
int s;
};
vector<xyr> ad;
vector<sq> ans;
clock_t start;
vector<vector<i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vd = vector<double>;
using vp = vector<P>;
using vs = vector<string>;
using pq = priority_queue<int... |
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(a) (ll)a.size()
#define F first
#define S second
#define INF 2000000000000000000
#define popcount(x) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... |
#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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef tuple<int, int, int> tiii;
typedef tupl... |
// Problem: B - A^B^C
// Contest: AtCoder - AtCoder Regular Contest 113
// URL: https://atcoder.jp/contests/arc113/tasks/arc113_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod=1000000007;
#d... | #include<iostream>
using namespace std;
long long int MOD = 10;
long long int POW(long long int n,long long int k){
long long int r;
if(k==0)return 1;
r=POW(n,k/2)%MOD;
r=(r*r)%MOD;
if(k%2)r=(n*r)%MOD;
return r;
}
int main(){
long long int A,B,C,bc;
long long int mod[10]={1,1,4,4,2,1,1,4,4,2};
cin>>A>>B>>C;A%=... |
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
#define rrep(i, a, b) for(int i ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int get() {
int x = 0, f = 1; char c = getchar();
while(!isdigit(c)) { if(c == '-') f = -1; c = getchar(); }
while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); }
return x * f;
}
const int N = 114514;
int n, t;
int bin[N];
int gcd(int x, int... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll int
#define ld long double
#define For(i,x,y) for(ll i = (ll)(x);i <= (ll)(y);++i)
#define FOr(i,x,y) for(ll i = (ll)(x);i >= (ll)(y);--i)
#define rep(i,x,y) for(ll i = (ll)(x);i < (ll)(y);++i)
#define fi first
#define se second
#defi... |
#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 <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define setIO(x) freopen(x".in", "r", stdin), freopen(x".out", "w", ... |
#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 <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
/*
Saturday 13 March 2021 05:51:34 PM IST
@uthor::astrainL3gi0N
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef std::vector<int> vi;
typedef std::vector<ll> vll;
typedef std::pair<int,int> ii;
#define debg(x) std::cerr<<(#x)<<" => "<<x<<'\n';
#define debgg(x,y) std::cerr<<(#... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;
cin >> n;
for(int i= 1;i <= n;i ++){
int p = n-i;
if(p > 0)ans ++;
}
cout <<ans;
return 0;
} |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
double a,b,c,d;
cin>>n>>a>>b>>c>>d;
double p,q,r,s;
p=(a+c)/2;
q=(b+d)/2;
r=(a-c)/2;
s=(b-d)/2;
double co=cos(2*M_PI/n);
double si=sin(2*M_PI/n);
double x=p+co*r-si*s;
double y=q+co*s+si*r;
cout<<x<<" "<<y<<endl;
}... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = long long; using ull = unsigned long long; using pll = pair<ll,ll>; const ll INF = 4e18;
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void p... |
# include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN = 100000+5;
//ll a[mxN];
int sumOfDigits(int n){
int ret = 0;
while(n > 0){
ret += n%10;
n/=10;
}
return ret;
}
int main()
{
int a,b;cin>>a>>b;
cout<<std::max(sumOfDigits(a),sumOfDigits(b));
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... |
#include <bits/stdc++.h> // This will work only for g++ compiler.
#define for0(i, n) for (int i = 0; i < (int)(n); ++i) // 0 based indexing
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i) // 1 based indexing
#define forc(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i) // closed interver from l to r r inc... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... |
#include <iostream>
#include <vector>
#include <string>
#include <map>
using namespace std;
vector<long> a(1000000, 0);
vector<long> b(1000000, 0);
vector<long> c(1000000, 0);
int main()
{
long n;
long t;
cin >> n;
for (int i=0; i<n; i++)
{
cin >> t;
a.at(t) += 1;
}
for (int ... | #include <iostream>
#include <cmath>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <bitset>
#include <complex>
#include <numeric>
#include <string>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
u... |
#include <bits/stdc++.h>
using namespace std;
pair<long, long> exact(const long &B, const long &C) {
const auto n = C / 2;
if (C % 2) {
return {-B - n, -B + n};
} else {
if (!C)
return {B, B};
return {B - n, B + n - 1};
}
}
int main() {
long B, C;
cin >> B >> C;
const auto [a, b] =... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
#endif
int x , y; cin >> x >> y;
if( x == y) cout << x; else cout << 3 - x - y ;
return 0;... |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int N,M;
vector<pii>adj[2005];
int taka[2005];
bool vis[2005];
int bfs(int s)
{
fill(vis+ 1, vis + N + 1, false);
fill(taka + 1, taka + N + 1, 0);
priority_queue<pii, vector<pii>, greater<pii> >q;
q.push({0,s});//node taka;
whi... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 1600008
#define mod 998244353
#define f first
#define s second
ll arr[sz+10],brr[sz+10];
ll num=1;
char c[sz];
std::vector<ll> v[34];
long long binpow(long long a, long long b,long long mod1) {
a %= mod1;
long long res = 1;
wh... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#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 FORA(i,I) for(const auto& i:I)
//x:コンテナ
#define ALL(x) x.begin... | //##### ##### ##### ##### ##### # ##### # #//
//# # # # # # # # # # # ## ##//
//##### ##### ##### # ##### # ##### # # #//
//## # # # # # # # # # # #//
//# # # # # # # # # # # ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<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 main(){
string S; cin>>S;
... | #include "bits/stdc++.h"
using namespace std;
int main()
{
bool prepend = false;
string S;
cin >> S;
deque<char> ans;
for (int i = 0; i < S.length(); i++)
{
if (S[i] == 'R')
{
prepend = !prepend;
continue;
}
if (prepend)
{
... |
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
template <typename T>
inline void read(T&x){
x=0; char temp=getchar(); bool f=false;
while(!isdigit(temp)){if(temp=='-') f=true; temp=getchar();}
while(isdigit(temp)){x=(x<<1)+(x<<3)+temp-'0'; temp... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=998244353;
int f[105][10005],sum;
int n,w[105],p[105];
void add(int &x,int y){x+=y;if (x>=M)x-=M;}
int main(){
cin >> n; f[0][0]=1;
p[0]=1; for (int i=1;i<=n;i++) p[i]=1ll*p[i-1]*i%M;
for (int i=0;i<n;i++) cin >> w[i];
for (i... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fr(i,n) for(int i=0;i<(n);++i)
#define Fr(i,n) for(int i=1;i<=(n);++i)
#define ifr(i,n) for(int i=(n)-1;i>=0;--i)
#define iFr(i,n) for(int i=(n);i>0;--i)
using Graph = vector<vector<int>>;
int main(){
cin.tie(nullptr);
ios::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind
{
vector<int> par; //par[i]はiの親の番号
UnionFind(int N) : par(N)
{
for(int i = 0; i < N; i++) par[i] = i; //最初は全て根として初期化
}
int root(int x) //データxが属する木の根を再帰で得る root(x)={xの木の根}
{
if(par[x] == x) return x;
return par[x] = root(par[x]... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
ll n, x;
cin >> n >> x;
V<ll> v(n), p(n);
rep(i, n) cin >> v[i] >> p[i]... | #include <iostream>
using namespace std;
int main()
{
int n,x,v,p;
int cnt = 0;
bool notdrk = true;
cin>>n>>x;
int actx = x*100;
for(int i = 0; i<n; i++){
cin>>v>>p;
cnt += p * v;
if(cnt > actx and notdrk == true){
cout<<i+1;
notdrk = false;
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(void){
ll N, ans;
vector<int> P;
cin >> N;
P.resize(N + 1);
ans = 1;
for (int i = N; i > 1; i--){
int tmp = i;
for (int j = 2; j * j <= i; j++){
... | #include<bits/stdc++.h>
#define mx 100005
#define lli long long int
#define ulli unsigned long long int
#define mset(a,b) memset(a, b, sizeof(a))
#define infile freopen("in.txt", "r", stdin);
#define outfile ... |
#include<iostream>
using namespace std;
int main(){
float 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;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using namespace std;
int main() {
//input
int A, B;
cin >> A >> B;
//calc
int C = A + B;
int answer = 0;
if ( C >= 15 && B >= 8 ) {
answer = 1;
}
else if ( C >= 10 && B >= 3 ) {
answer = 2;
}
else if ( C >= 3 ) {
... |
#include<bits/stdc++.h>
using namespace std;
#define forr(i,a,n) for(long long int i=a; i<n; i++)
#define loop(i,a,n) for(long long int i=a; i>=n; i--)
int main()
{
ios_base :: sync_with_stdio(false),cin.tie(NULL);
int a, b, c, aa, flag=0;
cin>>a>>b>>c;
aa=a;
int x1=0, y1=0;
forr(i, 0, b)
{
int x, y... | #include <bits/stdc++.h>
using namespace std;
#define LL long int
#define MOD const LL 1000000007;
int ans = 0;
int main(){
int n,m,t;
cin >> n >> m >> t;
vector<int> a(m);
vector<int> b(m);
int max = n;
for(int i = 0; i < m; ++i){
cin >> a[i] >> b[i];
}
int x = 0;
fo... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define SZ(x) ((int)x.size())
#define ALL(x) (x).begin(),(x).end()
using namespace std;
t... | //缓缓飘落的枫叶像思念，我点燃烛火温暖岁末的秋天。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e6;
ll n,a[1000][1000];
ll c[N],d[N];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
int flag=1;
ll g=1e10+2;
for(int i=1;i<=n;i++)
... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define int long long
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
c *= 1000;
bool z = false;
int l, r;
for (int i = 1; i <= c; i++) {
l = i*a;
r = i*b;
if (l <= c && c <= r) {
z = true;
break;
}
}
if (z) {
int x = (c / b) + (c % b > 0);
int y = c / a;
cout <... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for(int i = (int)(a); i <= (int)(b); ++i)
#define FORR(i, a, b) for(int i = (int)(a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
using ll = long long;
using VI = vector<int>;
using VL ... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll,ll>;
using pi = pair<int,int>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n)... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... |
#include <bits/stdc++.h>
using namespace std;
constexpr char LF = '\n';
template <typename T = int>
constexpr T INF()
{
return numeric_limits<T>::max();
}
template <typename OutputIterator>
void read(OutputIterator first, OutputIterator last)
{
for (auto p = first; p != last; p = next(p)) cin >> *p;
}
templ... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
#include<vector>
#include<algorithm>
constexpr unsigned long long MOD = 998244353;
constexpr unsigned long long IM = 18479187003;
constexpr unsigned long long MOD32 = 665496236;
unsigned long long dp[500... |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
using namespace std;
int main(){
ll int N;
string S;
cin... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define endl '\n'
#define br cout<<endl
#define mem(a) memset(a,0,sizeof(a))
const double pi=3.141592653589793238;
#define d(x) cout<<x<<endl;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
ll N,W;
cin>>N>>W;
vector<ll> A(2*100000+1);
rep(i,2*100000+1)A[i]=0;
rep(i,N){
ll S,T,P;
cin>>S>>T>>P;
A[S]+=P;
A[T]-=P;
}
bool check=true;
ll temp=0;
rep(i,... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define ALL(x) (x).begin(),(x).end()
template<class T>bool umax(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int a, b, c;
cin >> a >> b;
c = a + b;
if (c >= 15 && b >= 8) cout << 1 << endl;
else if (c >= 10 && b >= 3) cout << 2 << endl;
else if (c >= 3) cout << 3 << endl;
... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b;
cin >>... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll LINF = 1e18;
template <class T>
void get_uni... | #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... |
#include <bits/stdc++.h>
#define F first
#define S second
#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 bck(i, a, b) if ((i) >= (a) && (i) < (b))
#define trav(x, a) for (auto &x : (a))
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end(... | /* aman6213*/
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define big(x) greater<x>()
#define sp fi... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
typedef long long LL;
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << 21 - a - b - c << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define vi vector<int>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define INF (int)1e9
#define fora(i,a,b) for(ll i=a;i<b;i++)
#define forn(n) for(ll i=0;... |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
constexpr long double eps = 1e... |
#include <bits/stdc++.h>
using namespace std;
//DEFINE and TYPEDEF--------------------------------------------------------------
// For actual content check from line 37
#define FORZ(i,n) for(lld i=0;i<(lld)n;++i) //for - zero
#define FORG(i,a,n) for(lld i=(lld)a;a<n?i<(lld)n:(lld)n<i;a<n?++i:--i) //for - general
#d... | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14
/**#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unro... |
#line 1 "Contests/AtCoder_agc054/agc054_a/main.cpp"
using namespace std;
#line 2 "library/bits/stdc++.h"
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include ... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
long N;
string s;
deque<char> deq;
cin >> N;
cin >> s;
for (long i = 0; i < N; i++)
{
deq.push_back(s.at(i));
if (deq.size() >= 3 && deq.at(deq.size()-3) == 'f' && deq.at(deq.size()-2) == 'o' && deq.back() == 'x')
{
... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cctype>
#include <cmath>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <queue>
#include <ctime>
#include <cassert>
#define _for(i,... | #include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int... |
#include<bits/stdc++.h>
using namespace std;
#define Ff(i,j,n) for (i = j ; i < n; i++)
#define Fb(i,j,n) for (i = n-1 ; i >= j; i--)
#define pb push_back
#define ff first
#define ss second
#define pi 3.14159265358979323846
#define all(x) x.begin(), x.end()
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int a, b;cin>>a>>b;
if(a==b) cout<<a;
else cout<<3-a-b;
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout); ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool cmp(char x,char y){
return x>y;
}
int main()
{
ll n,k;
const char *c1;
const char *c2;
scanf("%lld%lld",&n,&k);
ll ans=n;
for(int i=1;i<=k;i++){
string s=to_string(ans);
sort(s.begin(),s.end());
ll b;
... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
//wierd debugging stuff
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeo... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
const ll mod = 1e9... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int N;
cin >> N;
N *= 2;
vector<long long int> div(0);
for(long long int i=1;i<=sqrt(N);i++){
if(N%i == 0){
div.push_back(i);
if(i*i != N) div.push_back(N/i);
}
}
long long int cnt=0;
long long int M = div.size();
... |
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define All(a) a.begin(), a.end()
#define us unordered_set
#define eb emplace_back
#define pb push_back
#define pf push_front
#define ll long long
#define vt vector
#define mod 1000000007
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin ... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplac... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<int> P(N);
for(int i=0;i<N;i++) cin>>P.at(i);
int ans=0;
set<int> X;
for(int i=0;i<N;i++){
if(!X.count(P.at(i))) X.insert(P.at(i));
if(ans==P.at(i)) while(X.count(ans)) ans++;
cout<<ans<<endl;
}
} | #include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[100000];
pair<int, int> a(0, -1), b(0, -1);
for (int i = 0; i < pow(2, N); i++) {
cin >> A[i];
if (i < pow(2, N) / 2) {
if (A[i] > a.first) {
a.first = A[i];
a.second = i + 1;
}
... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
t... | #include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... |
#include <bits/stdc++.h>
#include <climits>
using namespace std;
template<class T>
using V = vector<T>;
template<class T>
using VV = V<V<T>>;
using ld = long double;
#define ll long long
using ull = unsigned ll;
using PLL = pair<ll, ll>;
using VLL = V<ll>;
using VB = V<bool>;
using VVB = VV<bool>;
using VVLL = VV<ll... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int n,k,i;
cin>>n>>k;
int t[n+1][n+1],m=0,a[n+2];
for(i=1; i<=n; i++)
for(int j=1; j<=n; j++)
cin>>t[i][j];
for(i=1; i<=n; i++)
a[i]=i;
a[n+1]=1;
int ans;
do{
ans=0;
for(int i=1; i<=n; i++) ans+=t[a[i]][a[i+1]];
if(... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long N,i,count = 0,count1 = 0,temp,temp1;
cin>>N;
bool v[N+1] = {false};
for(i = 1; i <= N; i++)
{
temp = i;
while(temp != 0)
{
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a=0;
for(int i=1;i<=n;i++){
int x=i;
int y=i;
bool z=1;
while(x>0){
if(x%10==7) z=0;
x/=10;
}
while(y>0){
if(y%8==7) z=0;
y/=8;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
cout << n - 1 << endl;
return 0;
} | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
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 co(x) cout << (x) << "\n"
#define cosp(x)... |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
// xのn乗
long long powmod(long long x, long long n) {
if (n == 0) return 1;
if (n == 1) return x % MOD;
if (n % 2 == 1) return (x * powmod(x, n - 1)) % MOD;
long long t = powmod(x, n / 2);
return (t * t) % MOD;
}
int main() {
long l... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using db = double;
using ldb = long double;
#define _for(i, l, r) for (auto i = (l); i <= (r); ++i)
#define _rfor(i, r, l) for (auto i = (r); i >= (l); --i)
const int N = 5e3 + 5;
const int MOD = 1e9 + 7;
i64 qpow(i6... |
#include <bits/stdc++.h>
using namespace std;
#define vll vector<long long>
#define mll map<long long,long long>
#define pll pair<long long,long long>
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 9... | #include<bits/stdc++.h>
#define int long long
#define ll int
#define itn int
#define ld long double
#define all(c) c.begin(),c.end()
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int,int>
#define rep(i, n) for(int i = 0 ; i < n ; i++ )
#define repu(i, a, b) for(int i = a; i <=b; ++i)
#define ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long double n,m;
cin>>n>>m;
long double d=n-m;
long double e=d/n;
long double f=e*100;
cout<<f;
return 0;
} |
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define rsrt(v) sort(v.begin(), v.end(), greater<int>())
#define rsrtl(v) sort(v.begin(), v.end(), greater<ll>())
#define fi(i, a, b) for (int i = a; i < b; i++)
#define fll(i, a, b) for (ll i = a; i < b; i++)
#define srt(v... | //----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
type... |
#include <bits/stdc++.h>
using namespace std;
#define MS(a, b) memset(a, b, sizeof(a))
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define EREP(a, b) for (reg... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 2e9;
const long long inf = 1LL<<60;
template<typename T>
bool chmin(T& x, const T& y){
if(x <= y) return false;
x = y;
return true;
}
template<typename T>
bool chmax(T& x, const T& y){
if(... |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b ;
cin >> c >> d ;
cout << (a*d) - (c*b);
return 0;
} | #include<iostream>
#include<string>
#include<cmath>
using namespace std;
long long int R,X,Y,ans,p;
double q;
int main(){
cin>>R>>X>>Y;
p=sqrt(X*X+Y*Y)/R;
if(R*p!=sqrt(X*X+Y*Y))p++;
if(p==1){
if(sqrt(X*X+Y*Y)!=R)p++;
}
cout<<p<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define endl "\n"
ll mod=1000000007;
ll arr[10][10],n,k;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll finds(set<int> st,ll sum,ll prev)
{
//cout<<"yo "<<st.size()<<" "<<prev<<" "<<sum<<endl;
if(st.size()=... | #include <bits/stdc++.h>
#define Fr(i,a,b) for(int i=(a);i<=(b);++i)
#define Fl(i,a,b) for(int i=(a);i>=(b);--i)
#define Fe(i,u) for(int i=H[u];i;i=e[i].nx)
#define ms(a,x) memset((a),(x),sizeof(a));
using namespace std;
int N,G[15][15],K,vis[15],ans;
void dfs(int s,int x,int sum)
{
if(x==N)
{
if(G[s][1]+sum==K)++a... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1000;
const char str[10]=" atcoder";
char s[N+9];
int n;
void into(){
scanf("%s",s+1);
n=strlen(s+1);
}
int ans;
void Get_ans(){
ans=0;
int flag=0;
for (int i=1;i<=n&&i<=7;++i)
if (s[i]>str[i]) return;
else if (s[i]<str[... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, A, B) for (int i = (A); i < (int)(B); i++)
#define rep(i, n) REP(i, 0, n)
void Main()
{
string S;
cin >> S;
string new_S = S.substr(1);
new_S = new_S + S.at(0);
cout << new_S << endl;
}
int main()
{
Main();
... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include <bits/stdc++.h>
/** 幾何ライブラリ **/
#include <complex>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, mod = 998244353;
int fact[N], inv[N];
vector<int> primes[N];
int mul(int a, int b)
{
return 1ll * a * b % mod;
}
int add(int a, int b)
{
return (a + b) % mod;
}
int fp(int b, int p)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
}
return false;
}... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define rng(i,m,n) for(ll (i)=(m);(i)<(n);++(i))
#define rrep(i,n) for(ll... | // In the name of god
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define debug(x) cerr << #x << " : " << x << "\n"
#define use_file freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
using namespace s... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x...) cerr << "[" << #x << "]: " << x << "\n";
using ll = long long;
using ld = long double;
using ii = pair<int,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const int N=5e5+1;
int n;
int a[N],b[N];
deque<int>p,q;
int main(){
ios::sync_with_stdio(false);
cin >> n;
int z=0;
for(int i=1; i<=n ;i++){
char c;cin >> c;
if(c=='1') p.push_back(i);
}
for(int i=1; i<=n ;i+... |
// Created by ash_98
#include<bits/stdc++.h>
using namespace std;
#define mx 3005
#define ll long long
#define mod 1000000007
ll ar[mx];
char ch[mx];
int n,m,ii,k;
vector<pair<int,int>>g[mx];
int add(int a,int b)
{
a+=b;
if(a>=mod)a-=mod;
return a;
}
int dp[mx][mx];
bool vis[mx][mx];
ll pre[mx];
void so... | #include <bits/stdc++.h>
using namespace std;
int n, t;
void bit(vector<int> v, vector<int> &s) {
int l = v.size();
for (int mask = 0; mask < (1 << l); mask++) {
int sum = 0;
for (int i = 0; i < l; i++) {
if (mask & (1 << i)) sum += v[i];
if (sum > t)
goto... |
#include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
using namespace std;
typedef long lo... | #include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#define int long long
#define ri register
#define mk make_pair
#define fi first
#define se second
#define pb push_b... |
#include <bits/stdc++.h>
using namespace std;
const long nPrime = 1000000007;
//const long nPrime = 998244353;
int main() {
long n;
cin >> n;
vector<long> viNum(n);
for(long i = 0; i < n; i++){
cin >> viNum[i];
}
viNum.push_back(0);
sort(viNum.rbegin(), viNum.rend());
long nAns =... | #include <bits/stdc++.h>
using namespace std;
#define stp(var, init, end) for (auto var = init; var < end; ++var)
#define stpe(var, init, end) for (auto var = init; var <= end; ++var)
#define ll long long
#define MOD 1000000007
int main(void)
{
int n;
cin >> n;
set<int> bui;
int a;
stp(i, 0, n)
... |
#include <iostream>
#include <string>
int main(void){
std::string s;
std::cin >> s;
for(int i = 0; i < s.length(); i++){
if(s[i] == '.') break;
std::cout << s[i];
}
std::cout << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define st first
#define nd second
#define endl '\n'
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) cerr << #x << " is "; for(auto&e: (x)) cerr << e << ' '; cerr << '\n'; //vector, set
#define... |
#include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
const int INF = 1e9;
const int N = 100005;
/* => int overflow
=> array bounds
=> special cases (n=1?)
=> do smth instead of nothing
=> stay organized
=> WRITE STUFF DOWN DON'T GET STUCK ON ONE APPROACH... | #include <iostream>
#include <string>
#include <list>
using namespace std;
int main() {
string input;
getline(cin, input);
for(int i=0; i<input.size(); i++)
if(input[i]!='.')
cout << input[i] << "";
else
break;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define rep(i,a,n) for(int i = a;i < n;i++)
#define vec vector<int>
#define read(v,n) rep(i,0,n) {cin... | #include <bits/stdc++.h>
using namespace std;
int mas[200000];
int main()
{
vector<int> ans;
int n;
cin>>n;
int n1=n;
for(int i=0; i<n; i++) cin>>mas[i];
for(int i=n-1; i>=0; i--){
if(mas[i]==n1){
int n2=0;
for(int j=i+2; j<n1; j++){
if(mas[j]!=j)... |
#include<iostream>
using namespace std;
int main()
{
string s;
int n,m;
cin>>n>>m>>s;
for(int i=0;i<s.size();i++)
{
if(s[i]=='x'&&m!=0)
{
m--;
}
else if(s[i]=='o')
{
m++;
}
}
cout<<m;
return 0;
} | //This Code was made by Chinese_zjc_.
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include... |
#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int max_n = 2100;
const int max_len = 631441 + 100000;
const int max_sum = 1e7+100;
const int offset = 1e5+10;
const int inf = 1e18;
const int Mod = 3e1... | /*
ID: hedichehaidar
TASK: photo
LANG: C++11
*/
#include<bits/stdc++.h>
typedef long long ll;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
#define ss second
#define ff first
#define all(x) (x).... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> H(N), W(M);
for (int i = 0; i < N; i++) cin >> H.at(i);
for (int i = 0; i < M; i++) cin >> W.at(i);
sort(H.begin(), H.end());
vector<long> L, R;
for (int i = 0; i + 1 < N; i += 2) L.push_back(H.at(i + 1) -... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pr pair<ll, ll>
#define vct vector<ll>
#define vpr vector<pr>
void prn(ll n){ cout << n << "\n";}
void prs(string s){cout << s << "\n";}
void prv(vct v, ll limt = -1){
if (limt == -1)limt = v.size();
for (ll i = 0; i < limt; i++)cout <<... |
#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 gc getchar_unlocked
#define fo(i,k,n) for(i=k;i<n;i++)
#define loop(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) pri... |
#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
string S;
cin >> S;
deque<char> q;
bool rev = false;
for(int i = 0;i<S.size();++i){
if(S[i]=='R') rev ^= 1;
else if(rev) q.push_front(S[i]);
else q.push_back(S[i]);
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, ... |
#pragma region おまじないα ver1.02
//#define _CRT_SECURE_NO_WARNINGS
//#pragma warning(disable : 4996)
//#define int long long;
#pragma region 変化しないおまじない
#include "bits/stdc++.h"
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#p... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,x;
string s;
cin >> n >> x >> s;
for(int i=0; i<n; i++){
if(s[i]=='x'){
if(x>0) x--;
}
else x++;
}
cout << x << endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll maxn=3e5+10;
const ll mod=1e9+7;
const ll m2=1e9+7;
const ll INF64 = ll(1e18);
const ll max2=10500000;
const ll N = 1000001;
const ll MAXN=2e5+10;
const ll ALPHABET_SIZE = 2;
vector<pair<int,int>> adj[maxn];
int main... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, j, k) for(int i = j; i < k; i++)
#define print(x) cout << x
#define newline cout << endl
#define space cout << ' '
#define INF 1000000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,a,b;
long long dp[66000][10][20];
int main(){
cin>>n>>m>>a>>b;
dp[0][0][0]=1;
for(int i=1;i<(1<<n*m);i++)
for(int j=0;j<=a;j++)
for(int k=0;k<=b;k++){
if(!j&&!k)continue;
if(k){
for(int g=0;g<n*m;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define pb push_back
#define mp make_pair
const int INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
const int MAX_N = 17;
int H,W,A,B;
ll rec(int i, int j, int a, int b, bool used[MAX_N][MAX_N])
{
if(j == W){
return rec(i+1,0,a... |
#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 ;
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define fi first
#define se second
const int N=2010;
int n,m,k,a[N];
ll f[1<<21][2];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;... |
//
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//
//#pragma GCC optimize(3,"Ofast","inline")
//#include<unordered_map>
//#include<unordered_set>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<functional>
#include<cstring>
#include<string... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll solve() {
ll L, R;
cin >> L >> R;
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n,m;
cin>>n>>m;
map<int,vector<int>>mp;
rep(i,m){
int x,y;
cin>>x>>y;
mp[x].push_back(y);
}
set<int>s;
s.insert(n);
for(auto p:mp){
vector<int>add;
for(auto y:p.second){
if(s.co... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#include <string>
#include <sstream>
#include <iomanip>
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define r... |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#def... | // Problem: A - Difference Max
// Contest: AtCoder - AtCoder Beginner Contest 196
// URL: https://atcoder.jp/contests/abc196/tasks/abc196_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Parsed on: 20-03-2021 17:30:12 IST (UTC+05:30)
// Author: Kapil Choudhary
// ****************************************************... |
// abc196_d
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../../debug_util/cxx-prettyprint/prettyprint.hpp"
#include "../../debug_util/rng.hpp"
#include "../../debug_util/timer.hpp"
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>... | #include <bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
int h, w;
int used[16][16];
ll dfs(int i, int j, int a, int b) {
if (a < 0 || b < 0) return 0;
if (j == w) j = 0, ++i;
if (i == h) return 1;
if (used[i][j]) return dfs(i, j + 1, a, b);
ll res = 0;
used[i][j] = true;
res += dfs(i, ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define loop(i, start, end) for (int i = start; i <= end; i++)
#define rloop(i, start, end) for (int i = start; i >= end; i--)
#define vi vector<int>
#define vec(x) vector<x>
#define sz(v) (int)v.size()
#define UB upper_bound
#define LB lower_bound
#de... | #include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <numeric>
#include <iterator>
#include <algorithm>
#include <cmath>
#include <chrono>
#include <cassert>
using namespa... |
#include<bits/stdc++.h>
using ll= long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define ALL(x) x.begin(),x.end()
#define INF (int)1e9 //10^9:∞
#define LLINF (long long)1e12
#define MOD (int)1e9+7 //10^9+7:合同式の法
#define PI 3.141592653589
#define PB push_back
#define fi ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,k;
cin >> n >> k;
cout << n / k << endl;
} |
# include <bits/stdc++.h>
# define ull unsigned long long
# define ll long long
# define double long double
# define pll pair<ll,ll>
# define pb push_back
# define fi first
# define se second
# define mp make_pair
# define all(x) x.begin(),x.end()
# define fill(a,b) memset(a,b,sizeof(a))
# define gcd(m,n) __gcd(m, n)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define lcm(a,b) ((a*b)/__gcd(a,b))
#define optimize ios_base::sync_with_stdio(false);cin.tie(NULL);
#define sqr(a) ((a)*(a))
#define MAX 15000
#define max5 100000
#define max6 ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define PI 3.14159265358979
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t=1;
//cin>>t;
while(t--){
ll a,b,c;
cin>>a>>b>>c;
if(a*b>0)
{
if(c%2==0)
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int minimum =-1;
cin>> N;
for (int i=0 ;i< N ;i++){
int a1 ,p1 ,x1;
cin >> a1 >> p1 >> x1;
if (a1<x1){
minimum = p1;
break;
}
}
if (minimum !=-1){
for (int i=0; i<N;i++){
int a2, p2, x2;
cin ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.