code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int n,m,a[200050],dp[200050],ans=-2e9;
vector<int> e[200050];
bool vis[200050];
void dfs(int x) {
if (vis[x]) return;
vis[x]=1;
for (int i:e[x]) {
dfs(i); dp[x]=max(dp[x],dp[i]);
}
ans=max(ans,dp[x]-a[x]);
dp[x]=max(dp[x],a[x]);
}
int main() {
cin>>n>>m;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
... |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>
ostream &operator<<(... | #include <algorithm>
#include <chrono>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
//------------------------------------------------------------------------------
class Timer {
public:
explicit Timer()
: mStart(chrono::system_clock::now())
{}
vo... |
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
cout << (100 - (x%100)) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, revnum, t, pali;
cin >> N;
revnum = 0;
if (N == 0) {
cout << "Yes" << endl;
return 0;
}
while (N % 10 == 0) {
N = N / 10;
}
pali = N;
while (N != 0) {
t = N % 10;
revnum = revnum * 10 + t;
N = N / 10;
}
if (... |
#include<bits/stdc++.h>
using namespace std;
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
using ll=long long;using ld=double;using pii=pair<int,int>;using vi=vector<int>;
using qi=queue<int>;using pqi=priority_queue<int>;using si=set<int>;
#define pb push_back
#define mk make_pair
#define ins insert
#define er... | #include <bits/stdc++.h>
using namespace std;
//#pragma target("sse,sse2,sse3,ssse3,sse,popcnt,abm,mmx,avx,avx2,fma,tune=native")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
template <typename T>
istream& operator >> (istream& in, vector<T>& a) {
for (auto& i : a)
in >> i;
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, count = 0;
char a = '!';
cin >> N;
vector<string> s(N);
set<string> z;
for (int i = 0; i < N; i++)
{
cin >> s.at(i);
z.insert(s.at(i));
}
for (auto value : z)
{
if (z.count(value) && z.cou... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
int main(){
string S;
cin >> S;
int s_siz = S.size();
vector<int> num(10);
rep(i,s_siz){
int n = S[i] - '0';
num[n]++;
}
for(int i=8; i<1000; i+=8){
string t = to_st... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<stdlib.h>
#include<utility>
#include<functional>
#include<cfenv>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define vint vector<int>
#define vvint vector<vint... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pob pop_back
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vll vector<long long int>
#define pll pair<long long int,long long int>
#define mod 1000000007
#define mod2 998244353
#def... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pll pair<ll,ll>
#define ppl pair<pll,ll>
#define plp pair<ll,pll>
#define pi 3.14159265358979323846264338327950
const ll MOD=1e9 + 7;
const ll N=4e5 + 7;
using names... | /*** In the name of Allah(swt), the most gracious, most merciful.***/
/*** Alhamdulillah for Everything ***/
#include<bits/stdc++.h>
using namespace std;
typedef bool boo;
typedef int li;
typedef long il;
typedef unsigned long ul;
typedef long long int ... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define M 1000000000
#define MAX 20000000000
#define set_zero(a) memset(a,0,sizeof(a))
#define N 100005
using namespace std;
void solve(ll tc){
string s; cin>>s;
ll n = s.length();
bool ok = false;
ll j = -1;
for(ll i = 0;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define COUT(x) cout << (x) << endl
#define PB push_back
#define SZ(x) ((int)(x).size())
#define F first
#defin... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | //wtrl,everybody hangbeat me
#include<bits/stdc++.h>
/*#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstre... |
#include<bits/stdc++.h>
using ll = int_fast64_t;
#define REP(i,b,e) for(ll i=b; i<e; i++)
int main(){
ll n, k;
scanf("%ld %ld", &n, &k);
ll ans = 0;
REP(ab, 2, 3*n){
ll cd = ab-k;
if(cd<2) continue;
ll l1 = std::max(0l, ab-n), r1 = std::min(ab, 0+n);
ll l2 = std::max(0l, cd-n), r2 = std::min(cd, 0+n);
an... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fi(i,n) for(int i=0;i<n;i++)
#define f(i, a, b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
#define MOD 998244353
#define pii pair<int, int>
#define ff first
#define ss second
#define... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const int N = 100 + 5;
int mod, k, dp[N][N], a[N];
string s;
int add(int a, int b){
return (a + b) % mod;
}
int mul(int a, int b){
return 1ll * a * b % mod;
}
int fp(int b, int p){
if(p == 0) return 1;
int re... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007ll
#define pb push_back
#define vl vector<ll>
#define pll pair<ll,ll>
#define mp make_pair
using namespace std;
#define pi (long double)3.14159265358979323846
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cou... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <chrono>
#include <random>
#define rep(... | // ____ ____
// /@@@@\ |@@@@| ____
// /@@@@@@\ |@@@@| |@@@@|
// /@@@@@@@@\ |@@@@| __|@@@@|___ ____ ____ ___ _________ ____ ____ ____________ ___ _________ ____ ____
// /@@@@/\@@@... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<int, string> > t(n);
for (int i = 0; i < n; i++)
{
cin >> t.at(i).second >> t.at(i).first;
}
sort(t.begin(), t.end());
cout << t.at(n - 2).second << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
using ll=long long;
using P=pair<int, int>;
int main(){
int n;
cin>>n;
vector<P> pv(n);
vector<string> sv(n);
rep(i, n){
pv[i].second=i;
cin>>sv[i]>>pv[i].first;
}
//cout<<pv[1].second<<endl;
sort(pv.begin()... |
#include <bits/stdc++.h>
#include <algorithm>
#include <unordered_map>
#define ull unsigned long long
#define int long long
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define frf(i, j, n) for (int i = j; i <= n; i++)
#define frd(i, n) for (int i = n; i >= 0; i--)
#define mp(i, j) make_pair(i, j)
... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
ll t, n;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> t >> n;
ll x = (n * 100) / t;
if ((n * 100) % t) ++x;
cout << x + n... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
for(int x=-100;x<=100;x++){
for(int y=-100;y<=100;y++){
if(x+y==a and x-y==b){
cout<<x<<" "<<y<<endl;
break;
}
}
}
} | #include<iostream>
#include<vector>
#include<bits/stdc++.h>
#define lli long long int
#define mod 1000000007
#define pb push_back
#define mk make_pair
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
cout<<(a+b)/2<<" "<<(a-b)/2<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using P = pair<int, int>;
using P3 = pair<P,int>;
using PP = pair<P, P>;
constexpr int INF = 1 << 30;
constexpr ll MOD = 998244353;
constexpr int di[] = {0, 1, 0, -1};
constexpr int dj[] = {1, 0, -1, 0};
constex... | //_base::sync_with_stdio(false);
// cin.tie(nullptr);
// cout.tie(nullptr);
#include <valarray>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <cmath>
#include <map>
#include <stdio.h>
#include <string.h>
#include <unordered_set>
#include <random>
#include <unorder... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int i;
bool flag=false;
string s;
cin >> s;
for(i=0;i<s.length();i++)
{
if (i%2==0 && !(s[i]>='a' && s[i]<='z'))
{
flag=true;
break;
}
if (i%2!=0 && !(s[i]>='A' && s[i]<='Z'))
{
flag=true;
break;
}
}
... | //ABHISHEK AGRAWAL,BIT mesra//
//Newbie......You have to be odd to be no. ONE :)//
//Authhor: Abhishekagrawal
//Date: 20/02/2021
//Time: 17:30:13
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#defin... |
#include<bits/stdc++.h>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end());
#define pb push_back
#define MP make_pair
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define pi 3.141592653589793
#d... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i < (n); ++i)
using namespace std;
using ll = long long;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
unordered_set<string> st;
rep(i, n){
string s;... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define endl '\n'
#define pb push_back
#define sz(c) (ll)c.size()
#define mp make_pair
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define F first
#define S second
#define M 1000000007
#define PI 3.... | #include <iostream>
using namespace std;
int main(){
int T;
cin>>T;
while (T--){
int n;
cin>>n;
string s1;
string s2;
string s3;
cin>>s1>>s2>>s3;
string res;
for (int i=0;i<n;i++){
res+='1';
}
for (int i=0;i<n;i++){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,ans=LONG_LONG_MAX;
cin>>n;
for(int b=0;(1LL<<b)<=n;b++)
ans=min(ans,b+(n>>b)+(n&((1LL<<b)-1)));
cout<<ans<<endl;
} | /* HAVE PATIENCE YOU CAN SOLVE EVERY QUESTION
JUST THINK*/
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
//#include <unordered_set>
//#include <unordered_map>
using namespace std;
int mod = 1000000007;
const double pi = 3.141592653689793238460;
const int inf =... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl "\n"
#define debug(arr) for(int x : arr) cout << x << " "; cout << endl;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int32_t main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r"... | #include <iostream>
using namespace std;
int main()
{
int x,y, rock=0, scissors=1, paper=2;
cin>>x>>y;
if(x==y) cout<<x;
else{
if(x==rock&&y==scissors || x==scissors&&y==rock) cout<<paper;
else if(x==paper&&y==rock || x==rock&&y==paper) cout<<scissors;
else cout<<rock;
}
... |
#include <set>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <queue>
#include <string>
#include <vector>
#include <cmath>
#include <cstdio>
#include <utility>
#include <iostream>
#include <iterator>
#include <algorithm>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
#define LOCAL 1;
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define dbg(x) true
#endif
template<typename T>
ostream... |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N, K;
cin >> N >> K;
map<int, int> m;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
m[a] += 1;
}
vector<int> numOfA;
for (int i = 0; i < N; ++i) {
if (m.count(i) == 0) {
break;
... | // #include <atcoder/all>
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1... |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<map>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
#define int long long
#define mod 1000000007
int ans = 0;
vector<int>graph[200001];
vector<int>visited(200001, -1);
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define endl "\n"
#define deb(x) cout<<#x<<" "<<x<<endl;
#define sc(ar,n) for(int pen=0;pen<n;pen++){ cin>>ar... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MIN = -1e18;
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n;
ll m, ans = 1e18;
cin >> n >> m;
vector<ll> a(n);
for (ll& x : a) cin >> x;
for (int k = 1; k <= n; ++k) {
vector<vector<ll>> dp(k, vector<ll>(... | #include <iostream>
#include <vector>
#include <limits>
#include <cstring>
#include <time.h>
#include <math.h>
#include <algorithm>
#include <random>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <chrono>
#include <sstream>
us... |
#include <iostream>
#include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
char a[H][W];
int dist[H][W];
map<char, vector<pair<int, int>>> mp;
for(int i=0; i<H; i++) {
for(int j=0; j<W; j++) {
char c;
cin >> c;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr char newl = '\n';
ll dp[100][200000 + 10];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, K;
ll m;
cin >> n >> K >> m;
int lim_sum = (n - 1) / 2;
lim_sum = lim_sum * (lim_sum + 1) / 2 * K... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
#define all(v) v.begin(), v.end()
using in = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#def... | #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;
using ll = long long;
using ld = long double;
using ordered_set = tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
void fastio() {
cin.tie... |
#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 main()
{
int T;
scanf("%d",&T);
while (T--)
{
long l... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
using namespace std ;
using... |
#include <bits/stdc++.h>
using namespace std;
#define llong long long
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#ifdef testing/*{{{*/
mt19937 rng(177013);
#else
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#endif
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#define min(a, b) ((a) < (b) ? (a) : (b))
static constexpr int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread(cn, 1, cm, stdin);
ci = cn... |
/* >>>>>Shwetal<<<<< */
#include <bits/stdc++.h>
#define int long long
#define f(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define inputArray(arr) f(i, 0, arr.size()) cin >> arr[i]
#define printArray(arr) f(i, 0, arr.size()) cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < (int)S.size(); i++) {
if ((i % 2 == 0) && (S.at(i) < 'a' || S.at(i) > 'z')) {
cout << "No" << endl;
return 0;
}
else if ((i % 2 == 1) && (S.at(i) < 'A' || S.at(i) > 'Z')) {
cout << "... |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define var auto
template<typename T, T MOD = 1000000007>
struct Mint{
static constexpr T mod = MOD;
T v;
Mint():v(0){}
Mint(signed v):v(v){}
Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}
Mint pow(long long k){
Mint res(1),tmp(v);
wh... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... |
///////////////////////////////
////ACくれなきゃ悪戯しちゃうぞ!////
///////////////////////////////
//include
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
#include <map>
#include <utili... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t n;
cin>>n;
int64_t cnt=0,sum=0;
while(cnt+sum<=n)sum+=++cnt;
cout<<n-cnt+1<<'\n';
} |
/**
* @author: adityasonani
* */
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#define ll long long
#define ld long double
#define ln "\n"
#define fastio ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define MOD ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using Int = long long;
int main(){
Int n,s,d; cin>>n>>s>>d;
vector<Int> x(n);
vector<Int> y(n);
rep(i,n) cin>>x[i]>>y[i];... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T; cin >> T;
string ss = "atcoder";
while (T--) {
string s = ss;
string t; cin >> t;
string tt = t;
sort(tt.rbegin(), tt.rend());
if (t > s) {
cout << 0 << '\n';
}
else if ... | #include <iostream>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30
using namespace std;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin>>x;
if(x>=0) cout<<x;
else if(x<0) cout<<0;
} | #include<bits/stdc++.h>
#define ll long long int
#define nl '\n'
#define pi acos(-1)
#define GCD(a, b) __gcd(a, b)
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define inout freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)
using... |
//Code by Ritik Agarwal
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
#define int long long int
#define loop(i,a,b) for(int i=a;i<b;i++)
#define scan(arr,n) for (int i = 0; i < n; ++i) cin >> arr[i]
#define vi vector<int>
#define si set<int>
#define pii pair <int, int>
#define sii set<pii>... | #include<iostream>
using namespace std;
int main()
{
char a[3];
for (int i = 0; i < 3; i++)
{
cin >> a[i];
}
if ((a[0] == a[1]) && (a[1] == a[2]))
{
cout << "Won" << endl;
}
else
{
cout << "Lost" << endl;
}
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fore(b,c) for(int val0=b;val0<c;val0++)
#define forr(k,c,s) for(int k=c;k<s;k++)
#define pb push_back
#define mmp make_pair
using namespace __gnu_pbds;
using namespace std;
template<typename T>
using oset = tr... | //#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#define X first
#define Y second
#define L (u<<1)
#define... |
#include <bits/stdc++.h>
#define lowbit(x) ((x) & (-x))
using namespace std;
typedef long long LL;
const int N = 200005;
int n, e;
int a[N], b[N], c[N], d[N * 4];
LL m, f[N * 4];
void init() {
memset(f, 0, sizeof(f));
}
void add(int p, int val) {
for (; p < e; p += lowbit(p)) f[p] += val;
}
LL cal... | #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 endl '\n'
#define int long long int
#define rep(i, a, b) for (int i = a; i < b; i++)
#define revrep(i, a, b) for (int i = a; i >= b; i--)
#define pb push_bac... |
#include <bits/stdc++.h>
#include <sstream>
using namespace std;
string n;
int k;
string res;
//-----------
bool cmp(char a, char b)
{
return a>b;
}
//-----------
string inttostring(long long n)
{
stringstream stream;
stream<<n;
string st=stream.str();
return st;
}
//-------------------------------... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define asort(a,n) sort(a,a+n)
#define vsort(v) sort(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 10000000... |
/*
Author: Arnab Sinha
███████╗██╗ ██╗███████╗██████╗ ██╗ ██████╗ ██████╗██╗ ██╗███████╗██████╗ █████╗ █████╗
██╔════╝██║ ██║██╔════╝██╔══██╗ ██║ ██╔═══██╗██╔════╝██║ ██╔╝██╔════╝██╔══██╗██╔══██╗██╔══██╗
███████╗███████║█████╗ ██████╔╝ ██║ ██║ ██║██║ █████╔╝... | #include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <tuple>
#include <numeric>
using namespace std;
int main(int argc, char* argv[]){
int N,M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
vecto... |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tre... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define vec vector
using namespace std;
const int MOD = 3;
const int INV[3] = {0, 1, 2};
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef LOCAL
// freopen("in1.txt", "r", stdin);
// freopen("in1.txt", "w", stdout... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll f(ll h) {
if (h == 1) {
return 1;
} else {
return ... | #include<bits/stdc++.h>
using namespace std;
long long in(){
long long x;
cin>>x;
return x;
}
int main(){
long long x=in(),y=in(),a=in(),b=in(),ans=0;
while(x<b/(a-1) && x<y/a)x*=a,ans++;
ans+=(y-1-x)/b;
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m;
int main(){
cin>>n>>m;
if(m==0){
for(int i=1;i<=n;i++)printf("%d %d\n",i*2-1,i*2);
return 0;
}
if(abs(m)>n-2||m<0)return puts("-1"),0;
if(m>0){
int now=2*m+4;
printf("%d %d\n",1,2*m+3);
printf("%d %d\n",2*m+2,2*m+4);
for(int i=... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define endl "\n"
#define rep(X,Y) for(X=0;X<Y;X++)
#define rep1(X,Y) for(X=1;X<=Y;X++)
#define rrep(X,Y) for(X=Y-1;X>=0;X--)
#define rrep1(X,Y) for(X=Y;X>=1;X--)
#define ml l... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize ("O3")
#pragma GCC target ("avx,avx2,fma")
#ifdef LOCAL
#define D(a) cerr << #a << " = " << a << endl
#else
#define D(a) 8
#endif
#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
#define dforsn(i,s,n) for(int i=int(n-1);i>=int(s);i... |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<double, double> pd;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e3+9;
const int MAX=1e2+9;
const double ep=1e-10;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;
const double inf=1e20;
const double pi=acos(-1);
#define debug1 puts("?");
#define debug(x) cout<<"##"<<(x)<<endl;
#define mk make_pair
#def... |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
#ifndef DEBUG
#define cerr while(false) cerr
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define vec2(name,i,j,k) vector<vector<ll>> name(i,vect... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define F(i,n) for (int i = 0; i < n; ++i)
#define F1(i,n) for (int i = 1; i <= n; ++i)
#define dbg(x) cerr << #x << " = " << x << endl
#define dbgg(x) cerr << #x << " = " << x << ' '
#de... |
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include<bits/stdc++.h>
#define Rushia_mywife ios::sync_with_stdio(0);cin.tie(0);
#define F first
#define S second
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define FL cout.flush()... | #include<bits//stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long int ll;
typedef lon... |
// 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>
#define LL long long
#define SZ(x) (int)x.size()-1
#define F(i,a,b) for (int i=a;i<=b;++i)
#define DF(i,a,b) for (int i=a;i>=b;--i)
#define pb push_back
#define ms(a,b) memset(a,b,sizeof a)
using namespace std;
int read(){
char ch=getchar(); int w=1,c=0;
for (;!isdigit(ch);ch=getchar()) ... |
#include <stdio.h>
inline int read() {
int b = getchar(), c = 0;
int m = b == 45;
if (m) b = getchar();
while (b > 47) {
c = c * 10 + b - 48;
b = getchar();
}
return m ? - c : c;
}
int p[200001];
int main() {
int a[400002];
int n = read(), m = read();
long s = 0;
... | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
vector<long long int> diff;
vector<bool> seen;
long long int sum;
void dfs(const Graph &G,int v){
sum += diff[v];
seen[v] = true;
for(auto next_v:G[v]){
if(seen[next_v]) continue;
else dfs(G,next_v);
}
}
int main(){
int ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
int main() {
ll x, y, a, b;
cin >> x >> y >> a >> b;
ll ans = 0;
while (1) {
if (y / a <= x) break;
if (a * x >= y) break;
if (a * x > x + b) break;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define endl '\n'
#define rep(i,a,b) for(i=a;i<b;i++)
#define mod ... |
#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define pdd pair<double,double>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define mp make_pair
#define LL long long
#define ULL unsigned long long
#define sqr(x) ((x)*(x))
#define pi acos(-1)
using namespace std;
#define MXN 200005
vo... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i=0;i<n;i++) cin >> a[i];
b = a;
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
int ans = 0;
for (int i=0;i<n;i++) {
int l... |
#include <bits/stdc++.h>
using namespace std;
int decimaltoOctal(int deciNum)
{
int octalNum = 0, countval = 1;
int dNo = deciNum;
while (deciNum != 0) {
int remainder = deciNum % 8;
octalNum += remainder * countval;
countval = countval * 10;
deciNum /= 8;
}
... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define be(x) x.begin(), x.end()
using namespace std;
int main()
{
string s;
cin >> s;
for (int i = 1; i < s.size(); i++)
{
c... |
#include<iostream>
#include<vector>
#include<utility>
using namespace std;
int main()
{
int N, D, H;
cin >> N >> D >> H;
vector<pair<int, int>> O(N);
for (size_t i = 0; i < N; i++)
{
cin >> O.at(i).first >> O.at(i).second;
}
double ret = 0;
for (size_t i = 0; i < N; i++)
{
ret = max(ret, O.at(i).second - ... | //FIRST THINK THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vld vector<ld>
#define vvi ve... |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | #include <iostream>
#include <math.h>
using namespace std;
const int COUNT_A = 100;
int a[4];
int n = 0;
int min(int a, int b) {
if (a > b) {
return b;
}
return a;
}
int main() {
cin >> a[0] >> a[1] >> a[2] >> a[3];
n = min(a[0], min(a[1], min(a[2], a[3])));
printf("%d"... |
//Author: Fuadul Hasan(fuadul202@gmail.com)
//BSMRSTU,Gopalganj
//#include<bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <random>
... | // Username: WillTheBill
// Time of creation: 2020-11-22 12:49
// Original filename: m.cp.cpp
#include<bits/stdc++.h>
using namespace std;
// shortcuts
#define pb push_back
#define fi first
#define se second
#define all(_v) _v.begin(),_v.end()
#define ll long long
// IO
#define multitest signed __T; cin >> __T; whil... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <numeric>
using namespace std;
using ll = long long;
#define For(i,a,b) for(ll i=(a);i<(ll)(b);i++)
#define rFor(i,a,b) for(ll i=(a);i>=(ll)(b);i--)
#define co(a) cout<<a<<endl
#define Sort(a) sort... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define int long long
typedef long long LL;
typedef long long ll;
const int INF = 0x3f3f3f3f;
//const int inf = 1e18;
//const int mod = 998244353;
const int mod = 1e9 + 7;
int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
const int maxn = 1e6... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define f(i,j,n) for(int i = j; i <= n; i++)
#define r(i,n,j) for(int i = n; i >= j; i--)
#define all(container) container.begin() , container.end()
#de... | #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
const ll MODA=998244353;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
if(gcdmax%gcdmin==0)break... |
#include<bits/stdc++.h>
typedef long long ll;
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define all(x) (x).begin(),(x).end()
template<class T>void cxk(T&a,T b){a=a>b?a:b;}
template<class T>void cnk(T&a,T b){a=a... | #include <bits/stdc++.h>
// ifブロックはインデントがいる
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define repp(i, l, r) for (long long i = (l); i < (r); i++)
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define per(i, n) for (long long i = (n); i >= 0; --i)
#define all(v) v.be... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll A, B;
cin >> A >> B;
ll d = B-A;
ll ans = 0;
for ( ll d = B-A; d > 0; d-- ) {
if ( B/d != (A%d==0 ? A/d : (A/d+1)) ) {
return d;
}
}
return 1;
}
int main() {
auto ans = solv... | #include <bits/stdc++.h>
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<pll> vll;
typedef vector<vl> v... |
#include <bits/stdc++.h>
#define ll long long
#define sf scanf
#define pf printf
#define nl printf("\n")
#define pb push_back
#define TEST int Test;cin>>Test;for(int _t=1;_t<=Test;_t++)
using namespace std;
int main()
{
int a,b,c,d;
sf("%d %d %d... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begi... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define... |
/*****author: maxifier******/
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <stack>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>... | //Hare Krishna
//author: Dipjoy Basak
//dip_10
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define int ll
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pai... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define rep(n) for (ll i = 0; i < n; i++)
#define repc(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, x, y) for (ll i = x; i < y; i++)
#define DEC(i, x, y)... | #include <algorithm>
#include <array>
#include <bitset>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <ostream>
#include <queue>
#include <regex>
#include <set>
#include <... |
#include <bits/stdc++.h>
using namespace std;
double eps = 1e-9;
double pi = acos(-1);
int fx[8] = {1, -1, 0, 0, 1, -1, -1, 1};
int fy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0);
#define ll lo... | #include <iostream>
using namespace std;
int main(){
int a,b,c; cin>>a>>b>>c;
a*=a;
b*=b;
c*=c;
if(c>a+b)cout<<"Yes";
else cout<<"No";
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define ALL(n) begin(n),end(n)
#define IN(a, x, b) (a<=x && x<b... | #include<iostream>
#include<cstdio>
#include<map>
#include<bitset>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<ctime>
using namespace std;
#define M 300005
#define N 1000005
#define MP make_pair
#define debug() cerr<<"Why So Serious?"<<endl
typedef long long ll;
typede... |
#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 <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#includ... |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,fast-math,unroll-loops")
#define int long long
#define pb push_back
#define MP make_pair
#define pii pair<int,int>
#define F first
#define S second
#define SZ(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define LINE cout << "\n---------------\n";
#define e... | #include<iostream>
#include<vector>
using namespace std;
#define popcount __builtin_popcount
int main(){
int n,m;
cin>>n>>m;
int xyz[110][3];
for(int i=0;i<m;i++)for(int j=0;j<3;j++)cin>>xyz[i][j];
int n2=1<<n;
long long mask[110]={0};
vector<long long> dp(n2);
for(int i=0;i<n;i++)mask[i+1]=mask[i]<<1|1;
dp[0... |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define brn "\n"
#define ss second
#define mk make_pair
#define int long long
#define pb push_back
#define pf push_front
#define ps(x,y) fixed<<... |
#include<cstdio>
using namespace std;
int n,a,b;
int main(){
scanf("%d%d%d",&n,&a,&b);
printf("%d\n",n-a+b);
return 0;
}
| // Created by ...
#include <bits/stdc++.h>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,a,n) for(int i=a;i<=(n);++i)
#define repD(i,a,n) f... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
#define INF 1000000007 //10^9+7
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b)... | // atcoder/abc197/F/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <nume... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;
ll N,... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int r, c;
cin >> r >> c;
vector <vector<int>> a(r + 1, vector <int> (c + 1, 0));
for(int i = 1; i <= r; i++) {
for(int j = 1; j < c; j++) {
cin >> a[i][j];
}
}
vector <vector<int>>... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
int main(){
ll n, q;
cin >> n >> q;
vector<ll> a(n);
for(ll&v:a) cin >> v;
while(q--) {
ll k;
cin >> k;
ll ok = 2e18;
ll ng = 0;
while(ok-ng > 1) {
... | #include<iostream>
#include<bits/stdc++.h>
#define m_p make_pair
#define fi first
#define se second
#define pb push_back
typedef long long ll;
#define f(i,n) for(ll i=0;i<n;i++)
#define f1(i,n) for(ll i=1;i<=n;i++)
#define crap ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0)
using namespace std;
#define INF 1000... |
#include<iostream>
int main(){
int i,j,bit;
int n,a,b;
int num[8]={};
int can[200]={};
int count=0;
std::cin>>n;
if(n>8)n=8;
for(i=0;i<n;i++){
std::cin>>a;
num[i]=a%200;
}
for(bit=1;bit<(1<<n);++bit){
b=0;
for(i=0;i<n;i++){
if(bit&(1<<i)){
b+=num[i];
}
}
b=b%200;
if(can[b])break;
... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
vector<int> x(n),y(n);
for(int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
int ans = 0;
for(int i = 0; i < n; i++) {
for(int j = i+1; j < n; j++) {
double k = (double)(y[j]-y[i])/(x[j]-x[i]);
if(k>=-1&&k<=1) ans++... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
scanf("%d",&x);
int now=x;
while(1){
now++;
if(now%100==0){
cout<<now-x;
return 0;
}
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin>>x;
x%100==0 ? cout<<(100) : cout<<(100 - x%100);
} |
#include<bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#define endl "\n"
#define pb push_back
#define ll long long
#define d1(x) cerr << #x << "--> " <... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x;
cin >> n;
int arr1[n+2]= {0};
memset(arr1,0,sizeof(arr1));
for(int i=1; i<=n; i++)
{
cin>>x;
arr1[x]++;
}
int arr2[n+1];
for(int j=1;j<=n; j++)
{
cin >> arr2[j];
}
unsigned long long int cnt=0;
while(n--)
{
cin >> x;
int... |
// clang-format off
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#inclu... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<string> s(n+1);
for(int i=1;i<=n;i++){
cin>>s[i];
}
vector<long long> t(n+1);
vector<long long> f(n+1);
if(s[1]=="AND"){
t[1]=1l;
f[1]=3l;
}
else{
t[1]=3l;
f[1]=1l;
}
for(int i=2;i<=n;i++){
if(s[i]=="AND"){
... |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<string> s(n);
rep(i, 0, n) cin >> s[i];
set<string> st;
rep(i, 0, n) st.insert(s[i]);
for(string s : st){
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6+10;
int p[N];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int x,y;
cin >> x >> y;
int c = min(x,y);
int d = max(x,y);
if((d-c)<3)cout << "Yes";
else cout << "No";
}
|
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// ifstream cin("input.txt");
// ofstream cout("output.txt");
ll tst = 1;
while(tst--){
ull res,n,i,j,k,lim;
cin>>n;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
unordered_set<long long> us;
long long counter = 0;
for (long long i = 2; i <= sqrt(n); i++) {
long long tmp = i * i;
while (tmp <= n) {
us.insert(tmp);
tmp *= i;
}
}
cout << n - us.size() << endl;
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<string>
#include<stack>
#include<algorithm>
#include<cmath>
#include<set>
#include<queue>
#include<sstream>
#include<utility>
#include<map>
#include<ctime>
#include<cstdio>
... | #include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
typedef long long int ll;
using ii= pair<ll,ll>;
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define all(o) (o).begin(),(o).end()
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define ld long double
#define eps 0.00000000... |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
// clang-format off
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
#define Endl endl
#define itn int... |
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF {1001002003004005006};//ll = 9*LLINF
constexpr int INTINF {1000000000};//int = 2*INTINF
#define rep(i,n) for(in... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define Swap(a, b) do { typeof(a) T = (a); a = b; b = T; } while(0)
static inline int
input() {
int x = 0, f = 0, c = getchar();
while(c < '0' || c > '9') { f ^= (c == '-'), c = getchar(); }
while(c > 47 && c < 58) { x = x * 10 + c - '0', c = getc... |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulflo... | #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<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<int,int,int>
using Graph = vector<vector<int>>;
int main(){
ll N; cin >> N;
ll v[2*N]; ll sum = 0,loss = 0;
rep(i,2*N){
cin >> v[i]; sum += v[i];
... |
// < Rahil Malhotra / ViciousCoder >
#include "bits/stdc++.h"
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define end... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define mst(a,i) memset(a,i,sizeof a)
#define ll long long
#define pb push_back
#define eps 1e-10
#define fi first
#define se second
#define pii pair<int,int>
#define inf 0x3f3f3f3f
const ... |
#include<bits/stdc++.h>
using namespace std;
#define lll __int128_t
#define ll long long
#define int long long
#define FOR(i,a,b) for(ll i=a;i<(ll)b;i++)
#define FORr(i,a,b) for(ll i =a;i>=(ll)b;i--)
#define rep(i,n) FOR(i,0,n)
#define rep1(i,n) FOR(i,1,n)
#define print(arr) for(auto a: arr) cout << a<< " "; cout << e... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
long long s = 0;
vector<long long> A(N), B(N);
for(int i = 0; i < N; ++i){
cin >> A[i];
s += A[i];
}
for(int i = 0; i < N; ++i){
cin >> B[i];
}
vector<long long> O, E;
for(int i ... |
#include<bits/stdc++.h>
int main() {
using namespace std;
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int N; cin >> N;
// you can attain 0..L-N
int L; cin >> L; L -= N;
vector<int> A; A.reserve(N+2);
A.push_back(0);
for (int i = 0; i < N; i++) {
int a; cin >> a; a--;
A.push_back(a-i);
}
A.push_b... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
int X; //???????
cin >> A >> B;
X = (2 * A +100 ) - B;
cout << X << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a,b;
cin>>a>>b;
vector<ll>vec(1000);
vector<ll>veco(1000);
for(ll i=0;i<a;i++){
ll c;
cin>>c;
vec.at(c-1)=1;
}
for(ll i=0;i<b;i++){
ll c;
cin>>c;
veco.at(c-1)=1;
}
for(ll i=0;i<1000;i++){
if(... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) fo... | #include <bits/stdc++.h>
using namespace std;
long long int MOD=1000000007;
long long power(long long a,long long b)
{
a %= MOD;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
bool isprime(long ... |
#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define debug(x) cout << #x << ':' << x << endl;
#define rep(i,n) for(long long i = 0; i < n ; i++)
#define reps(i,n) for(long long i = 1; i <= n ; i++)
#define make_unique(v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<bool>> graph(N, vector<bool>(N, false));
for (int i = 0; i < M; ++i) {
int from, to;
cin >> from >> to;
--from; --to; // Convert to 0-based.
graph[from][to] = true;
graph[to][from] = true;
}... |
# include <cstdio>
# include <cctype>
template <class code>inline code read (const code &a)
{
code x=0;short w=0;char ch=0;
while (!isdigit (ch)) {w|=ch=='-';ch=getchar ();}
while (isdigit (ch)) {x=(x<<3)+(x<<1)+(ch^48);ch=getchar ();}
return w?-x:x;
}
int main ()
{
int a=read (a),b=read (b),c=read (c);
printf ("... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60; // 仮想的な無限大の値;
using ll = long long;
us... |
#include <bits/stdc++.h>
using namespace std;typedef long long ll;
void swa(int &x, int &y){int temp = x;x = y;y = temp;}
void IO() {freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);}
bool jj(int g,int h,int k){
if(g<=k&&k<=h){
return true;
}
return false;
}
int main()
{
ios_b... | #pragma GCC optimize("Ofast")
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // ... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int read()
{
int a = 0,x = 1;
char ch = getchar();
while(ch > '9' || ch < '0'){
if(ch == '-') x = -1;
ch = getchar();
}
while(ch >= '0' && ch <= '9'){
a = a*10 + ch-'0';
ch = getchar();
}
return a*x;
}
char ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
/* start */
const int N = 2e5 + 9; // MUDAR ISSO
signed main(){
IOS;
int n; cin >> n;
string s; cin >> s;
vector<char> r;
int cnt = 0;
for(int i = 0; i <... |
/********include********/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <ra... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int num[8];
int main(){
int n,m;
cin>>n>>m;
vector<string>t(m);
vector<string>s;
rep(i,m){
cin>>t[i];
}
for(int k=2;k<=12;k++){
rep(i,m){
if(t[i].length()==k){
s.push_back(t[i]);
}
}
}
... |
#include <iostream>
using namespace std;
int main()
{
int N;
cin>>N;
int c;
if(N<=1){
c=0;
}
else {
c=N-1;
}
cout<<c;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
const auto ans = [](int p) { return p > 1? "Even": p < 1? "Odd": "Same"; };
int T; ios_base::sync_with_stdio(false), cin.tie(nullptr), cin >> T;
for (long long N; T--; cout << ans(__builtin_ctzll(N)) << '\n')
cin >> N; }
|
//winners never quit//
//never give up//
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast() ios_base::sync_with_stdio(0);cin.tie(nullptr);
const double PI = acos(-1);
#define MOD 1000000007
#define endl '\n'
const ll inf=1e9+10;
template < typename F, typename S >
ostream& operator << ( os... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, c... |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int cnt=0;
for(int i=0;i<n;i++)
{
... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
using ll = long long;
// const int MOD = 1e9 + 7;
#define mem(a, b) memset(a, b, sizeof(a))
#define REP(i, a) for (int i = 0; i < a; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(a) a.begin(), a.end()
#ifdef LOCAL
#define trace(...) __f... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.