code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define FOR(i, a, b) for (ll i=a; i<(b); i++)
#define FORD(i, a, b) for (int i=a-1; i>=(b); i--)
void solve () {
ll ans = 0;
ll n;
cin >> n;
vector<ll> a(n);
FOR(i, 0, n) cin >> a[i];
FOR(i, 0, n) {
... | #include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define vvi vector<vector<int>>
#define Pii pair<int,int>
#define SS second
#define F first
const int mod = 998244353;
#define ld long double
#define sp fixed<<setprecision(9)
const int inf =1e18+7;
using namespace std;
#define db(...) __f(#__VA_... |
#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define pii pair<int,int>
using namespace std;
const int mn=3006;
int n,a[mn];
int main()
{
scanf("%d",&n);
a[1]=6,a[2]=10,a[3]=15;a[0]=3;
for(int i=1;i<=10000;++i) {
if(i==6||i==10||i==15) continue;
if(i%6==0||i%10==0||i%1... | #include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
#define all(x) x.beg... |
#include<iostream>
#include<algorithm>
using namespace std;
bool mysolve(int arr[4]){
int sum = 0;
for(int i = 0 ; i< 4 ; i++){
sum+=arr[i];
}
int flag = 0;
for(int i = 0 ; i< 4; i++){
if(arr[i]==(sum-arr[i]))
{flag=1;break;}
}
for(int i = 0 ; i< 4; i++){
for(int j = i + ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a==b+c+d)return puts("Yes"),0;
if(b==a+c+d)return puts("Yes"),0;
if(c==b+a+d)return puts("Yes"),0;
if(d==b+c+a)return puts("Yes"),0;
if(b+a==c+d)return puts("Yes"),0;
if(a+c==b+d)return puts("Yes"),0;
if(b+c==a+d)return p... |
// https://atcoder.jp/contests/abc191/tasks/abc191_e
#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 ALL(x) x.begin(), x.end()
using str = string;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vect... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::vector;
const int N = 200005;
vector<int> to[N];
int dep[N];
int in[N];
int out[N];
int k;
vector<int> ls[N];
void dfs(int v, int d) {
in[v] = k++;
dep[v] = d;
for (int u : to[v]) dfs(u, d + 1);
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<tuple<long long,long long,long long>> a(n);
for(int i=0;i<n;i++){
cin>>get<0>(a[i])>>get<1>(a[i])>>get<2>(a[i]);
get<2>(a[i])=max(0ll,get<2>(a[i])-get<0>(a[i]));
if(get<2>(a[i])==0) get<0>(a[i])=10*10*10*10*10*10*10*10*10... |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long n, a, b, x, mn = 10000000000, pre = 0, d = 0;
cin>>n;
while(n--){
cin>>a>>b>>x;
d = d + a - pre;
x = x - d;
if(x > 0) mn = min(mn, b);
pre = a;
}
if(mn == 10000000000) cout<<-1<<endl;
else cout<<mn<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define LOCAL
#endif
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<ll> vi;
typedef vector<pll> vpll;
const long infl=0x3f3f3f3f3f3f3f3fLL;
const int infi=0x3f3f3f3f;
#define endl '\n'
#define pb p... | // Write CPP code here
#include <bits/stdc++.h>
using namespace std;
// function to Count pairs in an array whose
// absolute difference is divisible by k
void countPair(long int arr[], long int n, long int k)
{
// long intialize the count
long int cnt = 0;
// making every element of arr in
// range 0 to k - 1
... |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5, M = 1e3 + 5;
#define int long long
#define double long double
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
char s[1111];
void solve() {
cin>>s+1;
for(int i=1;i<=strlen(s+1);i++){
if(i&1) {
if(s[i]>='A'&&s[i]<=... | #include<bits/stdc++.h>
#define inf 1e18
#define endl "\n"
#define loop(i,x,y) for(int i = x; i < y ; i++ )
#define in(n) int n; cin>>n;
#define inarr(arr,n) int arr[n]; for(int i = 0; i < n ; i++){cin>>arr[i];}
#define maploop(x) for(auto itr = x.begin(); itr != x.end();itr++)
#define int long long
using namespa... |
//~ author : Sumit Prajapati
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define int long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const int INF = 1e9;
int main(){
int n, k;
cin >> n >> k;
vector<vector<int>> g(n);
rep(i,n-1) {
int u, v;
cin >> u >> v;
u--; v--;
g[u].push_back(v);
g[v].push_back(u);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
template<class T> T T_INF(){ return 1000000000000000000; }
template<> int T_INF<int>(){ return 1000000000; }
struct Tree{
int n;
vector<vector<pair<int,int>>>... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define eb emplace_back
#define pb push_back
#define all(c) (c).begin(), (c).end()
... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
templ... |
/*
author: Maksim1744
created: 10.04.2021 15:15:03
*/
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*mi... | #line 1 "main.cpp"
/**
* @title Template
*/
#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"
template <class T, class U>
constexpr bool chmin(T &lhs... |
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <cmath>
#include <climits>
#include <fstream>
using namespace std;
const long long INF = LLONG_MAX;
const long long MOD = 1000000007;
typedef pair<i... | #include <bits/stdc++.h>
#include <cmath>
#include <unordered_set>
using namespace std;
using ll = long long;
using vi = vector<int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> A(n);
for(int i = 0; i < n; i++){
ll a;
cin >> a;
A.at(i) = a;
}
sort(A.begin(), A.end(... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
//memset(dp, 0, sizeof(dp));
void work(int T) {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
string s;
cin >> s;
if(s == "AND") {
a[i] = 1;
} else {
a[i] = 0;
}
}
vector<vector<ll>> dp(n + 1, vector<ll>(2));
d... | #include<bits/stdc++.h>
#define rep(a,b,c) for(register int a=(b);a<=(c);++a)
#define dow(a,b,c) for(register int a=(b);a>=(c);--a)
using namespace std;
const int MaxN=1000000+5;
int lef[MaxN],rig[MaxN];
bool usd[MaxN];
int main()
{
register int n;
scanf("%d",&n);
register int pos,typ;
rep(i,1,n)
{
scanf("%d%d",... |
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... |
#include <bits/stdc++.h>
using namespace std;
//begin of def
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
#define endl '\n'
using lli = long long int;
using ulli = unsigned long long int;
using Ld = long double;
using pii = pair<int, int>;
using pll = pair<lli, lli>;
using pld = pair<Ld, Ld>;
#define X... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define rep(i, n) for(int i = 0; i < (int) n; i++)
#define repd(i, n) for(int i = (int) (n - 1); i >= 0; i--)
#define FOR(i, a, b) for(int i = a; i <= (int) b; i++)
#define FORD(i, a, b) for(int i = a; i >= (int) b; i--)
template <typename T>
v... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define sz size()
#define pi acos(-1.0)
#def... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(NULL);
ll i,j,k,l,m,n,t;
char s,c;
cin >> s;
cin >> c;
if(s == 'Y')
cout << (char)toupper(c) << '\n';
else
cout << c << '\n';
} | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define fi first
#define se second
#define endl '\n'
#define sf(n) scanf("%d",&n);
#define pf(n) printf("%d\n",n);
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0)
int main()
{
fast_io;
char v1,v2,v3;
cin >> v1 >> v2 >> v3;
if(v... |
#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
void solve() {
int n, ans = 0;
cin >> n;
vector<array<int, 2>> v(n), w(n);
for (int i=0;i<n;++i) {
cin >> v[i][0] >> v[i][1];
}
for (int i=0;i<n;++i) {
cin >> w[i][0] >> w[i][1];
}
if (n == 1) {
co... |
#include <bits/stdc++.h>
using namespace std;
#define FI freopen("../in", "r", stdin)
#define FO freopen("../out", "w", stdout)
#define X first
#define Y second
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typ... | #include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define pb push_back
#define PI 3.141592653589793
#de... |
/** I can do this all day **/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define all(x) (x).begin(),(x).e... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
/**********************************************/
bool rec(set<char> s, map<char, vector<pair<int, int>>>& mp, vector<string>& num) {
if (mp.empty()) {
for (int i = 0; i < 3; i++) {
if (num[i][0] == '0') r... |
#include<iostream>
#include<iomanip>
#include<bitset>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<set>
using namespace std;
using ll=long long;
int main(){
int N;
string S;
cin >> N >> S;
N++;
vector<int> A(N);
fo... | /*
* author :Sadik Hassan(_sad_)
*
*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define nl "\n"
#define pb push_back
... |
#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;
#pragma GCC optimize("Ofast")
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#def... | #include <bits/stdc++.h> // include every standard library
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef p... |
#include <bits/stdc++.h>
using namespace std;
mt19937 rand_mt(42);
const int N = 20;
class Genome{
public:
Genome(const vector<string>& S): sequences(S){
// auto dna = init_random();
auto dna = init_bf();
for(int i=0; i<N; i++){
dna_w[i] = dna[i];
for(int j=0; j... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<endl
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... |
#include <iostream>
using namespace std;
int main(void) {
unsigned long long n, n1, m;
cin >> n;
n1 = n + 1; // n+1本目の残り長さ
m = 1; // 最初に切る木の長さ = n+1本目の木で賄えた本数 - 1
while(true)
if (n1 >= m) {//次の長さの木を賄えたら
n1 -= m; //n+1本目の木を切る
m++; //次に賄う木の長さ+1増加 = n+1本目の木で賄えた本数 + 1
} else
break... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}e... |
#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 200005
#define N 1000005
#define MP make_pair
#define debug() cerr<<"Why So Serious?"<<endl
typedef long long ll;
typede... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,a[2200000],mex,nums[2200000];
vector<int> v;
cin >> n >> m;
for(int i=0; i<n; i++) {
cin >> a[i];
if(i<m) v.push_back(a[i]);
}
sort(v.begin(),v.end());
int now=0;
bool ok=true;
for(int i=0; i<m; i++){
if(v[i] == now) now++;
... |
#include <bits/stdc++.h>
using namespace std;
#define stp(var, init, end) for (auto var = init; var < end; ++var)
#define stpe(var, init, end) for (auto var = init; var <= end; ++var)
#define stpi(iter, array) for (auto iter = array.begin(); iter != array.end(); ++iter)
#define ll long long
int main(void)
{
int a... | #include<bits/stdc++.h>
using namespace std;
int a,b,c;
int main()
{
cin>>a>>b>>c;
if(a==b)cout<<c;
else if(b==c)cout<<a;
else if(a==c)cout<<b;
else cout<<0;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 998244353
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.begin(),v.end()... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#i... |
#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;
// #pragma GCC optimize("O2")
typedef long long int ll;
typedef long double ld;
typedef map <ll,ll> mm;
typedef vector <ll> mv;
typedef pair <ll,ll> mp;
typedef set <l... | #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<int> a(n);
int ma=0;
rep(i,n){
cin>>a[i];
ma = max(a[i],ma);
}
int ans=0;
int index;
for (int i = 2; i <= ma; i++)
... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
const int N = 500005;
char s[N], e[N];
vector<int> v[2];
vector<int> df;
int t[N];
int n;
int lowbit(int x){
return x & -x;
}
void add(int x, int w){
while(x <= n){
t[x] += w;
x += lowbit(x);
}
}
int ... | // #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
int main(){
int n;
cin>>n;
vector<ll> lista(n+1);
for(int i = 1; i<=n; i++){
cin>>lista[i];
}
vector<vector<ll> > dp(n+1, vector<ll>(n+1, 0));
for(int i = 1; i<=n; i++){
dp[i][1] = 1;
}
for(int i = 2; i<=n; i... | #include <bits/stdc++.h>
using ll=long long;
using ld=long double;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
ll p=998244353;
vector<ll> a(200100);
vector<ll> b(200100);
ll powk(ll k,ll n){
ll ans=1,m=k;
while(n){
if(n%2) ans=ans*m%p;
m=m*m%p; n/=2;
}
return ans;
}
void comb1(){
a[... |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
char c1, c2, c3;
cin >> c1 >> c2 >> c3;
if ((c1 == c2) && (c2 == c3))
cout << "Won" << endl;
else
cout << "Lost" << endl;
return 0;
} |
// C++ (GCC9.2.1) AtCoder
/*
Ctrl+Option+N で 実行
*/
#include <bits/stdc++.h>
#define INF 100000000000
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl;
typedef long long ll;
using namespace std;
int main() {
ios... |
/**
* 問題順: D
* 問題名: Base n
* 実行時間制限: 2 sec
* メモリ制限: 1024 MB
* 配点: 400点
* URL: https://atcoder.jp/contests/abc192/tasks/abc192_d
* 最終結果: WA
* 問題分類: 数学, 数え上げ
* アルゴリズム: 二分探索
*/
#include<iostream>
using namespace std;
using ll = long long;
string X;
ll M;
bool isOK(ll d) {
ll x=0,tM=M;
int i;
int Mlen=0;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int sum_digit(int n){
int res = 0;
while(n){
res += n%10;
n /= 10;
}
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
int x = sum_digit(a);
int y = sum_d... |
#include <bits/stdc++.h>
#ifdef _DEBUG
#include "_DEBUG.hpp"
#endif
#define int long long
using namespace std;
using P = pair<int, int>;
const int inf = 2e18;
const int mod = 1e9 + 7;
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <class T>
v... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
while(n!=0&&n%10==0){
n/=10;
}
int k=0;
int o=n;
while(o!=0){
k*=10;
k+=(o%10);
o/=10;
}
if(k==n){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef APURBA
#include "DEBUG_TEMPLATE.h"
#define HERE cout<<"here - "<<__LINE__<<"\n";
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss)... | #include<bits/stdc++.h>
const int N=1e5+100;
using namespace std;
int n;
void run(){
cin>>n;
string a,b,c;
cin>>a>>b>>c;
for(int i=1;i<=n;i++)cout<<0;
for(int i=1;i<=n;i++)cout<<1;
cout<<0<<endl;
}
int main(){
int T;cin>>T;
while(T--)
run();
} |
#include <bits/stdc++.h>
#define ar array
#define ll long long
#define endl '\n'
using namespace std;
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
int MAX = INT_MAX;
long long LMAX = LONG_LONG_MAX;
vector<vector<int>> a;
bool check[2000];
void dfs(int c) {
if(check[c]) return;
che... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<tuple<int,int,int>> a;
int b[4][2] = {{0,0},{0,-1},{1,0},{1,-1}};
for(int i = 0; i< n;i++){
int type;
cin >> type;
int inp1,inp2;
cin >> inp1 >> inp2;
a.push_back(make_tuple(type,inp1,inp2));
... |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("O3")
#define DIM 200009
#define INF ((long long)1e18+9ll)
#define pairll pair<long long,long long>
#define fi first
#define se second
#define ld long double
#define amen exit(0)
#define endl '\n'
#define MODULO 998244353
#define fast ios_base::s... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define int long long
template <class T>
bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a,... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef long long LL;
typedef unsigned long long ULL;
int main()
{
int a, b;
cin >> a >> b;
cout << 1.0 * (a - b) / a * 100 << endl;
return 0;
} |
#include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIR... | #include <bits/stdc++.h>
using namespace std;
#define M_PI 3.14159265358979323846
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> ipair;
typedef pair<ll, ll> llpair;
/*
Author: Koushik Sahu
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k,m;
cin>>n>>k>>m;
vector<int> v(n-1);
int l=0;
for(int i=0;i<n-1;i++){
cin>>v[i];
l+=v[i]-m;
}
l-=m;
if(l>=0) cout<<0<<endl;
else if(-1*l<=k) cout<<-1*l<<endl;
else cout<<-1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, m; scanf("%d%d%d", &n, &k, &m);
int sum = 0;
for (int i = 0; i < n-1; i++) {
int x; scanf("%d", &x);
sum += x;
}
for (int i = 0; i <= k; i++) {
if ((sum + i) / n >= m) {
return !printf("%d\n", i);
}
}
printf("-1\n");
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin>>x;
for(int i= 1; i<=1001; i++){
if(i*100 > x){
cout<<i*100-x;
break;
}
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... |
#include <bits/stdc++.h>
long long c[61][61];
using namespace std;
int main(){
c[0][0]=1;
for(int i=1;i<=60;i++){
c[i][0]=1;
for(int j=1;j<=i;j++){
c[i][j]=c[i-1][j-1]+c[i-1][j];
}
}
int a,b;
long long k;
cin>>a>>b>>k;
int n=a+b;
for(int i=1;i<=n;i++){
if(c[n-i][b]>=k){
cout<<'a';
a--;
}
el... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <bitset>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cassert>
#include <random>
using namespace std;
void solve();
int main() {
#ifde... | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
using namespace std;
#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++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define vec vector
#define rip return 0
type... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
... | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FI... |
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define P 998244353
#define rep(i,n) for(i=0;i<n;++i)
#define re(i,a,n) for(i=a;i<=n;++i)
#define repr(i,a,n) for(i=a;i>=n;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
ll binpow(ll x, ll y, ll p)
{
ll res ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define IN(x,c) (find(c.begin(),c.end(),x) != (c).end())
#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 INIT(a,v) memset(a,v,sizeof(a))
#define SORT_UNIQUE(c) (so... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define _GLIBCXX_DEBUG //gccで配列[]を使った時にバグを検出してくれる
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define mset(a, b) memset(a, b, sizeof(a))
using ll = long long;
using pii = pair<int, int>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<c... |
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans[n];
ans[0] = 1;
for(int i=1;i<n;i++) {
ans[i] = ans[i-1] * (n-i) / i;
}
/*for(int i=0;i<n;i++) {
cout << ans[i] << " ";
}
cout << endl;*/
cout << ans[11] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph=vector<vector<int>>;
const long long INF = 1ll << 60;
std::vector<std::vector<long long>> comb(int n, int r) {
std::vector<std::vector<long long>> v(n + 1,std::vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i]... |
//g++ -std=gnu++14 a.cpp
// ./compile_run.sh
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#inc... | #include<bits/stdc++.h>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <set>
#include <cassert>
#include <numeric>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
#define ALL(a) (a).begin(),(a).end()... |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> v(2, 1);
vector<int> solve();
int main() {
for (int i = 2;; ++i) {
if (v[i - 2] + v[i - 1] >= 1e18) break;
v.push_back(v[i - 2] + v[i - 1]);
}
cin >> n;
auto res = solve();
cout << res.size() << endl;
for (auto p : res) ... | #include <bits/stdc++.h>
using namespace std;
long long X;
vector<long long> fibo = {0,1};
vector<int> ans = {1};
bitset<100> bs;
int main() {
scanf("%lld", &X);
while (fibo[fibo.size()-2] + fibo[fibo.size()-1] <= X) fibo.push_back(fibo[fibo.size()-2] + fibo[fibo.size()-1]);
int K = fibo.size();
X -= ... |
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> v(4);
int sum = 0;
for(int i=0;i<4;i++){
cin >> v[i];
sum += v[i];
}
for(int i=1;i<16;i++){
int tsum = 0;
for(int j=0;j<4;j++){
if(i & (1<<j)){
tsum += v[... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define POPCOUNT(x) __builtin_popcount(x)
template <typename T> void chmin(T &a, const T &b) { a = min(... | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<cstdlib>
#include<bitset>
using namespace std;
#define FAST ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef long long ll;
ll siz[200005],pa... |
#include <bits/stdc++.h>
int main(){
int N;
std::cin >> N;
long A[N];
long ans;
long hoge;
ans =0;
hoge=0;
//std::cout <<"A: ";
for (int i=0;i<N;i++){
std::cin >> A[i];
// std::cout <<A[i] <<" ";
}
//std::cout <<std::endl;
std::sort(A,A+N);
//std::cout << ans << std::endl;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
/*
実行時MODint :
template <int& MOD = 1000000007>
static ... |
#include<cstdio>
#include<cctype>
#include<algorithm>
#include<cstring>
#include<cmath>
// Standard iostream objects -*- C++ -*-
// Copyright (C) 1997-2014 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it unde... | //Bismillahir Rahmanir Raheem
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define lli long long int
#define ll64 int64_t
#define pb push_back
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define frr(i,a... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define sz(x) (ll)x.size()
#define m1(x) memset(x, 1, sizeof(x))
#define m0(x) memset(x, 0, sizeof(x))
#define inf(x) memset(x, 0x3f, sizeof(x))
#define flout cout << fixed << setprecision(12)
#define MOD 1000000007
int main() {
int n, m;
c... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... |
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mp make_pair
#define pb push_back
#define pll pair<LL,LL>
#define pii pair<int,int>
#define y second
#define x first
#define LL long long
... | #include <cstdio>
#include <string>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <tuple>
#define max(l,r) ((l)>(r)?(l):(r))
#define min(l,r) ((l)<(r)?(l):(r))
#define rep(i,s,l) for(int i=(int)s;i<(... |
#include <bits/stdc++.h>
//#define DEBUG
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template<typename... T>
void r... | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
#include <functional>
#include <iomanip>
using ll = long long;
using namespace std;
c... |
/*
Author: QAQAutoMaton
Lang: C++
Code: B.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(qaq...) fprintf(stderr,qaq)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll quickpow(ll a,ll b,ll mod)
{
ll res=1;
while(b)
{
if(b&1)
{
res=res*a%mod;
}
b=b/2;
a=a*a%mod;
}
return res%mod;
}
int aa[10][10];
int main()
{
aa[0][0]=1;aa[0][1]=1;
... |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define mp(a,b) make_pair(a,b)
#define vi vector<int>
#define mii map<int,int>
#define mpi map<pair<int,int>,int>
#define vp vector<pair<int,int> >
#define pb(a) push_back(a)
#define fr(i,n) for(i=0;i<n;i++)
#define rep(i,a,n) for(i=a;i<n;i++)
#defi... | #include <bits/stdc++.h>
using namespace std;
int _ = (cout << fixed << setprecision(9), cin.tie(0), ios::sync_with_stdio(0));
using Int = long long;
int main() {
Int B, C; cin >> B >> C;
vector<pair<Int, Int>> sec;
sec.emplace_back(B - C/2, B);
sec.emplace_back(-B - (C-1)/2, -B);
sec.emplace_back(-... |
#include <bits/stdc++.h>
using namespace std;
int main (){
int a[2][2];
for(int i = 0 ; i<2;i++){
for(int j = 0 ; j<2;j++){
cin >> a[i][j];;
}
}
cout << (a[0][0]*a[1][1])-(a[0][1]*a[1][0]);
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define ALL(x) (x).begin(),(x).end()
template<class T>bool umax(... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define aashish_999 ios_base::sync_with_stdio(false);cin.tie(NULL)
void solve()
{
//read the question properly
string s;
cin >> s;
string f, r;
f = r = "";
bool flag = false;
int cnt = 0;
for (auto i : s) {
if (i == ... | #define _USE_MATH_DEFINES
#include <iostream>
#include <cstring>
#include <regex>
#include <cmath>
#include <algorithm>
#include <vector>
#include <list>
#include <map>
#include <unordered_set>
#include <queue>
#include <unordered_map>
#include <set>
#include <cassert>
#include <climits>
#pragma GCC optimize("O3")
u... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pld = pair<ld,ld>;
using vll = vector<ll>;
using vld = vector<ld>;
using vstr = vector<string>;
#define _GLIBCXX_DEBUG
#define rep(j, m) for (ll j = 0; j < (ll)(m); j++)
#define rep2(i, l, n) for (... | #include <bits/stdc++.h>
using namespace std;
#define il inline
#define re register
#define rep(i, s, e) for (re int i = s; i <= e; ++i)
#define drep(i, s, e) for (re int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
const int mod = 998244353;
const int inv2 = (mod ... |
#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<ll,ll,ll>
using Graph = vector<vector<int>>;
ll mod = 1000000007;
int main() {
ll N; cin >> N;
vector<char> col = {'R','G','B'};
vector<vector<ll>> cute(... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...)
#endif
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define all(c) c.begin(),c.end()
#define read(v) for(auto &it:v) cin>>i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
#define all(n) n.begin(), n.end()
int main () {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
vector<ll> c(n);
rep(i,n) cin >> a.at(i);
rep(i,n) cin >> b.at(i);
ll maxv ... | #include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main()
{
int N;
cin>>N;
int a[N];
int b[N];
for(int i=0;i<N;i++){
cin>>a[i];
if(i>0){
if (a[i]<a[i-1]){
a[i]=a[i-1];
}
}
}
for(int i=0;i<N;i++){
cin>>b[i];
}
long long int before=0;
for(int i=0;i<N;i++){
lon... |
/**
* Made by: Diego Briaares
* At: 07.03.2021 18:28:23
**/
#include <bits/stdc++.h>
using namespace std;
void optimize() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void test_case() {
int n;
cin >> n;
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
s1 += s1;
s2 += s2;
s3 += s3;
vector<string> can... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
const int N = 1e6 + 5;
using namespace std;
int cas, n;
char s[3][N], T[N];
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
whi... |
#include <bits/stdc++.h>
using namespace std;
const int N=205;
int n,ma[N],tmp[N];
bool ok=1,can[N][N],f,dp[N];
int main()
{
scanf("%d",&n);
for(int i=1,ai,bi;i<=n;i++){
scanf("%d%d",&ai,&bi);
if(ai>0 && ma[ai]) ok=0;
if(bi>0 && ma[bi]) ok=0;
if(ai>0 && bi>0)
ma[ai]=bi,ma[bi]=ai;
else if(ai>0) ma[ai]=-1... | // author: xay5421
// created: Sat May 29 20:25:20 2021
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
//#define NDEBUG
#endif
#include<bits/stdc++.h>
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
const int N=505;
int T,n,a[N]... |
/* Piyush Sharma*/
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll testcase = 1;
// ll testcase;
// cin >> testcase;
while (testcase > 0)
{
double n, D, H;
cin >> n >> D >> H;
double maxVal = INT_MIN;
double backup = 0 * 1.0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,t,n) for(int64_t i=t;i<n;i++)
#define Sort(a) sort(a.begin(),a.end())
#define rSort(a,n,m) sort(a.begin()+n-1,a.begin()+m)
#define Reverse(a) reverse(a.begin(),a.end())
#define rReverse(a,n,m) reverse(a.begin()+n-1,a.begin()+m)
#define MOD 1000000007
#define s... |
#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> // int64_t, int*_t
#include <cstd... | #include <bits/stdc++.h>
#define int long long
#define INT_MAX INT64_MAX
#define INT_MIN INT64_MIN
#define PI 3.14159265358979323846
#define CLK clock_t clk = clock();//Start of main
#define OCLK cerr << "Time (in ms): " << (double)(clock() - clk) * 1000.0 / CLOCKS_PER_SEC << '\n';//End of main
#define MOD 1000000007
/... |
#include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, n, a, b, c = 2, s, t, now;
bool ans = true;
scanf("%lld%lld", &n, &k);
if(k > n * n * n / 2) ans = false, k = n * n * n - k + 1;
s = n + n + 1;
while(s - c > 1) {
t = (s + c) / 2;
now = t * (t - 1) * (t - 2) / 6;
if(t > n + 2... | //ABC 200 E - Patisserie ABC 2
//https://atcoder.jp/contests/abc200/tasks/abc200_e
#include <bits/stdc++.h>
using namespace std;
long long dp[4][3000005] = {};
int main() {
int n;
long long k;
cin >> n >> k;
//已选了几个数，其数字和是多少
dp[0][0] = 1;
for(int i = 0; i < 3; i++) { // 推送给、贡献给父问题
for(int j = 0; j <= i *... |
#include<bits/stdc++.h>
using namespace std;
const int M = 100005;
#define ll long long int
ll N = 1e9 + 7;
ll Z = 998244353;
#define all(x) (x).begin(), (x).end()
#define deb(x) cerr << #x << " = " << x <<"\n";
#define rep(i, begin, end) for (__typeof(end) i = (begin) — ((begin) > (end)); i != (end) — ((begin) > (end... | #include<bits/stdc++.h>
using namespace std;
void century(int year)
{
if(year<=0)
return;
else if(year % 100 == 0)
{
cout<<(year/100);
}
else
cout<<(year /100) +1;
}
int main()
{
int N;
cin>>N; // year//
century(N);
return 0;
} |
#include <algorithm>
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
const int MAX_H = 2e5;
const int MAX_W = 2e5;
// From https://cp-algorithms.com/data_structures... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
#define FOR(i,m,n) for(ll i=ll(m); i<ll(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VP vector<pair<ll,ll>>
#define VPP vector<pair<int,pair<int,int>>>
#define VLL vect... |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define rep(i,a,b) for(int i=a;i<b;i++)
void abcd(){
int n,k;
string s;
cin >> s;
n=0;
rep(i,0,9){
if(s[i]=='Z' && s[i+1]=='O' && s[i+2]=='N' && s[i+3]=='e'){
n++;
}
}
cout << n;
}
int32_t m... | #include<bits/stdc++.h>
using namespace std;
int main()
{string s;
cin>>s;
int ans=0;
string a="ZONe";
for(int i=0;i<9;i++)
{string x=s.substr(i,4);
if(x==a) {ans++;}}
cout<<ans;
return 0;} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,n) for(int i=x;i<(int)n;++i)
#define sp(p) cout<<setprecision(16)<<fixed<<p<<endl;
#define ceiling(a,b) ((a+b-1)/b)
#define out(a) cout<<a<<endl;
#define vout(v) rep(i,0,v.size())cout<<v[i]<<(i==v.size()-1?"\n":" ");
#define vvout(vv) rep(j,0,vv.size()){vout... | #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<sstream>
#include<algorithm>
/******... |
// clang-format off
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using G = vector<vector<ll>>;
#define G(i, j) i, vector<ll>(j)
#define Gv(i, j, k) i, vector<ll>(j, k)
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n)... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i,n) for (int i = 0;i < n;i++)
typedef long long ll;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s;
int p1 =... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
int count=0;
char S[H][W];
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
cin >> S[i][j];
}
}
for (int i = 1; i < H-1; i++)
{
for (int j = 1; j < W-1; j++)
{
if (S[i][... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define P pair<ll, ll>
#define all(a) (a).begin(), (a).end()
int main(){
ll H, W;
cin >> H >> W;
vector<string> S(H);
rep(i, H) cin >> S.at(i)... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
long long tsum = 0;
while(n--){
long long a, b;
cin >> a >> b;
long long sum1 = ((a-1) * a) / 2;
long long sum2 = ( b * (b+1)) / 2;
long long sum = sum2 - sum1;
tsum = tsu... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <string>
#include <stack>
#include <queue>
#include <random>
#include <deque>
#include <cassert>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <sstream>
#include <iomanip>
#include <algorithm>... |
#include<cstdio>
using namespace std;
int n,k,calc[200];
int dp[200][200];
char s[200];
inline int dfs(int cur,int p) {
if(p==0) {
if(s[cur]=='R')
return 1;
else if(s[cur]=='P')
return 2;
else if(s[cur]=='S')
return 3;
}
if(dp[cur][p])
return dp[cur][p];
int l=dfs(cur,p-1);
int r=dfs((cur+calc[p... | #include <bits/stdc++.h>
using namespace std;
char battle(char l_hand, char r_hand)
{
if ((l_hand == 'R' && r_hand == 'S') || (l_hand == 'P' && r_hand == 'R') || (l_hand == 'S' && r_hand == 'P'))
{
return l_hand;
}
if ((r_hand == 'R' && l_hand == 'S') || (r_hand == 'P' && l_hand == 'R') || (r_h... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i=0; i < (n); i++)
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF = 1 << 30;
const ll LINF = 1LL << 61;
const int NIL = -... | #include <bits/stdc++.h>
using namespace std;
#define tcase int _; cin >> _; while(_--)
//#define int long long
const int MOD = 1e9+7;
const int MAX = 1e6;
const int INF = 2e9;
void solve() {
int n;
cin >> n;
int a1=0, a2=0;
vector<int> v(n, 1);
for(int i=1; i<=n; i++) {
int ok=1;
int x = i;
while(x) {
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
#define F first
#define S second
const int MOD = 1e9 + 7;//XXX
const int C = 26;//XXX
void add(int &x, int y){
x += y;
while (x >= MOD) x -= MOD;
while (x < 0) x += MOD;
}
int fix(int x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int,int>;
const int MAX = 1e6+10;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int l,r;
cin >> l >> r;
ll res = 0;
for(int i=2;i<=r;i++){
int t = i;
int fail = 0;
int factors = ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define repp(i, a, b) for(int i = a; i <= b; i++)
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, b, a) for(int i = b; i >= a; i--)
#define pb emplace_back
#define ff first
#define... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
#define EOR(i,x) for(int i=Head[x]; ~i; i=Nxt[i])
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
namespace Eddd {
char sc() {
return getc... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X;
cin >> N >> X;
vector<int> A;
for (int i = 0; i < N; i++) {
int n;
cin >> n;
if (n != X) {
A.push_back(n);
}
}
bool first = true;
for (int apple : A) {
if (first) {
first = false;
} else {
cout << " ... |
#include <stdio.h>
int f;
long long n, k;
long long l, m, r;
long long x, y, z;
long long r1(long long a) {
long long b = a * (a + 1) * (a + 2) / 6;
if (a > n) {
b -= (a - n) * (a - n + 1) * (a - n + 2) / 2;
}
return b;
}
long long r2(long long a) {
long long b;
if (x <= n) {
b = x * (x + 1) / 2;
b -= (x - ... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll seq[4000005];
int main(){
ll n,k;
cin>>n>>k;
for(int i=n;i<=n*2-1;i++)seq[i]=i+1-n;
for(int i=n*2;i<=n*3-2;i++)seq[i]=n*3-1-i;
ll cnt=0,sum=0,S=3;
int l=3*n-2,r=4*n-3;
for(int I=1;I<=3*n-2;I++){
cnt-=seq[r+1];
cnt+=seq[l];
if(sum+cnt>=k)... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
constexpr ll mod = 1e9 + 7;
ll modpow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1) r = r * a % mod;
a = a * a % mod;
b >>= 1;
}
return r;
}
int main(... |
#include<bits/stdc++.h>
using namespace std;
#define w(x) int x;cin>>x;while(x--)
#define ll long long int
#define ld long double
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define vi vector<int>
#define inf 1e18
#define mod 998244353
void solve()
{
ll no;
cin>>no;
ll k=5;
ve... | #include <iostream>
#include <climits>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <functional>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cmath>
#include <random>
#include <bitset>
#include <cstdio>
... |
#include <bits/stdc++.h>
using namespace std;
vector<int> G[25];
int a[25], c[25];
vector<int> tmp;
void dfs1(int u) {
a[u] = 1;
tmp.push_back(u);
for (int v : G[u]) {
if (!a[v]) dfs1(v);
}
}
long long dfs2(int i) {
int u = tmp[i];
bool vis[3] = {false, false, false};
for (int v... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
int v[20][2];
int main() {
int n,m;
cin >> n >> m... |
#include<bits/stdc++.h>
#define pb emplace_back
#define pf first
#define ps second
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define Endl '\n'
#define codejam cout<<"Case #"<<t<<": ";
#define pl pair<ll,ll>
#define mod 1000000007
#define INF 1000000001
#define forn(i,n) for(ll i=0;i<n;i++)
#d... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define watch(x) cout << (#x) << " = " << (x) << endl;
#define w(x) int x; cin >> x; while(x--)
#define all(x) ... |
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#define M 100001
int n, m, pthn, ans[M], head[M];
struct Edge {
int nxt, to, w;
}pth[M << 2];
void add(int from, int to, int w) {
pth[++pthn].to = to, pth[pthn].nxt = head[from];
pth[pthn].w = w, head[from] = pthn;
}
v... | #include<bits/stdc++.h>
#define io ios_base::sync_with_stdio(0);
#define tie cin.tie(NULL);
#define Inf (1LL<<62)
#define inf (1<<30)
#define ll long long
#define pr pair<int,int>
#define pb push_back
#define fr0(i,n) for(i=0;i<n;i++)
#define fr1(i,n) for(i=1;i<=n;i++)
#define no cout<<"No\n";
#define yes cout<<"Yes\n"... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<int> vll;
typedef pair<int, int> pii;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define INF 1000000007LL
#def... | #include <bits/stdc++.h>
using namespace std;
int MOD = 998244353;
int N=3141, M=2718;
long comblist[6000];
long result[6000];
long fastpow(long a, int p){
long ans = 1;
while(p>0){
if (p%2==1)
ans = ans * a % MOD;
p >>= 1;
a = a * a % MOD;
}
return ans;
}
long fasti... |
#include <bits/stdc++.h>
#define ld long double
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define no cout<<"NO\n";
#define yes cout<<"YES\n";
#define nl cout<<"\n";
#define sp <<" "<<
#define ull unsigned long long
#define FAST ios_base::sync_with_stdio(false), c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N >> L;
if(N == L){
cout << N << endl;
}else if(N != 0 && L != 0){
cout << 0 << endl;
}else if(N != 1 && L != 1){
cout << 1 << endl;
}else{
cout << 2 << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n,s,d;
cin>>n>>s>>d;
int sec[n];
int pow[n];
for(int i=0;i<n;i++){
cin>>sec[i];
cin>>pow[i];
}
int count=0;
for(int i=0;i<n;i++){
if(sec[i]<s and pow[i]>d){
count++;
}
}
if(count>0){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
//x:コンテナ
#define ALL(x) x.begin... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N),B(N),C(N);
vector<int>cnt(N+1);
for(int i = 0; i < N; i++) {
cin >> A[i];
}
for(int i = 0; i < N; i++) {
cin >> B[i];
}
for(int i = 0; i < N; i++) {
cin >> C[i];
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... |
#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 int
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(v) v.begin(),v.end()
typedef ... | #include <iostream>
#include <iomanip>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <complex>
#include <chrono>
using namespace std;
int main(int argc, const char * argv[]) {
ios::sync_with_stdio(false);
ci... |
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... | //#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <dequ... |
//Geekio_op
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int>v(3);
for(int i=0;i<3;i++){
cin >> v[i];
}
sort(v.begin(),v.end());
for(int i=0;i<3-1;i++){
if((abs(v[i]-v[i+1]))==(abs(v[i+1]-v[i+2]))){
cout << "Yes";
return 0;
}
}
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long ll;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll x, y;
if (a >= b) {
x = a;
} else {
x = b;
}
if (c >= d) {
y = d;
} else {
y = c;
... |
#include <bits/stdc++.h>
using namespace std;
/*^ debug */
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p);
string to_str... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target ("avx2,avx,fma")
typedef long long int ll;
//#define int long long int
typedef long double db;
typedef pair <int,int> ii ;
typedef vector < int > vi ;
typedef vector < ii > vii ;
#d... |
///********************** Bismillahir Rahmanir Rahim *****************///
#include<bits/stdc++.h>
using namespace std;
///*********************** Template Start Here ***********************///
///************************ C o n t a i n e r ************************///
typedef long long ll;
typedef unsigned long long ull... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t)... | #include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
const int maxm=3e5+10;
int head[maxn],w[maxm],dis[20][maxn],nt[maxm],to[maxm],tot;
int cnt[maxn],d[maxn],vis[maxn];int n,m,c[maxn];
void add(int x,int y,int z)
{
to[++tot]=y;w[tot]=z;nt[tot]=head[x];head[x]=tot;
}
bool spfa(int p... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#def... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
string S;
cin >> N >> S;
vector<vector<int>> a(N+1,vector<int>(N+1,0));
vector<vector<int>> t(N+1,vector<int>(N+1,0));
vector<vector<int>> c(N+1,vector<int>(N+1,0));
vector<vector<int>> g(N+1,vector<int>(N+1,0));
for (int... | #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;
using P = pair<int, ll>;
int main() {
int n;
cin >> n;
// vector<int> a(n);
map<int,int> m;
rep(i,n){
int a;
cin >> a;
m[a]++;
}
// sort(m.be... |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 1600008
#define mod 998244353
#define f first
#define s second
ll arr[sz+10],brr[sz+10];
ll num=1;
long long binpow(long long a, long long b) {
a %= mod;
long long res = 1;
while (b > 0) {
if (b & 1)
res = ... | #include <bits/stdc++.h>
using namespace std;
#pragma optimize("-O3")
#define int long long int
#define f first
#define s second
#define pb push_back
#define endl '\n'
const int MOD=998244353;
const int N=2e5+5;
int num[N];
int num2[N];
int ex[N];
int ex2[N];
int add(int x, int y)
{
return (x + y) % MOD;
}
int s... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.