code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
#define LL long long
#define Ms(a,b) memset(a,b,sizeof a)
#define db(x) cerr<<#x<<"="<<x<<endl;
#define db2(x,y) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl;
#define db3(x,y,z) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<endl;
using namespace std;
int rd(){
int res=0,c,f=0;
while(!is... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,M,Even=0,Odd=0,ans=0;
cin >> N >> M;
string S;
vector<long long> sum(N);
for(long long i=0;i<N;i++){
cin >> S;
for(long long j=0;j<M;j++){
if(S[j]=='1'){
sum[i]++;
}
}
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F(i,a,b) for(int i=(int)(a);i<=(int)(b);i++)
#define R(i,b,a) for(int i=(int)(b);i>=(int)(a);i--)
#define endl "\n"
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define out(x) cout<<x<<endl,exit(0)
#define pii pair<int,int>
#defin... | #include<bits/stdc++.h>
using namespace std;
//struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define Local
#ifdef Local
#define dbg(args...) do { cout << #args << " -> "; err(args); } while (0)
void err() { std::cout << std::endl; }
... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TPP... |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <utility>
#include <set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
ll INF = 2e18;
using namespace std;
int N;
ll ans=INF;
set<int> s;
vector<int> v;
int list[16] = {2,3,5,7,11,13,17,19,23,29,31,37,3... |
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
#define N 5050
int n,as;
char s[N];
map<pair<int,int>,int> tp;
int main()
{
scanf("%d%s",&n,s+1);
int v1=0,v2=0;
tp[make_pair(0,0)]=1;
for(int i=1;i<=n;i++)
{
if(s[i]=='A')v1++;
if(s[i]=='T')v1--;
if(s[i]=='C')v2++;
if(s[i]=='G')v2--;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
for(int i = 0; i < S.size(); ++i)
{
if(S.at(i) == '6') S.at(i) = '9';
else if(S.at(i) == '9') S.at(i) = '6';
}
reverse(S.begin(), S.end());
cout << S << endl;
}
|
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define inrange(a, x... | #include <bits/stdc++.h>
using namespace std ;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
const ll mod = 1e9 + 7 ;
int main(){
ll n ;
cin >> n ;
set<ll> A ;
rep(i,n){
ll a ;
cin >> a ;
A.insert(a) ;
}
while( A.size() != 1 ){
ll ma = ... |
#include <bits/stdc++.h>
#define endl "\n"
#define int long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(),c.end()
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
#define int ll
#define pb push_back
#define F first
#define S second
#define _sz(x) ((int)x.size())
#define fastio ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
const int N = 10;
int g[N][N]... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define ip pair<ll,ll>
#define vii vector<ll>
#define vpp vector<ip>
#define vdd vector<ld>
#define vb vector<bool>
#define pi pair<ll,ip>
#define sc(x) scanf("%lli",&x)
#define hu 200010
#define pq priotity_queue<ll>
#define pqs ... | #pragma GCC optimize("-Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
// #include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <ra... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RNG(i, from, to) for (ll i = (from); i < (ll)(to); i++)
#define gcd(i, j) __gcd((i), (j))
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vecll;
template <typename S, t... |
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class c, class cmp = less<c> > using ordered_set = tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios_base::sync_with_stdio(false);ci... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplac... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main()
{
int64_t n, k;
cin >> n >> k;
for (int i = 0; i < k; i++)
{
if (n % 200 == 0)
{
n = n / 200;
}
else
{
n = n * 1000 + 200;
}
}
c... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); ... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define PI acos(-1)
#define pb push_back
// #define int long long
#define ld long double
#define sp fixed<<setprecision
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define pii pair<long long,long long>
#define FAST ios... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int a1, a2, a3, a4;
cin >> a1 >> a2 >> a3 >> a4;
if (a1 <= a2 && a1 <= a3 && a1 <= a4) {
cout << a1 << endl;
}
else if (a2 <= a1 && a2 <= a3 && a2 <= a4) {
cout << a2 << endl;
}
else if (a3 <= a1... |
#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
a=min(a,b);
c = min(c,d);
d=min(a,c);
cout<<d;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[4];
cin>>a[0]>>a[1]>>a[2]>>a[3];
int s=a[0]+a[1]+a[2]+a[3];
for(int i=0;i<16;i++){
int x=0;
for(int j=0;j<4;j++){
if((i&(1<<j))){
x+=a[j];
}
}
if(2*x==s){
cout<< "Yes";
return 0;
}... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin >> A >> B >> C >> D;
if(A+B==C+D){
cout << "Yes" << endl;
}
else if(A+C==B+D){
cout << "Yes" << endl;
}
else if(A+D==B+C){
cout << "Yes" << endl;
}
else if(A==B+C+D){
cout << "Yes" << endl;
}
else if(B==C+D+... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(), x.end();
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
queue<int> I;
for (ll i = 0; i < N; ++i) {
if (S[i] == '1') {
I.emplace(i);
}
}
string T;
cin >> T;
vector<int> E;
for (ll i = ... |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
#include <cmath>
#include <cstdlib>
using ll=long long;
using namespace std;
int main() {
ll N,K,tmp_ll;
string tmp_s;
cin>>N>>K;
for(ll i = 1;i<=K;i++){
if(N%200==0){
... | #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int n = 2*N;
vector<Int> d(n + 5, 0);
for (int i = 1; i <= N; ++i) {
++d[i + 1];
--d[i + N + 1];
}
for (int i = 1; i < d.size(); ++i) { d[i] += d[i - 1]; }
Int ans = 0;
for (int i = 2; i <= n; ++i) {... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
template <typename T> void print_vv(vector<vector<T>> &vv){
for(int i=0;i<vv.size();i++){
cout << i << " * ";
for(auto j:vv[i]) cout << j << ' ';
cout << endl;
}
}
template <typename T> void print_s(set<T>... | //@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... |
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<vector<int>... | #include "bits/stdc++.h"
#pragma GCC optimize "trapv"
#define int long long int
#define For(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define endl "\n"
#define F first
#define S second
#define drink_boost ios_base::sync_with_stdio(false);cin.tie(NULL)
#define all(v) v.begin(),v.end()
#define TEST_CASE int ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
using Graph = vector<vector<int>>;
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>> s(h+2, vector<char>(w+2, '.'));
for(int i=1;i<=h;i++)
for(int j=1;j<=w;j++)
cin >> s[i][... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
a=a+b+c;
a=21-a;
cout<<a;
}
| #include <iostream>
#include <string>
#include <stdlib.h>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
int main(){
int A,B,C;
cin>>A>>B>>C;
if(A-B==0){
if(C==0){
cout<<"Aoki"<<endl;
}else{
cout<<"Takahashi"<<endl;
... |
//{{{
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VLL = vector<LL>;
using vi = vector<int>;
using pii = pair<int, int>;
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define clr(a, b) memset(a, b, sizeof(a))
#ifdef LOCAL
#include "prettyprint.hpp"
// clang-format of... | #include <vector>
#include <iostream>
#define int long long
#define double long double
#define tezz ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
signed main() {
tezz
vector<int> primes;
for (int i = 2; i < 72; i++) {
bool flag = true;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vll vector<ll>
const int inf = 1e9 + 7;
const int MOD = 1e9 + 7;
void solve(){
int n , a, b;
cin >> n >> a >> b;
cout << (n - a + b) << endl;
}
int main(){
ios... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,x,n) for(int i=x;i<(int)n;i++)
#define rep(i,n) REP(i,0,n)
#define sp(p) cout<<setprecision(16)<<fixed<<p<<endl;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define SORT(a) sort(all(a))
#define RSORT(a) sort(rall(a))
#define UNIQ(a) un... |
/**
* @file: A.cpp
* @author: yaoxi-std
* @description: A.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define uint unsigned long long
#define resetIO(x) { freopen(#x".in", "r", stdin); freopen(#x".out", "w", stdout); }
#define testcases int T; read(T); while(T --)
... | #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;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | #include<bits/stdc++.h>
#define int long long
#define ri register signed
#define rd(x) x=read()
#define pos(x) ((((x)-1)/sz)+1)
using namespace std;
const int N=5e5+5;
const int M=3e7+5;
int mod=998244353;
inline int read(){int x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&... |
#include "bits/stdc++.h"
using namespace std;
#define ffor(n) for(int i = 0; i < n; i++)
#define fffor(n) for(int j = 0; j < n; j++)
#define uwu ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize("Ofast")
const int INF = 1e9 + 7;
const long long INF2 = 1e17;
int main(void) {
uwu
set <int> s;
for(in... | #include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <bits/stdc++.h>
using namespace std;
#define lson 2*i
#define rson 2*i+1
#d... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
typedef tuple<int, int, int, int> T;
vector<T> a( n );
for( int i = 0; i < n; i++ ) {
int x, y, r;
cin >> x >> y >> r;
a[i] = T( x, y, r, i );
}
sort( a.begin(), a.end() );
vector<T> ans( n );
for( int i = 0; i < n; i++ ) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y, r;
cin >> x >> y >> r;
cout << x << " " << y << " " << x + 1 << " " << y + 1 << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
/******... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
double r,x,y;
ll hosu = 0;
cin >> r >> x >> y;
if(sqrt(x * x + y * y) / r < 1){
hosu = 2;
}
else{
hosu = ceil(sqrt(x * x + y * y) / r);
}
cout << hosu;
} |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main(){//cout<<fixed<<setprecision(20);
string s;
cin>>s;
if(s[0]==s[1]&&s[1]==s[2])cout<<"Won"<<endl;
else cout<<"Lost"<<endl;
} | const bool isDebugMode = true;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int M, H;
cin >> M >> H;
if (H % M == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int N,W;
cin>>N>>W;
cout<<N/W<<endl;
}
|
#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() {
float a,b;
cin>>a>>b;
cout<<a/100*b<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long T;
cin>>T;
for(long long a=0;a<T;a++){
long long L,R;
cin>>L>>R;
if(R>=2*L){
cout<<((R-2*L+1)*(1+R-2*L+1))/2<<endl;
}
else{
cout<<'0'<<endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int64_t N, K;
cin >> N >> K;
for (int i = 0; i < K; i++)
{
if (N % 200 == 0)
{
N /= 200;
}
else
{
N = N * 1000 + 200;
}
}
cout << N;
}
| #include <bits/stdc++.h>
using namespace std;//gcd=__gcd swap(a,b)
typedef long long ll;
ll md=1e9+7;
#define pb push_back
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pair<int,int>> vii;
typedef vector<pair<ll,ll>> vll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef unsigned long long u... |
#include<bits/stdc++.h>
using namespace std;
#define fast {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
typedef long long int ll;
typedef string S;
#define M 1e18
#define AS 250005
#define sp cout<<' '
#define nw cout<<endl
#define rt return
#define __ template<typename T, typename... Types>
void in() {rt;... | #include<cstdio>
#define N 105
#define ll long long
#define mo 998244353
using namespace std;
int n,w[N],W;
ll f[N][N*N][N],P[N];
#define dp(x,y) x=(y+x)%mo
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;++i)scanf("%d",&w[i]),W+=w[i];
if (W&1)
{
puts("0");
return 0;
}W>>=1;
P[0]=1;
for (int i=1;i<=n;++i)
P... |
#include <iostream>
#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 <climits>
#include <ctime>
... | #include <iostream>
#include <vector>
#include <string>
#include <bitset>
using namespace std;
int main(){
int N;
cin >> N;
vector<string> s(N);
for (int i=0;i<N;i++)
cin >> s.at(i);
long long t=1;
long long f=1;
for(int j=0; j<N; j++){
if(s.at(j)=="AND"){
f= f*2 + t;
}else{
... |
#include<bits/stdc++.h>
#define N 105
using namespace std;
int n,a[N],ans=1e9;
char s[N];
int Abs(int x) {
return x<0?-x:x;
}
int main() {
scanf("%d%s",&n,s+1);
for(int i=0; i<=n; ++i) {
scanf("%d",&a[i]);
if(i>0)ans=min(ans,Abs(a[i]-a[i-1]));
}
cout<<ans<<"\n";
for(int i=0; i<ans; ++i,puts(""))
for(int j=0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
#define MOD 1000000007
//#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... |
#include<bits/stdc++.h>
using namespace std;
int main (){
int64_t R,X,Y;
cin >> R >> X >> Y ;
int count =0;
while((X*X+Y*Y)-(R*(count+1))*(R*(count+1))>0)count++;
if(((X*X+Y*Y)-(R*(count+1))*(R*(count+1))==0))count++;
else count++;
if(count==1&&(X*X+Y*Y)-(R*(count))*(R*(count))!=0)count++;
cou... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
#define mp make_pair
#define pb push_back
#define sz(x) ((int)((x).size()))
#define all(v) (v).begin(), (v).end()
#define endl "\n"
#define deb... |
/*input
2
1 1
*/
// assic value of ('0'-'9') is(48 - 57) and (a-z) is (97-122) and (A-Z) is(65-90) and 32 for space
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tre... | // Problem: B - Special Subsets
// Contest: AtCoder - AtCoder Regular Contest 114
// URL: https://atcoder.jp/contests/arc114/tasks/arc114_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define debug(a) cout << #a << ": " << a << endl
#defin... |
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <stdlib.h>
#include <fstream>
#include <random>
using na... | /***************************************************
* AUTHOR : Anav Prasad
* Nick : Vrangr
****************************************************/
#include <bits/stdc++.h>
using namespace std;
#define bline "\n"
#define fastIO ios_base::sync_with_stdio(false),cin.tie(0)
#define forn(i, n) for (int i = 0; i < n; i++)
#... |
#include<iostream>
#include<cstdio>
#include<ctime>
#include<cstdlib>
#include<cmath>
#define ll long long
#define N 100005
struct P{int x,y,w;}p[N];
ll n;
double ansx,ansy;
inline double find(double x){
double ans = 0;
for(int i = 1;i <= n;++i)
ans += (p[i].x + x - std::min((double)p[i].x,(double)(2 * x))) / (... | #include<bits/stdc++.h>
#define For(i,j,k) for(int i=j;i<=k;++i)
#define Dow(i,j,k) for(int i=k;i>=j;--i)
#define ll long long
#define pb push_back
#define fir first
#define sec second
#define pb push_back
#define pa pair<int,int>
#define mk make_pair
using namespace std;
inline ll read()
{
ll t=0,dp=1;char c... |
#include<cstdio>
using namespace std;
typedef long long LL;
const int maxn=2000,maxt=maxn*maxn,MOD=1e9+7;
int n,m,ans,cnt,pw[maxt+5];char pic[maxn+5][maxn+5];
int U[maxn+5][maxn+5],D[maxn+5][maxn+5],L[maxn+5][maxn+5],R[maxn+5][maxn+5];
inline char readc(){
static char buf[100000],*l=buf,*r=buf;
return l==r && (r=(l... | #include<bits/stdc++.h>
#define ll long long int
#define mk make_pair
#define pb push_back
#define INF (ll)1e18
#define pii pair<ll,ll>
#define mod 1000000007 //998244353
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fb(i,a,b) for(ll i=a;i>b;i--)
#define ff first
#define ss second
#define srt(v) if(!v.empty())sort(v.be... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin>>n;
ll arr[n];
ll m[201];
memset(m,0,sizeof(m));
for(ll i=0; i<n; i++){
cin>>arr[i];
m[arr[i]%200]++;
}
ll sum=0;
for(int i=0; i<= 200; i++){
sum += m[i]*(m[i]-... | #include <bits/stdc++.h>
using namespace std;
const long long mod1 = 1000000007;
using ll = long long;
vector<int> dx = {0,1,0,-1};
vector<int> dy = {-1,0,1,0};
long long pow(long long x,long long n){
long long ans = 1;
while(n != 0){
long long a = x;
long long z = 1;
while(z*2 <= n){
... |
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
#include <cmath>
using namespace std;
int main() {
long long int n,x;
cin>>n>>x;
map<long long int,long long int> m;
//int ans=0;
int q=0;
long long int max=0;
for (in... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;
#define FOR(i, b, e) for(int i = (b); i < (e); i++)
#define TRAV(x, a) for(auto &x: (a))
#define SZ(x) ((int)(x).size())
#define PB push_back
#d... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if(n%100==0){
cout << n/100 << endl;
}
else{
cout << n/100 +1 << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#define INF 100000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y)... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using Graph = vector<vector<int>>;
using vst= vector<string>;
using vin= vector<int>;
using ll=long long;
using ull=unsigned long long;
using vll= vector<ll>;
using P=pair<int ,... | #include <bits/stdc++.h>
/* #include <atcoder/lazysegtree> */
using namespace std;
/* using namespace atcoder; */
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vint = vector<int>;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (lo... |
//Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tu... | #include "bits/stdc++.h"
using namespace std;
#define int long long
int dp[300001][2][2];
int a[300001];
void solution() {
int n;
cin >> n;
map<int, int> m;
m[0] = 1;
int sum = 0;
int ans = 0;
for (int i = 1; i <= n; i ++) {
cin >> a[i];
sum += (a[i]) * (i % 2 == 1 ? 1 : -1);
ans += m[sum];
... |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... | /*
मनस्वी म्रियते कामं कार्पण्यं न तु गच्छति ।
अपि निर्वाणमायाति नानलो याति शीतताम् ॥
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define mod 1000000007
#define pb push_back
#define ll long long i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef pair<int,int> pii;
typedef pair<long long, int> pli;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define a... | #include<bits/stdc++.h>
#include<string>
using namespace std;
#define endl "\n"
#define sd(val) scanf("%d",&val)
#define ss(val) scanf("%s",&val)
#define sl(val) scanf("%lld",&val)
#define all(v) v.begin(),v.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long int
#de... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll mod=998244353;
ll power(ll x, ll y)
{
ll res = 1; // Initialize result
// Update x if it is more than or
// equal to p
//if (x == 0) return 0; // In case x is divisible by p;
while (y > 0)
{
// If y ... | #include<bits/stdc++.h>
using namespace std;
# define test int t;cin>>t;while(t--)
#define ff first
#define ss second
#define ll long long int
#define pb push_back
#define pii pair< int,int >
#define fast ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
int main(){
ll a,b,c;
cin>>a>>b>>c;
ll mod = 9982... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
namespace model{
const int N = 1e6+7,P=998244353;
int read()
{
int a = 0,x = 1;char ch = getchar();
while(ch > '9' || ch < '0') {if(ch == '-') x = -1;ch = getchar();}
while(ch >= '0' && ch <= '9'){a = a*10 + ch-'0... | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve() {
int n;
cin >> n;
int arr[n], check[n+1];
memset(check, 0, sizeof(check));
for(int i=0; i<n; i++){
cin >> arr[i];
... |
#include <bits/stdc++.h>
#define rep(i, N) for(int i = 0; i < (int)N; i++)
#define CREP(i, l, r) for(int i = l; i <= r; i++)
using namespace std;
typedef long long ll;
typedef tuple<int,int,int> T;
typedef pair<ll,ll> P;
typedef vector<int> V;
typedef vector<ll> Vll;
const int INF = 1000000000; //10^9, 2*INF
cons... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <iterator>
#include <cmath>
#include <set>
#include <deque>
#include <string>
using namespace std;
struct Num {
int in;
int out;
long long cost;
};
Num nums[200010];
int n;
struct Event {
int t... |
#include <bits/stdc++.h>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
/*ll fact[1001];
ll binpow(ll a, ll b) {
ll res=1;
while (b > 0) {
if (b & 1)
res = (res * a)%mod;
a = (a*a)%mod;
b >>= 1;
}
return res;
}
ll cal(ll c,ll k)
{
ll res... |
#include "bits/stdc++.h"
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
using namespace std;
using ll = long long;
const int mod = 1e9+7;
ll ans = 0;
void dfs(auto &g, int u, int par, auto &pref, auto &sz)
{
sz[u] = 1;
for (auto [v, w] : g[u]) ... | #pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll lon... |
#include <bits/stdc++.h>
using namespace std;
typedef vector<long long> vi;
typedef unordered_set<long long> usi;
typedef set<long long> osi;
typedef vector<pair<long long,long long>> vpi;
typedef long long ll;
#define pb push_back
#define popb pop_back
#define mp make_pair
#define read(a) ll a; cin>>a;
#define pt(a... | #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 <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define int long long
using namespace std;
const int N = 3e3 + 5;
const int mod = 998244353;
const int INF = 1e15 + 5;
int dp[N][N];
int32_t main(){
fast;
int n, k;
cin >> n >> k;
memset(dp, 0, sizeof dp);
dp[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int A, B;
cin >> A >> B;
vector<int> C, D;
int delta = 0;
if (A > B) {
rep(i, A) C.push_back(i + 1);
rep(i, B - 1) D.push_back(-1 * (i + 1));
f... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
using pint = pair<ll, ll>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll mod = 998244353;
in... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 10000000000000007;
const long long mod = 1000000007;
typedef long long ll;
typedef pair<int, int> P;
int main()
{
int n,num=0;
cin >> n;
vector<int>f(n);
for (int i = 0; i < n; i++) {
int f_;
cin >> f_;
f_--;
f[i] = f_;
}
... |
#include <bits/stdc++.h>
using namespace std;
struct desire
{
int x;
int y;
int r;
};
struct place
{
vector<int> d;
int s;
};
void input(vector<desire> &ads_de, vector<place> &ads_pl, int N);
void output(vector<place> &ads_pl, int N);
void expand(vector<desire> &ads_de, vector<place> &ads_pl, int N);
bool c... | #include <iostream>
#include <cstdlib>
#include<vector>
#include<memory>
#include<algorithm>
struct Box{
int x;
int y;
int r;
int a,b,c,d;
};
int Len = 10000;
struct Col{
int x;
int x_min;
int x_max;
std::vector<std::shared_ptr<Box>> elem;
};
double count_score(Col const&c){
doub... |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,k,n) for(long long i=k;i<n;i++)
#define endl "\n"
#define pb push_back
#define vii vector<ll>
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
typedef long long ll;
ll fun_ceil(ll n,ll k){
if(n%k==0){
return n/k;
}
el... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
... |
#include <stdio.h>
#include<iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <climits>
#include <set>
#include <unordered_map>
#include <map>
#include <stack>
#include <unordered_set>
#define hash hassh
using namespace std;
int main() {
... | #include<bits/stdc++.h>
#define r(i,n)for(int i=0;i<n+1;i++)
#define e(a,b)a=min(a,b);
#define g r(i,n)r(j,k)r(c,k)
#define h d[i][j][c]
using namespace std;int64_t d[110][110][110],x,f=LLONG_MAX,b=f; main(){int n,a[110];cin>>n>>x;r(i,n)cin>>a[i];r(k,n){k++;g h=f;d[0][0][x%k]=x;g if(f-h){e(d[i+1][j][c],h)if(j<k)e(d[i+1... |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) ((ll)(x).size())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define bug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i... |
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vec... | #include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 998244353;
int dx[] = {0, 1, 0, -1, 1, 1, ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<ll> hoge;
vector<ll> piyo;
ll memo[100][2];
bool visited[100][2];
ll f(int p, int q) {
if (visited[p][q]) return memo[p][q];
visited[p][q] = true;
if (hoge[p] == -1) {
if (q == 0) return memo[p][q] = 1;
else return memo[p][q] = N-p... |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll mod = 1000000007;
int main() {
char a, b, c;... | /**
* @author: adityasonani
* */
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#define ll long long
#define ull unsigned long long
#define ld long double
#define ln "\n"
#define fastio ios_base::sync_with_st... |
#include <bits/stdc++.h>
using namespace std;
#define M 998244353
#define int long long
vector<int> root, sze;
int find_set(int a) {
if (a == root[a])
return a;
return root[a] = find_set(root[a]);
}
void unite(int a, int b) {
int x = find_set(a);
int y = find_set(b);
if (x != y) {
... | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define RALL(X) (X).rbegin(), (X).rend()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%... |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std; using ll = long long; usi... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cctype>
#include <cmath>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <queue>
#include <ctime>
#define _for(i,a,b) for(int i=(a);... |
#include <bits/stdc++.h>
#ifdef mlocal
#include "./Competitive-Code-Library/snippets/prettyprint.h"
#endif
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
#define endl ... | #include <bits/stdc++.h>
#define mod 998244353
using namespace std;
const int maxn=500+5;
int n,m;
char s[maxn][maxn];
int main() {
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i) scanf("%s",s[i]+1);
int ans=1;
for(int i=1;i<=n+m-1;++i) {
int opt=0,flag1=1,flag2=1;
for(int j=max(1,i+1-m);j<=min(n,i);++j) {
if(s[j... |
//Hey stalker :)
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define max(a, b) (a < b? b : a)
#define min(a, b) ((a>b)?b:a)
#define MOD 1000000007
#define FOR(a,c) for ( ll (a)=0; (a)<(c); (a)++)
#define FORL(a,b,c) for ( ll (a)=(b); (a)<(c); (a)++)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define mnto(x, y) x = min(x, (__typeof__(x)) y)
#define mxto(x, y) x = max(x, (__typeof__(x)) y)
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define... |
// time-limit: 2000
// problem-url: https://atcoder.jp/contests/abc201/tasks/abc201_d
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <array>
#include <random>
#include <cmath>
#include <chrono>
#include <list>
#include <ctime>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
const ll MAX_N = 2e5;
ll N;
bool dp[MAX_N + 1][7];
string S, X;
int main(){
cin >> N >> S >> X;
dp[N][0] = true;
for(ll i = N - 1; i >= 0; i--){
REP(j, 7){
if(... |
#include<algorithm>
#include<cstdio>
#include<vector>
#include<cmath>
typedef long long ll;
const int lim=130;
const int delta=(int)1e3;
ll n;
std::vector<int>op;
void get(ll x,ll y){
if(!x){
while(y&&op.size()<=lim){
y--;
op.push_back(2);
}
return;
}
if(!y){
while(x&&op.size()<=lim){
x--;
op.pus... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
temp... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
int main() {
int h,w;
cin>>h>>w;
vector<string> grid(h);
for(int i = 0 ; i < h ; i++)
cin>>grid[i];
int ans = 0;
for(int i = 0 ; i < h ; i++) {
int count = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
#include <iostream>
using namespace std;
int main() {
string S;
cin>>S;
int flag=0;
int count1=0;
for(int i=0;i<S.length();i++)
{
if(S[i] !='0')
{
flag=1;
break;
}
if(flag ==0)
{
count1++;
}
}
flag=0;
int count2=0;
for(int i=S.length()-1;i>=0;i--)
{
if(S[i] !='0')
{
flag=... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
#define y1 awefakhlrv
using pii = pair<int, in... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 4e5 + 5;
ll n;
vector<ll> v[maxn];
ll idx = 0, mx = 0;
ll dep[maxn];
ll L, R;
ll dfn[maxn], sz[maxn], dfsc;
void dfs(ll now, ll fa){
dfn[now] = ++dfsc;
sz[now] = 1;
for(int i = 0;i < v[now].size();i++){
ll t = v[now][i];
if(t == f... | #include <cstdio>
const int maxn=2e5+10;
struct E{
int to;
int next;
}ed[maxn*2];
int head[maxn];
int tot;
void J(int a,int b){
ed[++tot].to=b;
ed[tot].next=head[a];
head[a]=tot;
}
int dep[maxn];
int s;
int t;
void Dfs1(int x,int fa){
dep[x]=dep[fa]+1;
if(!s||dep[x]>dep[s])
s=x;
for(int i=head[x];i;i=ed[i].ne... |
#include <bits/stdc++.h>
#include <stdio.h>
#define ll int64_t
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rev(i, a, n) for (ll i = a; i >= n; i--)
#define sz size()
#define ff first
#define ss second
#define vec vector<ll>
#define vecpair vector<pair<ll, ll>>
#define pb push_back
#define po pop_back
#defin... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
constexpr int N = 200;
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
ve... |
/*
Date: 10/10/20 8:00:51 PM
Description:
*/
#include <bits/stdc++.h>
using namespace std;
char s, t;
int main() {
scanf("%c\n%c", &s, &t);
printf("%c\n", s == 'Y' ? toupper(t) : t);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, great... |
#include"bits/stdc++.h"
using namespace std;
#define pb push_back
#define eb emplace_back
#define ins insert
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repr(i,a,b) for(int i=a;i>=b;i--)
#define lb lower_bound
#define ub upper_bound
#define sz(x... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h, w, i, t, m = 101, e = 0 ;
vector<int> v;
cin >> h >> w ;
for (i = 0; i < h*w; ++i) {
cin >> t;
v.push_back(t);
m = min(m, t);
}
for (i = 0; i < h*w; ++i)
e += v[i] > m ? v[i]-m... |
#pragma region template
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
// using cpp_int = boost::multiprecision::cpp_int;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
u... | #include <bits/stdc++.h>
int N;
int gcd(int x, int y){
y = abs(y);
while (y){
x %= y;
std::swap(x, y);
}
return x;
}
bool line(int dx1, int dy1, int dx2, int dy2){
if (dx1 == 0)
return dx2 == 0;
else if (dy1 == 0)
return dy2 == 0;
else if (dx2 == 0 or dy2 == 0... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sp(y) fixed<<setprecision(y)
#define w(t) int t;cin>>t;while(t--)
#define pi 2*acos(0.0)
#define bg begin()
#define en end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#def... | #include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_se... |
#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 998244353
using namespace std;
using ll = long long;
template<class T>
vector<pair<T, T>> PrimeFactorization(T n) {
vector<pair<T, T>> f;
for (T i = 2; i * i <= n; i++) {
T cnt... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long int ;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#defin... |
#include <bits/stdc++.h>
#define SZ(v) ((int)(v).size())
using namespace std;
using ll = long long;
template<typename... Args>
void read(Args&... args)
{
((cin >> args), ...);
}
template<typename... Args>
void write(Args... args)
{
((cout << args << " "), ...);
}
template<typename... Args>
void writeln(Args... ar... | #include <bits/stdc++.h>
using namespace std;
string revAB(string str) {
for(int i=0;i<str.size();++i) str[i]=(str[i]=='A'?'B':'A');
return str;
}
int main() {
int N,M; cin >> N; M = (1<<N);
vector<vector<string>> S(N+1);
S[1] = {"AB"};
for(int i=2;i<=N;++i) {
int L = (1<<i);
S... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <cstdio>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;
const ll M = 998244353;
ll dp[5001][5001];
char G[5001][5001];
ll H, W, K;
bool bc(ll i, ll j)
{
return ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
static const ll mod=1000000007;
using P=pair<ll,ll>;
using mat=vector<vector<ll>>;
ll modpow(ll a,ll n){
ll res=1;
while(0<n){
if(n&1)res=(res*a)%mod;
a=(a*a)%mod;n>>=1;
}return res;
}
mat mul(const mat &A,const mat &B){
ll H=A.size();ll W=B[0].... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
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) for (int i = 0; i < (int)(n); i++)
#define repll(i,n)... | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve() {
int n; cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
vector<int> ans, used(n + 1);
for (int i = ... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ii=pair<int, int>;
#define vi vector<int>
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
#define f first
#define s second
const ll mod=998244353;
const int inf=1e9;
const int N=2e5+10;
vector<int> g[N];
bool vis[N];
ll p... | #include <bits/stdc++.h>
int main() {
using namespace std;
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int N; cin >> N;
vector<int> F(N); for (auto& f : F) { cin >> f; f--; }
vector<int> par(N, -1);
auto get_par = [&](int a) -> int {
while (par[a] >= 0) {
if (par[par[a]] >= 0) par[a] = par[par[a]]... |
#include<bits/stdc++.h>
#define pb push_back
#define endl ("\n")
#define mp make_pair
#define lb lower_bound
#define ff first
#define inf 1e18
#define ss second
#define cn continue
#define br break
#define ins insert
#define int long long
#define bit(x) __builtin_popcount(x)
#define all(x) x.begin(),x.end()
#define up ... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,m=0;
cin >> n;
vector<long long> A,M;
for(int i=0;i<n;i++){
long long a;
cin>>a;
A.push_back(a);
m=max(m,a);
M.push_back(m);
}
vector<long long>B,C;
B.push_back(A[0]);
C.push_back(B[0]);
for(int i=1;i<n;i++){
... |
#include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \
{... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
cout<<setprecision(9);
cout<<fixed;
if(x1==x2)
{
cout<<x1<<endl;
return 0;
}
y1=-y1;
double m=1.0... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define REP(i,n) FOR(i,0,n)
#define MOD 10e9+7
using namespace std;
int main(){
int N,K;
cin >>N>>K;
int i,j;
ll ans=0;
for(i=1;i<=N;i++){
for(j=1;j<=K;j++){
ans += i*100+j;
}
}
cout <<ans;
r... | #include <bits/stdc++.h>
using namespace std;
// 型
#define ll int64_t // ll -> int64_t
using graph = vector<vector<int>>; // グラフ型
// for文
#define lp(i,n) for(int i=0;i<n;i++) // 変数 i をおいて n 回繰り返し
#define lp_(i,n) for(int i=0;i<=n;i++) // 条件に＝つき
#define lpp(i,n,m) for(int i=n;i<m;i++) // 開始と終... |
#include <bits/stdc++.h>
#define ll long long
#define B break
#define C continue
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define gc getchar
#define pc putchar
#define kg putchar(' ')
#define hh putchar('\n')
#define mem(a,b) memset(a,b,s... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long N; cin >> N;
long long X[60]; for (int i = 0; i < N; i++) cin >> X[i];
long long prime[30];
... |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ULL;
#define ff first
#define ss second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define FOR(i,n) for(int i=0;i<(n);++i)
#define pii pair<int,int>
#define vi vector<int>
#define pq priority_queue
#define ... | // https://atcoder.jp/contests/abc183/tasks/abc183_f
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define ITR(c,it) for(auto it = c.begin(); it != c.end(); it++)
#define DEBUG 1
#if DEBUG
#define _GLIBCXX_DEBUG
... |
#include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define se second
#define fi first
typedef map<int, int> mi;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef set<int> si;
const int inf = 0x3f3f3f3... | #include<bits/stdc++.h>
using ll= long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define RREP(i,n) for(ll i=1;i<ll(n+1);i++)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define ALL(x) x.begin(),x.end()
#define JU_5 101010
#define INF (int)1e9 //10^9:∞
#define LLINF (long long)1e12
#define MOD (int)1e9+7 //10^9+7:... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin>>T;
while(T--) {
int l,r;
cin>>l>>r;
if(2*l>r) {
cout<<"0\n";
continue;
}
cout<<(r-2*l+1)*(r-2*l+2)/2<<"\n";
}
} | #include <iostream>
#include <algorithm>
int n, a[1000], b[1000];
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) std::cin >> a[i] >> b[i];
int ans = 1001001001;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (i == j) {
ans = std::min(ans, a[i] + b[j]);
}... |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define Rep(i,a,b) for(int i=a;i<=b;i++)
#define rept(it,v) for(auto it=v.begin();it!=v.end();it++)
#define all(x) (x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define f first
#define s second
const int maxn = 100010;
int x[maxn];
int32_t main() {
int n; cin >> n;
for (int i =0;i<n;i++) cin >> x[i];
int manh = 0;
for (int ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vp;
typedef set<ll> si;
typedef map<string, ll> msi;
#define REP(i,a,b) \
for(ll i=ll(a);i<=ll(b);i++)
#define DEP(i,a,b) \
for(ll i=ll(a);i>=ll(b);i--)
#define TR(c, it) \
for (auto it =... | #include "bits/stdc++.h"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/pb_ds/assoc_container.hpp"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define x first
#define y second
#define LEN(x) ((int)(x).size())
#define ALL(x) x.begin(), x.end()
using ll = long... |
//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long long ll; typedef vector<int> ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 998244353;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
... |
#include<bits/stdc++.h>
using namespace std;
namespace Ruri{
#define ms(a,b) memset(a,b,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
int nyuKoke = A + B;
int nyuShibo = B;
int result;
if(nyuKoke >= 15 && nyuShibo >= 8) {
result = 1;
} else if(nyuKoke >= 10 && nyuShibo >= 3) {
result = 2;
} else if (nyuKoke >= 3) {
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <sstream>
#include <numeric>
#include <queue>
using namespace std;
int main()
{
//input
int a, b;
cin >> a >> b;
vector<int> e(a + b);
long long total = 0;
if (a > b)
{... |
/*
author:ujwalll
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define nx cout <... | #include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
using namespace std;
using ll = long long;
int l;
ll dp[201][201];
ll memo(int idx, int leng);
int main()
{
memset(dp, -1, sizeof dp);
cin.tie(0);
ios::sync_with_stdio(false);
cin >> l;
cout << memo(... |
#include<bits/stdc++.h>
#define sort(a) sort(a.begin(),a.end())
#define vpi vector< pair<long long,long long> >
#define pb push_back
#define ll long long
#define fast1 ios_base::sync_with_stdio(false)
#define fast2 cin.tie(NULL)
using namespace std;
int main() {
fast1; fast2;
ll n; cin>>n;
ll sz = (1<<n);... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ve vector<ll>
#define ve_pa vector<pair<ll,ll> >
#define pb push_back
#define mod (ll)998244353
#define INF (ll)1e13+7
#define ld long double
#define pll pair<ll,ll>
#define fi first
#de... |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int) n; i++)
using namespace std;
int N;
void dfs(vector<vector<int>>& graph, vector<bool>& reachable, int v) {
//すでにチェック済みの都市はパスする
if (reachable.at(v)) {
return;
}
//都市iから都市vへは到達可能
reachable.at(v) = true;
for (auto vv : graph.at(v)) {
... | #include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#pragma GCC optimize(3)
#define inlint inline int
#define inloid inline void
#define EDGE(cu) for(int ed = nodes[cu].lastConn, to = edges[ed].to; ed; ed = edges[ed].next, to = edges[ed].to)
using namespace std;
namespace _MAIN{
int n, m;
inlint re... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include<bits/stdc++.h>
using namespace std;
int T,n;
char s[1000001];
int read()
{
int pos=1,num=0;
char ch=getchar();
while (!isdigit(ch))
{
if (ch=='-') pos=-1;
ch=getchar();
}
while (isdigit(ch))
{
num=num*10+(int)(ch-'0');
ch=getchar();
}
return pos*num;
}
void write(int x)
{
if (x<0)
{
putcha... |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define N 3000009
using namespace std;
inline ll read(){
ll s;
scanf("%lld",&s);
return s;
}
long long a[N],b[N],c[N],p[N];
int main(){
int n=read();
for(int i=1;i<=n;++i){
p[read()]++;
}
for(int i=1;i<=n;++i){
b[i]=read();
}
for(int i=... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n; cin>>n;
vector<int> a(n),b(n),c(n);
for(auto& i:a) cin>>i;
for(auto& i:b) cin>>i;
for(auto& i:c) cin>>i;
sort(a.begin(),a.end());
long long ans=0;
for(int i=0; i<n; ++i){
int x=(int)(upper_bound(a.begin(),a.end(),b[c[i]-1])-a.begin(... |
//K-OS WITH THE OCDE
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <numeric>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG 0
// #define int long long
#define pb push_back
#define vt std::vector
#define lb lower_bound
#define sz(x) (int(x.size()))
#define all(x) x.begin(), x.end()
#define mst(x, bit) memset(x, bit, sizeof(x))
#define rep(i, l, r) for (ll i = (l); i < (r); ++ i)
#d... |
/*
_ _ _ __ __ _____
/\ | | /\ | | | | | \/ |/ ____|
/ \ | |__ ___ / \ | |__ __| | ___ | \ / | |
/ /\ \ | '_ \ / _ \ / /\ \ | '_ \ / _` |/ _ \| |\/| | |
/ ____ \| |_) | (_) / ____ \| |_) | (_| | (_) | | | | |___... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main(){
int n,D,H;
cin>>n>>D>>H;
double ans=0;
rep(i,n){
int d,h;
cin>>d>>h;
doub... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<ll,ll>
using Graph = vector<vector<int>>;
int main() {
ll N,M,K; cin >> N >> M >> K;
ll a; set<ll> NG;
rep(i,K){
cin >> a; NG.insert(a);
}
double dpa[N+M],dpb[N+M]... | #include <stdio.h>
#include <math.h>
#define MN 100000
const double eps = 1e-8;
int n,m,k;
bool b[MN+5];
struct F{
double k,a;
F(){
k = a = 0;
}
F(double k,double a){
this->k = k;
this->a = a;
}
F operator + (const F& that)const{
F ret;
ret.k = this->k + that.k;
ret.a = this->a + that.a;
return re... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#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>
//#include <atcoder/all>
#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 ALL(a) (a).begin(),(a).end()
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)x.size())
using namespace std;
//using namespace atc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.