code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#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) a ; i >= b ; 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 "bits/stdc++.h"
using namespace std;
typedef long double ld;
typedef long long ll;
#define sz(x) (int)(x).size()
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define f first
#define s second
template<typename T, typename U> bool ckmin(T &a, const U &b){ return b < a ? a = b, true : fal... |
#include <bits/stdc++.h>
#define poi 100
#define int long long
using namespace std;
typedef long long ll;
typedef double db;
char a[poi], b[poi];
int Ahave[poi], Bhave[poi], tothave[poi];
inline int re()
{
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9')
{
if (c == '-')
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<... |
/* Author : Aaryan Srivastava ^__^ */
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define repA(... | #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;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define vt vector
#define pb push_back
#define ub upper_bound
#define l... |
#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 int long long int
#define double long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
#defi... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorit... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... | #include<iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b;
cin>>c>>d;
cout<<b-c;
} |
// Author : heyuhhh
// Created Time : 2020/11/11 10:33:54
#include<bits/stdc++.h>
#define MP make_pair
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 5e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
retu... |
#include<bits/stdc++.h>
#define N 1005
using namespace std;
int n,m,f[N][N],ans=-1;
struct z{
int to,w;
};vector<z>b[N];
queue<z>q;
bool ok[N][N];
void bfs(){
memset(f,-1,sizeof(f)),f[1][n]=0,q.push((z){1,n});
while(!q.empty()){
int x=q.front().to,y=q.front().w;q.pop();
if(~ans&&ans<=f[x][y]*2)break;
if(x==y){... | #include<bits/stdc++.h>
using namespace std;
const int N=505;
int f[N][N];
int a[N][N],b[N][N];
struct qw{
int x,y,v;
bool operator < (const qw &w) const
{
return v>w.v;
}
};
priority_queue<qw> heap;
int vis[N][N];
int n,m;
int check(int x,int y)
{
if(x<1||x>n||y<1||y>m) return 0;
return 1;
}
void dij()
{
int ... |
// clang-format off
#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;
#ifndef godfather
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,a... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
sort(ALL(a), great... |
/**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin >> a;
a%=100;
cout << 100-a << endl;
}
|
//----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
type... | #include<bits/stdc++.h>
using namespace std;
#define MAXN 300005
#define lowbit(x) (x&-x)
#define reg register
#define mkpr make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigned long long uLL;
const int INF=0x7f7f7f7f;
const LL jzm=2333;
const double Pi=acos(-1.0);
typedef pair<int,int> ... |
// Problem: A - Slot
// Contest: AtCoder - AtCoder Beginner Contest 189
// URL: https://atcoder.jp/contests/abc189/tasks/abc189_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp... | #include <iostream>
#include <string>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
if(s.at(0)==s.at(1)&&s.at(0)==s.at(2))
cout<<"Won";
else
cout<<"Lost";
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define pb push_back
#define f first
#define s second
#define rrep(i, n) for(int i=n-1;i>=0;i--)
#define rep(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), co... | //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... |
#include <bits/stdc++.h>
using namespace std;
//a枚ある金貨がn回で100枚になって終わる確率
long double prob(int n, int a, int b, int c){
int u = 100 - a;
if(u > n) return(0.0);
if(n - u > (99-b) + (99-c)) return(0.0);
long double p = 1.0;
for(int i=0; i<u; i++){ p *= ((long double)(a+i)/(long double)(a+b+c+i)); }
long double ret ... | #include <iostream>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
using namespace std;
const int INF = 1 * (1 << 30);
const int mINF = -1 * (1 << 30);
int main()
{
double ans = 0;
int n, d, h;
cin >> n >> d >> h;
for (int i = 0; i < n; i++)
{
int d_i, h_i;
ci... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// int/long: -2,147,483,648 - 2,147,483,647 (-2^31 <= int < 2^31)
// long/long long: -9,223,372,036,854,775,808 - 9,223,372,036,854,775,807 (-2^63 <= long < 2^63)
//#define INF (1<<30)
#define INF (2147483647)
// 2^31 -1
//= 1,073,741,824 *2 -1
//= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vec vector
#define rep(i,n) for (int i=0; i<(n); i++)
#define print(a) cout << a << endl
#define fix(n) fixed << setprecision(n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Yes "Yes"
#d... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a, b;
cin >> a >> b;
for (int i = 1; i <= a; ++ i)
{
if ((a - i) * i > b)
{
cout << "No" << endl;
break;
}
if ((a - i) * i == b)
{
cout << "Yes" << endl;
break;
}
}
return 0;
} | #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 ... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
ll t, a, b;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> t;
ll ans = 0;
while (t--) {
cin >> a >> b;
ans += b*(b+1)/2 - (a-1)... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define rep(i, n) FOR(i,0,n)
#define irep(i, n) IFOR(i,0,n)
#define all(v) begin(v), end(v)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P ... |
#include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplac... | #include <bits/stdc++.h>
// #define x first
// #define y second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
int n, t;
int main()
{
IOS; cin >> t >> n;
cout << (100ll * n + t - 1) / t + n - 1 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, w;
scanf("%d %d", &n, &w);
printf("%d\n", n / w);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 105
#define INF 1000000005
#define INFLL (ll)1000000000000000005
#define PI 3.1415926535897
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(... |
#include<bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;
const ld EPS = 1e-9;
signed main() {
cout << fixed << setprecision(15);
ld x, y, r; cin >> x >> y >> r;
if (x >= 0) { x += EPS; } else { x -= EPS; }
if (y >= 0) { y += EPS; } else { y -= EPS; } r+=EPS;
ll bai = 10000, ans = ... | #include <vector>
#include <array>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#inc... |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i=int(a);i<int(b);++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i=int(b)-1;i>=int(a);--i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(obj) rbegin(obj)... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <list>
#include <iterator>
#include <set>
#include <map>
#include <stack>
using std::cout;
using std::cin;
using std::string;
using std::vector;
using std::endl;
int main()
{
double r, x, y;
... |
#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,x;
cin >> n >> x;
rep(i,n){
int a;
cin >> a;
if(a!=x) cout << a << " ";
}
cout << endl;
} |
//#pragma GCC target("avx2")
#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
c... |
// #include <atcoder/all>
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::nu... |
#include<iostream>
#include<sstream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<numeric>
#include<queue>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
#define ... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define all(x) begin(x), end(x)
#define Done(x) cout<<x<<endl; return;
#define endl '\n'
void solve(){
int n; cin>>n;
int m; cin>>m;
map<int,int>occur;
for(int i=0;i<n;i++){
int a; ci... |
#include <bits/stdc++.h>
using namespace std;
void chmin(int64_t& a, int64_t b) {
if (a > b) a = b;
}
int main() {
int64_t n, m;
cin >> n >> m;
vector<int64_t> h(n);
vector<int64_t> w(m);
for (int64_t i = 0; i < n; i++) cin >> h.at(i);
for (int64_t i = 0; i < m; i++) cin >> w.at(i);
sort(h.begin... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> all... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, w;
cin >> n >> w;
vector<pair<int, int>>sim;
for(int i = 0; i<n; ++i){
int s, t, p;
cin >> s >> t >> p;
sim.push_back(make_pair(s, p));
sim.push_back(make_pair(t, -p));
}
sort(sim.begin(), sim.end());
ll curr = 0;
... | /*
https://atcoder.jp/contests/abc200/tasks/abc200_e
## 題意：
## 思路：
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 0x3fffffff;
const ll LINF = 9223372036854775807;
#define dump(x) cout << #x << " = " << (x) << endl
#define ALL(x) begin(x),end(x)
#define rep(i,s,e) for(ll ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
ll comb(ll a, ll b){
ll ans = 1;
for(int i=1;i<=b;i++){
ans = ans * a / i;
a--;
}
/* for(int i=1;i<=b;i++){
ans = ans / i;
}*/
return ans;
}
int main()
{
ll L; cin >> L;
cout << c... | #include <iostream>
#include <vector>
#include <cstdint>
int main() {
constexpr int N = 12;
int L;
std::cin >> L;
std::vector<std::vector<std::int64_t>> counts(L + 1, std::vector<std::int64_t>(N + 1));
counts[0][0] = 1;
for (int i = 1; i <= L; ++i) {
for (int j = 0; j < i; ++j) {
for (int k = 1; ... |
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
LL a[303030];
// ※※※ 以下のライブラリを使用(一部改変) ※※※.
// 遅延評価セグメン... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<int, int>> vii;
typedef pair<int, int> pi;
#define MOD 1000000007LL
int N, Q; int n2;
int stree[1200000]={};
void add(int v, int i) {
i += n2;
for (; i >= 1; i /= 2) stree[i] ^= v;
}
int sum(int ... |
#include<cstdio>
#include<functional>
#include<utility>
#include<algorithm>
#include<set>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
int N, M;
scanf("%d %d", &N, &M);
pair<int, int> pawn[M];
for (unsigned i = 0; i < M; i++) scanf("%d %d", &pawn[i].first, &paw... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
long long n, k;
int arr[9][9] = {0,};
int visited[9]={0,};
int answer=0;
void dfs(int node, long long times){
if(node<0 || node>=n || times>k){return;}
if(visited[node]==1) return ;
for(int i=0; i<n; i++){
if(i ==... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n), s(n+1, 0);
for(auto &x : a) cin >> x;
sort(a.rbegin(), a.rend());
for(int i = 0; i < n; ++i){
s[i+1] = s[i] + a[i];
}
long long ans = 0;
for(int I = 1; I <= n; ++I){
int i = I-1;
ans += (n-... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<LD> VLD;
typedef vector<string> VS;
#define rep(i, min, max) for (int i = min; i < (int)(max); i++)
int main()
{
LL N;
cin>>N;
VL X(N);
for(LL& x: X) cin>>x;... |
#include<iostream>
#include<iterator>
#include<set>
using namespace std;
int main()
{
long n;
cin >> n;
set<long>ans;
for(long d=1;d*d<=n;d++){
if(n%d==0){
ans.insert(d);
ans.insert(n/d);
}
}
for(auto x:ans)cout << x << endl;
}
| #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<map>
#include<set>
#define int long long
#define lowbit(x) (x&(-x))
#define mid ((l+r)>>1)
#define lc (x<<1)
#define rc (x<<1|1)
#define max Max
#define min Min
#define ab... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
set<int> divisors(int M) {
set<int> r;
for (int i = 1; i * i <= M; ++i) {
if (M % i != 0) continue;
r.insert(i);
r.insert(M / i);
}
return r;
}
int N;
vector<int> A;
int gcd(int a, int b) {
while (b) {
... | #include <iostream>
#include <map>
using namespace std;
long long int parejas;
long long int n, aux;
map<int, long long int> arre;
int main()
{
cin>>n;
for(int i=1;i<=n;++i){
cin>>aux;
arre[aux]++;
}
aux=0;
for(pair<int, long long int> recorre : arre){
parejas+=((recorre.seco... |
#pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
t... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(auto i = begin; i < (end); i++)
#define contains(v, x) (find(all(v), x) != v.end())
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }
template<class T... |
#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;
#define lli long long int
#define ld long double
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define vl vector<lli>
#define vll... |
#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;
// typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define pb push_back
#define S second
#define... | // D - RGB Coloring 2
// sample code
// reference: https://atcoder.jp/contests/abc199/submissions/22053625
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
using ll = int64_t;
#define rep(i,e) for(int i=0;i<(e);++i)
vec<vi> G;
vi IX; //dfs の順を記録。違う連結成分になら同じ index もある
ll dfs(int no... |
#include <bits/stdc++.h>
using namespace std;
void DBG() { cerr << endl; }
template<class Head, class... Tail>
void DBG(Head H, Tail... T) { cerr << ' ' << H; DBG(T...); }
#define dbg(...) cerr << "(" << (#__VA_ARGS__) << "):", DBG(__VA_ARGS__)
using ll = long long;
using ld = long double;
#define sqr(a) ll(a) * (a)... | /*
Author : zzugzx
Lang : C++
Blog : blog.csdn.net/qq_43756519
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define SZ(x) (int)x.size()
#define mem(a, b) memset(a, b, siz... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int n;
cin >> n;
cout << 10 << ' ' << 6 << ' ' << 15 << ' ';
n -= 3;
int k = 2;
set<int> s;
while(10*k<=10000){
s.insert(10*k);
k++;
}
k = 2;
while(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
deque<long long> adj;
int main(){
cout.sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
string s, t; cin >> s >> t;
for(long long i = 0; i < n; i++){
char c = s[i];
if(c == '1')
adj.push_b... | #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++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
template <class T = ll> using V = vector<T>;
#define loop(n) while(n--)
#define rep(i,n) for(int i=0; i<(n);++i)
#define repp(i, l, r) for(int i = (l); i < (r); ++i)
#define all(v) (v).begin(), (v).end()
#define LL(n) int n;cin >> n
int main()
{
LL... | #include <chrono>
#include <thread>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define T top()
#define E end()
#define PS push
#define Q queue
#define PP pop()
#define L0 (LL)0
#define V vector
#define ST stack
#... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
int A, B;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> A >> B;
for(int i = -100; i <= 100; i++) {
for(int j = -100; j <= 100; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int a, b;
cin >> a >> b;
cout << ((a+b) >> 1) << " " << ((a-b) >> 1);
return 0;
}
|
#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#ifndef LOCAL
#define cerr if(0)cerr
#endif
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using pii = pair<int, int>;
const int N = 2e5+1;
int n, m, num[N];
vector<pii> g[N];
bool vis[N];
void d... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
struct Edge {
int t, c;
Edge() = default;
Edge(int t, int c) : t(t), c(c) {}
};
int main() {
int N, M; cin >> N >> M;
... |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<iterator>
#include<string>
#include<sstream>
#include <unordered_map>
#include<cmath>
using namespace std;
#define ll long lo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using ld=long double;
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int x,y,a,b;
cin >> x >> y >> a >> b;
int ans=0;
while(x*a<=x+b and (ld)x*a+1e-8<(ld)y){
x*=a,ans++;
}
ans+=(y-1-x)/b;
cout << ans;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define deb(x) cout<<#x<<" "<<x<<endl;
#define print(arr,n) for(int i=0;i<n;++i) { cout<<arr[i]<<" "; } cout<<endl;
#define ub(x,el) upper_bound(x.begin(),x.end(),el) - x.begin()
#define lb(x,el) lower_bound(x.begin(... | #include<stdio.h>
int main()
{
int N,a[100000],b[100000],i,c=0;
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%d",&a[i]);
for(i=0;i<N;i++)
{ scanf("%d",&b[i]);
c=a[i]*b[i]+c;}
if(c==0)
printf("Yes");
else printf("No");
return 0;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i ... | #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<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define rep(i,j,n)... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,k;
cin>>n>>k;
long long int s=k;
vector<pair<long long int,long long int> > v;
///s=k;
//cout<<s;
//int p=k;
for(int i=0;i<n;i++)
{
long long int a,b;
cin>>a>>b;
v.push_back(make_pair(a,b));
}
sort(v.begin(),v.end());
//s=k;
... |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll i = 0; i < N; i++)
int main()
{
int m=1000000007;
ll n; cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<vector<ll>> f(n+2,vector<ll>(2));
f[0][0]=0; f[0][1]=1;
rep(i,n){
f[i+1][0]=f[i][1]%m;
f[i+1][1]=(f[i][0... |
#include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n,C;
cin>>n>>C;
int a[n],b[n],c[n];
map<int,int> m;
set<int> s;
for(int i=0;i<n;i++) {
cin>>a[i]>>b[i]>>c[i];
m[a[i]]+=c[i];
m[b[i]+1]-=c[i];
s.insert(a[i]);
s.insert(... |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#defin... | /*
after dusk passed,
there is a starry sky.
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
#define int long long
using namespace std;
const int N=1e5+100;
int n,l,a[N],b[N],ans;
map <int,vector<int> > mp;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define CEIL(a, b) ((a - 1) / b + 1)
void solve() {
i... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define mod 998244353
#define pll pair<long long,long long>
using namespace std;
templat... |
#include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <iterator>
#include <queue>
#define ll long long int
using namespace std;
bool isOk(ll r,ll x,ll y,ll num){
if( ... |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
if(n % 2 == 0)
cout<<"White";
else
cout<<"Black";
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#define rep(i,n) for (int i=0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int i;
cin >> i;
if(i < 0){
i = 0;
}
cout << i << endl;
re... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define FILL0(x) memset(x,0,sizeof(x))
#define FILL1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... |
#include <bits/stdc++.h>
#define int long long
#define PI pair<int,int>
using namespace std;
const int maxm=2e6+5;
struct Mat{
int a[3][3];
void init(){
memset(a,0,sizeof a);
}
Mat operator*(const Mat& x){
Mat ans;ans.init();
for(int k=0;k<3;k++){
for(int i=0;i<3;i++)... | #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<ll, ll>;
P op1(P v) {
return make_pair(v.second, -v.first);
}
P op2(P v) {
return make_pair(-v.second, v.first);
}
P op3(P v, ll p) {
return make_pair(2 * p - v.first, v.second);
}
... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
// URL: https://atcoder.jp/contests/abc190/tasks/abc190_c
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) f... | # pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define rep2(i,a,b) for(int i = (b) - 1; i >= (a); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll r,x,y;
cin >> r >> x >> y;
ll po = x*x + y*y;
ll res = 0;
r *= r;
res = po / r;
//cout << res << endl;
//cout << pow((ll)(sqrt(res)),2) << endl;
if(pow((ll)(sqrt(res)),2) == res && po % r == 0){
... | # include <cstdio>
int t[100],t_n=0;
bool b[12];
void work(int x) {
int now=x;
t[t_n++]=now; b[now]=true;
while(!b[now*x%10]) now=now*x%10, b[now]=true, t[t_n++]=now;
}
int qpow(int x,int p,int mod) {
int res=1;
while(p) {
if(p&1) res=1ll*res*x%mod;
x=1ll*x*x%mod; p>>=1;
}
return (res-1+mod)%mod;
}
int main(... |
#include <string>
#include <iostream>
#include <stack>
#include <queue> // priority_queue も入ってる
#include <set> // 要素数は size() で取得 multisetもある
#include <map>
#include <array> // sizeはコンパイル時定数で固定
#include <vector>
#include <numeric> // accumulate, gcd
#include <algorithm> // count_ifに必要
#include <iomanip> // cout <... | #include <bits/stdc++.h>
#define isz(x) (int)(x).size()
struct Fenwick {
std::vector<int> data;
Fenwick(int n) : data(n,0) { }
void inc(int p, int x) {
for (int i = p; i < isz(data); i |= i+1)
data[i] += x;
}
void inverse(int i) {
int oldValue = get(i,i);
int newV... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 2 == 0)
cout << "White" << endl;
else
cout << "Black" << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long lint;
#define int lint
const int MOD = 1e9 + 7;
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i
signed main()
{
int n;
cin >> n;
if (n % 2 == 0)
cout << "Wh... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
ll x;
map<ll, ll> sv;
ll f(ll y){
if (sv.find(y) != sv.end()) return sv.find(y)->second;
sv[y] = 0LL;
ll &ans = sv[y];
if (y>x){
if (y&1){
ll ri = y+1LL;
ll le = y-1LL;
return ans = min(f(ri)+1LL, f(le)+1LL);... | #include<bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define elif else if
#define INF 1000000007
using namespace std;
int a,b,k,m,n,cnt=0,aa[110000];
string s,t;
char c;
signed main()
{
cin>>n>>k>>m;
rep(i,n-1){
cin>>aa[i];
cnt+=aa[i];
}
if(n*m-cnt>k){
cout<<-1;
}elif(n*m-cnt<0... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define pb push_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
usi... | #include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){
int a=0,fh=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')fh=-1;c=getchar();}
while('0'<=c&&c<='9'){
a=a*10+c-48;
c=getchar();
}
return a*fh;
}
#define MN 200005
#define pii pair<int,int>
#define mp make_pair
#define x first
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(v) int((v).size())
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define int ll
int n, k;
vector<int> tree[222'222];
int cnt = 0;
int dfs(int now, int before, int U)
{
int x = 0;
for (int ... |
// -- //
#include <bits/stdc++.h>
#define pll pair<ll, ll>
#define x first
#define y second
using namespace std;
typedef long long ll;
const ll N = 808;
ll a[N][N];
ll p[N][N];
signed main(){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
ll n, k;cin >> n>>k;
for(ll i = 0;i<n;i++){
for(ll j = 0;j... | #include <bits/stdc++.h>
#define speedup ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr),cout.precision(12)
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_sta... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N, K; cin >> N >> K;
vector<vector<int>> A(N, vector<int>(N));
for (auto &a : A) for (auto &v : a) cin >> v;
... |
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int > pii;
const ll maxn = 1005;
const ll mod =1e9+7;
const ld... | /*
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
*/
#include<bits/stdc++.h>
#define ALL(x) (x).begin(),(x).end()
#define ll long long
#define db double
#define ull unsigned long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i... |
#include<bits/stdc++.h>
using namespace std;
#pragma region atcoder
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma endregion
#pragma region macros
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<i... | #include<stdio.h>
#include<algorithm>
#define nmax 18
#include<cstring>
#define INF 0x3f3f3f3f
using namespace std;
int n; //城市数
struct City{
int x, y, z;
}city[nmax];
int dp[nmax][1<<nmax]; //到城市，状态的最小花费
int dis[nmax][nmax]; //城市之间的花费
int ans=INF;
int dist(City a, City b);
void read();
void create_dis();
vo... |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int> > sunuke(N, vector<int>(3));
for(int i = 0; i < N; i++){
cin >> sunuke[i][0];
cin >> sunuke[i][1];
cin >> sunuke[i][2];
}
set<int> st;
for(int i ... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpii = vector<pii>;
using vpil = vecto... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chm... |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace __gnu_pbds;
using namespace std;
int n;
string s[200000];
int main(){
//IO("input.txt", "output.txt");
ios_base::sync_with_std... | #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<string> s(n);
rep(i, n) cin >> s[i];
set<string> st;
rep(i, n) st.insert(s[i]);
rep(i, n) {
if (st.count('!' + s[i])) ... |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll INF = (1LL << 61);
ll extgcd(ll a, ll b, ll& x, ll& y){
if (b > a) return extgcd(b, a, y, x);
if (b == 0){
x = 1; y = 0;
return a;
}
... |
#include <set>
#include <map>
#include <iostream>
using namespace std;
long long check(multiset<long long>& M1, multiset<long long>& M2) {
auto m1 = M1.begin();
long long ret = 1000000000000000000;
while (m1 != M1.end()) {
long long d1 = -1;
long long d2 = -1;
auto m2 = M2... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n = 0;
cin >> n;
vector<double> p0(2), p2n(2), pc(2), pc0(2);
cin >> p0.at(0) >> p0.at(1) >> p2n.at(0) >> p2n.at(1);
double theta = (2.0 * M_PI) / (double)n;
pc.at(0) = (p0.at(0) + p2n.at(0)) / 2;
pc.at(1) = (p0.at(1) + p2n.at(1)) / ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, c... |
//Bismillahir Rahmanir Raheem
#ifdef ONLINE_JUDGE
#include<bits/stdc++.h>
#endif
#include<iostream>
#include<numeric>
#include<tuple>
#include<iomanip>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<math.h>
#include<vector>
#include<climits>
#include<algorithm>
#in... | #include<bits/stdc++.h>
using namespace std;
//#Rohitpratap311
//#Keep Calm And Stay Happy
using ll = long long;
using ld = long double;
#define loop(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
ll mod=1e9;
ll binpow(long long a, ... |
#include<iostream>
#include<cstdio>
#include<cstring>
#define re register
#define X first
#define Y second
#define mp std::make_pair
#define pb push_back
#define ohh(hhh...) fprintf(stderr,hhh)
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int,int> pii;
template<class T1> inline bool cmax(T1 &... | #include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define ll long long
#define rep(i,n) for(int i = 0;i < (int)n;i ++)
#define mod % 998244353
using namespace std;
int main(void){
ll n;
cin >> n;
ll A[n+1];
A[0] = 1;
r... |
#include <iostream>
#include <vector>
#include <string>
#include <random>
#include <ctime>
#include <map>
#include <set>
using grid = std::vector<std::vector<int64_t>>;
std::random_device rng_seed;
std::mt19937_64 rng(rng_seed());
int n, m, longest;
std::map<std::pair<int64_t, int>, int> s_map;
int64_t calc_hash(co... | #include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define mod 1000000007LL
#define endl "\n"
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 8e5+5;
int a[sz];
pair <int,int> b[sz];
bool cut[sz];
int main() {
int n;
cin >> n;
n <<= 1;
for(int i=0; i<n; i++) scanf("%d", &a[i]), b[i] = {a[i], i};
sort(b, b+n);
for(int i=0; i<n/2; i++) cut[b[i].second] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
using ll=long long;
typedef pair<int,int> P;
signed main(){
int n;cin>>n;
vector<int> v(2*n);
REP(i,2*n)cin>>v[i];
vector<P> w(2*n);
REP(i,2*n)w[i]=P(v[i],i);
sort(ALL(w));
vector<int>... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=b;i++)
using LL = long long;
const int Nmax=2009;
int H,W,r[Nmax],c[Nmax],cnt,ans;
string S;
vector <int> adj[Nmax];
void Conn(int a, int b) {
adj[a].push_back(b); adj[b].push_back(a);
}
void DFS_r(int curr, int prev) {
r[cur... | #define George_Plover
#include <queue>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <iomanip>
#include <algorithm>
#define MAXN 1100
#define LL long long
using namespace std;
int n,m;
bool visr[MAXN],visc[MAXN];
bool vis[MAXN][MAXN];
char s[MAXN][MAXN];
int fa[MAXN*MAXN];
queue<p... |
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 3e3 + 10;
ll H, W, Par[MXN], Sz[MXN];
vector<ll> R[MXN], C[MXN];
string s[MXN];
ll f1, f2, f3;
ll Find(ll x){
return (x == Par[x] ? x : Par[x] = Find(Par[x]));
}
bool Union(ll u, ll v){
u = Find(u), v =... | #include<bits/stdc++.h>
#define MAX 1000000007
#define MOD 998244353
#define ll long long int
#define fo(i,a,n) for(int i=a;i<n;i++)
#define ull unsigned long long int
#define pb push_back
#define eb emplace_back
#define in insert
#define cl clear
#define ld long double
#define mp make_pair
#define ii pair<int,int>
con... |
//---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
//---------------------------------------------------------------
#define rep(i, n) for (long lon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = (int) 1e9 + 7;
int d[200 + 7][200 + 7];
int a(int x) {
return x;
}
int b(int x) {
return 100 + x;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
for (int i = 1; i <= 200; i++) {
for ... |
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int X;
cin >>X;
int A= X%100;
cout <<100-A;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define vi vector<int>
#define vll vector<ll>
#define vstr vector<string>
#define PI 2*acos(0.0)
#define test ll tc;cin>>tc; while(tc--){solve();}
#define MAX3(a,b,c) max(a,max(b,c))
#define MIN... |
#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 f(i,a,b) for(ll i=a;i<b;i++)
#define rf(i,a,b) for(ll i=a-1;i>=b;i--)
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define V vector
#define debug(v) {for(auto i: v) cout << i << " "; cout << endl;}
#define vcin(v) rep(i, v.size()) cin >> v[i]
#define wcin(v, w) rep(i, v.size())... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n-1); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr int N = 2000;
vector<vector<int>> g(N);
int bfs(int start, int n) {
vector<int> dist(N, -1);
queue<int> q;
dist... | #include <bits/stdc++.h>
using namespace std;
const int N = int(2e5) + 2;
int cnt;
bool cycle, vis[2*N];
vector<int> G[2*N];
void DFS(int u, int par)
{
vis[u] = 1;
++cnt;
int chk = 1;
for(const int &v : G[u]) {
if(v == par && chk) {
--chk;
continue;
}
if... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}... | #include <iostream>
#include <vector>
#define int long long
using namespace std;
const int N = 30;
typedef long long LL;
int n;
LL seq[N];
signed main(){
#ifndef ONLINE_JUDGE
freopen("tpl.txt","r",stdin);
#endif
cin >> n;
for(int i = 0; i < n; i ++) cin >> seq[i];
int ans = 0x7f7f7f7f;
for(int i = 0; i <= (1 <... |
#include<bits/stdc++.h>
using namespace std;
int n,m,ans=0;
bool dt[20][20];
char str[20];
inline int read()
{
int x=0,w=0;char ch=0;
while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return w?-x:x;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++){
scanf("%s"... | //#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<vector>
#define swap(x,y) (y -= (x = ((y += x) - x)))
#define max(a,b) (((a) > (b)) ? (a) : (b))
#define min(a,b) (((a) < (b)) ? (a) : (b))
#define rep(i,n) for(int i = 0; i <... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b)... | #include<cstdio>
#include<algorithm>
#include<set>
using namespace std;
int n,s[500005],t[500005],tops,topt;
long long ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
char tmp;
scanf(" %c",&tmp);
if(tmp=='1') s[++tops]=i;
}
for(int i=1;i<=n;i++)
{
char t... |
#include <iostream>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
if(x + y> 14 and y > 7){
cout << "1";
} else if (x + y > 9 and y > 2){
cout << "2";
} else if (x + y > 2 and y >= 0){
cout << "3";
} else {
cout << "4";
}
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
#include <typeinfo>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define lli long long int
#define fr(i,a,b) for(lli i=a;i<b;i++)
#define bfr(i,a,b) for(lli i=a;i>... |
#include <bits/stdc++.h>
using namespace std;
int n,m,c=0;
vector<bool>vis;
vector<vector<int>>adj;
void dfs(int node)
{
vis[node]=true;
for(auto child: adj[node])
{
if (!vis[child])
{
c++;
dfs(child);
}
}
}
int main() {
int i,j;
cin>>n>>m;
adj.resize(n);
vi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(... |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <iostream>
#include <fstream>
#include <chrono>
using namespace std;
const int MOD = 998244353;
class ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 3e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -... |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... | #include<cstdio>
#include<algorithm>
using namespace std;
const int N=400005;
int fa[N],rk[N];
int h[N],nxt[N],to[N],ww[N],cnt=0;
int n,m;
int ans[N];
int getfa(int x) {
if (fa[x]==x) return x;
return fa[x]=getfa(fa[x]);
}
void SetUnion(int fx,int fy) {
if (rk[fx]>rk[fy]) swap(fx,fy);
fa[fx]=fy;
rk[fy]+=rk[fx];
}
... |
//Name : Rupa Dey
//Date : 1st November 2020 //happy birthday Mhamuda
//joi sri gour hori gobindo...
//gobindo ja hobe vlor jonnoi hobe..
#include<bits/stdc++.h>
#define ll long long
#define d double
#define ld long double
#define vi vector<int>
#define vul vector<ull>
#define vl vector<ll>
#define pb push_back
#d... | #include<bits/stdc++.h>
using namespace std;
int n;
int main(){
cin >> n;
int t;
vector<tuple<int, int, int>> v;
while(cin >> t){
int a, b;
cin >> a >> b;
v.push_back(make_tuple(t, a, b));
}
int ans = 0;
for(int i=0; i<(int)v.size()-1; i++){
for(int j=i+1; j<(int)v.size(); j++){
bool... |
#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 = 1e5 + 10;
int a[maxn], b[maxn], n;
int main()... | #include <bits/stdc++.h>
#include <time.h>
using namespace std;
//typedef
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
//define
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
int main(){
int n;
cin >> n;
vector<ll> a(n),b(n);
rep(i,n) cin >> a.at(i)... |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
#define ull unsigned long long
void testcase(){
ll n,ans=0;
cin>>n;
for(int i=1;i<=n;i++){
bool st=true;
int j=i;
while(j){
if(j%10==7){
st=false;
bre... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define F first
#define S second
#define pll pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define decimal(n) cout << fixed << setpr... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... | #include <queue>
#include <cstdio>
#include <cstring>
#pragma GCC optimize(2)
#define int long long
const int N = 505;
struct twt {
int x, y, d;
bool operator < (twt b) const {
return d > b.d;
}
};
std::priority_queue<twt> que;
int R, C, a[N][N], b[N][N], dis[N][N];
void Dijkstra() {
memset(dis,... |
/**
* author: ekusiadadus
* created: 03.01.2021 14:00:37
**/
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define repn(i,n) for(int i = 1; i <= (n); i++)
#define pb pus... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long LL;
const int MAXN = 2E5 + 5;
const int MOD = 1E9 + 7;
int n, m, k;
LL x[MAXN], y[MAXN];
LL mixh[MAXN], miyh[MAXN];
LL ans = 0;
template <class T>
void read(T& x) {
x = 0;
T f = 1;
char ch =... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(ll x, ll y)
{
if (x >= y)
return x - y;
ll ans = y - x;
queue<pair<ll, int>> q;
map<ll, int> mp;
q.push({y, 0});
while (q.size())
{
auto p = q.front();
q.pop();
ll cur = p.first;
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000000000000
#define MOD 998244353
using ll=long long;
using Graph=vector<vector<int>>;
int main(){
ll X,Y;
cin>>X>>Y;
if(X>=Y){
cout<<X-Y<<endl;
}else{
ll ans=Y-X;
vector<map<ll,ll>> m(64);
m[0][Y]=0;
for(int i=0;i<63;i++){
... |
#include<bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define ll long long
#define maxheap priority_queue<int>
#define minheap priority_queue<int,vector<int>,greater<int>>
#define all(v) (v).begin(),(v).end()
const double pi = acos(-1.0);
const double eps = 1e-12;
using namespace std;
const... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
int n,x;
string s;
cin>>n>>x>>s;
int ans=x;
rep(i,n){
if(s[i]=='o') ans++;
... |
#include<bits/stdc++.h>
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 INF (ll)1e9 //10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9+7) //10^9+7:合同式の法
#define PI 3.141592653589
#define PB push_back
#define F first
#d... | #include <bits/stdc++.h>
std::string b,t="fox";int a,i;main(){for(std::cin>>a>>b;i<a-2;i++)if(b.substr(i,3)==t)b.erase(i,3),i=std::max(-1,i-3),a-=3;std::cout<<a;}
|
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define pb push_back #define po pop_back
#define YES cout<<"YES\n" #define Yes cout<<"Yes\n" #define NO cout<<"NO\n" #define No cout<<"No\n"
#define for00 for(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; (i) >= (int)(a); (i)--)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> using V = vector<T>;
template <class T> using VV = vector... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = (1LL << 60);
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main(){
ll T;cin>>T;
string seq0,seq1;
rep(i,100000)seq0+="0";
rep(i,100000)seq1+="1";
rep(i,T){
ll N;
cin >> N;
rep(j,3){
... | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;... |
#include<bits/stdc++.h>
const int N=200010;
int n,m;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin>>n>>m;
if(m>0){
if(m+2>n){
std::cout<<"-1\n";
return 0;
}
for(int i=1;i<=... | #include <cstdio>
#include <cctype>
using namespace std;
#define gc getchar
inline int read()
{
int c = gc(), t = 1, n = 0;
while (isspace(c)) { c = gc(); }
if (c == '-') { t = -1, c = gc(); }
while (isdigit(c)) { n = n * 10 + c - '0', c = gc(); }
return n * t;
}
#undef gc
int main()
{
int n = read(), m = read(... |
//author: hitch_hiker42;
#include<bits/stdc++.h>
using namespace std;
//solution:
#define int int64_t
#define span(a) begin(a), end(a)
constexpr int mod = 1e9 + 7;
void hike() {
int n; cin >> n;
vector<int> a(n);
for(int& i: a) {
cin >> i;
}
if(n == 1) {
cout << a[0] << "\n";
return;
}
int d... | #include <bits/stdc++.h>
using namespace std;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using isize = ptrdiff_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using usize = size_t;
using f32 = float_t;
using f64 = double_t;
template <t... |
#include <iostream>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
ll n_odd = 0;
bool odd;
cin >> n >> m;
string s;
for(int i = 0; i < n; i++) {
cin >> s;
odd = 0;
for(char c : s) {
if(c == '1')... | #include "bits/stdc++.h"
using namespace std;
using ll=int64_t;
using ld=long double;
using ull=unsigned long long;
template <class T>
using grid=vector<vector<T>>;
#define ALL(x) x.begin(),x.end()
#define rep(iter,from,to) for(ll iter=from;iter<to;++iter)
const ll MOD = 1e9 + 7;
const ll INF = 1e17;
//###############... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define disp(x) cout << #x << " : " << x << endl
#else
#define disp(x)
#endif
using namespace std;
using ll = int64_t;
ll mod_pow(ll x, ll n, cons... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >> m;
ll max = 1e8;
if(n==1 && m==0){
cout << 1 <<" " << 2 << endl;
}
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.