code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... | #include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int n; cin >> n;
cout << n-1 << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=513;
ll a[maxn][maxn];
ll ansa[maxn],ansb[maxn];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
scanf("%lld",&a[i][j]);
}
}
for(int i=2;i<=n;i++){
int yes=1,ms=a[i][1]-a[i-1][1];
for(int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=a;i>=n;i--)
#define pb push_back
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
ll gcd(ll a,ll b){if(b==0)return a;else return gcd(b,a%b);}
ll lcm(ll a,ll b){return a... |
#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 <bits/stdc++.h>
#define loop(n) for(ll i=0;i<n;i++)
#define loopj(n) for(ll j=0;j<n;j++)
#define loopR(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define rng(i,a,b,c) for(ll i = a; i<b;i+=c)
#define loop2(i,a,b) for(long long i = a; i>=b;i--)
#define loop3(j,a,b) for(int j = a; j<b;j++)
#define fast ios_base::sync_with_st... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) fo... | #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>;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a*a+b*b<c*c)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
string N;
getline(cin, N);
string Nr = N;
reverse(Nr.begin(), Nr.end());
//cout << N << " "<< Nr << "\n";
int i = 0;
while (Nr[i] == '0') {
i++;
}
//cout << i;
int chk = 1;
for (int j... | #include<iostream>
using namespace std;
int main(){
long long N, NN;
cin>>N;
NN = N;
int n[11] = {0, 0,0,0,0,0,0,0,0,0,0}, a = 10;
for(int i=0;i<=10;i++){
n[i] = N%10;
N /= 10;
if(N<=0){
a = i;
break;
}
}
if(n[0]==0){
n[a+1] = 0;
a++;
}
long long rN = 0, x = 1;
... |
#include<stdio.h>
int n,x,mx; long long s,t;
int main() {
scanf("%d",&n);
for (int i=1; i<=n; ++i)
scanf("%d",&x),s+=x,t+=s,mx<x&&(mx=x),
printf("%lld\n",t+1ll*i*mx);
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <numeric>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0 ; i<(n) ; ++i)
typedef long long ll;
typedef pair<int,int> p;
const int INF = 1001001001;
int main(){
ll N;
cin >> N;
ll A[N];
rep(i,N) cin >>... |
#include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(),c.end()
#define sz(x) int(x.size())
#define ar array
typedef long long ll ;
typedef vector<int> vi;
#define mod 1000000007
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll exp(ll x,ll y){
x%=mod;
ll res=1;
while(y){... | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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(... |
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define pii pair<int,int>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const double pi=acos(-1.0);
const double eps=1e-8;
const int INF=0x3f3f3f3f;
const int MA... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define irep(n) for (int i=0; i < (n); ++i)
#define irepf1(n) for (int i=1; i <= (n); ++i)
#define jrep(n) for (int j=0; j < (n); ++j)
#define jrepf1(n) for (int j=1; j <= (n); ++j)
#define krep(n) for (int k=0; k < (n); ++k)
#define krepf1(n) for (int ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
void dbg_out() { cerr << "\b\b]\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ cerr << H << ", "; dbg_out(T...);}
#define watch(...) cerr ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pii>
#define pqi priority_queue<int>
#define test int tcase; cin>>tcase; for(int tc = 1; tc <=... |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int) x.size()
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define FOR(i, a, b) for(auto i=(a); i<(b); i++)
#define ROF(i, a, b) for(auto ... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<math.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <functional>
using namespace std;
unsigned long long g2(unsigned long long N) {
int* ar = new int[(int)log10(N)+1];
unsigned long long a = 0;
for (int i = ... |
#include <map>
#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const ll lim=1000000000LL*1000000000LL;
map<ll,pii> mp;
int n,m;
ll a[100],b[100];
int main()
{
a[n=0]=b[m=0]=1;
while(a[n]*3<=lim)
{
++n;
a[n]=a[n-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
double ans = 0;
for(int i = 1; i < n; i++){
ans += 1.0/i;
}
ans *= n;
cout << fixed << setp... |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define MP make_pair
#define MT make_tuple
typedef int64_t ll;
#define PA pair<ll,ll>
#define TU tuple<ll,ll,ll>
#define vi vector<ll>
#define vii vector<vector<ll> >
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define rep2(i,m,n) for... | using namespace std;
#include <bits/stdc++.h>
const int N=105,mo=998244353;
typedef long long ll;
int n,sum;
int w[N];
int f[N*N][N];
ll fac[N];
int main(){
scanf("%d",&n);
for (int i=1;i<=n;++i)
scanf("%d",&w[i]),sum+=w[i];
if (sum&1){
printf("0\n");
return 0;
}
sum/=2;
f[0][0]=1;
for (int i=1;i<=n;++i)
... |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n =0 , m = 0;
cin >> n >> m ;
if(min(m , n ) + 3 > max(m,n ) ){
cout <<"Yes" <<endl;}
else
cout << "No" <<endl;
return ... | #include <iostream>
#include <algorithm>
#include <vector>
//#include <string>
//#include <set>
#include <map>
//#include <math.h>
//#include <queue>
//#include <tuple>
//#include <iomanip>
//#include <numeric>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i,n) for (int i=0;i<(int)(n);... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef unsigned long long int ull ;
const int MOD=1e9+7;
const char nl = '\n';
int main(){
ios_base::sync_with_stdio(false);
cin... | /**
* Author: dhruv_gheewala
* Problem: C - Swappable
* Date: 19.06.2021
* Time: 17:37:56
**/
#include "bits/stdc++.h"
using namespace std;
#ifndef DEBUG
#define fundri 108
#define debug(...) 1729
#define endl '\n'
#endif
#define int int64_t
typedef pair<int, int> pii;
typedef vector<int> vi;
mt1... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int j,n;
cin >> n;
set<int>ans;
ans.insert(10);
ans.insert(15);
for(j=6; j<=1e4 && (int)ans.size() < n; j+=6)ans.insert(j);
for(j=10; j<=1e4 && (int)ans.size() < n; j+=10)... | #include<iostream>
using namespace std;
int main(){
int L;
cin >> L;
L--;
int64_t ans=1;
for(int i=1;i<=11;i++){
ans=ans*(L-i+1);
ans=ans/i;
}
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; ... | //#pragma GCC optimize(2)
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define DEBUG
#define INF 0x3f3f3f3f3f3f3f3f
#define mod 1000000007
#define PI 3.14159265358979323846
#define Base 23333333
//#define set unordered_set
//#define map unordered_map
#define int long long
#define LL long long... |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define indexed_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
//find_by_order = returns pointer to element at that pos
//order_o... |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
int power(int x, int y, int p)
{
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0)
{
// If y is odd, multiply x with result
if (y & 1)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int C = A + B;
if(C >= 15 && B >= 8){
cout << "1" << endl;
}
else if(C >=10 && B >= 3){
cout << "2" << endl;
}
else if(C >= 3){
cout << "3" << endl;
}
else{
cout << "4" << endl;
}
}
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
char IO;
int rd(){
int num=0;bool f=0;
while(IO=getchar(),IO<48||IO>57)if(IO=='-')f=1;
do num=(num<<1)+(num<<3)+(IO^48);
while(IO=getchar(),IO>=48&&IO<=57);
return f?-num:num;
}
ll A,B,C,D;
int main(){
A=rd(),B=rd(),C=rd(),D=rd();
if(C*D<=B){cout... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n,tp;
char s[N],st[N];
int main() {
#ifdef LOCAL
freopen("a.in","r",stdin);
freopen("a.out","w",stdout);
#endif
ios::sync_with_stdio(0);cin.tie(0);
cin>>n>>(s+1);
for(int i=1;i<=n;i++) {
st[++tp]=s[i];
if(st[tp-2]=='f'&&st[tp-1]=='o'&&st[tp... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int32_t main(){
IOS
string s,t;
cin>>s>>t;
if(s[0]=='Y'){
t[0] = t[0]-'a'+'A';
}
cout<<t[0]<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+... |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 2e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
int n, m, a[MAX_N], mx[MAX_N];
vector<int> adj[MAX_N];
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i < m... | #include"bits/stdc++.h"
using namespace std;
#define ll long long
#define ul unsigned long long
#define ui unsigned int
#define ri register int
#define pb push_back
#define mp make_pair
char p[30]={'0','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
inline ll rd... |
/*
我的心脏怦怦跳，监管者就在附近
name:
Algorithm:
writer:Lxs(cdx)
place:
nothing is impossible
*/
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#include<string>
#include<iostream>
#include<cmath>
#include<set>
#include<stack>
#include<queue>
#include<unistd.h>
#include<stdio.h>
#include<cstring>
#define random(a,b... | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("unroll-loops")
#include "bits/stdc++.h"
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'
#define F first
#define S second
#define IO ios::s... |
#include <bits/stdc++.h>
#define fo(i, x, y) for (int i = (x); i <= (y); ++i)
#define fd(i, x, y) for (int i = (x); i >= (y); --i)
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5, lim = 1e6;
int l, r, tot;
int pri[maxn], v[maxn], cnt[maxn];
vector<int> fac[maxn], s[maxn];
int getint()
{
char c... | #include <iostream>
#include <vector>
#include <cmath>
#include <ostream>
#include <list>
#include <map>
#include <algorithm>
#include <climits>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <bitset>
#include <cstring>
#include <deque>
#include <set>
#include <stack>
#include <queue>
#include <chrono... |
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
template<class T,class C> T max(T a,C b){ return std::max(a, (T)b); }
template<class T,class C> T min(T a,C b){ return std::min(a, (T)b); }
#define zt(a,b) (max((a),(b))-min((a),(b)))
int main(){
ll i,j,r[2],c[2],res=... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a,b;
scanf("%d%d%d%d",&n,&m,&a,&b);
if(n==a&&m==b){
printf("0\n");
}
else if(n+m==a+b||n-m==a-b||abs(n-a)+abs(m-b)<=3){
printf("1\n");
}
else{
if((abs(n+m)+abs(a+b))%2==0){
printf("2\n");
... |
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <algorithm>
#include <cmath>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
using namespace std;
int main(){
int n;
cin >> n;
vector<int> type(2*n, 0);
vect... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define f(i,n) for(int i=0; i<n; ++i)
#define fi(i,st,n) for(int i=st; i<=n; ++i)
#define veci vector<int>
#define vecp vector<pair<int,int> >
#define vecl vector<ll>
int prime[100000+10];
ll lcm(ll ... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --i)
using... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define amax(a, b) a = max(a, b)
#define amin(a, b) a = min(a, b)
using ll = long long;
int pow5(ll x) {
int cnt = 0;
while (x % 5 == 0) {
x /= 5;
cnt++;
}
return (x == 1 ? cnt : 0);
}
int m... |
/*
|\ /| || 00 00
| \ / | || 0 0 0 0
| \/ | ====== || 0 0 0 0
| | ====== || 0 0 0 0
| | || 0 0 0 0
| | || 00 00
*/
#include "bits/stdc++.h"
#define ll long long
#define chl_jldi ios_base::sync_with_stdio(false); cin.tie... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
string s;
cin>>s;
int i=0;
int cnt=0;
while(i<9)
{
if(s[i] == 'Z')
{
if((s[i+1] == 'O') && (s[i+2] == 'N') && (s[i+3] == 'e'))
{
i+=4;
cn... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int t = 0;
for (int i = 0; i <= s.size() - 4; i++)
if (s.substr(i, 4) == "ZONe") t++;
cout << t << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<endl
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | // author: immortal3
// github: github.com/immortal3
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using V = vector<ll>;
int main()
{
ll n;
cin >> n;
vector<P> town(n);
V taka(n);
ll takahashi = 0;
ll aoki = 0;
for (int i = 0; i < n; i++)
cin >> town[i].first >> town[i].second;
for (in... | #define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define MAXN 1000005
#define MOD 1000000007
#define ... |
#include <bits/stdc++.h>
using namespace std;
int N, Q;
int A[300005];
bool fenwick[35][300005];
void update_bit(int idx, int bit) {
for (int i = idx; i <= N; i += (i & -i)) {
fenwick[bit][i] ^= 1;
}
}
void update(int idx, int y) {
A[idx] ^= y;
for (int i = 0; i < 30; i++) {
if (y & (1 << i)) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
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 INF 1001001001 //10... |
#include <bits/stdc++.h>
using namespace std;
typedef int int_;
#define int long long
const int mod=998244353;
int qpow(int a,int b){
int ret=1;
while(b){
if(b&1ll)ret=(ret*a)%mod;
a=(a*a)%mod;
b>>=1ll;
}
return ret%mod;
}
int_ main(){
int a,b,k;scanf("%lld%lld%lld",&a,&b,&k)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... |
#pragma GCC optimize("Ofast")
#if 1
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rrep(i, n) for(int i = (int)(n) - 1; i >= 0; i --)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<p... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
string S, T;
vector<int> ones;
main() {
cin >> N >> S >> T;
int j = 0;
int cost = 0;
for (int i = 0; i < N; i++) if (S[i] == '1') ones.push_back(i);
int M = ones.size();
for (int i = 0; i < N; i++) {
if (T[... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordere... |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
void P... | /*
--------------------------------------------------
------------ ------------
.Code by sonjaewon.
------------ ------------
--------------------------------------------------
*/
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0); cout.tie(0... |
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef unsigned long long ll;
string X; ll M;
ll INF = 1ll << 61;
bool isBigger(ll base) {
int n = X.size();
if (log(X[0] - '0') + (n - 1) * log(base) > log(INF)) { retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9
#define linf 1e18
#define BASE 1000000
#define EPS 1e-10
#define PI acos(-1)
#define pii pair<int,int>
#define piii pair<int, pair<int, int> >
#define pdi pair<double,int>
#define vi vector<int>
#define fi first
#define se second
#defi... |
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.t... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000007
const ll mod = 1e9 + 7;
ll power(ll a, ll b) { //a^b
... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define itn int
#define ll long long
#define yes {puts("Yes");}
#define no {puts("No");}
using namespace std;
ll read(){
ll a=0,b=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')b=-1;c=getchar();}
while(c>='0'&&c<='9')a=a*10... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) i... |
#include <bits/stdc++.h>
using namespace std;
int n,m,t,f[110][110],q[110];bool b[110];
struct BAG
{
int w,v;
}a[61];
bool cmp(BAG x,BAG y)
{
return x.v>y.v;
}
struct BOX
{
int num,pos;
}x[110];
bool cmp1(BOX x,BOX y)
{
return x.num<y.num;
}
int main()
{
scanf("%d %d %d",&n,&m,&t);
for(int i=1;i<=n;i++)
scanf("... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<int> w(n), v(n);
rep(i, n) cin >> w[i] >> v[i];
vector<int> x(m);
rep(i, m) cin >> x[i];
rep(qi,... |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100][100];
constexpr int MOD = 998244353;
int fact(int n) {
int s = 1;
for (int i = 1; i <= n; i++) {
s = 1ll * s* i % MOD;
}
return s;
}
int solve(vector<pair<int, int>> a, int n) {
vector<vector<int>> ed(n + 1);
vector<int> used(n + 1);... | #include <cstdio>
#include <vector>
/*
A(x) = A(x^2) C(x^2)
*/
using u32 = unsigned int;
using u64 = unsigned long long;
template <u32 MOD>
struct Mint {
u32 n;
constexpr Mint(u32 n = 0): n(n) {}
constexpr Mint operator-() const { return Mint(n ? MOD - n: 0); }
constexpr Mint &operator+=(const Mint &rhs){ n... |
#include<bits/stdc++.h>
#define mz 1000000007
using namespace std;
int len;
long long dp[200005][20][20];
char s[200006];
long long ans=0;
bool life[20];
void go(int l,bool f,int k,int now)
{
int ff;
if(now>k)
return ;
if(f==1)
ff=s[len-l];
else
ff=15;
if(l==1)
{
int tt=0;
if(k==now)
{
for(int i=... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
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... |
// author :: enigma74
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vec(v) v.begin(),v.end()
#define MOD (1e9+7)
void FASTIO(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void solve_logic(){
ll n;
cin>>n;
ld arr[n],sum=0,ans=0;
fo... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long int
#define umap unordered_map
#define mod 1000000007ll
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MN(a,b,c) min(a,min(b,c))
#define MX(a,b,c... |
//@formatter:off
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#de... | #include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... |
#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>
#define rep(i, n) for (int i = 0; i <=(int)(n); i++)
using namespace std;
int main() {
int N,e;
cin >> N;
e = N * 1.08;
if (e < 206) cout << "Yay!" << endl;
if (e > 206) cout << ":(" << endl;
if (e == 206) cout << "so-so" << endl;
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vi vector<int>
#define vl vector<long long>
#define vd vector<long double>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_lr(i, f, n) for (int i = f; i < (int)(n); i++)
#define sum(v) accumulate(v.begin(),v.end(),0)
#define s... |
#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;
// MACROS
#define int long long
#define pb push_back
#define MAX 1e17
#define MIN ... |
/**
* author: mahfuzz
* created: 14.01.2020
**/
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << #x << ':' << x << endl;
typedef long long ll;
int main(int argc, char* argv[]){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m, t;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,S,D;
cin>>N>>S>>D;
for(int i=0;i<N;i++){
int X,Y;
cin>>X>>Y;
if(X<S&&Y>D){
puts("Yes");
return 0;
}
}
puts("No");
} |
#include <iostream>
using namespace std;
int main(){
long long n;
cin >> n;
long long left = 0, right = 2000000010;
while(right - left > 1){
long long mid = (left + right) / 2;
if(mid * (mid + 1) / 2 <= n + 1){
left = mid;
}else{
right = mid;
}
}
cout << n - left + 1 << endl;
r... | #include<iostream>
#include<vector>
using namespace std;
#define pii pair<int,int>
int spf[100002]; // smallest prime factor
int n=100001;
int num[100001];
void sieve(){ //埃氏篩法 預處理 O(nloglogn)
spf[1]=1;
for (int i=2;i<=n;i++ ) spf[i]=i;
for (int i=4; i<n; i+=2) spf[i] = 2;
for (int i=3;i*i<=n;i++){ ... |
#include <algorithm>
// #include <atcoder/all>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main(){
int a,b,suma = 0,sumb = 0;
string as,bs;
cin >> a >> b;
while(a != 0 && b != 0){
suma += a%10;
a /= 10;
sumb += b%10;
b /= 10;
}
if(suma == sumb){
cout << suma;
return 0;
}
suma > sumb ? cout << suma : cout << sumb;
ret... |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define deb(x) cout << #x << " = "<< x << "\n";
int x, y;
map<int, int> ans;
int solve(int x, int y) {
if(x >= y) {
return x - y;
}
if(ans.count(y))
return ans[y];
if(y & 1) {
ans[y] = 2 + min(solve(x, (y -... |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
int MOD = 998244353;
inline int add(const int a, const int b, const int mod = MOD) { return (a + b >= mod) ? (a + b - mod) : (a + b); }
inline void _add(int &a, const int b, const int mod = MOD) { a = add(a, b, mod); }
inline int sub(const int a, con... | #include<bits/stdc++.h>
using namespace std;
namespace IO
{
const int buf_size=1<<20;
char buf[buf_size],*S,*T;
inline char read_char()
{
if(S==T)
T=(S=buf)+fread(buf,1,buf_size,stdin);
return S!=T?*(S++):EOF;
}
bool flag_EOF;
inline int read_int()
{
c... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
ll dmod(ll x){
return ((x+mod)%mod);
}
ll modular_power(ll x,ll y){
ll ans=1;
while(y){
if(y&1)ans=dmod(ans*x);
y/=2;
x=dmod(x*x);
}
return ans;
}
int main()
{
ios_base::sync_wi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
int main(){
int a,b,c;cin>>a>>b>>c;
if(a!=b){
puts(a>b?"Takahashi":"Aoki");
... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(pow(2,N));
for (int i = 0; i < pow(2,N); i++) {
cin >> A.at(i);
}
vector<int> B(pow(2,N)); //勝ち残った選手のベクトル
for (int i = 0; i < pow(2,N); i++){
B.at(i) = i;
} // 初期値はすべての選手
for (int i = 0; i < N-1; i++){ ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define p push
#define pp pop
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define maxe *max_element
#define mine *min... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
inline int popcount(unsigned int x){
x-=(x>>1)&0x55555555;
x=(x&0x33333333)+((x>>2)&0x33333333);
return ((x+(x>>4)&0x0f0f0f0f)*0x01010101)>>24;
}
int main(){
int n; scanf("%d",&n);
printf("%d\n",(1<<n)-1);
for(int i=1;i<(1<... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <string>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <numeric>
#include <deque>
#include <cstring>
#include <iterator>
#include <map>
#include <cstdlib>
#include <unordered_map>
#inc... |
#include <iostream>
#include<math.h>
#include<vector>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
int main() {
int a = 0, b = 0, c = 0;
cin >> a;
cin >> b;
cin >> c;
int numa = 7 - a;
int numb = 7 - b;
int numc = 7 - c;
int y = 0;
y = numa + numb + numc;
cout << y;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define rfor(i, b, a) for(ll i = b; i >= a; i--)
#define X first
#define Y second
#define pb push_back
#define play {ios_base::sync_with_stdio(false);}... |
#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>
using namespace std;
int main() {
int n, cnt1, cnt2, m;
cin >> n >> m;
cnt1 = cnt2 = 0;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
int cnt = 0;
for (auto p : s) p == '1' ? cnt++ : 0;
cnt & 1 ? cnt1++ : cnt2++;
}
cout << 1ll * cnt1 * cnt2 << 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() {
ll n, w;
cin >> n >> w;
int ans = 0;
int a = n;
while (a >= w) {
a -= w;
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long int
#define sd(x) scanf("%lld",&x)
#define inf 1000000000000000000ll
#define pll pair<ll,ll>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define bits(x) __builtin_popcountll(x)
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(x) x.begin() , x.end()
#define ld long double
const long long inf = 1e18 + 1LL;
const int mod = 1e9 + 7LL;
void solve();
void ITO();
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ITO... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007 // 998244353
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define all(v) v... |
/**
* 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 = (... | #pragma GCC optimize("Ofast")
//#ifndef ONLINE_JUDGE
//#define _GLIBCXX_DEBUG
//#endif
#ifdef ONLINE_JUDGE
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <math.h>
#include <complex>
using namespace std;
#ifdef ONLINE_JUDGE
using namespace atcoder;
#endif
#defi... |
#include <bits/stdc++.h>
#define MN 1001000
using namespace std;
typedef long long ll;
#define MOD 998244353
ll n, w[110], dp[102][10010][102], fat[110], sum;
ll solve(int i, int sum, int rem) {
if(rem < 0 || sum < 0) return 0;
if(i == n) return (sum == 0 && rem == 0);
ll &x = dp[i][sum][rem];
if(x... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
using namespace std;
void test(){
ll n;
cin>>n;
ll c[n][n];
f(i,n)f(j,n)cin>>c[i][j];
if(n==1){
cout<<"Yes\n";
cout<<c[0][0]<<"\n";
cout<<"0\n";
... |
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
templ... | #define TO_BE_SUBMITTED
#include <bits/stdc++.h>
// #include <atcoder/fenwicktree>
// #include <atcoder/segtree>
// #include <atcoder/lazysegtree>
// #include <atcoder/string>
// #include <atcoder/math>
// #include <atcoder/convolution>
// #include <atcoder/modint>
// #include <atcoder/dsu>
// #include <atcoder/maxflow... |
#include<bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include<atcoder/all>
// using namespace atcoder;
#endif
#define int long long
#define rep(i, n) for(int i = 0;i<(int)(n);i++)
#define all(v) (v).begin(),(v).end()
using lint = long long;
using ll = long long;
using P = std::pair<int,int>;
c... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1... |
#include<bits/stdc++.h>
using namespace std;
const int N=1e8;
int h,w,x,y;
char s[110][110];
int main()
{
int sum=1;
cin>>h>>w>>x>>y;
y--;
for(int i=1;i<=h;i++)
cin>>s[i];
for(int i=x+1;i<=h;i++)
if(s[i][y]=='.')
sum++;
else break;
for(int i=x-1;i>=1;i--)
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 1000000007;
#ifndef ONLINE_JUDGE
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " (" << x.first << " : "... |
#include <iostream>
#include <vector>
#include <string>
void solve() {
std::string s;
std::cin >> s;
int n = s.length();
std::vector<int> cnt(10, 0);
for (auto c : s) ++cnt[c - '0'];
for (int i = 0; i < 10; ++i) {
if (cnt[i] == 0 && (i != 0 || n != 0)) continue;
--cnt[i];
... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
#include <assert.h>
// #include <prettyprint.hpp>... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i=0;i<n;i++)
#define INF 1000000001
#define lINF 1000000000000001
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = ... | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000005 /*10^9+5*/
#define mod 1000000007 /*10^9+7*/
#define eps 1e-10
#define rep(i,n) for(int i = 0; i < (n); ++i) /*0からn-1までのrepeat*/
#define rrep(i,n) for(int i = 1; i <= (n); ++i) /*1からnまでのrepeat*/
#define drep(i,n) for(int i = (n)-1; i >= 0; --i) /*n-1か... |
/*
[arc104] D - Multiset Mean
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define ALL(c) (c).begin(), (c).end()
const int MAX_N = 100;
const int MAX_K = 100;
const int MAX_S = MAX_N * MAX_N * MAX_K;
int N,... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define int long long
typedef long long LL;
typedef long long ll;
const int INF = 0x3f3f3f3f;
//const int inf = 1e18;
//const int mod = 998244353;
const int mod = 1e9 + 7;
int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
const int maxn = 1e6... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
double a ,b;
cin >> a >> b;
double ans = a*b;
cout << ans/100 << endl;
} | #include<bits/stdc++.h>
using namespace std;
//My typenames
typedef long long l1;
typedef vector<int> vi;
typedef vector<l1> vl;
typedef pair<int,int> pi;
typedef map<int,int> mp;
//My Macros
#define F first
#define S second
#define pushb push_back
#define popb pop_back
#define fli(i,a,b) for(int i=a;i<b;i++)
#define... |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector< vector<int> > T;
vector<int> C;
vector<int> ans;
vector<int> color_check;
void dfs(int now, int p){
if(color_check[ C[now] ] == 0){
ans.emplace_back(now);
}
color_check[ C[now] ]++;
for(int i = 0; i < T[no... | #include "bits/stdc++.h"
using namespace std;
const int maxn=2e5+5;
int a[maxn],b[maxn],p[maxn],ip[maxn];
void solve(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
cin>>b[i];
}
for(int i=1;i<=n;i++){
cin>>p[i];
ip[p[i]]=i;
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin>>h>>w;
map<int,int>mp;
vector<int>v;
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
const ll inf = 1e9 + 9;
const ll maxn = 1e5+100;
const ll mod = 1e9+7;
const ld eps = 1e... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll a,b;
cin>>a>>b;
double ans=(double)a*b;
ans=(double)ans/100;
cout<<setprecision(10)<<ans<<"\n";
}
| // PIGMEISTER™ //
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define sidha(i,x,n) for(ll i=(ll)(x);i<(ll)(n);++i)
#define ulta(i,x,n) for(ll i=(ll)(x);i>=(ll)(n);--i)
#define sab(a) a.begin(),a.end()
#define bas(a) a.rbegin(),a.rend()
#define test ll _;cin>>_;while(_... |
//#include<bits/stdc++.h>
#include<map>
#include<queue>
#include<time.h>
#include<limits.h>
#include<cmath>
#include<ostream>
#include<iterator>
#include<set>
#include<stack>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define endl '\n'
#define rep_1(i,m,n) for(int i=m... | #pragma region
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t; // long long と int64_t は同じ
const int INF = 0x3fffffff; // 10^9 より少し大きい
#pragma endregion
ll point (map<ll, ll> f)
{
ll a = 0;
for (auto x : f) a += x.first * pow(10, x.second);
return a;
}
... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
using namespace std;
typede... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef long double ld;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 3;
#define block 555
#define pb push_back
#define mp make_pair
#define ff first
#defi... |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(int i=0;i < (n);i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const ll MOD=10000000... |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <utility>
#include <vector>
#include... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const int N = 51;
ll dp[N][2], vis[N][2];
ll repx[N], a[N];
ll n, x;
// question is we have to find number A such that (x+A) has no common coin with A
// i represent ith type of coin and f represent we have carry or not from previous
ll fun(int i, in... | #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 <iostream> // cout, endl, cin
#include <vector> // vector
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> A.at(i) >> B.at(i);
}
int K;
cin >> K;
vector<int> C(K), D(K);
for (int i = 0; i < K; i++) {
cin >> C.at(i) >> D.a... | #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;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define MAXN 100005
#define INF (ll)1e18
#define mod 1000000007
//#define mod 998244353
#define endl '\n'
#define level 20
ll cc=0;
void boost()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vect... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
//#define DIV 1000000007
//#define DIV 998244353
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, con... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
int main()
{
int n;
cin >> n;
vector<bool> b(2);
b[0] = true, b[1] = false;
set<vector<bool>> st0;
st0.insert(b);
for(int c = 2; c <= n; c++){
set<vector<bool>> st1;
int l = (1 << (c - 1));
for... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define int long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define setbits(x) __builtin_popcountll(x)
#define md (ll)1e9 + 7
#define inf ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 9, M = 1e6 + 9, OO = 0x3f3f3f3f;
ll llOO = 0x3f3f3f3f3f3f3f3f;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, x; cin >> n >> x;
string s; cin >> s;
for(int i = 0;i < n;i++){
if(s[i] == '... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MAXN 300010
long long n;
long long a[MAXN];
map<long long, long long> qt;
int main() {
scanf("%lld", &n);
long long i, j;
for (i=1; i<=n; i++) {
scanf("%lld", &a[i]);
}
long long ans = 0;
for (i=1; i<=n; ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define MOD 1000000007
#define INF LLONG_MAX
#define MINF LLONG_MIN
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#def... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define int int64_t
#define rep(n) for(ll i=0;i<n;i++)
#define rrep(n) for(ll i=n-1;i>=0;i--)
#define inF freopen("input.in", "r", stdin);... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h,w ;
cin >> h >> w;
vector<int> a(h*w);
int m = 1000;
for(int i =0; i<(h*w); i++)
{
cin >> a[i];
if(m > a[i])
m=a[i];
}
int t = 0;
for(int i =0; i<(h*w); i++)
{
t+= a[i]-m;
}... |
#include <iostream>
#include <bits/stdc++.h>
#include<string>
using namespace std;
#define boost ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
long long n,m;
string s,st;
std::vector<pair<long long,long long>> a,b;
void get_values()
{
long long x,y;
std::cin >> n;
for(int i=0;i<n;i++)
... | /*
ID: Λινδα
LANG: C++
TASK: abc194a
*/
#include <stdio.h>
#include <algorithm>
using namespace::std;
int read(){char c=getchar();int t=0,f=1;while(c<'0'||c>'9'){if(c=='-'){f=-1;}c=getchar();}while(c>='0'&&c<='9'){t=(t<<1)+(t<<3)+(c^48);c=getchar();}return t*f;}
void write(int x){char ch[50];int l=0;if(x<0){putchar('-'... |
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
cout << (n + 100) / 100 * 100 - n << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boo... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define all(c) begin(c), end(c)
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
using name... |
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#define all(v) begin(v), end(v)
#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... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
typedef long long ll;
using namespace std;
using P=pair<int,int>;
struct unionfind {
vector<int> d;
unionfind(int n=0): d(n,-1) {}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = fi... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <tuple>
#include <queue>
#include <vector>
// 距離、x座標、y座標
using vertex = std::tuple<int, int, int>;
std::pair<std::string, int> dijkstra(int, int, int, int);
void interact(int);
void modify_distance(const std::string &, int, int, int... | #pragma warning(disable:6385)
#define _USE_MATH_DEFINES
#include <cassert>
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#incl... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep0(i, n) for (ll i = 0; i <= (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep1(i, n) for (ll i = (n); i > 0; --i)
#define rrep0(i, n)... | //#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
//vector string deque break continue
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define fs first
#define sc second
#defi... |
#include<iostream>
#include<cstdio>
using namespace std;
#define ll long long
int main()
{
ll n;
cin>>n;
string s;
cin>>s;
ll i;
ll pref[s.length()+1]={0};
ll j;
for(i=0;i<s.length();i++)
{
if(s[i]=='A')
{
pref[i+1]=pref[i]+6000;
}
else i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return result;
}
i... |
#include <cstdio>
#include <algorithm>
using namespace std;
const int MOD = 1e9 + 7;
char a[2005][2005];
int hc[2005][2005];
int wc[2005][2005];
int two[4000005];
int main()
{
int h, w;
scanf("%d%d", &h, &w);
for (int i = 0; i < h; i++) {
scanf("%s", a[i]);
}
int tidy = 0;
for (int i = 0; i < h; i++) {
for ... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... |
#include"bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
for (int i = 0; i < N; ++i) {
int c1 = 0, c2 = 0;
for (int j = i; j < N; ++j) {
if (S[j] == 'A')
c1++;
else if (S[j] == 'T')
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,ans=0;
bool flag=1;
char s[100005];
char head,tail;
cin>>n>>s;
if(n==2)
{
if(s[0]==s[1])
ans=-1;
else
ans=1;
}
else if(n==3)
{
if(s[0]!=s[2])
ans=1;
else
ans=-1;
}
else//n>3
{
if(s[0]!=s[n-1])
ans=1;
else
{
for(... | #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;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}... | /***** In the name of Allah, the Most Gracious, the Most Merciful *****/
#include<bits/stdc++.h>
using namespace std;
#define Allahu_Akbar ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
int main()
{
Allahu_Akbar
//freopen("input.txt", "r", stdin);
int k;
cin >> k;
long long int total... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#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, m, n) for(int i = m;i < n;i++)
vector<vector<ll>> near8={{-1,1},{0,1},{1,1},{-1,0},{1,0},{... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const double eps = 1e-7;
const int MAXN = 1e5 + 5;
double a[MAXN];
double ans;
int n;
double calc(double now) {
double res = 0;
for(int i = 1; i <= n; i++) {
res += (now + a[i] - min(a[i], 2 * now)) / n;
}
return res;
... |
/*Rabbi Zidni Ilma*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld %lld",&n,&m)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define mod 1000000007
#define read freopen("input.txt","r",stdin)
#define writ... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define double long double
#define x first
#define y second
#define vi vector <int>
#define L nod<<1
#define R ((nod<<1)|1)
#define int ... |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define int long long int
#define ld long double
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define removeDuplicates(a) a.resize(unique(all(a))-a.begin())
#define endl '\n'
#define setbits(x) (__builtin_popcount(x))
int mod=1... | #include <bits/stdc++.h>
using namespace std;
int n;
int main(){
int i,all = 1;
cin >> n;
while (all < n) all <<= 1;
all -= 1;
for (i = 0; i < n; ++i){
int lc = all&(i<<1),rc = all&(i<<1|1);
if (lc >= n) lc -= (all+1)>>1;
if (rc >= n) rc -= (all+1)>>1;
++lc,++rc;
cout << lc << ' ' << rc << '\n';
}
ret... |
// execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using iPair = pair<int,int>;
using lPair = pair<ll, ll>;
using ivector = vector<int>;
using lvector = vector<ll>;
using istack = stack<int>;
using iqueue = queue<int>;
using ivv = vector<vector<int>>;
using lvv = vector<vector<ll>>;
const int INF ... |
#include"bits/stdc++.h"
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(x) x.begin(),x.end()
#define MOD 1000000007
#define INF INT_MAX
#define FLOAT_ANS setprecision(10)
#define elif else if
// #define input(type,n) type n;cin>>n
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//最大公約数
tem... | //#include<bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <string.h>
#include <vector>
#include <utility>
#include <map>
//#pragma GCC optimize "trapv"
//#define int long long
#define For(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define endl "\n"
#define F first
#defin... |
#include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x... | #include "bits/stdc++.h"
using namespace std;
using str = string;
using db = double;
#define pf push_front
#define pb push_back
#define ef emplace_front
#define eb emplace_back
#define ist insert
#define ers erase
#define ppf pop_front()
#define ppb pop_back()
#define ft front()
#define bk back()
#define ety empty(... |
#define ll long long
#define dd long double
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define fo(i , n) for(ll i = 0 ; i < n ; i++)
#define tri tuple<ll ,ll ,ll>
#define tll tuple<ll ,ll , ll , ll>
#define pll pair<ll ,ll>
#inclu... | // Created by ...
#include <bits/stdc++.h>
#define vll vector< ll >
#define M 100000
#define MD 1000000007
#define pb push_back
#define sz(x) (int)(x).size()
#define rep(i,a,b) for(ll i = a; i <= b; ++i)
#define per(i,a,b) for(ll i = a; i >= b; --i)
#define pii pair<ll,ll>
#define vec(a) vector<a >
#define all(a) (a)... |
#include<iostream>
#include<queue>
using namespace std;
priority_queue<long long , vector<long long>,greater<long long> >q;
long long n,v[400015];
int main()
{
cin>>n;
long long sum=0;
for(int i=1;i<=2*n;i++)
{
cin>>v[i];
sum+=v[i];
}
long long l=n;
long long r=n+1;
while(l>=1)
{
q.push(v[l--]);
q.push... |
// Parasparopagraho Jīvānām
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_pbds ;
using namespace __gnu_cxx ;
using namespace std ;
typedef long long ll ;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.