code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
#define a1 int('A')
#define a2 int('a')
#define z1 int('Z')
#define z2 int('z')
using namespace std;
int main(){
string str;
bool b = true;
cin >> str;
for (int i = 0;i < str.size();i++){ if (i % 2 == 0 && int(str[i]) >= a2 && int(str[i]) <= z2){} else if (i % 2 == 1 && int(str[i]) >= a1 && int(str[... | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = (x); i < (n); i++)
#define reps(i, x, n) for (int i = (x); i <= (n); i++)
#define lol long long
#define SUM(n) ((n) + 1) * (n) / 2 // 1ใnใพใงใฎ็ทๅใๆฑใใๅผ
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) fixed << setprecis... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | //#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <set>
#include <limits>
#include <string>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <numeric>
using namespace std;
using ll = long long;
#define FOR(... | #include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <fstream>
#... |
#include<bits/stdc++.h>
#define rep(i,a,...) for(long long i = (a)*(strlen(#__VA_ARGS__)!=0);i<(long long)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(long long i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(long long)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#de... | #include <iostream>
#include <string>
#include <fstream>
#include <random>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#includ... |
// Problem: B - Visibility
// Contest: AtCoder - AtCoder Beginner Contest 197๏ผSponsored by Panasonic๏ผ
// URL: https://atcoder.jp/contests/abc197/tasks/abc197_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Disclaimer: Don't copy my template, it may lead to plagiarism.
/* Author: Soumy Jain
Handle: soumy_jain |... | #include<bits/stdc++.h>
using namespace std;
int N, M;
int board[105][105];
bool vis[105][105];
int dy[4] = {-1, 1, 0, 0};
int dx[4] = {0, 0, -1, 1};
int X, Y;
bool valid(int y, int x) {
return 1<=y && y<=N && 1<=x && x<=M;
}
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
cin >> N >> M >> Y >>... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int lli;
#define pb push_back
#define nline "\n"
#define gcd(a,b) (__gcd(a,b))
#define lcm(a,b) ((a*b)/gcd(a,b))
vector<ll> soe(ll n) {ll *arr = new ll[n + 1]; vector<ll>ans; for (ll i = 0; i <= n; i++) {arr[i] = 1;} arr[0] = 0; arr[1]... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string S;
cin >> S;
int num = S.size();
for(int i = 0 ;i < num ;i++){
if(S.at(i) == '6'){
S.at(i) = '9';
}
else if(S.at(i) == '9'){
S.at(i) = '6';... |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
vector<string> v{
"8",
"16",
"61",
"24",
"42",
"32",
"23",
"48",
"84",
"56",
"65",
"64",
"46",
"72",
"27",
"88",
"96",
"69"
};
bool Solve(string s)
{
if (find(v.begin(), v.end(), s) != v.end(... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x7fffffff
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<ld> vld;
#define fastIO ios_base::sy... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
const double pi = 2.0 * asin(1.0);
ll dx[4] = {1, 0, -1, 0};
ll dy[4]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (n-1); i >= 0; i--)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S>S sum(vector<S>& a) {return accumulate(all(a), S(... |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
vector<char> a(12);
for(int i=0;i<12;i++){
cin >> a.at(i);
}
int c=0;
for(int i=0;i<12;i++){
if(a.at(i)=='Z' && a.at(i+1)=='O' && a.at(i+2)=='N' && a.at(i+3)== 'e'){
c++;
}
}
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define REP(i,a,b) for(int i=int(a);i<(int)b;++i)
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vp vector<pair<ll,ll>>
#define pb push_back
#define all(v) v.begin(),v.end()
using n... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... |
#include <bits/stdc++.h>
#define ll long long
#define sf scanf
#define pf printf
#define nl printf("\n")
#define pb push_back
#define TEST int Test;cin>>Test;for(int _t=1;_t<=Test;_t++)
using namespace std;
int main()
{
int a,b;
sf("%d %d",&a,&b... | // JG GAP GG
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<unordered_map>
#include<iomanip>
#include<queue>
#include<bitset>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll MOD... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n;
cin>>n;
int a[n+1];
int sum=0,tot=0;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
for(int i=1;i<=n;i++){
tot+=(n-1)*a[i]*a[i];
tot-=a[i]*(sum-a[i]);
}
cout<<tot;
return 0;
}
| #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const int N = 210;
map<int, int> cnt;
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i ++ )
{
int x;
cin... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define LL_MAX LLONG_MAX
#define ub(v,x) upper_b... | #include <bits/stdc++.h>
using namespace std;
#define f(i,n) for(i=0;i<n;i++)
#define fr(i,n,a) for(i=n;i>=a;i--)
#define fa(i,a,n) for(i=a;i<n;i++)
#define deb(x) cout<<#x<<" "<<x<<endl;
#define deb2(x,y) cout<<#x<<","<<#y<<" "<<x<<","<<y<<endl;
#define buf(x) cout<<"Check"<<x<<endl;
#define ll long long int ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Node {
int v;
ll T, K;
ll t = LLONG_MAX;
Node(int v, ll T, ll K) : v(v), T(T), K(K) {}
};
struct Data {
int v;
ll t = LLONG_MAX;
Data(int v, ll t) : v(v), t(t) {}
bool operator < (const Data &d) const {
re... | #include "bits/stdc++.h"
#define ll long long
#define chl_jldi ios_base::sync_with_stdio(false); cin.tie(0)
#define mnpqll priority_queue<long long, vector<long long>, greater<long long> >
#define mxpqll priority_queue<long long>
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define ff first
#define... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define repr(i... | #include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef pair<int,int> pii;
typedef pair<long long int,long long int> plli;
typedef vector< vi > vvi ;
typedef vector< vlli > vvlli ;
... |
#include <bits/stdc++.h>
#define clr(x) memset((x), 0, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define For(i, st, en) for(int i=(st); i<=(int)(en); i++)
#define Ford(i, st, en) for(int i=(st); i>=(int)(en); i--)
#define forn(i,m,n) for(int i=m; i<(int)(n); i++)
#defin... | #include<bits/stdc++.h>
#define ll long long int
#define pragi(a,b) for(ll i = a;i<b;i++)
#define pragj(a,b) for(ll j = a;j<b;j++)
#define pragk(a,b) for(ll k = a;k>=b;k--)
#define all(v) (v.begin(),v.end())
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define MP make_pair
#define MT make_tuple... |
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
#include <map>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <queue>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define vi vector<int>
#define vll vector<long long>
#de... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<long long >>;
int main(){
int A,B;
cin >> A >> B;
if(A*2<=B){
cout << B/2 << endl;
}else{
int res = B-A;
for(int i=res;i>=1;i--){
if(B%i==0&&A%i==0){
res = i;
br... |
#include<bits/stdc++.h>
#include<chrono>
using namespace std;
using namespace chrono;
typedef long long ll;
typedef long long int lli;
#define arrsize 100001
#define dpsize 1001
#define vpp vector<PP>
#define vll vector<ll>
#define vcc vector<char>
#define endl "\n"
#define vbb vector<bool>
#define w(t) while(t--)
#de... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int,int> ii;
int fr[300010];
int main(){
cin.tie(0); ios_base::sync_with_stdio(0);
int n,k;
cin>>n>>k;
long long res=0;
int a;
for(int i=0;i<n;i++){
cin>>a;
fr[a]++;
}
... |
#include <bits/stdc++.h>
namespace IO{
char buf[1000000],*p1,*p2;
inline char getc(){
if(p1==p2) p2=(p1=buf)+fread(buf,1,10,stdin);
return p1==p2?EOF:*(p1++);
}
template<typename tp>inline void r(tp &n){
n=0;char c=getc();int f=1;
while(!isdigit(c)&&c!='-') c=getc();
... | #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>;
ll sum[200005];
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par... |
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
//#include <random>
#include <map>
//#include <unordered_map>
#include <cstdl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const char nl = '\n';
template <class T>
ostream &operator <<(ostream &os, const vector<T>&v)
{
for(auto& x:v)os << x << " ";
return os;
}
template <class a, class b>
ostream &ope... |
#include <bits/stdc++.h>
using namespace std;
double dp[105][105][105];
int main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
for(int i=99;i>=a;i--)
{
for(int j=99;j>=b;j--)
{
for(int k=99;k>=c;k--)
{
dp[i][j][k]=1.0*i/(i+j+k)*dp[i+1][j][k]+1.0*j/(i+j... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
int n,m,a[100010],ans=1;
inline int ksm(int a,int b){
int res=1;
while(b){
if(b&1)res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
signed main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
m=... | #include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma comment(linker, "/stack:200000000")
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair... |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair <int, int> P;
const int inf = 0x3f3f3f3f, N = 3e5 + 10;
template <typename T>
void rd_(T &x) {
... | #include <bits/stdc++.h>
using namespace std;
using i64 = unsigned long long;
#define rep(i, n) for (i64 i = 0; i < (n); i++)
#define IN_i64(n) \
i64 n; \
cin >> n;
#define IN_veci64(a, n) \
vector<i64> a((n)); \
rep(i, n) cin >> a[i];
constexpr i64 INF64 = 1LL << 62LL;
inline i64 modpow(i64, i64, i64 =... |
#include <stack>
#include <queue>
#include <set>
#include <array>
#include <vector>
#include <deque>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <utility>
#include <climits>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstring>
#include <iostream>
#i... | #include <bits/stdc++.h> // This will work only for g++ compiler.
using namespace std;
#define fo(i, n) for (int i = 0; i < (int)(n); ++i) // 0 based indexing
#define fon(i, n) for (int i = 1; i <= (int)(n); ++i) // 1 based indexing
#define forc(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i) // closed interver f... |
#include<string>
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin >> s;
ll re = 0;
char last_char = '\n';
int last_int = 0;
int last_pos = s.size();
for (int i = s.size() - 3; i >= 0; i--)
{
if (s[i] == s[i + 1] && s[i] !=... | //
#include <iostream>
using namespace std;
int main() {
long N; cin >> N;
long ans = 0;
long i = 0;
while (ans < N)
ans += (++i);
cout << i << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector... | #include<bits/stdc++.h>
using namespace std;
void solve(){
long long n,m,k,tot=0,cnt=0;
int a=0,b=0,c=0;
string s;
cin>>n;
while( n && n%10==0) n/=10;
s=to_string(n);
for(int i=0;i<s.size()/2;i++){if(s[i]!=s[s.size()-1-i]){cout<<"No";return ;}}
co... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(int i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(int i=(r)-1;i>=(l);i--)
#define pb... | #include<stdio.h>
#include<bits/stdc++.h>
#define vi vector<int>
#define int long long
#define pf printf
#define mod 1000000007
using namespace std;
void boost(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int pow(int n,int m){
if(m%2==0){
int pro=pow(n,m/2);
return ((pro)%... |
//#include "input.h"
//#include "output.h"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define NDEBUG
NDEBUG
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstring>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#inclu... | #include<bits/stdc++.h>
using namespace std;
#define nn int
#define dd double
#define ll long long int
#define ss string
int main()
{
ss s;
cin>>s;
reverse(s.begin(),s.end());
for(nn i=0;i<s.size();i++)
{
if(s[i]=='6') s[i]='9';
else if(s[i]=='9') s[i]='6';
}
cout<<s<<"\n";
} |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //ใใใคใใใจA[N]ใงใใใใใใ
//forๆใฎใใฏใญ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ใฝใผใใฎใใฏใญ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) i... | /*---------------------------------------
BISMILLAHIR RAHMANIR RAHIM
AUTHOR : Md. Sajjat Hossen
TIME :
----------------------------------------*/
#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 ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
// #define _GLIBCXX_DEBUG
template <class T> using V = vector<T>;
#define ALL(v) (v).begin(),(v).end()
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a,b;
cin >> a >> b;
cout << (a+b)/2 << ' ' << (a-b)/2 << endl;
} |
#include<bits/stdc++.h>
using namespace std;
/*#include<atcoder/all>
using namespace atcoder;*/
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> pii;
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define mk make_pair
#define en '\n'
void... | #include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define ENDL '\n'
#define sz(s) int(s.size())
#define deb(x) cout << #x": " << (x) << endl;
#define all(s) begin(s), end(s)
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);c... |
#include <bits/stdc++.h>
#define Rajpoot ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define loo(i,n) for(i=0;i<n;i++)
#define go(i,sp) for(auto i=sp.begin();i!=sp.end();i++)
#define pb push_back
#define lb lower_bound
#define mo 1000000007
#define pi 3.14159265358979323846264338327... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
#define mod(n) (n) % 1000000007
#define sp << " "
#define ff first
#define ss second
#defi... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,i,j;
cin >> a;
set<int>st;
vector<int>vec;
for(i=0;i<=2*a+1;i++)
st.insert(i);
for(j=0;j<a;j++)
{
cin >> c;
if(st.count(c))
{
st.erase(c);
}
vec.push_back(*st.be... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <vector>
#include <string>
#include <bitset>
#include <stack>
#include <queue>
#include <tuple>
#include <regex>
#include <cmath>
#include <map>
#include <set>
#include <functional>
#include <cstring>
using namespace std;
template... |
#include<bits/stdc++.h>
using namespace std;
int main(){
map<int,int> mm;
int n;
cin>>n;
for(int i=1;i<=n;i++){
int x;
cin>>x;
mm[x]++;
}
for(int i=1;i<=n;i++){
if(mm[i]!=1){
cout<<"No";
return 0;
}
}
cout<<"Yes";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" <<... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = pri... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n; cin >> n;
set<long long> s;
for(long long i=2;i*i<=n;i++){
long long x=i*i;
while(x<=n){
s.insert(x);
x*=i;
}
}
cout << n-s.size() << endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+10;
int x[N],y[N];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>x[i]>>y[i];
int ans=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
double res=abs((double)y[i]-y[j])/abs((double)x[i]-x[j]);
... | #include <bits/stdc++.h>
#define fileio \
freopen("C:\\Users\\PRISM17\\Desktop\\in.txt", "r", stdin); \
freopen("C:\\Users\\PRISM17\\Desktop\\out.txt", "w", stdout);
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); ... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 10, inf = 0x3f3f3f3f;
vector<int>e[N];
int n, k, mid, ret;
int f[N], g[N];
void dfs(int u, int fa) {
g[u] = 0, f[u] = inf;
for (int v : e[u]) {
if (v == fa)continue;
dfs(v, u);
f[u] = min(f[u], f[v] +... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //external policy based dsa accociate container
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fbo find_by_order // return pointer to kth element
#define ook order_of... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
int n ;
int A[1007] ;
int main(){
cin >> n ;
rep(i,n) cin >> A[i] ;
int sum = 0 ;
rep(i,n){
if(A[i] > 10) sum += A[i] - 10 ;
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll a, b, c, d, ans = 3;
cin >> a >> b >> c >> d;
ll x = c - a, y = d - b;
if (c == a && d == b)
ans = 0;
... | #include "bits/stdc++.h"
using namespace std;
#define int long long int
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
void local() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
IOS;
... |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[550][550];
int b[550], c[550];
int main(){
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i += 1){
for (int j = 1; j <= n; j += 1){
cin >> a[i][j];
}
}
bool flag = true;
... | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i, a, n) for (int i=(a); i<(n); i++)
#define per(i, a, n) for (int i=(a); i>(n); i--)
typedef long long ll;
const int maxn = 1e3+5;
const int mod = 1e9+7;
using namespace std;
ll mp[maxn][maxn];
void solve() {
int n; cin >> n;
ll k = 1e18;
bool ok = 1;
v... |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <tuple>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <random>
#include <chrono>
#include <numeric... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll mod = 1e... |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e2 + 7;
int n , m;
vector<pair<int,int> > adj[N * N * 2] ;
int d[N * N * 2] ;
int id(int x, int y){
return x * m + y ;
}
void edge(int u ,int v, int c){
adj[u].push_back({v , c}) ;
}
int dijkstra(int st, int en){
for(int i = 0 ;i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... |
#include <bits/stdc++.h>
#include<vector>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int main(){
int n;
cin>>n;
ll sum=0;
ll ans=0;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
for(int i=0;i<n;i++){
ans+=(a[i]*a[i])*(n-1);
sum-=a[i];
ans-=2*a[i]*sum;
}
cout<<a... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<ll> cnt(401);
for (ll i = 0; i < N; i++) {
ll A;
cin >> A;
cnt[A + 200]++;
}
ll ans = 0;
for (ll i = 0; i <= 400; i++)
for (ll j = 0; j < i; j++) ans += (i - j) * (i - j) * cnt[i] * cnt[j... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int k;
int atime,btime;
vector<int> A;
vector<int> B;
cin>>k;
for (int i=0;i<k;i++){
int a,b;
cin>>a>>b;
A.push_back(a);
B.push_back(b);
}
atime=*min_element(A.begin(),A.end());
B[distance(A.be... | #include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i = a;i<=b;++i)
#define For_(i,a,b) for(int i = a;i>=b;--i)
#define endl '\n'
#define IOS ios::sync_with_stdio(false)
typedef long long LL;
inline int read(){
int r = 0,f = 1;
char c = getchar();
while(c<'0' || c >'9'){
if(c =='... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_Y... | #pragma GCC optimize("O3")
#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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// find_by_order(k): It returns to ... |
#include <bits/stdc++.h>
#define rep(i, begin, end) for (i=begin;i<end;i++)
#define printint(i0, i1) printf("%d %d\n", i0, i1)
#define MAX_N 1000
using namespace std;
typedef long long int ll;
const int inf = 1000000000;
const int mod = 1000000007;
const int nil = -1;
ll i, j, n, m, k, ans, l;
ll rest[10], takahashi[1... | // ๅ้กใฎ URL ใๆธใใฆใใ
//
#include <bits/stdc++.h>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: "... |
//pragma region Macros
// #pragma GCC target("avx2")
#pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define ld long double
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define p... | #include<stdio.h>
#define putint(a) printf("%lld\n", a)
#define nextint(a) scanf("%lld\n", &a)
int N;
int main(){
if(nextint(N)==1){
int ans = 0;
for(long long int i=1; i<=N; i++){
for(int j=1; i*j<=N; j++){
ans+= N/(i*j);
}
}
putint(ans);
}
} |
#include <bits/stdc++.h>
using namespace std;
int H, W;
char grid[2009][2009];
int memo[2009][2009];
int INF = 10000000;
int MARKER = 2*INF;
int score(int x, int y) {
if (grid[x][y] == '+') return 1;
if (grid[x][y] == '-') return -1;
assert(false);
}
int p1_advantage(int x, int y) {
if (memo[x][y] != MARKER... | #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;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#de... |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //Policy Based Data Structure
// using namespace __gnu_pbds; //Policy Based Data Structure
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> pbds; //Policy Based Data Structure
/... | #include<iostream>
using namespace std;
int main()
{
int a , b , c , d ,x ,y ,diff;
cin >> a >> b ;
cout << endl ;
cin >> c >> d ;
x = a ;
y = c ;
diff = x - y ;
while ( x <= b )
{
y = c ;
while ( y <= d)
{
int temp_diff;
if( y > d) break ;
... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::en... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long
typedef unsigned long lo... |
//
// Created by whq on 2021/2/20.
//
#include <bits/stdc++.h>
#define uset unordered_set
#define umap unordered_map
#define debug cout<<"ok"<<endl
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvb... | //#include <bits/stdc++.h>
//using namespace std;
#include <cstdio>
#define rep(i,_l,_r) for(signed i=(_l),_end=(_r);i<=_end;++i)
#define fep(i,_l,_r) for(signed i=(_l),_end=(_r);i>=_end;--i)
#define erep(i,u) for(signed i=head[u],v=to[i];i;i=nxt[i],v=to[i])
#define efep(i,u) for(signed i=Head[u],v=to[i];i;i=nxt[i],v=... |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vecto... | #include<bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
while(n % 10 == 0 && n > 0) n /= 10;
vector<int> n_dig;
while(n > 0) {
n_dig.push_back(n % 10);
n /= 10;
}
bool can_palindrome = true;
int dig_num = n_dig.size();
for(int i = 0; ... |
#include<iostream>
#include<cstdio>
#include<ctime>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<vector>
#include<iomanip>
#include<fstream>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<sstream>
using namespace std;
#define sync std::ios::sync... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_... | // Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,P... |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
char c;
bool zf=0;
while(((c=getchar())<'0'||c>'9')&&c!= '-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
signed main(){
in... | #include <iostream>
using namespace std;
void solve() {
int n;
string s1,s2,s3;
cin >> n >> s1 >> s2 >> s3;
cout << string(n,'0') << string(n,'1') << '0' << endl;
}
int main() {
int t;
cin >> t;
for (int _=0; _<t; _++) solve();
return 0;
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define REP(i, start, end) for (ll i = start, i##Len = (end); i < i##Len; ++i)
#define REPR(i, start, end) for (ll i = start, i##Len = (end); i > i##Len; --i)
using ll = long long;
using namespace std;
int main()
{
cin.tie(nullptr);
ios::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
struct point {
ll x, y;
};
int main(void) {
point s, g;
cin >> s.x >> s.y >> g.x >> g.y;
ll ans = 0;
if (s.x == g.x && s.y == g.y) {
cout << 0;
return 0;
} else if (abs(s.x - g.x) + abs(s.y - g.y) <= 3 ... |
#include <bits/stdc++.h>
using namespace std;
const int di[] = {1, -1, 0, 0};
const int dj[] = {0, 0, 1, -1};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int h, w;
cin >> h >> w;
vector <string> g(h);
vector < vector < pair <int, int> > > go(26);
int si, sj, gi, gj;
for(int i... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pai... |
#include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... | //Bismillahir Rahmanir Raheem
#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 pair<int,int> pii;
typedef trie<string,null_type,trie_string_access_traits<>,pat_trie_tag,trie_prefix_search_no... |
#include <iostream>
#include <vector>
#include <utility>
#include <numeric>
#include <limits>
#include <tuple>
#include <cmath>
using ull = unsigned long long int;
using ll = long long int;
int main()
{
std::string s;
std::cin >> s;
bool flag = true;
for(ull i = 0; i<s.size(); i++)
{
if(i%2 == 0 and int(s[i]) ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int i,n;
cin >> n;
int ans=0;
for(i=1;i<=n;i++){
int a=i,res=0;
while(a!=0){
if(a%10==7){
ans++,res=1;
break;
}
a/=10;
}
if(res==1){
continue;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
int powmod(int a,int l, int md){a%=md; int res=1;while(l){if(l&1)res=res*a%md;l/=2;a=a*a%md;}return res;}
int binpow(int a,int l){... | #include <bits/stdc++.h>
#ifdef LOCAL
#include "../../Library/DebugTool.cpp"
#endif
using namespace std;
#define ll long long
#define pii pair<int,int>
//const ll MOD = 1000000007;
const ll MOD = 998244353;
ll INF_int = 1e9+11;ll INF_ll = 1e18 + 13;
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep1(i,n) for(int ... |
// give up
#include <bitset>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <list>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// alias, using declaration
using llint = long long; using ldouble = long double;
template <class T = llint> u... | #include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)){if(ch=='-'){f=true;}ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
x=f?-x:x;
return ;
}
template <typename T>
inline void write(T x){
if(x<0)... |
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define all(x) x.begin(),x.end()
#define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL));
#define MOD 1000000007
#define INF L... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<long long int> A(N), cumsum(N, 0);
for(int i = 0; i < N; ++i) cin >> A.at(i);
if(N == 1) {
if(A.at(0) > 0) cout << A.at(0) << endl;
else cout << 0 << endl;
return 0;
}
c... |
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(a) (ll)a.size()
#define F first
#define S second
#define INF 2000000000000000000
#define popcount(x) ... | #include<bits/stdc++.h>
#define int long long
#define ld long double
#define all(X) (X).begin(), (X).end()
#define reset(X) memset(X, 0, sizeof(X))
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define endl '\n'
#define ff first
#define ss second
using namespace std;
const int mod=1e9+7;
// const int mod=99... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lowe... | #include<bits/stdc++.h>
#define M(x,y) make_pair(x,y)
#define ll long long
using namespace std;
struct node{
int u,to,next,val;
};node e[4005];
int head[2005],dist[2005],vis[2005],dis[2005][2005],to[2005][2005],sum[2005],b[2005][2005];
int n,m,cnt=0,inf=999999999;
void add(int u,int v,int val){
++cnt;
e[cnt].u=u;
e... |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int ab = 2 * n;
long long int res = 0;
while (ab >= 2) {
int cd = ab - k;
if (cd >= 2 && cd <= 2 * n) {
res += (n - abs(n + 1 - ab)) * (n - abs(n + 1 - cd));
}
ab--;
}
cout << res << endl... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <set>
using namespace std;
typedef pair<int, int> pairII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef long long LL;
#define shig_for(i, a, b) for(int i = (a); i < (b); ++i)
#de... |
#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>;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;... | /**
* author: shu8Cream
* created: 19.12.2020 21:08:37
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using Graph = vvi;
int main() {
int n;
cin >> n;
vector<... |
/**
* created: 16/01/2021, 14:27:24
**/
#include <bits/stdc++.h>
using namespace std;
const int max_n = 1111, inf = 1000111222;
int n, cnt[max_n][max_n];
vector<string> ans;
int c2(int n) {
return n * (n - 1) / 2;
}
bool get_bit(int mask, int pos) {
return (mask >> pos) & 1;
}
void check() {
for (s... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int N,M,a[1100][1100];
signed main(){
cin>>N;M=(1<<N);
cout<<M-1<<endl;
for(int i=1;i<M;i++){
string ans(M,'A');
for(int k=0;k<M;k++)if(__builtin_popcount(i&k)&1)ans[k]='B';
cout<<ans<<endl;
}
} |
#include <set>
#include <map>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
inline int rd() {
int x = 0;
bool f = 0;
char c = getchar();
for (; !isdigit(c); c = getchar()) f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
/* [๐ญ] [๐ก] [๐] */
const ll inf = 1e18;
using pll = pair<ll, ll>;
ll dist[100001];
struct edge {
int to;
ll c, d;
edge() ... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define me memse... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define sz 1529
#define mx 10000000000008
#define mod 1000000007
ll n,t,arr[6][500009],brr[6][sz][sz],crr[6][sz][sz],grid[sz][sz];
vector<ll>v;
int main()
{
ll w,h,m;
scanf("%lld %lld %lld %lld",&w,&h,&n,&m);
for(int i=1;i<=n;i++){... |
// Disclaimer: Don't copy my template, it may lead to plagiarism.
/* Author: Soumy Jain
Handle: soumy_jain || soumyjain
"Beautiful flowers too, eventually wither and fall. That's the fate of all living beings."
"I hate perfection. To be perfect is to be unable to improve any furthur." - Mayuri Kurotsuchi | Ble... | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#include<cmath>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y,ll z){
if(y==0)
return 1;
else
{
ll p=power(x,y/2,z);
ll w=(p*p)%z;
if(y%2==0)
return w;
... |
/**
* 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 <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
void Main()
{
int h, w, n, m;
cin >> h >> w >> n >> m;
vector<vector<int>> b(h, vector<int>(w));
vector<vector<int>> l(h, vector<int>(w));
vector<vector<int>> f(h, vector<int>(w));
for (int i = 0... |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i, n) for(ll i=n-1;i>=0;--i)
#define rep1(i, n) for(ll i=1; i<=n; ++i)
#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int (i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for(int (i) = (n); (i) >= 0; --(i))
#define FOR(i, n, m) for(int (i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
constexpr ll INFL = 1LL<<61;
constexpr ll mod = 1e9+7;
in... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
//#define double long double
#define max(x,y) (((x)>(y))?(x):(y))
#define min(x,y) (((x)<(y))?(x):(y))
#define all(v) v.begin(),v.end()
#define vi vector<int>
#define MOD 1000000007
#define inf 1e18
#define ps(num... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... |
#include <bits/stdc++.h>
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 100005;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;
// comment to disable debug functions
#define DEBUG
// frequently used macros
#define FOR(i, N) for(int (i) = 0; (i) < ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,a,b;
cin >>n >>a >>b;
cout <<n-a+b;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pint pair<int, int>
#define pll pair<ll, ll>
const ll INF = 1LL << 60;
const int MOD = 1000000007;
// const int MOD = 998244353;
int main()
{
ll n, C;
cin >> n >> C;
// time, cost
map<ll, ll> mp;
for (ll i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using ull = unsigned long long;
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=int(a);i<=(int)(b);i++)
#define per(i,a,b) for(int i=int(a);i>=(int)(b);i--)
const int mod = 1e9+7;
const in... |
#include<bits/stdc++.h>
#include<tr1/unordered_map>
using namespace std;
#define int long long
int n;
int a[300000];
int dp[300000];
const int mod=998244353;
tr1::unordered_map<int,int>num,vis;
signed main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],num[a[i]]++;
sort(a+1,a+1... | #include<bits/stdc++.h>
#define L(i, j, k) for(int i = j, i##E = k; i <= i##E; i++)
#define R(i, j, k) for(int i = j, i##E = k; i >= i##E; i--)
#define ll long long
#define pii pair<int, int>
#define db double
#define x first
#define y second
#define ull unsigned long long
#define sz(a) ((int) (a).size())
using namespa... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
//#define int long long int
#define out2(x,y) cout<<x<<" "<<y<<endl;
#define out(x) cout<<x<<endl;
#define forin for(int i=0;i<n;i++)
#define forjm for(int j=0;j<m;j++)
#define in(x) int x;cin>>x;
#define in2(x,y) int x,y;cin>>x>>y;
#define in3(x,y,z) in... | /*
START BY THE NAME OF ALMIGHTY ALLAH
THIS WONT BE ACCEPTED
STOP_GIVING_UP
โโโโโโโโโโโโโโโโโโโโโโโ โโโโโโ โโโ โโโ
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ โโโโ
โโโโโโโโโโโ โโโ โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโ โโโ โโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโ โโโ โโโโโโ โโโโโโ โโโ
โโโโโโโโโโโ โโโ โโโโโโ โโโโโโ โโโ
*/
#... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,q;
cin>>n>>m>>q;
vector<pair<int,int>>v;
vector<pair<int,int>>w;
int a,b;
for(int i=0;i<n;i++){
cin>>a>>b;
v.push_back(make_pair(b,a));
w.push_back(make_pair(b,a));
}
sort(v.rbegin(),v.rend());
sort(w.rbegin(),w.rend());
int ar... | /*
Problem Name:Graph Smoothing
algorithm tag:็ฉ้ตๅฟซ้ๅน
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF... |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);i++)
#define per(i,n) for(int i=(n)-1;i>=0;i--)
#define prt(n) cout<<(n)<<endl
#define elif else if
#define str string
#define pb push_back
#define mp make_pair
typedef long long ll;
using namespace std;
const ll mod1=998244353;
const ll m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define u64 uint64_t
#define ll long long
#define endl "\n"
#define PI acos(-1)
#define fi first
#define si second
#define mkp mak... | #include<cstdio>
#include<queue>
int main(){
int sum = 0;
int a[15];
for(int i = 1; i <= 4; i++){
scanf("%d",&a[i]);
sum += a[i];
}
int ok = 0;
for(int i = 1; i < (1<<4); i++){
int mask = i;
int cur = 0;
for(int j = 1; j <= 4; j++){
if(mask%2)... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
// #include <atcoder/all>
/*
cd $dir && g++ -std=c++17 -Wall -Wextra -O2 -DATCODERDEBUG
-I/mnt/d/MyProjects/atcoder/... | #include<bits/stdc++.h>
using namespace std;
double n;
double ans;
int main()
{
cin>>n;
for(int i=1;i<n;i++){
ans=ans+n/(n-i);
}
printf("%.10f\n",ans);
system("pause");
return 0;
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int getint()
{
char ch;do{ ch=getchar();}while (ch!='-'&&(ch<'0'||ch>'9'));
int ans=0,f=0; if (ch=='-') f=1; else ans=ch-'0';
while (isdigit(ch=getchar())) ans=ans*10+ch-'0';
if (f) ans*=-1;
return ans;
}
int a[2][211],b[2][21];
bool vis... | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include <queue>
#include<sstream>
#include <stack>
#include <set>
#include <bitset>
#include<vector>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x)... |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
template<class T> inline bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
t... | #include<bits/stdc++.h>
using namespace std;
#define Go_ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long int
#define llu long long unsigned int
#define pii pair<int ,int>
#define PII pair<ll ,ll>
const int Max=1e9+100;
const ll MAX=1e18+500;
const int sz=1510;
bool vist[sz][sz];
int m... |
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#def... | #include <bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define MAXN 200005
#define REP(temp, init_val, end_val) for (int temp = init_val; temp <= end_val; ++temp)
#define REPR(temp, init_val, end_val) for (int temp = init_val; temp >= end_val; --temp)
using namespace std;
typedef long long ll;
typedef u... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a + b >= 15 && b >= 8) cout << 1 << endl;
else if(a + b >= 10 && b >= 3) cout << 2 << endl;
else if(a + b >= 3) cout << 3 << endl;
else cout << 4 << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define vl vector<ll>
#define pii pair<int, int>
#define ull unsigned long long
using namespace std;
typedef tuple<ll, ll, ll> ti;
const ll INF=1e17;
void dijkstra(vector<vector<pair<int, int>>>& adj, int x) {
int n... |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define prec(n) fixed<<setprecision(n)
using namespace std;
typedef long long ll;
typedef unsigned long long int ull ;
const int MOD=1e9+7;
const char nl = '\n';
int check (int n... |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
ll dp[5050][5050];
ll sdp[5050];
ll mod = 998244353;
ll invs[5050];
ll mis[5050][5050];
ll gcd(ll a, ll b, ll &x, ll &y)
{
if (b == 0)
{
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll d = gcd(b, a % b, x1, y1);
... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(){
unsigned N, M;
scanf("%u %u", &N, &M);
int H[N];
for(unsigned i = 0; i < N; ++i){
scanf("%d", H + i);
}
int W[M];
for(unsigned i = 0; i < M; ++i){
scanf("%d", W + i);
}
sort(H, H + N);
sort(W, ... |
/**Bismillahir Rahmanir Rahim.**/
/*
Md.Fagun Molla
18ICTCSE006
BSMRSTU(SHIICT)
*/
#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;
using ll=long long;
using db=double;
///... | #include <bits/stdc++.h>
#include<math.h>
#include<queue>
#include<cstdio>
#include<set>
#include<map>
using namespace std;
using ll = long long;
int main(){
int A,B,C;
cin >> A >> B >> C;
if(C==1){
if(A>B) cout << "Takahashi" << endl;
if(A<B) cout << "Aoki" << endl;
if(A==B) cout <... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;
int main()
{
int W, H;
cin >> H >> W;
vector<string> mass(H);
for (int i = 0; i < H; i++)
{
cin >> mass[i];
}
vector<vector<ll>> dp(H, vector<ll>(W, 0)), Xs(H, vector<ll>(2222, 0)), Ys(H, vector<ll>(W, 0)), Zs(H, vector<ll>... |
// Problem : E - Queen on Grid
// Contest : AtCoder - AtCoder Beginner Contest 183
// URL : https://atcoder.jp/contests/abc183/tasks/abc183_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// God & me
// Fly ...
//#pragma GCC optimize "trapv"// WA to ... |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int mod=998244353;
int n,m,k,ans;
void... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=2e3+5;
ll dp[maxn][maxn],sum[3][maxn*2],belong[maxn][maxn];
char buff[maxn][maxn];
const int mod=1e9+7;
int main() {
int n,m;cin>>n>>m;
for(int i=1;i<=n;i++) cin>>(buff[i]+1);
for(int i=1;i<=m;i++) ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define print(a) for (auto x : a) cout << x << " "; cout << endl
#define print_upto(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout<<endl
#define take(a,n) for(ll i=1;i<=n;i++) cin>>a[i];
#define watch(x) cout << (#x) << " i... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const ld eps = 1e-10l;
ld X, Y, R;
ll res;
int main()
{
cin >> X >> Y >> R;
for (int i = X - R - 5; i <= X + R + 5; i++) {
int intY = Y;
int lef = Y - R - 5, rig = intY;
while (lef <= rig) {
int m = (lef + rig) / ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const ll mod = 1e9 + 7;
const int maxn = 2002;
char saveori[maxn][maxn];
ll ff[4100005];
void init(){
ff[0] = 1;
for(int i =1;i<=4000005;i++){
ff[i] = ff[i - 1] * 2;
ff[i] %= mod;
}
}
int tor[maxn][maxn];
in... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<typename T>
T pown(T b, ll e) {
if(e == 0) return 1;
T p = pown(b, e / 2);
if(e % 2 == 0) return p * p;
return p * p * b;
}
template<const int mod>
struct Intmod {
ll a;
... |
#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%... | #ifdef _DEBUG
#define _GLIBCXX_DEBUG
#define print(a) for(auto i : a) { cout << i << " "; } cout << endl;
#endif
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(int i = begin; i < (int)(end); i++)
#define contains(v, x) (find(all(v), x) !=... |
#include<bits/stdc++.h>
#include<ext/rope>
using namespace std;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> tiii;
//#define x first
//#define y second
#de... | #include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... |
#include<bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
const long long N = 25e4+10;
#define ll int
// typedef long long ll;
typedef long double ld;
ll r, c, n;
ll get(ll i, ll j) {
return (i * c + j);
}
vector<array<int, 2>> g[N];
int d[N];
void dijkstra(int s) {
fill(d, d+n+1, MOD);
... | #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 T2 = tuple<int,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';
retur... |
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int calc(int n, vector<int> num)
{
//int ans;
//int min;
vector<int> div;
for(int a = 1; a <= (int)sqrt(n); a++)
{
if(n % a == 0)
{
if(a * a == n) div.push_back(num.at(a - 1));
else
{
div.push_back(num.at(a -... | #include <stdio.h>
#include <iostream>
#include <cmath>
using namespace std;
int get_num_digits(long long x){
int c = 0;
do {
x = x / 10;
c++;
}
while (x > 0);
return c;
}
int main(){
long long N;
cin >> N;
int x_half = 1;
int count = 0;
while (true){
... |
#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... | /*
link:
tags:
*/
#include<bits/stdc++.h>
#define to_l(a) ((a)<<1)
#define to_r(a) ((a)<<1|1)
#define lowbit(a) ((a)&(-a))
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
const int int_inf=0x3f3f3f3f;
const ll ll_inf=0x3f3f3f3f3f3f3f3f;
const int max_n=1e2+5;
#define eps 1e-8
int x[... |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int t; cin >> t;
auto query = []() {
int n; cin >> n;
unordered_map<int, bool> mp;
for(int i=0; i<n; ++i) {
int a; cin >> a;
mp[a] ^= true;
}
if(!(n & 1)) {
for(auto &[v, b] : mp) {
if(b) {
return t... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
set<int> nums;
vector<int> a;
for (int i = 0; i < n; i++) {
int d;
cin >> d;
nums.insert(d);
a.push_back(d);
}
int res = 0;
for (int d : nums) {
int count =... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n, q; cin >> n >> q;
vector<map<int, int>> mp(n);
vector<int> p(n,-1);
auto find = [&](auto &&self, int x) -> int{return (p[x] < 0 ? x : p[x] = self(self,p[x]));};
auto uni... | #include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(a) setprecision(a)<<fixed
#define ss second
#define fori(v) for(ll i=0; i<v; i++)
#define forj(v) for(ll j=0; j<v; j++)
#define fork(v) for(ll k=0; k<v; k++)
#define forl(v) for(ll l=0; l<v; l++)
#define fort(v) f... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define REP(i, n) for (int i=1; i<=(int)(n); i++)
#define FOR(i, n, m) for (int i=(n); i<=(int)(m); i++)
#define ll long long
const ll INF=1LL<<60;
const double pi=3.1415926535;
int main() {
vector<vector<int>> dp(900, v... | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FI... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.