code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
#include <chrono>
#include <string>
#include <vector>
#include <algorithm>
class DNA {
private:
char base[20][20];
public:
void inputV(const int& i, const int& j, const std::string& s) {
for (int k = 0; k < (int)s.size(); k++) {
if (i + k < 20) base[i + k][j] = s[k];
else base[i + k... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll =... |
//@formatter:off
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 998244353;
const int maxn = 400005;
int dp[3005][3005];
int s... |
#include <bits/stdc++.h>
using namespace std;
const int inf=1e9;
int n, m, k, x, y;
int dist[17][100001];
int dp[17][131072];
int c[17];
int solve(int last, int mask) {
if (__builtin_popcount(mask)==1) return 0;
if (dp[last][mask]!=0) return dp[last][mask];
int ans=inf;
for (int i=0; i<k; i++) {
if (i!=last && ma... | #include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define unused [[maybe_unused]]
#define tempT template<class T>
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define debug(x) cerr << #x << ": " << x << endl
#define ans_exit(x) { co... | #include<algorithm>
#include<cstdio>
#define MaxN 100500
using namespace std;
int n,tn,p[MaxN],c[MaxN];
int main()
{
scanf("%d",&n);
c[1]=1;
for (int i=1;i<=n;i++){
if (!c[i])c[p[++tn]=i]=2;
for (int j=1;j<=tn&&i*p[j]<=n;j++){
c[i*p[j]]=c[i]+1;
if (i%p[j]==0)break;
}
}for (int i=1;i<=n;i... |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<long long>>;
const long long INF = 1LL <<60;
const long long Mo=1000000007;
vector<long long> seen;
long long dfs(const Graph &G, int v, long long cnt) {
seen[v] = cnt; //判定だけならcntをboolに
// v から行ける各頂点 next_v について
for (auto next_v : G... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a*a+b*b<c*c)
puts("Yes");
else puts("No");
} |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<ll,ll>;
template<class T> ostream& operator<<(ostream& os, const vector<T> arr){ for(ll i = 0; i < (ll)arr.size(); i++)cout << arr[i] << (i ==... | #include <bits/stdc++.h>
#define int long long
#define ri register int
#define N 505
using namespace std;
int n,p,q,a[N],b[N],c[N][N];
template <typename T> inline void read(T &x) {
register T f=0,c=getchar();
for (; c<48||57<c; c=getchar()) if (c=='-') f=1;
for (x=0; 48<=c&&c<=57; c=getchar()) x=(x<<3)+(x<<1)+(c&15... |
#include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define ll long long
//#define file
using namespace std;
int n,i,j,k,l;
ll ans,A,B,C,sum[501],sum2[501];
int main()
{
#ifdef file
freopen("a.in","r",stdin);
#endif
scanf("%d",&n);
fo(A,1,500)
{
fo(B,1,A)
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int K;
int NumberOfUnderK = 0;
int Multi;
int m, n, l, n1, l1;
cin >> K;
for (m = 1; m <= K; m++){
for (n = 1; n <= K/m; n++){
for (l = 1; l <= K/n; l++){
Multi = m * n * l;
if(Multi <= K){
NumberOfUnderK++;
... |
#include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#defin... | #include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(... |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, greater<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int long long
int r[200005], c[200005];
bool done[... |
//Classic
//g++ -std=c++11 -O2 -Wall a.cpp -o test
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define vp vector<pi>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#defin... |
#include <iostream>
#include <vector>
#include <algorithm>
int X,Y,Z = 0;
int main(void){
std::cin >> X;
std::cin >> Y;
std::cin >> Z;
if((Y*Z)%X == 0) std::cout << int((float(Y)/X)*Z-1);
else std::cout << int((float(Y)/X)*Z);
} | #include <iostream>
using namespace std;
int main()
{
int a,b,c;cin>>a>>b>>c;
int ans = max(a+b,max(b+c,a+c));
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
const int mod=1e9+7;
const int N=3e5+9;
void solve()
{
int n;
cin >> n;
... | // This is the start Shubham template//
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long int
#define mp(a,b) make_pair(a,b)
#define ff first
#define ss second
#define mod 1000000007
#define deg(x) cout<<#x<<" = "<<x<<endl;
#define INF LONG_LONG_MAX
#define vll vector<int>
#define pb ... |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
int len = s.size();
map<char, int> num;
vecto... | #include <bits/stdc++.h>
#include<sstream>
#include<string>
#include<vector>
#include <set>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
long long M=1000000007;
using namespace std;
ll fact[10... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
unordered_map<int, bool> mp;
for(int i = 0; i < N; i++) {
cin >> A[i];
}
for(int i = 0; i < N; i++) {
cin >> B[i];
}
int res... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define pers(i, n, s) for (int i = n - 1; i >= s; i--)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define pb push_back
#de... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rep2(i,a,b) for(int i=(a);i<(int)(b);++i)
#define rrep(i,n) for(int i=(n)-1;i>=0;--i)
#define rrep2(i,a,b) for(int i=(a)-... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f(i, a, b) for (int i = a; i < b; i++)
#define pi pair<int, int>
#define pb push_back
#define mp make_pair
#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define FIO ios_base::sync_with_stdio(0), cin.tie(0)
#define fi first
#define se ... | /**
* author: shu8Cream
* created: 22.02.2021 00:37:07
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
const int mod = 998244353;
str... |
#include<iostream>
using namespace std;
#define ll long long int
int main()
{
ll n,a;
cin>>n;
ll sum=0,mx=0,ans=0,dis=0;
for(ll i=0;i<n;i++){
cin>>a;
sum+=a;
mx=max(mx,sum);
ans=max(ans,dis+mx); //First check plus the mx value cause after mx value it will decrease
di... | #include<iostream>
#include<vector>
#include<algorithm>
#include <sstream>
#include<string>
using namespace std;
int main()
{
int n;
long long a[5][2 * 100000 + 8] = { 0 },c=0,m=0;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[0][i];
c += a[0][i];
if (a[0][i] >= 0)
{
a[1][i] += a[1][i - 1] + a[0][i... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
const double PI = acos(-1.0);
/*const double PI = atan2(0.0,-1.0)*/
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... | #include<bits/stdc++.h>
using namespace std;
int read(){
int x=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))x=(x<<1)+(x<<3)+(ch^'0'),ch=getchar();
return x;
}
const int N=5005,mod=998244353;
typedef long long ll;
ll dp[N],n,m,cm[N];
int main(){
n=read(),m=read();
cm[0]=1;for(int i=1;i<=... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double pi = 3.141592653589793238;
const ll LL_INF_BIG = 1e18 + 7;
const ll LL_INF = 1e9 + 7;
const int INF = 1e9 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> void chmin(T& a, T b) {
if (a > b) a = b;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <int mod>
class Modint {
using mint = Modint;
static_assert(mod > 0, "Modulus must be positive");
public:
static constexpr int get_mod() noexcept { return mod; }
constexpr Modint(long long y = 0) noexcept : x(y >= 0 ? y % mo... |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using std::sort;
using std::cout;
using std::endl;
using std::max;
using std::min;
inline int read(){
int h=0;char c=getchar();
while(c<'0'||c>'9')c=getchar();
while(c>='0'&&c<='9')h=(h<<1)+(h<<3)+c-'0',c=getchar();
return h;
}
const int p... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
//#pragma GCC optimize("O3")
using namespace std;
using namespace _... |
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
typedef long long ll;
typedef long long unsigned llu;
typedef vector<int> vi;
typedef pair<int, int> pi;
#ifdef _DEBUG
ifstream fin("..\\date.... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
//const int mod = 998244353;
int main()
{
ll n;
cin >> n;
ll ans = L... |
#include "iostream"
#include "string"
#include "algorithm"
using namespace std;
long long g1(long long n) {
string s = to_string(n);
sort(s.begin(), s.end(), [](int a, int b){ return a > b; });
return stoll(s);
}
long long g2(long long n) {
string s = to_string(n);
sort(s.begin(), s.end());
return stoll(s);
}
... | #include<bits/stdc++.h>
using namespace std;
int l,r;
void check(int &ans,int k,long long x) {
int L=1,R=r/k+100;
while(L<=R) {
int mid=(L+R)>>1;
if(mid*k>x&&mid*k<=r) {
ans=max(ans,k);
return ;
}
if(mid*k<=x) {
L=mid+1;
} else {
R=mid-1;
}
}
}
int solve(int x) {
int ans=0;
for(int i=1;i*i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a,b;
ll k;
bool sz[100];
ll c[65][65];
void init()
{
c[0][0]=1;
for(int i=1;i<=64;i++)
{
for(int j=0;j<=i;j++)
{
if(j==0) c[i][j]=1;
else if(j==i) c[i][j]=1;
else c[i][j]=c[i-1][j]+c[i-1][j-1];
}
}
}
int main()
{
init();... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#... |
#include <bits/stdc++.h>
using namespace std;
using i16 = short;
using u16 = unsigned short;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using f32 = float;
using f64 = double;
using f80 = long double;
using P = pair<int, int>;
using vec = vector<int>;
using mat = ve... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
int sum = 0, sumi = 0;
rep(i,3) {
sum += a % 10;
a /= 10;
sumi += b % 10;
b /= 10;
}
cout << max(sum, sumi) << ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vp... | #include <bits/stdc++.h>
#define ll long long
#define db long double
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
using namespace std;
const int mod = 1000000007;
void add(int& a, int b) {
a += b;
if (a >= mod) a -= mod;
if (a < 0) a += mod;
}
in... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
vector<ll>v(3);
cin>>v[0]>>v[1]>>v[2];
sort(v.begin(),v.end());
if(v[0]!=v[1] and v[1]!=v[2] and v[0]!=v[2])cout<<0;
else {
if(v[0]==v[1])cout<<v[2];
else cout<<v[0];
}
cout<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a,b,c,d;
cin>>a>>b>>c>>d;
if(c*d==b)
{
cout<<"-1";
return 0;
}
ll num=c*d-b;
ll ans=(a+num-1)/num;
if(ans<=0)
{
cout<<"-1... |
#include <bits/stdc++.h>
using namespace std ;
int N, ans=0;
string S, T;
vector<int> a, b;
int main(){
cin >> N >> S >> T;
bool f=true;
int x=-1;
for(int i=0;i<N;i++){
if(S[i]=='0')a.push_back(i);
if(T[i]=='0')b.push_back(i);
}
if(a.size()!=b.size())puts("-1");
else{
for(int i=0;i<a.size();... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
char p[1000005],q[1000005];
ll pre[1000005]={0},ans=0,pre2[1000005]={0},n;
ll solve(ll le,ll ri,ll pos)
{
if(pos==0) return 0;
if(le>=ri) return 0;
if(le==ri-1)
{
ans+=1;return 0;
}
ll pos1,pos2;
if(pos==1)
{
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int i, j;
int func (int n){
if (n == 0) return 1;
int x = func(n/2);
x *= x;
if (n%2 == 1) x *= 2;
return x;
}
int main(void){
int n, num_p;
vector<int> A;
vector<int> tr... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned long long
#define ld long double
#define F first
#define S second
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define all(x) begin(x), end(x)
#define ra... |
#include <bits/stdc++.h>
#define Fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using ll = long long ;
using namespace std;
using pii = pair<int,int>;
#define ld long double
#define bit(mask,i) ((mask>>i)&1)
#define p(a) cout<<"("<<a.first<<" "<<a.second<<") ";
#define row vector<ll>
#define vll row
#define mtx ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long ;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<min({a,b,c,d}) <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
typedef long long ll;
#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 vec(i, a) for( auto i=a.begin();i != ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main() {
int N;
cin >> N;
vector<L... |
#include <iostream>
#include <vector>
#include <string>
#include <deque>
#include <list>
#include <tuple>
#include <algorithm>
#include <set>
using namespace std;
uint64_t modValue[200] = {UINT64_MAX};
vector<int> pathOne[200];
int searchPath[200];
vector<uint64_t> all;
bool findFlg = false;
bool findTwo(int path[]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... |
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ggdem=b;i<ggdem;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace st... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include "debug.hpp"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
ll MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N; cin >> N;
vecto... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
//constexpr ll MOD = 1e9 + 7;
constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<cla... | #include <bits/stdc++.h>
using namespace std;
// Big two primes
#define X 1001100011100001111ll
#define mod 1000000007
#define int long long
#define ll long long
#define all(a) a.begin(),a.end()
#define sortall(a) sort(all(a))
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
... |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
long long f[1000],g[1000];
long long n;
int tmp[1000];
int main()
{
f[0]=0,f[1]=1;
for(int n=2;n<=87;n++)
{
f[n]=f[n-1]+f[n-2];
if(f[n]>1e18)break;
}
for(int i=0;i<=87;i+=2)g[i>>1]=f[i];
scanf("%lld",&n);
int lim=43;while(g[lim]>n)--l... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int f[114], n, num;
bool cur_op, yes;
queue <int> ans;
const int inf=1e18;
void init() {
f[0]=1ll, f[1]=2ll;
for(num=2;f[num-1]<=inf;++num)
f[num]=f[num-1]+f[num-2]; --num;
return ;
}
signed main() {
cin>>n;init();
for(int i=num; i>=0; --i) ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
#define INF ((1<<30)-1)
#define LLINF (1LL<<60)
#define EPS (1e-10)
const ll mod = 1e9 + 7;
ll f1(ll n) {
if (n < 0) return 0;
ll res = n * (n... | #include<bits/stdc++.h>
#define debug(a) cout<<#a<<"="<<a<<endl
#define rep(i,a,b) for(ll i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(ll i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(ll i=hd[a],y;(y=to[i]);i=nxt[i])
typedef long long ll;
using namespace std;
char IO;
inline ll rd() {
ll res=0,f=1;
while(I... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vc = vector<char>;
using vcc = vector<vc>;
using Pii = pair<int,int>;
int main(){
int n,x;
cin >> n >> x;
for(int i = 0; i<n; i++){
int a;
cin... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
vector <char> data(n);
for (int i = 0; i < n; i++){
cin >> data.at(i);
}
for (int i = 0; i < n; i++){
if (x == 0 and data.at(i) == 'x') continue;
else{
if (data.at(i) == 'o'... |
//Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b... | #define _USE_MATH_DEFINES
#include <iostream> //cin, cout
#include <vector> //vector
#include <algorithm> //sort,min,max,count
#include <string> //string,getline, to_string
#include <ios> //fixed
#include <iomanip> //setprecision
#include <utility> //swap, pair
#include <cstdlib> //abs(int)
#include <cmath> //sqrt,ce... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#include <numeric>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
typedef long long ll;
ll f[maxn], g[maxn];
ll ans;
ll sqr(ll x) { return x * x;}
ll calcg(int l, int r)
{
return sqr(r - l + 1);
}
ll calcf(int l, int r)
{
l = max(l, 2);
if(l > r) return 0;
return sqr(r - l + 1);
}
int main()
{
int l, r;
sc... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, int> pli;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<tuple<int, int, int>>> adj(n);
while (m--) {
int a, b, c, d;
cin >> a >> b >> ... |
//Shrey Dubey
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<vector>
#include<set>
#include<list>
#include<iomanip>
#include<queue>
#include<stack>
#include <math.h>
#include<climits>
#include<bitset>
#include<cstring>
#include<numeric>
#include<array>
using... |
#include <stdio.h>
#include <algorithm>
long long n;
long long a[400000];
int b[400000];
int q[400000];
int e;
int main() {
scanf("%lld", &n);
for (long long i = 0; i < 2 * n; i++) {
scanf("%lld", a + i);
a[i] *= 2 * n;
a[i] += i;
}
std::sort(a, a + 2 * n);
for (int i = 0; i < n; i++) {
b[a[i] % (2 * n)]++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n;
cin>>n;
n*=2;
vector<vector<int>> a(n, vector<int> (2));
for(int i=0; i<n; i++) {
cin>>a[i][0];
a[i][1]=i;
}
sort(a.begin(), a.end());
for(int i=0; 2*i<n; i++) {
a[a[i][1]][... |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n;
int a[maxn],b[maxn],p[maxn],pinv[maxn];
int main() {
ios_base::sync_with_stdio(fa... | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## ... |
#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 <algorithm>
#include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
std::cout << 100.0 * (1.0 - 1.0 * B / A) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i,n,a) for(int i = a; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const int INF = 1001001001;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int k;
templat... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> VI;
typedef vector<VI> VVI;
typedef pair<ll, ll> P;
#define FOR(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(i,n) FOR(i,0,n)
#define PRINT(V) for (auto v : (V)) cout << v << " "
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios:... |
#include <bits/stdc++.h>
using namespace std;
#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 pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return v... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string a;
cin>>a;
ll n=a.size();
ll i;
bool ok=true;
for(i=0;i<n;i++)
{
if((i+1)%2!=0 && int(a[i])<=90 && int(a[i])>=65)
ok=false;
els... |
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> coords;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
coords.push_back({x, y});
}
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(... |
// #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
#define int long long
#define all(a) a.begin(), a.end()
#define vi vector<int>
#define pii pair<int, int>
#define fe(i, a, b) for (int i = a; i <= (b); ++i)
#define fr(i, a, b) for (int i = b; i >= (a)... | #include <cstdio>
#include <vector>
typedef long long LL;
const int Mod = 998244353;
const int MN = 55;
int N, K, A[MN][MN], Ans;
std::vector<int> G[MN];
int c, vis[MN];
void DFS(int u) {
vis[u] = 1;
Ans = (LL)Ans * ++c % Mod;
for (int v : G[u]) if (!vis[v]) DFS(v);
}
int main() {
scanf("%d%d", &N, &K), Ans = 1... |
#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define x1 x1228
#define y1 y1228
#define left left228
#define right right228
#define tm tm228
#define pb push_back
#define eb emplace_back
#define mp make_pair
... | #include<iostream>
#include<stdio.h>
#include<math.h>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<set>
#define ll long long
const int maxn = 2e5 + 10;
using namespace std;
int m = 0, n, cha[maxn], l, r, qz[maxn], a[maxn], b[maxn];
int main(){
ll res = 0;
scanf("%d", &n);
... |
#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 INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(v) v.begin(), v.end()
#define rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i,n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<... |
#include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... | #include <bits/stdc++.h>
#define ll long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define pll pair<ll, ll>
#define plll pair<ll, pll>
using namespace std;
ll a, b, c, d, cnt = 0, red, cyan, beda;
bool bisa = true;
int main(){
fastio;
cin >> a >> b >> c >> d;
red = a;
cyan =... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map <int, int>
#define mll map <ll, ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vd vector <double>
#define vll vector <ll>
#define fi first
#define se second
#define si set ... | #include <bits/stdc++.h>
using namespace std;
template<class T>
using vec = vector<T>;
template<class T>
using v2d = vector<vector<T>>;
using ld = long double;
using ll = long long;
const ll M = 1e9+7;
int main()
{
int h, w;
cin>>h>>w;
v2d<int> b(h, vec<int>(w, 1));
v2d<ll> r(h, vec<ll>(w, 0));
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll i=1;
ll ans=0;
while(i)
{
if((i*(i+1))/2>=n)
{
ans=i;
break;
}
i++;
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main()
{
fast
int n, cnt = 0;
cin >> n;
if (n%100 == 0) n++,cnt++;
while(n % 100)
n... |
//#include <atcoder/all>
#include <bits/stdc++.h>
//#include <windows.h>
//#include <time.h>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<tuple<... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
#define rep(i, n) for (int i... |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
const LLONG MOD = 100000... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
typedef long long ll;
inline int read() {
int x=0,f=1;char c=getchar();
while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
while(c>=48&&c<=57)x=(x<<1)+(x<<3)+(c^48),c=getchar();
return... |
#include<iostream>
using namespace std;
int main()
{
int X, Y, Z,count=0;
cin >> X >> Y >> Z;
while (Y * Z > X * count)
{
count++;
}
cout << count-1 << endl;
cin >> X;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ll long long
int main(){
int n, s, d;
cin >> n >> s >> d;
vector<vector<int>> M(n, vector<int>(2));
rep(i, n) cin >... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0;i<a;i++)
#define repA(i,a,b) for(int i=a;i<b;i++)
#define l list
#define v vector
#define u_m unordered_map
#define itr iterator
#define nm(a) numeric_limits<a>::max()
typedef long long ll;
const int mxN=2e5;
ll n,arr[mxN],prime[15]={2,3,5,7,... | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define size_t unsigned long long
#define ll long long
#define rep(i, a) for (int i = 0; i < (a); i++)
#define repr(i, a) for (int i = (int)(a)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#de... |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve() {
int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v.begin(),v.end());
for(int i=1;i<n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
typedef long long ll;
typedef long double ld;
const ll INF = 9223372036854775807;
const ll MOD = 1000000007;
const long double PI = acos(-1);
#define mp make_pair
#define all(v) v.begin(), v.end()
#define F first
#... |
#include <bits/stdc++.h>
namespace IO{
char buf[1000000],*p1,*p2;
inline char getc(){
if(p1==p2) p2=(p1=buf)+fread(buf,1,1000000,stdin);
return p1==p2?EOF:*(p1++);
}
template<typename tp>inline void r(tp &n){
n=0;char c=getc();
while(!isdigit(c)) c=getc();
while( ... | #include "bits/stdc++.h"
#define MOD 998244353
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DU... |
#include <iostream>
using namespace std;
int main()
{
int m, h;
cin >> m >> h;
cout << (h % m == 0 ? "Yes" : "No") << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(a,x) memset(a,x... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
long double ed = 0;
ll md = 0,cd = 0;
for(int i = 0; i < n;++i){
ll x;
cin >> x;
cd = max(cd,abs(x));
md = md + abs(x);
ed = ed + (long double)(x*x);
}
ed = sqrt(... | #include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define ROF(i,a,b) for(int i=(a); i>=(b); --i)
#define pb push_back
#define eb emplace_back
#define SZ(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define make_unique(a) sort(all((a))), (a).erase(unique(all((a))),(a).end())
#define x fi... |
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, ll>;
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
#define rrep(i, a, b) for(int i =... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
unsigned long long n, res = 1e18; cin >> n;
for (int i = 63; i >= 0; i--)
res = min(res, n / (1ll << i) + i + n % (1ll << i));
cout << res;
} | #include <bits/stdc++.h>
using namespace std;
typedef multiset<string> mss;
typedef map<int, int> mii;
typedef set<string> ss;
typedef vector<int> vi;
int main(void){
string S;
cin >> S;
string T;
bool isReverse = false;
for(int i = 0; i < S.size(); i++) {
if(S[i] == 'R') isReverse = !isReverse... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mins(x, y) (x = min(x, y))
#define maxs(x, y) (x = max(x, y))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
us... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
int main() {
ll N,cnt=0,S = 0;
cin >> N;
vector<ll> A(N);
for(int i=0; i<N; i++){
cin >> A[i];
S += A[i];
}
sort(A.begin(),A.end());
f... |
//bismillahir rahmanir rahim
//@uthor : mubin_akib
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define endl "\n"
#define scan(a) scanf("%d", &a)
#define print(a) printf("%d\n", a)
int modadd(int a, int b,int MOD = mod){
return((a%MOD)+(b%MOD)+MOD)%MOD;
}
int modsub(int a, int b,int MOD = mod){
return((a%MOD) - (b... |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define tc int t;cin>>t;while(t--)
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define pb push_back
#define pi pair<int,int>
#define pll pair<lli,lli... |
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/trie_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define inf 1e18
#defin... |
#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++)
typedef long long ll;
typedef pair<ll,ll> P;
#define mod 1000000007
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x,ll y) {return x/gcd(x,y)*y;}
int main(){
ll ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sz size()
#define ll long long
#define all(_v) _v.begin(), _v.end()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pvllvll pair <vector <ll>, vector <ll> >
#define ld long doub... |
#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<cassert>
#include<functional>
typedef long long ll;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
int x;
std::string s;
std::cin >> n >> x >> s;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; ++i)
int debug = 0;
const int N = 2010, inf = 1e9;
int n, m, ans, dp[N][N];
vector <int> g[26][N];
main() {
cin >> n >> m;
rep(i, 1, n + 1) {
rep(j, 1, n + 1) {
if (i == j) {
dp[i][j] ... |
#include <bits/stdc++.h>
using namespace std;
enum {
NONE, BLUB, BLOCK
};
int main(int argc, char *argv[]) {
cin.sync_with_stdio(false), cin.tie(nullptr);
int H, W, N, M;
cin >> H >> W >> N >> M;
vector<vector<int>> grid(H, vector<int>(W, NONE));
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >... | #include<bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); ++i)
typedef pair<ll, ll> P;
typedef pair<string, int> Psi;
vector<int> G[2100];
ll visited[2100];
ll ct=0;
void dfs(int from){
for(int j=0;j<G[from].size(); j++){
// cout<<fr... |
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int x, y;
cin >> x >> y;
int z = (x > y ? y - x : x - y) + 3;
if (z > 0) cout << "Yes";
else cout << "No";
} | #include<bits/stdc++.h>
using namespace std;
#define f(t) ll t; cin>>t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define vec vector<ll>
#define vecpair vector<pair<ll,ll>>
using ll = long long;
using ld = long double;
const int N = 2e5 + 5;
int main(){
IOS;
int x,y;
... |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
#define P pair<int,int>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
#define T tuple<int, int, int>
#define PP pair<P,P>
#define ALL(a) a.begin(), a.end()
int main()... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
const int Limit = 10000;
tuple<long long,long long,long long> T;
int main(void) {
int n;
cin >> n;
vector<long long> x(n), y(n), r(n);
vector<long long> a(n), b(n), c(n), d(n);
vector<int>X(Limit + 5, -1);
vecto... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... | // #include <atcoder/all>
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a, b;
cin >> a >> b;
cout << a*(a+1)/2*100*b + a*b*... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define allr(x) x.rb... |
#include <bits/stdc++.h>
using namespace std;
int main(){
double n;
cin >> n;
double x=0;
for (double i=1;i<n;i++){
x+=n/i;
}
cout << fixed << setprecision(10) << x << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define np next_permutation
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define vii vector<vi>
#define vb vector<bool>
#define ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
map<int,int> mp;
for(int i=0;i<n;i++){
int x;
cin>>x;
mp[... | #include <bits/stdc++.h>
#define For(i, l, r) for (register int i = l, _r = r; i <= _r; ++i)
#define Ford(i, l, r) for (register int i = r, _l = l; i >= _l; --i)
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define mk make_pair
const int N = 1e5 + 20;
const int mod = 1e9 + 7;
int T, n, a[N];
ll... |
#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_... | #include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <numeric>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#include <queue>
#include <map>
#include <unordered_map>
#include <cstring>
#include <cassert>
#include <climits>
#inclu... |
#include <iostream>
#include <string>
#include <vector>
#include <random>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <algorithm>
#include <unistd.h>
using namespace std;
int main(){
srand((unsigned)time(NULL));
time_t start = time(NULL);
int si,sj,x,y,now,cnt,num=0;
string ans="",A="";
... | #include <bits/stdc++.h>
using namespace std;
#define DIM 20
#define DIMMASK 270007
//#define ll long long
long long a[DIM],d[DIMMASK];
bool isbit(int mask, int bit) {
return (mask & (1 << (bit-1))) != 0;
}
int removebit(int mask, int b) {
return mask & ~(1 << (b-1));
}
vector< pair<int,int> > g[DIM];
in... |
#include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-10
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
int x[1005],y[1005];
int main(){
string s,t;cin>>s>>t;
int ns=0,nt=0;
for(int i=0;i<s.l... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template <class T>
using idx_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define ull unsigned long long
#define arr array
#define vt vector
#def... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 101;
int a[N], b[N], n;
signed main()
{
scanf("%lld",&n);
for(int i = 1;i <= n; i++) scanf("%lld",&a[i]);
for(int i = 1;i <= n; i++) scanf("%lld",&b[i]);
int now1 = a[1],now2 = b[1], nowmax = now1 * now2;
printf("%lld\n",nowm... | //Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P... |
#define _GLIBCXX_DEBUG
// #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <unordered_set>
#include <utility>
#include <tuple>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
cons... | #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... |
/**
*!! God will direct your steps !!
* @Author : Ekansh Saxena (ekansh9927)
* @DateTime: 19-12-2020 17:59:21
*
**/
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define pob pop_back
#def... | #include <math.h>
#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <tuple>
#include <vector>
#include <cmath>
#include<set>
#include <sstream>
#include <bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()//配列を全部参照
using namespace std;... |
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#ifdef DEBUG
#include "debug.hpp"
#endif
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define traverse(c, it) for(auto it = (c).begin(); it != (c).end(); ++it)
#define rep(i, N) ... | #include <bits/stdc++.h>
using namespace std;
#define vec vector
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define F first
#define S second
using ll = long long int; // watch out for overflows in your code
using pii = pair<int,int>;
//mt19937 rng(chrono::steady_clock::now().time_since_e... |
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
namespace IN {
#define BUF_SIZE 1 << 17
static char buf[BUF_SIZE], *fs = buf, *ft = buf;
inline int nc() { return fs == ft && (ft = (fs = buf) + fread(buf, 1, BUF_SIZE, stdin), fs == ft) ? EOF : *fs++; }
template <typename T>
inline int rn(T &x) {
x = 0;
int... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define stp(var, init, end) for (auto var = init; var < end; ++var)
#define ll long long
int main(void)
{
int n, cou = 0;
cin >> n;
ll dif = 0, a, b;
vector<ll> get(n);
stp(i, 0, n)
{
cin ... |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
#define PUTS(x) std::cout << (x) << endl;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
vector<Int> IntsIn(int n) {
auto v = vector<Int>(0);
for (int i = 0; i < n; i++) {
Int a;
cin >> a;
v.pu... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll H,W;
ll A[505][505];
ll B[505][505];
struct edge{ll to,cost;};
using P=pair<ll,ll>;
using PP=pair<ll,P>;
using PPP=pair<ll,PP>;
using Graph=vector<vector<edge>>;
static const ll INF=1000000000000000;
ll d[2][505][505];
void dijkstra(ll sx,ll sy){
for... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
using graph=vector<vector<int>>;
void add_directed_edge(graph& G,int u,int v){
G[u].emplace_back(v);
}
const long long INF=1LL<<61;
int main(){
int n,m; scanf("%d%d",&n,&m);
vector<lint> a(n);
rep(i,n) ... | #include<bits/stdc++.h>
using namespace std;
#define N 5005
#define mod 998244353
#define ll long long
int n,m,c[N][N],f[21][N];
int main(){
for(int i=0;i<N;i++){
c[i][0]=c[i][i]=1;
for(int j=1;j<i;j++)c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
}
scanf("%d%d",&n,&m);
f[0][0]=1;
int lst=0;
for(int i=1;(1<<i)<=m;i++)... |
#include <bits/stdc++.h>
using namespace std;
int N;
int main(){
cin >> N;
if (N * 108 / 100 < 206)puts("Yay!");
else if (N * 108 / 100 == 206)puts("so-so");
else puts(":(");
return 0;
}
| #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;
vector<pair<int, int> > prime_factorize(int N) {
vector<pair<int, int> > res;
for (int a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
... |
#include <cstdio>
const int maxn=100+10;
struct E{
int to;
int next;
}ed[maxn*maxn*2];
int head[maxn];
int tot;
void J(int a,int b){
ed[++tot].to=b;
ed[tot].next=head[a];
head[a]=tot;
}
int en;
int vis[maxn];
int ans;
void Dfs(int x){
if(x==en+1){
ans++;
return;
}
if(!head[x]){
Dfs(x+1);
return;
}
for... | //
//abc195_e
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(i,s,n) for(int i=s;i<n;++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int p[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
const int n = 20;
const ll bn = 1 << n;
ll dp[75][bn];
in... |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
vector<int> a;
vector<vector<int>> solve();
int main() {
cin >> n >> s;
a.resize(n + 1);
for (auto &p : a) cin >> p;
auto res = solve();
cout << res.size() << endl;
for (auto &v : res)
for (int i = 0; i <= n; ++i) cout << v[i] << " \n"[i ... | #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 <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
struct AMat
{
public:
AMat() : m{ 0, 0, 0, 0 }, v{ 0, 0 }
{}
AMat(int op, int p) : m { 0, 0, 0, 0 }, v{ 0, 0 }
{
if (op == 1) {
m[0][0] = 0;
m[0][1] = 1;
m[1][0] = -1;
... | #include<iostream>
#include<bits/stdc++.h>
#define int long long int
#define vi vector<int>
#define fo(i,n) for(int i=1;i<=n;i++)
#define foo(i,n) for(int i=0;i<n;i++)
#define sort(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define uniq(v) sort(v); v.resize(unique(v.begin(), v.end())-v.begin... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define me memset
#define rep(a,b,c) for(int a=b;a<=c;++a)
#define per(a,b,c) for(int a=b;a>=c;--a)
const int N = 1e6 + 10;
const int mod = 998244353;
const int INF = 0x3f3f3f3f;
using namespace std;
typedef pair<int,i... |
#include <bits/stdc++.h>
using namespace std;
int n;
double ans;
bool can[105][105];
int main() {
cin>>n;
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j) {
char c; cin>>c;
can[i][j]=c=='1';
}
for (int i=1; i<=n; ++i)
can[i][i]=1;
for (int k=1; k<=n; ++k)
for (int i=1; i<=n; ++i)
for (int j=1; j... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long
#define ull unsigne... | #include <iostream>
#include <vector>
using namespace std;
using llint = long long;
#define rep(i,n) for(int i=0;i<(n);++i);
int main() {
llint a,b,c;
cin >> a >> b >> c;
cout << (7-a) + (7-b) + (7-c) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 100005;
LL n, m;
__int128 zh(__int128 x) {
return x * (x - 1) * (x - 2) / 6;
}
__int128 cal(__int128 x) {
__int128 res = zh(x);
if (x > n) res -= 3 * zh(x - n);
if (x > ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma comment(linker, "/stack:200000000")
using namespace std;
using namespace __gnu_pbds;
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
int n,m,ans=1;
char s[508][508];
signed main() {
scanf("%lld%lld",&n,&m);
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
cin>>s[i][j];
for(int j=2; j<=n+m; j++) {
int flag=0,ok=1,sum=1;
for(int i=1; i<j; i++) {
... | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a) (ll)... |
#ifdef Icry
#include "debug.h"
#else
#include <bits/stdc++.h>
#define debug(args...)
#endif
using namespace std;
const int N = 1e5 + 10;
int dp[111][N], a[111], n, sum = 0;
int go(int i, int t) {
if (i == n) return max(t, sum - t);
int &ret = dp[i][t];
if (~ret) return ret;
ret = min(go(i ... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int num[N];
int dp[N];
int main()
{
int n;
cin>>n;
int sum=0;
for(int i=1;i<=n;i++)
cin>>num[i],sum+=num[i];
if(n==1)
{
cout<<num[1];
return 0;
}
dp[0]=1;
int temp=sum;
sum/=2;
for(int i=1;i<=n;i++)
for(int j=sum;j>=num[i];j--)
if(dp[... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int n=s.size();
for(int i=0;i<n;i++)s[i]-='0';
if(n<3){
if(n==1)cout<<(s[0]%8 ? "No" : "Yes")<<endl;
else cout<<((s[0]*10+s[1])%8 && (s[1]*10+s[0])%8 ? "No" : "Yes")<<endl;
return 0;
}
vector<i... | #define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define ... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
... | /* *Which of the favors of your Lord will you deny ?* */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define vpnt(ans) \
for (ll i = 0; i < ans.size(); i++) \
cout << ans[i] << (i + 1 < ans.size() ? ' ' : '\n');
#define setbit(x, ... |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
// #define int long long
#define int __int128
#define endl "\n"
constexpr int INF = (int)1e35;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
s... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> sz;
UnionFind(int n=0){ if(n>0) initialize(n); }
void initialize(int n){
par.resize(n);
sz.assign(n, 1);
for(int i=0; i<n; i++){
par[i] = i;
}
}
int find(i... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
static int a[5];
scanf("%d%d%d%d",&a[1],&a[2],&a[3],&a[4]);
sort(a+1,a+5);
puts(a[1]+a[4]==a[2]+a[3] || a[4]==a[1]+a[2]+a[3] ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr long long INF = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
signed main() {
cin.tie(null... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,b;
cin >> x;
if(x%100==0){
b =100;
}
else{
for(int i=0;i<1001;i++){
if(0<i*100-x && i*100-x < 100){
b=i*100-x;
break;
}
}
}
cout << b << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <cassert>
#define amax(a, b) a = std::max(a, b)
#define amin(a, b) a = std::min(a, b)
using ll = long long;
using ld = long double;
#define RATIO (10000ll)
#define OFFSET (100000000000ll)
ll toLL... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,w;
cin >> a >> b >> w;
int m=1e9,M=0;
for(int n=1;n<=1000000;n++){
if(a*n<=1000*w && 1000*w<=b*n){
m=min(m,n);
M=max(M,n);
}
}
if(M==0)cout << "UNSATISFIABLE";
else cout << m << ' ' << M;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
class Mat
{
public:
ll a[2][2];
ll b[2];
Mat()
{
a[0][0] = 1;
a[0][1] = 0;
a[1][0] = 0;
a[1][1] = 1;
b[0] = 0;
b[1] = 0;
}
Mat(ll m, ll p)
{
if (m == 1) {
... | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll nax = 200002;
const ll p = 1e9 + 7;
ll dp[nax][2];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
vector<ll> mn(n + 2, INT_MAX), mx(n + 2, INT_MIN);
for (... |
#include<bits/stdc++.h>
using namespace std;
#define io cin.tie(0);ios::sync_with_stdio(false);
#define debug(x) cout<<#x<<"="<<x<<endl
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define mk make_pair
#define ll long long
#define lb long double
#define rs p<<1|1
#define ls p<<1
const int maxn = 1e6 + 5;
const in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.