code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
int limit = A * 2 + 100;
cout << limit - B;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main () {
int a;
int b;
int c;
cin >> a >> b >> c;
int sum;
sum = (7 - a) + (7 - b) + (7 - c);
cout << sum;
} |
#include<bits/stdc++.h>
using namespace std;
// @author: sharad_sharma
#define ll long long
#define ld long double
#define mod 1000000007
#define inf 1e18
#define pb push_back
#define all(n) n.begin(),n.end()
#define loop(i,a,b) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll MAX =1000000000000000000;
ll mod= 1000000000;
long double pi=3.141592653589793238;
void pls()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);... |
#include<bits/stdc++.h>
#define Imposter ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)... |
#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 <bits/stdc++.h>
using namespace std;
#pragma optimize("-O3")
#define int long long int
#define f first
#define s second
#define pb push_back
#define endl '\n'
const int N=4e5+5;
bool bl[N];
int arr[N];
vector<char>ans;
main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n... |
/* -*- coding: utf-8 -*-
*
* f.cc: F - Construct a Palindrome
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>... | #include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 2e18;
const ll fact_table = 1200008;
priority_queue<ll> ... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast","unroll-loops")
#define ll long long
#define ft first
#define sec second
#define pb push_back
#define pi pair<ll,ll>
using namespace std;
int n;
vector<pi> G[200005];
ll dp[200005][60][2],ans;
const int mod=1e9+7;
void dfs(int now,int fa)
{
for(int i=0; i<60; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define nl '\n'
//----------------------------------- DEBUG -----------------------------------
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operat... |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < (n); i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | #include <bits/stdc++.h>
using namespace std;
/*
VERIFICAR:
- Corner cases
- Estouro de variavel
- Acesso indevido de memoria
MODULO NEGATIVO
int modulo(int x,int N){
return (x % N + N) %N;
}
*/
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define f f... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) ... | #include <map>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define int long long
#define mp make_pair
const int mod = 998244353;
int read () {
int x = 0, f = 1;
char ch = getchar ();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar ();
}
whi... |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <... | #include <bits/stdc++.h>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int64_t n;
std::cin >> n;
for (int64_t a = 1, p = 3; p <= n; ++a, p *= 3) {
for (int64_t b = 1, q = 5; q <= n; ++b, q *= 5) {
if (p + q == n) {
std::cout << a << "... |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5, INF = 1e17 + 5;
long long n, m, a, b, c, d, dist[N];
bool vis[N];
struct Edge{
long long b, c, d;
};
vector<Edge> graph[N];
long double findtime(long long t, long long wait, Edge e){
return wait + e.c + ((e.d / (long double)(t + 1... |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#include <random>
#include <chrono>
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
#define vi vector<int>
#define vl vector<ll>
int ... | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
#define endl "\n"
int N;
long long Ans[200005];
vector<int>to[200005];
class Tree {
public:
Tree(... |
#include <bits/stdc++.h>
using namespace std;
#define INF 100000000 ;
#define rep(i,n) for(int i=0;i< (int)(n);i++)
typedef vector<vector<int>> Vi;
typedef vector<vector<char>> Vc;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int M ,H;
cin >> M >> H;
if(H%M==0){
cout << "Yes";
}else{
cou... | #include <iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<numeric>
#include<functional>
#include <iomanip>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define ... |
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<climits>
#include<cmath>
#include<cstring>
#include<deque>
#include<functional>
#include<iostream>
#include<iomanip>
#include<map>
#include<numeric>
#include<optional>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<... | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
#define pipii pair<int,pair<int,int>>
#define pii pair<int,int>
#define mod 1000000007
#define ss second
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pair<int,int>>
#define ff first
#define all(v... |
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector... | #include<bits/stdc++.h>
using namespace std;
#define dd double
#define ll long long int
#define light ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mkp make_pair
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define fi first
#define sc second
ll INF=2*1e9+5;
ll mod=998244353;
ll an... |
/* BABA JAGAAAAAA */
#include<bits/stdc++.h>
#define pb push_back
#define un unordered_map
#define us unordered_set
#define ll long long
#define PI 3.1415926535897932384626
#define fast ios:: sync_with_stdio(false);cin.tie(NULL)
#define l long
using namespace std;
const int mod= 1e9+7;
const int inf=1e9+3;
int m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
#define all(x) (x).begin(),(x).end()
#define fr first
#define sc second
#define nl '\n'
void solve(){
int x;cin>>x;
cout<<max(x,0);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie... |
#include <iostream>
#include <string>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
cout << S.substr(1) << S.substr(0, 1) << endl;
return 0;
} | // Jai Shree Ram
#include<bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define max2(a,b) (a>b)?a:b
#define mi2(a,b) (a<=b)?a:b
#define fori(i,n) for(ll i=0;i<(ll)n;i++)
#define ford(i,n) for(ll i=n;i>=0;i--)
#define pll pair<ll,ll>
#define mod 1000000007
#define ff first
#define ss second
using namespa... |
#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
/* [💭] [💡] [🎈] */
ll fibo[88];
bitset<88> f;
int main() {
cin.tie(nullptr), cout.tie(nullptr), ios::sync_with_stdio(false);
#ifde... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define pii pair<int,int>
#define piii pair<int,pii>
#define sp " "
#define nl "\n"
#define all(x) x.begin(),x.end()
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
using namespace std;... |
#include<bits/stdc++.h>
using namespace std;
void solution()
{
int h, w; cin >> h >> w;
long long output = 1;
int values[h + w][3] = {};
for(int i = 0; i < h; i++)
{
string s; cin >> s;
for(int j = 0; j < w; j++)
{
if(s[j] == '.')
{values[i + j][0]++;}
else if(s[j] == 'R')
... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#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 order... |
#include <iostream>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
#include <vector>
#include <queue>
#include <numeric>
#define MM (1000000000 + 7)
typedef unsigned long long ull;
vector<vector<int>> A[200000 + 1];
ull ans;
ull N;
ull a, b, c;
int m... | /**Bismillahir Rahmanir Rahim.**/
/*
Md.Fagun Molla
18ICTCSE006
BSMRSTU(SHIICT)
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
using db=double;
///... |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-')
f=-1;
c=getchar();
}
while(c>='0' && c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
int n;
char s1[N],s2[N],s3[N];
int mai... | #include <bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define nl '\n'
/**-------Library-------*/
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin(),a.end()
#define Sort(x) sort(x.... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 2005;
char s[N][N];
int f[N][N];
int cal(char c) {
return c == '+' ? 1 : -1;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> s[i] +... |
#include <bits/stdc++.h>
int main(){
int N;
std::cin >> N;
std::vector< int > T(N);
int sum = 0;
for(int i=0; i<N; i++){
std::cin >> T[i];
sum += T[i];
}
std::map< int, bool > mp;
mp[0] = 1;
for(int i=0; i<N; i++){
std::vector< int > tmp;
fo... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#includ... |
#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;
int a[2000001],sum[2000001],b[2000001];
int n,m,answ=99999999;
void add(int x,int v)
{
while(x<=n+1)
{
a[x]+=v;
x+=x&-x;
}
}
int find(int x)
{
int ans=0;
while(x)
{
ans+=a[x];
x-=x&-x;
}
return ans;
}
int query()
{
int l=1,r=n+2,mid,ans=n+1;
while(l<=r)
{
... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define int long long
int32_t main() {
int n,k;
cin>>n>>k;
vector<pair<int,int>> v;
for(int i=0;i<n;i++)
{
int a,b;
cin>>a>>b;
v.push_back({a,b});
}
sort(v.begin(),v.end());
int p=0,... | #include <cstdio>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_se... |
#include <iostream>
#include <vector>
#include <map>
#include <bitset>
#include <algorithm>
#define ll long long
#define MODD 998244353
using namespace std;
char C[5222][5222];
ll modpow(ll x, ll y) {
ll xs = x;
ll answer = 1;
while(y) {
if (y&1) {
answer = (answer * xs) % MODD;
... | #include <bits/stdc++.h>
#define lc (o<<1)
#define rc ((o<<1)|1)
using namespace std;
#define DebugP(x) cout << "Line" << __LINE__ << " " << #x << "=" << x << endl
typedef long long LL;
typedef complex<double> Comp;
const int maxn = 100 + 5;
const int inf = 0x3f3f3f3f;
const int modu = 1e9 + 7;
bool g[maxn][maxn];
L... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... | #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>
... |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
ll GCD(ll a,ll b) {retur... | #include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
#define int long long int
#define loop(i,a,b) for(int i=a;i<b;i++)
#define scan(arr,n) for (int i = 0; i < n; ++i) cin >> arr[i]
#define vi vector<int>
#define si set<int>
#define pii pair <int, int>
#define sii set<pii>
#define vii vector<pii>... |
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
const long double pai = acos(-1);
struct vect{
long double x, y;
vect(double _x = 0, double _y = 0) { x = _x, y = _y; }
vect operator* (double k) { return vect{x * k, y * k}; }
vect operator+ (vect A) { return vect(x + A... | #include<bits/stdc++.h>
using namespace std;
#pragma region atcoder
//#include <atcoder/convolution>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma endregion
#pragma region macros
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
template <c... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const long double EPS = 1e-10;
int main(){
ll N;
ll ans = 0;
cin >> N;
if(N <= 999){
... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
#define PI 3.14159265359
const long long INF = 1LL << 60;
long long MOD = 1000000007;
long long gcd(long long a, long long b) { return b ? gcd(b, a%b) : a; }
long long lcm (int a, in... |
#include <iostream>
using namespace std;
int main()
{
int T, A, C;
cin>>T>>A>>C;
if((T >= 0 && A <= 100) && (C == 0 || C == 1))
{
C == 0 ? (T > A ? cout<<"Takahashi" : cout<<"Aoki") : (A > T ? cout<<"Aoki" : cout<<"Takahashi") ;
}
return 0;
}
| /* Hardwork allways pays off */
//You never know how close to the solution you are ,so keep practicing
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gn... |
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector... | #include<bits/stdc++.h>
typedef long long ll;
#define V(a) vector<a>
#define P(a,b) pair<a,b>
#define A(a) set<a>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define in insert
#define bp __builtin_popcount
#define ppb pop_back
#define FOR(a,b,c) for(ll(a) = b; a < c; a++)
#define FORN(a,b... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a); i<(b); i++)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
const int INF = 1001001001;
int main(){
int n; cin >> n;
vi a(n), b(n);
int bmin = INF;
rep(i,0,n){
cin >> b[i];
bmin = min(bm... | #pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
const long double Pi = 3.141592653;
const ll mod=1e9+7;
long long INF = 1000000000000000000;
bool cmp(pair<int,int>a,pair<int,int>b)
{
... |
// Atcoder.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<itera... | /*
Author: Nguyen Tan Bao
Status:
Idea:
*/
#include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(),a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORE(i,a,b) for (int i ... |
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1e5 + 100;
int n, m;
int cnt[2];
char s[30];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%s", s + 1);
int tmp = 0;
for (int j = 1; j <= m; j++) {
if (s[j] == '1') tmp++;
... | #include <bits/stdc++.h>
using namespace std;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
#define drep(i, x) for (int i = ((int... |
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
typedef int64_t ll;
typedef uint64_t ull;
using namespace std;
void one_case() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto& el : a) cin >> el;
sort(all(a));
vector<int> bx... | /*
Stay motivated and keep working hard
*/
#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 int long long
#define pb push_back
#define cntbit __builtin_popcount
#define fr first
#define mem(arr, val) m... |
#include <iostream>
#include <cmath>
int main(void){
int N,K,M,l,i;
double SUM = 0.0;
double j,k;
int *A;
std::cin >> N >> K >> M;
A = new int[N-2];
i = 0;
while(std::cin>>l){
A[i] = l;
i++;
SUM = SUM + l;
}
j = M * N - SUM;
if (j < 0){
j = 0;
... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<math.h>
using namespace std;
int main() {
long double a, b, r, u, l;
unsigned long long c = 0;
long n, m;
cin >> a >> b >> r;
r += 1E-14;
n = ceil((a - r));
m = floor(a + r);
for (long i = n; i <= m ; i++) {
u = sqrt((r... |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000000000000;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main(){
string S;
cin >> S;
for( int i = 0; i < 15; i++ )... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
te... |
#include <iostream>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <memory>
#include <limits>
#include <queue>
#include <algorithm>
using namespace std;
using ull = unsigned long long;
using ui = unsigned int;
int res;
void bs(const vector<int>& nums, int idx, int prexor... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<vector<vector<long double> > > vvvld;
typedef vector<vector<long double> > vvld;
typedef vector<vector<vector<int> > > vvvi;
typedef vector<vector<int> > vvi;
typedef long double ld;
#define rep(i,n) for (int i = 0; i< (int)(n); i++)
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
double x, y, z;
scanf("%lf%lf%lf", &x, &y, &z);
printf("%d", (int)max(0.0,ceil(z*(y/x))-1));
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define inf ll(1e18)
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T;
T=1;
while(T--){
int x,y,z;
cin>>x>>y>>z;
int answer=0;
for(int i=1; i<=1000000; i++){
int var=x*i;
int temp... |
//ABHISHEK AGRAWAL,BIT mesra//
//Newbie......You have to be odd to be no. ONE :)//
//Authhor: Abhishekagrawal
//Date: 20/02/2021
//Time: 17:30:13
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld ... | #include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef lo... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define rrep(i, a, b) for (int i = a; i >= (b); --i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T>
void updat... |
#ifdef _DEBUG
#include "../../../library/src/debug_template.cpp"
#define DMP(...) dump(#__VA_ARGS__, __VA_ARGS__)
#else
#define DMP(...) ((void)0)
#endif
#include <cassert>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#incl... |
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
int main() {
int n;
cin >> n;
vector<int> cnt(2000001, 0);
int pi;
int x = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
string t; cin >> t;
int n = t.size();
string s = "atcoder", p = t;
sort(p.rbegin(), p.rend());
if (p <= s) {
cout << -1 << endl;
return;
}
if (t > s) {
cout << 0 << endl;
retu... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... | #include <bits/stdc++.h>
using namespace std;
// common mod numbers
const int MOD1=1000000007;
const int MOD2 = 998244353;
// loop definitions
#define for0(i, n) for (int i = 0; i < (int)(n); ++i) // 0 based indexing
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i) // 1 based indexing
#define forc(i, l, r) for... |
#include <iostream>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
using namespace std;
typedef long long int ll;
typedef pair <int,int> pii;
typedef pair<ll,ll> pll;
/*bool compare_function(const pair<int, int> a, const pair<int, int> b... | /**
* author: said_v15
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
typedef long long ll;
#define fast ios_base::sync_with_stdio(false);cin.tie(0)... |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#define int long long
#define mid (l+r>>1)
using namespace std;
int read(){
int x = 1,a = 0;char ch = getchar();
while (ch < '0'||ch > '9'){if (ch == '-') x = -1;ch = getchar();}
while (ch >= '0'&&ch <= '9'){a = a*10+ch-'0';ch = getchar();... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
ll COM[250][250];
void COMinit(){
COM[1][0] = COM[1][1] = 1;
for(int i = 2; i < 250; i++){
for(int j = 0; j <=... | #include<bits/stdc++.h>
#define ss second
#define ff first
#define Mem(x,val) memset(x,val,sizeof x)
#define pb push_back
#define all(v) v.begin(),v.end()
#define unik(v) v.erase(unique(v.begin(),v.end()),v.end())
#define cerr(x) cerr << __LINE__ << " th Line : " << #x << " = " << x << "\n"
#define debug(a,b) cerr << ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scaning... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize ("-O3")
#define int long long
#define ld long double
#define endl "\n"
#define rep(i,begin,end) for (__typeof(end) i=begin-(begin>end); i!=(end)-(begin>end); i+=1-2*(begin>end))
#defin... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define pb push_back
#define vi vector
#define mod 1000000007
#define ... | #define LOCAL_DBG
#ifdef LOCAL_DBG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename K, typename V> using umap = unordered_map<K, V>;
template<typename T> using pque = priority_queue<T>;
template<typename T> using revpque = priority_queue<T, vector<T>, greater<T>>;
using ... |
#include<bits/stdc++.h>
long long n,v;
int main()
{
scanf("%lld",&n); v=sqrt(2*(n+1))-1;
while((v+1)*(v+2)/2<=n+1) v++;
printf("%lld",n-v+1);
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define u... |
//高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i+... | //Sumonto Chatterjee
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f1(a,b) for(ll i=a;i<=b;i++)
#define f2(a,b) for(ll j=a;j<=b;j++)
#define f3(a,b) for(ll k=a;k<=b;k++)
#define fr(a,b) for(ll r=a;r>=b;r--)
#define all(a) a.begin(),a.end()
#define pb push_back
#define vll vector<long lon... |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long int ll;
typed... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
ll GCD(ll a,ll b) {retur... |
#include <cstdio>
#define rep(i,_l,_r) for(signed i=(_l),_end=(_r);i<=_end;++i)
#define fep(i,_l,_r) for(signed i=(_l),_end=(_r);i>=_end;--i)
#define erep(i,u) for(signed i=head[u],v=to[i];i;i=nxt[i],v=to[i])
#define efep(i,u) for(signed i=Head[u],v=to[i];i;i=nxt[i],v=to[i])
#define print(x,y) write(x),putchar(y)
tem... | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
#define ll long long int
#define pll pair<ll,ll>
#define ... |
#include<bits/stdc++.h>
using namespace std;
int main()
{ int a,b,c,d; cin>>a>>b>>c>>d;
cout<<max(a,b)-min(c,d);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,C,d;
cin>>A>>B>>C;
d=A*A+B*B;
if (d<C*C)
cout<<"Yes";
else
cout<<"No";
} |
#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=3010; //check the limits, dummy
ll a[N];
int n, m;
ll mod = 1e9+7;
int mem[N][N], mem1[N... | #include <bits/stdc++.h>
using namespace std;
//#define FOR_CODEFORCES
//#define MOD 998244353LL
#if 1 //テンプレ折り畳み//テンプレ折り畳み//テンプレ折り畳み
#ifdef _DEBUG
#define debug() if(true)
#define dout cout
#define dvout(v) __vout(v)
#define dvvout(v) __vvout(v)
#else
#define debug() if (false)
#define dout if (false)cout
#define dv... |
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <sstream>
using namespace std;
typedef long long int lli;
int N1, N2, N3,N4;
vector<string> split(const string& s, char delim) {
vector<string> elems;
stringstream ss(s);
string ... | #include <iostream>
using namespace std;
#define int long long int
int32_t main() {
string x;
cin>>x;
string ans="";
for(int i=0;i<x.length();i++)
{
if(x[i]=='.')
{
break;
}
else
{
ans+=x[i];
}
}
cout<<ans<<end... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define watch(x) cout << (#x) << " = " << (x) << endl;
#define w(x) int x; cin >> x; while(x--)
#define all(x) ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define int ll
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ld long double
#define ul... |
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
ll l, r, ans, dp[(1<<20)], a[73], A[]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
int main(){
cin>>l>>r;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll... |
#pragma region shig_templates
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pairI2;
typedef pair<LL, LL> pairLL2;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
#define shig_for(i, a, b) for(int i... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long add(long long a, long long b) {
long long res = a + b;
if (res >= mod) res -= mod;
return res;
}
long long sub(long long a, long long b) {
long long res = a - b + mod;
if (res >= mod) res -= mod;
return re... |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define pow abcdef_pow
#define sqr(x) ((x)*(x))
int pow(int a, int b, int mod) {
if (b == 0) return 1;
int t = pow(a, b / 2, mod);
t = (t * t) % mod;
if (b % 2) return (t * a) % mod;
return t;
}
signed main() {
// freop... | #include <bits/stdc++.h>
#define isNum(a) (a >= '0' && a <= '9')
#define SP putchar(' ')
#define EL putchar('\n')
#define File(a) freopen(a ".in", "r", stdin), freopen(a ".out", "w", stdout)
template <typename T>
void read(T &);
template <typename T>
void write(const T &);
typedef unsigned uint;
typedef long long ll... |
#ifdef _DEBUG
#include "../../../library/src/debug_template.cpp"
#define DMP(...) dump(#__VA_ARGS__, __VA_ARGS__)
#else
#define DMP(...) ((void)0)
#endif
#include <cassert>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#incl... | #include<bits/stdc++.h>
using namespace std;
int sx, sy;
int t[50][50], p[50][50];
vector<int> c(2510, 0);
int score = 0, sum = 0;
string ans = "", s = "";
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const char mo[4] = {'R', 'D', 'L', 'U'};
void dfs(int x, int y) {
if(clock() > 1980000) {... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
#define rep(i,b) for(ll i=0;i<b;i++)
#define rrep(i,a,b) for(ll i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
///#pragma GCC target("avx2")
///#pragma GCC opt... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 5050,mod = 998244353;
int n,m,fac[maxn],ifac[maxn],f[2][maxn];
int read(){
int x = 0;
char c = getchar();
while(c < '0' || c > '9') c = getchar();
while(c >= '0' && c <= '9') x = x * 10 + (c ^ 48),c = getchar();
return... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define REP(i, N) FOR(i, 0, N)
#define RREP(i, N) RFOR(i, N, 0)
#define FILL(A,value) memset(A,value,sizeof(A))
#define endl '\n'
#define ALL(V) V.begin(), V.end()... |
#include <algorithm>
#include <iostream>
int main() {
int a,b,c,d;
std::cin >> a;
std::cin >> b;
std::cin >> c;
std::cin >> d;
std::cout << b-c << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define is_in(x,l,r) ((l) <= (x) && (x) < (r))
#define sz(x) (int)(x).size()
#define rng(a) a.begin(),a.end()
#define rngr(a) a.rbegin(),a.rend()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(i... |
#include <bits/stdc++.h>
using namespace std;
#define repi(i, a, n) for (int i = a; i < (int)(n); ++i)
#define rep(i, n) repi(i, 0, n)
#define all(v) begin(v), end(v)
using ll = long long;
int main() {
// freopen("1.txt", "rb", stdin);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// using namespace std;
#if __has_include(<atcoder/all>)
#include<atcoder/all>
// using namespace atcoder;
#endif
#define int long long
#pragma region header
#pragma region alias
using lint = long long;... |
#include <cstdio>
struct t_Edge {
int next;
int to;
int c;
};
t_Edge edge[400010];
int N, M, a, b, w;
int father[200010];
int head[200010], num_edge;
int vis[200010], ans[200010];
void add(int from, int to, int c)
{
edge[++num_edge].next = head[from];
edge[num_edge].to = to;
edge[num_edge].c = c;
head[from] = nu... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define Pii pair<int,int>
#define Pll pair<long long,long long>
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(a) (int)a.size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define int long long
const int N = 1e5+10;
struct node{
int t;
int k;
};
map<int,node> mp;
bool vis[N];
vector<pair<int,pair<int,... | #include<iostream>
#include<map>
#include<set>
using namespace std;
map<char,int> mp;
string a[3];
long long p[3],k;
set<char> s;
char c[10];
bool b[10],en;
void dfs(int t)
{
if(en)
return;
if(t==k)
{
if(mp[a[0][0]]&&mp[a[1][0]]&&mp[a[2][0]])
{
for(int i=0;i<3;++i)
{
p[i]=0;
for(int j=0;j<a[i].siz... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 2e5 + 10;
const int MAXM = 2e5 + 10;
const ll INF = 1e18;
struct edge {
int u,v;
int next;
}e[MAXM * 2];
int first[MAXN], n, k;
int idx;
void add(int a, int b) {
e[idx].u = a;
e[idx].v =... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, Q;
cin >> N;
vector<char> S(N), S2(N);
for(int i=0; i<N; i++){
cin >> S.at(i);
}
for(int i=0; i<N; i++){
cin >> S2.at(i);
}
cin >> Q;
vector<int> T(Q), A(Q), B(Q);
for(int i=0; i<Q; i++){
ci... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,Q;
string S,s,t;
cin >> N >> S >> Q;
s=S.substr(0,N);
t=S.substr(N);
//cout << s << t << endl;
bool x=true;
for (int i=0; i<Q; i++) {
int T,A,B;
cin >> T >> A >> B;
A--;B--;
if (T==1) {
if (B<N) {
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int const MOD=998244353,N=233333;
int n,f[N],vis[N],cnt;
inline int find(int x){
return x==f[x]?x:f[x]=find(f[x]);
}
inline int qpow(int x,int y){
return !y?1:qpow(x,y-1)*x%MOD;
}
signed main(){
ios::sync_with_stdio(0);
cin>>n;
for(int i=1;i<=n;i++... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 2e5 + 5;
const int mod = 998244353;
int n, a[N], vis[N];
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for(int i = 1;i <= n;i++)
cin >> a[i];
int ans = 1;
... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
temp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (int)(n) ; i++)
vector<ll> to_base3(ll n) {
if(n==0) return vector<ll>{0};
vector<ll> ret;
while(n>0) {
ret.push_back(n%3);
n/=3;
}
return ret;
}
ll subcom(ll a, ll b) {
if(a... |
//In the name of God
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll maxn = 1e10;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<n-1;
return 0;
} | #include <iostream>
using namespace std;
unsigned long long div_cnt[2][12] = {0};
int main()
{
int L;
cin >> L;
div_cnt[1][0] = 1;
for (int i = 1; i < L; i++) {
for (int j = 0; j < 12; j++) {
div_cnt[0][j] = div_cnt[1][j];
}
for (int j = 1; j < 12; j++) {
div_cnt[1][j] = div_cnt[0][j-1]+... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long A,B;
cin >> A >> B;
vector<long long> V(200001,0);
for(long long i=A;i<=B;i++){
V[1]++;
V[i]++;
for(long long j=2;j*j<=i;j++){
if(i%j==0){
V[j]++;
if(i/j!=j) V[i/j]++;
}
}
}
for(int i=20000... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
int a, b;
cin >> ... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <math.h>
#define cPI 3.14159265358979323846
using namespace std;
vector<int64_t> ans;
void func( )
{
int64_t N;
cin >> N;
if (N % 2 == 0)
cout... | #include<iostream>
using namespace std;
int main()
{int n;
cin>>n;
if(n%2==0)cout<<"White";
if(n%2==1)cout<<"Black";
} |
// Problem: D - KAIBUNsyo
// Contest: AtCoder - AtCoder Beginner Contest 206（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc206/tasks/abc206_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
// krishrawat
#pragma GCC optimize("Ofast")
#pragma GCC targe... | #include <bits/stdc++.h>
#define int long long
#define f(i,a,n) for (int i = a; i < n; ++i)
#define fr(i,a,n) for(int i=a;i>=n;i--)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define fastio ios_base::sync_with_stdio(fals... |
#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 <iostream>
using namespace std;
int main()
{
int x;
cin >> x;
if (x >= 0)
{
cout << x << endl;
}
else
{
cout << 0 << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
bool solve(vector<ll> &A) {
ll N = A.size();
... | #include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
LL A=-1e16,B=1e16,C,a;
int n,q,t;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lld%d",&a,&t);
if(t==1){
A+=a;
B+=a;
C+=a;
}
else if(t==2){
A=max(A,a);
B=max(B,a);
}
else {
A=min(A,a);
B=min(B,a);
}
}
s... | //@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(ll i = 0;i < (ll)n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy cout... | #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 pb push_back
#define inf 1e18
// 1000000007 , 998244353
// cout<<"? "<<endl for interactive
#define MOD 998244353
#define mp make_pair
#define all(x) (x).b... |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int Maxn=100000;
int n;
int a[Maxn+5],b[Maxn+5];
int c[Maxn+5],d[Maxn+5];
bool cmp(int p,int q){
return p>q;
}
int main(){
scanf("%d",&n);
ll ans=0;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
ans+=a[i];
}
for(int i=1;i<=n;i... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
#define Swap(a,b) (a+=b,b=a-b,a-=b)
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
{
int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
while(t--){
ll n,x,ans=0;
cin >> n >> x;
vector<ll> arr(n,0);
for(int i=0;i<n;i++){
cin >> arr[i];
... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <st... | #include <iostream>
#include <cstring>
using namespace std;
using ll = long long;
const int N = 200005, P = 1e9 + 7;
char s[N];
int n, k;
ll f[N][17];
int to_num(char c)
{
if ('0' <= c && c <= '9')
return c ^ '0';
return 10 + c - 'A';
}
void init()
{
f[0][k] = 1;
for (int i = 1; i < n; ++i)
... |
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <string>
#include <utility>
#include <map>
#include <queue>
#include <stack>
#include <iomanip>
#include <sstream>
#include <cstring>
#define MP make_pair
#define PB push_back
#define SZ size()
#define B begin()
#define... | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#pragma comment(linker, "/stack:200000000")
#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
#define pb push_... |
//Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tu... | #include <cstdio>
int V, T, S, D;
int main() {
scanf("%d %d %d %d", &V, &T, &S, &D);
if(V*T<=D and D<=V*S) printf("No");
else printf("Yes");
} |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define ld long double
#define ul unsigned long
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <type... |
#include<bits/stdc++.h>
#define f(i,n) for(long long int i = 0 ; i < n; i++)
#define F first
#define S second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define all(s) s.begin(), s.end()
#define u_s unordered_set
#define u_m unordered_map
#define ll long long int
#define pb push_back
#define pll pair<ll,ll... | #pragma region templates
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
t... |
#include <bits/stdc++.h>
using namespace std;
using 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
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
... | #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (... |
#include <bits/stdc++.h>
#define SIZE 1005
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main()
{
int n;
scanf("%d",&n);
int t=1;
while(t<n) t<<=1;
for(int i=0;i<n;i++)
{
int a=i*2;
int b=i*2+1;
for(int j=11;j>=0;j--)
{
if(a>=n&&(a>>j&1)) a^=1<<j;
if(b>=n&&(b>>j&1)) b... | #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 pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#... |
#include <bits/stdc++.h>
#define int long double
using namespace std;
int n;
int ans;
signed main(){
cin>>n;
for(int i=2;i<=n;i++){
ans+=n*1.0/(n-i+1);
}
cout<<fixed<<setprecision(10)<<ans<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <t... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
typedef long long ll;
const ll mod = 1e9 + 7;
string s;
int k, a[N], n;
int work(int x) {
int ans = 0;
while (x) {
if (x & 1) ans++;
x = x / 2;
}
return ans;
}
ll dp[N][20];
ll dfs(int p, int stat, int limit) {
in... |
#include<bits/stdc++.h>
using namespace std;
#define Set(a,b) memset(a,b,sizeof(a))
template<class T>inline void init(T&x){
x=0;char ch=getchar();bool f=0;
for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') f=1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1)+(x<<3)+(ch-48);
if(f) x=-x;
return;
}
typedef long long ll... | #include <bits/stdc++.h>
using namespace std;
#define closeSync ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int MAXN = 300005;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
vector<int> v[2];
inline void solve()
{
int n; cin >> n;
string S,T; cin >> S >> T;
S ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template <class T>
bool chmax(T& a, const T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T b) {
if (b < a) {
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, K;
cin >> N >> K;
if(K < 0) K = -K;
int64_t X, Y;
int64_t countx, county;
int64_t count = 0;
for(int i = 2 * N - K - 1; i > 0; i--)
{
X = 2 * N - (2 * N - K - 1 - i);
Y = X - K;
if(N < X - 1) countx = X - 1 - (2 * (... |
#include<bits/stdc++.h>
using namespace std;
#define fast {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
typedef long long int ll;
typedef string S;
#define M 1e18
#define AS 250005
#define sp cout<<' '
#define nw cout<<endl
#define rt return
#define __ template<typename T, typename... Types>
void in() {rt;... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef... |
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; using ld = long double; using ll = long long;
using ull = unsigned long long;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#d... | #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 a, b;
cin >> a >> b;
int x = (a + b) / 2;
int y = (a - b) / 2;
cout << x << " " << y << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int a, b, c, d, minim, maxim;
int main(){
cin >> a >> b >> c >> d;
minim = min(min(min(a , b), c), d);
maxim = max(max(max(a , b), c), d);
if((minim + maxim == a + b + c + d - minim - maxim) || (maxim == a + b + c + d - maxim))
cout << "Yes";
el... | /**
* Author: Daniel
* Created Time: 2021-02-25 22:16:47
**/
#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 EB emplace_back
#define lowbit(x) (x & -x)
#define SZ(x) ((int)x.size())
#define MP(x, y) m... |
#define ll long long
#define dd long double
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define fo(i , n) for(ll i = 0 ; i < n ; i++)
#define tll tuple<ll ,ll , ll >
#define pll pair<int ,int>
#include<bits/stdc++.h>
/*#include<ioma... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 5;
const ll mod = 1e9 + 7;
int n;
ll a[MAXN];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
sort(a + 1, a + 1 + n);
ll ans = 1;
for(int i = 1; i <= n; i++) ans = ans *(a[i] - a[i - 1] + 1) % ... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n), b(n), c(n);
for(int i = 0;i < n;i++) cin >> a[i];
for(int i = 0;i < n;i++) cin >> b[i];
for(i... | // jay swaminarayan //
// UTSAV VASOYA //
#include <iostream>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<cmath>
#include<string.h>
using namespace std;
#define int long long
#define pi (3.141592653589)
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef long double D;
//typedef complex<D> P;
#define F first
#define S second
const ll MOD=1000000007;
//const ll MOD=998244353;
template<typename T,typename U>istream & operator >> (is... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) Fo... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.