code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
#define all(v) (v).begin(),(v).end()
#define f first
#define s second
#define _ << ' ' <<
#define _n << '\n';
#define print(arr) for(int i : arr) cout << i << ' '; cout << '\n';
using namespace std;
pair<long long int,long long int> go(int pos, vector<int> &vec){
if(pos == 0){
if... |
#include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define int long long
using namespace std;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (ll)(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 >= (l... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
double x, y;
complex<double> a, b;
cin >> n;
cin >> x >> y;
a = {x, y};
cin >> x >> y;
b = {x, y};
auto m = (a + b) / 2.0;
auto res = m + (a - m) * polar(1.0, M_PI * 2.0 / n);
cout << fixed << setpreci... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using P = pair<int, int>;
const ll INF_L = 1LL << 60;
const int INF_I = 1 << 30;
const int MOD = (int)1e9 ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
long t, N; cin >> t >> N;
long l=1, r=1e15;
while(r-l>1){
long x=(l+r)/2;
if(((100+t)*x)/100-x<N){ l=x; }else{ r=x; }
}
cout << ((100+t)*r)/100-1 << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t t, n;
cin >> t >> n;
if (100 * n % t == 0) {
cout << n - 1 + 100 * n / t << endl;
}
else { cout << n + 100 * n / t ;}
} |
#define ii pair<int , int>
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<ii> edge[N];
int label[N];
bool check[N];
void dfs(int u)
{
for (auto adj : edge[u])
{
int v = adj.first;
int w = adj.second;
if (label[v] == 0)
{
if (label[u]... | #define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <new>
#include <cstdint>
#include <cctype>
#include <cst... |
#include<iostream>
using namespace std;
int main(){
int n,point,i;
string str;
cin>>n>>point>>str;
for(i=0;i<n;i++){
if(str[i]=='o') point++;
else{
if(point==0) continue;
else point--;
}
}
cout<<point<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define TEZ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define f(i,a,b) for(ll i=a;i<b;i++)
#define rf(i,a,b) for(ll i=a;i>=b;i--)
#define pb push_back
#define vi vector<pair<ll,ll>>
#define ff first... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vecto... | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define Rep(i,j,n) for (ll i=(ll)(j);i<=(ll)(n);++i)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.si... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<set>
#include<cstdlib>
#include<cmath>
#include<numeric>
#include<iomanip>
#include<functional>
#include<cstdlib>
#include<queue>
#include<deque>
#include<cassert>
#include<stack>
#include <iterator> //... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<set>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#defin... | #include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
typedef unsigned long long ull;
typedef long long ll;
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void sc(int &x){scanf("%d",&x);}
void sc(int &x,int &y){scanf("%d%d",&x,&y);}
void sc(int &x,int &y,int &z){scanf("%d%d%d",&x,&... |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int n, m;
cin >> n >> m;
vector <string> qw (n);
for (int i=0; i<n; ++i)
{
cin >> qw[i];
}
long long t=0;
for (int i=0; i<n; ++i)
{
for (int ii=0; ii<m; ++ii)
{
if (qw[i][ii]=='.')
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#include <iostream>
#include <cmath>
int main() {
int x, y;
std::cin >> x;
std::cin >> y;
std::cout << (std::abs(x-y) < 3 ? "Yes" : "No") << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vp = vector<pii>;
using vvi = vector<vi>;
#define rep(i, a, b) for (int i = a; i < (int) (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (int) (b); i--)
#define fore(i... |
#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
int main(void)
{
int n;
cin >> n;
cout << n - 1;
return 0;
} | #include<iostream>
using namespace std;
long long n;
void solve()
{
cout<<n-1<<endl;
}
int main()
{
while(cin>>n)
solve();
} |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N,K;
cin>>N>>K;
vector<vector<int>> A(N,vector<int>(N));
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cin>>A[i][j];
}
}
vector<int> kouho;
int left=-1,right=1e9+1;
while(right-le... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int l,r;
cin>>l>>r;
if(l==r){
cout<<0;return 0;
}
if(l==1)l++;
if(r-l==1){
cout<<1;return 0;
}
vector<int> d(r+1,0);
for(int i=2;i<=r;i++){
if(d[i]!=0)continue;
for(int j=i;j<=r;j+=i){
d[j]++;
}
for(int... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#define ull unsigned ... |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int N = 15;
char a[N];
int ans = 0;
int tr[N],cnt;
int st[N];
void dfs(int num)
{
if(num == 4)
{
bool fl = true;
for(int i = 1;i <= cnt;i++)
if(st[tr[i]] == 0)
{
fl = false;
break... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n; cin >> n;
int ans = 0;
for(int i = 1; i <= n; ++i){
int judge = 0;
int i2 = i;
while (i2){
if (i2%10 == 7) {
judge = 1;
break;
}
i2 /= 10;
}
i2 =... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll MOD=1e9+7;
ll exp(ll a,ll n){
if(n==0) return 1;
if(n==1) return a;
ll ans=exp(a,n/2);
ans*=ans;ans%=MOD;
if(n&1) ans*=a,ans%=MOD;
return ans;
}
void solve(){
int n,m;cin>>n>>m;
string s[n];
for(int i=... | //x<<y=x*2^y,x>>y=x/2^y
//1e5+3 is prime
// in a matrix, all elements of a primary diagonal have constant diff of coordinates
// and a secondary diagonal has constant sum of coordinates
//use ll() for using an integer in self-built fn
//(x&-x) bitwise and of (x and its 2's complement) returns (last set bit)
//eg if x=1... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
// aの逆元を計算する
ll modinv(ll a, ll mod)
{
ll b = mod, u = 1, v = 0;
while (b)
{
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
... | #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 T;
cin >> T;
vector<ll> L(T), R(T);
rep(i, T) cin >> L.at(i) >> R.at(i);
rep(i, T){
if(R.at(... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a+b>=15 && b>=8 ) cout<<1;
else if(a+b>=10 && b>=3) cout<<2;
else if(a+b>=3) cout<<3;
else cout<<4;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb pus... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Erep(i,n) for(int i = 0; i <= (n); ++i)
#define repS(i,s,n) for(int i = s; i < (n); ++i)
#define ErepS(i,s,n) for(int i = s; i <= (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#defin... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define mk make_pair
#define MOD 1000000007
#define pi 3.1415926536
/* BAAP BAAP HOTA HAI
AUTHOR- Devansh Nandasana*/
void adde(vector<ll> adj[],ll u,ll v)
{
adj[u].pb... |
#include<bits/stdc++.h>
using namespace std;
int main(){
char word[1000];
cin >> word;
string ans = "Yes";
for(int i=0;i<strlen(word);i++){
if(i%2){
if(word[i]<'A' || 'Z'<word[i]) ans = "No";
}else{
if(word[i]<'a' || 'z'<word[i]) ans = "No";
}
}
c... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long int n;
cin >> n;
long long int x = 0;
for (long long int i = 1; i <= n; i++) {
if (x + i >= n + 1) {
if (x + i == n + 1) {
x = i;
}
else {
x = i - 1;
}
break;
}
x += i;
}
cout << (n - x) + 1 << endl;
} |
#include <algorithm>
#include <iostream>
#include <vector>
#include <cstdint>
int main() {
int N;
std::int64_t X;
std::cin >> N >> X;
std::vector<int> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
std::int64_t best = X;
for (int k = 1; k <= N; ++k) {
std::vector<std::vector<int>> powe... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long; // int64_t
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
#define REP(i,m,n) for(int i = m; i <= (n); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i ... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint inf = 1LL << 60;
constexpr lint mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
lint x, y, a, b;
cin >> x >> y >> a >> b;
lint ret = 0;
for (int i = 0; i <= 60; ++i) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
int main()
{
ld k;
cin>>k;
string s,t;
cin>>s>>t;
s.erase(s.end()-1);
t.erase(t.end()-1);
vll v(9,k),w1(9,0),w2(9,0);
for(auto i:s)
{
ll a=i-'1';
v[a]--;
w1[a]++;
}
for(auto i:t)
{
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include<bits/stdc++.h>
using namespace std;
int b[200005];
int main()
{
int N,min=0;
cin>>N;
for(int i=1;i<=N;i++)
{
int n;
scanf("%d",&n);
b[n]++;
if(n==min)
{
for(int j=n;;j++)
{
if(b[j]==0)
{
min=j;
break;
}
}
}
printf("%d\n",min);
}
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string n;
getline (cin,n);
int s=0;
for (int i=0;i<(int) n.length();i++)
{
s+=((int) n[i]-'0');
}
if (s<3)
{
cout<<-1;
goto here;
}
else if (s%3==0)
{
cout<<0;
goto here;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
int length;
int count=0;
length = N.size();
int x=0;
for (int i=0;i<length-1;i++) {
if(N.at(length-1-i)=='0'){
count++;
}else{
break;
}
}
for (int i=0;i<1+(length-count)/2;i++){
if(N.at(i)!=N.at... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <functional> // for less
#include <iostream>
usin... | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define endl '\n'
using namespace std;
int Power(int Num,int Index){
int r=1 ;
for(int i=Index;i>0;i/=2,Num*=Num){
if(i%2==1){
r*=Num ;
}
}
return r ;
}
int Factorial(int Number){
int m=1;
f... |
#include<bits/stdc++.h>
namespace my_std{
using namespace std;
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,x,y) for (int i=(x);i>=(y);i--)
#define go(x) for (int i=head[x];i;i=edge[i].nxt)
#define templ templat... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
vector < int > G[3];
int n, pos_l, pos_r;
int id( char ch ) {
if( ch == 'R' ) return 0;
if( ch == 'B' ) return 1;
if( ch == 'G' ) return 2;
}
int Fabs( int x ) {
return x < 0 ? -x : x;
}
void work( int c, int val ... |
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
#define NDEBUG
#endif
#include<bits/stdc++.h>
#define int long long
#define LL long long
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<... | #include <iostream>
#include <vector>
#include <queue>
using pli = std::pair<int64_t, int>;
struct Edge {
Edge(int to, int t_p, int c) : to(to), t_point(t_p), cost(c) {}
int to, t_point, cost;
};
int64_t earliest_time(const std::vector<std::vector<Edge>>& graph,
int n, int from, int to) {
std... |
using namespace std;
#include <bits/stdc++.h>
#define ll long long
ll n,m;
struct Num{
ll a,b;
};
Num mul(Num x,Num y){
Num z;
z.a=x.a*y.a%m;
z.b=(x.a*y.a/m+x.a*y.b+x.b*y.a)%m;
return z;
}
Num qpow(ll x,ll y){
Num z={x%m,x/m%m},r={1,0};
for (;y;y>>=1,z=mul(z,z))
if (y&1)
r=mul(r,z);
return r;
}
int main(){... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int numwall,killo;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>killo>>numwall;
cout<<killo/numwall;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t; using Vll =vector<ll>; using VVll =vector<vector<ll>>;
template <class T> using Vec = vector<T>; template <class T> using VVec = vector<vector<T>>;
#define INF 9223372036854775807LL/2
void Z(ll i=-1){ if(i==-1)cout<<"Test"<<endl; else cout<<"Test"<<i<<e... | #include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename temp>using ordered_set = tree<temp, null_type, less_equal<temp>, rb_tree_tag,tree_order_statistics_node_update>;
//order_of_key(k) : Number of items s... |
#include <bits/stdc++.h>
using namespace std;
#define PRINT_YesNo(condition) cout<<((condition)?"Yes":"No")<<endl
#define PRINT_YESNO(condition) cout<<((condition)?"YES":"NO")<<endl
#define __MAGIC__ ios::sync_with_stdio(false);cin.tie(nullptr)
#define SET_PRECISION(x) cout<< fixed << setprecision((x))
typedef long l... | #include <iostream>
using namespace std;
int main() {
char a, b, c;
cin >> a >> b >> c;
cout << b << c << a;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int) n; i++)
using ll = long long;
template <class T>
using vt = vector<T>;
using vvi = vector<vt<int>>;
int my_sum(int n){
return (1+n)*n/2;
}
void solve(int *E, int a, int b, int k){
rep(i,k){
E[i] = i+1;
}
int tmp = 0;
... | #include <bits/stdc++.h>
using namespace std;
const long long mod1 = 1000000007;
using ll = long long;
long long pow(long x,long n){
long long ans = 1;
while(n != 0){
long long a = x;
long long z = 1;
while(z*2 <= n){
a *=a;
a=a%mod1;
z*=2;
}
... |
#include <bits/stdc++.h>
using ll = int64_t;
int main(){
ll n,m,q;
std::cin>>n>>m>>q;
std::vector<std::pair<ll,ll>> vw;
for(ll i=0;i<n;i++){
ll w,v;
std::cin>>w>>v;
vw.emplace_back(std::make_pair(v,w));
}
std::vector<ll> box;
for(ll i=0;i<m;i++){
ll tmp;
std::cin>>tmp;
box.emplac... | /*
Author : Nishant Gupta 2.0
*/
#include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define getcx getchar_unlocked
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MAX 100005
#define LOG_MAX 20
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL (LL(1e18)... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#ifdef WIN_32
#define getchar_unlocked _getchar_nolock
#endif
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_fron... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int m, h;
cin >> m >> h;
if(h % m == 0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define FI first
#define SE second
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define all(c) (c).begin(),(c).end()
#defi... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (a + b == c + d) cout << "Yes" << endl;
else if (a + c == b + d) cout << "Yes" << endl;
else if (a + d == b + c) cout << "Yes" << endl;
else if (a + b + c == d) cout << "Yes" << endl;
else if (a + b ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define v vector
#define umap unordered_map
#define pb push_back
#define mp make_pair
#define pob pop_back
#define db1(x) cout<<#x<<" = "<<x<<'\n'
#define db2(x, y) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<'\n'
#define db3(... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n; scanf("%d",&n);
vector<int> a(n),b(n),p(n);
rep(i,n) scanf("%d",&a[i]);
rep(i,n) scanf("%d",&b[i]);
rep(i,n) scanf("%d",&p[i]), p[i]--;
vector<int> inv(n);
rep(i,n) inv[p[i]]=i;
vector<int> q(n);
iota(... | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + ... |
#include<bits/stdc++.h>
using namespace std;
int n,q;
long long a[100010];
long long x[100010];
int main(){
cin>>n>>q;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)x[i]=a[i]-i;
long long id;
while(q--){
cin>>id;
long long ans;
if(id>x[n]){
ans=id-x[n]+a[n];
cout<<ans<<endl;
continue;
}
i... | #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 <iostream>
using namespace std;
int main()
{
int N, X;
cin >> N >> X;
X *= 100;
int x = 0;
for (int n = 1; n <= N; ++n)
{
int V, P;
cin >> V >> P;
x += V*P;
if (X < x)
{
cout << n << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fast_io cin.tie(0);ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"';}
string to_string(char s) { return string(1, s);}
string to_string(const char* s) { return to_string((string) s);}
string to_string(bool b) { return (b ? "true" : "fa... |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define pf push_front
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define fi first
#define se second
#define setbits(x) __builtin_popcount(x)
#define zerobits(x)... | #include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
using namespace std;
inline int read(){
char ch=getchar(); int w=1,c=0;
for(;!isdigit(ch);ch=g... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, a, b, d;
cin >> n;
vector<long long> c(n);
a = 0;
d = 0;
for(int i = 0; i < n; i++){
cin >> c[i];
a += c[i];
d += c[i]*c[i];
}
b = (a*a - d);
cout << (n-1) * d - b << endl;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
long long int n, ans = 0; cin >> n;
vector<long long int> a(n, 0);
unordered_map<long long int, long long int> Map;
for (int i = 0; i < n; i++) {
cin >> a[i];
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define REP_REV(i,a,b) for (int i = a; i >= b; i--)
#define what_is(x) cerr << #x << " is " << x << endl;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define rsz resize
#define f ... | //A
#include<bits/stdc++.h>
#define MAX 200000
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long a,b;
cin>>a>>b;
cout<<2*a+100-b<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
ll n, m, X, Y;
cin >> n >> m >> X >> Y;
vector<tuple<ll, ll, ll>> adj[n + 1];
for (ll i = 0; i < m; i++) {
ll a, b, t, k;
cin >> a >> b >> t >> k;
adj... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
c... |
#include <bits/stdc++.h>
using namespace std;
#define all(v) begin(v), end(v)
#define endl '\n';
#define int long long
#define pii pair<int, int>
#define sz(x) (int) x.size()
void test_case() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min({a, b, c, d}) << endl;
}
int32_t main() {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int mini = 100000;
for(int i=0, x; i<4; i++){
cin >> x;
mini = min(mini, x);
}
cout << mini << endl;
} |
#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<bits/stdc++.h>
#define int long long
#define N 100
#define P 1000000007
#define inf 999999999999999999
using namespace std;
int n,m,K,d[N+1],dq[N+1],g[N+1][N+1],ny2,ans[N+1],p,q;
int ksm(int x,int y){int nans=1;for(;y;y>>=1,x=x*x%P)if(y&1)nans=nans*x%P;return nans;}
int qny(int x){return ksm(x,P-2);}
struct ma... |
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
cout << N-1;
} | #include <bits/stdc++.h>
using namespace std;
#define oo 1e18
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) ((xxx... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i... | #include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> used(2 * N);
auto out = []() {
cout << "No" << endl;
exit(0);
};
REP(i, N) {
int A, B;
cin >> A >... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
#include<functional>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int maxn = 2e3 + 7;
const int mod = 1e9 + 7;
ll p[maxn * maxn];
char s[maxn][maxn];
int U[maxn][maxn],D[maxn][maxn],L[maxn][maxn],R[maxn][maxn];
int n,... |
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <set>
#include <tuple>
#include <cassert>
using namespace std... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
const int lim = 1000000007;
int main(){
int N, M;
cin >> N >> M;
vector<int> A(M), B(M);
rep(i, M){
int a, b;
cin >> a >> b;
a--, b--;
A[i] = a;
B[i... |
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <climits>
#include <stack>
using namespace std;
vector<int> G[100000];
const int INF = 0x3f3f3f3f;
... | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include <queue>
#include<sstream>
#include <stack>
#include <set>
#include <bitset>
#include<vector>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x)... |
#include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i,a, n) for(int (i) = (a); (i) < (n); (i)++)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T> void chmax(T& a, T b){ if(a<b){a=b;} }
template<class T> void chmi... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);++i)
using namespace std;
using ll=long long;
int main(){
int n,w; cin>>n>>w;
vector<ll> p(300000,0);
rep(i,n){
int a,b,c; cin>>a>>b>>c;
p[a]+=c;
p[b]-=c;
}
ll count=0;
rep(i,300000){
count+=p[i];
if(count>w){
cout<<"No"<<endl;
ret... |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int MOD = 998244353;
const int inv2 = 499122177;
const int N = 52;
int c[N * N][N * N] = {0};
int p[N * N][N * N] = {0};
int f[N * N] = {1};
void init() {
for (int i = 1, fac = 1; i < N * N; i++) {
f[i] = 1LL * f[i - 1] * i % MOD;
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
for(int i=0; i<N; i++){
int a = 2*i%N;
int b = (2*i+1)%N;
cout << a+1 << " " << b+1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while ('0'>ch||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int maxn=(2e5)+10;
int n;
ll a[maxn],a... |
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <ctime>
#include <map>
#include <fstream>
#include <unordered_map>
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define x first
#define y second
#define int int64_t
using namespace std;
t... | #include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
using namespace std;... |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 87;
int n, dp[N], sz[N];
vector<int> g[N];
void dfs(int u)
{
sz[u] = 1;
multiset<int> pq[2];
for (int v : g[u]) {
dfs(v);
sz[u] += sz[v];
pq[sz[v] % 2].insert(dp[v]);
}
dp[u] = 1;
int cur = -1;
while (pq... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(in... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
struct Edge {
int from, to;
Edge(int from, int to) : from(from), to(to) {}
};
vector<vector<Edge>> ReadUndirectedGraph(int n, int m, bool one_indexed=false) {
vector<vector<Edge>> graph(n);
for (int i = 0; i < m;... |
#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
#define For(i, a, b) for (int i = a; i <= (b); ++i)
#define Rof(i, a, b) for (int i = a; i >= (b); --i)
#define all(a) a.begin(), a.end()
#define ll long long
#define vi vector<int>
#define pii pair<int, int> pii
const int mod = 99824435... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pt;
#define MOD 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> ans(N, 2);
ans[0] = 1;
for(int i = 2; i <= N; i++) {
for(int j = 2; i * j <= ... |
#include <bits/stdc++.h>
using namespace std;
#define rep2(i,j,n) for (int i=j; i <=(int)(n); i++)
int main() {
int n,m,t,a,b,x;
cin >> n >> m >> t;
x=n;
b=0;
rep2(i,1,m) {
cin >> a ;
x-=a-b;
if(x<1){
cout << "No" << endl;
return 0;
}
cin >> b ;
x+=b-a;
x=min(n,x);
}
x-=t-b;
if(x<1) cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define all(v) v.begin(), v.end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
tem... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
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 INF 1000000000 //10... | #include<bits/stdc++.h>
using namespace std;
long long ara[2000006],tra[2000006];
int main()
{
int n,m,a,b,c,d,e,p,q,l,r,s,fr,sc,tr,sz=0,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
int x=0,y=0,cnt=0,res=0,ans=0,sum=0; int flg=0,flag=1,na=0,as=1;
vector<int>u,v,w; vector< pair<int,int> >vct; vector<s... |
/* _ _
|\ /
| \ /
| / / _
|/ \ \
| \ /
| \_/ */
#include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define vll vector <ll>
#define vss vector <string>
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll n, k;
cin >> n >> k;
for(int i=0; i<k; i++){
if(n%200 == 0) n /= 200;
else{
n = n * 1000 + 200;
}
}
cout << n << endl;
return 0;
} |
#include<cstdio>
using namespace std;
const int N = 2e5 + 10;
int d[N], n, h[200];
using LL = long long;
int main() {
scanf("%d", &n);
for(int i = 0; i < n; ++i) {
scanf("%d", d + i);
h[d[i] % 200] ++;
}
LL res = 0;
for(int i = 0; i < 200; ++i) {
res += (LL) h[i] * (h[i] - 1)... | #include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
const int mod=998244353;
LL po(int p){
if(p==0) return 1ll;
LL ret=po(p/2);
ret=ret*ret%mod;
if(p&1) ret*=2;
return ret%mod;
}
int main(){
int n;
scanf("%d",&n);
LL a[n];
for(int i=0;i<n;i++) scanf("%lld",a+i);
sort(a,a+n);
LL ans=0;
for... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<vector>
#include<set>
#include<cstdlib>
#include<utility>
using namespace std;
int fa[1000+5],ans;
char a[1000+5][1000+5];
string s;
int get(int x)
{
if (f... | #include <bits/stdc++.h>
#define rep(a,b,c) for(int a = b; a < c; a++)
#define rep2(a,b,c) for(ll a = c - 1; a >=b; a--)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define x first
#define y second
using namespace std;
using ll = long long;
using tl = tuple<ll, ll, ll, ll>;
using pl = pair<ll, ll>;
using... |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,sum=0; string ans;
cin >> n;
int *a = new int[n];
int *b = new int[n];
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < n; ++i) cin >> b[i];
for (int i = 0; i < n; ++i) sum+=a[i]*b[i];
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define MAX 1000002
#define MOD 1e9 + 7
#define pb push_back
#define w(t) while(t--)
#define ff(i,a,b) for(int i=a;i<b;i++)
#define ffe(i,a,b) for(int i=a;i<=b;i++)
#define fbe(i,b,a) for(int i=b;i>=a;i--)
#define f... |
#include <iostream>
#include <unordered_map>
using namespace std;
int main ()
{
int n,is = 1;
cin >> n;
string *str = new string[n];
unordered_map<string,int> map;
for(int i = 0;i < n;i++)
{
cin >> str[i];
if(str[i][0] == '!')
{
str[i].erase(str[i].begin());
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<string> v;
map<string,int> m;
for(int i=0;i<n;i++)
{ string s;
cin>>s;
if(s[0]=='!')
{
m[s]=1;
}
else
{
v.push_back(s);
}
}
int n1=v.size();
for(int i=0;i<n1;i++)
{ string s=v[i];
s... |
#include <iostream>
using namespace std;
int main(){
double a, b;
cin >> a >> b;
cout << a*b/100;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
// 自動でmodを取ってくれる整数型
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
// const int mod = 1000000007;
cons... |
/**
* @author Macesuted (macesuted@qq.com)
* @copyright Copyright (c) 2021
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
// #define mod 998244353
#define maxn 805
long long fac[maxn], inv[maxn];
long long power(long long a, long long x) {
long long ans = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define SIZE 801
int a[SIZE][SIZE];
int f[SIZE][SIZE];
int n,k;
bool check(int key){
bool rtn=true;
REP(i,n) REP(j,n){
if(a[i][j]>=key) f[i][j]=1;
else f[i][j]=0;
}
int count[SIZE];
REP(i,n) count[i]=0;
REP(i,n-... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ri register int
#define rep(io, st, ed) for(int io = st; io <= ed; io ++)
#define drep(io, ed, st) for(int io = ed; io >= st; io --)
#define gc getchar
inline int read() {
int p = 0, w = 1; char c = gc();
while(c > '9' || c < '0') { if(c == ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define endl '\n'
#define pb push_back
#define ub upper_bound
#define lb lower_bound
... |
#define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define ... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#def... |
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=1;i<=(n);++i)
#define rep3(i,i0,n) for(ll i=i0;i<(n);++i)
#define rrep(i,n) for(ll i=((n)-1); i>=0; --i)
#define rrep2(i,n) for(ll i=(n); i>0; --i)
#define pb push_back
#define mo... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int INF = (1<<30)-1;
const ll LINF = 1e18;
#define r... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... | /***************************************************************
File name: D.cpp
Author: ljfcnyali
Create time: 2021年01月10日 星期日 20时08分49秒
***************************************************************/
#include<bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for ( int i = (a), _end_ = (b); i <= _end_; +... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include <bits/stdc++.h>
#define st first
#define nd second
#define PQ priority_queue
using ll = long long ;
using namespace std;
using pii = pair<int,int>;
const int N = 5e3 + 10;
const int MOD = 998244353;
int dp[N][N], val[N][N], row[N], col[N];
int mul(int x, int y){ return 1LL * x * y % MOD;}
int add(int x, int y... |
#include<stdio.h>
int main() {
int N, X,A;
scanf("%d %d", &N, &X);
for (int i = 0; i < N; i++) {
scanf("%d", &A);
if (A != X) {
printf("%d ", A);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long N, a[100000], b[100000];
cin >> N;
long long sum = 0;
for (int i = 0; i < N; i++)
{
cin >> a[i] >> b[i];
sum += b[i] * (b[i] + 1) / 2 - a[i] * (a[i] -1) / 2;
}
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
map<int, string> A;
priority_queue<int> B;
int t;
string s;
for(int i=0;i<n;i++){
cin >> s >> t;
A[t] = s;
B.push(t);
}
B.pop();
cout << A[B.top()] << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int ans;
int ansnum;
for (int i = 2; i <= a.at(n - 1); i++) {
int count = 0;
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long... |
#include <bits/stdc++.h>
//#include <atcoder/all>
typedef long long ll;
using namespace std;
//using namespace atcoder;
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) for(ll i = 0; i < (ll)n; i++)
#define _reps(i, s, n) for(ll i = (ll)(s); i < (ll)n; i++)
#define REP(...) _overload(__VA_ARGS__, _rep... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define REP(i,a,b) for (auto i = a; i != b; i++)
#define maxheap priority_queue < ll, std::vector<ll>, std::less<ll> >
#define minheap priority_queue < ll, std::vector<ll>, std::greater... |
#include<bits/stdc++.h>
#define maxn 1000005
#define inf 0x7fffffffffff
#define mod 1000000007
#define mst(a,x) memset(a,x,sizeof(a))
#define up(l,r,i) for(LL i=l;i<=r;i++)
#define down(l,r,i) for(LL i=l;i>=r;i--)
#define in(l,r,a) for(LL i=l;i<=r;i++)cin>>a[i]
#define out(l,r,a) for(LL i=l;i<=r;i++)cout<<a[i]<<" "
#de... | //#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 cos... |
// FIRST THINK THEN CODE.
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define cld complex<ld>
#define vl vector<ll>
#defi... | //12252024832524
#include <cstdio>
#include <cstring>
#include <algorithm>
#define TT template<typename T>
using namespace std;
typedef long long LL;
const int MAXN = 200005;
const int MOD = 1e9 + 7;
int n;
LL ans;
LL Read()
{
LL x = 0,f = 1;char c = getchar();
while(c > '9' || c < '0'){if(c == '-')f = -1;c = getc... |
#include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(... | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, a, b) for (int i = b; i >= a; --i)
#define all(x) x.begin(), x.end()
using ll = long long;
using... |
//W4P3R
#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define pb push_back
#define re register int
#define fr first
#define sd second
#define pa pair<int,int>
#define FOR(i,a,b) for(re i=a;i<=b;i++)
#define REP(i,a,b) for(re i=a;i>=b;i--)
#define MEM(a) memset(a,0,sizeof(a))
#define N 20... | //#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if... |
#include<bits/stdc++.h>
using namespace std;
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return true;}return false;}
template<class T,class U> inline bool chmax(T&x,U y){if(x<y){x=y;return true;}return false;}
using ll =long long;
int main(){
int n,m;
cin>>n>>m;
vector<vector<pair<int,... |
// Problem: F - Rook on Grid
// Contest: AtCoder - Panasonic Programming Contest (AtCoder Beginner Contest 186)
// URL: https://atcoder.jp/contests/abc186/tasks/abc186_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#define _CRT_SECURE_NO_WARNINGS
#incl... |
#include <bits/stdc++.h>
#include <unistd.h>
#define rep(i,j,n) for(i=j;i<n;i++)
#define repi(i,j,n) for(i=j;i>n;i--)
#define pie 3.141592653589793238
#define ll long long
#define ld long double
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define pb push_back
#define F first
#define S secon... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ... |
#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 <iostream>
#include <map>
#include <string>
#include <utility>
#include <list>
#include <math.h>
#include <vector>
#include <algorithm>
#include<iomanip>
#include <unordered_map>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
#define rep(i,n) for(int i=... |
// C++ program to check if three
// points are collinear or not
// using area of triangle.
#include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
using namespace std;
// function to check if point
// collinear or not
// Driver Code
int main()
{
string s;cin>>s;
int a[10]={0},p,x1,x2,x3,k=0,k1=1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... |
#include <bits/stdc++.h>
using namespace std;
long long rec(long long cur, long long tar) {
static unordered_map<long long, long long> dp;
if (dp.count(cur)) return dp[cur];
if (cur <= tar) return dp[cur] = tar - cur;
if (cur & 1) {
return dp[cur] = min({cur - tar, rec(cur >> 1, tar) + 2, rec((cur + 1)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll X, Y;
cin >> X >> Y;
if (X >= Y) {
cout << X - Y << "\n";
return 0;
}
map<ll, int> mp;
queue<ll> q;
q.push(Y);
mp[Y] = 0;
ll ans ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define is_in(x,l,r) ((l) <= (x) && (x) < (r))
#define sz(x) (int)(x).size()
#define rng(a) a.begin(),a.end()
#define rngr(a) a.rbegin(),a.rend()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(i... | #pragma GCC target ("avx2")
//#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_nod... |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 998244353;
struct fast_io {
fast_io(){
std::cin.tie(nullp... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define int long long
#define pi pair<int,int>
#define f first
#define s second
const int nax=3005,inf=1e18;
const ld eps=1e-14;
void find(ld x,ld r,int& low,int & high)
{
low=ceil(x-r);
high=floor(x+r);
}
int32_t main()
{
ios_base::sync_w... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
int n;
cin >> n;
double x0, y0, xn, yn;
cin >> x0 >> y0 >> xn >> yn;
double cx, cy;
cx = (x0+xn)/2.0;
cy = (y0+yn)/2.0;
... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define ll long long
#define test(t) ll int t; cin>>t; while(t--)
#define F(i,L,R) for(ll int i=L;i<R;i++)
#define F2(i,L,R) for(ll int i=L;i>=R;i--)
#define get1(a) ll int a; cin>>a;
#define get2(a,b) ll int a,b; cin>>a>>b;
#define get3(a,b,c) ll int a,b,c; cin>>... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,s,d;
long long x,y;
cin >> n >> s >> d;
for(int i=0;i<n;i++){
cin >> x>> y;
if(x<s&&y>d){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[3];
for(int i=0;i<3;i++){
cin>>a[i];
}
sort(a,a+3);
if(a[1]-a[0]==a[2]-a[1])
cout<<"Yes";
else
cout<<"No";
return 0;
} |
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(),a.end()
#define forn(i,n) for(int i=0;i<int(n);i++)
#define forr(i,n) for(int i=int(n-1);i>=0;i--)
#define fora(i,a,b) for(int i=int(a);i<=int(b);i++)
#define forb(i,a,b) for(int i=int(a);i>=int(b);i--)
#define mod 1000000007
using namespace std;
us... | #include<bits/stdc++.h>
using namespace std;
char num[20];
int n,cnt[5],sum;
int main(){
scanf("%s",num);
n=strlen(num);
for(int i=0;i<n;++i)
++cnt[(num[i]-'0')%3];
sum=(cnt[1]+cnt[2]*2)%3;
if(sum==0){
printf("0\n");
return 0;
}
if(sum==1){
if(cnt[1]){
if(n<=1)
printf("-1\n");
else
printf("... |
#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 <bits/stdc++.h>
// 1. dp
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *m... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb pus... | #include <bits/stdc++.h>
#define INT_MINs -2000000000
#define INT_MAXs 1000000001
#define MID int mid=(l+r)/2
#define REP1(i,x,y) for(int i=x;i<y;i++)
#define REP2(i,x,y) for(int i=x;i<=y;i++)
#define ls (2*k)
#define rs (2*k+1)
#define lson l,mid,2*k
#define rson mid+1,r,2*k+1
#define lc u << 1
#define rc u << 1 | 1
#... |
/*
{
######################
# Author #
# Gary #
# 2020 #
######################
*/
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#... | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define vi vector <int>
#define ff first
#define ss second
#define... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M (int)(1e9 + 7)
const int len = 1e8 + 8;
//int ar[len];
bool comp(array<int, 3> a, array<int, 3> b)
{
if (a[0] == b[0])
{
return a[1] < b[1];
}
else
return a[0] < b[0];
}
int solve()
{
int n;
cin ... | // Etavioxy
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#define il inline
#define ll long long
#define rep(i,s,t) for(register int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(register int i=(s);i>=(t);i--)
#define each(i,u) for(int i=head[... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... | #include <bits/stdc++.h>
using namespace std;
const int N = 3000 + 9;
int a[N][5], b[N];
int cnt[1 << 5];
vector<int> vc[N];
bool check(int x, int n) {
memset(cnt, 0, sizeof(cnt));
for (int i = 1; i <= n; ++i) {
b[i] = 0;
for (int j = 0; j < 5; ++j) {
if (a[i][j] >= x) {
... |
#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
using ll = long long;
#define rep(i, n) for(i = 1; i <= n; i++)
#define rep2(i, n) for(i = 0; i < n; i++)
//2D::rep(i,j)rep(j,j)cin>>bin[i][j];
//vector<int> a(n)
#define Graph vector<vector<int>>
#define A1 cout<<"No"<<endl
#define A2 cout<<"Yes"<<endl
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
#define all(x) x.begin(),x.end()
#define sz(x) (ll)x.size()
#define MOD 1000000007
#define F first
#define S second
#ifdef LOCAL
#include "trace.h"
#else
#define trace(args...)
#endif
ll div_floor(const ll &a,const ll ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define OJ \
freopen("swap.in", "r", stdin); \
freopen("swap.out", "w", stdout);
void no(){
cout<<"No";
exit(0);
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);
ll n;
ll k=11;
cin>>n;
//n+11Cn but this will include 0 solution also
ll ... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
int x;
cin >> x;
if(x >= 0) cout << x << endl;
else cout << 0 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
long long cur[101][10001], pre[101][10001];
long long MOD = 998244353;
int main() {
int N; cin >> N;
vector<int> W(N);
for(int i = 0; i < N; i++) {
cin >> W[i];
}
pre[0][0] = 1LL;
int sum = 0;
for(int i = 0; i < N; i++)
sum += W... | #include<bits/stdc++.h>
using namespace std;
typedef long long s64;
const int N=100+5,D=998244353;
int dp[N*N][N];
s64 fact[N];
int main(){
#ifdef kcz
freopen("1.in","r",stdin);//freopen("1.out","w",stdout);
#endif
int n;
cin>>n;
int sum=0;
bool d=0;
dp[0][0]=1;
for(int i=1;i<=n;++i){
d^=1;
int w;
cin>>w... |
#include <bits/stdc++.h>
template <typename T>
T next() {
T temp; std::cin >> temp;
return temp;
}
template <>
int next() {
int temp; scanf("%d", &temp);
return temp;
}
template <>
long long next() {
long long temp; scanf("%lld", &temp);
return temp;
}
template <>
double next() {
double te... | #include<iostream>
using namespace std;
int main()
{
char a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c)
{
cout<<"Won";
}
else
cout<<"Lost";
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t, take;
cin >> t >> n;
take = (100 + t - 1) / t;
for (long long i = n * (take - 1); i <= n * (take + 1); i++) {
if ((i * t) / 100 == n) {
cout << i + n - 1 << "\n";
break;
}
}
return... | #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>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#de... | #include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#def... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.