code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
string s;
cin >> s;
char c = '+';
int n = s.size();
ll... | #include <bits/stdc++.h>
using namespace std;
using vi = vector <int>;using vl = vector <long long>;
using vs = vector <string>;using vc = vector <char>;
using ll= long long;using vvl = vector<vector<ll> >;
using vvc = vector<vector<char> >;using vd = vector <double>;
using vpl = vector<pair<ll,ll> >;using vb = vector<... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
#define rep(i, s, n) for (int i = s; i < (int)(n); i++)
#define drep(i, s ,n) for(int i=s;i>=(int)(n);--i)
#define rep64(i, s, n) for (lo... | #include <iostream>
#include <cstdio>
#include <cmath>
#define int long long
using namespace std;
int read() {
int re = 0;
bool sig = 0;
char c = getchar();
while(c < '0' || c > '9') sig = (sig | (c == '-')) , c = getchar() ;
while(c >= '0' && c <= '9') re = (re << 1) + (re << 3) + c - '0' , c = getchar();
return... |
#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;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
int p=998244353;
int siz=3*1e5;
vector<ll> A(siz);
vector<ll> B(siz);
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[0]=1;
fo... |
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pb push_back
#define pob pop_back
#define S s... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int N; cin>>N;
string S; cin>>S;
vector<int> a(N+1);
for(int i=0; i<N+1; i++) cin>>a[i];
int K=10000;
for(int i=0; i<N; i++){
K = min(K,abs(a[i]-a[i+1]));
}
vector<int> thre(N+1);
for(int i=0; i<N+1; i++){
thr... |
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
const int N = 25;
ll... | //****************************Template Begins****************************//
// Header Files
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<utility>
#include<set>
#include<unordered_set>
#include<list>
#include<iterator>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#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>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
//int型vectorを出力
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,t) for(int i = (int)(s); i < (int)(t); i++)
int main(){
int x;
cin >> x;
cout << 100 - x%100 << endl;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
int n, x;
cin >> n >> x;
vector<int> a(n);
rep(i,n) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll size,ele;
ll c;
cin>>size>>ele;
vector<ll>v;
for(int i=0;i<size;i++)
{
cin>>c;
v.push_back(c);
}
for(int i=0;i<size;i++)
{
if(v[i]!=ele)
cout<<v[i]<<" ";
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
using P = pair<int, ll>;
const ... | #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 <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <climits>
#include <random>
#include <chrono>
#include <set>
#define rep(i,begin, end) for (ll i = begin; i < (ll)(end); i++)
using namespace std;
using ll = long long;
template<typename T>
using vec2 = vector<vector<T... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
#define vi vector<int>
#define vl vector<ll>
int ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
cout << S.at(1) << S.at(2) << S.at(0) << endl;
}
| #include "bits/stdc++.h"
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define vi vector <int>
#define ff first
#define ss seco... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include<bits/stdc++.h>
#define int long long
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define x first
#define y second
using namespace std;
using pi = pair<int,int>;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int minf = 0xc0c0c0c0c0c0c0c0;
signed main() {
ios::sync_... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
#define pb push_back
#define T ll testx; cin>>testx; while(testx--)
#define print(name) for(auto t:name){cout<<t<<" ";}cout<<endl;
#define printii(name) for(auto t:name){cout<<t.first<<" "<<t.second<<e... | #include<bits/stdc++.h>
#define x first
#define y second
#define bug(x) cerr<<#x<<'='<<x<<' '
#define debug(x) cerr<<#x<<'='<<x<<'\n'
#define FOR(a,b,c) for(int a=(b),a##_end=(c);a<=a##_end;++a)
#define ROF(a,b,c) for(int a=(b),a##_end=(c);a>=a##_end;--a)
using namespace std;
typedef long long ll;
typedef pair<int,int>... |
// *********************************************************************************
// * MURTAZA MUSTAFA KHUMUSI *
// * CSE - 2019-2023 *
// **************************************************************... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inv2 = 5e8 + 4;
int n, cntall[65][2], cntlocal[65][2];
int dp[N];
bool visited[N];
int ans = 0, res = 0;
vector <pair <long long, int> > g[N];
void add(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
}
... |
#define _DEBUG
#include "bits/stdc++.h"
//#include <atcoder/all>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,a5,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "... | #ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
#define rrep(i, a, b) for(int i ... |
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
using namespace std;
const int nax = 2e5 + 5;
int cnt[10];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n,m; cin>>n>>m;
vector<pii> a;
... | #pragma GCC optimize ("O3")
#pragma GCC target("avx512f")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#defi... |
//
// main.cpp
// ABC 195
//
// Created by Paul Liao on 2021/3/13.
//
#include <iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<map>
#define ll long long
using namespace std;
vector<int> e[21];
int vis[21];
int col[21];
ll dp[21][4],ans=0;
bool uu[21]={0};
int n,m;
bool check(int u){
fo... | /** これを翻訳している間、あなたはあなたの人生のいくつかの貴重な瞬間を無駄にしました **/
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define repr(i,x,y) for(int i=x;i>=y;i--)
#define int long long
#define pb push_back
#define ff first
#define ss second
#define sz(x) ((int)x.size())
#define all(x) begin(x), end(x)
#d... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
// input
int N, M;
vi U, V, C;
void input() {
cin >> N >> M;
U = V = C = vi(M);
rep(i, M) cin >> U[i] >> V[i] >... | #include <bits/stdc++.h>
#define st first
#define nd second
#define PQ priority_queue
using ll = long long ;
using namespace std;
using pii = pair<int,int>;
const int N = 2e5 + 10;
const int MOD = 0;
vector<pii> gr[N];
bool vis[N];
int a[N];
void dfs(int node, int val){
vis[node] = true;
a[node] = val > 0 ? val : (... |
#include <iostream>
using namespace std;
long long mod = 998244353;
long long dp[5009][3];
long long d2[5009][3];
long long N, M;
long long solve(int border) {
for (int i = 0; i <= N; i++) {
dp[i][0] = 0; d2[i][0] = 0;
dp[i][1] = 0; d2[i][1] = 0;
dp[i][2] = 0; d2[i][2] = 0;
}
dp[0][0] = 1;
d2[0][0] = 0;
f... | #include<iostream>
#include<vector>
using namespace std;
typedef long long LL;
const int N=1e5+10,mod=998244353;
LL Pow[N];
LL f[N];
int main(){
int n,m;
scanf("%d%d",&n,&m);
Pow[0]=1;
for(int i=1;i<=n;i++){
Pow[i]=Pow[i-1]*m%mod;
}
for(int i=1;i<=m;i++)
f[i]=1;
LL ans=m,pre=0;
for(int i=2;i<=n;i++){
pre=a... |
// Problem: C - Unexpressed
// Contest: AtCoder - Caddi Programming Contest 2021(AtCoder Beginner Contest 193)
// URL: https://atcoder.jp/contests/abc193/tasks/abc193_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#pragma GCC d... | // Bismillahir Rahmanir Rahim
//============================
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define infL LLONG_MAX
#define infI INT_MAX
#define pb push_back
#define fo(i,a,b) for(int i=a;i<b;i++)
#define fo2(i,a,b) for(int i... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
string s, next;
cin >> n >> k >> s;
if (n % 2 != 0) {
n *= 2;
s += s;
}
function<char(int l, int r)> calc_winner = [&] (int left, int right) {
if (left == right || (left == 'R' && right == 'S') ||
(left == 'P' && right == 'R') || (... | #include <cstdio>
using namespace std;
const int max_n = 100, tab[3][3] = {
0, 1, 0,
1, 1, 2,
0, 2, 2
};
int dp[max_n][max_n+1], pmn[max_n+1];
char s[max_n];
int main()
{
int n, k;
scanf("%d%d%s", &n, &k, s);
if (n == 1)
{
puts(s);
return 0;
}
pmn[0] = 1;
for (int i = 1; i <= k; i++)
pmn[i] = (pmn... |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define mk make_pair
typedef int64_t ll;
#define P pair<ll,ll>
#define vi vector<ll>
#define vii vector<vector<ll> >
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define rep2(i,m,n) for(ll (i)=(m); (i)<(ll)(n); (i)++)
const ll INF = 1L... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// reading starts
int n;
cin >> n;
vector<vector<int>> a;
set<int> xaxis, yaxis;
// xaxis.insert(10000);
// yaxis.insert(10000);
for(int i = 0; i < n; ++i){
vecto... |
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<vector>
#define fs(i,x,y) for(int i=(x),_=(y);i<=_;++i)
#define fn(i,x,y) for(int i=(x),_=(y);i>=_;--i)
#define tor(i,v,x) for(int i=head[x],v=to[i];i;i=nxt[i],v=to[i])
#define Li inline... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... |
#include <bits/stdc++.h>
using namespace std;
#define fo(i, x, y) for (int i = x; i <= y; ++i)
#define fd(i, x, y) for (int i = x; i >= y; --i)
#define parr(a, x, y)\
{\
for (int i = x; i <= y; ++i) printf("%d ", a[i]);\
printf("\n");\
}
#define pint(a) printf("%d\n", a);
typedef long long ll;
const int maxn = 2... | #include<iostream>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
int ceil2... |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" ... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
template<class T>
bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template<class T>
bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
using ll = long long;
usi... | #include <algorithm>
#include <iostream>
#include <vector>
void dfs(const std::vector<int> &C, const std::vector<std::vector<unsigned long>> &edge, unsigned long idx, std::vector<unsigned long> &ans, std::vector<bool> &used, std::vector<bool> &checked)
{
if (checked[idx])
{
return;
}
else
{... |
#include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(),(l).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using namespace std;
//const ll mod = 998244353;
//const ll maxn = 1000000000;
//const ll mod = 1000000007;
//-----------------... | #include <iostream>
int main(void) {
long long A, B, C;
std::cin >> A >> B >> C;
if (A == B) { // 2,2 -2,-2
std::cout << "=";
return 0;
}
if (abs(A) == abs(B)) { // 2,-2 -2,2
if (C % 2 == 0) {
std::cout << "=";
} else {
std::cout << (A > B ? ">" : "<");
}
retu... |
#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<vector... | #include <bits/stdc++.h>
using namespace std;
const int maxh = 20;
struct Pos {
int r, c;
Pos(int r=0, int c=0) : r(r), c(c) {}
};
int H, W, A, B;
int G[maxh][maxh];
Pos nextPos(int r, int c) {
r--;
c--;
int id = r * W + c;
id++;
r = id / W;
c = id % W;
return Pos(r+1, c+1);
}
void dfs(Pos pos, i... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
int M=1000000007;
const int N=200005;
signed main(){
int t1=1;
//cin>>t1;
while(t1--){
int n,m;
cin>>n>>m;
map<int,int> mp;
for(int i=0;i<n+m;i++){
int x;
cin>>x;
mp[x]++;
}
f... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
set<int> a, b, ab;
rep (i, n) {
int c;
cin >> c;
a.insert(c);
ab.insert(c);
}
rep(i, m) {
int d;
... |
///In the name of GOD
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 3e5 + 10;
const ll SGM = 30;
ll n, ans;
string s;
ll Cnt[SGM];
int main(){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
cin >> s; n = s.size();
s = "$" + s;
Cnt[s[n] ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAX=1e5+10;
const int mod=1e9+7;
const int INF=0x3f3f3f3f3f3f3f3f;
void solve(){
string tem="ZONe";
string s;
cin>>s;
int ans=0;
for(int i=0;i<s.size();i++){
int ji=0;
for(int j=0;j<tem.size();j++){
... |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <random>
#include <chrono>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define _ << " " <<
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define sp(n) fixed << setprecision(n)
#define ff fir... | /**
* author : UshanGhosh
* created : 2020-12-19 18:04:46
**/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define vii vector<int>
#define vcc vector<char>
#define pll pair<long long, long long>
#define mem memset
#define ... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
using namespace std;
// I have no idea what I'm doing
#ifdef DEBUG
#define debug(...) __VA_ARGS__
#else
#define endl '\n'
#define debug(...)
#endif
#define debugf(...) debug(printf(__VA_ARGS__))
const int N = 128;
using ll = long long;
const ll oo = 0x3f3f3f3f3f3f3f3fll;
ll dp[N][N];
int a[... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<ll,int>
#define PI 3.141592653589793
#define pb push_back
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 998244353;
template<class T> inline bool chmax(T& a, T b) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vecto... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vbl;
typedef vector<vector<bool>> vvbl;
void INX(){}
template<typename Head, typename... Tail>
vo... | #include<bits/stdc++.h>
using namespace std;
#define il inline
#define ri register int
#define ll long long
#define ui unsigned int
il ll read(){
bool f=true;ll x=0;
register char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=false;ch=getchar();}
while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=g... |
#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define MAXX 500005
#define PI M_PI
#define pb push_back
#define F first
#define S second
#define fixx(n) fixed << setprecision(n)
#define ll long long
#define int ll
const int mod = 1e9 + 7;
signed main(){
ios_base::sync_with_stdio(0);
ci... |
#include <cstdio>
#include <vector>
#include <algorithm>
int n;
std::vector<int> tree[100000];
constexpr int INF = 100000000;
int size[100000];
int dp[100000];
int size_dfs(int v){
for(int c: tree[v]){
size[v] += size_dfs(c);
}
return size[v] += 1;
}
int dfs(int v){
if(dp[v] != INF) return dp[v];
dp... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
vector<vector<int>> adj;
vector<int> p, sz;
void dfs(int u){
sz[u] = 1;
for(int v : adj[u]){
if(v != p[u]){
dfs(v);
sz[u] += sz[v];
}
}
}
vector<int> memo;
int max_coins(int u){
if(memo[u] != -1) return memo[u];
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define f first
#define s second
#define mk make_pair
ll mod(ll B,ll P,ll M)
{
if(P==0)
return 1;
else if(P==1)
return B%M;
else if(P%2==0){
ll x=... | #include<bits/stdc++.h>
using namespace std;
int read() {
char c=getchar(); int x=0,f=1;
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;
}
const int p=998244353;
int f[200005],g[200005],sf[200005];
int pow_mod(int x,int k) {
in... |
# include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)... | #include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>... |
/**
* author:
* created: 26.10.2020 13:52:11
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i<n;i++)
typedef pair<ll,string> P;
int main() {
ll n;
cin >> n;
vector <ll> a(n),b(n+1,0),c(n+1,0),d(n);
rep(i,n){
cin >> a.at(i);... | #include"bits/stdc++.h"
using namespace std;
long long N;
long long A[200000];
long long Max[200000] = { 0 };
long long _Max = 0;
long long A0_k = 0;
long long ans = 0;
int main(){
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (_Max < A[i]) {
_Max = A[i];
}
Max[i] = _Max;
}
for (int i = 0; i... |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <math.h>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
#include <time.h>
using namespace std;
using ll = long long;
using ld = long double;
u... | #include<bits/stdc++.h>
using namespace std;
const int maxN = 200009;
int N, M, a[maxN], b[maxN];
bool ap[maxN];
long long sumA, sumB;
vector < int > v[maxN];
void dfs (int nod)
{
ap[nod] = 1, sumA += a[nod], sumB += b[nod];
for (auto it : v[nod])
if (!ap[it])
dfs (it);
}
int main ()
{
/... |
#include <bits/stdc++.h>
///#pragma GCC target ("sse4.2")
///#pragma GCC opimize("O1")
///#pragma GCC opimize("O2")
///#pragma GCC opimize("Os")
///#pragma GCC opimize("Ofast")
///#pragma GCC target("avx,avx2,fma")
///#pragma GCC target("avx2")
///#pragma GCC opimize("O3")
///#pragma GCC opimization ("unroll-loops... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
typedef long long ll;
const double pi = acos(-1.0);
#define debug puts("*****************")
#define memset(a,b) memset(a,b,sizeof(a))
const int mod = (1 ? 1000000007 : 998244353);
const int inf = (1 ? 0x3f3f3f3f : 0x7fffffff);
const int... |
#include <iostream> // cout, endl, cin
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <vector> //vector
using namespace std;
#define _LIBCPP_DEBUG 0
#define rep(i, n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
string ans;
ll conbi(int s, int a){
ll cans = 1;
... | #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<Pr> s,t;
string ans = "No";
rep(i,N){
l... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
long long C;
cin >> N >> C;
vector<int> a(N), b(N), c(N);
for (int i = 0; i < N; ++i) {
cin >> a[i] >> b[i] >> c[i];
}
vector<int> d;
for (int i = 0; i < N; ++i) {
d.push_back(a[i] - 1);
d.push_back(b[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
template<typename T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } else return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } else return false; }
using namespace std;
using ll = long long;
... |
#include "bits/stdc++.h"
using namespace std;
/*
find my code templates at https://github.com/galencolin/cp-templates
also maybe subscribe please thanks
*/
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL);}
#define f first
#define s second
#define getunique(v) {sort(v.begin(), v.end())... | #include<bits/stdc++.h>
using namespace std;
bool vis[12];
long long ans=1;
int main(){
int n;
cin>>n;
for(int i=n-1;i>=n-11;i--){
ans*=i;
for(int j=11;j>=2;j--){
if(ans%j==0 && !vis[j]){
vis[j]=true;
ans/=j;
}
}
}
cout<<ans;
return 0;
} |
#define _USE_MATH_DEFINES
//#include <bits/stdc++.h>
# include <iostream>
# include <array>
# include <string>
# include <vector>
# include <algorithm>
# include <functional>
# include <cmath>
# include <iomanip>
# include <stack>
# include <queue>
# include <numeric>
# include <map>
# include <set>
# include <unordere... | #ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
#define rrep(i, a, b) for(int i ... |
#include<bits/stdc++.h>
#define ll long long int
#define endl "\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll test;
ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
cin >> n;
ll a[n], b[n];
for(i = 0; i < n; i++)
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n;
cin>>n;
vector<ll> arr(n+1);
ll m=0, c=-1;
double e=0;
for(ll i=0;i<=n;i++)
{
cin>>arr[i];
m+=abs(arr[i]);
e+=(arr[i]*arr[i]);
c=max(c, abs(arr[i]));
}
e=sqrt... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int x;
cin >> x;
cout << 100 - x % 100 << '\n';
return 0;
} | #include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#de... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
void solve(int test)
{
ll n,m;
cin>>n>>m;
ll mod = 998244353;
ll power[n+1];
power[0] = 1;
ll i;
for(i=1;i<=n;i++)power[i] = (1LL*powe... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<ll> table;
int main() {
ll N, K; cin >> N >> K;
table.resize(2 * N+1, 0);
ll l = max(K + 2, 2ll), r = min(K + 2 * N, 2 * N);
for (ll i = 2; i <= 2 * N; i++) {
// a + b = iになる組み合わせ数をtableに格納する
ll cnt = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0... |
#include <iostream>
using namespace std;
void no() { cout << "-1" << endl; }
int main() {
int n; cin >> n;
string s, t; cin >> s >> t;
long long ans = 0;
int i = 0, j = 0;
while (j < n) {
if (t[j] == '1') {
while (i < n && s[i] == '0') i++;
if (i == n) { no(); retur... | #include<bits/stdc++.h>
using namespace std;
using LL=long long;
using P=pair<int,int>;
using T=tuple<int,int,int>;
constexpr int mod=1000000007;
constexpr int inf=1e9;
constexpr double eps=1e-13;
int in(){
int x;
scanf("%d",&x);
return x;
}
int main(){
int a=in(),b=in(),c=in();
int ans[10][4]={{0,0... |
// #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) { cerr << #a << ": " << a << endl; }
#define endl '\n'
#define fi fir... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define setIO(x) freopen(x".in", "r", stdin), fre... | #include <bits/stdc++.h>
using namespace std;
int pow(int a, int n, int m){
int ret = 1;
while(n > 0){
if(n & 1) (ret *= a) %= m;
(a *= a) %= m;
n >>= 1;
}
return ret;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << pow(a % 10, pow(b % 4, c, 4) + 4, 10) << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define LL long long
#define pb push_back
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
template <class T> T read(T &a) {
a=0;char x=getchar();bool f=0;
for(;x<'0'||x>'9';x=getchar())f|=x=='-';
for(;x>='0'&&x<='9';x=getchar())a=(a<<3)+(a<<1)+... | #include <bits/stdc++.h>
#define SIZE 200005
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
struct BIT
{
int bit[SIZE];
void init()
{
memset(bit,0,sizeof(bit));
}
void add(int k,int x)
{
k++;
while(k<SIZE)
{
bit[k]+=x;
k+=k&-k;
}
}
int get(int k)
{
k++;
int ret=... |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... | #include<bits/stdc++.h>
using namespace std;
char s[200005];
int n,k;
int f[200005][20];
int a[200005];
bool v[20];
const int mod=1e9+7;
void add(int &x,int y){
x+=y;
if(x>=mod)x-=mod;
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
for(int i=1;i<=n;i++){
if(s[i]>='0'&&s[i]<='9')a[i]=s[i]-'0';
else a[i]=s[i]-'A'... |
#pragma GCC diagnostic ignored "-Wunused-const-variable"
#ifdef MAC
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <bitset>
#include <random>
#include <chrono>
#include <complex>
#include <algorithm>
#include <utility>
#in... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5+5;
const ll INF = 1e16;
vector<pair<int,pair<ll,ll>>> adj[N];
vector<ll> dist(N,INF);
void djk(int src){
dist[src] = 0;
priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;
pq.push({0,src});
whil... |
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
struct debug {
~debug(){cerr << endl;}
template<class c> debug& operator<<(c x) {cerr << x; return *this;}
template<class c, class d>
debug& operator<<(pair<c, d> x) {*this << "(" << x.first << ", " << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
pair<double, double> point[n];
rep(i, n) cin >> point[i].first >> point[i].second;
int cnt = 0;
for (int i = 0; i < n; ... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool ch... | #include <bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define deb(x) cout<<#x<<"="<<x<<endl;
#define endl '\n'
#define M 1000000007
#define int long long
#define INF 1e18
#define N 1000005
using namespace std;
vector<ll> bit, bit2;
ll n;
void update(l... |
// Created by ...
#include <bits/stdc++.h>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define vll vector< ll >
#define M 100000
#define MD 1000000007
#define pb push_back
#define rep(i,a,b) ... | //fake_name
#include<bits/stdc++.h>
using namespace std ;
#define int long long int
#define F first
#define S second
int MOD = 998244353 ;
int mod = 1e9 + 7 ;
int inf = 1e18 ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
signed main()
{
ios_base::sync_with_stdio(false) ;
cin.... |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch ... |
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
using namespace std;
const ll maxn = 1e5 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n = 0;
cin >> n;
ll c = 1;
while ((c * (c + 1) / 2) < n)
++c;
cout << c;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define All(a) (a).begin(),(a).end()
#define INF 2e18
#define MOD 1000000007
// ビットをずらすときは1LLを使え
// 有効桁のある小数を書く時はfixed + setorecisionを使え
int main(){
ll n,ans;
string s;
cin >> s;
cout << s[1] <<s[2]<<s[0]<< endl;
/*for(ll i=0;i<n;i... |
#include <bits/extc++.h>
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template<typename... T> void rd(T&... args) {((cin>>args), ...);}
template<typename... T> void wr(T... args) {((cout<<args<<" "), ...);cout<<endl;}
using na... | #include <bits/stdc++.h>
#define ll long long
#define forinc(i,a,b) for(int i=a;i<b;i++)
#define fordec(i,a,b) for(int i=a;i>b;i--)
using namespace std;
class Bit{
public:
vector<int> arr;
int n;
Bit(int n){
arr = vector<int>(n+1,0);
this->n=n;
}
void update(int index,int val){... |
#include <bits/stdc++.h>
using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vb=vector<bool>;using vvb=vector<vb>;using vvl=vector<vl>;using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
#define all(v)(v).begin(),(v).end()
#define... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t=1;
// cin>>t;
while(t--){
long long n;
cin>>n;
string s;
long long a[n]={0};
for(long long i=0;i<n;i++){
cin>>s;
if(s=="AND") a[i]=1;
else a[i]=0;
}
... |
// D - Happy Birthday! 2
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define rep(i,e) for(int i=0;i<(e);++i)
void print(int n, vi v){ cout<< n <<" "; rep(i, n) cout<< v[i] << (i<n-1? " ":"\n"); }
int main(){
int n; cin>>n;
vi A(n); for(int&x:A) cin>>x;
vector<vi> B(200);
for(int d=min(8,... | // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#defi... |
#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()
templa... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#incl... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | // Problem: E - Xor Distances
// Contest: AtCoder - Mynavi Programming Contest 2021（AtCoder Beginner Contest 201）
// URL: https://atcoder.jp/contests/abc201/tasks/abc201_e
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define XOX
#define fas... |
#include <iostream>
#include <vector>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<deque>
#include<math.h>
#include<set>
#include<cstdio>
#include<string>
#include<queue>
#include<complex>
#include<numeric>
#include<stack>
#include<unordered_map>
#include<map>
using namespace std;
#define rep(i,n... | #include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
// struct fast_io {
// fast_io(){
// std::... |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0; i<(ll)n; i++)
#define INF 1e9
typedef long long ll;
const ll MAXN=17;
ll n;
ll d[MAXN][MAXN];
ll dp[1<<MAXN][MAXN];
ll rec(ll S, ll v) {
if(dp[S][v] >= 0) return dp[S][v];
if(S==... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... |
#include <bits/stdc++.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<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_nod... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... |
#include "bits/stdc++.h"
using namespace std;
//#include "testlib.h"
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define int long long
#define ll long long
#define M 1000000007
#define MM 998244353
#define inputarr(a,n) for(int i=0;i<n;++i) cin>>a[i]
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
//#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define fr ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const ull base = 131;
const ull mod1 = 1e9 + 9;
const ull mod2 = 1610612741;
const int maxn = 2e3 + 10;
int h, w;
int dx[] = {0, 0, 1, -1};
i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) c... |
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const double TL = 1.5 * CLOCKS_PER_SEC;
mt19937 rng((unsigned int) chro... | #include <bits/stdc++.h>
#define TRACE(x) cerr << #x << " = " << x << endl
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) (int)(x).size()
using namespace std;
typedef long long ll;
ty... |
#include<cstdio>
#include<algorithm>
#define N 300011
using namespace std;
int a[N];
bool cmp(int x,int y)
{
return x<y;
}
int main()
{
long long n;
scanf("%lld",&n);
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+n+1,cmp);
long long ans=0,count=0;
a[0]=-1e9;
for (int i=1;i<=n;i++)
{
if (a[i]!=a[i-1])
... | #include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define bits(x,i) (((x) >> (i)) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
const int N = 3e5 + 5;
int n;
map<int,int> cnt;
int main(){
ios_base::sync_with_stdio(0... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int a[26]; ///アルファベットの番号を格納
int t[10]; //数字 いろんな順番になる
string s[3];
int sz=0;
long f(string s){
if (t[a[s[0]-'a']]==0) return -1;
long ans = 0;
rep(p, s.size()){
ans = ans*10+t[a[s[p]-'a']];
}
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
te... |
#include<bits/stdc++.h>
#define pl(a) " [" << #a << ": " << (a) << "] "
#define pts(a) " [" << #a << ": { first: " << (a.first) << ", second: " << (a.second) << "}] "
#define all(vi) vi.begin(), vi.end()
#define endl "\n"
#define ll long long
using namespace std;
pair<int, int> n4[4] { {1, 0}, {-1, 0}, {0, 1}, {0, ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
string char_to_string(char val) {
return string(1, val);
}
int ... |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
const int Nmax = 200002;
vector<int> count(Nmax,Nmax);
cin >> n;
int p;
for(int i=0;i<n;i++) {
cin >> p;
if(count[p] == Nmax) count[p] = i+1;
}
int output = 1;
for(int i=0;i<Nmax;i++) {
if(output < count[i]){
while(o... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define mp make_pair
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rsz resize
#define bk back()
#define pb push_back
#define i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
string a, b;
cin >> a >> b;
int aa = 0, bb = 0;
rep(i, 0, 3) {
aa += a[i] - '0';
bb += b[i] - '0';
}
cout << max(aa, bb) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string a, b;
cin >> a >> b;
int sa = 0, sb = 0;
for (int i = 0; i < 3; i++) {
sa += a.at(i) - '0';
sb += b.at(i) - '0';
}
if (sa > sb) {
cout << sa << endl;
} else {
cout << sb << endl;
}
} |
//
// Created by INCOMPETENT CODER on 02-11-2020
//
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
#define debug(...) cout<< " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " ;
ll bin_search(ll a[], ll lb, ll ub, ll item) {
while (lb <= ub) {
ll mid = lb + (ub - lb) / 2;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define pob pop_back
#define eb emplace_... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,m;
cin >> n >> m;
long long P=998244353;
long long dp[m+10];
dp[0]=1;
dp[1]=0;
dp[2]=n * (n - 1) / 2;
if(m <= 2){ cout << dp[m]; return 0; }
long long fact[n+1],inv[n+1],fact_inv[n+1];
fact[1]=1;
fact[0]=1;
inv[1]=... | #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_bou... |
/*
ID: jerrywcy
LINK: https://atcoder.jp/contests/arc107/tasks/arc107_a
TITLE: A - Simple Math
LANG: C++
STATUS:
*/
#include <bits/stdc++.h>
#define DEBUG
#define init(array,x) memset(array,x,sizeof(array))
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll mod=998244353;
ll a,b,c;
int... | /*
Author: klmcoder
Date : 20210227 1735 hrs.
Info : atcoder [abc193-A]
*/
#include <iostream>
#include <iomanip>
int main(void)
{
int a, b;
float p;
std::cin >> a >> b;
p = (((float)a-b)/(float)a)*100.0;
std::cout << p << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int r = r2 - r1, c = c2 - c1;
int ans = 3;
if(!r && !c) ans = 0;
else if(r == c || r == -c || abs(r) + abs(c) <= 3) ans = 1;
else if((r ^ c ^ 1) & 1 || abs(r + c) <= 3 || abs(r - c) <= ... | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define lli long long int
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define pll pair<lli,lli>
#define ve vector<lli>
#define ve... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
const int maxn=2e5+5;
int n,m,k;
long double dp[maxn][2];
long double sum[maxn][2];
int main(){
cin>>n>>m>>k;
for(int i=1,x;i<=k;i++){
cin>>x;
dp[x][0]=1;
}
for(int i=n-1;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ll long long
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
vector<int>v(a-1);
int sum=0;
rep(i,a-1){
cin>>v[i];
sum+=v[i];
}
if(c*a-sum>b){
cout<<-1<<endl;
}
else if(c*a-sum<=0){
cout<<0<<endl;
... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... | #include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define INT(...) \
... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define int long long int
#define popcount(x) __builtin_popcountll(x)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sc second
#define pb push_back
#define fr first
#define all(a) (a).begin(),(a).end()
#define mem0(a) memse... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll M1 = 1e9+7;
void files(){
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
}
void fast(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main(){
fast();
ll n;
cin>>n;
vector<ll> d(n,0);... |
#include <bits/stdc++.h>
using namespace std;
int x, y;
int main(){
cin >> x >> y;
if(x==y)cout << x << endl;
else cout << 3 - x - y << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;cin>>A>>B;
int X=B-A;
for(int i=X;i>0;i--){
if((B/i-1)*i>=A){
cout<<i<<endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n;... | #include <algorithm>
#include <iostream>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cmath>
#include <climits>
#include <queue>
#include <bitset>
#include <set>
#include <assert.h>
#include <map>
using namespace std;
typedef vector<vector<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef double db;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vl;
typedef vector<pii> vpii; typedef vector<pll> vpll;
#define FOR(n) for(int i=0;i<n;++i)
#define IOS ios::sync_with_stdio(0); cin.tie(... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
//typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... |
#include <stdio.h>
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORREV(i, n) for (int i = (n - 1); i >= 0; i--)
#define FORA(i, a, n) for (int i = a; i <= n; i++)
#define INF 1000000000
typedef long long int ll;
typedef unsigned long long int ull;
int sumOfDigits(int N)
{
int sum = 0;
while (N > 0)
... | #include<bits/stdc++.h>
#include<math.h>
#include<set>
using namespace std;
#define ll long long
#define faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define line "\n"
#define sp " "
void sol() {
string a, b;
cin >> a >> b;
int sum_1 = 0... |
#include <bits/stdc++.h>
using namespace std;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define drep(i, x) for (int i = ((int... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.141592653589
ll INF = 1LL << 60;
void rot( pair<double,double>& p, double theta ){
pair<double,double> tempp = p;
p.first = tempp.firs... |
#include <bits/stdc++.h>
using namespace std;
const int kN = 505;
const int kInf = 1e9 + 7;
int n;
int a[kN][kN];
void No() {
puts("No"); exit(0);
}
int main() {
scanf("%d", &n);
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) scanf("%d", &a[i][j]);
}
for(int i = 0; i < n - 1; i++) {
int di... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n,s,d,x,y;
cin>>n>>s>>d;
int flag=0;
for(int i=0;i<n;i++)
{
cin>>x>>y;
if(x<s&&y>d)
flag=1;
}
if(flag==1)
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
#define repc(i,f,n) for(char i=(f); (i) <= (n); i++)
#define PI 3.14159265358979323846264338327950L
#define debug(x) cout<<#x<<" :: "<<x<... |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ul;
int main()
{
ll n,a;
cin>>n;
a=n*1.08;
if(a<206)
{
cout<<"Yay!\n";
}
else if(a>206)
{
cout<<":(\n";
}
else
{
cout<<"so-so\n";
}
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//#define int long long
#define reset(x) memset... |
//include <atcoder>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#define flush fflush(stdout)
#define endl '\n'
#define all... | #include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#inc... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
main()
{
int n,x,i,j;
cin>>n>>x;
char s[n+1];
cin>>s;
for(i=0;i<n;i++)
{
if(s[i]=='o')
{
x++;
}
else
{
x--;x=max(x,0);
}
}
cou... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
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++)
int main() {
int N, X;
string S;
cin >> N >> X >> S;
int point = X;
rep (i, N) {
if (S.at(i) == 'o')
point++;
e... |
#include<bits/stdc++.h>
using namespace std;
int solve()
{
int n;
string f, t;
cin >> n >> f >> t;
int n1f = 0, n1t = 0;
for(int i = 0; i < n; ++i)
{
if(f[i] == '1')
n1f++;
if(t[i] == '1')
n1t++;
}
if(n1f != n1t)
{
cout << "-1\n";
... | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(ios::badbit | ios::failbit);
int n;
string s, t;
cin >> n >> s >> t;
if(count(s.begin(), s.end(), '0') != count(t.begin(), t.end(), '0')){
cout << "-1\n";
return 0;
}
deque<int> a, b;
for(auto rep = ... |
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
template<... | /*
* @Author: RBQRBQ
* @Date: 2020-11-02 10:48:40
* @LastEditors: RBQRBQ
* @LastEditTime: 2020-11-02 11:02:18
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;cha... |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t){
while(*sdbg != ',') { ce... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
#define F(i,s,e) for(ll i=s;i<e;++i)
#define IA(array,size) F(i,0,size) cin >> array[i];
#define PA(array,size) F(i,0,size) cout << array[i] << " "; cout << endl;
constexpr int32_t MOD=1000000007;
int main(){
ll n... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(c % 2 == 0){
if(abs(a) == abs(b)) cout << "=" << endl;
else if(abs(a) > abs(b)) cout << ">" << endl;
else cout << "<" << endl;
}else{
if(a == b) cout << "=" << endl;
else if(a > b) cout << ">" << en... | #include<bits/stdc++.h>
using namespace std;;
int main(){
char C1,C2,C3; cin>>C1>>C2>>C3;
if(C1==C2 && C2==C3)
cout<<"Won"<<endl;
else
cout<<"Lost"<<endl;
} |
#include <bits/stdc++.h>
int count(std::vector<std::vector<int>> vecs) {
int max = vecs[0][0] - 1;
int cnt = 0;
for (int i = 0; i < vecs.size(); i++) {
if (max < vecs[i][0]) {
cnt++;
max = vecs[i][1];
}
}
return cnt;
}
int validation_check(std::vector<std:... | #include <bits/stdc++.h>
using namespace std;
#define ffor(i, a, b) for (int i = a ; i <= (int) b ; i++)
#define rfor(i, a, b) for (int i = (int) b ; i >= a ; i--)
#define vec vector
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
using ll = long long int;... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W, X, Y;
cin >> H >> W >> X >> Y;
auto S = vector<string>(H);
for (int i = 0; i < H; i++) {
cin >> S[i];
}
// for (auto&& e : S) {
// cout << e << " ";
// }
// cout << endl;
// auto cand = vector<int>();
// a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, X, Y;
cin >> H >> W >> X >> Y;
X = X-1;
Y = Y-1; //添え字にした
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
} //2元配列入れた
int count = 0... |
#include <bits/stdc++.h>
using namespace std;
// Pragmas
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
// Macros
#define F first
#define S second
#define all(x) begin(x), end(x)
#define allr(x) rbegin(x), rend(x)
// Aliases
using ll = long long;
using ull = unsigned long long;
using ld = long doub... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 2020;
vector<int> road[MAX_N];
int N, M, A, B;
int vised[MAX_N], visId;
int x;
ll sum;
ll DFS(int s){
if(vised[s] == visId){
return 0;
}
vised[s] = visId;
ll cnt = 1;
for(auto e : road[s]){
cnt += D... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.