code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MV 2000001
#define LMV 21
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define emp emplace
#define mp make_pair
#define ins i... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>... |
#include <bits/stdc++.h>
#define F(i,j,k) for(int i=(j);i<=(k);++i)
#define D(i,j,k) for(int i=(j);i>=(k);--i)
#define rep(it,s) for(__typeof(s.begin()) it=s.begin();it!=s.end();++it)
#define Rep(a,s) for(auto a:s)
#define PB push_back
#define MP make_pair
#define FF first
#define SS second
typedef long long ll;
typede... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_Y... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=100010,M=500010;
int n,m,s,t,x,y,u,v,a[M],b[M],c[N],d[M],e[M],cnt,f[N];bool vis[N];
inline void add(int u,int v,int D,int x){a[++cnt]=v,b[cnt]=c[u],c[u]=cnt,d[cnt]=D,e[cnt]=x;}
struct node{
int dis,pos;
bool operator <( const node &... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(v) v.begin(), v.end()
#define rep(i, ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, l, n) for (int i = (l); i < (int)(n); i++)
using ll = long long;
int main(){
int n; cin>>n;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n){
a[i] %= 200;
}
vector<int> cnt... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define len(x) int((x).size())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define randint(n) uniform_int_distribution<int>(1, (n))(rng)
vector<int... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define re register
#define ls (o<<1)
#define rs (o<<1|1)
//#define m (l+r)/2
#define pb push_back
typedef pair<int,int> pii;
const double PI= acos(-1.0);
const int M = 1e5+7;
/*
int head[M],cnt=1;
void init(int n){cnt=1;for(int i=0;i<=n;i++)head[i]=0;... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define f first
#define s second
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const int inf = 1e9;
const ll infll = 1e18;
const int M = 1e9 + 7;
const int N = 3e6;
int fact[N+1], inv[N+1];
int mult(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<60
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
const int N = 1e2;
int n;
bool vis[N+2];
vector<int> adj[N+2];
int dfs(int cur) {
vis[cur] = 1;
int ret = 1;
for (int nx : adj[cur]) {
if (!vis[nx])
ret +=... | #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<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define e endl
#define iff(u,v) if(abs(u-v)<1e-9)
#define f(i,p,q) for(int i=p;i<q;i++)
#define vi vector<long long>v;
#define tc int t; cin>>t; while(t--)
//#define an long long n; cin>>n; long long a[n]; for(int i=0;i<n;i++) cin>>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, sum;
cin >> N >> A >> B;
sum = N-A+B;
cout << sum << endl;
} |
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
using LL = long long;
using pii = std::pair<int, int>;
using pll = std::pair<LL, LL>;
const int N = 100;
double dp[N + 1][N + 1][N + 1];
double f(int i, int j, int k) {
if (k > j) std::swap(j ,k);
if (j > i) std::swap(i, j);
... | #include <bits/stdc++.h>
#include <unistd.h>
#define FAST_IO ios::sync_with_stdio(0);cin.tie(NULL)
#define all(v) (v).begin(),(v).end()
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsig... |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= int(b); i++)
#define per(i, a, b) for (int i = (a); i >= int(b); i--)
using namespace std;
typedef long long ll;
const int maxn = 1e5;
int n, L, a[maxn + 5], b[maxn + 5];
void read(int a[], int n) {
rep(i, 1, n - 1) {
scanf("%d", &a[i]);
}
a[n... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define f first
#define s second
#define nl "\n"
typedef long long ll;
typedef pair<int, int> pii;
const int MOD = 1e9+7;
template<... |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<" "
#define el <<endl
#define fgx cerr<<" ------------------------------------------------ "<<endl
#define LL long long
#define DB double
#define mpt make_pair
#define pb push_back
inline LL read(){
LL nm=0; bool fh=true; ch... | #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>
#define... |
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
#include <array>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 998244353
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_b... | #include<bits/stdc++.h>
#define re register
#define int long long
using namespace std;
inline int read(){
re int t=0;re char v=getchar();
while(v<'0')v=getchar();
while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
return t;
}
const int M=998244353;
inline int ksm(re int x,re int y){
re int s=1;
while(y){
if(y&1)s=1... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(int L, int R){
vector<ll> memo(1<<21, -1);
auto f = [&](auto self, int L, int R) -> ll {
// L < x <= R であって、gcd(x,y) == 1 となるものを数える
auto key = L + R;
if(memo[key] != -1) return memo[key];
ll res = ll(R - L) * (R - L)... |
#include <iostream>
using namespace std;
int main()
{
int v, t, s, d;
cin >> v >> t >> s >> d;
cout << (d < v*t || v*s < d ? "Yes" : "No") << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define Test int T;cin>>T;while(T--)
#define PI acos(-1)
#define endl "\n"
#define fx(x) fixed<<setprecision(x)
#define sz(s) (int)s.size()
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define mem(a,... |
#pragma gcc target("avx2")
#pragma gcc optimize("o3")
#pragma gcc optimize("unroll-loops")
//#pragma warning(disable : 4996)
//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <array>
#include <... | #include <bits/stdc++.h>
using namespace std;
const int N = 500, D = 2 * 1000 * N;
vector<array<short, 2>> dijkstra[D];
int a[N][N], b[N][N], dist[N][N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
for (int j = ... |
#include<bits/stdc++.h>
using namespace std;
int a[200010],b[200010];
queue<int>pos[200010];
map<int,int>id;
int tot,n;
int T[200010<<2];
int q(int rt,int l,int r,int pos){
if(l==r)return T[rt];
int mid=l+r>>1;
if(pos<=mid)return T[rt]+q(rt<<1,l,mid,pos);
else return T[rt]+q(rt<<1|1,mid+1,r,pos);
}
void ad(int rt,i... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct BIT{
private:
vector<T> A;
const int n;
public:
BIT(int _n) : A(_n+1,0), n(_n){}
//i番目までの累積和
T sum(int i){
T s=0;
... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
using namespace std;
int c[500009], p[500009];;
vector<int> v;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n; cin >> n;
string s, t; cin >> s >> t;
for (int i = 0; i < n - 1; i++) {
if (s[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,T;
cin >> N >> M >> T;
vector<int> a(M);
vector<int> b(M);
for(int i = 0; i < M*2; i++) {
if(i%2 == 0) {
cin >> a.at(i/2);
}else{
cin >> b.at((i-1)/2);
}
}
bool Ans = true;
int B = N;
int Time = 0;
for(... |
#define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <ctime>
#include <cctype>
#include <bitset>
#include <utility>
#include <complex>
#include <ioman... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define start() int t;cin>>t;while(t-->0)
#define speed ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n"
#define mod 1000000007
bool isPrime(int n)
{
// Corner cases
if(n<=3){
return true;
}... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define pb(a) push_back(a)
#define vll vector<ll>
#define loop(i, n) for(ll i=1;i<=n;i++)
#define loop0(i, n) for(ll i=0;i<n;i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%lld", i)
#define pll pair<ll, ll>
#define vpll vector<pair<l... |
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.t... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define ld long double
using namespace std;
const int M = 1000000007;
const int N = 1008;
vector<int> g[N];
char p[N][N];
bool used[N];
int parent[N];
char ans0[N][N];
void dfs(int v) {
used[v] = true;
for (auto u : g[v]) {
if (!used[... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz(a) int(a.size())
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) { out << "(" << a.first << "," << a.second << ")"; return out; }
template <typename T, size_t N> ostream& operator <<(ostream& out, con... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(int i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define ones(x) _... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> A(m);
for(int i = 0; i < m; ++i)
cin >> A[i];
m += 2;
A.emplace_back(0);
A.emplace_back(n+1);
sort(A.begin(), A.end());
int d = n;
for(int i = 1; i < m; ++i){
if(... | #include <bits/stdc++.h>
using namespace std ;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
const ll mod = 1e9 + 7 ;
ll upper_cal(ll n,ll m){
if( n%m == 0)return n/m ;
else return n/m + 1 ;
}
int main(){
ll n , m ;
cin >> n >> m ;
if( m == 0 ){
cout << 1 << en... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N, M;
cin >> N >> M;
vector<vector<int>> dist(N, vector<int>(N, -1));
queue<pair<int, int>> que;
for (int i = 0; i < N; i++) {
dist[i][i] = 0;
que.push(make_pair(i, i));
}
vector<vec... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<": "<<(x)<<endl
using namespace std;
using llong = long long;
using vi = vector<int>;
using vvi = vector<vi >;
using vvvi = vector<vvi >;
using pii = pair<int,int>;
constexpr i... |
#line 2 "header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
using namespace std;
#include <bits/stdc++.h>
// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1, _2, _3, name, ...) name
#define ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define ll int64_t
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define all(V) V.begin(),V.end()
#define PI 3.14159265359
#define fi fixed
#define se setprecision(10)
using namespace std;
int main(){
ll n;cin >> n;
ll a[n],b[n];
rep(... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(v... |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#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(vec) (vec).begin(),(vec).end()
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_IN... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
const int INF = (int)1e9;
const ll INFL = (ll)1e18;... |
#include<bits/stdc++.h>
using namespace std;
int a,b,c,mod=4;
long long mypow(long long x,long long times){
if(times==0)return 1;
long long ret=mypow(x,times/2);ret=ret*ret%mod;
if(times%2)ret=ret*x%mod;return ret;
}
bool vis[10];
int x[4];
int main(){
cin>>a>>b>>c;a%=10;
int qaq;
if(a==1){cout<<1;return 0;}
if... | //OM TAT SAT
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(c==0 && a>b)
{
cout<<"Takahashi"<<endl;
}
else if(c==0 &&a<=b)
{
cout<<"Aoki"<<endl;
}
else if(c==1 && a<b)
{
cout<<"Aoki"<<endl;
}
else if(c==1 &&a>=b)
{
... |
// execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int n;
cin >> n;
vector< int > a(n+1);
for(int i = 1; i <= n; i++){
cin >> a[i];
a[i] %= 200;
}
for(int i = 1; i <= n; i++){
if(a[i] % 200 == 0){
puts("Yes");
... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
#include<math.h>
using namespace std;
#define ll long long
... | //#include<atcoder/all>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint1000000007;
using vi = vector<ll>;
using vi2 = vector<vector<ll>>;
using vl = vecto... |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <fstream>
#include <c... | // For the purpose of C++ competitive programming only.
#include "bits/stdc++.h"
using namespace std;
#define FOR(a, c) for (int(a) = 0; (a) < (c); (a)++)
#define FORL(a, b, c) for (int(a) = (b); (a) < (c); (a)++)
#define FORR(a, b, c) for (int(a) = (b); (a) > (c); (a)--)
#define INF 1000000000000000003
#define MOD 10... |
#include <bits/stdc++.h>
using ll = long long int;
using P = std::pair<int, int>;
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define rag(con) std::begin(con), std::end(con)
int main()
{
int n;
ll x;
std::cin >> n >> x;
std::vector<ll> a(n + 1), b(n + 1), c(n);
std::vector<std::vector<ll>> ... | #include<bits/stdc++.h>
#define int long long
#define HgS 998244353
using namespace std;
char ch[510][510];
char dep[1510];
long long ksm(int x)
{
long long a=2;
long long ans=1;
while(x)
{
if(x&1)ans=ans*a%HgS;
a=a*a%HgS;x>>=1;
}
return ans;
}
signed main(){
ios::sync_with_s... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
string s; cin>>s;
if(s.length()==1){
puts(stoi(s)%8==0?"Yes":"No");
return 0;
}
if(s.length()==2){
string t=s;
swap(t[0],t[1]);
puts(stoi(s)%8==0||stoi(t)%8==0?"Yes":"No");
return 0;
}
int freq[10]={... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
//in the name of god//
// SOBHET BEKHEIR JOOOOOOON E DEL
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(x,s) memset(x,s,sizeof(x))
#define all(x) x.begin(),x.end()
#define _ ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define F first
#define S second
#define endi re... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define rep(i, l, r) for (ll i = l; i < (ll)(r); i++)
#define rrep(i, l, r) for (ll i = ((ll)(r) - 1); i >= l; i--)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<ll, ll>;
template... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = (int)1e5 + 7;
int n, m;
int x[N];
int ss[N];
int main() {
scanf("%d %d", &n, &m);
string s;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j < m; j++) {
x[i] += (s[j] - '0');
}
ss[x[i]]++;
}
ll ans = 0;
for (... | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
#include<string>
#include<bitset>
using namespace std;
#define rep(i,N) for(ll i=0;i<N;i++) //0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (... |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
set<int> s{};
for (int i = 0; i <= 200000; i++) {
s.insert(s.end(), i);
}
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (s.find(p) ... | #include<fstream>
#include<iostream>
#include<sstream>
#include<vector>
#include<stack>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<tuple>
#include<iomanip>
#include<stdio.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using graph = vector<vector<int... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
using P = std::pair<ll, ll>;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,a,b) for (int i=a; i<b; ++i)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll K;
cin >> K;
string S,T;
cin >> S >> T;
long double ans=0;
vector <ll> pow10 = {1,10,100,1000, 10000, 100000};
... | #include <iostream>
using namespace std;
using ll= long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define ALL(x) x.begin(),x.end()
#define MOD (int)1e9+7
signed main() {
ll n, k;
ll ans=0;
cin>>n>>k;
ll a[n];
ll numc[n];
REP(i,n) cin>>a[i];
REP(i,n) numc[i... |
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
long N, K, S = -1, A = -1;
scanf("%ld %ld", &N, &K);
while(true){
S++;
long cnt;
if(S < N) cnt = (S + 1) * (S + 2) / 2;
else if(S < 2 * N - 2) cnt = (N * 9 - N * N * 3 + N * S * 6 - S * 6 - S * S * 2 - 4)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int N;
ll K;
cin >> N >> K;
ll dp[4][3000005] = {0};
dp[0][0] = 1;
for (int i = 0; i < 3; i++) {
for (int j = 0; j <= i * N; j++) {
... |
#include<iostream>
#include<vector>
#include<utility>
#include<map>
#include<deque>
#include<numeric>
#include<algorithm>
#include<unordered_map>
#include<cmath>
#include<string>
#include<iomanip>
using namespace std;
using ll = long long int;
constexpr int INF = 1 << 30;
constexpr ll MOD = ll(998244353);
vector<ll> ... | #include<bits/stdc++.h>
using namespace std;
mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define int long long
#define vi std::vector<int>
#define setbits(x) __builtin_popcountll(x)
#define pb push_back
#define fn... |
#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
const int HIGH=30,WIDTH=30;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se ... |
#include<iostream>
#include<vector>
#include<cmath>
#include<unordered_set>
#include<algorithm>
using namespace std;
int main(){
int n;cin>>n;
vector<int> a(n),b(n),c(n),d(n);
for(int i=0;i<n;i++)cin>>a[i]>>b[i];
for(int i=0;i<n;i++)cin>>c[i]>>d[i];
if(n==1){
puts("Yes");
return 0;
}/*
if(n==2){
if((a[1]... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<set>
#include<cstdlib>
#include<cmath>
#include<numeric>//fill
#include<iomanip>
#include<functional>//https://cpprefjp.github.io/reference/functional/function.html
#include<cstdlib>//https://cpprefjp.githu... |
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5;
const int maxq=3e5;
char ss[maxn + 1 << 1];
int main()
{
int n,q,t,a,b;
scanf("%d\n%s\n%d\n",&n,ss,&q);
int base=0;
int l=n<<1;
while(q-->0)
{
scanf("%d %d %d",&t,&a,&b);
if(t==2)
{
base^=n;
}
else
{// T==1
a=(a-1+base)%l;
b=(b-... | #include <bits/stdc++.h>
#define rep(i, n) for (auto i = 0; i < n; ++i)
#define ALL(a) a.begin(), a.end()
using namespace std;
using ll = long long int;
const int MOD_NUM = 1e9 + 7;
int main() {
// Input
int N, Q;
string S;
cin >> N >> S >> Q;
vector<int> T(Q), A(Q), B(Q);
rep(i, Q) cin >> ... |
///Astalavista Code........~sachinait
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Br cout<<endl
#define int long long
#define pb push_back
#define mp make_pair
#define double long double
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define PT(x) cout << (x) << endl
#d... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int maxm = 20 + 10;
int n, m, ans;
char s[maxm];
int a[2];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; ++i)
{
scanf("%s", s);
int ret = 0;
for(int j = 0; j < m; ++j)
ret = (ret << 1) + s[j] - '0';
++a[__builtin_popcount(... |
#include "bits/stdc++.h"
using namespace std;
const int N=2e3+20,MOD=1e9+7;
int n,m,r[N][N],c[N][N],d[N][N],dp[N][N];
char a[N][N];
void add(int &x,int y) {x=(x+y%MOD)%MOD;}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf(" %s",a[i]+1);
dp[1][1]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
// Use g++ compiler for this include to work.
#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;
// Constants
#define INF 2e18
#define EPS 1e-9
#de... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<long long> Vll;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
ll n,m;
cin >> n >>m;
Vll a(m);
rep(i,m)cin >> a[i];
sort(a.begin(),... | #include <bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define F first
#define S second
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ld lon... |
//{{{
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VLL = vector<LL>;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
#endif
// clang-fo... | #include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMI... |
#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9
#define linf 1e18
#define BASE 1000000
#define EPS 1e-10
#define PI acos(-1)
#define pii pair<int,int>
#define pdi pair<double,int>
#define vi vector<int>
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define... |
//مبتسمون رغم الخرا
#include <bits/stdc++.h>
#define int long long int
#define ZaZo ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define ceil1(a,b) (a+(b-1))/b
#define all(v) v.begin(),v.end()
using namespace std;
int32_t main()
{
ZaZo
double a,b;
cin>>a>>b;
cout<<(double)(((a-b)/a)*(double)100);
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll f=0;
ll pre[500];
ll nCr(int n, int r)
{
ll p = 1, k = 1;
// C(n, r) == C(n, n-r),
// choosing the smaller value
if (n - r < r)
r = n - r;
if (r != 0) {
while (r) {
p *= n;
k *= r;... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void*wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned ... | #pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define MOD 998244353
using namespace __gnu_pbds;
using namespace std;
struct custom_hash {
static uint64_t splitmix... |
/*
Jai Shree Krishna !!
Radhe Radhe !!
उद्यमेन हि सिद्ध्यन्ति कार्याणि न मनोरथैः। नहि सुप्तस्य सिंहस्य मुखे प्रविशन्ति मृगाः।।
*/
#include <bits/stdc++.h>
using namespace std;
#define ... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <list>
#include <memory>
#include <vector>
using namespace std;
struct ConnectedComponent {
long long sum;
list<int> vertices;
};
int main() {
int vertex_cnt;
int edge_cnt;
cin >> vertex_cnt >> edge_cnt;
vector<int> diffs;
diffs.re... |
#include <iostream>
using namespace std;
int main()
{
int x,y; cin >> x >> y;
cout <<x/y<<endl;
} | #include <bits/stdc++.h>
using namespace std;
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_string(const... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename A, typename B = A> using pr = pair<A, B>;
#define vec vector
#define ar array
#define len(a) ((int)((a).size()))
#define all(a) (a).begin(), (a).end()
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
vec<int> prim... | //#pragma optimization_level 3
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/... |
#include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define vll vector<ll>
#define pll pair<long long, long long>
#define vpll vector < pair<long long,long long> >
#define itr vll::iterator
#define all(c) c.begin(),c.end()
#define pb push_back
#define f first
#define s second
#define ... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... |
#include<bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef long double f128;
using namespace std;
template<u64 mod>
struct modint{
u64 val;
constexpr modint(const i64 x=0) noexcept:val((x%i64(mod)+i64(mod))%i64(mod)){}
constexpr u64 &value() noexcept{
return val;
}
constexpr modint operat... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... |
#include <iostream>
#include <algorithm>
using namespace std;
long long md = 1000000007;
long long fp(long long n, long long k)
{
long long s = 1;
while (k) {
if (k & 1) s = (s * n) % md;
k /= 2; n = (n * n) % md;
}
return s;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, m; c... | // Problem: B - 200th ABC-200
// Contest: AtCoder - KYOCERA Programming Contest 2021（AtCoder Beginner Contest 200）
// URL: https://atcoder.jp/contests/abc200/tasks/abc200_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Author: abhidot
#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_... |
#include <iostream>
#include <string.h>
#include <string>
#include <cmath>
#include<vector>
#include <algorithm>
#include <iterator>
#include <map>
#include <utility>
#include<numeric>
#include <iomanip>
#include <set>
#define ul unsigned long long int
#define sll signed long long int
#define ll long long int
#define... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... |
#include<cstdio>
const int mod=1e9+7;
long long ans;
int n,m,mp[2010][2010],row[2010],col[2010],dia[5010];
char str[2010];
int add(long long a,long long b)
{
if(a+b>=mod) return (a+b)%mod;
else return a+b;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)
{
scanf("%s",str+1);
for(int j=1;j<=m;++j)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int(i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for(int(i) = (n); (i) >= 0; --(i))
#define FOR(i, n, m) for(int(i) = (n); (i) < (m); ++(i))
// clang-format off
template<class T> inline bool chmax(T& a, T b) { if (a <= b) { a = ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 105, mod = 1000000;
int n, m, a[N];
void read (int &x) {
char ch = getchar(); x = 0; while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
}
struct ll {
int p[550], len;
ll() { memset (p, 0, sizeof (p));... | #include<bits/stdc++.h>
using namespace std;
// typedef long long long long int ll;
int main()
{
long long int n;
cin>>n;
long long int arr[n];
for (long long int i = 0; i < n; ++i)
{
cin>>arr[i];
}
if (n==1)
{
cout<<arr[0]<<"\n";
return 0;
}
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
int n,mi,ans;
map<int,int> md;
int gcd(int x,int y){return y==0?x:gcd(y,x%y);}
int main()
{
int a;
scanf("%d",&n);
mi=1<<30;
for(int i=1;i<=n;i++)
{
scanf("%d",&a);
mi=min(mi,a);
for(int j=1;j*j<... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
int ans = 0;
int kazu = 0;
for(int j = 2; j <=1000; j++){
int counts = 0;
rep(i,n){
if(a[i]%j ==... |
#include<bits/stdc++.h>
using namespace std;
#define hi ios_base::sync_with_stdio(false);cin.tie(NULL);
typedef int64_t ll;
typedef long double ld;
typedef long long unsigned llu;
#define test int test; cin>>test; while(test--)
#define loop(i,n,k) for(int i=n;i<k;i++)
#define rloop(i,n,k) for(int i=n;i>=k;i--)
#... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... |
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define PQ priority_queue
#define lb lower_bound
#def... | #include<bits/stdc++.h>
using namespace std;
#define pb emplace_back
#define st first
#define nd second
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define sz(a) int((a).size())
#define all(c) (c).begin(),(c).end()
#define tr(c,i) for(type... |
/*
I love the sound you make when you shut up.
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
/*-------typedefs------*/
template<class T> using or... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll H, W, A, B;
cin >> H >> W >> A >> B;
ll ans = 0;
ll a = A, b = B;
vector<vector<int>> u(H, vector<int>(W));
auto dfs = [&](auto self, int h, int w) -> void {
while ( u[h][w] > 0 ) {
if ( w < ... |
#include <cstdio>
using namespace std;
#define ll long long
ll r, x, y;
ll read() {
ll X = 0, F = 1; char C = getchar();
while(C < '0' || C > '9') {if(C == '-')F=-1; C = getchar();}
while(C >= '0' && C <= '9') {X = X*10+C-'0'; C = getchar();}
return X * F;
}
int main() {
r = read(); x = read(); y = read();
ll ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long R, X, Y, ans;
double k;
cin >> R >> X >> Y;
k = sqrt(X * X + Y * Y);
ans = ceil(k / R);
if(k < R) ans++;
cout << ans << endl;
} |
#include<bits/stdc++.h>
#define fill(arr,c) memset(arr,c,sizeof(arr))
#define perm(r) next_permutation(all(r))
//it gives bool value ans permute the string lexoggraphically
#define sortdesc greater<int>()
#define ll long long int
//std::setfill('0') << std::setw(5) << 25; it adds leaing zeroes;
#define f(i,a) for(ll ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(i,a,n) for (int i=a; i<n; i++)
int n;
int a[10001];
int mn[10001][10001];
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
cin>>n;
forn(i,0,n)
cin>>a... |
#include "bits/stdc++.h"
using namespace std;
#define endl "\n"
using ll = long long;
const int MOD = 1e9 + 7;
void solve() {
int n, m; cin >> n >> m;
if (m == 0) {
cout << 1 << endl;
return;
}
vector<int> a(m);
for (int &x : a) cin >> x;
sort(a.begin(), a.end());
a.push_back(n + 1);
int ans = 0;
int cur ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... |
//include
//------------------------------------------
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <ss... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#define mod 1000000007
#define N 200005
#define int long long
using namespace std;
int n, b[N], a[N], z[N], mp[N], ans = 0, anss[N], us[N];
void Msort(int l, int r) {
int... |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> h;
vector<string> name;
string temp;
int n, f_max = 0, s_max, temp_no;
cin >> n;
for(int i = 0; i < n; i++){
cin >> temp >> temp_no;
name.push_back(temp);
... | #include <bits/stdc++.h>
using namespace std;
void solveC() {
int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(2, 0));
for (int i = 0; i < n; i++) cin >> arr[i][0] >> arr[i][1];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
int x1 = arr[j][0] - ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(){
int N;
cin>>N;
vector<vector<ll>> V(N+1);
for(int i=0;i<N+1;i++){
V[i] = {};
}
for(int i=0;i<N;i++){
ll X;
int C;
cin>>X>>C;
V[C].push_back(X);
}
vector<pair<ll,ll>> pv={};
int lpv=0;
for(int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.141592653589793238;
int main() {
ll N, M;
cin >> N >> M;
set<ll> s;
for (ll i = 0; i < N; ++i) {
ll A;
cin >> A;
s.insert(A);
}
for (ll i = 0; i < M; ++i) {
ll B;
cin >> B;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define yes() cout << "Yes" << endl
#define no() cout << "No" << endl
using ll = long long;
using ld = long double;
using P = pair<int,int>;
int main() {
int n,m;
cin>>n>>m;
vector <int> memo(1001,0);
rep(i,... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
const int INF = 1001001001;
int h, w;
int a[2005][2005];
bool visited[2005][2005];
int memo[2005][2005];
int f(int i, int j){
if(i == h-1 && j == w-1) return 0;
if(visit... | // author: sharad12arse
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define gcd __gcd
#define INF LONG_LONG_MAX
void solve(){
int n,m;
cin>>n>>m;
vector<string> arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
vector<vector<int> > dp(n,vector<int> (m,0));
vec... |
//arc111_c.cpp
//Sat Jan 9 22:32:39 2021
#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 n;
cin >> n;
vector<int> konohitonotaijy... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int> A(n + 1), B(n + 1), P(n + 1), par(n + 1);
vector<vector<int>> cycles(n + 1);
int cid = 0;
for(int i = 1; i <= n; ++i) {
cin>>A[i];
}
for(int i = 1; i <= n; ++i) {
cin>>B[i];
}
for(int i = 1; i <= n; ++i) {
cin>>P[i];
... |
#include <bits/stdc++.h>
#include <climits>
using namespace std;
template<class T>
using V = vector<T>;
template<class T>
using VV = V<V<T>>;
using ld = long double;
#define ll long long
using ull = unsigned ll;
using PLL = pair<ll, ll>;
using VLL = V<ll>;
using VB = V<bool>;
using VVB = VV<bool>;
using VVLL = VV<ll... | #include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define mp make_pair
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define w(x) int x;cin>>x;wh... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define reps(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr << #a "... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,a,b) for(int i = a; i<b ; i++)
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define M 1000000007
int mod(int x){
return ((x%M + M)%M);
}
int add(int a,int b){
return mod(mod(a)+mod(b)... |
#include<bits/stdc++.h>
#define R register
#define ll long long
using namespace std;
const int MAXN = 1e5+5;
ll n,k,m,a[MAXN],b[MAXN],ans;
struct node
{
int id;
bool operator < (const node &x)const
{
return b[id]*n-m*a[id]>b[x.id]*n-m*a[x.id];
}
};
bool check(ll x)
{
ll tot=0;
for(R int i=1;i<=k;++i)
{
ll nu... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
std::mt19937 rnd(time(0));
inline int sj(int n)
{
unsigned int x=rnd();
return x%n+1;
}
#define rand fst
template<typename typC> void read(register t... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000000;
void chmax(int &a, int b) {
if(b>a) a = b;
}
void chmin(int &a, int b) {
if(b<a) a = b;
}
int ctoi(char c) {
switch (c) {
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return 3;
cas... | #include<bits/stdc++.h>
//#define int long long
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
int n,x,ans;
main(){
ios::sync_with_stdio(0),cin.tie(0);
cin>>n;
for(int i=0;i<n;i++){
cin>>x;
if(x<=10)continue;
ans+=(x-10);
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define rsz resize
#define ins insert
#define mp make_pair
#define pf push_front
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define sz(x) (int)(x).siz... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int L;
cin >> L;
long long ans = 1;
for(int i = 0; i < 11; i++){
ans *= L-1-i;
ans /= i+1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define INF INT_MAX-1
// #define INF LLONG_MAX-1
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
// vector<vector<ll>> vv(n, vector<ll>(m));
int main(){
string S;
cin >> S;
for(ll i=0; i<S.size(); i++){
if(i%2 == 0){
if(S[i] >= 'A' && S[i] <= ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const int inf = 1 << 29;
const ll infll = 1LL << 60;
const int mod = 1000000007;
const int mod9 = 998244353;
template<class T> bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
else ... | #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 ll long long int
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define endl '\n'
#define inf INT_MAX
#define rep(i,a,b) for(i... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define pb push_back
#define vec vector<ll>
#define pii pair<ll,ll>
#define pr_que priority_queue<pii,vector<pii>,greater<pii> >
#define itr(i,x,y) for(ll i=x;i<y;i++)
#define mo... |
#include <bits/stdc++.h>
#define F first
#define S second
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define bck(i, a, b) if ((i) >= (a) && (i) < (b))
#define trav(x, a) for (auto &x : (a))
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end(... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll ,ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i,x,y) for(ll i = x;i <= y;++i)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... |
#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=880;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar(); while (!isdigit(ch)){if ... | //Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
string s;
vector<pair<int,string>> vec;
int i,j;
for(i=0;i<m;i++){
cin>>s;
bool add=true;
for(j=0;j<vec.size();j++){
if(s.size()<=vec[j].second.size()... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
long long tmp_or,tmp_xor,ans;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
ans = pow(2,32);
for (int bit = 0; bit < (1<<(N-1)); bit++)
{
tmp_or = 0, tmp_xor = 0;
for (int i = 0; i < N; i++)
{
... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
typedef long long int ll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define all(v) (v).begin(),(v).e... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 3005;
LL f[N][N], a[N];
LL pre[N];
LL g[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
pre[i] = pre[i - 1] + a... | // ＵＴＦ−８
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using lc = complex<double>;
template <class T>
bool complex_comparator(const complex<T> &a, const complex<T> &b) {
return real(a) == real(b) ? imag(a) < imag(b) : real(a) < real(b);
}
/* #include<atcoder/all> */
/* using namespace atcod... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int N, cnt=0;
cin >> N;
vector<long long int> a(N+1), b(N+1), c(N+1), d(N+1);
for(long long int i=1; i<N+1; i++){
cin >> a.at(i);
}
for(long long int j=1; j<N+1; j++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector... |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int prim[10001];
void init(){
prim[0]=1;prim[1]=1;
for(int i=2;i*i<=1e4;i++){
if(prim[i]==0){
for(int j=i*i;j<=1e4;j+=i){
prim[j]=1;
}
}
}
return;
}
int main(){
int n;cin>>n;
set<int>s;
s.insert(6);s.insert(10);s.i... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
string solve(long long N) {
switch (N % 4) {
case 0:
return "Even";
cas... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dd double
#define endl "\n"
#define pb push_back
#define all(v) v.begin(),v.end()
#define mp make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pll pair<ll,ll>
#define fo(i,n) for(int i=0;i<n;i++)
#define fo1(i,n) for(int... | #include<bits/stdc++.h>
#define int long long int
const int M = 998244353;
const int mod = 1e9+7;
const int inf = 1e18+5;
using namespace std;
#define debug() for(int l=0;l<50;l++){}
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
int bs(int arr[], int l, int r, int x){
int mid=0;
if (r >= l){
... |
#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 db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define r... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
const int maxn = 4e5 + 5;
int n;
int a[maxn];
pi b[maxn];
int col[maxn];
int S[maxn];
int main(){
ios::sync_with_stdi... |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define pb push_back
#define f first
#define s second
#define nl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef vec... | #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;
typedef long long ll;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937/*_64*/ rng(chrono::ste... |
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <math.h>
#i... | // D - Choose Me
// 模範解答
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using Pii = pair<int, int>;
using Cd = complex<double>;
#define rep2(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) rep2(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#d... |
#include <bits/stdc++.h>
#include <chrono>
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<int, null_type,less<int>, rb_tree_tag,tree_... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD=998244353;
int d[305][223456];
int pw(int n,int k){
assert(k>=0);
int res=1;
while(k){
if(k&1)(res*=n)%=MOD;
(n*=n)%=MOD;
k>>=1;
}
return res;
}
std::vector<int> Factorial(5e6),Finverse(5e6);
inline void Cinit(){
... |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <unordered_map>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef unsigned long long ull;
long long MX = 1e18;
int n;
int a[110];
ull x;
ull calc2(long long sum... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e18
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& b)... |
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
unordered_map<ll,ll> ma,pre;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,m,i,j,k,a,b,c,d,p,q,h,t,sum =0 ,maxn = 0,minx = 2e9,x,y,z,ans = 0;
string str;
cin>>n>>m;
for(i=1;i<=n;i++){
cin>>a;
b = i - pre[a];
ma[a] = max(ma[a],b);
pre[a] ... | #include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 233;
int a[maxn], b[maxn];
typedef long long ll;
int n, l;
map<int, int> pre, suf;
int main(){
scanf("%d %d", &n, &l);
pre[0] = 0;
suf[l - n] = n + 1;
for(int i = 1; i <= n; i++)scanf("%d", &a[i]);
for(int i = 1; i <= n; i++)scanf("%d", &b[i]);
... |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
#define max(p,q) ((p)>(q)?(p):(q))
#define min(p,q) ((p)<(q)?(p):(q))
#define rep(i,n) for... | #include<iostream>
#include<math.h>
#include<stdlib.h>
#include<string>
#include<limits.h>
#include<utility>
#include<vector>
//#include<bits/stdc++.h>
#include<tuple>
#include<queue>
#include<map>
#include<algorithm>
//#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;i++)
#define ALL(A) A.begin(),A.end()
us... |
#include <bits/stdc++.h>
//#include <bits/extc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
//using namespace __gnu_pbds;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;
ll power(ll x, ll y){
x%=MOD;
ll ret=1;
while(y){
... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rrep(i, n) for(ll i = n - 1; i > -1; i--)
#define all(v) v.begin(), v.end()
#define pb push_back
#define fi first
#define se secon... |
#include<cstdio>
#include<cstring>
using namespace std;
char s[210000];
int f[210000];
int main()
{
int n;scanf("%d",&n);
scanf("%s",s+1);
f[0]=0;int ss=0;
for(int i=1,j=1;i<=n;i++,j++)
{
if(s[i]=='f')f[j]=1;
else if(s[i]=='o'&&f[j-1]==1)f[j]=2;
else if(s[i]=='x'&&f[j-1]==2)
{
ss++;
j-=3;
}
else ... | #include <bits/stdc++.h>
using namespace std;
stack<char> st;
int n;
string s;
int main() {
ios::sync_with_stdio(0);
cin>>n>>s;
for(int i=0;i<n;i++){
if(st.size()<2){
st.push(s[i]);
continue;
}
char c=st.top();
st.pop();
if(s[i]=='x' && c=='o' && st.top()=='f'){
st.pop();
continue;
}
st.pu... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int t; cin >> t;
while (t--) {
int n; cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
if (n & 1) cout << "Second";
else {
sort(a... | #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,ll>
using Graph = vector<vector<int>>;
ll mod = 1000000007;
int main() {
ll T; cin >> T;
rep(i,T){
ll N; cin >> N;
vector<ll> a; ll ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.