code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#if _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#ifndef ONLINE_JUDGE
const bool DEBUG = true;
#else
const bool DEBUG = false;
#endif
void read() {}
template<class T>
void read(vector<T>& var) { for (int i = 0; i < (in... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
using ld=long double;
const ld PI = acos((ld)-1);
using ll= ... |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
template<class T>
ostream &operator<<(... | #include <bits/stdc++.h>
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
std::vector<std::string> split(const ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef struct nodes{
ll x,y,z;
}node;
node m[3000];
ll d[300][300];
ll dp[1<<18][18];
int main()
{
ll n;
cin>>n;
for(ll i=1;i<=n;i++)
{
cin>>m[i].x>>m[i].y>>m[i].z;
}
for(ll i=1;i<=n;i++)
{for(ll j=1;j<=n;j++)
{
d[i][j]=abs(m[i].x-m[j... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
ll n;
vector<ll> x, y, z;
ll dp[1ll<<18][20];
const ll INF = 1ll<<60;
ll rec(ll s, ll v){
if(dp[s][v] != 0) return dp[s][v];
... |
#include<bits/stdc++.h>
#define ll long long
#define sameer ios_base::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
int main() {
sameer;
ll n; cin>>n;
ll a[n],ans=0;
for(int i=0; i<n; i++) cin>>a[i];
map<int, int> m;
for(int i=0; i<n; i++) {
ans= ans + m[a[i]-(a[i... | #include<iostream>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
while(k--)
{
(n%200==0)?n/=200:n=n*1000+200;
}
cout<<n;
return 0;
} |
#include <iostream>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <random>
#include <casser... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); // Do not flush "cout" when processing "cin".
string x;
ll m;
cin >> x >> m;
// コーナーケース
if ((int)x.size() == 1) {
if (stoi(x) <= m) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}... | #include"bits/stdc++.h"
using namespace std;
using ll=long long;
template<class T=ll>inline T in(istream&is=cin){T ret;is>>ret;return ret;}
template<class T,class Size=typename vector<T>::size_type>inline auto vector_2d(Size h,Size w,T v){return vector<vector<T>>(h,vector<T>(w,v));}
template<class P>struct comp_pair_by... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define mod 998244353
#define pb push_back
#define mp make_pair
#define bs binary_search
#define lb lower_bound
#define ub upper_bound
#define gcd __gcd
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define min3(a,b,c) min(a,min(b... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cerr << #x << ": " << x << '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).r... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string ufo;
cin >> ufo;
int compCount = 0;
for(int i = 0; i+3 < ufo.size(); i++)
{
if(ufo.at(i) == 'Z' && ufo.at(i+1) == 'O' && ufo.at(i+2) == 'N' && ufo.at(i+3) == 'e')
{
compCount++;
}
}
cout << compCount << endl;... | #include <iostream>
using namespace std;
bool check(int x, string s){
int size;
size = s.size();
if (x + 4 > size){
return false;
}
if (s.substr(x, 4) == "ZONe"){
return true;
}else{
return false;
}
}
int main(){
string a;
int count;
count = 0;
cin ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | // clang-format off
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forn1(i,n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcount
... |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
int main(){
int N, Q;
cin >> N;
vector<long long> a(N), t(N);
for(int i = 0; i < N; i++) cin >> a[i] >> t[i];
long long MIN = -INF;//上限
long long MAX = INF;//下限
long long temp = 0;
bool flag = false;
l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
using namespace std;
using ll = long long;
#define INF 1001001001001001
int main (){
ll n;
cin >> n;
ll max=-INF, min=INF, bias=0;
rep(i, n){
ll a; int t;
cin >> a >... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define ff first
#define ar array
#define ss second
#define ll long long int
#define mem(x) memset(x,0,sizeof(x))
#define setbits(x) __builtin_popcount(x)
#define ull unsigned... | #pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
set<char> s1;
int i;
for(i=0;i<s.length();i++)
{
s1.insert(s.at(i));
}
if(s1.size()==1)
cout<<"Won";
else
cout<<"Lost";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
if(n<191)
cout << "Yay!" << endl;
else if(n==191)
cout << "so-so" << endl;
else
cout << ":(" << endl;
} |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
using ll = long long;
int main(){
ll n; cin >> n;
ll a[n], mod[200] = {0};
for (ll i = 0; i < n; i++){
cin >> a[i];
}
for (ll i = 0; i < n; i++) {
mod[a[i]%200]++;
}
ll ans = 0;
for (ll i... | #include <bits/stdc++.h> /*Fuck ratings Feel the magic in the code...*/
// #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 oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statisti... |
#include<iostream>
#include<vector>
using namespace std;
const int BUF = 105;
const int EDGE = BUF * BUF;
const int MOD = 1000000007;
int add(int a, int b) {
return (a + b) % MOD;
}
int mul(int a, int b) {
return 1LL * a * b % MOD;
}
int modpow(int p, int n) {
if (n == 0) return 1;
int t = modpow(p,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
typedef pair<int,int> pii;
#define forr(i,x,n) for(int i = n;i >= x;--i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
#define x first
#define y second
const int N = 105,MOD = 1e9+7;
pii edges[N * ... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
//#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
constexpr int N = 1e5 + 5;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
cin >> n;
cout << (1 << n) - 1 << endl;
for (int i = 1; i < (1 << n); i++) {
for (int j = 0; j < (1 << n); j++) {
cout << char('A' + (__buil... |
#include <iostream>
#include <cstring>
using namespace std;
string s[61];
long long n, memo[61][2];
long long f(int idx, int a)
{
if (idx == n) return a;
if (memo[idx][a] != -1) return memo[idx][a];
return memo[idx][a] = (s[idx] == "OR" ? f(idx + 1, a|1) + f(idx + 1, a|0) : f(idx + 1, a&1) + f(idx + 1, a... | #include <bits/stdc++.h>
using namespace std;
#define boostIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, b, a) for (int i = b; i >= a; i--)
#define int long long
#define fi first
#define se second
#... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll arr[n];
ll sum=0;
for (ll i=0;i<=n-1;i++)
{
cin >> arr[i];
sum+=arr[i];
}
s... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector<ll> A(N);
for(int i=0; i<N; ++i){
cin >> A[i];
}
ll ans = -1;
for(int i=0; i<N; ++i){
ll max_x = A[i];
for(int j=i; j<N; ++j){
max_x = min(m... |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 200005
#define lowbit(x) (x&-x)
#define reg register
#define mp make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigned long long uLL;
const int INF=0x3f3f3f3f;
const int mo=1e9+7;
const int iv2=5e8+4;
const int lim=1000000;
const i... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define double long double
#define rbtree __gnu_pbds::tree<int,__gnu_pbds::null_type,less<int>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>
#define int ll
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define pb push_back
#define ALL... |
#include<iostream>
#include<iomanip>
#include<string.h>
#include<string>
#include<algorithm>
#include<map>
#include<iterator>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>
#define li long int
#define ll long long int
#define lli unsigned long long int
#define mod 1e9+7
using namespa... | #include <bits/stdc++.h>
using namespace std;
const int N = 20;
mt19937 mt;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
mt.seed(time(nullptr));
int n, m;
cin >> n >> m;
vector<string> v(m);
for (auto& i : v) {
cin >> i;
}
//sort(... |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<list>
#include <cstring>
#include <functional>
#include<unordered_map>
#include<unordered_set>
#include<bitse... | #include "bits/stdc++.h"
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
using ll = long long;
template <typename T>
void print_vec2(const vector<vector<T>>& v){
cout << endl; cout << " ";
for(ll i=0; i<v[0].size(); i++) cout << i << " ";
cout << end... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
// using namespace atcoder;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}e... | #include <bits/stdc++.h>
#define LL long long
#define pb push_back
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
template <class T> T read(T &a) {
a=0;char x=getchar();bool f=0;
for(;x<'0'||x>'9';x=getchar())f|=x=='-';
for(;x>='0'&&x<='9';x=getchar())a=(a<<3)+(a<<1)+... |
#include<iostream>
using namespace std;
int main()
{
int n,kk;
int sum=0;
cin >> n >> kk;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=kk; j++)
{
sum+=i*100+j;
}
}
cout <<sum;
}
| #include <iostream>
int main()
{
int N, K;
std::cin >> N >> K;
long long sum = 100 * K * N * (N + 1) / 2 + N * K * (K + 1) / 2;
std::cout << sum;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
//constexpr long long MOD = 1000000007;
constexpr long long MOD = 998244353;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define al... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#incl... |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<string.h>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<cmath>
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
int ans=0x3f3f3f3f;
for(int i=1;i<=n;i++){
int a,b,c;
... | #pragma GCC optimize("Ofast")
//#ifndef ONLINE_JUDGE
//#define _GLIBCXX_DEBUG
//#endif
#ifdef ONLINE_JUDGE
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
#include <chrono>
#include <random>
#include <math.h>
#include <complex>
using namespace std;
#ifdef ONLINE_JUDGE
using namespace atcoder;
#endif
#defi... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define ull unsigned ll
#define ld long double
#define mod 1000000007
#define pb push_back
#define pf push_front
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n),b(n),c(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
rep(i,n) cin >> c[i];
// 0<= i <=n and 0<=j <n
// a[i] == b[c[j]]
/... |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define fp(x, a, b) for(int x = a; x < b; x++)
#define fn(x, a, b) for(int x = a; x > b; x--)
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#def... | #include <bits/stdc++.h>
#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 pb push_back
#define eb emplace_back
using namespace std;
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = lo... |
#include<stdio.h>
int main(void){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
printf("%d",21-(a+b+c));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
cout<<21-a-b-c<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(i,a,n) for (int i=a; i<n; i++)
int n;
int a[1001],b[1001];
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
cin>>n;
forn(i,0,n)
cin>>a[i]>>b[i];
int... | #include <bits/stdc++.h>
using namespace std;
template<typename T, typename V> using umap = unordered_map<T, V>;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
using mapii = map<int, int>;
usi... |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define ll long long
#define ld long double
#define sz(x) (ll)x.size()
#... | #include <bits/stdc++.h>
#define DeltaCube23 ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define minimum(a) *min_element(a.begin(), a.end())
#define maximum(a) *max_element(a.begin(), a.end())
#define MOD 1000000007
#define forf(i,a,b) for(int i = (a); i <... |
#include<iostream>
using namespace std;
int main()
{
int x,y;
cin >> x >> y;
if(x==y)
{
if(x==0 && y==0)
{
cout << "0";
}
if(x==1 && y==1)
{
cout << "1";
}
if(x==2 && y==2)
{
cout << "2";
}
}
else
{
if((x==1 && y==2) || (x==2 && y==... | #include<bits/stdc++.h>
#define w(x) int x; cin>>x; for(int tc=1;tc<=x;tc++)
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define pb push_back
#define pqg priority_queue<int>
#define pqs priority_queue<in... |
#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>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define i... |
/*
Author : Aditya Gupta
Team : TechTurtle
Date : 29-08-2020
Time : 20:05:54
*/
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define vll vector<ll>
#define vvll vector< vll >
#define vld vector< ld >
#define vvld vector< vld >
#define pll pair<ll ,ll >
#define vpll vector< pll >
#define mp ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... |
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define f(i,n) for(int i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
using namespace std;
void test(){
ll n,m;
cin>>n>>m;
ll o = 0, e = 0;
f(i,n){
string s;
cin>>s;
int cnt = 0;
f(j,m){
if(s[j]=='1')cnt++;
}
... | // 2021-04-17 16:11:14
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i =... |
using namespace std;
#include<string>
#include<cmath>
#include<list>
#include <map>
#include <unordered_map>
#include <set>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ml map<ll,ll>
#define pb push_back
#define mp make_pair
#define ppl pair<ll,ll>
#define F first
#define S second
... | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int N = 200010;
LL a[N], b[N];
long long c[N];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i ++) scanf("%d", &a[i]);
for (int i = 0; i < n; i ++) scanf("%d", &b[i]);
LL res = 0, maxd = 0;
... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
//reverse(s.begin(),s.end())
ll gcd(ll a,ll b){
ll s=1,c;
while(a&&b){
if((~a&1)&&(~b&1))
a>>=1,b>>=1,s<<=1;
else if(~a&1)a>>=1;
else if(~b&1)b>>=1;
else if(a>b)a=a-b;
else c=b-a,b=a,a=c;
}... | #include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = (ll)1000000007;
vector<ll> nums;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t, a, p, x, ans=1999999999, n;
ll k;
string s1, s2;
bool sad = false;
cin >> n;
while(n--) {
cin >> a >> p >>... | #include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define INT(...) \
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int v,t,s,d;
cin >> v >> t >> s >> d;
if(v*t <= d && v*s >= d){
cout << "No" << endl;
}else{
cout << "Yes" << endl;
}
} | /* Code by Brother_mohit */
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define tc int tt; cin>>tt; for(int t=1; t<=tt; t++)
#define ll long long
#define um unordered_map
#defi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = 2e9;
const ld EPS = 1e-9;
const int M = 31;
const int N = 1e6 + 10;
char c[5];
/*
char get_ch(char a, char b) {
if (a == 'A') {
if (b == 'A') return c[0];
return c[1];
}
if (b == 'A') return c[2... | #include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef pair<int,int> pii;
typedef pair<long long int,long long int> plli;
typedef vector< vi > vvi ;
typedef vector< vlli > vvlli ;
... |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
// #define int long long
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
vector<pair<int,int>> vec;
for(int i = 0; i < (1 << n); i += 2) {
int x, y; cin >> x >> y;
if(x > y) vec.push_back({x, i});
else ... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std; using ll = long long; usi... |
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int ms, nfms, mf;
cin >> nfms >> mf;
ms = nfms + mf;
if(ms >= 15 && mf >= 8){
cout << 1 << endl;
}
else if(ms >= 10 && mf >= 3){
cout << 2 << endl;
}
else if(ms >= 3){
cout << 3 << endl;
}
else{
cout << 4 << endl... |
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
temp... | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
using ll = long long;
int main() {
int N,i;
cin>>N;
vector<ll> x(N);
for (i=0;i<N;i++) {
cin>>x[i];
x[i] = abs(x[i]);
}
ll l1=0, l3=0;
long double l2=0;
for (i=0;i<N;i++) {
l1 += x[i];
l2 += x[i]*x[i];
l3 = max... |
#include<iostream>
using namespace std;
int main()
{
int A,B,C;
cin>>A>>B>>C;
if(C==0){
if(A>B){
cout<<"Takahashi"<<endl;
}else{
cout<<"Aoki"<<endl;
}
}
if(C==1){
if(A<B){
cout<<"Aoki"<<endl;
}else{
cout<<"Takahashi"<... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a+c > b){
cout << "Takahashi";
} else {
cout << "Aoki";
}
return 0;
}... |
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int n,m;
char tu[105][105];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
cin>>tu[i]+1;
int res=0;
for(int i=1;i<=n;i++)
{
for(in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
int h,w;cin>>h>>w;
vector<string> v;
string last(w+1,'#');
rep(i,h){
string s;cin>>s;
v.push_back(s);
v[i].push_back('#');
}
int ans=... |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
long long a1=a,b1=b;
long long m = 1ll;
for (long long i = 1ll; i <= b; i++) {
m *= a + i;
m /= i;
}
long long l = 1ll, u = m;
for (long long i = 0; i < (a1 + b1); i++) {
if(a+b==0) continue;
if ... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize "trapv"
#define ll long long
int const siz = 60;
ll nCr[siz+1][siz+1];
void precomputation() {
nCr[1][0] = nCr[1][1] = nCr[0][0] = 1;
for (int i=2;i<=siz;i++) {
nCr[i][0] = 1;
for (int j=1;j<=i;j++)
nCr[i][j] = nC... |
#include<bits/stdc++.h>
#define reg register
#define For(i,a,b) for(reg int i=(a),i##END=(b);i<=i##END;i++)
#define Rof(i,b,a) for(reg int i=(b),i##END=(a);i>=i##END;i--)
#define go(u) for(reg int i=head[u];i;i=nxt[i])
#define int long long
using namespace std;
inline int read(){
int x=0,f=1;
char ch=getchar();... | #define _CRT_SECURE_NO_DEPRECATE
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#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 SYNC std::ios_base::sync_with_stdio(0);ci... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
vector<ll> c(4);
rep(i,4)cin >> c.at(i);
sort(c.begin(),c.end());
ll x=c.at(0)+c.at(1)+c.at(2);
if(x==c.at... | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include <functional>
template <typename T>
inline void hash_combine(std::size_t &seed, const T &val) {
seed ^= std::hash<T>()(val) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
template <typename T> inline void hash_val(std::size_t &s... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> //required
//#include <ext/pb_ds/tree_policy.hpp> //required
//using namespace __gnu_pbds; //required
using namespace std;
//template <typename T> using ordered_set = tree<T, null_typ... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
using namespace std;
const int nax = 3005;
const int mod = 998244353;
ll dp[nax][nax];
int n,k;
void solve(){
cin >> n >>... |
#pragma GCC optimize("O3")
// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#defi... | #include<bits/stdc++.h>
using namespace std;
const int mod = 998244353, MAXW = 100;
int sum(int a, int b) {
return a+b<mod?a+b:a+b-mod;
}
int cnt[101], f[10001][101], g[10001][101];
int inv[101], fact[101], invfact[101];
int main() {
int n, tot = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int w;
cin >> w;
++... |
//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... | // DeNsE - EcLiPsE //
// WHAT is DEAD may NEVER die //
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <cmath>
#include <iomanip>
#include <set>
#include <cstring>
#include <stack>
#include <sstream>
#include <queue>
#include <unordered_set... |
#include<bits/stdc++.h>
using namespace std;
int n,a[102],maxn,ans,w;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]),maxn=max(maxn,a[i]);
for(int i=2;i<=maxn;++i){
int cnt=0;
for(int j=1;j<=n;++j)
if(__gcd(a[j],i)==i)
++cnt;
if(cnt>ans)
ans=cnt,w=i;
}
printf("%d\n",w);
} | #include <cstdio>
#include <cstring>
#include <map>
#include <iostream>
#include <queue>
#include <string>
#include <memory.h>
#include <set>
#include <ctime>
#include <stack>
#include <cmath>
#include <vector>
#include <algorithm>
#include <limits>
#include <climits>
#include <list>
#include <ctime>
#define null NULL
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | #include<iostream>
#include<vector>
using namespace std;
const int N=1e6+7;
int n,a[N],b[N],sa,sb;
vector<int>ho,aq;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%1d",&a[i]);
sa+=a[i];
if(!a[i])ho.push_back(i);
}
for(int i=1;i<=n;i++){
scanf("%1d",&b[i]);
sb+=b[i];
if(!b[i])aq.push_back(i);... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 55;
int n,m,q, box[N], tmp[N];
struct node{
int w, v;
}a[N];
int cmp(node n1, node n2){ return n1.v > n2.v;}
int main(){
cin >> n >> m >> q;
for(int i = 1; i <= n; ++ i) cin >> a[i].w >> a[i].v;
sort(a + 1, a + 1 + n, cmp);
for(int... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define PI 3.14159265358979323846264338327950288419716939937510
#define mp make_pair
#define vvl vector<vector<ll>>
#define vll vector<ll>
#de... |
#include <iostream>
using namespace std;
int main()
{
long long n,count=0,ans=0;
cin>>n;
for(long long i=1000;i<=n;i = i*1000)
{
ans = ans + (n-i);
count++;
}
cout<<ans+count;
return 0;
} | #pragma GCC optimize("Ofast")
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <set>
#include <map>
#incl... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int ans = 1001001001;
rep(i,n) {
int a, b, x;
cin >> a >> b >> x;
int cnt = x - a;
if (cnt > 0) ans = min(ans, b);
}
if ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <string>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int N;
cin >> N;
vector<pair<ll, ll>> vec(N);
for (int i = 0; i < N; ++i)
{
ll a, p, x;
cin >> a >> p >> x;
vec[i]... |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
#define INF 1e9
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define all(x) (x).begin(),(x).end()
int main() {
int A,B,C;
ci... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a > b) cout <<"Takahashi";
else if(a < b) cout << "Aoki";
else if (a == b && c == 0) cout << "Aoki";
else cout <<"Takahashi";
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
double dp[101][101][101];
int main(){
int A,B,C;
cin>>A>>B>>C;
dp[A][B][C]=1;
double ans=0;
for(int a=A;a<100;++a){
for(int b=B;b<100;++b){
for(int c=C;c<100;++c){
int s=a+b+c;
int d=s+1-(A+B+C);... | // Username: WillTheBill
// Time of creation: 2020-11-22 13:51
// Original filename: m.cp.cpp
#include<bits/stdc++.h>
using namespace std;
// shortcuts
#define pb push_back
#define fi first
#define se second
#define all(_v) _v.begin(),_v.end()
#define ll long long
// IO
#define multitest signed __T; cin >> __T; whil... |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin>>n;
for(ll i =3,a=1; i<n; i*=3,a++){
for(ll j=5,b=1; j<n; j*=5,b++){
if(i+j==n){
cout<<a<<" "<<b;
return 0;
}
}
}
cout<<"-1"<<endl;
return 0;
... | /* winners never quit and quitters never win.
#swap */
#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;
#pragma GCC optimize ("-O3")
using ll = long long;
using ld = long ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N = 0;
cin >> N;
string s[60] = {};
long long ans = 1;
for(int i = 0 ; i < N ; i ++)
cin >> s[i];
for(int i = 0 ; i < N ; i ++)
if(s[i] == "OR")
ans += 1ll << (i + 1);
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int n;
cin >> n;
int x=1,y=1;
for(int i=0;i<n;i++){
string s;
cin >> s;
int nx,ny;
if(s=="AND"){
nx=x,ny=x+2*y;
}
else {
nx=2*x+y,ny=y;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define len(x) int((x).size())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define randint(n) uniform_int_distribution<int>(1, (n))(rng)
const ll p... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_poizcy.hpp>
typedef long long ll;
typedef long llu;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define mem(a,h) memset(a, (h), sizeof(... |
#include<bits/stdc++.h>
#include<iostream>
#define mi map<int,int>
#define umi unordered_map<int,int>
#define pii pair<int,int>
#define si set<int>
#define st stack<int>
#define di deque<int>
#define qi queue<int>
#define pq priority_queue<int>
#define dl deque<long long int>
#define usi unordered_set<int>
#define vi... | #include <bits/stdc++.h>
using namespace std ;
#define int int64_t
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)
#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#... |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __... | #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 ins insert
#define pqueue(x) priority_queue<x... |
typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n,k;
std::cin >> n>>k;
vector<vector<ll>> t(n,vector<ll>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
std::cin >> t[i][j];
}
}
ll... | #include<bits/stdc++.h>
#define R register
#define ll long long
using namespace std;
const int MAXN =25;
vector <int> edge[MAXN];
int tot,dfn[MAXN],col[MAXN],pos[MAXN];
int n,m;
ll ans;
bool vis[MAXN];
void make_list(int k)
{
if(vis[k]) return ;
vis[k]=1;
dfn[++tot]=k;
pos[k]=tot;
for(R int i=0;i<edge[k].size();++... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define nl cout<<endl
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define ... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... |
//
// a.cpp
//
//
// Created by Sagar Singh on 13/12/20.
//
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <list>
#in... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, Q;
string S;
cin >> N >> S >> Q;
int t[Q], a[Q], b[Q];
for (int i = 0; i < Q; i++)
cin >> t[i] >> a[i] >> b[i];
char temp;
bool f = false;
for (int i = 0; i < Q; i++)
{
if (t[i] == 1)
{
... |
#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... | //YashS
#include <bits/stdc++.h>
using namespace std;
#define test int T;cin>>T;while(T--)
#define int long long
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)((x).size())
#define fr first
#define sc ... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e12;
#define D long double
#define NeedForSpeed ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int MOD = 1000000007;
#define fi first
#define se second
#define endl '\n'
// random_device rd;
/... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &x){
x = 0; int f = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') f = -1; ch = getchar();}
while (isdigit(ch)) {x = x * 10 + ch - '0'; ch = getchar();}
x *= f;
}
inline void write(int x){if (x > 9) write(x/10); putchar(x%... |
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
read(x);read(a...);... | #include <bits/stdc++.h>
using namespace std;
const int maxn=500005;
char s[maxn];
int pos1[maxn],n1,pos2[maxn],n2;
int main()
{
int i,j;
long long ans=0;
scanf("%*d%s",s);
for(i=0,n1=0;s[i];i++)
if(s[i]=='1')
pos1[n1++]=i;
scanf("%s",s);
for(i=0,n2=0;s[i];i++)
if(s[i... |
#include <bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define full(a) memset(a, 0x3f, sizeof(a))
#define mset(a, b) memset(a, b, sizeof(a))
#define cpy(a,b) memcpy(a, b, sizeof(a))
#define fornext(x, i) for(signed i = hd[x], y = ver[i]; i; i = nxt[i], y = ver[i])
#define Rep(i, a, b) for(... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 1010
using n... |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
#define int long long
#define ri register
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define is insert
#define es erase
using namespace std; const int N=210;
inline int read()
{
int s=0, w=1; ri char ch=getchar()... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, S, D;
cin >> N >> S >> D;
vector<int> X(N), Y(N);
for (int i = 0; i < N; i++) {
cin >> X.at(i) >> Y.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (X.at(i) < S && Y.at(i) > D) {
count++;
}
}
if (count == 0) ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for(int i=0; i<N; i++) cin >> A[i];
for(int i=0; i<N; i++) cin >> B[i];
int sum=0;
for(int i=0; i<N; i++){
sum += A[i]*B[i];
}
if(sum==0) c... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long r, x, y;
cin >> r >> x >> y;
double d = sqrt(x*x + y*y) / r;
if (d < 1) {
cout << 2 << endl;
}
else {
cout << ceil(d) << endl;
}
}
| #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include ... |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<list>
typedef long long ll;
using namespace std;
/*
time:
wa:
反省:
考察・解説:
*/
int main(){
int n; cin >> n;
if(n % 2 == 0) cout << "White" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int number=0;
if ( N==3 ) cout << 6 << " " << 10 << " " << 15;
else {
for ( int i=1; i<=10000; i++ ) {
if ( i%6==0 || i%10==0 || i%15==0 ) {
cout << i << " "; number++;
}
if ( number == N ) break;
}... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<vector<int>> T(N, vector<int>(N));
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
cin >> T[i][j];
}
}
int array[N-1];
for(int i=2; i<=N; i++){
array[i-2] = i;
}
int temp;
int time;
int cou... | #include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <math.h>
#i... |
#include <iostream>
int main()
{
int N, K;
std::cin >> N >> K;
long long sum = 100 * K * N * (N + 1) / 2 + N * K * (K + 1) / 2;
std::cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define int long long
typedef long long ll;
int32_t main() {
cin.tie(0); ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int s = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k; ++j) ... |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int m = ri();
if (n == 1) {
if (m == 0) puts("1 2");
else puts("0");
return 0;
}
if (m < 0 || m > n - 2) {
puts("-1");
return 0;
}
int first = n - 2 - m;
for (int i = 0; i < first; i++) printf("%d %... | // atcoder/arc106/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
const int n=3;
vector<int> a(n);
for(auto& ai : a)
{
cin >> ai;
}
sort(a.begin(), a.end());
cout << accumulate(next(a.begin()), a.end(), 0) << "\n";
return 0;
}
| #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 ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sim template < class c
#defi... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
ll n;
cin >> n;
unordered_set<ll> num;
for (int i=1; i<=n; i++){
string s_i = to_string(i);
for (int j=0; j<s_i.size(); j++){
if (s_i[j] == '7'){
num.insert(i);
}
}
stringstream ss;
ss... | #include<bits/stdc++.h>
#define fast_az_fuk ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define pf push_front
#define dll deque<ll>
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
... |
//#undef DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll llinf = (1ll<<61)-1;
#define sz(a) int(a.size())
#define all(x) begin(x), end(x)
#ifdef DEBUG
const int DEBUG_END = 26;
#define DOS cout
#include <debug.h>
#else
#define bug(args...) void()
#define cbug(a, args...)
#endif
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 998244353;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
ll h,w,k;
cin >> h >> w >> k;
if... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
string F(string a){//aのAとBを反転させたやつを返す
for(auto &p:a)
if(p=='A')p='B';
else p='A';
return a;
}
int G(int a){
return (1<<a)-1;
}
int main(){
int n;cin>>n;
vector<vector<string>> s(n... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
ll I=167167167167167167;
ll Q=1e9+7;
string han(string S){
string T;
for(int i=0;i<S.size();i++){
if(S[i]=='A') T+="B";
else T+="A";
}
return T;
}
int main() {
ll N,A=1;
cin>>N;
vector<string> p;
for(int i=0;i<N;i++){
... |
#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>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (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 ATYN(n) ... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
int main(void)
{
long long a, b, c;
std::cin >> a >> b >> c;
if (a * a < c * c - b * b)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return (0);
} | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
//typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... |
//Made by imalyd
//Problem Name: ...
//Problem Link: ...
//Category: ...
#include<bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i,a,b) for(i=(a);i<=(b);++i)
#define per(i,a,b) for(i=(a);i>=(b);--i)
#define REP(i,a,b) for(i=(a);i< (b);++i)
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int exgcd(int a,int b,int &x,int &y){
if(!b){
x=1;
y=0;
return a;
}
else {
int d=exgcd(b,a%b,x,y);
int temp=x;
x=y;
y=temp-a/b*y;
return d;
}
}
//求ax+by=c,的x的最小整数解，无解为-1
int findK(int a,int b,int c){
int x,y;
int gcd=exgcd(a,... |
#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
#define chmin(a,b) a=min(a,... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define PI 3.14159265359
#define INF 100100100
#define mod 1000000007
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const int mx = 200005;
int main(){
int n, w;
cin >> n >> w;
vector<ll... |
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define S second
#define F first
using namespace std;
int n,q,t,a,b,k,p[400005];
string s;
signed main(){
ios::sync_with_stdio(0),cin.tie(0);
cin>>n>>s>>q;
for(int i=0;i<2*n;i++)p[i]=i;
while(q--){
cin>>t>>a>>b;
a--;... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
typedef long long ll;
template <class T = ll>
T in() {
T x;
cin >> x;
return (x);
}
int main() {
int Ans = 0;
ll N = in<ll>();
string S = in<string>();
ll Q = in<... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n) fo... | #include <bits/stdc++.h>
#include <variant>
#define rep2(i,k,n) for(i64 i=(i64)(k);i<(i64)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) begin(x),end(x)
using namespace std;
using namespace std::string_literals;
using i32 = int32_t;
using i64 = int64_t;
using f64 = double;
using f80 = long double;
using vi32 =... |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll arr[10000];
// Function to find power
ll power(ll x, ll y, ll p)
{
ll res = 1; // Initialize result
// Update x if it is more than or
// equal to p
x = x % p;
while (y > 0) {
// If y is odd, multiply x
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(ob... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define with_test(t, isT) int t=1;if(isT)cin>>t;while(t--)
void init(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
ios::sync_with_stdio(false); cin.tie(0);... | #include<bits/stdc++.h>
/*#include<boost/multiprecision/cpp_int.hpp>
using boost :: multiprecision::cpp_int;*/
#define ll long long int
#define mod 1e9+7
using namespace std;
/*int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}*/
void solve()
{
string n;
cin >> n;
for (int i = n.lengt... |
#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... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
//for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a, b, c;
cin >> a >> b >> c;
if(a==b)
cout << c << endl;
else if(a==c)
cout << b << endl;
else if(b==c)
cout << a << endl;
else cout << '0' << endl;
} |
#include<bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repn(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define pii pair<int,int>... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, k, i, j, cent; cin >> n >> k;
cent = (k * k) - int(k * k / 2);
int a[800][800], s[801][801];
for(i = 0; i < n; i++){
for(j = 0; j < n; j++) cin >> a[i][j];
}
for(i = 0; i <= n; i++) s[i][0] = 0, s[0][i] = 0;
int L... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 19;
int n, m;
long long dp[maxn]; bool ok[maxn];
int x[110], y[110], z[110];
int main()
{
scanf ("%d %d", &n, &m);
for (int i = 1; i <= m; i++)
scanf ("%d %d %d", x + i, y + i, z + i);
int upp = 1 << n;
dp[0] = 1;
for (in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_N = 19;
const int MAX_M = 105;
ll dp[(1 << MAX_N)];
int X[MAX_M],Y[MAX_M],Z[MAX_M];
int main()
{
int N,M;
cin >> N >> M;
rep(i,M)
{
cin >> X[i] >> Y[i] >> Z[i];
... |
#include<iostream>
//#include<bits/stdc++.h>
#define r read()
#define bb printf("!!\n");
#define cc printf("\n");
using namespace std;
inline int read()
{
bool ok=0 ;int res=0;char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-') ok=1;else res=c-48;
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+(c-... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
int main(){
... |
#include<bits/stdc++.h>
using namespace std;
#define fRead(x) freopen(x,"r",stdin)
#define fWrite(x) freopen (x,"w",stdout)
#define LL long long
#define ULL unsigned long long
#define ff first
#define ss second
#define pb push_back
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i < (n); ++i)
#define repD(i, a, n) for(ll i = a; i > (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (long long) (x).size()
#define fill(a) memse... |
#include<bits/stdc++.h>
#define ll long long int
#define iamspeed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define nl "\n"
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define fl(i,a,b) for(ll i=a;i<b;i+=1)
#define rl(i,a,b) for(ll i=a;i>b;i-=1)
#define input(a,n) fl(i,0,n)... | #include <bits/stdc++.h>
using namespace std;
mt19937_64 llrand((int) chrono::steady_clock::now().time_since_epoch().count());
#define st first
#define nd second
#define pb push_back
#ifndef ONLINE_JUDGE
#define db(x) cerr << #x << " == " << x << endl
#define dbs(x) cerr << x << endl
#define _ << ", " <<
#else... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = 4;
if(A+B>=15 && B>=8) ans = 1;
else if(A+B>=10 && B>=3) ans = 2;
else if(A+B>=3) ans = 3;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int64_t a=0;a<b;a++)
#define sor(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define ll int64_t
#define mod 1000000007
#define vl vector<int64_t>
#define vc vector<char>
#define vs vector<string>
#define np(vec) next_permutation(... |
#include <bits/stdc++.h>
using namespace std;
#define int 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 repa(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
#define COUT(x) cout<<(x)<<endl
#define YES(x) cout<<(x?"YES":"NO")<<e... | #include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
cout << N / W << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#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 rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL<<60;
const ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#i... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long X,Y,A,B,T,K=0;
cin >> X >> Y >> A >> B;
T=X;
while(true){
if(T>=Y/A){
break;
}
if(T*A>=Y){
break;
}
if(T*A<T+B){
K++;
T*=A;
}
else{
... | #include<bits/stdc++.h>
using namespace std;
/***typededfs***/
typedef long long ll;
typedef long double ldb;
/***defines***/
#define M1 1000000007
#define M2 998244353
#define F first
#define S second
#define pb push_back
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define forz(i,n... |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10,M=1e3+5;
int n,m,par[N],sum[M][M],add[M][M],res;
char s[M][M];
bool vis[N];
set<int>x,y;
int find(int x){
return par[x]==x?x:par[x]=find(par[x]);
}
int f(int x,int y){
return x*1000+y;
}
void un(int x,int y){
x=find(x),y=find(y);
if(x==y)return;
if(... | // This code wrote by chtholly_micromaker(MicroMaker)
#include <bits/stdc++.h>
#define reg register
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define mem(x,y) memset(x,y,sizeof x)
#define sz(x) (int)(x).size()
#define ln std::puts("")
#define lsp std::putchar(32)
#define pb push_back
#define MP std::ma... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.