code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#pragma GCC optimize("Ofast")
#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 ll long long int
#define fast ios_base::sync_with_stdio(false)
#define fast_input cin.tie(NULL)
#define fast_output cout.tie(... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) Fo... |
#include <bits/stdc++.h>
#define ll long long
#define md 1000000007
using namespace std;
void divde(string& s){
ll i,crr=0,val;
for(i=0;i<s.length();i++){
val = s[i]-'0';
val+=10*crr;
if(val%2) {s[i]=val/2+'0';crr=1;}
else {s[i]=val/2+'0'; crr=0;}
}
if(s[0]=='0'){
reverse(s.begin(),s.end());
s.pop_back();
revers... | #include<bits/stdc++.h>
#define int long long
using namespace std;
void solve(){
int n, m;
cin>>n>>m;
string s;
int count[2]{};
for(int i=0;i<n;i++){
cin>>s;
int one = 0;
for(auto x:s) one += (x-'0');
count[one%2]++;
}
cout<< count[0] * count[1] << "\n";
}
signed main(){
ios_base::sync_with_stdio(fal... |
#include<bits/stdc++.h>
#define ll long long
#define m 1000000007
using namespace std;
ll n,s,a,ans,f[3002],d[3002][3002];
int main(){
scanf("%lld",&n),d[1][0]=1;
for(int i=0;i<n;++i){
scanf("%lld",&a),s+=a;
for(int j=1;j<=n;++j){
f[j]=d[j][s%j];
d[j][s%j]=(d[j][s%j]+f[j-1])%m;
}
}
for(int i=1;i<=n;++i... | #include <bits/stdc++.h>
#define rep0(i,r) for (int i=0,i##end=r;i<i##end;++i)
#define rep(i,l,r) for (int i=l;i<=r;++i)
#define per(i,r,l) for (int i=r;i>=l;--i)
#define pr pair<int,int>
#define fi first
#define se second
#define ll long long
using namespace std;
const int N=5e3+3,P=998244353;
int a[N][N],pw[N],s1[N... |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
int count=0;
for(int i=1;i<n+1;i++){
for(int j=1;j<n/i+1;j++){
count=count+n/(i*j);
}
}
cout << count;
return 0;
} | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#define sz(x) (int)(x).size()
using namespace std;
const int mxN = int(2e5) + 5;
int64_t numFactors[mxN],pref[mxN];
int n;
void calculateNumFactors(int value) {
for(int i=1; i*i<=value; i++) {
if(value % i == 0)
numFactors[value] += (i == va... |
/*
Hey why peeping here -_'_-?
I believe on myself and I will achieve
this->author = Fuad Ashraful Mehmet, CSE ,University of Asia Pacific
Todo:
https://codeforces.com/problemset?tags=1500-2300
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define all(o) (o).begin(), (o).end()
#define... | #include<bits/stdc++.h>
using namespace std ;
const int maxn = 1e6 + 10 ;
typedef long long ll ;
int timstep , n ;
vector<int> g[maxn] ;
int in[maxn] , out[maxn] ;
vector<int> listt[maxn] ;
void dfs(int u , int dep){
in[u] = timstep++ ;
listt[dep].push_back(in[u]) ;
for(auto v : g[u])
dfs(v , dep + 1) ;
out[u] =... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, s, n) for (ll i = s; i < (ll)(n); i++)
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(M);
rep(i, 0, M) { cin >> A[i]; }
if (M == 0) {
cout << 1 << endl;
return 0;
}
sort(A.begin(), A.end(... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplac... |
#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++)
tuple<ll, ll,... | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define OUT(V) for(int i=0;i<(int)V.size();++i){cout<<V[i]<<" ";}cout<<endl;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
... |
#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;
//type define....
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int u_int;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using P = pair<long long, long long>;
const long long INF = 1000000000000000000;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<vector<int>> data(200000, vector<int... |
#include <iostream>
using namespace std;
int main(){
int x;
cin >> x;
cout << max(0,x) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin>>x;
if(x>=0){
cout<<x<<endl;
}else {
cout<<"0"<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if(C == 0)
{
if(A > B) cout << "Takahashi" << endl;
else cout << "Aoki" << endl;
}
else
{
if(B > A) cout << "Aoki" << endl;
else cout << "Takahashi" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX32 = 2147483647;
const long long MAX64 = 9223372036854775807;
const double PI = 3.14159265358979323846;
int main() {
int n, x;
string s;
cin >> n >> x >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'o') {
x++;
... |
#include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define gcd(a,b) __gcd(a,b)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) (in... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<tuple>
#include<cstring>
#define REP(i,n) for(int i=0;i<(int)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#defin... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LL long long
#define int long long
#define ull unsigned long long
#define fi first
#define s... | #include<bits/stdc++.h>
using namespace std;
#define N 2005
#define mod 998244353
#define LL long long
int n, a_min, i, a[N], j, ans;
vector<int> vec;
unordered_set<int> Ans;
map<int,int> A, ext;
int main (void)
{
scanf("%d",&n);
a_min=-1;
for (i=1; i<=n; i++) {
scanf("%d",&a[i]);
if (a_min==-1) a_min=a[i];
... |
#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <iomanip>
#include <numeric>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
unordered_map<int, int> um;... | //#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... |
#include<bits/stdc++.h>
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb(a) push_back(a);
#define ll long long int
using namespace std;
int main()
{
sync
string s;
cin >> s;
int i;
reverse(s.begin(), s.end());
for(i=0; i<s.size(); i++){
if(s[i]=='6'){
s[i]='9';
}
... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_... |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #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 key>
using ordered_set = tree<key, null_type, less<key>, rb_tree_tag, tree_order_statistics_node_update>;
#define F first
#define S second
#define T sec... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
const int N = 2e3 + 5;
struct interval { int l, r, t; } a[N];
int n, ans;
bool check (int x, int y) {
if(a[x].r > a[y].r) swap(x, y);
if(a[x].r > a[y].l) return true;
if(a[x].r < a[y].l) return false;
if(a[x].t == 2 || ... | #include <bits/stdc++.h>
#define MAX (ll)(2e5 + 7)
#define INF (ll)(1e18 + 7)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
using cd = complex<double>;
using ul = unsigned long;
void f_io () {
ios_base :: sync_with_stdio (false);
cin.tie (nullptr);
}
ll f[MAX], t[MAX];
void up (ll ind, ll... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
if(floor(n*1.08)<206)cout<<"Yay!"<<endl;
else if(floor(n*1.08)==206)cout<<"so-so"<<endl;
else cout<<":("<<endl;
} | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define endl '\n'
using namespace std;
int Power(int Num,int Index){
int r=1 ;
for(int i=Index;i>0;i/=2,Num*=Num){
if(i%2==1){
r*=Num ;
}
}
return r ;
}
int Factorial(int Number){
int m=1;
f... |
#include <bits/extc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(int i=0;i<int(n);i++)
#define FOR(i,a,b) for(int i=a;i<=int(b);i++)
#define ALL(x) x.begin(),x.end()
vector<vector<tuple<int, ll, ll, ll>>> gr;
vector<ll> ans;
signed main() {
int n, m;
ll inf = 1000100010001000;
cin >> n >>... | #include <bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define ll long long
using namespace std;
#define MOD 1000000007
#define INF 100000000000000000
ll calc(ll currTime, ll waitTime, ll edgeCost) {
return waitTime + edgeCost / (currTime + waitTime + 1);
}
int main()... |
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long int
#define ll long long int
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define mem memset
#define ff first
#define ss second
#define loop0(i,n) for(i=0;i<n;i++)
#define loop1(i,n) for(i=1;i<=n;i++)
ll dist(pair<ll,ll> p1,... | #include <bits/stdc++.h>
#define rei register int
using namespace std;
const int N=2e5+100;
int a[N],num[N],ans[N];
int n,p;
bool used[N];
inline void change(int j){
used[j]=true;
ans[++p]=j;
num[a[j]]=j+1;
num[a[j+1]]=j;
swap(a[j],a[j+1]);
}
int main(){
cin>>n;
for(rei i=1;i<=n;++i){
cin>>a[i];
num[a[i]]... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... | //@Author: KeinYukiyoshi
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll dp[100009][2];
vector<ll>vec;
ll M;
ll n;
ll call(ll pos,ll pev)
{
if(pos==0)
{
return 1;
}
if(dp[pos][pev]!=-1)
{
return dp[pos][pev];
}
ll x,y;
if(pev==0)
{
x=call(pos-1,0);
y=c... | /*
* Author - Abhas Jain
* Code is inside the solve function
*/
#include <bits/stdc++.h>
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define endl '\n'
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rang(chrono::high_resolution_clock::now()... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> time(N);
vector<int> price(N);
vector<int> zaiko(N);
for(int i=0;i<N;i++){
cin >> time.at(i);
cin >> price.at(i);
cin >> zaiko.at(i);
}
bool b = false;
int min=1000000001;
for(int i=0;i<N;i++){
if(... | #include <bits/stdc++.h>
using namespace std;
template<typename T, typename Y> inline void mint(T & x,Y y) {if(y < x) x = y;}
template<typename T, typename Y> inline void maxt(T & x,Y y) {if(y > x) x = y;}
#define si(x) static_cast<int>(x.size())
typedef int64_t ll;
constexpr int mod = (int) 1'000'000'007;
constexpr ... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#def... | #include "bits/stdc++.h"
#define MOD 1000000007
#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 <bits/stdc++.h>
using namespace std;
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define MOD 1000000007
#define INF 1000000000
#define ... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i=0; i<N; i++) cin >> A[i];
vector<vector<long long> > mintable(N, vector<long long>(N, 100001));
for (int left=0; left<N; left++) {
for (int r... | #include <bits/stdc++.h>
#define psk push_back
#define ppk pop_back
#define mkp make_pair
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
typedef unsigned int u32;
typedef unsigned short u16;
typedef pair<int,int> PII;
typedef pair<LL,int> PLI;
typedef pair<int,LL> PIL;
typedef pair<LL,LL... |
#include<bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
string s;
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]=='.'){
break;
}else{
cout<<s[i];
}
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string x;
cin >> x;
int a = x.size();
rep(i, a){
if(x.at(i) == '.'){
x.erase(i);
break;
}
}
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long
using namespace std;
const int nax = 4e5 + 11;
int a[nax];
int n;
bool c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ld long double
#define ff first
#... |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
int MOD = 1000000007;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << 7 * 3 - (a + b + c) << endl;
return 0;
}... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
vector<int>vc(3);
cin>>vc[0];
cin>>vc[1];
cin>>vc[2];
sort(vc.begin(),vc.end());
if(vc[2]-vc[1]==vc[1]-vc[0])
{
cout<<"Yes";
}
else
cout<<"No";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#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 pai arccos(-1);
#define keta(n) cout << fixed << setprecision((n));
using ll = long long;
#include <iostream>
#include <algorithm>
#include <cmath>
#inclu... | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("unroll-loops")
#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;
/************************************************... |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ull unsigned long long
#define oss ostringstream
#define db double
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repn(i,a,b) for(ll i=a;i>=b;i--)
#define F first
#define S... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ll test_case=1; //cin>>test_case;
while... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <iterator>
#include <cmath>
#include <set>
#include <deque>
#include <string>
using namespace std;
struct Request {
int s;
int t;
int p;
};
struct Point {
int time;
long long cost;
int upOrDow... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
struct Row
{
long start;
long end;
long p;
bool operator<(const Row& rhs) const
{
return end < rhs.end;
}
};
std::string solve(long n, long w, std::vector<Row>& rows)
{
st... |
//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <dequ... | #include <bits/stdc++.h>
#pragma region my_template
struct Rep {
struct I {
int i;
void operator++() { ++i; }
int operator*() const { return i; }
bool operator!=(I o) const { return i < *o; }
};
const int l_, r_;
Rep(int l, int r) : l_(l), r_(r) {}
Rep(int n) : Rep(0, n) {}
I begin() const... |
/*/
Author: Chaitanya_1999
"Everything in this world is magic, except to the magician"
/*/
#include<bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdi... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<": "<<(x)<<endl
using namespace std;
using llong = long long;
using vi = vector<int>;
using vvi = vector<vi >;
using vvvi = vector<vvi >;
using pii = pair<int,int>;
constexpr i... |
#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 <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
inline void debug_print() { cerr << endl; }
template <typename T1, typename... T2> void debug_print(const T1 a, const T2 &... b) { cerr << a << ' '; debug_print(b...); }
#define debug(...) cerr << __LINE__ << ": [" << #__VA_ARGS__ << "] = " , deb... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
inline int read () {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') t = -1, c = getchar();
while (c >= '0' && c <= '9') ret = ret * 1... |
// in case of multiple test cases and N=1e5 don't intialize arrays as global except for graph vector-array
// always check whether or not you are doing mod of a negative number
// always use 1LL instead of 1
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using ... |
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
type... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector <string> s(n);
rep(i, n){
cin >> s[i];
}
ll a = 1, b = 0;
reverse(s.begin(), s.end());
rep(i, n){
if(s[i] == "AND")... | /*
Author : Chandan Agrawal
College : Poornima College of Engg. jaipur, Raj
Mail : chandanagrawal23@gmail.com
" when you are not practicing someone else is ,
and the day u meet them u will lose "
*/
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(... |
#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;
vector<string> c;
int main(){
int n;cin>>n;
cout<<((1<<n)-1)<<endl;
string s="AB";
... | //#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define eps 1e-8
//#define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std... |
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i,a,b) for(i=a;i<b;i++)
#define rfor(i,a,b) for(i=b-1;i>=a;i++) // reverse loop
#define yes "YES"
#define no "NO"
#define sorta(a) sort(a.begin(),a.end())
#define rsort(a) sort(a.rb... | /*
* Author: Moon_light
* Solution:
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int x, y; cin >> x >> y;
cout << (abs(x-y) < 3 ? "Yes" : "No");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<vi> vii;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define loop(n) for(int i=0; i<n; i++)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define file_read... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
int main(){
ll a, b, k; cin >> a >> b >> k;
l... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi acos(-1)
#define int long long
#define fastttt std::ios::sync_with_stdio(false);std::cin.tie(NULL);std::cout.tie(NULL);
#define endl "\n"
long long pow2(long long a,long long b,long long m){
long long ans=1;
while(b>0){
if(b&... |
#include <bits/stdc++.h>
#define N 200005
using namespace std;
using ll = long long;
struct point { ll x, y; };
struct matrix {
ll mat[3][3];
matrix operator*(matrix rhs) {
matrix res;
for (int i=0; i<3; i++) {
for (int j=0; j<3; j++) {
res.mat[i][j] = 0;
for (int k=0; k<3; k++) {
res.mat[i][j]... | #include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define tr(x, it) for(auto (it) = (x).begin();it != (x).end();it++)
#define fo(i, k, n) ... |
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | #include <bits/stdc++.h>
#define rep(begin, end) for (i=begin;i<end;i++)
#define repj(begin, end) for (j=begin;j<end;j++)
#define init(arr, end, val) for (i=0;i<end;i++) arr[i] = val;
#define printint(i0, i1) printf("%d %d\n", i0, i1)
using namespace std;
typedef long long int ll;
const int inf = 1000000000;
const int... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#includ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, int>;
ll n, m;
int MAX = 400010;
vector<ll> dp(MAX * 2, 0);
vector<vector<int>> G(MAX);
vector<int> seen(MAX, false);
void dfs(int v) {
seen[v] = true;
for (auto &nv : G[v]) ... |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int main() {
int h, w;
cin >> h >> w;
vector<string>s(h);
rep(i, h) {
cin >> s[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int h, w, count=0; cin >> h >> w;
vector<string> str;
for(int i=0;i<h;i++) {
string s; cin >> s;
str.push_back(s);
}
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) {
if(str[i][j] == '.' && str[i][... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long T, N, prev = 0;
cin >> T >> N;
vector<long long> nums;
for (int a = 1; a <= 100; a++)
{
int x = (100 + T) * a / 100;
if (x != prev + 1)
{
nums.push_back(x - 1);
}
prev = x;
}
int l = nums.size();
N--;
cout ... | #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>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MAX_HW = 2005;
const ll MOD = 1e9+7;
char c[MAX_HW][MAX_HW];
ll cntu[MAX_HW][MAX_HW],cntd[MAX_HW][MAX_HW],cntl[MAX_HW][MAX_HW],cntr[MAX_HW][MAX_HW];
ll mypow2[MAX_HW*MAX_HW]... | #include<iostream>
#define ll long long
//我把题目读成求周长段数的还有救嘛……
using namespace std;
bool s[11][11];
bool pd(ll i,ll j){
ll he=s[i][j]+s[i][j+1]+s[i+1][j]+s[i+1][j+1];
if(he==1 or he==3) return 1;
else return 0;
}
int main(){
ll h,w,i,j,sl=0;
char sr;
cin>>h>>w;
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
cin>>sr;
... |
// Atcoder.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<itera... | #include<bits/stdc++.h>
#define MAX 20
#define MOD 1000000007
using namespace std;
vector<int> v[MAX+10];
int c[MAX+10];
bool vis[MAX+10];
bool dfs(int x)
{
vis[x] = true;
bool ans = true;
for(int y:v[x])
{
if(c[y]==-1)
continue;
if(vis[y])
ans = ans&&(c[x]!=c[y]);
else
c[y] = 1-c[x], ans = ans&&dfs(... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct xy {
int x;
int y;
};
const int n = 50;
vector<vector<int>> t(n, vector<int>(n));
vector<vector<int>> p(n, vector<int>(n));
xy s;
clock_t start;
string ans = "";
int ma... |
#include <time.h>
#include <stdlib.h>
#include <cstdint>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <cstdint>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <vector>
#include <map>
#include ... |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <fstream>
#include <c... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_set>
#i... |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#define ull unsigned ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+1000;
int n;
int a[N];
ll sum[N],ans[N];
int mx[N] ;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++){
mx[i] = max(mx[i-1],a[i]);
sum[i]=sum[i-1]+a[i];
ans[i]=ans[i-1]+sum[i];
}
for(... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template <class T>
bool chmax(T& a, const T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T b) {
if (b < a) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
string complement(string s)
{
string t="";
for(int i=0;i<s.length();i++)
{
if(s.at(i)=='A')
t+='B';
else
t+='A';
}
return t;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.ti... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
typedef long double ld;
#define r... | #include <iostream>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include... |
/**
* author:
* created: 15.11.2020 20:57:58
**/
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const int INF = 1001001001;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1};
typedef vector<int> vi;
typedef vector<vi> v... | #include<bits/stdc++.h>
using namespace std;
#define il inline
#define ri register int
#define ll long long
#define ui unsigned int
il ll read(){
bool f=true;ll x=0;
register char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=false;ch=getchar();}
while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=g... |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <unordered_map>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
vector<int> g[2010];
vector<int> w[2010];
const int MX = 1e9;
int d[2010];
struct node {
int u;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
using ll = long long;
using P = pair<int,int>;
using edge = struct { int to; int cost; };
const int INF = 1e9;
int n,m;
vector<int> a,b,c;
vector<vector<edge>> g;
void solve(int s) {
vector<int> d(n+5, INF);
priority_queue<P, vect... |
#include "iostream"
using namespace std;
int main() {
int a, b, w;
cin >> a >> b >> w;
w *= 1000;
const int INF = 1001001001;
int l = INF, r = -INF;
for (int n = 1; n <= w; ++n) {
if (a*n <= w && w <= b*n) {
l = min(l, n);
r = max(r, n);
}
}
if (... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#de... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #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 pf push_front
#def... | #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m), b(m)... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ull> ull1d;
typedef vector<ull1d> ull2d;
typedef vector<ull2d> ull3d;
#define loop(i,n) for(ull i=0;i<n;i++)
#define rloop(i,n) for(ll i=n-1;i>=0;i--)
#define all(vec) vec.begin(),ve... | #include <bits/stdc++.h>
using namespace std;
int edge[10][10], mark[10];
int n, k, v = 1, ans = 0;
void dfs(int cur, int dst) {
if(dst > k) return;
if(v == n) {
if(dst + edge[0][cur] == k) ans ++;
return;
}
else {
for(int i = 0; i <= n; i++) {
if(mark[i] == 0) {... |
#include "bits/stdc++.h"
#define MOD 1000000007
#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 <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int main(){
stri... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,sum=0,res=0;
cin>>n;
long long a[n];
long long mod= 998244353;
for(long long i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n,greater<long long>());
for(long long i=0;i<n;i++)
{
res+=(a[i]*a[i]);
res+=(a... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int ans = INT_MAX;
for (int i = 0; i < (1<<(n-1)); i++)
{
int in, out;
in = out = 0;
for (int j = 0; j < n; j++... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_w... | #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll un... |
#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 a[100001],b[100001],n,i,j,k,l;
ll ans;
int main()
{
#ifdef file
freopen("b.in","r",stdin);
#endif
scanf("%d",&n);
fo(i,1,n) scanf("%d",&a[i]);
fo(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i <= n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main(){
int N;
cin >> N;... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#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 ALL(vec) (vec).begin(),(vec).end()
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_IN... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define VEC(TYP... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> all... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
ll a[210000];
int... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N;
std::cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++){
std::cin >> A[i];
}
int ans = 0, ans_temp = 0;
int min_a = 0;
for(int i = 0; i < N; i++){
min_a = A[i];
... |
#include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; (i) < (int64_t)(n); ++(i))
#define REP3(i, m, n) for (int64_t i = (m); (i) < (int64_t)(n); ++(i))
#define REP_R(i, n) for (int64_t i = (int64_t)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int64_t i = (int64_t)(n)-1; (i) >= (int64_t)(m); --(i))
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<array<int, 2>>> A(N + 1);
for (int i = 0; i < M; i++) {
int X, Y, Z;
cin >> X >> Y >> Z;
A[X].push_back({Y, Z});
}
vector<int64... |
/*if ((double) ((double)(clock() - cl)/(double)CLOCKS_PER_SEC)>1.85) {break;}*/
//#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define double long double
#define ft first
#define sc second
#define pb push_back
#define booost ios_base::sync_with_s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
ll solve(ll n, ll a, ll b)
{
// for 1d
ll nooverlap;
if (n - a - b < 0)
nooverlap = 0;
else
nooverlap = ((n - a - b + 2)... |
#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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define p 998244353
int MOD(int a){
return (a %= p) >= 0 ? a : a + p;
}
int power(int a, int N){
if(N == 0) return 1;
else if(N % 2 == 0) return power(MOD(a * a), N / 2);
else return MOD(a * power(a, N - 1));
}
int inverse(int a){
return power(... |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | #include <bits/stdc++.h>
#define all(V) V.begin(),V.end()
#define pi 3.1415926535897932384626
#define fi fixed<<setprecision(13)
#define MOD 1000000007
#define ll long long
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define Rep(i, n) for (ll i = 1; i <=(ll)(n); i++)
#define reps(i,k,n) for (ll i = (ll)k; i < ... |
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N;
cin >> N;
std::unordered_map<int, int> mx;
std::uno... | #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;
#define pb push_back
#define visit asdf
const int N=4e5+5;
const int M=4e5+5;
int n,m,ans;
int a[N],b[N];
int indeg[M];
vector<int> v[M];
bool visit[N];
queue<int> q;
int match(int x)
{
for(int i=0;i<v[x].size();i++)
if(!visit[v[x][i]]) return v[x][i];
return 4e5+1;
}
... | #include <bits/stdc++.h>
//#include <atcoder/all>
#ifndef LOCAL
#pragma GCC target("arch=skylake-avx512")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static ... |
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define all(n) (n).begin(), (n).end()
#define se second
#define fi first
#define pb emplace_back
#define mp make_pair
#define sqr(n) ((n)*(n))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define precision(a)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll maxn=5e5+20;
const ll mod=1e9+7;
const ll m2=1e9+7;
const ll INF64 = ll(1e18);
const ll max2=10500000;
int r,c,a,b;
map<vector<int>,int> m1;
int dp[(1<<16)][20][20],dp2[(1<<16)][20][20];
void num(int one,int two,int pr... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll powermd(ll x, int y, ll p)
{
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
// if (x == 0) return 0; // In case x is divisible by p;
while (y > 0)
{
... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int N, K;
int dp[3005][3005];
const int mod = 998244353;
int f(int n, int k) {
if(n < k) return 0;
if(k == 0) return (n == 0);
if(~dp[n][k]) return dp[n][k];
int ret = 0;
ret += f(n - 1, k - 1);
ret %= mod;
ret += f(n, 2 * k);
ret %= mod;
retu... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,seki,goukei;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A.at(i);
}
vector<int> B(n);
for (int i = 0; i < n; i++) {
cin >> B.at(i);
}
goukei = 0;
for (int i = 0; i < n; i++) {
seki = A.at(i... | /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ; Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//#def... |
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define LOG(...) cerr << "[" << #__VA_ARGS__ << "]: " << repr(__VA_ARGS__) << endl;
#define MSG(args) cerr << args << "\n";
#define debug(x) x
#else
#define LOG(...)
#define MSG(args)
#define debug(x)
#endif
#define mp make_pair
#define pb push_back
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template<class T> inline bool ch... |
using namespace std;
#include <cstdio>
#include <cstring>
#include <algorithm>
#define INF 1000000000
#define N 1010
int n,m=7;
char t[N]="atcoder";
char s[N];
int main(){
// freopen("in.txt","r",stdin);
int Q;
scanf("%d",&Q);
while (Q--){
scanf("%s",s);
n=strlen(s);
int c=0,ans=INF;
bool BZ=1;
for (int i=... | #ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include... |
/*** keep hungry and calm CoolGuang! ***/
//#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define all(s) s.begin(),s.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <long long, long long> pll;
ll mod = 998244353;
ll dp[200001][18];
void countWays(ll n, ll m)
{
for (int i = 0; i <= n; i++) {
dp[1][i] = 1;
}
ll sum;
for (int i = 2; i <= m; i++) {
for (int j = 0; j... |
//kyoprosaikoooooooooooo!!
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
//素数判定 O(√N)
ll prime (ll abc) {
if (abc < 2) {
return 0;
}
else if (abc == 2) {
return 1;
}
else if (abc % 2 == 0) {
return 0;
}
double sqrtabc = sqrt(abc);
for (int i = 3; i... | #include <bits/stdc++.h>
using ll =long long;
using namespace std;
using Graph =vector<vector<ll> >;
int main(){
int X,Y,Z;
cin>>X>>Y>>Z;
int ans=0;
for(int p=0;p<10000000;p++){
if(p*X>=Y*Z){
ans=p;
break;
}
}
ans--;
cout<<ans<... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#inc... | #include<bits/stdc++.h>
#define MAXN 400005
typedef long long ll;
using namespace std;
int n;
ll a[MAXN] , ans , mod = 1e9 + 7;
ll f[MAXN][2];
ll val[MAXN];
int main(){
cin>>n;for(int i = 1 ; i <= n ; i++)cin>>a[i];
f[0][1] = 1;
f[1][0] = f[1][1] = 1;
for(int i = 2 ; i <= n ; i++){
f[i][0] = (f[i - 1][1]) % mod... |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
void read(int &x){
static char c;
while(!isdigit(c=getchar())); x=c^48;
while(isdigit(c=getchar()))x=(x*10)+(c^48);
}
void read(ll &x){
static char ... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using Graph = vector<vector<int>>;
using vst= vector<string>;
using vin= vector<int>;
using ll=long long;
using ull=unsigned long long;
using vll= vector<ll>;
using P=pair<int ,... |
#include <bits/stdc++.h>
#define MAX 10000
using namespace std;
typedef long long ll;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef double ld;
const int N=1e5+5;
ll a[N];
list<ll>diff;
/*
void prints(vector<pair<ll,ll>>v,ll n){
cout<<"after sorting the elements"<<endl;
for(int i=0;i<... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long N; cin >> N;
vector<long long> X(N), C(N);
for (int i = 0; i < N; i++) cin >> X[i] >> C[i];
... |
#include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii... | #include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <numeric>
#include <ut... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int a,b,c,d;
cin >> a >>b;
cin >> c >> d;
cout << b-c;
} | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
using namespace std;
s... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long double x, y, r;
cin >> x >> y >> r;
r = nextafter(r, 1001001001001001001LL);
long long answer = 0LL;
for (long long i = ceil(x - r); i <= floor(x + r); i++) {
long double a = r * r - (i - x) * (i - ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... |
#include <bits/stdc++.h>
#define rep(i,s,n) for(int i=s;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegain(),(x).rend()
const int INF=1e9;
using namespace std;
using ll = long long;
typedef pair<int,int> P;
int main(){
string s;
cin>>s;
int n=s.size();
reverse(all(s));
rep(i,... | #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>
using namespace std;
const int N=2e5+100;
#define ll long long
int K; ll f[N],ans;
int main() {
cin>>K;
for(int i=1;i<=K;++i)
for(int j=i;j<=K;j+=i)
++f[j];
for(int i=1;i<=K;++i) f[i] += f[i-1];
for(int i=1;i<=K;++i) ans += f[K/i];
cout<<ans<<endl; return 0;
} | /*************************************************************************
> File Name: solve.cpp
> Author: liupo
> Mail: lanzongwei@gmail.com
> Created Time: 2021-02-21 20:21:34
************************************************************************/
#define GOODOJ
#define SYNC 0
#ifdef GOODOJ
#include <bi... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin(... | #include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <set>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <climits>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <memory>
#include <functional... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <cmath>
#include <algorithm>
#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()
typedef long long ll;
using P = pair<int,int>... | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
struct UF {
int n;
vector<int> par;
vector<int> rank;
UF(int n) : n(n) {
for (int i = 0; i < n; ++i) {
par.resize(n);
rank.resize(n);
par.at(i) = i;
rank.at(i) = 0;
}
}
int find(int x) {
... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define FOR(i,n) for(int i=0;i<n;i++)
typedef long long ll;
const int MAXN = 2e5;
int x[MAXN], y[MAXN];
int main() {
// freopen("in", "r", stdin);
// freopen("out", "w", stdout);
... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <un... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<ll> vec;
#define MAX 1000000007
int main() {
ll a,b,c,d;
cin>>a>>b>>c>>d;
if(a==b+c+d || b==c+d+a || c==b+a+d || d==b+c+a || a+b==c+d || a+c==b+d || a+d==b+c ){
cout<<"Yes"<<"\n";
}
else{
cout<<"No"<<"\n";
}
... | #include<cstdio>
#define max(a,b) (((a)>(b))?(a):(b))
using namespace std;
int a,b,c;
int main() {
scanf("%d%d%d",&a,&b,&c);
printf("%d",max(c+max(a,b),a+b));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int tt=1;
//cin>>tt;
while(tt--)
{
int r,c,count=0;
cin>>r>>c;
char a[r][c];
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
cin>>a[i][j];
}
}
for(int i=0;i<r-1;i++)
{
for(int j=0;j<c;j++)
{
if(j==c-1)
{
if(a... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
using namespace std;
//#define MODE 1
#ifdef MODE
#d... |
#include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... | /*Arnab's Code
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vii vector<int>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define take(a,n) for(ll i=0;i<n;i++)cin>>a[i]
#define takes(a,n,st) for(ll i=st;i<n+st... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 998244353;
typedef long lon... | #include<set>
#include<queue>
#include<cmath>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAXN 505
#define ENDL putchar('\n')
#define LL long long
#define DB double
#define lowbit(x) ((-x) & (x))
LL read() {
LL f = 1,x = 0;char s = getchar();
... |
/*
Problem Name:
algorithm tag:
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
int N;
ll W;
cin >> N >>... |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200000;
int n, m;
vector<int> adj[MAX_N];
long long int a[MAX_N], b[MAX_N];
bool vis[MAX_N];
long long dfs(int u) {
long long ans = a[u] - b[u];
vis[u] = true;
for (int v : adj[u]) {
if (vis[v])
continue;
ans +=... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int N, M, A[500], B[500];
vector<int> Adj[25];
int used[25];
int loop;
int cnt;
long long int num;
int color[25];
vector<int> child[25];
vector<int> V;
void visit(int k) {
used[k] = 1; V.push_... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long ksm(long long x,long long y)//快速幂
{
if(x==0) return 0;
long long ret=1;
for(;y;y>>=1)
{
if(y&1) ret=(ret*x);
x=(x*x);
}
return (ret);//最后%一下
}
int main()
{
ll n;
scanf("%lld",&n);
for(int i=1;i<=40... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) for(int i = a; i < b; i++)
#define all(a) a.begin(),a.end()
//#define endl '\n'
using ll = long long;
//using db = long double;
usin... |
#include <iostream>
#include <vector>
#include <set>
#include <cstdlib>
#include <algorithm>
#define MAXA 1000000
#define ll long long
using namespace std;
vector<int> divs[MAXA+2];
int smallest_prime[MAXA+2];
bool isprime[MAXA+2];
int counts[MAXA+2];
int moebius[MAXA+2];
int g(int N,int x) {
int ans2=0;
for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
//mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,T y){if(x<y)x=y;}
template<typename T>v... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
#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).rbegin(), (X).rend()
#define sz(X) (int)X.size()
#define setbits(X) __builtin_popcountll(X)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll DIM = 200007, maxN = 200000, INF = 10000000000007, mod = 1000000007;
ll t, n, k, a[DIM], b[207];
string s;
vector<ll> simple_numbers;
bool flag;
void solve() {
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
if (n % 200 == 0) n /= 200;
... |
#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>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
map<ll, ll> factorize(ll num) {
m... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.