code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define lc(x) ((x)<<1)
#define rc(x) (((x)<<1)|1)
using namespace std;
typedef long long ll;
typedef unsigned ... | #include<bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define sz(x) (int)x.size()
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(),c.en... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
set<string> M(S.begin(), S.end());
for (int i = 0; i < N; i++) {
if (M.count('!' + S.at(i))) {
cout << S.at(i) << endl;
return 0;
}
}
... | #include<bits/stdc++.h>
#include<string.h>
#define ll long long
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define inf 2000000000000
#define mod 998244353
#define ull unsigned long long int
#de... |
#pragma GCC optimize("O3") //
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int... | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 400004;
char tmp[Maxn];
int T;
int n;
string A, B, C;
int nxtA[Maxn][2], nxtB[Maxn][2], nxtC[Maxn][2];
char res[Maxn];
int rlen;
void Read(string &S, int nxt[][2])
{
scanf("%s", tmp);
S = tmp; S = S + S;
nxt[S.length()][0] = nxt[S.length()][1] = S.len... |
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define In inline
#define ll long long
const ll mod = 998244353;
const int N = 2e5;
namespace IO{
In ll read(){
ll s = 0,ww = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-')ww = -1;ch = getchar();}
while('0' <= ch && ch <= '... | #include <iostream>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <string>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <utility>
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
#define mp make_pair
#define pb push_back
#def... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define pii pair<int,int>
#define tiii tuple<int,int,int>
#define pll pair<long long, long long>
#define pdd pair<double, double>
#define s second
#define f first
#define pb push_back
#define oo 1000000000000ll
void s... | #include <bits/stdc++.h>
signed main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int n; std::cin >> n;
std::vector<int> op(n);
for (auto &it : op) {
std::string s; std::cin >> s;
it = (s == "AND");
}
int64_t ans = 1, pw2 = 1;
for (int i = 0; i < n... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x.begin(),x.end()
#define mod 998244353
#define ad(a,b) a=(a+b)%mod;
#define X 5010
ll po(ll... | #include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
struct UF{
vector<int> p;
int n;
UF(int siz){
n = siz;
p.resize(n, 0);
for(int i = 0; i < n; i++) p[i] = i;
}
int parent(int x){
if(p[x] != x) p[x] = parent... |
#include<bits/stdc++.h>
namespace imzzy{
#define endl '\n'
#define rgi register int
#define rgl register long long
typedef long long ll;
class fastin{private:int _ch,_f;
public:inline fastin&operator>>(char&c){c=getchar();return*this;}
template<typename _Tp>inline fastin&operator>>(_Tp&_x){
_x=0;while(!isdigit(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const ll mod = 1e18 + 7;
const int maxn = 1e5+5;
void go() {
int n;stri... |
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#inc... | #include <bits/stdc++.h>
using namespace std;
/*---------------------SAUGATA KUNDU---------------------------*/
#define int long long int
#define INF (int)(1e9+5)
#define MoD (int)(998244353)
//#define debugn(a) cerr << '[' << ( a ) << ']' << '\n'
#define debug(a) cerr << '[' << a << ']' << '\n'
#define clear(a) mem... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int room, ans;
ans = 0;
for (int i = 0; i < N; i++){
for ( int j = 0; j < K; j++){
room = (i+1) * 100 + (j+1);
ans += room;
}
}
cout << ans << endl;
}
| #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>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> cnt(n);
for (int i = 0; i < n; ++i) {
std::string s;
std::cin >> s;
for (int j = 0; j < m; ++j) if (s[j] - '0' == 1) ++cnt[i];
}
long long odd = 0, even = 0;
for (int i = 0; i < n; ++i) {
if (cnt[i] & 1)... | #include <bits/stdc++.h>
#include <string>
#include <cmath>
#include <sstream>
#include <unordered_map>
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for(ll i = (a-1); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ff first
#define ss second
#define spre cou... |
#include <bits/stdc++.h>
using namespace std;
#define tr(c, i) for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ipr pair<int, int>
#define pb push_back
#define ff first
#define ss second
// #define fill... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())
#define ld long double
template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
os<<"("<<p.fir... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const int mod = 998244353;
int inc(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
vector<int> mult(vector<int> &a, vector<int> &b)
{
vector<int> tmp(a.size());
for (int i = 1; i < a.size(); i++)
{
for (int j = i; j < ... |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const int INF = 1e9;
const... | #include <bits/stdc++.h>
using namespace std;
//#define ll long long
int main() {
ios::sync_with_stdio(false);
int h, w, x, y;
cin >> h >> w >> x >> y;
x--; y--;
vector<string> vec(h);
int cnt = 0;
for (int i = 0; i < h; i++) {
cin >> vec[i];
}
for (int i = x - 1; ... |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string x;
char a='.';
cin>>x;
int count =x.size();
for(int i=0;i<count;i++){
if(x.at(i)==a){
break;
}
else{
cout<<x.at(i);
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
long long n;
cin >> n;
int d = to_string(n).length();
long long ans = 0, mul = 1;
for (int i = 1; i <= d - 1; i++) {
ans += (i - 1) / 3 * 9 * mul;
mul *= 10;
}
ans += (d - 1) / 3 *... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll,int>Q;
int main(){
ll n;
cin>>n;
for(ll i=1,j=3;;i++){
Q[j]=i;
if(1e18/3<j)break;
j*=3;
}
for(ll i=1,j=5;;i++,j*=5){
if(j>n)break;
ll k=n-j;
if(Q[k]!=0){
printf("%d %lld\n",Q[k],i);
return 0;
}
if(1e18/5<j)break;
}
pu... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <unordered_map>... |
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define mod 1000000007
#define inf 1e18
#define N 1000043
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define loop(a,b) for(int i=a;i<b;i++)
#define test int t; cin >> t; while(t--)
#define pll pair<ll,ll>
#define int ll
usin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ull maxprim = 1e9 + 7;
ull gcd (ull a, ull b) {
return b ? gcd (b, a % b) : a;
}
int main()
{ ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll tst,n,i,j,ite=0,flg,m,lim,k,l,r,q,res,... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const long long MOD = 1000000007;
int main(){
int n,a;
int x=0;
cin >> n;
vector<bool> c(200001,true);
rep(i,n){
cin >> a;
c.at(a)=false;
while(!c.at(x)) x++;
cout << x... | #include<iostream>
using namespace std;
int main()
{
int64_t n;
cin >> n;
if(n % 2 == 0)
cout << "White" << endl;
else
cout << "Black" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define boost ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//#define mp make_pair
#define pb push_back
#define fp first
#define sp second
typedef long long int ll;
typedef pair<ll,ll> pp;
#define check(x, i) ((x>>i)&1LL)
#define set(x,i) (x|(1LL<<i))
#define unset(x,i... | #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 T> using oset =
tree<T, null_type, less<T>,
rb_tree_tag, tree_order_statistics_node_update>;
#define odrkey order_of_key
#define fbodr find_b... |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef unsigned long long ull;
typedef vector<in... | // Problem: E - White and Black Balls
// Contest: AtCoder - AtCoder Beginner Contest 205
// URL: https://atcoder.jp/contests/abc205/tasks/abc205_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
// C(n + m, n) - C(n + m, n -... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename T>
using omultiset = tree<T, nul... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
const double PI = acos(-1);
using ll= long long;
#define in... |
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<ll,ll> P;
#define mod 1000000007
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x,ll y) {return x/gcd(x,y)*y;}
int main(){
int... | #include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<std::pair<int, int>> conditions(M);
for (auto& [A, B] : conditions) {
std::cin >> A >> B;
A--;
B--;
}
int K;
std::cin >> K;
std::vector<std::pair<int, int>> choices(K);
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ll long long
int main(){
ll n;
cin >> n;
ll ans = 0;
for(ll i=0;i<n;i++){
ll a;
cin >> a;
if(a > 10){
ans += a-10;
}
}
cout << ans << endl;
return 0;
} | #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... |
#include <iostream>
#include <cstdio>
using namespace std;
using ll = long long;
int main() {
ll n, m; cin >> n >> m;
ll array[n], cnt[n] = {0}, ans = n;
for (ll i = 0; i < n; i++) {
cin >> array[i];
}
for (ll i = 0; i < m; i++) {
cnt[array[i]]++;
}
for (ll i = 0; i < n; i+... | /*
ID: Trump
TASK:
LANG: C++
*/
/* LANG can be C++11 or C++14 for those more recent releases */
#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>
#include <cmath>
#define sll(n) scanf("%lld",&n);
#define sll2(a,b) scanf("%lld",&n);
#define sll3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c);
#defin... |
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false);
... | //wtrl,everybody hangbeat me
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctim... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
#include<algorithm>
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 <= ... | // Problem: C - DFS Game
// Contest: AtCoder - AtCoder Regular Contest 112
// URL: https://atcoder.jp/contests/arc112/tasks/arc112_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <cstdio>
#include <set>
const int maxn = 1e5 + 19;
struct Edge{
int to, nex... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n,x;
string s;
cin >> n >> x >> s;
for(int i=0; i<n; i++)
{
if (s[i]=='x')
{
... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<unordered_map>
#include<vector>
#include<unordered_set>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
//Required Headers
using namespace std;
#define PI 3.1415926535897932384626
#define sp(x,y) fi... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define MAX INT_MAX
#define MIN INT_MIN
#define F first
#define S second
#define pb... | #include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... |
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <functional>
#include <queue>
#include <unordered_set>
#include <climits>
#include <set>
#include <list>
#include <cma... | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//while adding and subs check if mod becomes -ve
//while using an integer directly in a builtin function add ll
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Dont keep array name as size or any o... |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pb push_back
#def... | #include <bits/stdc++.h>
using namespace std;
int main(){
string X;
cin >> X;
for(int i=0;i<(int)X.size();i++){
if(X[i]=='.') return 0;
else cout << X[i];
}
} |
#include <bits/stdc++.h>
using namespace std;
#define mp(a, b) make_pair(a, b)
typedef pair<int, int> pii;
const int maxn = 50 + 10;
int n, m, q;
pii a[maxn];
int x[maxn];
int main()
{
scanf("%d%d%d", &n, &m, &q);
for(int i = 1; i <= n; ++i) scanf("%d%d", &a[i].second, &a[i].first);
sort(a + 1, a + n + 1, greater<pi... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll INF = 1e17 + 11;
pair<ll, ll> pll[100];
vector<ll> vpl;
ll dp[100][100];
bool cmp(pair<ll,ll> a, pair<ll,ll> b){
return a.first*b.second < a.second*b.first;
}
ll recur(ll i, ll j, ll n, ll m){
if(i == n or j == m)
return 0;
if... |
#include <bits/stdc++.h>
const int N = 200010;
int T, n;
char a[N], b[N], c[N];
void solve() {
scanf("%d", &n);
scanf("%s%s%s", a + 1, b + 1, c + 1);
int t = (a[2 * n] - '0') + (b[2 * n] - '0') + (c[2 * n] - '0');
if (t == 0 || t == 3) {
if (!t) {
for (int i = 1; i <= 2 * n; i ++) std::cout << '1';
std::... | #include <bits/stdc++.h>
using namespace std;
//#define ONLINE_JUDGE
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define rep(z, x, y) for(int z=x;z<=y;++z)
#define repe(z, x, y) for(int z=x;z<y;++z)
#define repd(z, x, y) for(int z=x;z>=y;--z)
#define repde(z, x, y) for(int z=x;z>y;--z)
#define i... |
#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
string n;
int k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
vector<int> g1, g2;
int keta = n.size();
for (int j = 0; j < ket... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_... |
/*
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>
using namespace std;
#define int long long
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define testcases \
int t; \
cin >> t; \
while (t--)
#define rep(i, j, k) for (int i = j; ... |
#include<iostream>
#include<vector>
#include<iomanip>
#include<set>
#include<algorithm>
#include<unordered_map>
#define ll long long
#define io {ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
#define rt int t;cin>>t;while(t--)
#define r1 int t=1;while(t--)
#define mp make_pair
#define endl '\n'
using namespace std;
u... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,x,num = 0;cin>>n>>x;
vector<int>vec(n);
for(int i = 0; i < n; i++){
cin >> vec.at(i);
if(vec.at(i) == x){
num++;
}
}
int j = 0;
for(int i = 0; i < n; i++){
if(vec.at(i) != x){
cout << vec.at(i) << " ";
}
}
ret... |
#include<iostream>
#include<algorithm>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<list>
#define ll long long
#define str string
#define ld long double
#define vec vector
#define vll vec<ll>
#define vvll vec<vll>
#define vbo ve... | #include<bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;
int ri(){
int n;cin>>n;
return n;
}
int main(){
ll r1=ri(),c1=ri(),r2=ri(),c2=ri();
int ans;
if(r1==r2 && c1==c2) ans=0;
else if(r1+c1==r2+c2 ||... |
#include <bits/stdc++.h>
using namespace std;
//#define ll long long
#define int long long
//#define ull unsigned long long
#define PI pair<int,int>
//#define PI pair<ll,int>
const int maxm=2e5+5;
int d[1<<20];
int e[20];//e[i]为点i的边集
int n,m;
signed main(){
ios::sync_with_stdio(0);
cin>>n>>m;
for(int i=0;i<... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#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 ms memset
#define pb p... | #include <bits/stdc++.h>
using namespace std;
int main() {
using ll = long long;
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<ll> sums(n + 1);
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
sums[i + 1] = sums[i] + a[i];
} el... |
#include <bits/stdc++.h>
using namespace std;
vector<int> son[100010];
int n, pv, f[100010];
bool g[100010];
bool cmp(pair<int, bool> x, pair<int, bool> y) {
if (x.second == y.second) return x.first < y.first;
if (x.second == 0) return x.first < 0;
return y.first >= 0;
}
void dfs(int rt) {
f[rt] = g[rt] = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define m(a) memset(a,0,sizeof(a))
const int N=2e5+5;
int n,m;
int f[N],w[N],T;
vector<int>g[N],b[N];
void work(int k){
int z=g[k].size();
int i,er=0;
w[k]=1;
for(int i=0;i<z;i++){
int y=g[k][i];
work(y);
w[k]+=w[y];
... |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
#define tc(t) int t; cin >> t;while(t--)
#define lp(i, x, y) for(ll i = x; i <= y; i++)
#define lpr(i, x, y) for(ll i = x; i >= y; i--)
#define in1(x) ll x; cin >> x
#define in2(x, y) ll x, y; cin >> x >> y
#define in3(x, y, z) ll x, ... | #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>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define inrange(a, x... | #include <bits/stdc++.h>
#define PB push_back
#define ST first
#define ND second
#define _ ios_base::sync_with_stdio(0); cin.tie(0);
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;
int n,a,b;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll K,n,m,a[100005],b[100005],sl[100005],sr[100005];
bool Check(ll mid){
for(int i=1;i<=K;i++){
ll l=a[i]-mid,r=a[i]+mid;
//cout<<i<<' '<<a[i]+mid<<' '<<r<<' '<<'\n';
l=(l+n-1)/n,r=r/n;
//cout<<i<<' '<<a[i]+mid<<' '<<r<<' '<<'\n';
l=max(l,0ll)... | #include <bits/stdc++.h>
int main(){
int K, N, M;
std::cin >> K >> N >> M;
std::vector< long long > A(K);
for(int i=0; i<K; i++){
std::cin >> A[i];
}
std::vector< long long > B(K);
std::vector< std::pair< long long, long long > > B_zan_i(K);
long long total = 0;
for(int... |
#include <iostream>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
using namespace std;
const int INF = 1 * (1 << 30);
const int mINF = -1 * (1 << 30);
int main()
{
double n;
cin >> n;
n *= 1.08;
int tmp = (int)n;
if (tmp < 206)
{
cout << "Yay!" << endl;
}
e... | # define _GLIBCXX_DEBUG
# define rep(i, n) for (int i=0; i<(int)(n); i++)
# define FOR(i,a,b) for(int i=(a);i<=(b);++i)
# define ALL(a) (a).begin(), (a).end()
# define COUT(x) cout << (x) << endl;
# define KAI() cout << endl;
# define INF 10000000000000000LL
typedef long long ll;
# include <iostream>
# include <string>... |
#pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... | #include<bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
long long N;
cin >> N;
if(N%4 == 2) {
cout << "Same" << endl;
}
else if(N%4 == 0) {
cout << "Even" << endl;
}
else {
cout << "... |
//Problem link :
//done by sanath kumar
#include<bits/stdc++.h>
#include <cstdlib>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define inf 1e9
#define endl "\n"
#define pb push_back
#define vi vector<ll>
#define vs ve... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define RF(type, i, a, b, decr) for (type i = a; i >= (type)(b); i -= (type)(decr))
#define sz(a) sizeof(a)
#define deb(a) cerr ... |
#include <iostream>
#include <string>
using namespace std;
int main() {
string c;
cin >> c;
cout << (c[0] == c[1] && c[1] == c[2] ? "Won" : "Lost") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long N,M,a,b,answer;
int count = 1;
answer = 0;
cin >> N;
M = N;
while (M>9){
M = M / 10;
count++;
}
if (count % 2 != 0)
{
if (count == 1){
cout << 0 << endl;
return (0);}
if (count == 3){
cout << 9 << endl;
return (0);}
if (count == 5... |
#include <bits/stdc++.h>
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 rrep(i,n) for(int i = n - 1 ; i >= 0 ; i--)
#define rrep1(i,n) for(int i = n ; i > 0 ; i--)
#define INF 1001001001
#define MOD 1000000007
using ll = int64_t;
using P = pair<... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <bitset>
#include <vector>
#include <stack>
#include <queue>
#include <unordered_map>
using namespace std;
const int N = 1e5 + 100;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endi... |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pi = pair<int, int>;
using vpi = vector<pair<int, int>>;
#define all(v) (v).begin(), (v).end()
#define ar array
#define PB push_back
... | // 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... |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YES() printf("YES\n")
#define NO()... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
#define rep(i, o) for (int i = 0; i < (o); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
#define NUM 1e5
typedef long lon... |
#include<stdio.h>
#include<stdlib.h>
int search(long *arr, int left,int right, long num){
int mid = (left+right)/2;
if(left == right){
return left;
}
if(arr[mid] == num){
return mid;
}else if(num < arr[mid]){
return search(arr,left,mid,num);
}else{
return search(arr,mid+1,right,num);
}
}
... | #include <set>
#include <iostream>
using namespace std;
#define int long long
const int N = 2e5 + 10;
int par[N], c[N];
set<pair<int, int>> s[N];
void make_set(int x) {
par[x] = x;
s[x].insert({c[x], 1});
}
int find_set(int x) {
if (x == par[x]) {
return x;
}
return par[x] = find_set(par[x]);
}
voi... |
//abc183_e.cpp
//Sun Nov 15 21:30:13 2020
#include <bits/stdc++.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int h,w;
cin >> h >> w;
string s[h];
rep(i,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
ll gcd(ll a, ll b){
while (b>0){
ll tempB = b;
b = ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define endl "\n"
#define deb(x) cout<<#x<<" : "<<x
#define mod (int)1e9+7
#define up upper_bound
#defi... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define p... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, d;
cin >> a>> b>> c;
d = a - b + c;
cout << d;
} | #include<bits/stdc++.h>
//Ctrl + B
using namespace std;
#define endl '\n'
#define nitro {std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);}
#define pi 3.141592653589793
#define mod 1000000007
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(), v.end()
#define dbg(x) cout << x << '\n';
#defi... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int n; int D; int H;
cin >> n >> D >> H;
vector<int> d(n), h(n);
for(int i=0; i<n; ++i) cin >> d[i] >> h[i];
double ans = 0;
for(int i=0; i<n; ++i) {
double b = double(D * h[i] - d[i] * H) / (D - d[i]);
ans = max(ans, b)... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
#include <stack>
#include <iomanip>
#include <climits>
#define MOD 1000000007
#define ll long long int
#include <queue>
using namespace std;
vector <bool> is_prime(10007,true);
void seive()
{
for (int i=2; i<=10007; i++)... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pii pair<int,int>
#define pf push_front
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define ppb pop_bac... | #include <bits/stdc++.h>
using namespace std;
int main(){
int cnt=0;
string S;
cin >>S;
const char* cS=S.c_str();
for(int i=0; i<S.size(); i++){
if(i%2==0){
if(cS[i]>=97){
cnt++;
}
}
else if(i%2==1){
if(cS[i]<97){
cnt++;
}
}
}
if(cnt==S.size()){
... |
#include <bits/stdc++.h>
#include <unistd.h>
//#include <atcoder/all>
#if __has_include(<local.h>)
#include <local.h>
#endif
using namespace std;
//using namespace atcoder;
typedef long long int LL;
typedef long long int LLint;
//Faster Program
#define endl "\n"
//Faster Coding
#define ED return
#define GET(a) int... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int (i) = 0; (i) < (n); ++(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(),(x).end()
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... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, fib[100];
int main() {
fib[0] = fib[1] = 1;
for (int i = 2; i < 100; i++) fib[i] = fib[i - 1] + fib[i - 2];
cin >> n;
int m = 86;
vector<int> ans;
for (int i = 0; i <= m; i++) {
if (i % 2 == 0) {
if (n >= fib[m - i]) {
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll read(){
ll sum=0,f=1;
char s=getchar();
while (s<'0' or s>'9'){
if (s=='-')f=-1;
s=getchar();
}
while (s>='0' and s<='9'){
sum=sum*10+s-'0';
s=getchar();
}
return sum*f;
}
ll N=1e10*3-1;
bool a[3];
char s[3]={'1','1','0'};
int main(){
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
string N;
int K;
cin >> N >> K;
long A = stoi(N);
rep(i, K) {
string J = to_string(A);
string G, H;
sort(J.begin(), J.end());
H = J;
reverse(J.begin(), J.end());
G = J;
A = stoi... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ll long long
ll n,m,cnt,ans = -0x3f3f3f3f;
ll head[200005];
ll val[200005],maxx[200005],minn[200005];
int vis[200005];
struct K{
ll val,num;
}p[200005];
struct P{
ll to,next;
}e[400005];
void add(ll x,ll y){
e[++cnt... |
#include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pii std::pair<int, int>
#define pdd std::pair<double, double>
#define INF (1LL << 33)
#d... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<tuple>
#include<cstring>
#include<bitset>
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((ll)(x).... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#define FUP(i,x,y) for(int i=(x);i<=(y);i++)
#define FDW(i,x,y) for(int i=(x);i>=(y);i--)
#define MAXN 200010
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define ll long long
#define db double
using names... | //*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#i... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=3e6+5;
int n;
int c[maxn],k,now;
signed main() {
// freopen("data.in","r",stdin);
// freopen("data.out","w",stdout);
cin>>n>>k;
for(register int i=1; i<=3*n; i++)c[i]=i*(i-1)/2;
for(register int t=3; t<=3*n; t++) {
int w=c[t-1];
// ... |
#pragma GCC optimization ("O3")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pair<ll,ll>,null_type,less<pair<ll,ll>>, rb_tree_tag,tree_order_statistics_node_update>
typedef tree<long long,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T>
void view_1d(vector<T> V, string sep) {
for (ll i=0; i<V.size(); i++) {
cout << V[i];
if (i == V.size() - 1) {
cout << endl;
} else {
cout << sep;
}
}
}
template<typ... |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, ans;
cin >> x >> y >> z;
ans = y * z / x;
if (ans*x == z*y)
ans -= 1;
cout << ans << endl;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
#ifdef LOCAL
#include "/media/brayand/BrayanD/debugger.h"
#else
#define db(...) false
#define dbl(...) false
#define dbg(...) false
#define dbm(...) false
#define dbs(...) false
#define dbas(...) false
#endif
const int MAXN = 10000;
int32_t main(... | #include <iostream>
using namespace std;
int N;
int main()
{
cin >> N;
cout << "6 10 15"; N -= 3;
for (int i = 16; N; i++)
{
if (i % 6 == 0 || i % 10 == 0 || i % 15 == 0) {N--; cout << " " << i;}
}
cout << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n); for (int i = 0; i < (int)(n); i++)
#define rep1(i,n); for (int i = 1; i <= (int)(n); i++)
int main()
{
int n;
cin >> n;
cout << 100-(n%100) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 2e5+5;
int main() {
int x;
cin >> x;
cout << 100 - x % 100;
}
|
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<ll,ll> Pll;
... | #include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#define MAXN 200005
#define max_num 1000000
#define LL long long
using namespace std;
int n, m;
int l[MAXN], r[MAXN];
int main()
{
while(cin >> n >> m)
{
if(m < 0 || m == n || (m == n - 1 && n - 1 > 0))
{
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// 繰り返し自乗法(x^nをmで割った余り) O(logn)
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int mai... | #include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)1e9 * (long long)1e9;
map<int, int>mods;
long long calculateMod(long long b, long long c, int mod) {
// oblicz reszte z dzielenia b^c przez mod, mod <= 5
if (c == 1) return b%mod;
if (c == 0) return 1;
b %= mod;
long long half =... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, ans;
string ans1;
cin >> a >> b >>c;
if(a != b){
ans = max(a,b);
if(ans ==a){ans1 = "Takahashi";}
else{ans1 = "Aoki";}}
else{
if(c==0){
ans = 0;}
else{ans = 1;}
if(ans ==1){ans1 = "Takahashi";}
else{ans1 ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if((a>b)||(a==b&&c==1))
printf("Takahashi");
else printf("Aoki");
return 0;
}
|
#pragma GCC optimize ("-O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a) a.re... | //Iamskk//
#include <iostream>
#include <iosfwd>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cassert>
#include <cctype>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#include <queue>
#include <stack>
#include <map>
#inclu... |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
const ll INF = 1ll<<60;
struct Edge{
int to;
int weight;
int k;
Edge(int t, int w, int k): to(t), weight(w), k(k) {}
};
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m, x... | //*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<"... |
#include <bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mem(a,b) memset(a, b, sizeof(a))
#define f first
#define s second
#define S size()
#define pb(x) push_back(x)
typedef double D;
typedef long long ll;
typedef long double ld;
const int MOD=(int)1e9+7,M... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int S(int x) {
if (x==0) return 0;
return x%10 + S(x/10);
}
int main() {
ios_ba... |
#include <bits/stdc++.h>
using ull = unsigned long long int;
using ll = long long;
using ld = long double;
using pii = std::pair<int,int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int> ;
using vvi = std::vector<vi> ;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i < i##end; ++i)
#define per(i, a, b) for (int i = (a) - 1, i##end = (b); i >= i##end; --i)
#define REP(i, a) rep(i, 0, a)
#define PER(i, a) rep(i, a, 0)
namespace IO {
const int MAXIOSIZE = 1 << 24 | 1;
unsigned char... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
using namespace std;
typede... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
using lint = long long;
void solve() {
int n;
cin >> n;
lint ans = 0, sum = 0;
map<lint, lint> cnt{{0, 1}};
for (int i = 0; i < n; ++i) {
lint x;
cin >> x;
if (i % 2) x = -x;
sum += x;
... |
/*if ((double) ((double)(clock() - cl)/(double)CLOCKS_PER_SEC)>1.85) {break;}*/
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define double long double
#define ft first
#define sc second
#define pb push_back
#define booost ios_base::sync_with_std... | ///Bismillahir Rahmanir Rahim
#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 FAST ios::sync_with_stdio(0); cin.tie(0)
#define int long long
#define pb push_b... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const... | #include <cstdio>
#include <cstring>
#define N 100010
using namespace std;
int n;
char s[N];
int main(){
// freopen("funny.in", "r", stdin);
scanf("%d", &n);
scanf("%s", s+1);
if (s[1]!=s[n]){
printf("1\n");
}
else{
bool pd=0;
for (int i=2; i<=n; i++){
if (s[i]!=s[1] && s[i-1]!=s[1]) pd=1;
}
if (pd... |
#include <bits/stdc++.h>
int main() {
long long int S, P;
std::cin >> S >> P;
long long int max = std::sqrt(P) + 1;
bool flag = false;
for (long long int i = 1; i < max; i ++) {
if (P % i == 0 && (S - i) * i == P) {
flag = true;
break;
}
}
if (flag... | #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;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fast ios_base::sync_with_stdio(0);ci... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll merge_cnt(vector<int> &a) {
int n = a.size();
if (n <= 1) { return 0; }
ll cnt = 0;
vector<int> b(a.begin(), a.begin()+n/2);
vector<int> c(a.begin()+n/2, a.end());
cnt += merge_cnt(b);
cnt += merge_cnt(c);
int ai... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define NUM 300005
ll first_N;
ll uniformity[6*NUM],partial[6*NUM];
ll N = 1;
ll A[NU... |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <iomanip>
#include <cctype>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
ios::sync_with_stdio(false);
vector<int> a(4); rep(i, 4) cin >> a[i];
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
int x=min({a,b,c,d});
cout<<x<<endl;
} |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define itn int
#define ll long long
using namespace std;
ll read(){
ll a=0,b=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')b=-1;c=getchar();}
while(c>='0'&&c<='9')a=a*10+c-48,c=getchar();
return a*b;
}
const long double... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i... |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N ;
cin >> N ;
for(int i = 0 ; i < N ; i++) cout << (2*i + 1 )%N + 1<< " " << (2*i + 2)%N + 1 << endl;
} | ///Bismillahir Rahmanir Rahim
#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 FAST ios::sync_with_stdio(0); cin.tie(0)
#define int long long
#define pb push_b... |
#line 1 "main_d.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cstdint>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#in... | #include<bits/stdc++.h>
#define int ll
#define sz(x) int((x).size())
#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 pi = pair<int,int>;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int minf = 0xc0c0c0c0c0c0c0c0;
int A[100100];
s... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,n) for(ll i=0;i<n;i++)
#define loopn(i,j,n) for(ll i=j;i<n;i++)
#define m_arr(arr, n) vector<ll>arr(n)
#define m_arre(arr) vector<ll>arr
#define m_set(sat) set<ll>sat
#define ppn(name) pair<ll,ll>name
#define pp pair<ll,ll>
#define sort_al... | #pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,l,r) for(int i=(l),i##_len=(r);i<i##_len;++i)
#define repr(i,l,r) for(int i=(r)-1,i##_left=(l);i>=i##_left;--i)
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
const ll INF... |
/*
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ?
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
*/
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S s... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e6+1;
const int neginf = -1*1e8;
int main(){
vector<ll> arr(maxn+1, 0);
ll l, r; cin>>l>>r;
for(ll i = 2; i <= r; i++){
if(arr[i]!=0)continue;
for(ll j = i; j<= r; j+= i)arr[j]++;
for(ll j = i*i; j... |
#include <bits/stdc++.h>
using namespace std;
// int gc(int n){
// if(n<1){
// return 0;
// }
// return n+gc(n-1);
// }
int main()
{
int n;
cin>>n;
// int hi=n;
// int lo=1;
// int mid;
// while(hi-lo>1){
// mid=(hi+lo)/2;
// if(gc(mid)<n) lo=mid+1;
// ... | // youngjinp20
// 2021 06
#include<stdio.h>
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; }
#define byr(x) [](const auto& a, const auto& b) { return a.x > b.x; }
#define smax(a, b) ((a) < (b) ? ((a)=(b), true)... |
#include<cstdio>
#include<iostream>
using namespace std;
const int N=4e5+5;
char a[N];
const int sum='B'+'W'+'R';
inline char ch(char x,char y)
{
if(x==y)return x;
return sum-x-y;
}
int main()
{
int n;cin>>n>>a+1;
for(int i=177147;i;i/=3)
{
if(n<=i)continue;
for(int j=1;j<=n-i;++j)
a[j]=ch(a[j],a[j+i]);
n... | #include <iostream>
#include <vector>
using namespace std;
#include <iostream>
#include <cassert>
template<long long mod>
class modint{
private:
using T = long long;
T a;
public:
constexpr modint(const long long x = 0) noexcept : a((x%mod+mod)%mod) {}
constexpr T& value() noexcept { return a; }
constexpr co... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
#include <i... | /*#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")*/
// only when really needed
/* GNU G++17 7.3.0: No long long for faster code
GNU G++17 9.2.0 (64 bit, msys 2): Long long only for faster code */
#include <bits/stdc++.h>
#define for1(i,a,b) for (int i = a; i <= b; i++)
#define for2(i,a,b) fo... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <list>
#include <iterator>
using std::cout;
using std::cin;
using std::string;
using std::vector;
using std::endl;
int main()
{
double t, n;
cin >> t >> n;
double ans = (100 + t) * (n / t... |
// Problem: D - Message from Aliens
// Contest: AtCoder - ZONe Energy Programming Contest
// URL: https://atcoder.jp/contests/zone2021/tasks/zone2021_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
usi... | #include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#d... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
if (a1 > a2) swap(a1, a2);
if (a2 > a3) swap(a2, a3);
if (a1 > a2) swap(a1, a2);
if (a2 - a1 == a3 - a2) cout << "Yes" << endl;
else cout... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;cin>>a>>b>>c;
a+=b+c;
cout<<21-a;
return 0;} |
#include <cassert>
#include <cstdint>
#include <iostream>
#include <vector>
#define REP_(i, a_, b_, a, b, ...) \
for (int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
using namespace std;
using Int = int64_t;
template <class T>
struct Matrix {
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define n_l '\n'
#ifndef ONLINE_JUDGE
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return ... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include<iostream>
#include<vector>
#include<cstring>
using namespace std;
int map[1505][1505]; //-1标记block,0暂时没有照亮的地方,1照亮的地方,2标记bulb
typedef struct node {
int x;
int y;
}NODE;
int main() {
int h, w, n, m, ans = 0;
cin >> h >> w >> n >> m;
vector<NODE> N, M;
NODE p;
memset(map, 0, sizeof(map));
for (i... |
#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int cnt = 0;
for (int i = 1; i <= n; i++) {
stringstream ss10;
ss10 << dec << i;
string s10 = ss10.str();
stringstream ss8;
ss8 << oct << i;
string s8 =... | #include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<stdio.h>
#include<math.h>
#include<string>
#include<new>
#include<iterator>
using namespace std;
int main()
{int n;
cin>>n;
if(n==1){
cout<<"0"<<endl;
}
else{
int k=n-2;
cout<<k+1<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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 ALL(v) (v).begin(),(v... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,t) for(int i = (int)(s); i < (int)(t); i++)
using p = pair<int,int>;
ll func(int n, int k){
return max(0, min(k - 1, 2*n + 1 - k));
}
int main(){
int n,k;
cin >> n >> k;
ll ans = 0;
rep(i,2,2*n+1){
ans += fu... |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 998244353
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __b... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define mod 1000000007
#define ad(a,b) a=(a+b)%mod;
#define X 200010
ll po(ll x,ll y){
ll res=1;
for(;y;y... |
#include <cstdio>
const int maxn=2e5+10;
int a[maxn];
int b[maxn];
int p[maxn];
int f1[maxn];
int f2[maxn];
int ans=0;
int vis[maxn];
int mx=0;
void Dfs1(int x){
if(vis[x])
return;
vis[x]=1;
if((!mx)||a[x]>a[mx])
mx=x;
Dfs1(p[x]);
}
void Dfs2(int x){
if(x==mx)
return;
f1[++ans]=mx;
f2[ans]=x;
Dfs2(p[x]);
... | #include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=a,i##_end=b;i<i##_end;++i)
using ll=long long;
using pii=pair<int,int>;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
const int mo=1e9+7;
using L=__int128;
ll Pow(ll a,ll b,ll p=mo){ll r=1;for(;b;b>>=1,a=(L)a*a%p)if... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
enum RideType{
a,
b,
none,
};
struct ride{
int person_id;
int other_pos;
RideType ride_type;
};
int main(){
int n;
cin >> n;
vector<ride> v(2*n+1, {-1, -1, RideType::none});
for(int i=1; i<=n; ++i){
in... | #include <bits/stdc++.h>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj... |
#include <stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int cnt = 0;
int a[1010],n;
int same=0;
cin >> n;
rep(i,n) cin >> a[i];
sort(a,a+n);
rep(j,n){
... | #include<bits/stdc++.h>
#include<tuple>
typedef long long ll;
#define INF 9999999999
#define mod 998244353
#define eps 1e-12
using namespace std;
typedef tuple<ll,ll,ll,ll>tu;
ll n;
string s,t;
vector<ll>a,b;
int main(){
ll i,j;
ios::sync_with_stdio(0);
cin>>n;
cin>>s>>t;
for(ll i=0;i<s.size();i++)
... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... | #include<bits/stdc++.h>
using namespace std;
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;
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mod 1000000007
#define endl "\n"
#define test ll txtc; cin>>txtc; while(txtc--)
typedef long long int ll;
int main() {
FIO;
ll n,m; cin>>n>>m;
vector<ll>a(n),b(m);
for(auto &it:a) cin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define irep(i,a,b) for(int i=int(a);i<(int)b;++i)
#define rrep(i,a,b) for(int i=int(a);i>=(int)b;--i)
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll,ll>>>
#... |
#include <stdio.h>
#include <memory.h>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const int mod = 1000000007;
const int N = 200005;
int d[N] = { 0 }, ans[N] = { 0 }, id2 = 0, tol = 0;
bool u[N] = { 0 };
vector<int> my[N];
void dfs(int x) {
int i = 0, y = 0;
for (i = 0; i < my[x]... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chm... | #include <iostream>
using namespace std;
int main() {
char S, T; cin >> S >> T;
char r = (S == 'Y') ? T + 'A' - 'a' : T;
cout << r << '\n';
cin.ignore(2); return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.