code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
//ABHISHEK AGRAWAL,BIT mesra//
//Newbie......You have to be odd to be no. ONE :)//
//Authhor: Abhishekagrawal
//Date: 20/02/2021
//Time: 17:30:13
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
freopen(x".out","w",stdout);
#define pb push_back
int read(){
int x = 0,sgn = 1;char ch = getchar();
fo... |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#define ppld pair <pld, pld>
#define ppll pair <pll, pll>
#define pldl pair <ld, ll>
#define vll vector <ll>
#d... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
priority_queue<int> pq;
for(int i=0;i<a;i++){
int c;
cin>>c;
pq.push(c);
}
while(pq.size()){
if(pq.top()!=a){
cout<<"No";
return 0;
}
pq.pop();
... |
#include "bits/stdc++.h"
using namespace std;
//#include "atcoder/all"
//using namespace atcoder;
#define int long long
#define REP(i, n) for (int64_t i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int64_t i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int64_t i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for ... | #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 << " : " ... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ud unsigned int
#define ll long long
#define ull unsigned long long
#define MAX_INF 0x3f
#define MAX_INF_VAL 0x3f3f3f3f
#define MAX_INF_VAL_LL 0x3f3f3f3f3f3f3f3f
//#define pi 3.141592653589
#define eps 1e-9
#define F(x) ((x)/3+((x)%3==1?0:tb))
#define G(x) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se secon... |
#include <iostream>
int main(){
int a, b, c;
std::cin >> a >> b >> c;
std::cout << (21-(a+b+c)) << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << b - c << endl;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=22;
const int M=110;
#define pii pair<int,int>
using ll=long long;
#define mp make_pair
#define mid (l+r>>1)
vector<vector<int> > v(N);
vector<int> status(1<<N,0);
inline int read() {
char c = getchar();
int x = 0, f = 1;
while (c < '0' || c > '9') ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
long long a = n;
long long b = 0;
long long c = 0;
while(a!=0){
a = a/1000;
if(a == 0) break;
b ++;
}
if(b == 1){
c = n-1000;
}
if(b == 2){
c = n-1000000;
}
if(b == 3){
... | #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;
// using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
void __dbg() { cout << endl; }
template<typename Arg, ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> arr, fact;
#define mod 998244353
// (1/a)%p = (pow(a,p-2))%p
void precalc()
{
fact[0] = 1;
fact[1] = 1;
for (int i = 1; i <= 300; i++)
{
fact[i] = (i * fact[i - 1]) % mod;
}
}
ll power(ll a, ll b)
{
ll res = 1;... | #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... |
/////home/mohammed/.config/sublime-text-3/Packages/User
/*input
*/
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <math.h>
#include <sstream>
#include <iterator>
#include <cstdlib>
#include <unordered_map>
#include <map>
#include <li... | #include<bits/stdc++.h>
using namespace std;
int main() {
int t;
t=1;
while(t--){
int n; cin>>n;
string str;
bool is = false;
unordered_set<string> st;
for(int i=0;i<n;i++){
cin>>str;
if(str[0] == '!'){
if(st.find(str.substr(1))... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define sz(a) int(a.size())
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_... | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int H, W;
cin >> H >> W;
vector<string> S(H);
rep(i, H) cin >> S[i];
int count = 0;
rep(i, H)
{
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int r = r2 - r1, c = c2 - c1;
if (r == 0 && c == 0) {
cout << 0 << endl;
} else if (r == c || r == -c || abs(r) + abs(c) <= 3) {
cout << 1 << endl;
} else if ((r ^ c ^ 1) & 1) {
cout << 2 << endl... | #include<bits/stdc++.h>
#define ll long long
#define int ll
#define mp make_pair
#define pii pair<int,int>
#define pb push_back
#define r1 rt<<1
#define r2 rt<<1|1
#define fi first
#define se second
#define db double
#define ld long db
#define ri register int
#define rep(i,a,b) for(ri i=(a);i<=(b);++i)
#define rep2(i,a... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
int main()
{
int kk;
cin >> kk;
int64_t count=0;
int i,j,k;
for (i=1;i<=kk;++i)
{
for (j=1;j<=kk;++j)
{
for (k=1;k<=kk;++k)
{
if (i*j*k<=kk)
{
++count;
}
else
{
break;
... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define REP(w, n) FOR(w, 0, n)
using namespace std;
typedef long long ll;
/* UnionFind：素集合系管理の構造体(union by size)
isSame(x, y): x と y が同じ集合にいるか。 計算量はならし O(α(n))
unite(x, y): x と y を同じ集合にする。計算量はならし O(α(n))
treeSize(x): x を含む集合の要素数。
*/
s... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... | #include <bits/stdc++.h>
#define maxn 100086
using namespace std;
typedef long long ll;
int n, m, a, b;
ll f[1 << 4][6][10];
int main(){
scanf("%d%d%d%d", &n, &m, &a, &b);
if(n < m) swap(n, m);
f[0][1][0] = 1;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= m;j++){
for(int k = 0;k < (1 << m);k++){
for(in... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int X = (A + B) / 2, Y = (A - B) / 2;
printf("%d %d\n", X, Y);
return 0;
} | /*
=============================================================
------------------Welcome To My Code-------------------------
---------Ankit Kumar || IIITBH || CSE || 2018-2022-----------
=============================================================
*/
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxN = 2e5+10;
int X[maxN],Y[maxN];
struct node
{
int k1,b1,k2,b2;
bool swap;
node(){k1=k2=1;b1=b2=0;swap=false;}
node(int a,int b,int c,int d,bool e){k1=a,b1=b,k2=c,b2=d,swap=e;}
node clockwise()
{
if(!swap)re... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
//#define ACL
#ifdef ACL
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#if __has_include("acl-all.h")
#include "acl-all.h" //on Wandbox
using namespace atcoder;
#endif
#endif //#ifdef ACL
typedef long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool solve() {
ll N;
cin >> N;
string S, X;
cin >> S >> X;
vector<vector<int>> win(N+1, vector<int>(7)); // 1:win
win[N][0] = 1;
ll b = 1;
for ( int i = N-1; i >= 0; i-- ) {
ll c = S[i] - '0';
if ( X[i] ... |
#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a == b) cout << c << endl;
else if(b == c) cout << a << endl;
else if(c == a) cout << b << endl;
else cout << 0 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll n, t, m, res = 0;
cin >> n >> t;
vector<ll> a, b;
for (int i = 0; i < n; i++) {
ll x; cin >> x;
if (i & 1) {
b.pus... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = 10e7+7;
#define rep(i,n) for(int i=0;i<n;i++)
const double pi = acos(-1);
const ll MOD = 1000000007;
ll cnt =0,ans=0;
typedef pair<int , int > P;
//cout << setprecision(11) << fixed;
const int di[] = {0,0,-1,1};
const int dj[] = {1,-1,0... |
#include<bits/stdc++.h>
using namespace std;
// #define LOCAL
typedef long long ll;
#ifdef LOCAL
const int N = 105;
#else
const int N = 2e5 + 105;
#endif
const int INF = 0x3f3f3f3f;
int n, k, tot = 0, Mid;
vector<int> edge[N];
int f[N]; // 离最远的未被覆盖的关键点
int g[N]; // 离最近的已经选择的点
void dfs(int u, int fa){
f[u] ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
struct tree{
vector<vector<int>> G,son,ancestor;
vector<int> depth,parent;
queue<int> que;
int n,root=-1;
bool made_lca=false;
tree(int n_):G(n_),son(n_),parent(n_,-1),depth(n_,-1),ances... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... | #include <algorithm>
#include <climits> // FOO_MAX, FOO_MIN
#include <cmath>
#include <cstdlib> // abs(int)
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define roundup(n, d) (((n) + ((d)-1))... |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<stack>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
#include<bitset>
using namespace s... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include<bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf ... |
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define sz(a) ((int) a.size())
#define vi vector<int>
using namespace std;
const int N = 5e5 + 7, inf = 1e9 + 7;
int n, a[N];
ll m;
int main() {
ios::sync_with_stdio(fals... | #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... |
#pragma GCC optimize("Ofast")
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define _roverload(_a1, _a2, _a3, name, ...) name
#d... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
inline int read () {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') t = -1, c = getchar();
while (c >= '0' && c <= '9') ret = ret * 1... |
#include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int MOD = 998244353;
/* struct for mod Calculation*/
struct mint {
ll x;
mint(ll x = 0):x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
... | #include <bits/stdc++.h>
using namespace std;
/*
* @title ModInt
* @docs md/util/ModInt.md
*/
template<long long& mod> class ModInt {
public:
long long x;
constexpr ModInt():x(0) {}
constexpr ModInt(long long y) : x(y>=0?(y%mod): (mod - (-y)%mod)%mod) {}
ModInt &operator+=(const ModInt &p) {if((x +=... |
#include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;
ll N,... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define sz(a) int(a.size())
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
const int M=2e5+5,P=1e9+7,base=269;
inline int rd(){
int x=0;char c=getchar();
while(!isdigit(c))c=getchar();
while(isdigit(c))x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x;
}
int n,A[M],B[M],c[M];
map <int,queue <int> > Q;
void update(int x,int v){
... |
// Author : Naresh Bharasagar
// Instt. : Indian Institute of Technology Guwahati
//--------------------------------------------------------------------------------------------------------------------------------
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
u... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
string a, b;
for(int i = 0; i < n; i++) {
a += s[i];
}
for(int i = n; i < 2 * n; i++) {
b += s[i];
}
... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define... | #include <iostream>
using namespace std;
int main()
{
int n,y;
cin>>n>>y;
cout<< n/y;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,c;
cin >> n >> c;
long long a[n][3];
for(long long i=0;i<n;++i){
for(int j=0;j<3;++j){
cin >> a[i][j];
}
}
map<long long, long long> m;
for(int i=0;i<n;++i){
m[a[i][0]]+=a[i][2];
m[a[i][1]+1]+=(-a[i][2]);
}
... | #include<bits/stdc++.h>
using namespace std;
vector<int> Times;
int a[200200],b[200200];
long long c[200200];
long long delta[400400];
int main()
{
int N;
long long C;
cin>>N>>C;
for(int i=0;i<N;i++)
{
cin>>a[i]>>b[i]>>c[i];
b[i]++;
Times.push_back(a[i]);
Times.push_back(b[i]);
}
sort(Time... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#d... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
int vdncjdkdkh;
cin>>n>>m;
vector<pair<int,int>>a(m);
for(int i=0;i<m;i++)
{
cin>>a[i].first>>a[i].second;
}
int k;
cin>>k;
vector<pair<int,int>>b(k);
for(int j=0;j<k;j++)
{
... |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (a); i <= (b); ++ i)
#define per(i, a, b) for(int i = (a); i >= (b); -- i)
#define pb push_back
#define Pii pair<int,int>
#define fi first
#define se second
typedef double db;
typedef long long ll;
using namespace std;
const ll N = 110;
const ll P = 9982443... | #include <bits/stdc++.h>
using namespace std;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vb = vector<bool>;
VVi tree;
int depth[110];
int par[110];
int done[110];
void dfs(int u, const VVi& gr, Vb& ex) {
for (int v : gr[u]) {
if (!ex[v]) {
ex[v] = true;
par[v] = u;
tree[u][v] = 1;
... |
#include <bits/stdc++.h>
using namespace std;
using s64 = signed long long;
using u64 = unsigned long long;
using f128 = long double;
int main()
{
u64 h, w;
cin >> h >> w;
vector<vector<u64>> a;
for(u64 i = 0; i < h; i++)
{
a.push_back(vector<u64>());
for(u64 j = 0; j < w; j++)
... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define forn(i,n) for(int i = 0; i < n; i++)
int32_t main() {
int n, q, k; cin >> n >> q;
vector<int> a(n);
forn(i, n) cin >> a[i];
vector<int> ps(n);
ps[0] = a[0] - 1;
forn(i, n - 1) ps[i + 1] = ps[i] + a[i + 1] - a[i] - 1;
... |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define ull unsigned long long
#define ld long double
#define mod 1000000007
#define EULER 2.7182818284
#define INF 1000000000
#define pb push_back
#define ins insert
#def... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr << ... |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
ll NUM = 10000;
ll input(){
double tmp;
scanf("%lf",&tmp);
tmp *= NUM;
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
const double pi = 2.0 * asin(1.0);
ll dx[4] = {1, 0, -1, 0};
ll dy[4]... |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
if(n%2 == 0)
cout<<"White"<<endl;
else
cout<<"Black"<<endl;
return 0;
}
| #include<bits/stdc++.h>
#define ntest 0
using namespace std;
int n;
void solve() {
cin >> n;
if (n&1) cout << "Black";
else cout << "White";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
if(ntest){
int t;
cin >> t;
while(t--) solve();
} else {
solve();... |
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MAX 100050
#define ll long long
#define ld long double
#define lli long long int
#define pb push_back
#define INF 100000000000000
#define mod 998244353
// trignometric funct... | #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 pbds tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
#define MOD 998244353
#define int long long int
#define fastIO ... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main(){
int n,x;
cin >> n >> x;
double sum = 0;
rep(i,n) {
int v,p;
cin >> v >> p;
sum += v * p;
if(sum > x * 100){
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <functional> // for less
#include <iostream>
usin... |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
template <typename Arg1>
void prn(Arg1&& arg1) { cout<<arg1<<"\n";}
temp... | #include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 1e6+10,mod = 1e9+7;
int a,b,x,y,f[maxn][2];
int main() {
cin >> a >> b >> x >> y;
f[a<b?a:b][a<b?0:1] = 0;
f[a<b?a:b][a<b?1:0] = x;
for(int i = min(a,b)+1; i <= max(a,b); i++){
f[i][0] = min(f[i-1][0]+y,f[i-1][1]+x);
f[i][1] = min(f... |
#include<bits/stdc++.h>
#define ull unsigned long long
# define ll long long
# define mod 1000000007LL
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll arr[63][63];
for(int i=0;i<63;i++)
{
for(int j=0;j<=i;j++)
{
if(i==j)
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<string>
using namespace std;
int main()
{
int n,q;
string s,s1,s2;
cin >> n >> s >> q;
int t,a,b;
for(int i=0;i<n;i++){
s1+=s[i];
s2+=s[i+n];
}
for(int i=0;i<q;i++){
cin >> t >> a >> b;
if(t==1){
if(b<=... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb pus... | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
a +=b;
if(a>=15&&b>=8){
cout<<1;
}else if(a>=10&&b>=3){
cout<<2;
}else if(a>=3){
cout<<3;
}else{
cout<<4;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
#define F first
#define S second
typedef long long ll;
const int dx[4] = {1,0,-1,0};
con... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#include <functional>
#include <queue>
using namespace std;
typedef long long ll;
using pii = pair<int, int>;
int main(){
string s;
cin >> s;
int n = s.length();
// vector<string> res;
// int p = 0;
// for (int i = ... |
#include<bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
int tt,n,inf=1e15;
void solve(){
cin>>n;
int a[n+1],ans=0;
a[0]=0;
map<int,int> m;
m[0]=1;
for(int i=1;i<=n;i++){
int x;cin>>x;
if(i%2)a[i]=a[i-1]-x;
else a[i]=a[i-1]+x;
m[a[i]]++;
}
// for(int i=0;i<=n;i++)cout<... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
void solve() {
int n;
double ans = 100000000000000000.0;
cin >> n;
vector< int > v(n);
unordered_map<int,int> pref;
double sum = 0;
for ( int i=0; i<n; i++ ) {
cin >> v[i];
sum +... |
// Always remember that you are absolutely unique, just like everyone else!
#include <iostream>
#include <vector>
using namespace std;
// DEBUGGING SECTION
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print... | #include <cstdio>
#define MOD 200
using namespace std;
int cnt[MOD];
int main()
{
int n;
scanf("%d", &n);
long long ans = 0LL;
while(n--)
{
int x;
scanf("%d", &x);
ans += cnt[x %= MOD] ++;
}
printf("%lld\n", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
double v,t,s,d;
cin>>v>>t>>s>>d;
double cur = d/v;
if(cur<t || cur>s)
cout<<"Yes\n";
else
cout<<"No\n";
return 0;
} | /******************************************************/
/******************************************************/
/** **/
/** BISMILLAHIR RAHMANIR RAHIM **/
/** REAZ AHAMMED CHOWDHURY - reaziii **/
/** Department of Computer Science... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
struct edge {
ll to; // 辺の行き先
ll weight; // 辺の重み
edge(ll t, ll w) : to(t), weight(w) { }
};
using Graph = vector<vector<ll>>;
using WeightedGraph = vector<vector<edge>>;
#define rep(i, n)... | #include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
#ifdef ENV_LOCAL
#define dump if (1) cerr
#else
#define dump if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32_t... |
#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;
const ll MOD = /*1'000'000'007LL;*/ 998'244'353LL;
#define pb push_back
#define mp make_pa... | // @includes_template
#ifndef INCLUDES_H
#define INCLUDES_H
#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#define s64i long long
#define u64i unsigned long long
#define pb push_back
#define ppb ... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
#define F first
#define S second
#define inf 1e16
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n; cin >> n;
ll price = floor(1.08*n);
if(price < 206){
cout << "Yay!\n";
} else... | #include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
long long n;
long long maxn;
priority_queue<long long,vector<long long>,greater<long long> > q;
int main()
{
scanf("%lld",&n);
for(long long i=1;i<=sqrt(n);i++)
{
if(n%i==0)
{
q.push(i);
maxn++;
if(n!=i*i)
{
... |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#def... | #include<bits/stdc++.h>
#define ll long long
using namespace std ;
void solve()
{
ll l , r ; cin>>l>>r ;
if(r-l*2>=0){
cout<< (r-2*l+1) * (r-2*l+2) / 2 <<endl;
}else {
cout<< 0 <<endl;
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
... |
//thanks God For Every Thing!
//contest link:
#include<bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#define pi acose(-1)
#define flush cin.ignore(numeric_limits<streamsize>::max(),'\n');
#define fasterio ios_base... | #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(){
string s;
cin >> s;
vector<int> a(10);
rep(i, s.length()){
a[s.at(i)-'0']++;
}
int st = 0;
int end = 0;
int t = 0;
if(s.length() == 1){
st = 1; end = 2;... |
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <algorithm>
#include <iostream>
#include <bitset>
#include <vector>
#include <array>
using namespace std;
#define f(x,y,z) for(int x=y;x<=z;++x)
vector<int> v[200001];
int n, a, b, it;
array<int, 200001> jr, dlm, nmr;
bitset<200001> sdh;
void jrk(int x) {
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=b;i++)
const int Nmax=2e5+9;
int N;
string S[Nmax];
map <string,int> M;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>N;
REP(i,1,N) cin>>S[i];
REP(i,1,N) {
if (S[i][0]!='!') M[S[i]]=1;
}
REP(... |
# define _GLIBCXX_DEBUG
# define rep(i, n) for (int i=0; i<(int)(n); i++)
# define FOR(i,a,b) for(int i=(a);i<=(b);++i)
# define ALL(a) (a).begin(), (a).end()
# define COUT(x) cout << (x) << endl;
# define KAI() cout << endl;
# define INF 10000000000000000LL
typedef long long ll;
# include <iostream>
# include <string>... | #include<bits/stdc++.h>
using namespace std;
int main(){
long double x,y,r;
cin>>x>>y>>r;
long long ans=0;
r+=1e-14;
for(long long i=ceil(x-r);i<=floor(x+r);i++)
{
long double t=sqrt(r*r-(i-x)*(i-x));//r'
ans+=(floor(y+t))-(ceil(y-t))+1;
}
cout<<ans;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n" //interactive
#define fi first
#define se second
#defin... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main(){
int t = 1; cin >> t;
while(t--){
int n; cin >> n;
vector<int> a(n);
for(auto &x:a)
cin >> x;
sort(a.begin(),a.end());
if(n%2)
{
cout << "Second\n";
... |
#include<bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
constexpr int INF=1e9;
struct edge{int to,cost;};
bool chmin(int&a,int b){return a>b?a=b,true:false;}
int main(){
int H,W; cin>>H>>W;
vector<vector<int>>A(H,vector<int>(W-1)),B(H-1,vector<int>(W));
for(int i=0;i<H;i++)for(int j=0;j<W-1;j++)cin>>A... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... | /*Author--Vishwas Agrawal*/
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define vll vector<ll>
#define pb push_back
#define mp m... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (decltype(n) i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (decltype(n) i = 1, i##_len = (n); i <= i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pl(... | #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... |
#include<bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | //12252024832524
#include <cstdio>
#include <cstring>
#include <algorithm>
#define TT template<typename T>
using namespace std;
typedef long long LL;
const int MAXN = 205;
int n;
int dp[MAXN * MAXN],ID[MAXN * MAXN],pre[MAXN * MAXN];
int ans[MAXN],ling1,ling2;
LL Read()
{
LL x = 0,f = 1;char c = getchar();
while(c ... |
#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;
}
int n,tot;
vector<int> g[1010];
void add(int x,int y) {
x++,y++;
... | #include <bits/stdc++.h>
#define int long long
#define menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define BE(i) i.begin(),i.end()
#define fi first
#define se second
#define INF 2147483646
#define mkp make_pair
#define ist insert
#define mod 10... |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<chrono>
using namespace chrono;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define endl "\n"
#define forn(... | #include <cstdio>
const int N = 2505;
int n, ans[N] = {0, 6, 10, 15}, tot, flag[10005];
int main() {
scanf("%d", &n);
tot = 3;
for(int i = 1; i <= 3; i++) {
for(int j = ans[i]*2; j+ans[i] <= 10000; j += ans[i]) {
if(flag[j]) continue; flag[j] = 1;
ans[++tot] = j;
if(tot == n) break;
}
if(tot == n) bre... |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b)
cout<<a<<endl;
else
cout<<3-a-b<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b; cin >> a >> b;
if (a > b) swap(a, b);
if (a == b) cout << a << '\n';
else if (a == 0 and b == 1) cout << 2 << '\n';
else if (a == 0 and b == 2) cout << 1 << '\n';
else cout << 0 << '\n';
... |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i ... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N;
int Ai[100];
int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
int p_best = -1, p_best_count = 0, p_count;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> Ai[i];
}
for (int j = 0; ... | #include<iostream>
#include<cstdio>
#include<ctime>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<vector>
#include<iomanip>
#include<fstream>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<sstream>
using namespace std;
#define sync std::ios::sync... |
#include <bits/stdc++.h>
using namespace std;
void solve(int64_t b) {
int64_t answer = 0;
for (int64_t a = 1; a <= 1000000; a++) {
stringstream ss;
ss << a << a;
istringstream iss(ss.str());
int64_t c;
iss >> c;
if (c <= b) {
answer++;
}
}
cout << answer << endl;
}
int main(... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vld = vector<ld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
constexpr ll inf = 3001001... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=b;i++)
using LL = long long;
const int Nmax=2e5+9;
int N,A[39],S,ans=INT_MAX,tmp1,tmp2;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>N;
REP(i,1,N) cin>>A[i];
S=(1<<(N-1))-1;
REP(k,0,S) {
tmp1... | //#pragma GCC optimize ("O3", "unroll-loops")
//#pragma GCC target ("avx2")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define all_of(v) (v... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
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); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) ... |
#include<bits/stdc++.h>
using namespace std ;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define ar array
#define inf() ifstream cin("d.txt")
#define onf() ofstream cout("test.txt")
#define mod 1000000007
#define pb push_back
#def... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxl=2e5+10;
const int mod=1e9+7;
int n,k;
int a[maxl];
ll dp[maxl][17][2][2];
char s[maxl];
inline ll dfs(int pos,int st,bool up,bool lead)
{
int cnt=__builtin_popcount(st);
if(cnt>k) return 0;
if(pos>n) return cnt==k && lead;
ll &ret=... | #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... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
using namespace std;
const int N=1e3+9;
const int Inf=1e9;
char s[N],t[20]={"atcoder"};
int main(){
int T;
scanf("%d",&T);
rep(Tcase,1,T+1){
scanf("%s",s);
int n=strlen(s);
int ans=Inf,sum=0;
re... | #include<bits/stdc++.h>
using namespace std;
using d = int;
using ll = long long;
using ud = unsigned int;
using ull = unsigned long long;
using lf = double;
using llf = long double;
using ch = char;
using st = string;
using bl = bool;
using vo = void;
#define ci cin
#define co cout
#define fi( x, n ) for( d i = x;... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
while(t--){
long long n;
cin>>n;
long long s=0,ans=0;
for(long long i=1;i*i<=2*n;i++){
s+=i-1;
long long x=s%i;
if(n%i==x) ans++;
}
cout<<ans*... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s[3];
map<char,int>bj;
map<char,int>num;
int a[12]={0};
char c[12]={0};
int n=0,ok=0;
ll x[3];
void solve(int k){
//cout<<k<<endl;
if(k==n){
for(int i=0;i<3;i++){
x[i]=0;
for(int j=0;j<s[i].size();j++){
x[i]=x[i]*10+num[s[i][j]];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<pll> vll;
typedef vector<vl> vvl;
#define fori(i, n) for (in... |
//in dp prefix suffix sum helps..
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<stack>
#include <chrono>
#include <random>
#include <iterator>
#include <map>
#include<list>
#include <algorithm>
#include <fstream>
#include<unordered_map>
#include<se... | // *********************************************************************************
// * MURTAZA MUSTAFA KHUMUSI *
// * CSE - 2019-2023 *
// **************************************************************... |
#include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);... | #include <bits/stdc++.h>
using namespace std;
// clang-format off
#define range(i, l, r) for ( int i = (int)(l); i < (int)(r); (i) += 1 )
#define rrange(i, l, r) for ( int i = (int)(r)-1; i >= (int)(l); (i) -= 1 )
#define debug(x) cerr << "(" << __LINE__ << ") " << #x << ": " << (x) << endl;
template <typename T1, typ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
vector<int> par(10010, 0);
vector<int> Rank(10010, 0);
void init(int n) {
for(int i = 0; i < n; i++) {
par.at(i) = i;
Rank.at(i) = 0;
}
}
int find(int x) {
if(par.at(x) =... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <cmath>
using namespace std;
using VI = vector <int>;
using VLL = vector <long long>;
using VVLL = vector <VLL>;
usin... |
// Problem: F - Range Xor Query
// Contest: AtCoder - AtCoder Beginner Contest 185
// URL: https://atcoder.jp/contests/abc185/tasks/abc185_f
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll... |
#include<bits/stdc++.h>
typedef int64_t ll;
using namespace std;
const int INF = 1000000007;
int fact(int n);
int nCr(int n, int r)
{
return fact(n) / (fact(r) * fact(n - r));
}
int fact(int n)
{
int res = 1;
for (int i = 2; i <= n; i++)
res = res * i;
return res;
}
int main(){
#ifndef... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
signed main(){
int x=0;
int o = 0;
int q =0;
int ans=0;
rep(i, 10){
char s;
cin >> s;
if (s=='o') o++;
else if (s=='x') x++;
else q++;
... |
#include<bits/stdc++.h>
#define ll long long
#define N 200015
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define inf 0x3f3f3f3f
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define lowbit(i) ((i)&(-i))
#define VI vector<i... | #include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
cin >> n >> s;
if (s[0] != s[n - 1]) {
cout << 1 << endl;
} else {
for (int i = 1; i + 1 < n - 1; i++) {
if (s[i] != s[0] && s[i + 1] != s[n - 1]) cout << 2 << endl, exit(0);
}
if (n % 2... |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int t=1000;
int s1,s2,d1,d2;
string p="";
int k;
while(t--){
cin>>s1>>s2>>d1>>d2;
p="";
if (s1>d1){
while (s1!=d1){
p+="U";
s1--;
}
}
else if (d1>s1){
while (d1!=s1){
p+="D";
... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<ll,ll>;
#define pb push_back
int main(){
vvl tate(29, vl(30,5000));
vvl yoko(30, vl... |
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#inc... | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define Y imag()
#define X real()
#define clr(v,d) memset( v, d ,sizeof(... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define deb(...)
#endif
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define all(c) c.begin(),c.end()
#define read(v) for(auto &it:v) cin>>i... | #include<bits/stdc++.h>
using namespace std;
#define Mod(x) (x>=P)&&(x-=P)
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(int i=hd[a];i;i=nxt[i])
typedef long long ll;
void Max(int &x,int y){(x<y)&&(x=y);}
void Min(int &x,int y){(x>... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m;
int main()
{
#ifdef lovelyG
Sfile(1);
#endif
scanf("%d%d",&n,&m);
if(m==0)
{
for(int i=1;i<=n;++i)
{
printf("%d %d\n",i*2,i*2+1);
}
return 0;
}
if(n<m+2||m<0)
{
puts("-1");
return 0;
}
printf("%d %d\n",1,1000000000);
for(... | //DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcn... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int,int> pii;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define rept(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=x;i>=y;i--)
#define pb push_back
#define mp make_pair
#de... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
#define MX 200002
int dp[MX];
void solve()
{
int n,m;
cin>>n>>m;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pl;
#define all(a) (a).begin(),(a).end()
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(ll i = 0;i < (n);i++)
#define rep2(i,n) for(ll i = 0;i < (n);i++)
#define rep3(i,a,b) for(ll i = (a);i < (b);i++)
#define ... |
#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... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
//using Graph = vector<vector<pair<ll,ll>>>;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1... |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
vector<vector<ll>> comb(int n, int r) {
vector<vector<ll>> v(n + 1, vector<ll>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int i = 1; i < v.size(); i++) {
for (int j = 1; ... | //int a = s - '0'; 文字から数字
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//大文字判定 isupper(文字) 小文字判定 islower(文字)
//do{}while(next_permutation(ALL(配列)))
//小文字に対応する文字コード：S... |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin>>s;
bool flag=false;
for(int i=0;i<s.size();i++)
{
if(i%2!=0)
{
if(s[i]>='A' && s[i]<='Z')
{
continue;
}
else{
flag=true... | #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;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long int
#define pb push_back
#de... |
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<queue>
#include<stack>
#include<utility>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<list>
#include<tuple>
usin... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <utility>
#include <sstream>
#include <algorithm>
#include <numeric>
int read_int()
{
std::string s;
std::getline(std::cin, s);
return std::stoi(s);
}
std::pair<int,int> read_int_pair()
{
std::string s;
st... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main()
{
ll n; cin >> n;
... | #include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
using ll = long long;
constexpr int N = 1e6 + 5;
int ed;
ll n;
ll v[200];
void init() {
v[1] = 1;
ll b = 0;
int t = 1;
for(int i = 2; i <= 200; ++i) {
v[i] = v[i - 1];
if(t) {
b = b + v... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 998244353
#define pb push_back
#define p_q priority_queue
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int k,a[1001001],dp[1001001][20],states,mod=1e9+7;
string s;
signed main()
{
cin>>s>>k;
int n=s.size();
for(int i=1;i<=n;i++)
{
if(s[i-1]>='0'&&s[i-1]<='9')
a[i]=s[i-1]-'0';
else
a[i]=s[i-1]-55;
}
for(int i=0;i... |
//
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define lch (o << 1)
#define rch (o << 1 | 1)
typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> tint... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
struct LOC{
ll x,y;
};
typedef vector<ll> V;
typedef vector<V>... |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T>
inline bool dpmin(T& a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool dpmax(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
using Graph = vector<vector<ll>>;
#define all(x) (x).begin(), (x).end() //string の sort とかはこれ
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1000000007;
const ll INF = 1e18; //1*10^18... |
#include <bits/stdc++.h>
using namespace std ;
int main(void) {
ios::sync_with_stdio(false) ; cin.tie(0) ;
long long N ;
cin >> N ;
unordered_set<long long> s ;
for (long long i = 2 ; i * i <= N ; i++) {
long long x = i ;
while (x * i <= N) {
s.insert(x * i) ;
x *= i ;
}
}
cout <... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_... |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int,int>
const int Maxn=110;
const int inf=2147483647;
const double pi=acos(-1.0);
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
ret... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
#define INF 3000000000000001 // 3e15
#define ll_max 9000000000000000000
#define PI 3.14159265358979323846L
#define fill(a, n, x... | #include<iostream>
#include <algorithm>
using namespace std;
int main(){
float A,B;
float ans=0;
cin>>A>>B;
ans=(A-B)*100/A;
cout<<ans;
} |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t) ... | #include<bits/stdc++.h>
#define maxn 200005
#define mod 998244353
using namespace std;
long long n,m,K;
long long pw(long long A,long long n)
{
long long ans=1;
while (n)
{
if (n&1) ans=ans*A%mod;
n=n>>1;
A=A*A%mod;
}
return ans;
}
int main()
{
long long ans=0;
cin>>n>>m>>K;
if (n==1) {cout<<pw(K,m)<<end... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
string s,t;
cin >> s;
cin >> t;
int zero=0,anszero=0;
int iti[n],ansiti[n];
int count=0,count2=0;
for(int i=0;i<n;i++){
if(s[i]=='0'){
zero++;
iti[count]=i;
count++;
}
if(t[i]=='0'){
... | #include "bits/stdc++.h"
#include <random>
#include <chrono>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
size_t N;
cin >> N;
vector<double> A(N);
for (double &a : A)
{
cin >> a;
}
double l = 0.0;
double r = 2000000000.0;
auto f = [&](double c) -> double
{
double ret = 0.0;
for (double a : A)
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int n, a[N];
map <int, vector <int>> cand;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j * j <= a[i]; ++j) {
if (a[i] % j) continu... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(ll i = (ll)a; i <= (ll)b; i++)
#define DEC(i, a, b) for(ll i = (ll)a; i >= (ll)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<ll, pi> ipi;
typedef pair<pi, pi> pipi;
#define mp m... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <cstdio>
#include <stack>
#include <cstring>
//#define FILE_INPUT
using namespace std;
#define inc(i, n) for (int i = 0; i < (n); i++)
#define incs(i, st, n) for (int i = (st); i ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> A(N + 1);
for (int i = 0; i <= N; i++) cin >> A.at(i);
int k = 11000;
for (int i = 0; i < N; i++) k = min(k, abs(A.at(i + 1) - A.at(i)));
cout << k << endl;
vector<vector<int>> B(k, vector<int>(N + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> pin;
const int N = 1005;
const ll P = 998244353LL;
int n, m, ufs[N << 1];
bool vis[N << 1];
char s[N][N];
inline int id(int x, int y) {
return (x - 1) * m + y;
}
int find(int x) {
return ufs[x] == ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define endl "\n"
#define vll vector<ll>
#define pll pair<ll,ll>
#define pqb priority_queue<ll>
#define pqs priority_queue<ll,vll,greater<ll> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __... | /*********************************************************************************\
* _________ _ _ ________ _ _ __ ________ *
* |___ ___|| | | || ______|| | | | / \ | ____ | *
* | | | | | || |______ | |_____| | / /\ \ | |____| |... |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define DREP(i,n) for (int i = (n-1); i >=0; --i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static cons... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
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, const T& b) { if (b<a)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.