code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
unsigned long long kaijou(unsigned long long k){
unsigned long long sum = 1;
for (unsigned long long i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
unsigned long long bekijou(unsigned long long p, unsigned long long q){
unsigned long long su... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
bool sequence = false;
for(int i = 0; i < n-1; i++) {
if(a.at(i+1) - a.at(i) == 1) {
sequence = true;
} else {
se... | #include <bits/stdc++.h>
//#include "debugger.h"
#define int long long
#define pb push_back
#define pp pop_back
#define f first
#define s second
#define all(x) x.begin(),x.end()
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int ans =... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
cout << (N + (100 - 1)) / 100 << endl;
return 0;
} | #include <iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<math.h>
#include<iomanip>
#include<string>
#include <cassert>
#include <complex>
#include<math.h>
#include<bits/stdc++.h>
#define rep(s,i,n) for(int i = s;i < n;i++)
using namespace std;
typedef long long ll; //10e18くらい
typedef lon... |
#ifdef Rahul
#include "RAHUL.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define error(...) 42;
#endif
#define SZ(v) int((v).size())
#define ALL(vec) begin(vec), end(vec)
typedef long long i64;
template<typename T> inline bool uax(T &x, T y) {return (y > x) ? x = y, true : false;}
template<typename T> inline... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef double dd;
#define tst int tttt;cin>>tttt;for(int TTTT=1;TTTT<=tttt;TTTT++)
#define nl cout<<"\n";
#define forn(a,b) for (int ii=a;ii<b;ii++)
const ll MOD1=1e9+7;
const ll MOD2=998244353;
#define pii pair<int,int>
#define mp(a,b) make_pair(... |
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (... |
/**
* author: akifpathan
* created: Wednesday 23.06.2021 01:28:14 PM
**/
#ifdef akifpathan
#include "debug.h"
#else
#include<bits/stdc++.h>
using namespace std;
#define debug(x...)
#endif
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//mt19937_64 rng(chrono... |
#include <iostream>
#include <vector>
using namespace std;
using LL = long long;
const int kMaxN = 2e5 + 1;
const int kMaxM = 101;
const int kM = 1e9 + 7;
LL n, ans, u, v, w;
LL c[kMaxN], d[kMaxM];
bool vis[kMaxN];
vector<LL> a[kMaxN], b[kMaxN];
void Dfs(LL x, LL y) {
if (vis[x]) {
return;
}
vis[x] = tr... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
#define eb emplace_back
#define F first
#define S second
#define ice(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
const ll MOD = 1e9 + 7;
vector<vector<pair<int, ll>>> adj(200001);
vector<ll> val(200001, 0);
void dfs(int n, int m = -1) {
fo... |
#include<bits/stdc++.h>
#define int long long
#define ri register signed
#define rd(x) x=read()
using namespace std;
const int N=2e5+5;
const int M=21;
const int maxn=5e6+5;
const int mod=998244353;
const int inf=0x3f3f3f3f3f3f3f3f;
inline int read(){int x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0'){if (ch=='-')f=-1;... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#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 ar array
#define ll long long
#define For(i,k,n) for(int i=k;i<n;i++)
#define Forll(i,k,n) for(long long int i=k;i<n;i++)
#define Forull(i,k,n) for(long long int i=k;i<n;i++)
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve(){
int a,b,c;
cin>>a>>... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int v,t,s,d,p;
cin>>v>>t>>s>>d;
if (t*v<=d && d<=s*v)
{
cout<<"No";
}
else
{
cout<<"Yes";
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
//#define ll long long
#include <cmath>
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vii vector<vector<int>>
#define tp tuple<double,ll,ll>
#define sd(a) scanf("%lld",&a)
#d... | #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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int,int> pii;
#define x first
#define y second
const int N=2e5+100;
int a[N];
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
for(i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
class BIT
{
public:
ll n;
vector<ll> tree;
BIT(ll nn)
{
n = nn;
tree = vector<ll>(n + 1, 0);
}
ll sum(ll k)
{
k++;
ll s = 0;
while (k >= 1)
{
s += tree[k];
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fr first
#define sc second
int lg(ll n) {
assert(n > 0);
int ans = -1;
while (n) {
ans++;
n >>= 1;
}
r... | #include <bits/stdc++.h>
using namespace std;
long long rnd(long double n)
{
long double f, c;
f = n - (long double)floor(n);
c = (long double)ceil(n) - n;
if (c < f)
{
return ceil(n);
}
else
{
return floor(n);
}
}
int main()
{
ios_base::sync_... |
#include "bits/stdc++.h"
using namespace std;
#define ffor(n) for(int i = 0; i < n; i++)
#define fffor(n) for(int j = 0; j < n; j++)
#define uwu ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize("Ofast")
const int INF = 1e9 + 7;
const long long INF2 = 1e17;
int main(void) {
uwu
int n; cin >> n;
ve... | #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;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
int t=min(a,b);
int t1=min(c,d);
cout<<min(t,t1);
}
| #include <iostream>
#include <iomanip>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <array>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#define foi(i,a,b) for(int i=a;i<=b;++i)
#define io... |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <q... | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <fstream>
#include <array>
#include <map>
#include <queue>
#include <time.h>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <... |
/*************************************************************************
> File Name: e.cpp
> Full Path: /Users/zhanghang/Downloads/e.cpp
> Author: Hang Zhang
> Created Time: 三 4/28 14:59:02 2021
************************************************************************/
#include<iostream>
#include<algorithm>... | #include<bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define f(a,b) for(int i=a; i<b; i++)
#define rep(i,a,b) for(int i=a;i< b;i++)
#define endl "\n"
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define fr ... |
//https://atcoder.jp/contests/abc183/tasks/abc183_e
//E - Queen on Grid
#include <bits/stdc++.h>
using namespace std;
const int MAXH=2e3+2;
const int MAXW=2e3+2;
char nums[MAXH][MAXW];//用于保存迷宫
long long row[MAXH];//行走法
long long col[MAXW];//列走法
long long dia[MAXH+MAXW];//对角线
const long long MO=1e9+7;
/*计算对角线的时候 i-j ... | #include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define lli long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#define F first
#define rep(i,a,b) for(int i=a;i<b;i++)
#defi... |
/* author : sgupta_2001 */
#include<bits/stdc++.h>
using namespace std;
using db = double;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
//containers
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(... | #include<bits/stdc++.h>
using namespace std;
#include<cmath>
#include<algorithm>
int main()
{
long long int n,i;
cin>>n;
long long int a[n];
for(i=0;i<n;i=i+1)
{
cin>>a[i];
}
sort(a,a+n);
long long int sum=0;
for(i=0;i<n;i=i+1)
{
sum=sum+n-(upper_bound(a... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9+7;
int main(){
int N; cin >> N;
vector<vector<ll>> edge(N), weight(N);
for(int i=1; i<N; i++){
ll u,v,w; cin >> u >> v >> w;
edge[--u].push_back(--v);
edge[v].push_back(u);
weight[u].push_ba... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ff first
#define ss second
#define endl "\n"
#define MOD 100... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mod 1000000007
int main(){
ios::sync_with_stdio(0);cin.tie(0);
int t;cin >> t;
while(t--){
ll l,r,count;
cin >> l >> r;
if(r/2<l)count =0;
else count = r-l-l+1;
cout << count*... | #include<bits/stdc++.h>
using namespace std;
namespace hyy {
#define DEBUG 1
#define isdigit(x) (x >= '0' && x <= '9')
const int MAXSIZE = (1 << 20);
inline char gc() {
#if DEBUG
return getchar();
#endif
static char buf[MAXSIZE];
static char *p1 = buf + MAXSIZE;
static char *p2 = buf + MAXSIZE;
... |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define print(...) cout << " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << " ]"
#define printv(...) cout << " [" << #__VA_ARGS__ ": "; for (int i = 0; i < (__VA_ARGS__).size(); ++i) cout << (__... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pf printf
#define ff first
#define ss second
#define sef second.first
#define ses second.second
#define PI 3.14159265 /// tan inverse = atan(value)*(180/PI)
#define ms(a,b) memset(a, b, sizeof(a))
#define lp(i,a,b)... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long int
#define double long double
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define pii pair<int,int>
#defi... | #include<bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define yes(x) ((x) ? "yes" : "no")
#define Yes(x) ((x) ? "Yes" : "No")
using i64 = int_fast64_t;
using u64 = uint_fast64_t;
using f64 = double_t;
using p64 = pair<i64, i64>;
constexpr i64 INF = INT_FAST64... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353... | #include <bits/stdc++.h>
using namespace std;
template <typename T> inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a;}
template <typename T> inline T lcm(T a, T b) { return ((a/gcd(a,b))*b);}
#define all(x) (x).begin(),(x).end()
#define sort(x) sort(x.begin(),x.end())
#define maxi... |
#include<bits/stdc++.h>
using namespace std;
int solve(int n)
{
int cnt=0;
vector<bool>arr(n+1);
for(int i=7; i<=n; i++)
{
int temp=i;
while(temp>0)
{
if(temp%10==7)
{
arr[i]=true;
break;
}
temp/=... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <random>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> ... |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
#define PI 3.14159265359
const long long INF = 1LL << 60;
long long MOD = 1000000007;
long long gcd(long long a, long long b) { return b ? gcd(b, a%b) : a; }
long long lcm (int a, in... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define F(i,n) for (int i = 0; i < n; ++i)
#define F1(i,n) for (int i = 1; i <= n; ++i)
#define dbg(x) cerr << #x << " = " << x << endl
#define dbgg(x) cerr << #x << " = " << x << ' '
#de... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m,i,j,k,l,ans,cur,res;
cin >> n;
vector<long long> a(n);
for(i=0; i<n; i++){
cin >> a[i];
}
map<long long,long long> mp;
cur=0;
mp[cur]=1;
ans=0;
for(i=0; i<n; i++){
if(i%2==0){
cur+=a[i];
}else{
cur-=a[i];
}
ans+=mp[cur];... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<... |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
#define max(p,q) ((p)>(q)?(p):(q))
#define min(p,q) ((p)<(q)?(p):(q))
#define rep(i,n) for... | #include <bits/stdc++.h>
using namespace std;
#define MOD 2000000011
#define MAXL 26
#define MAXN 100010
#define MAXT 200
#define MAXM 101
#define PI 3.14159265359
// #define all(v) v.begin(),v.end()
#define f first
#define pb push_back
#define pii pair<int, int>
#define s second
// #define sortva(v) sort(all(v))
// #... |
#include <bits/stdc++.h>
#define MN 1001000
using namespace std;
typedef long long ll;
ll t, n, a[MN], med;
//char s[MN]; string str;
double ans;
int main() {
scanf("%lld", &n);
for(int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
ans += a[i] / 2.0;
}
sort(a, a + n);
med = a[n/2];... | #define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <iostream>
#include <fstream>
#include <chrono>
using namespace std;
void solve(int test, std::istream... |
#include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 1000000007LL
//#define MOD 998244353LL
#define doublecout(a) cout<<setprecision(16)<<a<<endl;
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
usi... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define IFOR(i, a, b) for (long long i = (a); i <= (long long)(b); i++)
using namespace std;
using VL = vector<long long>;
using ll = int64_t;
ll mod(ll x,ll m){ll y=x%m;return (y>=0LL)?y:y+m;}
template<class T>bool chmin(T& a, T b){if(a>b){a... |
#include "iostream"
using namespace std;
//#include "string"
#include "vector"
#include "set"
#include "map"
#include "stack"
#include "algorithm"
#include "queue"
#define int long long
#define pi pair<int,int>
#define ff first
#define ss second
#define boost ios::sync_with_stdio(false);cin.tie(nullptr)
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
int main() {
int N,M; cin>>N>>M;
vvi pos(N, {-1});
for (int i = 0; i < N; i++){
int A; cin>>A;
pos[A].push_back(i);
}
for (int i = 0; i < N; i++)pos[i].push_back(N);
fo... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n,a,b;
double grad;
int cnt = 0;
cin >> n;
vector<double> x,y;
rep(i,n){
scanf("%d", &a);
scanf("%d", &b);
x.push_back(double(a));
y.push_back(double(b));
}
for(int ... | // C++ program to count number of ways to express
// N as sum of consecutive numbers.
#include <bits/stdc++.h>
using namespace std;
long long int countConsecutive(long long int N)
{
// constraint on values of L gives us the
// time Complexity as O(N^0.5)
long long int count = 0;
for (long long int L =... |
#include <cstdio>
#include <vector>
#include <queue>
const int N = 2000 + 5;
const int d[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
#define toint(ch) ((int)((ch) - 'a' + 1))
char a[N][N];
int n, m;
int stx, sty, edx, edy;
struct Point { int x, y; };
std::vector<Point> tos[30];
std::queue<Point> q;
int dis[N][N];... | #include<iostream>
#include<vector>
#include<deque>
using namespace std;
template<typename T>class Graph{
public:
struct edge{int to;T cost;};
int Vertex_num,Edge_num;
vector<edge>*g;
const T INF=1000000000;
Graph(int V){//0～V-1
Vertex_num=V;
g=new vector<edge>[V];
}
... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define LL long long
#define ULL unsigned long long
const LL INF = 1LL<<62;
const double PI = 2.0 * acos(0.0);
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<pii> vii;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
int main(void){
scanf("%d",&n);
printf("%d\n",n-1);
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
//#pragma GCC optimize("O3")
using namespace std;
using namespace _... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector... | //"IN THE NAME OF ALLAH"//
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(ll i=(ll)(n); i<=(ll)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<deque>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<string>
#include<chrono>
#in... |
#include<stdio.h>
int main()
{
int x;
scanf("%d",&x);
if (x>=0)
{ printf("%d",x);}
if (x<0)
{printf("0");}
return 0;
}
| #include <bits/stdc++.h>
#define log(x) cout<<x<<endl
#define pb push_back
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define uni(x) (x).erase(unique(x.begin(),x.end()),x.end())
typedef long long lint;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t C, M, T;
cin >> C >> M >> T;
int64_t time = 0;
int64_t cap = C;
for (int i = 0; i < M; ++i) {
int64_t start, end;
cin >> start >> end;
cap -= (start - time);
if (cap <= 0) {
cout << "No" << endl;
return 0;
}
... | #include<iostream>
#include<cstring>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef long long LL;
const int N=3e3+10;
struct Node{
int x,v;
bool operator<(const Node& a)const{
return x<a.x;
}
}node[N<<1];
int main(){
int n,m,t;
cin>>n>>m>>t;
int cnt=0;
for(int i=1;i<=m;i++){
int x,... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + stri... |
//================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>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
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; }
#define rep(i,cc,n) for(int i=cc... | #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 n; cin>>n;
vector<ll> a(n), ac(n), mx(n);
rep(i, n) {
cin >> a[i];
if(i==0) {
ac[i]=a[i];
mx[i]=ac[i];
}
else {
... |
#include<bits/stdc++.h>
using ll = int_fast64_t;
int main(){
int n;
scanf("%d", &n);
char s[n+1], t[n+1];
scanf("%s %s", s, t);
ll ans = 0;
int dis = 0;
while(dis<n && t[dis]!='1') dis++;
int prev = -1;
for(int i=0; i<n; i++){
if(s[i]=='1') {
if(prev>=0){
s[prev] = s[i]= '0';
ans += i-prev;
... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 5e5 + 10;
int n;
string s, t;
const int inf = 1e9;
int main() {
ios_base::sync_with_stdio(false); ... |
#include <bits/stdc++.h>
using namespace std;
// clang-format off
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353
using ll = int64_t;
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& a : v) cin >> a;
return is... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;
cin >> n;
int mini = 2e9;
for(int i=0;i<n;i++){
int a,b,c;
cin >> a >> b >> c;
if(a < c){
mini = min(mini,b);
}
}
cout <... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
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) { a = b; return 1; } return 0; }
#define ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=0;i<=n;i++)
int main(){
int n;
cin>>n;
vector<int> p(n);
for(int i=0;i<n;i++){
cin>>p.at(i);
}
//１～ｎまでの数字がどの位置にあるかを記録します
vector<int> position(n+1);
for(int i=0;i<n;i++)... |
//GOD PLEASE HELP ME ,GOD PLEASE HELP ME , GOD PLEASE HELP ME
//Name Rishiraj Kalita
// sc id : 1912041
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#de... | #include <bits/stdc++.h>
using namespace std;
struct cake {
int a;
int b;
int c;
};
int fact(int n) {
if (n <= 0) {
return 1;
}
return n * fact(n-1);
}
void solve() {
long long n, m;
cin >> n;
cin >> m;
/*
vector<cake> v;
for (int i = 1; i <= n; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000 * 1000;
int main()
{
int A, B, W;
cin >> A >> B >> W;
W *= 1000;
int max_i = W / A;
int min_ans = INF;
int max_ans = -1;
for (int i = 1; i <= max_i; i++)
{
if (A * i <= W && W <= B * i)
{
min_ans = min(min_ans, i);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a,b,c; cin >> a >> b >> c;
string ans = "No";
if (a * a + b * b < c * c) {
ans = "Yes";
}
cout << ans << endl;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
int sy,sx;
int cell_group[50][50];
int cell_point[50][50];
int dx[]={1,0,-1,0}, dy[]={0,1,0,-1};
string dcoms[]={"R","D","L","U"};
string ans="";
chrono::system_clock::time_point start;
chrono::system_clock::time_point _end;
bool comp(const pair<pair<int,string>,pair<int,i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = ... |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll H,W,N,M;
cin>>H>>W>>N>>M;
vector<vector<ll>> vec(H,vector<ll> (W,0));
for(ll i=0;i<N;i++) {
ll A,B;
cin>>A>>B;
A--;
B--;
vec[A][B]=1;
}
for(ll i=0;i<M;i++) {
ll C,D;
... | #include <bits/stdc++.h>
using namespace std;
#define testing 1
#define FOR(ii,ss,ee) for (ll ii = (ss); ii<=(ll)(ee);++ii)
#define DEC(ii,ss,ee) for (ll ii = (ss); ii>=(ll)(ee);--ii)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << '=' << x << endl
#define db2(a,b) cerr << #a ... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
ll ans = n;
for(int i=0;i<k;i++){
if(ans%200 == 0){
ans = ans/200;
}
else{
ans =... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#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 <iostream>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <vector>
#include <queue>
#define lowbit(x) ((x) & (-(x)))
typedef long long ll;
#define For(i , a , b) for(ll i = a ; i <= b ; i ++)
#define FoR(i... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
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 ... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef pair<int,int> P ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
int l , r ;
int A[1000007] ;
int ans[1000007] ;
int prime_factor[1000007] ;
void ertstns(){
memset(prime_factor,-1,sizeof(... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define ss second
#define YES printf("YES\n")
#define NO printf("NO\n")
#define nn "\n"
#define sci(x) scanf("%d", &x)
#define LL_INF (1LL << 62)
#d... |
#include<bits/stdc++.h>
//#pragma GCC optimize "trapv"
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define fast_az_fuk ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define lll __int128
#define ull u... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define ndl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin... |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const int maxn = 3050;
const int maxm = maxn*maxn*4;
int head[maxm],vis[maxm];
char G[maxn][maxn];
int dis[maxm];
struct Edge{
int f,t,w,next;
Edge(int f = 0,int t = 0,int w = 0,int next = 0):f(f),t(t),w(w),next(next){}
}edge[max... | #include <bits/stdc++.h>
// #include <bits/extc++.h>
using namespace std;
// using namespace __gnu_pbds;
#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 pii pair<int,int>
#define vi vector<int>
#define vii vector<vi >
#define vpii vector<pii >
#define pb push_back
#define m... |
//#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... | //In the name of Allah :)
#include <bits/stdc++.h>
using namespace std;
string to_string(char c) { return string(1,c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return (string)s; }
string to_string(string s) { return s; }
template<class A> string to_string(complex<A> ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
const int64_t inf = LLONG_MAX / 2;
vector<int64_t> a(n);
vector<int> t(n);
for (int i = 0; i < n; ++i) cin >> a[i] >> t[i];
auto f = [&](int64_t x) {
for (int i = 0; i < n; ++i) {
if (t[... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 4;
vector<int> adj[N];
int c[20] , d[20][N];
int inf;
void bfs(int idx){
int src = c[idx];
queue<int> q;
q.push(src);
d[idx][src] = 0;
while((int)q.size()){
int tp = q.front();
q.pop();
for(int v : adj[tp]){
... |
//-- In the name of ALLAH --
// We're nothing and you're everything.
// Ya Ali!
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
/*---------macro---------*/
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = s; i < (int)(n); ++i)
#define Clear(a) a = decltype(a)()
#define all(a) begin(a),end(a)
#define rall(a) r... |
//#define _GLIBCXX_DEBUG
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include<algorithm>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(x) (x).begin(),(x)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int k, t;
long long ans;
int main(){
scanf("%d", &k);
for(int i=1; i<=k; i++) for(int j=1; j*i<=k; j++) ans += k/i/j;
printf("%lld\n", ans);
} |
#include <iostream>
using namespace std;
int main(){
string n;
cin >> n;
int N = n.size();
for(int i=0;i<N;i++){
bool flag = true;
for(int j=0;j<n.size()/2;j++){
if(n[j] != n[n.size()-j-1]){
flag = false;
break;
}
}
if(flag){
cout << "Yes\n";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define ss second
int main(void){
// Your code here!
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s,r;
cin >> n;
while(n%10==0 && n>0)
n/=10;
s=to_string(n);
r=s;
reverse(r.begin(... |
#include <bits/stdc++.h>
typedef long long LL;
#define rep(i, n) for (LL i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define repB(i, m, n) for (LL i = m; i <= n; ++i)
#define repR(i, n) for (LL i = n - 1; i >= 0; --i)
#define all(n) n.begin(), n.end()
using namespace std;
int... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
using namespace std;
typede... |
// Problem: C - Compass Walking
// Contest: AtCoder - AtCoder Beginner Contest 198
// URL: https://atcoder.jp/contests/abc198/tasks/abc198_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb p... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
using namespace std;
using ll = long long;
using ull = unsigned long lon... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
//using vi = vector<int>;
int start_time;
int si, sj;
int highscore;
string best_S = "";
vector<vector<int>> t(50, vector<int>(50));
vector<vector<int>> p(50, vector<int>(50));
vector<int> near_i = {1,-1,0,0};
vector<int... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
#define rep(i, n) for(int i = 0; i < n;++i)
#define reps(i, s, n) for(int i = s; i < n;++i)
const int MAX_W = 50, MAX_H = 50;
int dx[4] = {+1,0,-1,0};
int dy[4] = {0,+1,0,-1};
char dm[4] = {'R', ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9
#define linf 1e18
#define BASE 1000000
#define EPS 1e-10
#define PI acos(-1)
#define pii pair<int,int>
#define pdi pair<double,int>
#define vi vector<int>
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define wa(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define int ll
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
int a[N], cnt = 0;
int dp[N][20];
bool vis[20];
int mult(int x, int y){
return ((x %... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATY... |
//================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>
#include <random>
#include <chrono>... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
char T;
cin >> T;
if (S == "Y")
{
T = toupper(T);
}
cout << T << endl;
} | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#defi... |
#ifdef Rahul
#include "RAHUL.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define error(...) 42;
#endif
#define SZ(v) int((v).size())
#define ALL(vec) begin(vec), end(vec)
typedef long long i64;
template<typename T> inline bool uax(T &x, T y) {return (y > x) ? x = y, true : false;}
template<typename T> inline... | #include <bits/stdc++.h>
using namespace std;
#define per(i,a,b) for(int i=(b)-1;i>=a;i--)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define de(x) cout<<#x<<" = "<<x<<"\n"
#define dd(x) cout<<#x<<" = "<<x<<" "
#define mes(p) memset(p,0,sizeof(p))
#define all(x) x.begin(),x.end()
#define rson mid+1,r,rt<<1|1
#define s... |
#include <iostream>
#include <chrono>
#include <string>
#include <vector>
#include <algorithm>
class DNA {
private:
char base[20][20];
public:
void inputV(const int& i, const int& j, const std::string& s) {
for (int k = 0; k < (int)s.size(); k++) {
if (i + k < 20) base[i + k][j] = s[k];
else base[i + k... | #include <vector>
#include <iostream>
#include <string>
#include <algorithm>
#include <random>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main()
{
int N;
int M;
vector<string> S(M, "");
int L = 0;
cin >> N >> M;
for (int i = 0; i < M; i++)
{
cin ... |
// Fearless
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define PI (2.0 * acos(0.0))
#define testcase ll T; cin >> T; for (ll tc = 1; tc <= T; tc++)
#define info pair<int, pii>
#define mkp make_pair
const ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N <= 3) {
cout << 1 << endl;
return 0;
}
char caa, cab, cba, cbb;
cin >> caa >> cab >> cba >> cbb;
if (caa == 'A' && cab == 'A') cout << 1 << endl;
else if (cab == 'B' && cbb == 'B') cout << 1 << endl;
el... |
//abc202_c.cpp
//Fri Jun 18 20:08:47 2021
#include <bits/stdc++.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
ll n;
cin >> n;
map<ll,ll> a;
vector<ll> b(... | #include <climits>
#include <iostream>
#include <unordered_map>
#include <map>
#include <vector>
#include <unordered_set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#include <cmath>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int tt=1;
... |
#include<bits/stdc++.h>
using namespace std;
#define Max(a,b) ((a)<(b))&&((a)=(b))
#define Min(a,b) ((a)>(b))&&((a)=(b))
#define LL long long
#define db double
bool f1;
inline int rd() {
int res=0;
char ch;
while(ch=getchar(),ch<48||ch>57);
do res=(res<<1)+(res<<3)+(ch^48);
while(ch=getchar(),ch>47&&ch<58);
retur... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<numeric>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<stack>
#include<cassert>
//#include<atcoder/all>
#define fi first
#define se second
#define pb(x) emplace_back(x)
using namespace std;
using ll = long lon... |
#include<bits/stdc++.h>
using namespace std;
#define ri register int
typedef long long ll;
const int maxn=110,mod=998244353;
inline bool ckmin(int &x,const int &y){return x>y?x=y,1:0;}
inline bool ckmax(int &x,const int &y){return x<y?x=y,1:0;}
struct modint{
int val;
inline modint(int val_=0):val(val_){}
inline mod... | #include <bits/stdc++.h>
#define f(i,j,k) for(long long i=j;i<k;i++)
#define f2(i,j,k) for(long long i=j;i>=k;i--)
#define ll long long
using namespace std;
const long long mod=1e9+7;
const ll infl = 1LL << 60;
ll H,W,A,B;
bool used[16][16];
ll dfs(ll x,ll y,ll a){
ll ans=0;
if(y==H){
return a==0;
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rr... | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <algorithm>
#include <vector>
int main(void){
int a, b, c, d;
int x, y;
scanf("%d %d %d %d", &a, &b, &c, &d);
printf("%d", b - c);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x, y; cin >> x >> y;
int high = max(x, y);
int low = min(x, y);
if(high - low < 3) cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define io ios::sync_with_stdio(false); cin.tie(0)
int main()
{
io;
ll t, n;
cin >> t >... |
/* Goal to be a Master */
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cstdio>
#include <bitset>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9)
#define LINF ll(1e18)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int n,k;
int a[310000];
int main(){
cin>>n>>k;
rep(i,n){
int val; cin>>val;
a[val]++;
}
int a... |
#include <math.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;
con... | #include<bits/stdc++.h> // 57 68 "Baklol, Take it easy"
using namespace std;
#define rep(x, k, n) for(int x = (k); x < (n); ++x)
#define repr(x, k, n) for(int x = (k); x > (n); --x)
#define tr(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define ll long long
#define ... |
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (31 - __builtin_clz(x))
#define SZ(x) ((int)(x).size())
#define pb push_back
#define AL... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
a%=10;
if(a==0||a==1||a==5||a==6){
cout<<a<<'\n';
return 0;
}else if(a==4||a==9){
if(b%2==0){
a=a*a%10;
}
cout<<a<<'\n';
return 0;
}else{
b%=4;
int t=b;
b=1;
for(int i=0;i<32;i++... |
/*
* Author : Siddhant Khare
*/
#include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define ll long long
#define ld long double
#define arr array
#define si(t) scanf("%d", &t)
#define sl(t) scanf("%ld", &t)
#define sll(t) scanf("%lld", &t)
#define... | //#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
//
////#define ATCODER
//#ifdef ATCODER
//#include<atcoder/all>
//using namespace atcoder;
//#endif
#include <algorithm>
#include <utility>
#include <vector>
#include <limits.h>
#include ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
constexpr int MX = 200005;
int p[MX];
map<int,int> mp[MX];
int find(int x){return (p[x] < 0 ? x : p[x] = find(p[x]));}
void uni(int x, int y){
x = find(x); y = find(y);
if(x != y){
if(p[x] > p[y]) swap(x, y);
p[x] += p[y];
p... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int run_test(){
int n;
cin >> n;
int maxi = 0, mini = mod;
for(int i = 0; i < n; i++){
int k;
cin >> k;
maxi = max(maxi, k);
}
for(int i = 0; i < n; i++){
int k;
cin >> k;
mini = min(mini, k)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define N 100005
#define MOD 1000000007
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i, n) for (ll i = 0; i < n; i++)
#define revf(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP(i, a, b) for (ll i = a; i < b; i++)
... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" ... | #include <bits/stdc++.h>
using namespace std;
int main(){
double n, x0, y0, xh, yh;
cin >> n >> x0 >> y0 >> xh >> yh;
double xc = (x0 + xh)/2;
double yc = (y0 + yh)/2;
double arc = 3.1415926535897932384 * 2;
cout << setprecision(10) << ((x0 - xc)* cos(arc/n)) - ((y0 - yc) * sin(arc/n)) + xc <<... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using vi = vector<int>;
#define f(n) for(int i = 0; i < n; i++)
#define fj(n) for(int j = 0; j < n; j++)
#define fk(n) for(int k = 0; k < n; k++)
#define ci(n) cin >> n;
#define ic(n) int n; cin >> n;
#define lc(n) int n; cin >> n;
#define all(a) ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
const int N = 3e5 + 100;
const int sq = 100;
const ll mod = 95542721;
const int inf = 1e7;
ll seg[4*N], a[N], ind[N], n;
void add(int x, int b = 0, int e = n, int ind = 1)
{
if(b + 1 == ... |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
using namespace std;
void bmain()
{
int n; cin >> n;
long c[n][n];
for (int i=0;i<n;i++){
for (int j=0;j<n;j++){
cin >> c[i][j];
}
}
long a0[n];
for (int i=0;i<n;i++) a0[i]=c[0][i];
long b0[n];
b... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace s... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s... |
//IQ134高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<... | /*
-------------- | /
| | /
| | /
| * |/ | | ------ *
| | | | / \
| | |\ | | | |\ |
\ ... |
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <algorithm>
#include <queue>
#include <set>
#include <vector>
#include <iomanip>
#include <bitset>
using namespace std;
#define pi pair<int ,int>
long long n , m , p[5001][5001] , mod = 998244353 , kq = 0;
int main()
{
ios_base::sync_with... | // In the name of Arceus
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define For(i, l, r) for (i = int(l); i <= int(r); i++)
#define Fo(i, n) For(i, 1, n)
#define Rof(i, r, l) for (i... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
static const int MAX_INT = std::numeric_limits<int>::max(); // 21474836... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,ans=0;
cin>>n;
if (n>=1000)
ans+=n-999;
if (n>=1000000)
ans+=n-999999;
if (n>=1000000000)
ans+=n-999999999;
if (n>=1000000000000)
ans+=n-999999999999;
if (n>=1000000000000000)
ans+=n-999999999999999;
cout<<ans;
return 0;
} |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#inclu... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep_e(i, n) for(int i = 0; i <= n; i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool c... |
#include<bits/stdc++.h>
#define matsuri pair<int,int>
#define iris 1000000007
using namespace std;
vector<int> G[111];
matsuri arr[11111];
int aoi[111][111],c[111],ans[11111];
bool v[111];
void dfs(int a,int f)
{
v[a]=1;
for(int b:G[a])
{
if(b==f)
continue;
int e=max(aoi[a][b], aoi[b][a]);
if(ans[e]==0)
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,c[110],depth[110],ans[10010];
vector <... |
#define _LIBCPP_DEBUG 0
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
template<class T> bool chmin(T &a, T b) {if(a>b){a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b){a=b;return 1;}return 0;}
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S = "110", T;
cin >> N >> T;
long long all= 10000000000;
long long res = 0;
if (T == "0") res = all;
else if (T == "1") res = all * 2;
else{
//110のどこから始まるかで全探索
for (int i = 0; i < 3; ++i) {
... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline int Asc(const void *a,const void *b){return strcmp((char*)a,(char*)b);}
static inline int IN(void)
{
int x=0,f=0,c=getchar();while(c<48||c>57){f^=(c==45),c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=get... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = (int) S.size();
for (int i = 0; i < N; i++) {
if (S.at(i) == '6') {
S.at(i) = '9';
}
else if (S.at(i) == '9') {
S.at(i) = '6';
}
}
for (int i = N - 1; i >= 0; i--) {
cout << S.at(i);
}
... |
#pragma GCC optimize(2)
#include<iostream>
#include<unordered_map>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<map>
#include<set>
#define Buff ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define rush() int Cas... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORX(i, a, b, x) for (ll i = (a); i <= (b); i+=x)
#define debug(x) cout <<" || "<< #x << " is= " << x <<endl; //use for debug
#define read(a) ll a; cin >> a;
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n), b(n), c(n);
for(int i = 0; i < n; ++i){cin >> a[i]; --a[i];}
for(int i = 0; i < n; ++i){cin >> b[i]; --b[i];}
for(int i = 0; i < n; ++i){cin >> c[i]; --c[i];}
vector<long long> aa(n), bc(n);
for(int i = 0; i < ... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#incl... |
#include <bits/stdc++.h>
using namespace std;
//ofstream cout("output.out");
#define fast() {ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define mii map<int, int>
#define pii pair<int, int>
#define qii prio... | #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 <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
using namespace std;
int main(void){
int n, m;
cin >> n >> m;
vector< int > a(m), b(m), c(m), d(m);
vector< vector< int > > edg(n+1, vector< int >());
for(int i = 0; i < m; i++){
cin >> a[i] >> b[i] ... | #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... |
#define ll long long
#define dn double
#define mp make_pair
#define pb push_back
#define se second
#define fi first
#define mod 1000000007
#define sob(v) v.begin(),v.end()
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string s[105];
ll a[25];
int f[25];
int n;
vector<int>v;
void make(int x)
{
for(int i=n;i>1;i--)
{
f[i]=x%2;
x=x>>1;
}
}
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++)
{
... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
#include <tuple>
#include <set>
#include <map>
#include <cassert>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++)... | #include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int m,n;
int num;
long long ans1,ans2;
string in;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
cin>>in;
num=0;
for(int j=0;j<m;j++)
if(in[j]=='0')
num++;
if(num&1)
ans1++;
else
ans2++;
}
printf("%lld",ans1... |
#include<bits/stdc++.h>
using namespace std;
void ans_add(string &t,vector<int>i){
t+=to_string(i[0])+' '+to_string(i[1])+' '+to_string(i[2])+' '+to_string(i[3])+'\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin>>n;
vector<vector<int>>ad(n,vector<int>(4));
for(int i=0;i<n;i+... | #define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())... |
#include <bits/stdc++.h>
using namespace std;
int a,b;
int main(){
scanf("%d%d",&a,&b);
printf("%d",a==b?a:3-a-b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rer(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);(i)++)
using ll = long long;
using P = pair<int,int>;
const int INF = 1001001001;
int main(){
int A,B,C;
cin >> A >> B;
if(A==B) cout << A << endl;
else{
... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aryssoncf
*/
// Taken from: https://github.com/bqi343/USACO/blob/master/Implementations/content/contest/templateShort.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long l... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
int ... |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cinttypes>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<stack>
#define FSCNd64 "%" SCNd64
#define FPRId64 "%" PRId64
using namespace std;
using ll=long long;... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
int main(void){
int n;
long long ans = 0;
string s, t;
cin >> n >> s >> t;
set< int > st;
for(int i=0;i<n;i++) if(s[i] == '1') st.insert(i);
for(int i=0;i<n;i++){
if(s[i] == t[i]) continu... |
#pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... | #include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#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 = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 5;
int a[N], b[N];
ll cnt;
int n;
void fun(int x, int y) {
if (x == y)return;
int mid = (x + y) / 2;
fun(x, mid), fun(mid + 1, y);
int p1 = x, p2 = mid + 1, p3 = x;
while (p3 <= y) {
if (p1 > mid) {
b[p3++] = a[p2++];
}
... | /** @kutbilimone **/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define rall(x) (x).rbegin(),(x).rend()
#define all(x) (x).begin(),(x).end()
#define arring(a, n) for(int i = 0; i < n; cin >> a[i++])
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.