code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i, 0, n)
#define all(x) (x).begin(),(x).end()
const int INF = 1e9+1;
using namespace std;
using ll = long long;
using p = pair<int, int>;
using v = vector<int>;
int main(){
int N, M, T;
cin >> N >> M >> T;
v A(M), B(M);
... | /*
ID: alec3
LANG: C++14
PROG:
/*
*/
#include <bits/stdc++.h>
#define check(x) cout<<(#x)<<": "<<x<<" " << endl;
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ss second
#define ff first
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ld long double
#define all(c... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define getchar_unlocked getchar
int A[100005];
int B[100005];
int offset[100005];
int minLevel1[100005];
int minLevel2[100005];
int N, L;
inline int nextInt(){
i... | #include<bits/stdc++.h>
////////////////////////////dbug/////////////////////////////////////////////////////////////////////////
#define dbug(a) cerr<<"==> "<<a<<endl;
#define dbug_ok cerr<<"==> ok"<<endl;
#define dbug_2d(a,n,m) {cerr<<"********"<<endl;for(int i=0;i<n;i++){for(int j=0;j<m;j++)cerr<<a[i][j]<<" "; cerr<... |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test() int t; cin>>t; while(t--)
#define all(v) v.begin(),v.end()
#define st(v) sort(all(v))
#define stA(arr,n) sort(arr,arr+n)
#define dp(n,c) vector<vector<ll>> dp(n,vector<ll>(c,0))
#define vc(v,n,f) vector<ll> v(n,... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>... |
#include<fstream>
#include<iostream>
#include<sstream>
#include<vector>
#include<stack>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<tuple>
#include<iomanip>
#include<stdio.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using graph = vector<vector<int... | #include <bits/stdc++.h>
using namespace std;
#include<limits>
#define endl '\n'
#define ll long long int
#define ld long double
#define fl float
#define vi vector<int>
#define vll vector<ll>
#define sll set<ll>
#define null NULL
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define infini... |
#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 mp(a,b) make_pair(a,b)
#define vi vector<int>
#define mii map<int,int>
#define mpi map<pair<int,int>,int>
#define msi map<string,int>
#... | #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... |
/*
JAI SHREE RAM
*/
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fo(i,n) for(i=0;i<n;i++)
#define foi(i,k,n) for(i=k;i<n;i++)
#define wt long t; cin>>t; while(t--)
#define ll long long
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int c = 1 << n;
vector<int> a(c);
for (int i = 0; i < c; i++) {
cin >> a[i];
}
map<int, int> mp;
for (int i = 0; i < c; i++) {
mp[a[i]] = i + 1;
}
while (a.size() > 2) {
vector<int> na;
... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a) for(int i = 0; i < (int) a; i++)
#define PB push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main(){
ios::sy... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
using ll = long long;
const ll mod = 10;
int main(){
int n;
cin >> n;
vector<tuple<int,int,int>> pax(n);
for(int i = 0; i < n; i++){
int a, p, x;
cin >> a >> p >> x;
pax[i] = make_tuple(p,a,x);
}
sort(pax.begin(),pax.end());
... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#define MOD 1000000007
using namespace std;
int main() {
long long T; cin >> T;
for (int i = 0; i < T; i++){
long long N, A, B; cin >> N >> A >> B;
if (N < A + B){
cout << 0 << endl;
continue;
}
long long p = ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pp;
const int mxn=10000;
vector<int>visited(mxn,0);
vector<int>adj[mxn];
int prime[mxn];
int M=1e9+7;
void boost() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void sieve(int ending)
{
for(... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin >> n;
long long ans = 0;
while (n--) {
int l, r; cin >> l >> r;
ans += (long long) r * (r + 1) / 2 - (long long) (l - 1) * l / 2;
}
cout << ans << '\n';
return 0;
}
|
// #pragma GCC optimize(3,"Ofast","inline")
// #pragma GCC optimize(2)
// #pragma GCC optimize("-Ofast","-funroll-all-loops")
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <string>
#include <iostream>... | #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 n;
vector<vector<int>> e;
P longest(int v, int per){
P mx=P(0, v);
for(int u : e[v]) if(u!=per){
P p=longest(u, v);
mx=max(mx, P(p.first+1, p.second));
}
return mx;
}
... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <iostream>
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ull unsigned long long
#define int long long
#define pre(a,b) cout<<fixed<<setprecision(a)<<b<<"\n";//a for precision b for answer
//#define mp make_pair
#define max3(x,y,z) max(x,max(y,z))
#defin... |
#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>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int h, w;
cin >> h >> w;
bool grid[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) {
char c;
cin >> c;
grid[i][j] = c == '#';
}
int vertices = 0;
for (... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
struct Edge
{
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (n);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int a,b,c;
int main()
{
scanf("%d%d%d",&a,&b,&c);
if(!c)puts(a>b?"Takahashi":"Aoki");
else puts(a<b?"Aoki":"Takahashi");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,c;
bool flag;
while(cin>>n>>m>>c)
{
if(c==0)
{
flag=true;
}
else{
flag=false;
}
if(flag&&n==0)
{
printf("Aoki\n");
continue;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = b - 1; a <= i; i--)
ll MOD = 1000000007;
ll N, K, A[800][800];
int main () {
cin >> N >> K;
rep (i, 0, N) rep (j, 0, N) cin >> A[i][j];
// 中央値がx以下の区画が存在する
// <... | #include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(a,b,c) for(int a=b;a<=c;a++)
#define per(a,b,c) for(int a=b;a>=c;a--)
#define int long long
const int N=1e6+5;
const int p=998244353;
template<class T>inline void read(T &x) {
T f=1;x=0;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar... |
// ============================================================================
// || ||
// || International University of Business,Agriculture ||
// || And Technology ||
... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define ll long long
#define int ll
#define mod 1000000007
#define DEBUG cout<<"Hello1\n";
#define all(v) (v).begin(),(v).end()
#define deb(...) debug(#__VA_ARGS__, __VA_ARGS__);
const int N =... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
int gcd(int a,int b){
if(b == 0) return a;
else return gcd(b,a%b);
}
int main(){
int n;
cin >> n;
ll ans = 0;
re... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LON... |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define eb emplace_back
#define pb push_back
#define qwerty1 first
#define qwerty2 second
#define qwerty3 -> first
#define qwerty4 -> second
#define umap unordered_map
#define uset unordered_set
#define pii pair < int , ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,y,z;
cin>>x>>y;
if(x==y) z=y;else{
if((x==0&&y==1)||(x==1&&y==0))z=2;
if((x==0&&y==2)||(x==2&&y==0))z=1;
if((x==2&&y==1)||(x==1&&y==2))z=0;
}
cout<<z<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int>pi;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
int x , y ;
cin >> x >> y ;
if( x == y ) ... |
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typede... | #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 <typename T> using vt = vector<T>;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb p... |
#include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
const int N=2005;
int a... | //Bismillahir Rahmanir Raheem
#ifdef ONLINE_JUDGE
#include<bits/stdc++.h>
#endif
#include<iostream>
#include<numeric>
#include<tuple>
#include<iomanip>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<math.h>
#include<vector>
#include<climits>
#include<algorithm>
#in... |
#include<iostream>
#include<map>
using namespace std;
const int BUF = 300005;
int nVal;
int val[BUF];
void read() {
cin >> nVal;
for (int i = 0; i < nVal; ++i) {
cin >> val[i];
}
}
void work() {
map<int, int> v2cnt;
for (int i = 0; i < nVal; ++i) {
++v2cnt[val[i]];
}
lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll linf = (1ll << 60);
int N, M;
int X[50];
bool notprime[51];
int prime[50];
int main() {
cin >> N;
for(int i = 2; i <= 50; i++) {
if(notprime[i]) continue;
prime[M++] = i;
for(int j = i; j <= 50; j += i) {
notprime[j] = 1;
}
}... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
#define pri(str) cout << str << endl
using ll = long long;
using P = pair<int, int>;
const ll MX = 1e18;
const long double PI = acos(-1);
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | // *** Though I am not John Snow, yet I know nothing ***
#include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = a; i < b; i++)
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define vi vector<int>... |
#include<bits/stdc++.h>
using namespace std;
int matrix[50][50];
int n, k;
long long MOD = 998244353LL;
vector<int> comp;
long long fact (long long i) {
long long ans = 1;
while (i > 1ll) {
ans = (i * ans) % MOD;
i--;
}
return ans;
}
void update (vector<int>* g) {
bool vis[n];
... | #include<bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419716939937510
#define eps 1e-15
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
int vis[1005][1005],n,m;
char c[1005][1005];
vector<int> a[1005],b[10... |
#include<bits/stdc++.h>
using namespace std;
int N, M;
int board[105][105];
bool vis[105][105];
int dy[4] = {-1, 1, 0, 0};
int dx[4] = {0, 0, -1, 1};
int X, Y;
bool valid(int y, int x) {
return 1<=y && y<=N && 1<=x && x<=M;
}
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
cin >> N >> M >> Y >>... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
using Int=__int128;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>b)return 0; a=b; return 1;}
#define bitUP(x,a) ((x>>a)&1)
int dx[4]={0,1,0,-1... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tr... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N;
int A[3010], B[3010], C[3010], D[3010], E[3010];
bool dp[3010][100][10];
bool unit(int mid)
{
memset(dp, false, sizeof(dp));
rep(i, N)
{
int bit = 0;
bit |= (1LL << 0) * (A[i] ... | #include<cmath>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<cstring>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<deque>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<string>
#include<sstream>
#i... |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define MAXN 1000005
#define lowbit(x) (x&-x)
#define reg register
#define mp make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigne... | #include <bits/stdc++.h>
using namespace std;
int fastio() { ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin.tie(nullptr); return 0; }
int __fastio = fastio();
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {ce... |
#include <bits/stdc++.h>
#define ll int
const ll maxx=1e9;
using namespace std;
ll func(string s[],vector<vector<ll>> &dp,ll x,ll y,ll h,ll w){
if(dp[x][y]!=maxx)
return dp[x][y];
if((x+y)%2==1){
ll val=maxx;
if(x<h-1)
val=min(val,func(s,dp,x+1,y,h,w));
if(y<w-1)
... | //我的代码：
#include<bits/stdc++.h>
#define N 2005
using namespace std;
int n,m,c[N][N],t[N][N],a[N][N],ted[N][N],aed[N][N];
//ted/aed[i][j]分别表示t/a[i][j]是否已经计算完毕
char ch;
string s;
int A(int x,int y);
int T(int x,int y);
int main(){
cin>>n>>m,getline(cin,s);//读入
for(int i=1;i<=n;getline(cin,s),i++)
for(int j=1;j<=m;... |
//112c.cpp created at 02/13/21 03:48:55
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "qpwoeirut/debug.h"
#else
#define debug
#define debug1
#define debug2
#define debug3
#endif
#define PB push_back
#define INS insert
#define FI first
#define SE second
#define sz(obj) ((int)(obj.size()))
#def... | #include <iostream>
#include <vector>
#include <algorithm>
typedef unsigned int unt;
std::vector<std::vector<unt>> adj;
int solve(unt v) {
std::vector<int> odd_difs;
int pos_even_dif_sum = 0, neg_even_dif_sum = 0;
for (auto u : adj[v]) {
int dif = solve(u);
if (dif % 2) { odd_difs.push_back(dif); }
... |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <string>
#include <list>
#include <map>
#include <unordered_map>
using namespace std;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue... |
#include <bits/stdc++.h>
#define INF 1e9
#define INFLL 1ull<<60u
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <string>
using namespace std;
typedef long long int ll;
int gcd(int a, int b)
{
while (a>0 && b>0)
{
if (a>b)
{
int c=b;
b=a%b;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mems(p) memset(p,-1,sizeof(p))
#define pb push_back
#define eb emplace_back
#define nl "\n"
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
using pi = pair<int,int>... | #include <iostream>
#include <unordered_set>
using namespace std;
using ll = int64_t;
int main(){
ll N;
cin >> N;
unordered_set<ll> s;
for(ll a = 2; a * a <= N; a++){
ll x = a * a;
while(x <= N){
s.insert(x);
x *= a;
}
}
cout << N - s.size() << en... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
void solve()
{
for(int i=0;i<n;++i){
cout<<(2*i)%n+1<<' '<<(2*i+1)%n+1<<'\n';
}
}
int main()
{
cin >> n;
solve();
} | #include <cstdio>
#include <cstring>
#include <algorithm>
#define reg register
const int N=400002;
long long ans;
bool cmp(const int &i,const int &j) {
return i>j;
}
struct heap{
int h[N],n;
void push(reg int x) {
h[++n]=x;
std::push_heap(h+1,h+1+n,cmp);
}
void pop() {
std::pop_heap(h+1,h+1+n,cmp);
--n;
}... |
#include <iostream>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <cmath>
std::array<int, 2> cog(const std::vector < std::array<int, 2>>& ps)
{
std::array<int, 2> result = { 0,0 };
for (auto& e : ps)
{
result[0] += e[0];
result[1] += e[1];
}
result[0] /= (int)ps.size();
... | //#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, ma... |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int t,n,a[100005];
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
int flag=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
if(n%2==1) printf("Second\n");
else
{
for(int i=2;i<=n;i+=... | #include<bits/stdc++.h>
#include<iostream>
#include<set>
#include<map>
#include<iterator>
#define ll long long
#define lli long long int
#define pb push_back
#define RIP(i,n) for(int i=0; i<n; i++)
#define F(i,a,b) for(int i=a; i<b; i++)
#define RIP1(i,n) for(... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <bitset>
#include <vector>
#include <stack>
#include <cstdlib>
#include <set>
#define mp make_pair
#define pb push_back
#define mem(i,a) memset(i,a,sizeof(i))
using n... | #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 gcd(ll x,ll y){
x = abs(x);
y = abs(y);
if(x < y){
swap(x,y);
}
i... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);++i)
#define rep(i,n) REP(i,0,n)
int main(){
int N;
cin >> N;
vector<vector<int>> vs;
rep(i,N){
int a,b,c;
cin >> a >> b >> c;
vector<int> tmp={a,b,c};
vs.push_back(tmp);
}
long long IN... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(int i = a; i <=b; i++)
#define rep2(i,a,b) for(int i = a; i>=b; i--)
#define PB push_back
#define MP make_pair
#de... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if (a == b == c) {
cout << c;
}
else if (a == b) {
cout << c;
}
else if (b == c) {
cout << a;
}
else if (a == c) {
cout << b;
}
else {
cout << 0;
}
}
| #include<iostream>
#include<math.h>
using namespace std;
int main() {
float R, X, Y;
cin >> R >> X >> Y;
float d = sqrt(X * X + Y * Y);
int a = ceil(d / R);
if (d < R) cout << 2 << endl;
else cout << a << endl;
} |
#include "bits/stdc++.h"
#define int long long
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
reverse(s1.begin(), s1.end());
reverse(s2.begin(),... | #include <bits/stdc++.h>
using namespace std;
#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)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define eb emplace_back
#define mp make_pair
template<class T> bool ckmin(T& a, co... |
#include<bits/stdc++.h>
using namespace std;
void p(){cout<<"Yes"<<endl;};
void q(){cout<<"No"<<endl;};
int main(){
int N;cin>>N;
vector<int> A(N);
for(int i=0;i<N;i++){
int a;cin>>a;
A.at(i)=a%200;
}
//sort(A.begin(),A.end());
//set<int> s;
map<int,vector<int>> X;
/*for(int i=0;i<N;i++){
... | #include <iostream>
#include <vector>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <climits>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;
typedef long long ll;
#define debuglist(x) for(int i = 0; i < x.size(); ++i) { cout << x[i] << " "; } cout << endl;
vo... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
const long long MOD = 1000000007;
int main(){
long double ax,ay,bx,by;
cin >> ax >> ay >> bx >> by;
if(ax==bx) cout << ax << endl;
else{
cout << fixed << setprecision(10);
if(ax<bx)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
int n;
vector<int> t,l,r;
void solve() {
ll ans = 0;
REP(i,n) {
int left = l[i], right = r[i];
int left_kai = 0, right_kai = 0;
if... |
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... | #include<iostream>
#include<algorithm>
#include<vector>
#include<math.h>
#include<functional>
#include<utility>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
for(int i = 0; i < n; ++i){
cin >> b[i];
}... |
#include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll a, b, c, d; cin >> a >> b >... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... |
#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 FastIO ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define ull unsigned long long
#define pb push_back
#define All(x) (x).begin(),(x).end()
#define mp make_pair
#define nl "\n"
typedef pair<int,int>ii;
typedef vector<int>vi;
typedef vector<ii>v... |
#include <iostream>
#include <vector>
#include <set>
using ll = long long;
int const nmax = 200000;
int v[1 + nmax * 2];
int main() {
std::ios::sync_with_stdio(0);
int n;
std::cin >> n;
for(int i = 1;i <= 2 * n; i++)
std::cin >> v[i];
std::multiset<int> myset;
ll result = 0;
for(int i = 1; i <= n... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#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... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int arr[4];
int a;
for(int i=0;i<4;i++){
cin>>a;
arr[i]=a;
}
cout << *min_element(arr,arr+4) << endl;
return 0;
} | // https://atcoder.jp/contests/abc185/tasks/abc185_a
#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 ALL(x) x.begin(), x.end()
using str = string;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vect... |
#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <iterator>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <fstream>
#... | #include <bits/stdc++.h>
using namespace std;
typedef double T;
T EPS = 1e-7;
int cmp(T x, T y = 0) {
return (x <= y + EPS) ? (x + EPS < y) ? -1 : 0 : 1;
}
struct point {
T x, y;
int id;
point(T x_ = 0, T y_ = 0, int id_ = -1): x(x_), y(y_), id(id_) {}
point operator + (const point& b) const { re... |
#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<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define ins insert
#define pqueue... |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
#define P 1000000007
#define rep(i,n) for(i=0;i<n;++i)
#define re(i,a,n) for(i=a;i<=n;++i)
#define repr(i,a,n) for(i=a;i>=n;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define endl "\n"... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 1000000007
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __pr... |
#include <bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) for (auto blockTime = make_pair(chrono::high_resolution_clock::now(), true); blockTime.second; debug("%s: %.5lf s\n", d, chrono::duration_cast<chrono::milliseconds>(chrono::high_resolutio... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin>>a;
cout<<100-a%100;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10, mod = 1e9 + 7;
void solve() {
ll n; cin >> n;
for (ll i = 1; i; ++i) {
if (i * (i + 1 ) / 2 >= n) {
cout << i ;
return ;
}
}
}
int main() {
ios::sync_with_stdio(false), cin... | #include<bits/stdc++.h>
using namespace std;
const int MaxN=1e9;
char Nss[20];
int main(){
while(scanf("%s",Nss)!=EOF){
int i, L=strlen(Nss)-1;
while(L>=0 and Nss[L]=='0')
L-=1;
for(i=0; i<=(L>>1) and Nss[i]==Nss[L-i]; i+=1);
puts( (L==-1 or i>(L>>1))? "Yes": "No");
}
} |
// Author: old_school
// Created: 16.01.2021 17:30:16
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
using namespace std;
#define lld long long int
#define ld long double
#define pb push_bac... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#def... |
#include <bits/stdc++.h>
#include <algorithm>
#include <unordered_map>
#define ull unsigned long long
#define int long long
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define frf(i, j, n) for (int i = j; i <= n; i++)
#define frd(i, n) for (int i = n; i >= 0; i--)
#define mp(i, j) make_pair(i, j)
... | #include <vector>
#include <iostream>
#include <utility>
#include <cstdio>
using namespace std;
#define EMPTY 0
#define BULB 1
#define BLOCK 2
#define LIGHT 3
int H,W,N,M;
vector<pair<int, int>> bulbs;
vector<vector<int>> grid;
int main() {
cin >> H >> W >> N >> M;
grid = vector<vector<int>>(H, vector<int>(W... |
// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a... | #include<cstdio>
#include<cstring>
using namespace std;
int main()
{
long long a,b,c;scanf("%lld%lld%lld",&a,&b,&c);
a=a*(a+1)/2%998244353;
b=b*(b+1)/2%998244353;
c=c*(c+1)/2%998244353;
printf("%lld\n",a*b%998244353*c%998244353);
return 0;
} |
#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>... | #include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
//const lint ... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define INF (1 << 30)
#define LLINF (1LL << 60)
#define MOD 998244353
//#define MOD 1000000007
#defi... |
#include <iostream>
using namespace std;
int main(void){
int v,t,s,d;
cin >> v >> t >> s >> d;
if(v*t <= d && v*s >= d){
cout << "No" << endl;
}
else cout << "Yes" << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int... |
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
#include <unordered_set>
#include <set>
#include <tuple>
#include <cassert>
#include <cmath>
us... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define inrange(a, x... |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long i = 1;
while(n>0) {
n -= i;
i += 1;
}
cout<<i-1<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,m,n) for (int i = (m); i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; --i)
#define RREP(i,m,n) for (int i = (n)-1; i >= (m); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespac... |
#include<iostream>
#include<set>
#include<cstring>
using namespace std;
const int aa=2e5+7;
bool a[aa];
int main()
{
memset(a,0,sizeof(a));
int N;
cin>>N;
int sum=0;
for(int i=0;i<N;i++)
{
int m;
cin>>m;
a[m]=1;
while(a[sum]==1)
{
sum++;
}
cout <<sum<<'\n';
}
return 0;
} | // Jai Shree Ram
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ll long long
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl "\n"
#define x first
#define y ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define pf push_front
#define F first
#define S second
#define MOD 1000000007
#define MAXN 1000001
#define MODA 998244353
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i) = 0; (i) <(n); (i)++)
#define so(v) sort(v.begin(),v.end())
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
const int MAX = 510000;
const int MOD = 1000000007;
ll gcd(ll a, ll b)
{
if (a%b == 0)
{
return(b);
}... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,y;
cin >> x >> y;
if (x==y) cout << x << endl;
else cout << 3-x-y << endl;
}
| #include "bits/stdc++.h"
using namespace std;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int x, y;
cin >> x >> y;
int mov[3] = {0};
mov[x]++; mov[y]++;
if(x==y){
cout << x << "\n";
}
else{
for(int i=0; i<3; i++){
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)//iをaからn
#define per(i,n,a) for (int i=a-1;i>=n;i--)//iをnからa
#define db(x) cout << #x << " = " << x << endl
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#define all(x) (x).begin(), (... | #include <bits/stdc++.h>
int main() {
std::vector<int> a(3);
std::cin >> a[0] >> a[1] >> a[2];
std::sort(a.begin(), a.end());
if (a[1] - a[0] == a[2] - a[1]) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
}
|
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<vector>
#define fs(i,x,y) for(int i=(x),_=(y);i<=_;++i)
#define fn(i,x,y) for(int i=(x),_=(y);i>=_;--i)
#define tor(i,v,x) for(int i=head[x],v=to[i];i;i=nxt[i],v=to[i])
#define Li inline... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
std::cin >> n;
vector<ll> a(n),b(n),p(n);
priority_queue<pair<ll,ll>,vector<pair<ll,ll>>> pq;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 600007
signed main(){
int n;
cin>>n;
int arr[n];
map<int , int> m;
for(int i = 0 ; i < n ; i++){
cin>>arr[i];
m[arr[i]]=i;
}
int st = 0;
int l = 0;
vector<int> ans;
for(int i = 1 ; i <=... | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long... |
#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define ini(x, y) memset(x, y, sizeof(x));
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = (int)1e9 + 7;
const in... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<list>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<cmath>
#include<cctype... |
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>... | #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... |
/* Great things never come from comfort zones,
"whatever the mind of a man can conceive and believe,it can achieve." */
#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;
// ... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cout << x;}
void __print(long x) {cout << x;}
void __print(long long x) {cout << x;}
void __print(unsigned x) {cout << x;}
void __print(unsigned long x) {cout << x;}
void __print(unsigned long long x) {cout << x;}
void __print(float x) {cout << x;}
void... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<double> a(N),b(N),c(N),d(N);
for(int _=0; _<2; _++){
for(int i=0; i<N; i++) cin >> a[i] >> b[i];
int x = 0, y = 0;
for(int i=0; i<N; i++){
x += a[i];
y += b[i];
a[i] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector <string> vs;
typedef vector<vector<int>> vvi;
typedef pair<int,int> pi;
//#define int ll
#define forl(i,a,b) for (int i = a; ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0), ios::sync_with_stdio();
int n, mn = 1001, mx = -1, x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
mx = max(mx, x);
}
for (int i = 0; i < n; i++) {
cin >> x;
mn = min(mn, x);
}
if (mx > mn... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int main(void){
int N;
cin >> N;
int A[N], B[N];
vector<int> x;
rep(i, N) cin >> A[i];
rep(i,... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll count=0;
ll cyan=a;
ll red=0;
while(cyan>red)
{
if(count>100000)
{
cout<<-1<<endl;
return 0;
}
cyan+=b;
red+=c;
... | #include <iostream>
#include <vector>
#include <unordered_map>
#include <deque>
#include <list>
#include <set>
#include <random>
#include <deque>
#include <unordered_set>
using namespace std;
using ll = long long;
const ll BIG = 1000000007;
int main() {
ll x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
if(x1... |
#include<bits/stdc++.h>
using namespace std;
void dfs(vector<vector<int > > &g,int s,int &n,int &m,int &ans,vector<int > &vis)
{
if(vis[s])
return;
vis[s]=1;
for(unsigned int i=0;i<g[s].size();i++)
{
if(!vis[g[s][i]])
{ ans++;
dfs(g,g[s][i],n,m,ans,vis);
}
}
return ;
}
int main()
{
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using Graph = vector<vector<int>>;
ll ans = 0;
vector<bool> seen;
void dfs(Graph &g,int v){
seen.at(v) = true;
ans++;
for(auto nv:g.at(v)){
if(!seen.at(nv)){
dfs(g,nv);
... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = (int)1e9 + 7;
int binpow(int a, int b) {
a %= MOD;
int res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int inverse(int x){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
map <string, int> str; // map のデータ構造を用意する。
string s[200010];
int main() {
int n;
cin >> n;
rep(i, n) {
cin >> s[i];
if (s[i].at(0)=='!'){
if (str[s[i]]==1){
cout << s[i].substr(1) << endl;
return 0;
... |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long int
#define sd(x) scanf("%lld",&x)
#define sdi(x) scanf("%d",&x)
#define sdc(c) scanf("%c",&c)
#define inf 1000000000000000000ll
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fastio ios_base::sync_w... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define pll pair <long long,long long>
#define ss second
#define ff first
#define inf (ll)1e18
#define mod 998244353
#define ld long double
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL... |
#include <bits/stdc++.h>
#define br cout << "\n";
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define in(a , idx , n ) for (int i = idx ; i < n ; ++i)cin >>a[i];
#define fix() cout <<fixed << std::setprecision(10)
using namespace std;
const int MOD ... | #line 1 "C.cpp"
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
#if defined(DONLINE_JUDGE)
#define NDEBUG
#elif defined(ONLINE_JUDGE)
#define NDEBUG
#endif
template<typename T> std::vector<T> m... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;using vl=vector<ll>;
using vi=vector<int>;using vs=vector<string>;using vc=vector<char>;
using vvl=vector<vl>;using pl=pair<ll,ll>;using vvc=vector<vc>;
using vd=vector<double>;using vpl=vector<pl>;using vb=vector<bool>;
#define rep(i,r) for(ll i=0;i<(r);... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define setIO(x) freopen(x".in", "r", stdin), fre... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,h;
cin>>m>>h;
if(h%m==0){
cout<<"Yes\n";
}
else{
cout<<"No\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define F first
#define S second
#define YES(n)cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
int main(){
int M,H;
... |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... |
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int n,m;
int sa;
int ans1,ans2;
int ksm(ll ta,int tp){
int s=1;
for(;tp;ta=ta*ta%mod,tp>>=1) if(tp&1) s=ta*s%mod;
return s;
}
int main(){
scanf("%d %d",&n,&m);
m+=n;
for(int i=1,a... | #include <bits/extc++.h>
using namespace std;
using namespace __gnu_cxx;
template<typename T>
int ex(T p){
T a = 1;
if(p == 0){
return a;
}
else{
for(T i = 1; i <= p; i++){
a = a*i%1000000007;
}
return a;
}
}
template<typename T>
int eq(T p, T q){
T r,s = 0,nextp,prevp = 0,prev2p = ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(a... | #include <iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<math.h>
#include<climits>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("ou.txt", "w", stdout);
#endif
int a, b; cin >> a >> b;
vector<int> v, v1;
if (a > b) {
int sum = 0, sum1 = ... |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
using ll = long long int;
int main(){
int a, b; cin >> a >> b;
cout << (a+b)/2 << " " << (a-b)/2 << endl;
return... | #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() {
ll N, M;
cin >> N >> M;
if ((M > 0 && M >= N - 1) || M < 0) {
cout << -1 << endl;
return 0;
}
vector<P> ans(N);
rep(i, N) ... |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
////
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <utility>
#define all(x) (x).begin(), (x).end()
#define allp(x) (x)->begin(), (x)->end... | /**
* Author: Daniel
* Created Time: 2021-04-03 10:23:06
**/
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ER erase
#define IS insert
#define PI acos(-1)
#define PB pop_back
#define MP make_pair
#define MT make_tuple
#define LB lower_bound
#define UB upper_bound
#define EB... |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... | #include <bits/stdc++.h>
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2")
using namespace std;
void solve(){
int64_t s, p;
cin >> s >> p;
vector<int64_t> div;
for (int64_t i = 1; i*i <= p; i++)
{
if(i*i == p) div.push_back(i);
else if(p ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define BE(x) x.begin(), x.end()
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (auto &x : s) cin >> x;
vector<bitset<2>> cnt;
for (int j = 0; j < w; j++) {
bitset<2> bs;
int jj = j;
for... | #include <bits/stdc++.h>
using namespace std;
const int64_t inf = 998244353;
int main() {
int H, W, HW, k=1;
int64_t ans = 1;
cin >> H >> W;
HW = H + W - 1;
string S, AllS;
vector<int> vec(HW);
bool f = true;
cin >> S;
AllS = S;
for(int i = 1; i < H; i++){
cin >> S;
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<pair<unsigned long long int,unsigned long long int>> f(n);
for(int i=0; i<n; i++){
cin >> f[i].first >> f[i].second;
}
sort(f.begin(),f.end());
unsigned long long int money = k;
unsigned ... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL long long unsigned
#define LD long double
#define ff first
#define ss second
#define FOR(i,n) for(int i=0;i<n;i++)
#define FLR(i,n) for(LL i=0;i<n;i++)
#define RFOR(i,n) for(... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,x;
long long sum=0;
cin>>n>>x;
for(int i=1;i<=n;i++)
{
int v,p;
cin>>v>>p;
sum+=(v*p);
if(sum>x*100)
{
cout<<i;
break;
}
}
if(sum<=x*100)
cout<<-... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define f(i,j,n) for(int i = j; i <= n; i++)
#define r(i,n,j) for(int i = n; i >= j; i--)
#define all(container) container.begin() , container.e... |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) co... |
#pragma GCC optimize ("-O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typed... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lld;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
#define MOD 998244353
lld DP[10000][10000];
lld calc(int a, int b){
//cout<<a<<" "<<b<<endl;
if(a<0 || b<0 || a<b)return 0;
//out<<a<<" "<<b<<endl;
if(DP[a][b]!=-1)re... | #include<bits/stdc++.h>
#define ll long long
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define N 200005
#define M 1000000007
#define pii pair<ll,ll>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
ll bigmod(ll a,ll n)
{
if(n==0)
return 1;
ll ans=bigmod(a,n/2);
ans=(ans*ans)... |
#include <bits/stdc++.h>
long long extGCD(long long a, long long b, long long c, long long &x, long long &y){
long long a_gcd = a;
long long b_gcd = b;
std::vector< long long > A, B;
A.push_back(a_gcd);
B.push_back(b_gcd);
while(b_gcd != 0){
long long tmp = a_gcd % b_gcd;
a... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... |
#include<bits/stdc++.h>
#define int long long
#define rint regester int
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
using std::ios;
using std::cin;
using std::cout;
using std::max;
using std::min;
using std::sort;
using std::unique;
using std::lower_bound;
using std::swap;
using std::abs;
using std::acos;
using... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
//#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#de... |
#define IOS ios::sync_with_stdio(false);
#define rep(i, a, n) for(ll i=a;i<=n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
ll n, m, t, k, ans, cnt, sum, flag;
ll arr[N], vis[N];
char s[20][20];
... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
//To debug : g++ -g file.cpp -o code
//to flush output : fflush(stdout) or cout.flush()
//cout<<setprecision(p)<<fixed<<var
//use 1LL<<i to for 64 bit shifting , (ll)2 because by default 2 is ll
//take care of precedence rule of operators
//do not forget to change the sizes of arrays and value of contants and other t... | //
// Created by Bottomline2sky on 1/10/2021.
//
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll result(vector<pair<ll,ll>>&p){
if((ll)p.size() == 2){
if(p[0].first>p[1].first){
return p[1].second;
}
else{
... |
#include <bits/stdc++.h>
//#include "atcoder/all"
using namespace std;
using ll = long long;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
using pii = pair<int, int>;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<vector<ll>> dp(65, vector<ll>(2));
dp[0][0] = 1;
dp[0][1] = 1;
for (int i = ... | /* Author : Kaustubh Gangwar
Institute : IIITA */
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define gcd __gcd
#define vi vector<int>
#define vll vector<long long>
#define all(x) (x).begin(), (x).end... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
for (auto &e : a) cin >> e;
for (auto &e : b) cin >> e;
for (int i = 0; i + 1 < n; i++) a[i + 1] = max(a[i + 1], a[i]);
ll r = 0;
for (int i = 0; i < n; i++) cout << (r = max(r, a[... | #pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define IO std::ios::sync_with_stdio(false); cin.tie(0)
#define ll long long
#define ull unsigned long long
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rep(i, l, r) for (int i = l; i <= r; i++... |
#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 <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <random>
#include <fstream>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %... |
#include <bits/stdc++.h>
#include <string>
//#include <boost/multiprecision/cpp_int.hpp>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long
#define fp cout<<fixed<<setprecision(9);
#define ifor(j,n) for(int i=j ;i<n;i++)
#define jfor(k,n) for(ll j=k ;j<n;j++)
#define pb push_back
#defin... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin >> N >> A >> B;
cout << N - A + B << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define pb push_back
map<string, bool> visited;
vector<vector<string>> adj;
/*void dfs(string s, ll &k)
{
visited[s] = 1;
ll len = adj[a].size();
for (int i = 0; i < len; i++)
{
if (!visited[adj[a][i]])
{
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a ... |
# pragma GCC optimize ("O3")
# pragma GCC optimize ("Ofast")
# pragma GCC optimize ("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define rep2(i,a,b) for(int i = (b) - 1; i >= (a); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) i... |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int T, n;
string s1, s2, s3;
int main()
{
std::ios::sync_with_stdio(0);
cin >> T;
while (T--) {
cin >> n;
cin >> s1 >> s2 >> s3;
for (int i = 1; i <= n; i++) cout << '0';
for (int i = 1; i <= n; i++) cout <... | #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_... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.