code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
std::vector<std::vector<int>> children, list;
std::vector<int> in, out, depth;
int timer;
void dfs(const int u) {
in[u] = timer++;
list[depth[u]].push_back(in[u]);
for (const int v : children[u]) {
depth[v] = depth[u] + 1;
dfs(v);
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define all(v) v.begin(), v.end()
#define pb push_back
#define sz(x) (int)(x).size()
const int N = 3e5 + 5;
void solve() {
int n, m;
scanf("%d%d", &n, &m);
vector<vi> g(n);
vi cur... |
#include <bits/stdc++.h>
#pragma GCC target ("sse4.2")
using namespace std;
bool home = 1;
typedef long long ll;
///#define int ll
typedef long double ld;
typedef unsigned long long ull;
signed realMain();
mt19937 rng_home(0);
mt19937 rng_oj((long long) (new char));
int rng() {
if (home) {
return rng_home();... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll A[200];
ll memo[210][210];
ll f(int k, int a) {
if (k == N) {
if (a == 0)return 1;
return 0;
}
if (memo[k][a] != -1)return memo[k][a];
return memo[k][a] = min(100LL, f(k + 1, a) + f(k + 1, (a - A[k] + 400) % 200));
}
int main() {
cin ... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
#include <i... | #include<bits/stdc++.h>
using namespace std;
template<typename T>
inline void read(T &x){
x=0;bool dp=false;char ch=getchar();
while(!isdigit(ch)){dp|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
x=dp?-x:x;
return ;
}
template<typename T>
inline void write(T x){
if(x<0) putcha... |
#include <bits/stdc++.h>
using namespace std;
// modint
template<int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0) val += MOD;
}
constexpr int getmod() const { return MOD; }
constexpr Fp operator - () const noexcept {
return val... | using namespace std;
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 101
#define ll long long
#define mo 998244353
int n,K;
int a[N][N];
int dsu[N];
int getdsu(int x){return dsu[x]==x?x:dsu[x]=getdsu(dsu[x]);}
ll fac[N];
ll work(){
for (int i=1;i<=n;++i)
dsu[i]=i;
for (int i=1;i<=n;++i)
for (i... |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin >> n;
int hist[n];
for (int i = 0; i < n; i++) cin >> hist[i];
stack<int> s;
int max_area = 0;
int tp;
int area_with_top;
int i = 0;
while (i < n)
{
if (s.empty() || hist[s.top()] <= hist[i])
... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define eb emplace_back
#define mp make_pair
typedef pair<int,int> pii;
#define f first
#define s second
#define min(a,b) ((a<b)?a:b)
bool debug=false;
//const int mod=1000000007;
char arr[400005],s;
string mm="BWR";
#define op(a,b) ((a==b)?a:(3-a-b... |
#include<bits/stdc++.h>
using namespace std;
#define ints(...) int __VA_ARGS__; vin(__VA_ARGS__)
#define dbls(...) double __VA_ARGS__; vin(__VA_ARGS__)
#define ulls(...) unsigned long long __VA_ARGS__; vin(__VA_ARGS__)
#define strs(...) string __VA_ARGS__; vin(__VA_ARGS__)
#define vifin(x, y) vi x(y); fin(x, y)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(long long i=(long long)(a);i<(long long)(b);i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<ll,ll> P;
ll a,b,c;
int main(){
cin>>a>>b>>c;
a%=10;
b%=20;
c%=4;
if(c==0)c=4;
ll d=(ll)pow(b,c)%4;
... |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<cstring>
using namespace std;
typedef long long ll;
ll a[200100];
void solve(int T)
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int n;
cin >> n;
ll a, b, ans = 0;
rep(i, 0, n) {
cin >> a >> b;
ll num = (b - ... |
/*Author Sanjay shukla
verdict Ac
*/
#include<iostream>
#include<string.h>
// #define endl ("\n")
#define pi (3.141592653589)
// #define int long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) cc.begin(), c.end()
#define rrep(i, n) for(int i=n-1;i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int p=0;
for(int i=0;i<9;i++)
{
if(s[i]=='Z'&&s[i+1]=='O'&&s[i+2]=='N'&&s[i+3]=='e')
p++;
}
cout<<p;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/debug.h"
#else
#define db(...)
#endif
#define all(v) v.begin(), v.end()
#define pb push_back
using ll = long long;
const int NAX = 2e5 + 5, MOD = 1000000007;
void solveCase(int64_t A, int64_t B, int64_t W)
{
// TODO: edit here
W *= 1000;
... | #include <bits/stdc++.h>
#define mem(arr, val) memset(arr, val, sizeof(arr))
#define all(v) v.begin(), v.end()
#define endl '\n'
#define decision (yes ? "YES" : "NO")
using namespace std;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> p... |
#include<ctime>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
const double k=(sqrt(5)-1)/2;
const double t=k;
ll read(){
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while(isdigit(c)){
x=x*10+f*(c-48);
c=getchar();
}
return... | #include <bits/stdc++.h>
#define REP(x, a) for(int x=0; x<a; x++)
#define sz(x) (int) (x).size()
using namespace std;
int _;
void solve() {
string s;
cin >> s;
int n = sz(s);
if (s > "atcoder") {
cout << 0 << '\n';
return;
}
int pos = -1;
REP(i, n) {
if (s[i] != 'a') {
pos = i;
break;
}
}
if (... |
// Guess Who's Back
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define endl '\n'
#define D(x) cerr << #x << " = " << (x) << '\n'
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const int N ... | #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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.ti... |
#include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
const int N = 2e6 + 5;
ll n , m , k;
ll fact[N];
ll mod... | /*Jai Shree Ram*/
// Never Give Up
/*自分を信じない人にとっては、一生懸命働くことは無意味です*/
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii ... |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... |
#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;
// typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
#define scn(n)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define io ios::sync_with_stdio(false); cin.tie(0)
int main()
{
io;
int n, k; cin >> n >> k... |
#include <iostream>
#include <cmath>
using namespace std;
void solve(double a,double b,double W){
int min=ceil(W/b),max=floor(W/a);
if((b*min-W)<=(b-a)*min&&(a*max-W)<=(b-a)*max){
cout<<min<<" "<<max;
}else{
cout<<"UNSATISFIABLE";
}
}
int main(){
double a,b,w;
cin>>a>>b>>w;
... | #include<iostream>
#include<utility>
#include<algorithm>
#include<set>
#include<vector>
#include<cmath>
#define forn(i, x, n) for(int i = x; i < n; i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const bool DEBUG = 0;
void solve(){
int a, b, w;
cin>>a>>b>>w;
w *= 1000;
int mn =... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, count, Flag;
cin >> n;
count = 0;
for (int i = 1; i <= n; i++) {
Flag = 0;
x = i;
y = i;
for (int j = 0; j < 10; j++) {
if ((x%10)==7 || (y%8)==7) Flag = 1;
x = x / 10;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int ans=0;
for(int i=0;i<S.size();i++){
if(S.at(i)=='Z' && i<9){
if(S.at(i+1)=='O'){
if(S.at(i+2)=='N'){
if(S.at(i+3)=='e'){
ans++;
}else{
continue;
}
}else{
continue;
}
}else{
continue;
}
}else{
continue;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const vector<int> XS = { 0, 0, 1, 1 };
const vector<int> YS = { 0, 1, 0, 1 };
const char BLACK = '#';
int count(int i, int j, vector<string> &s) {
int count = 0;
for (int k = 0; k < int(XS.size()); k++) {
if (BLACK == s[i + XS[k]][j + YS[k]]) {
count++;
}
}
ret... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<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>=b;i--)
#define ALL(x) x.begin(),x.e... |
#include <bits/stdc++.h>
#include <math.h>
#include <chrono>
using namespace std;
#pragma GCC optimize("-O3")
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10)... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
const int M = 1e5+5;
int n,m;
int w[10];
int sums[M],mw[M];
int main(){
cin >> n >> m;
int maxw = 0;
for(int i = 0;i < n;i++){
cin >> w[i];
maxw = max(maxw,w[i]);
}
in... |
#include<iostream>
using namespace std;
int main() {
string s, c;
cin >> s >> c;
int a = 0, b = 0;
for (int i = 0; i < s.length(); i++) {
a += s[i] - '0';
}
for (int i = 0; i < c.length(); i++) {
b += c[i] - '0';
}
if (a > b) {
cout << a;
}
else {
cout << b;
}
} | #include <bits/stdc++.h>
using namespace std;
int sum(int n){
int a = n/100;
int b = (n-a*100)/10;
int c = (n-a*100-b*10);
return a+b+c;
}
int main() {
int a, b;
cin >> a >> b;
int asum = sum(a);
int bsum = sum(b);
cout << max(asum, bsum) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define e(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define out(s) cout << s << endl
typedef long long ll;
using Graph = vector<vector<int>>;
const int MOD = 1000000007;
int main(){
int n;
cin... | #include <bits/stdc++.h>
using namespace std;
struct node {
int x, y;
} a[1010];
int n, ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i].x, &a[i].y);
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
if (i != j && a[i].x != a[j].x)
if ((double)(a[i].y - a[j]... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
ll ans=10000000;
cin >> N;
vector<ll>A(N), B(N);
rep(i, N) {
cin >> A[i] >> B[i];
ans = min(ans, A[i] + B[i]);
}
sort(A.begin(), A.end());sort(B.begin(),... | #include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].t... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const int MX = 125001;
ll MOD;
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
double dp[101][101][101];
double f(int a,int b,int c){
if(dp[a][b][c]) return dp[a][b][c];
if(a==100||b==100||c==100) return 0;
double s=0;
s+=(f(a+1,b,c)+1)*a/(a+b+c);
s+=(f(a,b+1,c)+1)*b/(a+b+c);
s+=(f(a,b,c+... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
template<class T> inline bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T&a,T b){if(a>b){a=b;return 1;}return 0;}
using ll = long long;
int a,b;
int main () {
cin.tie(0); ios::sync_wi... | /*
* @Author: kabbo
* @Date: 2020-06-24 08:40:07
* @Last Modified by: kabbo
* @Last Modified time: 2020-06-24 08:49:58
*/
#include<bits/stdc++.h>
using namespace std;
#define pii pair<long long,long long>
#define endl '\n'
#define ull unsigned long long
#define ll int64_t
#define ar array
// http://www.open-std.org... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_
void debug_out() {cerr << endl;}
template<typename Head,typename... Tail> void debug_out(Head H,Tail... T){cerr << ' ' << H; debug_out(T...);}
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:",debug_out(__VA_ARGS__)
#define dump(x) cer... | #include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
int main(){
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define iter(it, s) for (auto it = s.begin(); it != s.end(); it++)
... | #include<iostream>
#include<bits/stdc++.h>
#include<string>
#include<algorithm>
#define ll long long
#define pb push_back
#define pob pop_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define loop(i,n) for... |
#include <bits/stdc++.h>
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_elemen... | #include <bits/stdc++.h>
using namespace std;
long long pattern(long long x, long long N){
if(x > 1 && x < N+1){
return x - 1;
}
if(x > N && x < 2*N+1){
return 2*N - x + 1;
}
}
int main() {
long long N, K, ans;
ans = 0;
cin >> N >> K;
for (long long Q=2; Q<2*N+1; Q++){
if(K + Q < 2){
... |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<long long>>;
const long long INF = 1LL <<59;
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>
#define LL long long
#define ull unsigned long long
#define F(i, j, k) for(int i = j; i <= k; i++)
#define DF(i, j, k) for(int i = j; i >= k; i--)
using namespace std;
template <typename T> inline void read(T &n) {
T w = 1;
n = 0;
char ch = getchar();
while (!isdigit(ch) && ch != EOF)... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
using ll = long long;
const ll INF = 1e9;
int n,q;
vector<ll> a,t,x;
void solve() {
ll s = 0, l = -INF, r = INF;
REP(i,n) {
if (t[i] == 1) { // +
s += a[i];
l += a[i];
r += a[i];
} else if (t[i] == 2) { /... | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long int
#define pii pair<int,int>
#define pll pair<long long int,long long int>
#define pci pair<char,int
#define mii map<int,int>
#define mll map<long long int,long long int>
#define mci map<char,int>
#define umi... |
#include<bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
// int t;
// cin>>t;
// while(t--)
// {
// }
unsigned long long int x,y,a,b,count=0;
cin>>x>>y>>a>>b;
while(1)
{
if(x*(a-1)>b)
{
break;
}
if(y<=x*a)
brea... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b;
cin>>c>>d;
cout << b-c << endl;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
using namespace s... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... |
#include<bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long k , n , m , a [100005];
vector < long long > v;
bool ck ( long double x )
{
v . clear ();
long double mm = m , nn = n;
long long mnsum = 0 , mxsum = 0;
for ( int i = 0 ; i < k ; i ++ )
{
long long mn = ceil ( ( m... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vvvvll = vector<vector<vector<vector<ll>>>>;
using pl4 = pair<ll,ll>;
using str = string;
using vpl4 = ve... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,... | #include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <iostream>
#define ll long long
using namespace std;
int k;ll n,m,a[100010],ans[100010],l[100010],r[100010],le,ri;
bool check(ll x)
{
le=0,ri=0;
for(int i=1;i<=k;i++)
{
r[i]=(x+a[i])/n;
if(a[i]<=x) l[i]=0;
else l[i]=((a[i]-x)%n... |
//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
... |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define MOD 998244353
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; ret... | //#include <atcoder/all>
#include <bits/stdc++.h>
#include <cassert>
#include <numeric>
using namespace std;
//using namespace atcoder;
typedef long long LONG;
const int MOD = 1000000007;
int gcd(int x, int y) {
if (x % y == 0) {
return y;
}
else {
return gcd(y, x % y);
//x%y==0でないときはユーグリットの互除法を使って再帰的に関数を呼... |
#include <bits/stdc++.h>
#define int long long
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
const long long INF = 1e18;
const long long MOD = 998244353;
void solve()
{
int n, x;
cin >> n >> x;
string s;
cin >> s;
int now = x;
for (int i = 0; i < n; i++)
{
... | #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 ans=2*a+100-b;
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
cin>>n;
long long int arr[n],ans=0,temp=0;
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
for(int i=0;i<n;i++)
{
ans+=arr[i]*i-temp;
temp+=arr[i];
}
cout<<ans<<endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for(int i=0; i<N; i++) cin >> p[i];
vector<bool> ans(210000, true);
int cur = 0;
for (int i = 0; i < N; i++) {
ans[p[i]] = false;
for (; cur <= 210000; cur++) {
if (ans[cur]) {
... |
#include<bits/stdc++.h>
using namespace std;
int n,m;
long long sam;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
sam+=i*100+j;
}
cout<<sam;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int32_t main()
{
//freopen("input.txt", "r", stdin);
IOS;
int a; cin >> a;
int b; cin >> b;
for(int i = -100 ; i <= 100 ; i++)
{
for(int j = -100 ; j <= 100 ; j++)
{
if(i+j ... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int R=2e5 + 5;
const int N=1e5 + 3;
const int M = 2e3 + 3;
const int INF=0x3f3f3f3f;
struct edge{
int v,w,next;
}e[R*2];
int dis[N],head[2*N],cnt=0;
int a[M][M];
struct node{
int u,d;
bool operator <(const node&rhs) co... | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#in... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const int mod = 1000000007; //出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60;
int main... | //#pragma GCC optimize ("O2")
//#pragma GCC optimize ("Ofast")
// IN THE NAME OF GOD
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
template <typename Head>
inline void dout(Head in) {
cerr << in << '\n';
}
int main() {
ios::sync_with_stdio(false), cin.tie(NULL);
int t;
cin >> t;
... |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll> ;
#define rep(i,n) for(ll i=0;i<(n);i++)
ll min(ll a,ll b){return a>=b ? b:a;}
ll max(ll a,ll b){return a>=b ? a:b;}
int main(){
ll n;
cin >> n;
vector<P> X(n);
vector<P> Y(n);
rep(i,n){
ll x,y;
... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
set<int> stepped;
int t[50][50];
int p[50][50];
int s=0;
int i,j;
char randstep()
{
vector<char> ds;
if (i>0 && !stepped.count(t[i-1][j])) ds.push_back('U');
if (i<49 && !stepped.count(t[i+1][j])) ds.push_back('D');
if (j>0 && !stepped... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//#define SOME_TESTCASE
//#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 i... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
int main() {
ll N;
cin >> N;
ll cnt=N;
for (int i=0;i<70;i++) {
if (N<pow(2,i)) {
break;
}
else {
ll a=N/pow(2,i);
ll c=a*pow(2,i);
ll b=N-c;
if ((a+i+b)<cnt) {
cnt=a+i+b;
}
}
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long x,a,bb,cc;
int count=0, arr[65], b[65], kaam=0;
long long c[65];
cin>>x;
for(int i=0; x!=0; i++)
{
arr[i]=x%2;
x=x/2;
count++;
if(arr[i]==1)
b[... |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << 21 - a - b - c << endl;
return 0;
} | #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>
typedef long double ld;
#define int unsigned long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *m... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define... |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define ok() put... | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
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);
#endif
ll v, a, b, d; cin >> v >> a >> b >> d;
a *= v , b *= ... |
//g++ -std=c++14 test.cpp -o test.out
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
#define INF LONG_MAX/3
#define bit(n) (1LL<<(n))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n), b(n), d(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) d[i] = b[i] - a[i]; // d>0なら[],B選択が有利
... | #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>;
bool chtr(vector<vector<ll>> a){
ll n=a.at(0).size();
rep(i,n-1){
rep(j,n-1){
if((a.at(i+1).at(j+1)-a.at(i).at(j+1))!=(a.at(i+1).at(j)-a.at(i).at(j))){
... |
#include<ctime>
#include<cstdio>
#include<cctype>
#define ll long long
using namespace std;
const ll N=2e5+7;
ll read(){
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while(isdigit(c)){
x=x*10+f*(c-48);
c=getchar();
}
return x;
}
ll n,w,s,t,m,p,f,a[N];
int main(){
#ifndef ONLINE_JUDGE
fr... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N, T;
cin >> N >> T;
vector<ll> A(N);
for(auto &x: A) cin >> x;
vector<ll> q;
for(int bit = 0; bit < (1<<(N-N/2)); ++bit){
ll sum = 0;
for(int i = 0; i < N-N/2; ++i){
if(bit&(1LL<<i)) sum += A[i+N/2];
}
q.push_back(sum)... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define u unsigned
#define ull unsigned long long
#define ld long double
#define pb push_back
#define fasterInOut ios::sync_with_stdio(false); cin.tie(0);
#define pi acos(-1)
#define f(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,a,b) for(int i=(a);i>=(... | #include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<memory.h>
#include<vector>
#include<math.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a==b)
cout<<c;
else if(a==c)
cout<<b;
else if(b==c)
cout<<a;
else
cout<<0... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin>>s;
ll i,j;
ll f=0;
ll n=s.size();
for(i=0;i<n;i+=2)
{
if(s[i]>='a'&&s[i]<='z')
{
}
else
{
f=1;
}
}
if(!f)
{
... | /* 2020-12-25 */
#include <bits/stdc++.h>
#define all(s) (s).begin(),(s).end()
#define rall(s) (s).rbegin(),(s).rend()
#define uni(s) (s).erase(unique(all(s)),(s).end())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
const int INF = (int)(1e9) + 10;
bool check(int x,int ba... |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#inc... | #include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(c&1){
if(a<0&&b>0){
return 0&puts("<");
}
if(a>0&&b<0){
return 0&puts(">");
}
if(a==b){
return 0&puts("=");
}
if(a<b){
puts("<");
}
if(a>b){
puts(">");
}
}
else{
a=abs(a),b=abs(b... |
#include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <utility>
#include <cstdarg>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#inclu... | /*NEVER GIVE UP*/
/*First try brute force and check if it is in the range of time complexity*/
/*Then try to solve the problem in mathematical form*/
/*Then try to imagine how the final ans will look like*/
/*Write on paper if still not able to get*/
/*Try to think diff. algorithms and data structures that could solve ... |
// Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
//... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef unsigned long long ull;
#define pi 3.1415926535... | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <cmath>
#include <climits>
#include <fstream>
#include <chrono>
using namespace std;
const long long INF = LLONG_MAX;
const long long MOD = 10000000... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N];
bool solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
if (n % 2)
return false;
map<int, int> freq;
for (int i = 1; i <= n; i++) {
freq[a[i]]++;
}
for (auto [x, f] : freq) {
if (f % 2)
return true;... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace std;
#define int long long
#define pb push_back
#define mp ma... |
#include <bits/stdc++.h>
using namespace std;
const double pi=3.141592653589793;
const int64_t inf=1L<<60;
//const int64_t mod=1000000007;
const int64_t mod=998244353;
int main(){
int N,M;
cin>>N>>M;
map<int,set<int>> black;
set<int> move;
move.insert(N);
for(int i=0; i<M; i++){
int x,y;
cin>>x>>y... | #include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... |
#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 <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <utility>
#include <complex>
#include <chrono>
using namespace std;
using namespace std:... |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <random>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
co... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define endl "\n"
#define pb push_back
#define mod 1000000007
#define MAXN 100000
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int dx8[]={1,-1,0,0,1,1,-1,-1};
int dy8[]={0,0,1,-1,1,-1,1,-1};
int s... |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
# define drep(i,a,b) for(int i=(a); i>=(b); --i)
typedef long long int_;
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; c=getchar())
if(c ==... | #include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef std::vector<ll> vi;
typedef std::vector<std::vector<ll> > vv;
typedef std::vector<std::pair<ll,ll> > pii;
#define mod 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,b) for(i=a;i<b;i++)
#define f... |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
void dfs(int v,vector<bool> &flag,Graph &g){
if(!flag[v]){return;}
flag[v]=false;
for(auto &nx : g[v]){dfs(nx,flag,g);}
}
int main(){
int n,res=0;
cin >> n;
vector<int> a(n);
vector<bool> flag(200005,false);
Graph g(200005)... |
#include "bits/stdc++.h"
using namespace std;
using li = long long;
const char newl = '\n';
template <class T> vector<vector<T>> vv(const unsigned int n, const unsigned int m, const T x) { return vector<vector<T>>(n, vector<T>(m, x)); }
template <class T> vector<vector<vector<T>>> vvv(const unsigned int n, const unsign... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define mod(x) (x % MOD + MOD) % MOD
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, x;
string s;
cin >> n >> x >>... |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#inc... | #include <bits/stdc++.h>
using namespace std;
int a, b, ans;
int check(int a, int b) {
if (a+b >= 15 && b >= 8) return 1;
if (a+b >= 10 && b >= 3) return 2;
if (a+b >= 3) return 3;
return 4;
}
int main() {
//freopen("isc.inp", "r", stdin);
//freopen("isc.out", "w", stdout);
scanf("%d%d"... |
#include <iostream>
int main() {
unsigned int N;
std::cin >> N;
int cnt = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; ++j) {
if (i+j == N) cnt++;
}
}
std::cout << cnt;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
cout<<n-1<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[65];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string s;
cin>>s;
if(s == "AND") a[i] = 1;
else a[i] = 0;
}
ll t = 1,f = 1;
for(int i=0;i<n;i++){
if(a[i] == 1) {
t =... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>... |
#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
long long N;
long long fib[1 << 18];
void init() {
fib[0] = 1; fib[1] = 1;
for (int i = 2; i <= 90; i++) fib[i] = fib[i - 1] + fib[i... | #include<bits/stdc++.h>
#define N 5000005
using namespace std;
int read() {
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
int n,a[N],b[N],ans;
bool tag[2005];
int main() {
n = read();
for(int i=1; i<=n; ++i)a[i] = read... |
//https://atcoder.jp/contests/abc187/tasks/abc187_d
//D - Choose Me
#include <bits/stdc++.h>
using namespace std;
//如果提交到OJ，不要定义 __LOCAL
//#define __LOCAL
typedef long long ll;
const int MAXN=2e5+4;
ll vote[MAXN];
int main() {
#ifndef __LOCAL
//这部分代码需要提交到OJ，本地调试不使用
ios::sync_with_stdio(false);
cin.tie(... | #include <iostream>
#include <bits/stdc++.h>
#include <bitset>
#define ll long long int
#define pi pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vll vector<vl>
#define vpi vector<pi>
#define vpll vector<pll>
#define vb vector<bool>
#define vii vector<... |
#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;
#define int long long
#define sim template <class c
#define ris return *this
#define dor > debug& operator<<
#define eni(x) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
typedef long long ll;
ll n;
cin >> n;
vector<ll> x;
vector<ll> y;
bool isYes = false;
for(int i=0; i<n; i++){
ll a, b;
cin >> a >> b;
x.push_back(a);
y.push_back(b);
}
for(int i=0; i<n-2; i+... |
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... | #include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(v) std::begin(v), std::end(v)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std... |
#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;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <assert.h>
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
template <class T> void input(T& a){
cin>>a;
}
int main(){
int N;
input(N);
ll ans=0;
vector <int>A(N);
vector <int>B(200);
... | #include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,a[N];
double m,p,s,t;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),p+=a[i];
sort(a+1,a+n+1);
m=p;
for(int i=1;i<=n;i++)
{
p-=a[i];
double s=p,t=a[i]/2.0;
s+=t*(i*2-n);
m=min(m,s);
}
printf("%.9lf\n",m/n);
r... |
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
#define ci const int
inline int max(ci &x, ci &y) {return x > y ? x : y;}
inline int min(ci &x, ci &y) {return x < y ? x : y;}
inline void swap(int &x, int &y) {x ^= y ^= x ^= y;}
inline void chmax(int &x, ci &y) { if(x < y) x = y; }
inli... | #include <bits/stdc++.h>
using namespace std;
#define N 805
#define MAX_A 1000000000
#define rep(i, n) for(int i = 0; i < n; ++i)
int main(void) {
int n, k, lim;
int a[N][N];
int s[N][N];
rep(i, N) {
s[i][0] = 0;
s[0][i] = 0;
}
int ng = -1;
int ok = MAX_A;
int mid;
bool ext;
cin >> n >> k;
lim = ((k*k) /... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define F first
#define S second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define read(v) for(auto &it:v) cin>>it;
#define deb(x) cout << ">" << #x << '=' << x << endl;
#define... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1001001001;
const int mod = 1000000007;
// rotation 90 degrees
vvi rot(vvi orginal,int h,int w){
vvi v(w,vi(h));
for(int i = 0;i < ... | #include <iostream>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<a*d-b*c<<endl;
return 0;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <unordered_set>
using namespace std;
class Solution{
public:
double solve(int N, int M, int K, const vector<int>& A){
unordered_set<int> Aset(A.begin(), A.end());
vector<double> a(N + M, 0.0), b(N + M, 1.0);
double asum = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define fin(a) { cout << a << endl; return 0; }
#define debug(a) { cerr << #a << ": " ... | #include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
string S;
cin >> S;
if(S[0] != S.back())return 0 & puts("1");
for(unsigned long i{1}; i < N; ++i)if(S[0] != S[i - 1] && S[i] != S.back())return 0 & puts("2");
puts("-1");
return 0;
}
|
//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> ... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=8,M=100000,INF=(1<<30)-1;
int n,m,a[N+9];
struct thing{
int l,v;
thing(int L=0,int V=0){l=L;v=V;}
}b[M+9];
bool cmp(const thing &a,const thing &b){return a.v<b.v;}
void into(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i)
scanf(... |
#include<bits/stdc++.h>
#define N 200005
#define re register
#define ll long long
#define P 998244353
using namespace std;
int n,m,K,q,u;
inline void Rd(int &res){
re char c;res=0;bool f=0;
while(c=getchar(),c<48)(c=='-')&&(f=1);
do res=(res<<3)+(res<<1)+(c^48);
while(c=getchar(),c>47);
f&&(res=-res);
}
int f[25][... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climi... |
/*
* @Author: Luisvacson
* @LastEditors: Luisvacson
* @Descriptions: None
* @Date: 2021-05-01 20:05:46
* @LastEditTime: 2021-05-01 20:18:58
* @FilePath: \C++\Practice\B.cpp
*/
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1005
int n, d1, h1;
int d[MAXN], h[MAXN];
signed main() {
scanf("%d%d%d",... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <climits>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... |
#include<iostream>
#include<vector>
using namespace std;
const int N = 2e5;
int n;
int a[N],c[N];
int main(){
cin>>n;
string b;
cin>>b;
int minn = 1e9;
for(int i=1;i<=n+1;i++) cin>>a[i], minn=min(minn,a[i]);
b = " " + b;
int k = -1;
for(int i=10000;i>=1;i--){
int now = a[1] / i;
... | #include <bits/stdc++.h>
using namespace std;
#ifdef __DEBUG__
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr << " " << H; debug_out(T...);}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#d... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define fo(i,n) for(int i=0;i<n;i++)
#define fos(i,n) for(ll i=0,i<n;i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#de... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz=0,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long long,long long> >vct; vector<s... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N/i ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
const ll maxn =6e5+10;
const ll mod=1e9+7;
const ll base=1e18;
ll cnt[maxn];
ll f[maxn];
ll get_duong(ll a,ll b)
{
if (b<0) return 0;
ll kc=b/2;
... |
#include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vec... | /* in the name of Anton */
/*
Compete against Yourself.
Author - Aryan (@aryanc403)
Atcoder library - https://atcoder.github.io/ac-library/production/document_en/
*/
#ifdef ARYANC403
#include <header.h>
#else
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 2e5+5;
typedef pair <int,int> pii;
#define x first
#define y second
int csub[sz], dp[sz];
vector <int> g[sz];
void dfs(int u) {
csub[u] = dp[u] = 1;
vector <pii> od, ev;
for(int v : g[u]) {
dfs(v);
csub[u] += csub... | #include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
int N;
int X[200][3],Ans[200][4];
int G2[10000][10000];
vector<vector<int>>G(10001);
vector<vector<int>>X_vec;
int scoring(vector<vector<int>>&ans){
double ref=0;
for(int i=0;i<N;++i){
if(ans[i][0]<=X[i][0] && ... |
#include<bits/stdc++.h>
#define haiyaku ios::sync_with_stdio(false), cin.tie(NULL);
#define PB push_back
#define F first
#define S second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define int long long
//#define double long double
const int MINI = -2147483647;
const int MAXI = 2147483647;
const long long... | #include<bits/stdc++.h>
typedef long long ll;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define pb push_back
#define lsb(x) ((x) & (-x))
#define PI acos(-1)
#define line cout << endl;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define resetbit(n, i) ((n) & (~(1LL << (i))... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
void tc(){
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
for (int i=0; i<n; i++){
int a = 0, t = 0, c = 0, g = 0;
for (int j=i; j<n; j++){
if (s[j] == 'A') a++;
if (s[j] == '... | #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(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e9
typedef long long ll;
... |
/*
“The only way that we can live is if we grow.
The only way we can grow is if we change.
The only way we can change is if we learn.
The only way we can learn is if we are exposed.
And the only way that we are exposed is if we throw ourselves into the open.”
*************************************** *************... |
using namespace std;
#define visual
#ifdef visual
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <assert.h>
#include <functional>
#include <math.h>
#include <string>
#include <ctime>
#endif
#ifndef visual
#include <bits/stdc++.h>
... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
// Reused : hackerearth.com/submission/48716644/
const int N = 5e5+5;
int t, n, m;
int arr[N], bit[N] = {};
void update(int i, int val) {
for( ; i <= m; i += (i&-i) ) {
bit[i] += val;
}
}
int get(int i) {
int res = 0;
for( ... | #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<bits/stdc++.h>
// #include<iostream>
// #include<algorithm>
// #include<vector>
// #include<set>
// #include<queue>
// #include<map>
using namespace std;
#define ll long long
#define ld long double
#define For(n) for(ll i=0;i<n;i++)
#define Forr(a,b) for(ll i=a;i<b;i++)
#define sortt(x) sort(x.begin(),x.en... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define pdd pair<double,double>
#define pii pair<ll,ll>
#define fi first
#define sec second
#define MAXN 1000000000000000005
#define N 300005
#define lgn 20
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll MOD = 1e9 + 7;
// 繰り返し自乗法(x^nをmで割った余り) O(logn)
ll power(ll x, ll n, ll m) {
ll res = 1;
if (n > 0) {
res = power(x, n / 2, m);
if (n % 2 == 0) res = (res * res) % m;
else res = ((res * res % m) * x) % m;
}
return r... |
// “Alhamdulillah for Everything”
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
LL n;
LL F[91];
vector<int> seq;
vector<int> ans;
int main()
{
cin>>n;
F[1]=F[2]=1;
for(int i=3;i<=90;i++)
F[i]=F[i-1]+F[i-2];
for(int i=90;i>=1;i--)
if(n>=F[i]) n-=F[i],seq.pb(1);
else if(seq.size()) seq.pb(0);
reverse(... |
#include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#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;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+2;
int nums1[N];
int nums[N]; //进入i的最小值
bool vis[N];
int n,m,x,y;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>nums1[i];
nums[i] = 1e9;
}
vector<pair<int,int>> vp;
for(int i=0;i<m;i++){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #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 <chrono>
using namespace std;
using namespace chrono;
typedef long long int ll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define all(v) (v).begin(),(v).e... | #include <bits/stdc++.h>
#include <climits>
using namespace std;
template<class T>
using V = vector<T>;
template<class T>
using VV = V<V<T>>;
using ld = long double;
#define ll long long
using ull = unsigned ll;
using PLL = pair<ll, ll>;
using VLL = V<ll>;
using VB = V<bool>;
using VVB = VV<bool>;
using VVLL = VV<ll... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int x = 0, m = 1;
char ch = getchar();
while(!isdigit(ch)){
if(ch == '-') m = -1;
ch = getchar();
}
while(isdigit(ch)){
x = x * 10 + ch - 48;
ch = getchar();
}
return x * m;
}
inline void write(int x){
if(x < 0){
put... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a,b;
cin >> a;
for( int i = a.size()-1 ; i >= 0 ; i--){
if (a.at(i) == '6'){
a.at(i) = '9';
}
else if (a.at(i) == '9'){
a.at(i) = '6';
}
b += a.at(i);
}
cout << b << endl;
} |
#include<bits/stdc++.h>
// #define maxn 100010
// #define mod 998244353
using namespace std;
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
// int n;
// int A,B;
// int a[maxn]
// int ks... | #include<iostream>
#include<string>
#include<vector>
#include<set>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<queue>
#include<stack>
#include<utility>
#include<cstdlib>
#include<cstdio>
#include<map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
const ll INF = 1001001001001001;
const int inf = 1001001001;
using P = pair<ll, ll>;
int main() {
ll A, B;
cin >> A >> B;
ll C = B-A;
for (ll i = C; i >= 1; i--) {
ll D = B/i;
if (i*(D-1)>= A) {
... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... |
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#inclu... | #include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
/* * * * * * * * * * */
/* *
*
* I love Ylva Eriksson
*
* */
const ll mod = 1e9 + 7;
ll add(ll a, ll b) { return a + b > mod ? a + b - mod : a + b; }
ll mult(ll a... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvb = vector<vb>;
using pll = pair<ll,ll>;
int main(){
int n;
vll x(n),y(n);
ll s,d;
cin >> n >> s >> d;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
#define INF 1e9
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define all(x) (x).begin(),(x).end()
int main() {
ll N,S,D;
cin... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long A, B;
scanf("%lld %lld", &A, &B);
int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
vector <long long> dp(1 << 20, 0);
dp[0] = 1;
for(long long x = A; x <= B; x++){
int mask... | #pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define infL (1LL<<60)
#define inf (1<<30)
#define inf9 (1000000000)
#define MOD 1000... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.