code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#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<iostream>
#include<algorithm>
#include<cstring>
#include<set>
using namespace std;
const int N = 3e3 + 10, M = 1 << 5;
int n;
int w[N][5];
bool check(int x){
set<int> s;
for(int i = 1; i <= n; i ++){
int t = 0;
for(int j = 0; j < 5; j ++)
if(w[i][j] >= x) t += 1 << j;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define pll pair<ll,ll>
#define ld long double
const int INF = 1e9 + 7;
void solve(){
ll L , R; cin >> L >> R;
ll ans = 0;
if(R < 2 * L) cout << 0 << endl;
else{
ll numAs = R - 2 * L + 1;
ll ans = numAs * (R + 2 * L)... | #include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#define LL long long
using namespace std;
int main (){
LL T, l, r;
cin >> T;
while (T--){
scanf("%lld%lld", &l, &r);
LL m = r - 2 * l + 1;
if (m <= 0){
... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vv... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0 ; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007;
const int N=1e5 ;
const int INF=1001001001 ;
void solve(){
int n,x ;
cin>>n>>x ;
vector<int> a(n) ;
rep(i,n){
cin>>a[i] ;
}
stack<int> st ;
rep(i,n){
if(a[i]==x){... | #include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if(a == b) {
cout << a << '\n';
}
else {
if(2 != a && 2 != b) {
cout << 2 << '\n';
}
else if(1 != a && 1 != b) {
cout << 1 << '\n';
}
else {
cout << 0 << '\n';
}
... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
static const ll mod=998244353;
ll N,K;
ll power[301];
ll modpow(ll a,ll n){
ll res=1;
while(0<n){
if(n%2==1)res=(res*a)%mod;
a=(a*a)%mod;
n>>=1;
}return res;
}
ll fac[301];
ll rev[301];
ll comb(ll n,ll k){
if(n<k)return 0;
ll x=(fac[n]*rev... | //#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL... |
// __________________
// | ________________ |
// || ____ ||
// || /\ | ||
// || /__\ | ||
// || / \ |____ ||
// ||________________||
// |__________________|
// \###################\
// \###################\
// \ ____ \
// \_______\___\_______\
// An AC a ... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... |
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
using namespace std;
typedef long long ll;
//infの設定
#define INF32 2147483647
#define INF64 9223372036854775807
//repマクロ
#define rep(i, m, n) for (int ... | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#in... |
//Update : 2021.2.26
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ld long double
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define For(x,a,b) if(a!=b){icdc=(b-a)/abs(b-a);}else{icdc=1;}for(int x=(a);x!=(b+icdc);x+=icdc... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll n;cin>>n;
unordered_set<ll> s;
for(ll i=2;i*i<=n;i++){
ll k=i*i;
while(k<=n){
s.insert(k);
k=k*i;
}
}
cout<<n-s.size();
} |
#include <bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define whilet int T;cin>>T;while(T--)
#define clr(a,x) memset(a,x,sizeof(a));
#define ll long long
#define PI 3.1415926535897932384626
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c;
cin >> a >> b >> c;
long long mod = 998244353;
cout << ( (a) * (a+1) / 2 % mod) * ( (b) * (b+1) / 2 % mod) % mod * ( (c) * (c+1) / 2 % mod ) % mod;
} |
#include <iostream>
int main(void)
{
int a, b, c, d;
std::cin >> a >> b >> c >> d;
std::cout << a*d - b*c << std::endl;
return 0;
} | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int A, B; cin >> A >> B;
int t = min(A, B) - 1;
vector<ll> ans(A + B);
for(int i = 0; i < t; i++){
ans[i] = i + 1;
}
for(int i = 0; i < t; i++){
ans[t + i] = (i * -1) - 1;
}
int n = max(A, B) ... | /*
written by Pankaj Kumar.
country:-INDIA
Institute: National Institute of Technology, Uttarakhand
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll ;
typedef unsigned long long ull... |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include <bits/stdc++.h>
#define INF 1000000007
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef long double ld;
typedef vector<int> vi;
typedef unordered_map<int,i... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,j,n) for(int i=j;i<n;i++)
#define readvec(v,n) for(int i=0;i<n;i++){cin>>v[i];}
#define MOD 1000000007
int main()
{
int n;
cin>>n;
vector<char> v(2*n);
readvec(v,2*n);
int q;
cin>>q;
int ind=0;
rep(i,0,q)
{
int t,a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, ans;
struct Node{
int v, idx;
inline bool operator < (const Node &comp) const {return comp.v < v;}
}a[400000 + 5];
set <int> b;
set <int> :: iterator it;
signed main() {
ios :: sync_with_stdio(false);
cin.tie(0); cout.tie(0);... |
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ceil(x) static_cast<ll>(ceil(x))
#define floor(x) static_cast<ll>(floor(x))
#define pow(x, y) static_cast<ll>(pow(x, y))
#defi... | #include<bits/stdc++.h>
using namespace std;
long long a,b,c;
long long pw(long long x,long long y,long long md)
{
long long rt=1;
while(y)
{
if(y&1)
{
rt*=x;
rt%=md;
}
x*=x;
x%=md;
y>>=1;
}
return rt;
}
int main()
{
cin>>a>>b>>c;
a%=10;
if(a==0)
{
cout<<0<<endl;
}
if(a==1)
{
cout<<1<<... |
/* {{{ */
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL
#include <prettyprint.hpp>
#define debug(a) cerr << "[\033[33mDEBUG\033[m] " << (#a) << ": " << (a) << endl
#else
#define debug(s) cerr << "[\033[33mDEBUG\033[m] local only" << endl
#endif
using ll = long long;
template <class T> using vec = vector... | #include <bits/stdc++.h>
using namespace std;
int a[3001][5];
int n;
bool valid(int req) {
set<int> mask;
for(int i = 0; i < n; i++) {
int bits = 0;
for(int j = 0; j < 5; j++) {
if(a[i][j] >= req)
bits |= (1 << j);
}
mask.insert(bits);
}
for (a... |
/// B I S M I L L A H I R R A H M A N I R R A H I M
#include<bits/stdc++.h>
#include<vector>
#include<set>
#include<map>
using namespace std;
typedef bool boo;
typedef int li;
typedef long long int ll;
typedef unsigned long long int l1;
typedef ... | #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;
void solve(long long N, long long K, std::vector<long long> a){
map<int, int> cnt;
int mx = 0;
rep(i, N) {
cnt[a[i]]++;
... |
#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int a[N];
int n, m;
int main(){
// int t;
// while()... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int arr[2][2];
for(int i =0;i<2;++i){
for(int j = 0;j<2;++j)cin >> arr[i][j];
}
cout << arr[0][0]*arr[1][1] - (arr[0][1]*arr[1][0]);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<pair<pair<ll, ll>, int>> lrt(N);
for (int i = 0; i < N; i++){
ll a, b, c;
cin >> a >> b >> c;
lrt.at(i).first.first = b;
lrt.at(i).first.second = c;
lrt.at(i).second = a;
}
sort(lrt.b... | #include<iostream>
#include<cstdlib>
#include<utility>
#include<tuple>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<queue>
#include<deque>
#include<bitset>
#include<cmath>
#include<map>
#include<string>
#include<list>
#include<iomanip>
#include<set>
using namespace std;
using ll = lo... |
// Generated by 2.3.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
#define SUBMIT
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
int x,y;
string A[800];
int score[800]={0};
char dna[20][20];
cin >> N >> M;
for(int i=0; i<M; i++) {
string a;
cin >> a;
bool iscontain=false;
int conv=0;
int convj=0;
fo... |
#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=(1<<19);
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar(); while (!isdigi... | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#de... |
// Code Written by Pinaki Bhattacharjee (pinakipb2)
#include<bits/stdc++.h>
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
// #define
#define LOCAL
#define INF 1e18
#define PI 2*acos(0.0)
#define endl "\n"
#define pb push_back
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 20;
const int M = 73;
const int K[N] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
ll a, b, f[M + 1][1 << N];
int s[M], c;
ll help(int i, int j) {
if (f[i][j]) {
return f[i][j];
}
f[i][j] = 1;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define Rep(i,j,n) for(int i = j; i < (int)(n); i++)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
int n; cin >> n;
int ans =... | /*
start of cp 3.0BETA
NEW-BETA-LADDER
https://codeforces.com/problemset/page/1?tags=1800-1800
DEAD PERSON CODING
*/
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
#define int long long int
#define pii... |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
typedef long long LL;
#define debug(x) cout << "debug : " << x << endl;
//#define int long long
//#define LOCAL
signed main() {
// ios::sync_with_stdio(0);
// cin.tie(0); cout.tie(0);
int a, b, c, d; cin >> a >> b >> c >> d;
int mx = -1e9;
... | #include<iostream>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
int x,y;
if(a>b){
x = a;
}else x = b;
if(c>d){
y = d;
}else y = c;
cout<<x-y;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chm... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
bool solve(string s) {
if(s.size() == 1) return s == "8";
if(s.size() == 2){
if(stoi(s) % 8 == 0) return 1;
swap(s[0], s[1]);
if(stoi(s) % 8 == 0) return 1;
return 0;
}
vector<i... |
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <numeric>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <random>
#include <list>
#include <iomanip>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <deque... | #include <bits/stdc++.h>
using namespace std;
int a, b, c, d, w;
int main()
{
cin >> a >> b >> w;
c = (w * 1000 + b - 1) / b;
d = w * 1000 / a;
if (d < c)
{
cout << "UNSATISFIABLE" << endl;
}
else
{
cout << c << ' ' << d << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pii;
#define ffor(i,n) for(ll i=0;i<n;i++)
#define rfor(x,y) for(ll i=x;i<y;i++)
#define ff first
#define ss second
#define pb push_back
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define all(v) v.begin(),v.en... | // code by lynmisakura. wish to be accepted!
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
#define debug(arr) std::cout << #arr << " = " << arr << '\n'
#define debug2(a,b) std::cout<<"["<<#a<<","<<#b<<"] = "<<"["<<a<<","<<b<<"]\n"
#define debug3(a,b,c) std::cout<<"["<<#a<<","<<#b<<","<<#c<<"] = "<... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
#define test ll t;cin>>t;while(t--)
#define f first
#define s second
#define pb push_back
#define pop pop_back
#define int long long int
#define all(x) x.begin(), x.e... |
#include <bits/stdc++.h>
using namespace std;
#define _for(i,a,b) for(int i = (a); i < (b); i++)
#define _rep(i,a,b) for(int i = (a); i <= (b); i++)
#define all(v) (v).begin(), (v).end()
#define nl "\n"
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define sz(v) ((int)(v).size())
//#defi... |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
// const ll mod = 998244353;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
... | #include <bits/stdc++.h>
using namespace std;
char grid[15][15];
int numOfV(int x, int y){
if(grid[x][y] != '#') return 0;
int vertexs = 0;
if(grid[x][y-1] != '#' && grid[x+1][y] != '#' && grid[x-1][y] != '#'){ vertexs += 2; /*cout<<"1"<<endl;*/}
if(grid[x][y-1] != '#' && grid[x][y+1] != '#' && grid[x-1][y] != '#'... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60; // 仮想的な無限大の値;
using ll = long long;
us... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DU... |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> d(3);
int ans = 0;
for (auto& x : d) {
cin >> x;
ans += 7 - x;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int d4r[] = {1, 0, -1, 0}, d4c[] = {0, 1, 0, -1};
int d8r[] = {1, 1, 0, -1, -1, -1, 0, 1}, d8c[] = {0, 1, 1, 1, 0, -1, -1, -1};
constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
constexpr int INF = 1001001001;
constexpr long long LINF = 1001002003004005006;
c... |
#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main() {
int n,k,m;
cin >> n >> k >> m;
int a=0;
int temp;
rep(i,n-1) {
cin >> temp;
a += temp;
}
//cout << ... | #include <iostream>
using namespace std;
int main(){
int n, k, m, sum = 0;
cin >> n >> k >> m;
int *a = new int[n];
for(int i=0;i<n-1;i++){
cin >> a[i];
}
for(int i=0;i<n-1;i++){
sum += a[i];
}
if(n*m-sum<=k){
if(n*m-sum>0){
cout << n*m-sum << endl;
}else {
cout << '0' << en... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
ll ansM=0;
double ans=0;
int ansC=0;
ll ansU=0;
rep(i,n) {
ansM += abs(x[i]);
ll x2 = ll(x[i])*l... | #include<bits/stdc++.h>
using namespace std;
int n,p,ans;
bool b[200010];
inline int read()
{
int num=0,flag=1;
char c=getchar();
for (;c<'0'||c>'9';c=getchar())
if (c=='-') flag=-1;
for (;c>='0'&&c<='9';c=getchar())
num=(num<<3)+(num<<1)+c-48;
return num*flag;
}
int main()
{
//freopen(".in","r",stdin);
//freo... |
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int tt; cin>>tt; while(tt--)
#define ff first
#define ss second
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
int main()
{
ios_base::sync_w... | #include <bits/stdc++.h>
#include <iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
double mina(double a,double b)
{
if(a<=b)
return a;
return b;
}
double maxa(double a,double b)
{
if(a<=b)
return b;
return a;
}
int main() {
long long int t,n,i,j,k,l,fla... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#define for_n(i, n) for (int i = 0; i < (int) n; i++)
using namespace std;
using li = int;
const li INF = 0x3fffffff;
struct vertex {
vector<li> neigh;
};
int main() {
li n, m, a, b, k; cin >> n >> m;
vector<vertex> vertices... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
const int maxn=(2e5)+10;
int n,k,mid,tot;
vector<int> g[maxn];
int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... | // YATIN KWATRA
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ar array
#define sz(v) (int)(v.size())
#define inf 1e18
#define int... |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <cmath>
#include <deque>
using ll=long long;
using namespace std;
int main(){
int R,C;
cin>>R>>C;
vector<vector<int>> A(R,vector<int>(C-1));
vector<vector<int>> B(R-1,vector<in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
#include <sstream>
#include <set>
#include <functional>
#include <map>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,a) repi(i,0,a)
#define all(u) u.begin(),u.end()
using Inte... | #include <bits/stdc++.h>
#define ll long long
#define sf scanf
#define pf printf
#define nl printf("\n")
#define endl '\n'
#define pb push_back
#define rep(i,a,b) for(int i=a; i<b; i++)
#define repr(i,a,b) for(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
cout<<(7-a)+(7-b)+(7-c);
return 0;
} | //多练，就是多练
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//记得初始化和clear
//记得取模
//数组开够
//边界情况不要想当然
//特判记得return
const int maxn=100010;
const int mod=1e9+7;
int a[1010];
void solve(int T)
{
ll a,b,c;
cin>>a>>b>>c;
if(c%2==0)
{
... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#de... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl '\n'
int countConsecutive(int N)
{
int count = 0;
for (int L = 1; L * (L + 1) < 2 * N; L++)
{
double a = (1.0 * N-(L * (L + 1)) / 2) / (L + 1);
if (a-(int)a == 0.0)
count++;
... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define LL long long
#define DD double
using namespace std;
const int pri[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
int main() {
int n;
scanf("%d", &n);
LL ans = 1;
for (int i = 0; i < 10 && pri[i] <= n; i++) {
int ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a;
cin>>a;
a=a*1.08;
// cout<<a<<" ";
if(a<206)
cout<<"Yay!";
else if(a==206)
cout<<"so-so";
else
cout<<":(";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n;
cin>>n;
ll a, sum=0, high=0, ans=0;
for(int i=0; i<n; i++) {
cin>>a;
sum+=a;
ans+=sum;
high=max(high, a);
cout<<ans+(i+1)*high<<endl;
}
return;
}
int main() {
#ifde... | // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#defi... |
#include<bits/stdc++.h>
using namespace std;
#define ints(...) int __VA_ARGS__; vin(__VA_ARGS__)
#define dbls(...) double __VA_ARGS__; vin(__VA_ARGS__)
#define ulls(...) unsigned long long __VA_ARGS__; vin(__VA_ARGS__)
#define strs(...) string __VA_ARGS__; vin(__VA_ARGS__)
#define vifin(x, y) vi x(y); fin(x... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int a, b, w;
cin >> a >> b >> w;
w *= 1000;
int minn = (w + b - 1) / b, maxx = w / a;
if (minn > maxx)
cout << "UNSATISFIABLE\n";
else
c... |
#include <bits/stdc++.h>
#define ll long long
ll md = 1000000007;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define g(v, i, j) get<i>(v[j])
#define vi vector<int>
#define vll vector<ll>
#define srt(v) sor... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define MAXN 1000005
#define INF (ll)1e18
#define mod 1000000007
//#define mod 998244353
#define endl '\n'
ll cc=0;
void boost()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
ll inv(ll a, ll m)
{
ll m0 = m;
... |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define mk make_pair
const int N = 1e6 + 10;
const int mod = 998244353;
int read()
{
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9')
{
if (c == '-')
f = -1;
c = get... |
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int _C3(int n, int k)
{
if(k > n)
return 0;
else if(n==2 && k==1)
return 2;
else
return 1;
}
int C(int n, int k)
{
int ans = 1;
while(n > 0 || k > 0)
{
ans = (ans*_C3(n%3, k%3))%3;
n /= 3;
k /= 3;
}
return ans;
}
int main()
{
st... | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include <functional>
template <typename T>
inline void hash_combine(std::size_t &seed, const T &val) {
seed ^= std::hash<T>()(val) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
template <typename T> inline void hash_val(std::size_t &s... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll MAX =1000000000000000000;
ll mod= 1000000000;
long double pi=3.141592653589793238;
void pls()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);... | #include<bits/stdc++.h>
using namespace std;
int ara[262150],n,two[23],tra[23][23],dp[262150],sz,bits[23],tz;
int on(int val,int pos)
{
return (val|two[pos]);
}
bool ck(int val,int pos)
{
return (bool)(val&two[pos]);
}
int off(int val,int pos)
{
return (val^two[pos]);
}
void subsets(int mask,int idx)
{... |
// #define ONLINE_JUDGE
// _
// (_)
// _ __ ___ __ _ _ ___ _ __ _ __ ___
//| '_ ` _ \ / _` | |/ _ \| '__| '__/ _ \
//| | | | | | (_| | | (_) | | | | | (_) |
//|_| |_| |_|\__,_| |\___/|_| |_| \___/
// _/ | ... | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... |
#ifndef LOCAL
#include <bits/stdc++.h>
using namespace std;
#define debug(...) 42
#else
#include "Debug.hpp"
#endif
class Task {
public:
void Perform() {
Read();
Solve();
}
private:
int n;
vector<pair<int, int>> intervals;
void Read() {
cin >> n;
intervals.resize(n);
for (auto &[l, ... | /* BABA JAGAAAAAA */
#include<bits/stdc++.h>
#define pb push_back
#define un unordered_map
#define us unordered_set
#define ll long long
#define PI 3.1415926535897932384626
#define fast ios:: sync_with_stdio(false);cin.tie(NULL)
#define l long
using namespace std;
const int mod= 1e9+7;
const int inf=1e9+3;
/*
vec... |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define ALL(obj) begin(obj), end(obj)
#define cinv(a) rep(i,(int)a.size()) cin>>a[i]
#define pb push_back
#define eb emplace_ba... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i = a;i < (ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define SHOW(str,val) cout<<(str)<<" : "<<(v... |
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 410, offset = 200;
int a[N];
int main(){
int n;
cin >> n;
while(n--){
int x;
cin >> x;
a[x + offset]++;
}
long long ans = 0;
for(int i = 0; i <= 400; i++){
for(int j = i; j <= 400; j++){
... | #include <bits/stdc++.h>
using namespace std;
void DAU(const string &task = "") {
if (!task.empty())
freopen((task + ".in").c_str(), "r", stdin),
freopen((task + ".out").c_str(), "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void PLEC() {
exit(0);
}
#define in... |
#include <bits/stdc++.h>
using namespace std;
char a[10];
int st[10];
vector<int> v;
vector<int> m;
int ans[5];
int len ;
int le;
int out;
void dfs(int x)
{
if(x == 4){
int cnt =0 ;
for(int i = 0 ; i < le; i++){
for(int j = 0; j < 4 ; j++){
if( ans[j] == m[i]){
... | #include<bits/stdc++.h>
using namespace std;
int64_t kai(int n){
if(n==0)return 1;
return n*kai(n-1);
}
int main(){
string S;
cin>>S;
int maru=0;
int batsu=0;
for(int i=0;i<10;i++) {
if(S.at(i)=='o') maru++;
if(S.at(i)=='x') batsu++;
}
if(maru>4) {cout<<0<<endl;retu... |
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" ... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 10007;
int main() {
ll n;
cin >> n;
string s,t;
cin >> s >> t;
vector<ll>ss(n),tt(n);
for(ll i=0;i<n;i++){
ss[i]=s[i]-'0';
tt[i]=t[i]-'0';
}
ll ans=0;
ll j=0;
for(ll i=0;i<n;i++){
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=500005;
int n,S[N],T[N],ans,tot,st[N];
char s[N],t[N];
queue<int>q;
signed main()
{
scanf("%lld%s%s",&n,s+1,t+1);
for(int i=1;i<=n;i++)S[i]=(s[i]^48),T[i]=(t[i]^48);
for(int i=1;i<=n;i++)if(S[i])q.push(i);
for(int i=1;i<=n;i+... |
#include <bits/stdc++.h>
#define MOD_10_9_7 1000000007
#define MOD 998244353;
#define all(x) x.begin(), x.end()
#define endl '\n'
using namespace std;
template <typename T>
void update_max(T& a, T b) {
if (b > a) a = b;
}
template <typename T>
void update_min(T& a, T b) {
if (b < a) a = b;
}
class DisjointSet ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
#define llong long long
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#ifdef testing/*{{{*/
mt19937 rng(177013);
#else
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#endif
... |
// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
struct Dijkstra {
struct Edge {
int to;
T cost;
};
vector<int> prev;
vector<vector<Edge>> g;
Dijkstra(int n) : prev(n, -1), g(n) {}
void add_edge(int u, int v, T w) { g[u].push_back({v, w}); }
vector<T> b... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#inc... |
#include <bits/stdc++.h>
using namespace std;
#define MAX 1e9
int main(){
int n,m,a,b,c;
pair<int,int> x;
cin>>n>>m;
vector<pair<int,int>> lst[n];
for(int i=0; i<m; i++){
cin>>a>>b>>c;
lst[a-1].push_back({-c,b-1});
}
bool visited[n],exists;
for(int i=0; i<n; i++){
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto& e : a)
#ifdef LOCAL
#define logv(a) {cerr << #a << " = "; fore(e, a) {cerr << e <... |
#include <bits/stdc++.h>
using namespace std;
char A[303][303];
char tmp[303][303];
int main() {
int N; scanf("%d", &N);
A[0][0] = tmp[0][0] = 'A'; A[0][1] = tmp[0][1] = 'B';
for(int i = 2; i <= N; i++) {
for(int j = 0; j < 1 << i - 1; j++) A[0][j] = 'A';
for(int j = (1 << i - 1); j < 1 << i; j++) A[0][j] = '... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin>>N;
int64_t cnta=1,cntb=1;
int64_t i=3,j=5;
while(i<=N){
int64_t M=N-i;
while(j<=M){
if(j==M){
cout<<cnta<<' '<<cntb<<endl;
return 0;
}
cntb++;
j*=5;
}
cntb=1;j=5;
cnta++;i*=... |
#include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs ve... | #include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
using namespace std;
#define pq_max priority_queue<ll>
#define pq_min priority_queue<ll,vi,greater<ll>>
#define iint int
#define f(i,a,b) ... |
#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=510; //check the limits, dummy
int a[N];
int n, m;
char c[N];
set<char> s[N+N];
int main... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define rrep(i,a,b) for(ll i=a;i>=b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323846
#... |
/**
* author: zakhio (mttk1528)
* created: 13.03.2021 21:04:51
**/
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl
#... | #include <iostream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
#include <math.h>
//#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define ... |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define MO 1000000007
#define mem(a,s) memset(a,s,sizeof(a))
#define IOS ios_base::sync_with_stdio(0); cin.tie(NULL);
#define lop(i,s,e) for(int i=s;i<e;i++)
#define lopi(i,s,e) for(int i=s;i>=e;i--)
#define prina(a,n) ... | #include<bits/stdc++.h>
using namespace std;
#pragma region atcoder
/*#include <atcoder/all>
using namespace atcoder;*/
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma endregion
#pragma region macros
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<i... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char arr[101][101];
int i,n,m,x,y,count=0;
char ch;
cin>>n>>m>>x>>y;
for(i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>arr[i][j];
}
}
if(arr[x][y]=='.')
count++;
else if(arr[x][y]=='#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int h, w, x, y;
cin >> h >> w >> x >> y;
x--;
y--;
vector<string> mp(h);
for (int i = 0; i < h; i++) cin >> mp[i];
int ans = 0;
for (int i = x; i < h; ... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
int main(){
int n;
cin >> n;
vector<vector<int>> a(n,vector<int>(5));
vector<vector<int>> b(n,vector<int>(5));
rep(i,n){
... | #ifndef DEBUG
#define NDEBUG
#endif
#include <bits/stdc++.h>
#define def(v) int &v = e[i].v
#define cls(a) memset (a, 0, sizeof (a))
#define mset(a,b) memset (a, b, sizeof (a))
#define go(i,e,u,...) for (int i = (u), ##__VA_ARGS__; i; i = e[i].nt)
#define fir(i,a,b,...) for (int i = (a), ##__VA_ARGS__; i <= (b); ++... |
#include <bits/stdc++.h>
using namespace std;
int main(){
//freopen("vs.inp","r",stdin);
int a,b,T;
scanf("%d %d %d",&a,&b,&T);
T*=1000;
int s1=(T)/a;
int s2=(T+b-1)/b;
if((a+(T%a+s1-1)/s1)>b || (b-(T%b+s2-1)/s2)<a) printf("UNSATISFIABLE");
else printf("%d %d",s2,s1);
} | #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>
#include<vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> op(N);
int i;
char s[4];
for(i=0;i<N;i++) {
cin >> s;
if(s[0] == 'A')op[i] = 0;
else op[i] = 1;
}
vector<long long> dp0(N+1,0),dp1(N+1,0);
dp0[0] = dp1[0] = 1;
for(i=0;i<N;i++) {
if(op[... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, ... |
#include<bits/stdc++.h>
#include<string>
using namespace std;
const int N=1e3+10;
typedef long long ll;
int n,k,q,m,h,w;
const ll mod=998244353;
int a[N];
int b[N];
map<int,map<int,int> > mp;
set<int> se;
string s;
stack <int> st;
int X[]={-1,-1,-1,0,0,1,1,1};
int Y[]={-1,0,1,-1,1,-1,0,1};
int main()
{
int r1,c... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) ::std::begin(x), :... |
/*
Remember, Hope is a good thing... May be the best of things... and No Good thing ever Dies !!!
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios::sync_with_stdio(0); cout.tie(0);
#define endl "\n"
#define MOD1 1000000007
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl... | //JOY SREE RAM
//JOY SREE GANESH
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define all(v) begin(v),end(v)
#define vs vector<string>
#define ll long long
#define all(v) begin(v),end(v)
#define vs vector<string>
#define qi queue<int>
#define pqi ... |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pair<int, int>>;
using pl = pair<ll, ll>;
using vl = vector<ll>;
#define all(v) (v).begin(), (v).end()
#define ar array
#defin... | #include <bits/stdc++.h>
#define tez ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mb make_pair
#define el "\n"
#define MAX 100005
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output... |
/*
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<cstdio>
#include<vector>
int w[15];
struct Element{
int l,v;
};
struct Edge{
int v,w;
Edge(int v,int w):v(v),w(w){}
};
std::vector<Edge>g[15];
int f[15];
Element e[100005];
int seq[15];
int vis[15];
int pos[15];
int ans = -1;
int dis[1<<10];
void dfs(int p,int n,int m){
if(p==n+1){
for... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <numeric>
#include<cctype>
#include<deque>
#include<iomanip>
#include<queue>
#include<cstring>
#include<stack>
#include... | #include <bits/stdc++.h>
#define REP(i, n) for(int i=0; i<(int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b; return true;} return false;}
using namespace std;
i... |
#include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ?... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
int main(void)
{
int n, k;
cin >> n >> k;
map<long, long> mp;
vector<long long> veca;
vector<long long> vecb;
for (int i = 0; i < n; i++)
{
long long a, b;
cin >> ... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
typedef long long ll;
typedef std::pair<int, int> Pii;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define scan(any) for(auto &i:any) cin>>i;
#define print(any) for(auto i:any) cout<<i<<" ";
#define endl '\n'
#define pb push_back
#define vll vector<ll>
#define f(i,x,y) for(i=x;... |
#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#pragma war... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
signed main(){
int N ; cin>>N;
vec_int A(N), B(N); rep(i,N)cin>>A.at(i)>>B.at(i);
int ans = INT_MAX;
for... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... | // Author: param3435
#include <bits/stdc++.h>
#pragma GCC optimize ("-O2")
using namespace std;
#define LL long long
#define LD long double
#define divisor 1000000007
#define INFP LLONG_MAX
#define INFN LLONG_MIN
#def... |
#include <cstdlib>
#include<iostream>
#include<string>
#include<cmath>
#include<vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
void GP(){
int N;
cin >> N;
int x[N],y[N];
rep(i,N){
cin >> x[i] >> y[i];
}
int ans=0;
rep(i,N){
rep(j,i){
... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vec... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
int main(){
/* long double n;
cin>>n;
long long unsigned t = n;
cout<<t;
stringstream ss;
ss<<n;
string s;
ss>>s;
long long a = (s.size());
long long x = 0;
while(x<a){
if(s[x]=='.'){... |
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int main(){
long S, P, M;
int N = 0;
cin >> S >> P;
for(M = 1; M <= sqrt(P); M++){
if(P%M == 0){
if(P/M + M == S){
N = 1;
break;
}
}
}
if(N == 1) cout << "Yes" << endl;
else cout << "No" << endl;
... | // C++ includes
#include <bits/stdc++.h>
// 俳句
using namespace std;
// alias templates
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
// alias declaration
using ll = long long;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vs = V<str>;
// loops
#define FOR(i, a, b... |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;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 ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
long long dp[65][2];
int main()
{
dp[0][1] = 1;
dp[0][0] = 1;
int int_n;
scanf("%d",&int_n);
for(int i = 1; i <= int_n; i++)
{
string s;
cin >> s;... |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
# define drep(i,a,b) for(int i=(a); i>=(b); --i)
typedef long long int_;
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; ... | #include<bits/stdc++.h>
#define f first
#define s second
#define int long long
using namespace std;
const int N=3e3+5,mod=1e9+7;
int t,a[N],pref[N],dp[N][N],n;
vector<int>c[N];
main(){
cin>>n;
for(int i=1;i<=n;i++){
cin >> a[i];
pref[i] = pref[i-1] + a[i] ;
}
dp[0][0] = 1;
int ans = 0;
for(int i=1;i<=n;i++) ... |
#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define Yes "Yes"
#define No "No"
#define DEFAULT LL ans=solve();\
if(ans==NONE){\
}else{\
cout << ans << endl;\
}
#define YESNO three(solve(),(OUT(YES),1),(OUT(NO),0))
#define YesNo three(solve(),OUT(Yes),OUT(No))
#define ECHO OUT(solve())
#define thr... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e2 + 5;
int a[MAXN], b[MAXN];
int main(void)
{
int n;
scanf("%d",&n);
for(int i=1; i<=n; ++i) scanf("%d%d",&a[i],&b[i]);
static int seq... |
/*n=2:1,3, 3,1
n=3:1,3,6,7, 6,3,1
n=4:1,3,6,10,12, 12,10,6,3,1
n=5:1,3,6,10,15,18,19, 18,15,10,6,3,1
n=6:1,3,6,10,15,21,25,27, 27,25,21,15,10,6,3,1
n=7:1,3,6,10,15,21,28,33,36,37, 36,33,28,21,15,10,6,3,1
n=8:1,3,6,10,15,21,28,36,42,46,48, 48,46,42,36,28,21,15,10,6,3,1
*/
#include<bits/stdc++.h>
using namespace std;
ty... | #include <bits/stdc++.h>
using namespace std;
const int MN = 200 + 5;
int dp[MN][MN][4], a[MN];
array<int,3> from[MN][MN][4];
long long f(int x) {return (long long)x * (x+1) / 2;}
int main () {
int n; long long k,sofar = 0;
scanf ("%d %lld",&n,&k);
for (int c = 0; c <= 3 * (n-1); c++) {
int low = max(0,c - (n - 1)... |
#include<iostream>
using namespace std;
int main()
{
int n, w;
int count;
cin >> n >> w;
count = n / w;
cout << count << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define endl "\n"
#define maxpq priority_queue<ll>
#define minpq priority_queue<ll, vector<ll>, g... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
class RangeMexQuery {
private:
int n, m;
vector<array<int, 3> > ptr;
vector<int> arr, st;
int update(const int prv, const int id, const int val, const int l,
... | #include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... |
#include<cstdio>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
using namespace std;
const int N=2e5+5;
template<typename T>void read(T &x)
{
bool neg=false;
unsigned char c=getchar();
for(;(c^48)>9;c=getchar())if(c=='-')neg=true;
for(x=0;(c^48)<10;c=getchar())x=(x<<3)+(x<<1)+(c^48);
if(neg)x=-x;
}
int n,f[... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const long long mod = 1000000007;
// const long long mod = 998244353;
int main(void){
int t;
cin >> t;
while(t--){
long long n, a, b;
cin >> n >> a >> b;
if(a+b > n){
cout << 0 << endl;
... |
#include <bits/stdc++.h>
#define arr array
#define pb push_back
#define fs first
#define sc second
#define eb emplace_back
#define vt vector
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
using namespace std;
typedef long... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
#define debug(x) cerr << #x << '=' << x <<'\n'
#define rep(i, b, n) for (int i = b; i <= n; i++)
const int N = 1123456;
int n, m, a, b;
char s[N];
int main(void) {
scanf("%s", s + 1);
int len = strlen(s + 1);... |
#include <bits/stdc++.h>
using namespace std;
int maxN = 100000, N, M;
vector<vector<pair<int,int>>> G(maxN,vector<pair<int,int>>(0));
vector<int> A(maxN,-1);
void dfs(int u, int pre, int e){
if(G[pre][e].second == A[pre]){
A[u] = G[pre][e].second + 1;
if(A[u]>N) A[u] = 1;
}
else A[u] = G[pre][e].second... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#include<ctime>
#include<cstdlib>
#include<fstream>
#define INF 1001001001001001001
#define MAX 50000001
#define rep(i,n,m) for(int i=... |
/*Allah Vorosha*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define uniq(v) v.resize(distance(v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<(n);i++)
using ll = long long;
const ll INF = 1e9+7;
const ll mod=1000000007;
using P = pair<ll, ll>;
int main(){
int n;
string s;
cin >> n >> s;
ll ans =0;
for(int i=0; i<n; i++){
map<char,int> ma;
for(int... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... | #include <bits/stdc++.h>
using namespace std;
#define NFS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fr(i,a,b) for(ll i=a; i<b; i++)
#define rf(i,a,b) for(ll i=a; i>=b; i--)
#define endl "\n"
#define err() cout<<"=================================="<<endl;
#define errA(A) for(auto i:A) cout<<i<<"... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
int pw(int a,int t=mod-2){
int x=1;
while(t>0){
if(t&1)x=x*a%mod;
a=a*a%mod,t/=2;
}
return x;
}
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int n,m,s=0,ans=1;
cin >> n >> m;
... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const int mod = 998244353;
int inc(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
namespace math
{
int qpow(int a, int x, int mo)
{
int res = 1;
while (x)
{
if (x & 1)
res = 1ll ... |
#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;
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
const int N = 2e5+5;
const int MOD = 1e9+7;
void solve(){
int n;
cin>>n;
vector<pair<pair<ll,ll>,int> > f,s;
for(int i=0;i<n;i++){
ll x,y;
cin>>x>>y;
f.pb({{x,y},i});
s.p... |
/******************* This is ZerothKing *******************/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for(int i = int(a); i < int(b); i++)
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define end... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
using namespace std;
const int nax = 1e6 + 5;
char ans[nax];
void solve(){
string s; cin >> s;
int lo = nax / 2;
in... |
#include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T f=0,x=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
#define int long long
namespace run{
const int N=4e5+9;
int head[N],nex[N],to[N],cnt;
inline void add(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T>
void view_1d(vector<T> V, string sep) {
for (ll i=0; i<V.size(); i++) {
cout << V[i];
if (i == V.size() - 1) {
cout << endl;
} else {
cout << sep;
}
}
}
template<typ... |
#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>
... | /*
Motto - Try Hard To become **MASTER** ;-)
*/
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
//define
#define rep(i,n... |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_ba... | #include <cstdio>
#include <cstring>
#include <algorithm>
#define cs const
#define il inline
#define max_n 3000
#define mod 998244353
using namespace std;
typedef long long ll;
typedef cs int& ci;
int dp[max_n+1][max_n<<1|1];
int main(){
int n,k;
scanf("%d%d",&n,&k);
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=... |
#include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdio>
#include <iomanip>
#include <utility>
#include <unordered_map>
... | #include <iostream>
using namespace std;
int main()
{
int N,K,M,total,test,sum=0;
cin>>N>>K>>M;
int A[N];
for(int i=0;i<N-1;i++)
cin>>A[i];
for(int i=0;i<N-1;i++)
sum=sum+A[i];
total=sum/N;
test=(sum+K)/N;
if(total>=M)
cout<<"0";
else if(test<M)
cout... |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
using pll = pair<int, int>;
int n;
string nums, turn;
vector<vector<int>> dp;
void dfs(int i, int num) {
if (i == n) {
if (num % 7 == 0) dp[i][num] = true;
else dp[i][num] = false;
return;
}
... | // I solemnly swear that I am upto no good //
#include <bits/stdc++.h>
#define sub freopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);
using namespace std;
#define ll long long
#define ld long double
#define ttime cerr << '\n'<<"Time (in s): " << double(clock() - clk) * ... |
#include <bits/stdc++.h>
/*#include <iostream>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <sstream>*/
#define ll long long
#define fop(i,m,n) for(ll i=m; i<n; i++)
#define fastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define X first... | #include <iostream>
using namespace std;
using lint = long long;
void solve() {
int n;
cin >> n;
lint ma = 0, sum = 0, ans = 0;
for (int k = 1; k <= n; ++k) {
lint a;
cin >> a;
ma = max(ma, a);
sum += a;
ans += sum;
cout << ans + ma * k << "\n";
}... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n;
cin>>n;
long long int sa=floor(-(long double)1/2 + sqrt((long double... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.