code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
/* BISMILLAHIR-RAHMANIR-RAHIM
____________________________________
| |
| SHANTO_SUST_SWE-19__029 |
| shanto-swe029.github.io |
|____________________________________|
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define Pi acos(-1.0)
#define r0 return 0
#define endl "\n"
#define show(x) cout << x << endl
#define take(x) cin >> x
#define debug 1
int main()
{
int n;
std::cin >> n;
std::vector < pair < int, int > > v;
std::pair < int, int > p;
for( int i = 0; i < n; i++ ) {
int x, y;
std::cin >> x >> y;
p.first = x;
p.second = y;
v.push_back(p);
}
bool gotcha = false;
for( int i = 0; i < n; i++ ) {
for( int j = i + 1; j < n; j++ ) {
for( int k = j + 1; k < n; k++ ) {
int det = v[i].first * v[j].second + v[j].first * v[k].second + v[k].first * v[i].second;
det -= v[i].second * v[j].first + v[j].second * v[k].first + v[k].second * v[i].first;
if( det == 0 ) {
gotcha = true;
break;
}
}
if( gotcha ) break;
}
if( gotcha ) break;
}
if( gotcha ) std::cout << "Yes";
else std::cout << "No";
r0;
}
//ALHAMDULILLAH
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
rep(i, n) {
cin >> x[i] >> y[i];
}
bool ok = false;
for (int i = 0; i < n-2; i++) {
for (int j = i+1; j < n-1; j++) {
for (int k = j+1; k < n; k++) {
if ((y[i]-y[j]) * (x[i]-x[k]) == (y[i]-y[k]) * (x[i]-x[j])) ok = true;
}
}
}
if (ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector <int> vi;
typedef vector <vi> vii;
typedef vector <string> vs;
typedef vector <ll> vll;
#define LSB(x) x&(-x)
#define endl "\n"
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define f(a,b,c) for(ll (a)=(b);(a)<(c);++(a))
#define fi(a,b,c) for(ll (a)= (b);(a)<=(c);++(a))
#define fe(a,b) for(auto &(a) : (b))
#define fr(i,a,b) for(ll (i)=(a);(i)>(b);(i)--)
#define r(a,b) f(a,0,b)
#define v vector
#define SUM(x,s) for(ll i=0;i<(x).size();i++)(s)+=(x)[i];
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define ALL(x) x.begin(),x.end()
#define SORT(x) sort(ALL(x))
#define TC(t) while(t--)
#define unS unordered_set
#define unM unordered_map
#define oS set
#define oM map
#define eb emplace_back
#define pq priority_queue
#define print(x) cout<<(x)<<endl
///////////////////// I/O shortcuts ////////////////////////////////
template <typename D>
istream& operator>> (istream &in , vector <D> &arr) {
ll n = arr.size();
r(i, n) {
in >> arr[i];
}
return in;
}
template <typename D>
ostream& operator<< (ostream &in , vector <D> &arr) {
for (auto x : arr) in << x << " ";
in << endl;
return in;
}
template <typename D, typename B>
ostream& operator<< (ostream &in , pair <D, B> &p) {
in << p.F << " " << p.S << endl;
in << endl;
return in;
}
////////////////////////////Global Variables////////////////////////////////
ll i, j, k, l, x, y, z, m, n, a, b, c, r, d, t = 1;
string s;
template<typename A, typename B> A max(A a, B b) {return (a > b) ? a : b;}
template<typename A, typename B> A min(A a, B b) {return (a < b) ? a : b;}
/////////// The Code Starts Here ///////////////////////////////////////
void solve(int tc) {
cin >> n;
ll ans = 0;
f(i, 1, n) {
ll s = n - i;
if (s > 0) ans++;
else break;
}
cout << ans << endl;
}
///////////////////////////////////////////////////////////
int main() {
quick;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// cin >> t;
int k = 1;
TC(t) solve(k++);
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long LL;
int n;
int main() {
cin >> n;
double res = 0;
for (int i = 1; i <= n-1; i++) {
res += 1.0 * n / i;
}
printf("%.10lf\n", res);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using P = pair<int,int>;
int n,m;
signed main(){
cin >> n >> m ;
map<int,int> cnt;
vector<P> p(m);
for(int i=0;i<m;i++){
cin >> p[i].first;
cin >> p[i].second;
cnt[p[i].first]++;
}
sort(p.begin(),p.end());
//for(int i=0;i<m;i++){
// cout << "i=" << i << ":" << p[i].first << "," << p[i].second << endl;
//}
vector<int> d(2*m+1,0);
d[m] = 1;
int j = 0;
map<int,int> manip;
for(auto it = cnt.begin(); it != cnt.end(); it++){
int v = it->first;
// cout << "it->first=" << it->first << endl;
// int c = it->second;
manip.clear();
int j2 = j;
while( p[j].first == v ){
int y = p[j].second; // n座標系
int y2 = ( y - n ) + m; // m座標系
if( y2 >= 0 && y2 <= 2*m ){
manip[y2] = 0;
}
j++;
}
j = j2;
while( p[j].first == v ){
int y = p[j].second; //
int y2 = ( y - n ) + m; // m
if( y2 >= 0 && y2 <= 2*m && y2-1 >= 0 && y-1>=0 && d[y2-1]==1 ){
manip[y2]=1;
}
if( y2 >= 0 && y2 <= 2*m && y2+1 <=2*m && y+1<=2*n && d[y2+1]==1 ){
manip[y2]=1;
}
j++;
}
for(auto x: manip){
d[x.first] = x.second;
}
//for(int j=0;j<2*m+1;j++){
// cout << "," << d[j];
//}
//cout << endl;
}
int res = 0;
for(int i=0;i<=2*m;i++){
if(d[i]!=0) res++;
}
cout << res << endl;
}
| #pragma GCC optimize("fast-math")
// begin "cp-lib/boilerplate.hpp"
#include <bits/stdc++.h>
#define _choose(_1, _2, _3, chosen, ...) chosen
#define _rep(i, l, r) for (int i = l; i < r; ++i)
#define _rep0(i, r) _rep(i, 0, r)
#define _repr(i, r, l) for (int i = r; i >= l; --i)
#define _repr0(i, r) _repr(i, r, 0)
#define rep(...) _choose(__VA_ARGS__, _rep, _rep0, suppress_warning)(__VA_ARGS__)
#define repr(...) _choose(__VA_ARGS__, _repr, _repr0, suppress_warning)(__VA_ARGS__)
#define all(a) ::begin(a),::end(a)
#define sz(c) int(::size(c))
#define trav(a, b) for(auto& a : b)
using namespace std;
using ll = long long;
using ld = long double;
using u64 = uint64_t;
using u32 = uint32_t;
[[maybe_unused]] static constexpr int INF = int(1e9 + 5);
[[maybe_unused]] static constexpr ll INFL = ll(INF) * INF;
[[maybe_unused]] static mt19937 rng(u32(chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count()));
namespace cp_lib {}
// end "cp-lib/boilerplate.hpp"
using namespace cp_lib;
int main() {
cin.tie(0)->sync_with_stdio(false);
map<int, int> m;
int n; cin >> n;
rep(_, n) {
int ai; cin >> ai;
m[ai]++;
}
ll ans = 0;
for (auto& [a1, c1] : m) {
for (auto& [a2, c2] : m) {
if (a1 <= a2)
continue;
ans += ll(c1) * c2 * (a2 - a1) * (a2 - a1);
}
}
cout << ans << '\n';
}
|
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <utility>
#include <algorithm>
using namespace std;
using ll = long long;
bool localTest = false;
long long readLongLong()
{
long long t;
cin >> t;
return t;
}
std::vector<ll> readVector(long long size)
{
std::vector<ll> v(size);
for (long long i = 0; i < size; i++)
{
cin >> v[i];
}
return v;
}
class CodeForcesPrint
{
public:
CodeForcesPrint operator<<(string x)
{
CodeForcesPrint tmp;
std::cout << x << std::endl;
return tmp;
}
CodeForcesPrint operator<<(long long x)
{
CodeForcesPrint tmp;
std::cout << x << std::endl;
return tmp;
}
CodeForcesPrint operator<<(std::vector<std::vector<long long>> finalAnswer)
{
CodeForcesPrint tmp;
if (localTest)
{
cout << "--final answer--" << endl;
}
for (long long i = 0; i < finalAnswer.size(); i++)
{
for (long long k = 0; k < finalAnswer.at(i).size(); k++)
{
cout << finalAnswer.at(i).at(k) << " ";
}
cout << endl;
}
return tmp;
}
CodeForcesPrint operator<<(std::vector<string> finalAnswer)
{
CodeForcesPrint tmp;
if (localTest)
{
cout << "--final answer--" << endl;
}
for (long long i = 0; i < finalAnswer.size(); i++)
{
cout << finalAnswer[i] << endl;
}
return tmp;
}
CodeForcesPrint operator<<(std::vector<long long> v)
{
CodeForcesPrint tmp;
for (long long i = 0; i < v.size(); i++)
{
cout << v[i] << " ";
}
cout << endl;
return tmp;
}
};
long long readTestcaseSize()
{
ll t;
cin >> t;
return t;
}
#define inTest \
ll t = readTestcaseSize(); \
for (ll testcase = 0; testcase < t; testcase++)
class OddNumber
{
};
class EvenNumber
{
};
bool operator==(OddNumber oddNumber, long long n)
{
return n % 2 == 1;
}
bool operator==(EvenNumber evenNumber, long long n)
{
return n % 2 == 0;
}
bool operator==(long long n, OddNumber oddNumber)
{
return oddNumber == n;
}
bool operator==(long long n, EvenNumber evenNumber)
{
return evenNumber == n;
}
template <class T, class U>
std::vector<U> permutation(std::vector<T> vec, std::vector<T> before_list, std::vector<U> after_list)
{
std::vector<U> res(vec.size());
for (ll i = 0; i < vec.size(); i++)
{
for (ll k = 0; k < before_list.size(); k++)
{
if (vec[i] == before_list[k])
{
res[i] = after_list[k];
}
}
}
return res;
}
template <class T, class U>
vector<U> permutationRead(long long size, std::vector<T> before_list, std::vector<U> after_list)
{
vector<T> t(size);
for (ll i = 0; i < size; i++)
{
cin >> t[i];
}
return permutation<T, U>(t, before_list, after_list);
}
#define ll(name) long long name = readLongLong()
#define llV(name, size) std::vector<long long> name = readVector(size)
OddNumber Odd;
EvenNumber Even;
CodeForcesPrint print;
//________________________________________________________________________________
#define INF (1ll) << 60
#define rep(i, n) for (long long i = 0; i < n; i++)
#define yes print<<"Yes"
#define no print<<"No"
#define all(v) v.begin(),v.end()
#define ld long double
int main()
{
ll A,B,C;cin>>A>>B>>C;
if(A*A+B*B<C*C){
yes;
}else{
no;
}
} | #include <iostream>
#include <vector>
#include <cmath>
#include <unordered_set>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
vector<vector<char>> mat;
cin >> n >> m;
mat.resize(n + 1, vector<char>(m + 1));
for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> mat[i][j];
// vector<vector<vector<int>>> dp(n + 1, vector<vector<int>>(m + 1, vector<int>(2)));
const int inf = 1e9;
vector<vector<int>> dp(n + 1, vector<int>(m + 1, -inf));
for (int i = n - 1; i >= 0; i--) {
for (int j = m - 1; j >= 0; j--) {
if ((i == n - 1) && (j == m - 1)) dp[i][j] = 0;
else if (j == m - 1) dp[i][j] = ((mat[i + 1][j] == '+') ? 1 : -1) - dp[i + 1][j];
else if (i == n - 1) dp[i][j] = ((mat[i][j + 1] == '+') ? 1 : -1) - dp[i][j + 1];
else {
int v1 = ((mat[i + 1][j] == '+') ? 1 : -1) - dp[i + 1][j];
int v2 = ((mat[i][j + 1] == '+') ? 1 : -1) - dp[i][j + 1];
dp[i][j] = max(v1, v2);
}
}
}
if (dp[0][0] > 0) cout << "Takahashi" << endl;
else if (dp[0][0] < 0) cout << "Aoki" << endl;
else cout << "Draw" << endl;
return 0;
} |
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fr(i,a,n) for(i=a;i<n;i++)
#define frn(i,a,n) for(i=a;i<=n;i++)
#define vll vector<ll>
#define pll pair<ll,ll>
#define vp vector<pll>
#define ub upper_bound
#define lb lower_bound
#define mem(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin(),v.end()
#define qll queue<ll>
#define sll set<ll>
//(a/b)%mod = (a%mod*powermod(b,mod-2,mod))%mod
ll power(ll x,ll n)
{
if(n==0)
return 1;
else if(n%2 == 0) //n is even
return power(x*x,n/2);
else //n is odd
return x*power(x*x,(n-1)/2);
}
int highestPowerof2(int n)
{
int p = (int)log2(n);
return (int)pow(2, p);
}
ll powermod(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
vector<string>s(70);
ll n;
ll dp[70][70];
ll trav(ll i,bool x,bool prev){
if(i==n && prev) return 1;
if(i==n) return 0;
if(dp[i][prev]!=-1) return dp[i][prev];
if(s[i]=="AND"){
return dp[i][prev]=trav(i+1,true,prev&true)+trav(i+1,false,prev&false);
}
else{
return dp[i][prev]=trav(i+1,true,prev|true)+trav(i+1,false,prev|false);
}
}
int main(){
memset(dp,-1,sizeof(dp));
cin>>n;
for(ll i=0;i<n;i++) cin>>s[i];
ll sum=trav(0,true,true);
memset(dp,-1,sizeof(dp));
sum+=trav(0,false,false);
cout<<sum<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> str(n);
vector<pair<long long, long long>> tbl;
for (int i = 0; i < n; i++) {
cin >> str[i];
}
tbl.emplace_back(make_pair(1, 1));
for (int i = 0; i < n; i++) {
long long t_count, f_count;
if (str[i] == "AND") {
t_count = tbl[i].first;
f_count = tbl[i].first + tbl[i].second * 2;
} else {
t_count = tbl[i].first * 2 + tbl[i].second;
f_count = tbl[i].second;
}
tbl.emplace_back(make_pair(t_count, f_count));
}
cout << tbl.back().first << endl;
return 0;
} |
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef __int128 it;
typedef long double ldb;
int main(){
ll s,p;
scanf("%lld%lld",&s,&p);
it sqt=it(s)*s-it(p<<2);
// if(p*4<(s*2-1)){
// puts("No");
// return 0;
// }
ldb tmp=sqrt(ldb(s)*s-(p<<2));
for(it i=max(tmp-1000000,ldb(0)),ed=tmp+1000000; i<=ed; ++i)
if(i*i==sqt){
if((i+s)&1){
puts("No");
return 0;
}
puts("Yes");
return 0;
}
puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
/* * * * * * * * * * */
/* *
*
* Too many mind, no mind.
*
* */
int main(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int a, b; cin >> a >> b;
vector <ll> g, l;
for (int i = 1; i <= min(a, b); ++i) {
g.push_back(i);
l.push_back(-i);
}
if (a > b) {
for (int i = b + 1; i <= a; ++i) {
g.push_back(i);
l.back() -= i;
}
} else if (b > a) {
for (int i = a + 1; i <= b; ++i) {
l.push_back(-i);
g.back() += i;
}
}
for (auto &i : g) cout << i << ' ';
for (auto &i : l) cout << i << ' ';
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define bit(k) (1LL<<(k))
#define SUM(v) accumulate(all(v), 0LL)
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
struct fast_ios{ fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; }fast_ios_;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define TOSTRING(x) string(#x)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &x : vec) is >> x; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << "["; for(auto _: v) os << _ << ", "; os << "]"; return os; };
template <typename T> ostream &operator<<(ostream &os, set<T> &st) { os << "("; for(auto _: st) { os << _ << ", "; } os << ")";return os;}
template <typename T> ostream &operator<<(ostream &os, multiset<T> &st) { os << "("; for(auto _: st) { os << _ << ", "; } os << ")";return os;}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair< T, U >& p){os << "{" <<p.first << ", " << p.second << "}";return os; }
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &mp){ os << "["; for(auto _: mp){ os << _ << ", "; } os << "]"; return os; }
#define DUMPOUT cerr
void dump_func(){ DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) { DUMPOUT << ", "; } dump_func(std::move(tail)...); }
#ifdef DEBUG
#define dbg(...) { dump_func(__VA_ARGS__) }
#define dump(...) DUMPOUT << string(#__VA_ARGS__) << ": "; dump_func(__VA_ARGS__)
#else
#define dbg(...)
#define dump(...)
#endif
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const long double PI = acos(-1.0);
/*
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string dir = "DRUL";
*/
int A[3000][5];
int main() {
int N;
cin >> N;
rep(i,N){
rep(j,5){
cin >> A[i][j];
}
}
auto check = [&](ll x) -> bool{
vector<int> mask(N,0);
int sz = bit(5);
vector<int> mp(sz,0);
rep(i,N){
rep(j,5){
if(A[i][j] >= x)mask[i] += bit(j);
}
mp[mask[i]]++;
}
// dump(x, mp);
rep(k,sz){
if(mp[k] == 0)continue;
if((k) == sz-1 && mp[k] >= 3){
return true;
}
rep(j,k){
if(mp[j] == 0)continue;
if((k|j) == sz-1 && mp[k]+mp[j] >= 3){
return true;
}
rep(i,j){
if(mp[i] == 0)continue;
if((i|j|k) == sz-1 && mp[i]+mp[j]+mp[k] >= 3){
// dump(i,j,k);
// dump((i|j|k));
// dump(mp[i],mp[j],mp[k]);
return true;
}
}
}
}
return false;
};
ll ok = 0;
ll ng = INF+1;
while(ng - ok > 1){
ll mid = (ok + ng) / 2;
if(check(mid))ok = mid;
else ng = mid;
}
cout << ok << endl;
}
| #include <bits/stdc++.h>
//#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(5, 0));
for(int i = 0; i < N; ++i) for(int j = 0; j < 5; ++j) cin >> A.at(i).at(j);
int ok = 0, ng = 1000000001;
while(abs(ok-ng) > 1) {
int cen = (ok + ng) / 2;
set<int> S;
for(int i = 0; i < N; ++i) {
int bit = 0;
for(int j = 0; j < 5; ++j) {
bit = bit << 1;
bit |= A.at(i).at(j) >= cen;
}
S.insert(bit);
}
bool flg = false;
for(auto x : S) {
for(auto y : S) {
for(auto z : S) {
if((x | y | z) == 31) {
flg = true;
}
}
}
}
if(flg) ok = cen;
else ng = cen;
}
cout << ok << endl;
} |
#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>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
typedef vector<int> vi;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define allrev(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
void solve()
{
int n;
cin >> n;
vi arr(n), b(n);
forn(i, n)
{
cin >> arr[i];
}
forn(i, n)
{
cin >> b[i];
}
map<int, int> m;
forn(i, n)
{
int x;
cin >> x;
--x;
int val = b[x];
m[val]++;
}
ll cnt = 0;
forn(i, n)
{
if (m.find(arr[i]) != m.end())
{
cnt += m[arr[i]];
}
}
cout << cnt << ln;
}
int main()
{
fast_cin();
ll t = 1;
// cin >> t;
for (int it = 0; it < t; it++)
{
// cout << "Case #" << it + 1 << ": ";
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n;cin>>n;
vector<ll>ae(n+1,0),be(n+1,0),b(n+1);
int tmp;
for(int i=0;i<n;i++){
cin>>tmp;
ae.at(tmp)++;
}
for(int i=1;i<=n;i++){
cin>>b.at(i);
be.at(b.at(i))=1;
}
ll ans=0;
for(int i=0;i<n;i++){
cin>>tmp;
ans+=ae.at(b.at(tmp))*be.at(b.at(tmp));
}
cout<<ans<<endl;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,int> LP;
const int INF=1<<30;
const LL MAX=1e9+7;
void array_show(int *array,int array_n,char middle=' '){
for(int i=0;i<array_n;i++)printf("%d%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(LL *array,int array_n,char middle=' '){
for(int i=0;i<array_n;i++)printf("%lld%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){
if(vec_n==-1)vec_n=vec_s.size();
for(int i=0;i<vec_n;i++)printf("%d%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
void array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){
if(vec_n==-1)vec_n=vec_s.size();
for(int i=0;i<vec_n;i++)printf("%lld%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
namespace sol{
const int N=7;
bool twin[220000][N];
void solve(){
int n,m;
int i,j,k;
int a,b,c;
cin>>n;
string sa,sb;
cin>>sa>>sb;
twin[n][0]=true;
for(i=n-1;i>=0;i--){
a=sa[i]-'0';
for(j=0;j<N;j++){
b=j*10+a,c=j*10;
b%=N,c%=N;
if(sb[i]=='T')twin[i][j]=twin[i+1][b] || twin[i+1][c];
else twin[i][j]=twin[i+1][b] && twin[i+1][c];
}
}
if(twin[0][0])cout<<"Takahashi"<<endl;
else cout<<"Aoki"<<endl;
}
}
int main(){
sol::solve();
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const int INF = 2e9;
const ll LINF = 9e18;
const int dr4[4] = {1, -1, 0, 0};
const int dc4[4] = {0, 0, 1, -1};
const int dr8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dc8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
double r, x, y;
void solve() {
cin >> r >> x >> y;
ld dist = sqrt(ld(x * x) + ld(y * y));
ll ans = 0;
while(1) {
if(double(dist) <= double(r * 2)) break;
dist -= r; ans++;
}
cout << ans + (dist == r ? 1 : 2) << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int T = 1;
// cin >> T;
for(int tc = 1; tc <= T; tc++) {
solve();
}
} |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define N 100005
#define ll long long
#define ull unsigned long long
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define rloop(i, j, k) for (int i = j; i >= k; i--)
#define rep(i, k) for (int i = (0); i < (k); i++)
#define forall(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define pb push_back
#define pop pop_back
#define F first
#define S second
#define sz(x) (int)(x).size()
#define lin "\n"
#define Max (int)INT_MAX
#define Min (int)INT_MIN
#define fast_io ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(0)
#define PI 2 * acos(0.0)
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
void solve(){
string s;
cin >> s;
int cnt = 0;
for(char i: s){
if(i == '.')
break;
cnt++;
cout << i;
}
if(!cnt)
cout << "0";
}
int main()
{
auto start = clock();
fast_io;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
auto stop = clock();
cerr << "time taken:" << double(stop - start) / double(CLOCKS_PER_SEC) << " s" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define scl(n) scanf("%lld", &n)
#define pcl(n) printf("%lld\n", n)
#define pcl1(n) printf("%lld ", n)
#define nln printf("\n")
#define yes printf("YES\n")
#define no printf("NO\n")
#define dev(x) cout << #x << " " << x << " ";
#define PTT pair<ll, ll>
map<ll, ll> mp, mp1;
map<ll, ll>::iterator itr;
int main()
{
ll t, n, k, x, y, a, b, d;
string s;
cin >> s;
bool bl = true;
for (int i = 0; i < s.size(); i++)
{
if (s[i] == '.')
{
bl = false;
}
if (bl)
{
cout << s[i];
}
}
return 0;
} |
#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(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
ll N, M, K;
cin >> N >> M >> K;
vector<bool> loop(N, false);
rep(i, K) {
ll a;
cin >> a;
loop[a] = true;
}
vector<pair<double, double> >dp(N + M - 1);
rep(i, N + M - 1) dp[i].first = 0;
rep(i, N + M - 1) dp[i].second = 0;
double a = 0;
double b = 0;
for(ll i = N - 1; i >= 0; i--) {
a += dp[i + 1].first;
b += dp[i + 1].second;
a -= dp[i + 1 + M].first;
b -= dp[i + 1 + M].second;
if(loop[i]) {
dp[i].first = 1;
dp[i].second = 0;
} else {
dp[i].first = a/(double)M;
dp[i].second = b/(double)M + 1;
}
//cout << "dp[" << i << "] = " << dp[i].first << " x + " << dp[i].second << endl;
}
if(dp[0].first > 1 - 0.000001 && dp[0].first < 1 + 0.000001) {
cout << -1 << endl;
} else {
printf("%.10f\n", dp[0].second/(1-dp[0].first));
}
}
| #include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
const double eps = 1e-9;
template <typename T>
struct SegmentTree
{
using F = function<T(T, T)>;
const F f;
const T e;
int n;
vector<T> seg;
SegmentTree(int nn, const F f, const T e) : f(f), e(e){
n = 1;
while(n < nn) n <<= 1;
seg.assign(n * 2, e);
}
void set(int i, T x){
seg[i + n] = x;
}
void build(){
for(int k = n - 1; k > 0; k--){
seg[k] = f(seg[k * 2], seg[k * 2 + 1]);
}
}
void update(int i, T x){
int k = i + n;
seg[k] = x;
while(k >>= 1){
seg[k] = f(seg[k * 2], seg[k * 2 + 1]);
}
}
T query(int l, int r){
l += n, r += n;
T L = e, R = e;
for(; l != r; l >>= 1, r >>= 1){
if(l % 2) L = f(L, seg[l++]);
if(r % 2) R = f(seg[--r], R);
}
return f(L, R);
}
T operator[](const int i)const {
return seg[i + n];
}
template<typename C>
int right_bound_sub(int k, const C &check, T x){
while(k < n){
if(check(f(x, seg[k * 2]))){
k = k * 2;
}
else{
x = f(x, seg[k * 2]);
k = k * 2 + 1;
}
}
return k - n;
}
template <typename C>
int right_bound(int i, const C &check){
T x = e;
for(int l = i + n, r = n * 2; l != r; l >>= 1, r >>= 1){
if(l % 2){
if(check(f(x, seg[l]))){
return right_bound_sub(l, check, x);
}
x = f(x, seg[l]);
l++;
}
}
return -1;
}
template <typename C>
int left_bound_sub(int k, const C &check, T x){
while(k < n){
if(check(f(seg[k * 2 + 1], x))){
k = k * 2 + 1;
}
else{
x = f(seg[k * 2 + 1], x);
k = k * 2;
}
}
return k - n;
}
template <typename C>
int left_bound(int i, const C &check){
T x = e;
for(int l = n, r = i + n; l != r; l >>= 1, r >>= 1){
if(r % 2){
if(check(f(seg[--r], x))){
return left_bound_sub(r, check, x);
}
x = f(x, seg[r]);
}
}
return -1;
}
};
int main()
{
int n, m, k;
cin >> n >> m >> k;
SegmentTree<double> seg0(n + m, [](double a, double b){return a + b;}, 0);
SegmentTree<double> sego(n + m, [](double a, double b){return a + b;}, 0);
for(int i = 0; i < k; i++){
int a;
cin >> a;
seg0.update(a, 1);
}
seg0.build();
for(int i = n - 1; i >= 0; i--){
if(seg0[i] > 0.5) continue;
seg0.update(i, seg0.query(i, i + m + 1) / m);
sego.update(i, sego.query(i, i + m + 1) / m + 1);
}
if(seg0[0] > 1 - eps) cout << -1 << endl;
else cout << fixed << setprecision(15) << sego[0] / (1 - seg0[0]) << endl;
}
|
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
ll g(ll x){
int ret = 1;
for(int i = 0;i<x;i++){
(ret*=2)%=MOD;
}
return ret;
}
ll f(ll x){
ll ret;
ll ret_1 = 1;
ll ret_2 = 1;
for(int i = 0;i<x-1;i++){
(ret = ret_1 + ret_2)%=MOD;
ret_2 = ret_1;
ret_1 = ret;
}
return ret;
}
int main()
{
int n;cin >> n;
char c[4];
for(int i = 0;i<4;i++)cin >> c[i];
if(n<4){
cout<<1<<endl;
return 0;
}
ll ans;
if( c[0]=='A'&&c[1]=='A') ans=1;
else if( c[1]=='B'&& c[3]=='B')ans=1;
else if( c[1]=='B'&&c[2]=='A'&&c[3]=='A')ans = g(n-3);
else if(c[0]=='B'&&c[1]=='A'&&c[2]=='B') ans = g(n-3);
else if( c[1]=='B'&&c[2]=='B'&&c[3]=='A')ans = f(n-2);
else if(c[0]=='B'&&c[1]=='A'&&c[2]=='A') ans = f(n-2);
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long double db;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) a.begin(), a.end()
#define SZ(a) (int)((a).size())
#define FILL(a, value) memset(a, value, sizeof(a))
#define debug(a) cerr << #a << " = " << a << endl;
template<typename T> void setmax(T& x, T y) {x = max(x, y);}
template<typename T> void setmin(T& x, T y) {x = min(x, y);}
template<typename T> void print(const T& a, ostream& out){
for(auto i: a) out << i << ' ';
out << endl;
}
const double PI = acos(-1.0);
const LL INF = 1e9 + 47;
const LL LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
namespace IntModulo
{
const int mod = 1e9 + 7;
inline int add(int x, int y, int m = mod)
{
if (x + y < m)
return x + y;
return x + y - m;
}
inline int sub(int x, int y, int m = mod)
{
if (x >= y)
return x - y;
return x - y + m;
}
inline int mult(int x, int y, int m = mod)
{
return x * (LL) y % m;
}
inline int power(int x, LL y, int m = mod)
{
int r = 1;
while(y)
{
if (y & 1)
r = mult(r, x, m);
x = mult(x, x, m);
y >>= 1;
}
return r;
}
inline int inverse(int x, int m = mod)
{
return power(x, m - 2, m);
}
inline void ADD(int& x, int y, int m = mod){
x += y;
if (x >= m) x -= m;
}
inline void SUB(int& x, int y, int m = mod){
x -= y;
if (x < 0) x += m;
}
inline void MULT(int& x, int y, int m = mod){
x = (x * (LL) y) % m;
}
};
using namespace IntModulo;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n; cin >> n;
string s;
FOR(i, 0, 4){
char x; cin >> x;
s += x;
}
if (s == "BAAA" || s == "ABBA" || s == "BBBA" || s == "BAAB"){
vector<int> f(n + 1);
f[1] = f[2] = 1;
FOR(i, 3, n + 1) f[i] = add(f[i - 1], f[i - 2]);
cout << f[n - 1] << endl;
}else if (s == "ABAA" || s == "BBAA" || s == "BABA" || s == "BABB"){
cout << (n == 2 ? 1 : power(2, n - 3)) << endl;
}else cout << 1 << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string a[200100], b[200100];
int main()
{
int n;
cin >> n;
string p, t;
int numa = 0, numb = 0;
for (int i = 0; i < n; i++)
{
cin >> p;
if (p[0] == '!')
{
t = "";
for (int x = 1; p[x] != 0; x++)t += p[x];
b[numb++] = t;
}
else a[numa++] = p;
}
sort(a, a + numa);
sort(b, b + numb);
for (int i = 0; i < numb; i++)
if (binary_search(a, a + numa, b[i]))
{
cout << b[i];
return 0;
}
cout << "satisfiable";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long double ld;
#define int long long
#define pb push_back
#define mk make_pair
#define MOD 1000000007
#define vii vector<int>
#define pii pair<int,int>
#define piii pair<int, pii>
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define UB upper_bound
#define LB lower_bound
#define BS binary_search
#define PI 3.1415926535897932384626433832795
#define dec(x) fixed<<setprecision(x)
#define tc int t;cin>>t;while(t--)
#define pr(x) for(auto it : x)cout<<it<<" ";
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) (a*b/__gcd(a,b))
#define fi(i,n) for(int i=0;i<n;i++)
#define f(i, a, b) for(int i=a;i<b;i++)
#define cint1(a) int a;cin>>a
#define cint2(a,b) int a,b;cin>>a>>b
#define cint3(a,b,c) int a,b,c;cin>>a>>b>>c
#define cint4(a,b,c,d) int a,b,c,d;cin>>a>>b>>c>>d
#define all(v) v.begin(),v.end()
#define fast ios_base::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL);
#define endl cout<<"\n";
#define print1(a,n,m) for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){cout<<a[i][j]<<" ";}endl;}
#define scan1(a,n) for(int i=1;i<=n;i++) cin>>a[i]
#define scan(a,n) for(int i=0;i<n;i++) cin>>a[i]
#define print(a,n) for(int i=0;i<n;i++) cout<<a[i]<<" "
#define cout1(a) cout<<a;endl
#define cout2(a,b) cout<<a<<" "<<b;endl
#define cout3(a,b,c) cout<<a<<" "<<b<<" "<<c;endl
#define cout4(a,b,c,d) cout<<a<<" "<<b<<" "<<c<<" "<<d;endl
map<int,int>mp;
int comp(int a, int b){
return (a>b);
}
bool prime(int n)
{
if(n==0 or n==1) return false;
if(n==2) return true;
else if(n%2==0) return false;
for(int i=3;i*i<=n;i+=2)
{
if(n%i==0)
{
return false;
}
}
return true;
}
int binCo(int n, int r){
int C[n+1][r+1];
for(int i=0;i<n;i++)
{
for(int j=0;j<=min(i,r);j++)
{
if(j==0 or j==i)
C[i][j] = 1;
else
C[i][j] = C[i-1][j] + C[i-1][j-1];
}
}
return C[n][r];
}
//Modular Exponentiation O(Log y)
int power(int x, int y, int MODL) {
int res = 1;
x = x % MODL;
while (y > 0) {
if (y & 1)
res = (res*x) % MODL;
y = y>>1;
x = (x*x) % MODL;
}
return res;
}
//Fermat's Little theorem, O(Log m)
int modInverse(int a, int m) {
return power(a, m-2, m);
}
int binSearch(int arr[], int n, int x)
{
int l = 0, r=n-1;
while(l<=r)
{
int mid = (l+r)/2;
if(x==arr[mid])
return mid;
if(x>arr[mid])
{
l = mid+1;
}
else
if(x<arr[mid])
{
r = mid-1;
}
}
return -1;
}
bool sortBySec(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.second < b.second);
}
void solve()
{
int n;
cin>>n;
map<int,string>mp;
vii v(n),v2;
for(int i=0; i<n; i++){
string s;int n1;
cin>>s>>n1;
v[i] = n1;
mp[v[i]] = s;
}
int mx = *max_element(all(v));
for(int i=0;i<n;i++){
if(v[i]!=mx)v2.pb(v[i]);
}
mx = *max_element(all(v2));
cout<<mp[mx];
}
int32_t main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast;
solve();
return 0;
} |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<ll> A(N), P(N), X(N);
REP(i, 0, N) cin >> A[i] >> P[i] >> X[i];
ll ans = 1LL << 60;
vector<int> I(N);
iota(ALL(I), 0); sort(ALL(I), [&](auto l, auto r) { return A[l] < A[r]; });
for (auto i : I) {
if (X[i] - A[i] > 0) {
ans = min(ans, P[i]);
}
}
if (ans < (1LL << 60)) cout << ans << endl;
else cout << -1 << endl;
return 0;
}
| #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 io ios::sync_with_stdio(false); cin.tie(0)
int main()
{
io;
int n; cin >> n;
vector<int> a(n), b(n);
vector<vector<int>> c(n, vector<int>(n, 0));
rep(i, n) rep(j, n) {
cin >> c[i][j];
}
b = c[0];
a[0] = 0;
bool flag = true;
for (int i = 1; i < n; ++i) {
for (int j = 1; j < n; ++j) {
int diff = c[i][0] - c[0][0];
if (c[i][j] - c[0][j] != diff) {
flag = false;
break;
}
a[i] = diff;
}
}
int mn = *min_element(a.begin(), a.end());
if (mn < 0) {
rep(i, n) {
a[i] -= mn;
b[i] += mn;
if (b[i] < 0) {
flag = false;
break;
}
}
}
if (flag) {
cout << "Yes" << endl;
rep(i, n) {
cout << a[i];
if (i != n-1) cout << " ";
}
cout << endl;
rep(i, n) {
cout << b[i];
if (i != n-1) cout << " ";
}
cout << endl;
} else cout << "No" << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
if (a==191){
cout<<"so-so";
}
else if (a<191){
cout<<"Yay!";
}
else {
cout<<":(";
}
} | #include <bits/stdc++.h>
using namespace std;
#define endl ('\n')
#define pi (3.141592653589)
#define mod 1e9 + 7
#define int long long
#define float double
#define test \
int t; \
cin >> t; \
while (t--)
#define init(arr, val) memset(arr, val, sizeof(arr))
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define ret return 0;
void solve()
{
/*Write the Solution Here*/
int N;
cin >> N;
if (floor(1.08 * N) < 206)
cout << "Yay!" << endl;
else if (floor(1.08 * N) == 206)
cout << "so-so" << endl;
else
cout << ":(" << endl;
}
int32_t main()
{
fast
// test
solve();
ret
} |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define RI register int
typedef long long LL;
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
namespace IO {
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {
if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin);
return p1 == p2 ? EOF : *(p1++);
}
template <class T> inline void read(T &n) {
n = 0; RI ch = gc(), f;
while ((ch < '0' || ch > '9') && ch != '-') ch = gc();
f = (ch == '-' ? ch = gc(), -1 : 1);
while (ch >= '0' && ch <= '9') n = n * 10 + (ch ^ 48), ch = gc();
n *= f;
}
char Of[105], *O1 = Of, *O2 = Of;
template <class T> inline void print(T n, char ch = '\n') {
if (n < 0) putchar('-'), n = -n;
if (n == 0) putchar('0');
while (n) *(O1++) = (n % 10) ^ 48, n /= 10;
while (O1 != O2) putchar(*(--O1));
putchar(ch);
}
}
using IO :: read;
using IO :: print;
int main() {
#ifdef LOCAL
FILEIO("a");
#endif
int A, B; cin >> A >> B;
cout << A * 2 + 100 - B << endl;
return 0;
}
// created by Daniel yuan
/*
________
/ \
/ / \ \
/ / \ \
\ /
\ ______ /
\________/
*/
| #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t a, b, c, d;
cin >> a >> b;
cin >> c >> d;
cout << b - c << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int a,b;
cin >> a >> b;
int ans;
int x;
for(int i=1 ; i<=b/2 ; i++)
{
if(a%i==0)
{
x=a/i;
}
else
{
x=a/i+1;
}
if(i*(x+1)<=b)
{
ans=i;
}
}
cout << ans << endl;
return 0;
} | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
int main() {
ll A, B; cin >> A >> B;
vector<int> cnt(200010);
for(int i=A; i<=B; i++) {
int v = i;
for(ll j=1; j*j<=v; j++) {
if(v % j == 0) {
cnt[j]++;
if(j != v/j) cnt[v/j]++;
}
}
}
int ans = 0;
for(int i=1; i<200010; i++) {
if(cnt[i] >= 2) {
ans = i;
}
}
cout << ans << endl;
return 0;
}
|
#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))))
#define setbit(n, i) ((n) | (1LL << (i)))
#define togglebit(n, i) ((n) ^ (1LL << (i)))
const ll mod = (ll) 1e9+7;
using namespace std;
int main()
{
int N,T;
cin >> N >> T;
vector<ll> A,B;
for(int i=0;i<N;i++)
{
if (i<N/2) {
int a;
cin >> a;
A.push_back(a);
}
else {
int b;
cin >> b;
B.push_back(b);
}
}
vector<ll> C,D;
for(int bit=0; bit< (1 << A.size()) ;bit++)
{
ll sum = 0;
for(int i=0; i< A.size() ;i++)
{
if (bit & 1<<i) {
sum += A[i];
}
}
C.push_back(sum);
}
for(int bit=0; bit< (1 << B.size()) ;bit++)
{
ll sum = 0;
for(int i=0; i< B.size() ;i++)
{
if (bit & 1<<i) {
sum += B[i];
}
}
D.push_back(sum);
}
sort(D.begin(),D.end());
ll ans = 0;
for(int i=0; i< C.size() ;i++)
{
ll res = T-C[i];
if (res>0)
{
int idx = upper_bound(D.begin(),D.end(),res) - D.begin();
if (idx>0)
{
res -= D[idx-1];
}
ans = max(ans,T-res);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &x)
{
int f = 1; x = 0; char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -1;
for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
x *= f;
}
const int N = 1e3 + 5;
vector <int> Edge[N][26];
int n, m;
struct info { int x, y; } E[N];
int dis[N][N];
queue < pair <int, int> > q;
bool inq[N][N];
inline void spfa()
{
memset(dis, 0x3f, sizeof(dis));
dis[1][n] = 0; q.push(make_pair(1, n)); inq[1][n] = 1;
int x, y;
while (!q.empty())
{
x = q.front().first, y = q.front().second; q.pop(); inq[x][y] = 0;
for (int p = 0; p < 26; p++)
for (int i = 0; i < (int) Edge[x][p].size(); i++)
for (int j = 0; j < (int) Edge[y][p].size(); j++)
{
int px = Edge[x][p][i], py = Edge[y][p][j];
if (dis[x][y] + 2 < dis[px][py])
{
dis[px][py] = dis[x][y] + 2;
if (!inq[px][py])
{
inq[px][py] = 1;
q.push(make_pair(px, py));
}
}
}
}
}
int main()
{
read(n); read(m);
char s[2];
for (int i = 1; i <= m; i++)
{
read(E[i].x); read(E[i].y); scanf ("%s", s);
int p = s[0] - 'a';
Edge[E[i].x][p].push_back(E[i].y);
Edge[E[i].y][p].push_back(E[i].x);
}
spfa();
int ans = 0x3f3f3f3f;
for (int i = 1; i <= n; i++) ans = min(ans, dis[i][i]);
for (int i = 1; i <= m; i++)
{
int x = E[i].x, y = E[i].y;
ans = min(ans, dis[x][y] + 1);
ans = min(ans, dis[y][x] + 1);
}
if (ans == 0x3f3f3f3f) puts("-1");
else printf ("%d\n", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 2e18;
const ll fact_table = 1200008;
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
// priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop
ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←
/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll 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 all(c) begin(c), end(c)
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
// vec v(n) -> 長さnのベクトルを宣言
// mat dp(h, vec(w)) -> h * w の行列を宣言
const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
ll mypow(ll a, ll b, ll m = mod) {
ll x = 1;
while (b) {
while (!(b & 1)) {
(a *= a) %= m;
b >>= 1;
}
(x *= a) %= m;
b--;
}
return x;
}
vec rv(ll read) {
vec res(read);
for (int i = 0; i < read; i++) {
cin >> res[i];
}
return res;
}
/*
ll fact[fact_table + 5], rfact[fact_table + 5];
void c3_init() {
fact[0] = rfact[0] = 1;
for (ll i = 1; i <= fact_table; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
for (ll i = fact_table; i >= 1; i--) {
rfact[i - 1] = rfact[i] * i;
rfact[i - 1] %= mod;
}
return;
}
ll c3(ll n, ll r) {
return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod;
}
*/
bool icpc = false;
bool multicase = false;
ll n, k;
ll dist = 0, cnt = 0;
vec G[500005];
P dfs(int v, int p) {
// first : 一番近い黒までの距離
// second : 一番遠い白までの距離
ll black = INF, white = 0;
for (auto nv : G[v]) {
if (nv == p) continue;
auto [b, w] = dfs(nv, v);
b++;
w++;
black = min(black, b);
white = max(white, w);
}
if (white + black <= dist) {
white = -1;
}
if (white == dist) {
cnt++;
white = -1, black = 0;
}
if (p == -1 && white >= 0) {
cnt++;
}
return P(black, white);
}
int calc(ll mid) {
dist = mid;
cnt = 0;
P res = dfs(1, -1);
return cnt;
}
bool solve() {
cin >> n >> k;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
G[a].pb(b);
G[b].pb(a);
}
ll ok = n, ng = -1;
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (calc(mid) <= k) {
ok = mid;
} else {
ng = mid;
}
}
p(ok);
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
if (icpc) {
while (solve())
;
return 0;
}
ll q, testcase = 1;
if (multicase) {
cin >> q;
} else {
q = 1;
}
while (q--) {
solve();
testcase++;
}
// solve();
return 0;
} | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T>>;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}
//head
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vvi G(n);
rep(i, n-1) {
int a, b;
cin >> a >> b;
a--; b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
vi check(n);
auto dfs = [&](auto self, int i, int j, int ud)->tuple<int, int> {
int d = ud, mid = i;
int to = -1;
for(auto ne:G[i]) {
if(ne == j) continue;
auto [nd, nmid] = self(self, ne, i, ud+1);
if(chmax(d, nd)) {
mid = nmid;
to = ne;
}
}
for(auto ne:G[i]) {
if(ne == j) continue;
if(to != ne) check[ne] = 1;
}
return {d, mid};
};
auto [d, mid] = dfs(dfs, 0, -1, 0);
int z = mid;
fill(all(check), 0);
tie(d, mid) = dfs(dfs, z, -1, 0);
vi e(n);
int now = 1;
auto dfs2 = [&](auto self, int i, int j)->void {
e[i] = now++;
int to = -1;
for(auto ne:G[i]) {
if(ne == j) continue;
if(check[ne] == 0) {
to = ne;
continue;
}
self(self, ne, i);
}
if(to != -1) {
self(self, to, i);
}
now++;
};
dfs2(dfs2, z, -1);
rep(i, n) cout << e[i] << (i == n-1?'\n':' ');
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#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 repl(i,a,b) for(ll i = (a); i < (b); i++)
#define perl(i,a,b) for(ll i = (a); i > (b); i--)
const ll MOD = 1000000007;
const int _max = 2000000;
vector<ll> fact(_max+1), factinv(_max+1);
//Fast modular exponentiation
long long fast_exp(long long base, long long exp, long long mod) {
long long res=1;
while(exp>0) {
if(exp%2==1) res=(res*base)%mod;
base=(base*base)%mod;
exp/=2;
}
return res%mod;
}
void precompute(){
fact[0] = 1;
for(int i = 1; i <= _max; i++){
fact[i] = (fact[i-1]*i)%MOD;
}
for(int i = 0; i <= _max; i++){
factinv[i] = fast_exp(fact[i], MOD-2, MOD);
}
}
void solve(){
int n, m, k;
cin >> n >> m >> k;
if(n-k-1 >= m){
cout << 0 << "\n";
}
else{
ll total = (((fact[n+m]*factinv[n])%MOD)*factinv[m])%MOD;
//cout << total << "\n";
if(n == k){
cout << total << "\n";
}
else{
ll bad = (((fact[n+m]*factinv[n-k-1])%MOD)*factinv[m+k+1])%MOD;
ll ans = total - bad;
if(ans < 0) ans += MOD;
cout << ans << "\n";
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
precompute();
//ll t;
//cin >> t;
t = 1;
while(t--)solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
const int mod = 1e9 + 7;
int n, m, k, fact[N], ifact[N];
void add(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
}
void sub(int &x, int y) {
x -= y;
if (x < 0) x += mod;
}
int binPow(int x, int y) {
int ans = 1;
while (y > 0) {
if (y & 1) ans = 1LL * ans * x % mod;
x = 1LL * x * x % mod;
y >>= 1;
}
return ans;
}
int C(int n, int k) {
if (k > n || k < 0 || n < 0) return 0;
return 1LL * fact[n] * ifact[k] % mod * ifact[n - k] % mod;
}
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> m >> k; fact[0] = ifact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = 1LL * fact[i - 1] * i % mod;
ifact[i] = binPow(fact[i], mod - 2);
}
if (m <= n - k - 1) {
cout << 0 << "\n";
return 0;
}
int ans = C(n + m, n);
sub(ans, C(n + m, n - k - 1));
cout << ans << "\n";
return 0;
}
|
/*HAR HAR MAHADEV
ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ｀ヽ、ヽ ｀、ヽ｀｀、
ヽ、｀｀、｀、ヽ｀｀、 、ヽヽ｀、｀、、ヽヽ、｀｀、 、 ヽ｀、
ヽ｀｀、 ヽ｀ヽ｀、、ヽ ｀ヽ 、 🚶ヽ｀｀｀｀ヽヽヽ｀、、ヽ｀、、ヽ*/
//think twice code once
//when its getting hard why you started
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;//typedef for datatype and #define for macro
# define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
# define MOD 1000000007
# define endl '\n'
# define FOR(i, a, b) for (int i=a; i<(b); i++)
# define F0R(i, a) for (int i=0; i<(a); i++)
# define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
# define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
# define INF 9e18
# define PI 3.14159265358979323846
# define lb lower_bound
# define ub upper_bound
# define mp make_pair
# define pb push_back
# define fi first
# define se second
# define all(a) a.begin(), a.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
fast;
ll t = 1;
// cin >> t;
while (t--)
{
ll n, x, i, ans = -1, sum = 0;
cin >> n >> x;
vector<pair<ll, ll>> v;
for (i = 0; i < n; i++)
{
ll a, b; cin >> a >> b;
v.emplace_back(a, b);
}
for (i = 0; i < n; i++)
{
sum += (v[i].fi * v[i].se);
if (sum > 100 * x)
{
ans = i + 1;
break;
}
}
cout << ans << endl;
}
return 0;
}
/* stuff you should look for
* stack/set/gcd/palindrome/twopointer/slidingwindow
prefix sum/range query/ patterns/matrices/string
lexographicaly/xoor/subsequence subarray/overlapping intervals
factors(rootn) primefactorisation vectorofallfactors dfs bfs msdfs
availaible snip-dfs,mint,quadraticformula,2dvector
mytemp,negativemod,primefactorisation
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vec vector
#define rep(i,n) for (int i=0; i<(n); i++)
#define print(a) cout << a << endl
#define fix(n) fixed << setprecision(n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Yes "Yes"
#define YES "YES"
#define No "No"
#define NO "NO"
int main() {
int N;
ll X;
cin >> N >> X;
X *= 100;
rep(i,N) {
ll V,P;
cin >> V >> P;
X -= V*P;
if (X<0) {
print(i+1);
return 0;
}
}
print(-1);
return 0;
} |
#define _CRT_SECURE_NO_DEPRECATE
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include "bits/stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define int long long int
#define SYNC std::ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define FRE freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
//typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update>
// ost;
#define rep(i,l,r) for (int i = (l); i < (r); i++)
#define here cout << " Hey!!\n";
#define pb push_back
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define sz(a) (int)((a).size())
#define sq(x) ((x)*(x))
template <typename T>
void etch(T V) {
for (auto x : V) cout << x << ' ' ;
cout << '\n';
}
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)) int idx,
__attribute__ ((unused)) int LINE_NUM) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if(idx > 0) cerr << ", "; else cerr << "Line(" << LINE_NUM << ") ";
stringstream ss; ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define debug(...) 42
#endif
const int MOD = 1e9+7;
const int MOD1 = 998244353;
const int N = 2e5+5;
const int INF = 1000111000111000111LL;
const ld EPS = 1e-12;
const ld PI = 3.141592653589793116;
int dx[] = {1, -1, 1, -1};
int dy[] = {1, -1, -1, 1};
int32_t main()
{
SYNC
int h, w; cin >> h >> w;
int a[h][w];
memset(a, 0, sizeof a);
rep(i,0,h) {
rep(j,0,w) {
char ch; cin >> ch;
if (ch != '#') a[i][j] = 1;
}
}
int ans = 0;
rep(i,1,h-1) {
rep(j,1,w-1) {
if (a[i][j]) continue;
rep(k,0,4) {
if (a[i+dx[k]][j+dy[k]] && !(a[i][j+dy[k]] ^ a[i+dx[k]][j])) {
ans++;
}
}
}
}
cout << ans;
return 0;
} | #include<iostream>
#include<math.h>
using namespace std;
int main(){
long int n, m, x, arr[1001]={0}, total=0;
cin>>n>>m;
while(n>0){
cin>>x;
arr[x-1] = 1;
total++;
n--;
}
while(m>0){
cin>>x;
if(arr[x-1] == 1){
arr[x-1] = 0;
total--;
}
else{
arr[x-1] = 1;
total++;
}
m--;
}
n=0; m=total;
while(total>0){
if(arr[n] != 0) {
if(total != m) cout<<" ";
cout<<n+1;
total--;
}
n++;
}
return 0;
}
|
#include <bits/stdc++.h>
#include<sstream>
#include<string>
#include<vector>
#include <set>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define ll long long
long long M=1000000007;
using namespace std;
ll fact[1000000];
ll power(ll x, unsigned ll y, unsigned ll m)
{
if (y == 0)
return 1;
ll p = power(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
unsigned long long modInverse(unsigned long long n,
int p)
{
return power(n, p - 2, p);
}
unsigned long long nCrModPFermat(unsigned long long n,
unsigned long long r, int p)
{
// If n<r, then nCr should return 0
if (n < r)
return 0;
// Base case
if (r == 0)
return 1;
return (fact[n] * modInverse(fact[r], p) % p
* modInverse(fact[n - r], p) % p)
% p;
}
int32_t main()
{
IOS
char c1,c2,c3;
cin>>c1>>c2>>c3;
if(c1==c2 && c2==c3)
{
cout<<"Won"<<endl;
}
else
{
cout<<"Lost";
}
return 0;
}
| #pragma region Region_1
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
using ll = long long;
using P = pair<int, int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VP = vector<P>;
using VS = vector<string>;
using VC = vector<char>;
using VVC = vector<vector<char>>;
#define MOD 1000000007
const int INF = 1e9 + 10; // int max > 2*10^9
const long long INFL = 2e18 + 10; // ll max > 9*10^18
template <class T, class C>
bool chmax(T& a, C b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class C>
bool chmin(T& a, C b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
T sum(const vector<T>& v) {
T res = 0;
for (size_t i = 0; i < v.size(); ++i) res += v[i];
return res;
}
/////////////////////////////////////////////////////////
// print like python
// https://qiita.com/Lily0727K/items/06cb1d6da8a436369eed
/////////////////////////////////////////////////////////
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T>& vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << " ";
}
cout << endl;
}
template <class T>
void print(vector<vector<T>>& df) {
for (auto& vec : df) {
print(vec);
}
}
#pragma endregion Region_1
/////////////////////////////////////////////////////////
int main() {
//入力の高速化用のコード
ios::sync_with_stdio(false);
cin.tie(nullptr);
std::cout << std::setprecision(15);
//////////////////////////////////////////
string c;
cin >> c;
set<char> s;
rep(i, 3) { s.insert(c[i]); }
if(s.size()>1){
print("Lost");
}else{
print("Won");
}
return 0;
}
|
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#pragma GCC optimize "trapv"
#endif
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout << setprecision(12) << fixed;
#define ll long long int
#define line cout << endl;
#define all(x) x.begin(), x.end()
#define pb emplace_back
#define mp make_pair
#define I emplace
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
#define maxPQi priority_queue<int>
#define minPQi priority_queue<int, vector<int>, greater<int>>
const int MAXN = 1000002;
const int MOD = 1000000007;
const int MOD2 = 998244353;
const ll INF = 1e18L;
// TEMPLATES
// cin >> pair<T1, T2>
template <typename T1, typename T2>
istream &operator>>(istream &istream, pair<T1, T2> &p) {
istream >> p.first >> p.second;
return istream;
}
// cin >> vector<T>
template <typename T> istream &operator>>(istream &istream, vector<T> &v) {
for (auto &it : v)
cin >> it;
return istream;
}
// cout << pair<T1, T2>
template <typename T1, typename T2>
ostream &operator<<(ostream &ostream, const pair<T1, T2> &p) {
ostream << p.first << " " << p.second;
return ostream;
}
// cout << vector<T>
template <typename T>
ostream &operator<<(ostream &ostream, const vector<T> &c) {
for (auto &it : c)
cout << it << " ";
return ostream;
}
// Debugging
template <typename T> void DEB(T &&t) {
#ifndef ONLINE_JUDGE
cout << t << "\n";
#endif
}
template <typename T, typename... Args> void DEB(T &&t, Args &&... args) {
#ifndef ONLINE_JUDGE
cout << t << " ";
DEB(forward<Args>(args)...);
#endif
}
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
map<ll, ll> getPF(ll n) {
map<ll, ll> ans;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ans[i]++;
n /= i;
}
}
if (n > 1)
ans[n]++;
return ans;
}
ll modexp(ll n, ll p, int mod = 1e9 + 7) {
ll ans = 1;
n %= mod;
while (p) {
if (p & 1)
ans = (ans * n) % mod;
p >>= 1; // divide by 2
n = (n * n) % mod;
}
return ans;
}
ll LCM(ll a, ll b) { return (a * b) / __gcd(a, b); }
ll fact[MAXN] = {0};
void getFactorials() {
fact[0] = fact[1] = 1;
for (int i = 2; i < MAXN; i++) {
fact[i] = (fact[i - 1] * i * 1LL) % MOD;
}
}
vector<int> primes;
void sieve(int n) {
vector<bool> prime(n + 1, true);
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p]) primes.pb(p);
}
ll ncr(ll n, ll r, int mod = 1e9 + 7) {
if (n < r)
return 0;
if (r == 0)
return 1;
ll num = fact[n], den = (fact[n - r] * fact[r]) % mod;
ll inv = modexp(den, mod - 2);
return (num * inv) % mod;
}
// *** SOLVE HERE *** //
void presolve() {}
void solve(int test_case) {
int a,b;
cin>>a>>b;
int ans=1,lim=b/2,diff = b-a;
if (lim>=a) {
cout << lim << '\n';
return ;
}
for (int i = diff; i >= 1; i--) {
int t1 = (a+i-1)/i, t2 = b/i;
int l1 = t1*i, l2 = t2*i;
// cout << i<<" "<<l2<<" "<<l1 << '\n';
if (l1<=b and l2>=a and l1!=l2 ) {
cout << i << '\n';
return;
}
}
}
int main() {
fast
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
presolve();
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int a,b;
cin>>a>>b;
int ans=1;
for(int i=2;i<=b-a;i++){
int c=ceil(a/(double) i),d=b/(double) i;
if(d-c>0) ans=i;
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pi (3.141592653589)
#define pb push_back
#define mp make_pair
#define INF 1000000000
#define MOD 1000000007
#define vll vector<ll>
#define vpll vector<pair<ll,ll> >
#define pll pair<ll , ll>
#define ff first
#define ss second
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
//cin>>t;
while(t--){
string s;
cin >> s;
if(s[0] == s[1] && s[1] == s[2]) cout << "Won\n";
else cout << "Lost\n";
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
if (n == 0) {
cout << "Yes\n";
return 0;
}
vector < int > digits;
while (n > 0) {
digits.push_back(n % 10);
n /= 10;
}
int i = 0, j = (int)digits.size() - 1;
while(i < (int)digits.size() && digits[i] == 0) i++;
while(j >= 0 && digits[j] == 0) j--;
bool ok = true;
while (i <= j) {
if (digits[i] != digits[j]) {
ok = false;
break;
}
i++;
j--;
}
cout << (ok ? "Yes" : "No") << '\n';
}
|
#include <iostream>
#include <cmath>
#include <utility>
#include <vector>
using namespace std;
#define mp make_pair
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
char ispis[500];
int main(){
ios::sync_with_stdio(0);
int n;
cin>>n;
cout<<(1<<n)-1<<"\n";
for(int i=1;i<(1<<n);i++){
for(int j=0;j<(1<<n);j++){
int x=__builtin_popcount((i&j));
if(x%2) ispis[j]='A';
else ispis[j]='B';
}
for(int j=0;j<(1<<n);j++){
cout<<ispis[j];
}
cout<<"\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int N;
int ans[1010][1010];
int main() {
cin >> N;
int m = 2;
ans[0][0] = 0; ans[0][1] = 1;
for(int q = 0; q < N - 1; q++) {
for(int i = 0; i < 2; i++) {
for(int j = 0; j < 2; j++) {
for(int k = 0; k < m / 2; k++) {
for(int l = 0; l < m; l++) {
ans[k + i * m / 2 + m - 1][l + j * m] =
ans[k + m / 2 - 1][l] ^ (i == 1 && j == 1);
}
}
}
}
for(int i = 0; i < m - 1; i++) {
for(int j = m - 1; j >= 0; j--) {
ans[i][j * 2 + 1] = ans[i][j];
ans[i][j * 2] = ans[i][j];
}
}
m *= 2;
}
cout << m - 1 << endl;
for(int i = 0; i < m - 1; i++) {
for(int j = 0; j < m; j++) {
cout << (!ans[i][j] ? 'A' : 'B');
}
cout << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define print(a) for (auto x : a) cout << x << " "; cout << endl
#define print_upto(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout<<endl
#define take(a,n) for(ll i=1;i<=n;i++) cin>>a[i];
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define watch3(x,y,z) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<" and "<<(#z)<<" is "<<(z)<<"\n"
#define ff first
#define ss second
#define null NULL
#define all(c) (c).begin(),(c).end()
#define nl "\n"
#define ld long double
#define eb emplace_back
#define pb push_back
#define pf push_front
#define MOD 1000000007
#define inf INT_MAX
// cout << fixed << setprecision(9) << ans << nl;
typedef vector<ll> vl;
typedef vector< vl > vvl;
typedef pair< ll, ll> pll;
typedef map< ll, ll> mll;
const ll N = 200009;
void solve() {
ld x, y, r;
cin>>x>>y>>r;
double ep = 1e-14;
r = r + ep;
ld lx = x-r;
ld rx = x+r;
ld llx = ceil(lx);
ld rrx = floor(rx);
ll ans=0;
for(ld i=llx;i<=rrx;i++){
ld res = (r*r) - (i-x)*(i-x);
if(res<0)
continue;
res = sqrt(res);
ld ly = res + y;
ld ry = -res + y;
ld lly = ceil(ry);
ld rry = floor(ly);
ans += (ll)(rry-lly+1);
}
cout<<ans<<nl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll solve(ld x, ld y, ld r) {
ll res = 0ll;
ll top = floor(y + r);
ll under = ceil(y - r);
r= nextafter(r, INFINITY);
for(ll i = top; i >= under; i--) {
ld width = sqrt(r * r - abs(i - y) * abs(i - y));
res += floor(x + width) - ceil(x - width) + 1;
}
return res;
}
int main() {
ld x, y, r;
cin >> x >> y >> r;
cout << solve(x, y, r) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector<ll> aj[200005];
ll arr[200005],m,cnt2 = 0;
pair<bool, ll> f[200005];
void dfs(ll x,ll p){
ll mt = -2e9,mf = 0;
for(auto it:aj[x]){
if(it==p)continue;
dfs(it,x);
if(f[it].first)mt = max(mt,f[it].second);
else mf = max(mf,f[it].second);
}
if(mt>=mf){
f[x] = make_pair(true,mt-1);
}else{
f[x] = make_pair(false,mf+1);
}
if(f[x].first&&f[x].second<0)f[x] = make_pair(false,0);
else if(!f[x].first&&f[x].second>m){
cnt2++;
// cout<<x<<" added\n";
f[x] = make_pair(true,m-1);
}
// cout<<m<<" "<<x<<" "<<f[x].first<<" "<<f[x].second<<'\n';
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,h,q,t,i,e,j,k,a,b,c,x,y,z,sum=0,cnt=0,minx=2e9,maxn=0,x1,y1;
string str;
cin>>n>>k;
for(i=0;i<n-1;i++){
cin>>a>>b;
aj[a].push_back(b);
aj[b].push_back(a);
}
ll lo = 0,hi = n,mid,ans=0;
while(lo<=hi){
mid = (lo+hi)/2;
m = mid;
cnt2 = 0;
dfs(1,0);
// cout<<m<<" ";
if(!f[1].first&&f[1].second>0)cnt2++;
// cout<<cnt2<<'\n';
if(cnt2<=k){
hi = mid-1;
ans = mid;
}else lo = mid+1;
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 2e18;
const ll fact_table = 1200008;
priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
// priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop
ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←
/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll 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 all(c) begin(c), end(c)
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
// vec v(n) -> 長さnのベクトルを宣言
// mat dp(h, vec(w)) -> h * w の行列を宣言
const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
ll mypow(ll a, ll b, ll m = mod) {
ll x = 1;
while (b) {
while (!(b & 1)) {
(a *= a) %= m;
b >>= 1;
}
(x *= a) %= m;
b--;
}
return x;
}
vec rv(ll read) {
vec res(read);
for (int i = 0; i < read; i++) {
cin >> res[i];
}
return res;
}
/*
ll fact[fact_table + 5], rfact[fact_table + 5];
void c3_init() {
fact[0] = rfact[0] = 1;
for (ll i = 1; i <= fact_table; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
for (ll i = fact_table; i >= 1; i--) {
rfact[i - 1] = rfact[i] * i;
rfact[i - 1] %= mod;
}
return;
}
ll c3(ll n, ll r) {
return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod;
}
*/
bool icpc = false;
bool multicase = false;
ll n, k;
ll dist = 0, cnt = 0;
vec G[500005];
P dfs(int v, int p) {
// first : 一番近い黒までの距離
// second : 一番遠い白までの距離
ll black = INF, white = 0;
for (auto nv : G[v]) {
if (nv == p) continue;
auto [b, w] = dfs(nv, v);
b++;
w++;
black = min(black, b);
white = max(white, w);
}
if (white + black <= dist) {
white = -1;
}
if (white == dist) {
cnt++;
white = -1, black = 0;
}
if (p == -1 && white >= 0) {
cnt++;
}
return P(black, white);
}
int calc(ll mid) {
dist = mid;
cnt = 0;
P res = dfs(1, -1);
return cnt;
}
bool solve() {
cin >> n >> k;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
G[a].pb(b);
G[b].pb(a);
}
ll ok = n, ng = -1;
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (calc(mid) <= k) {
ok = mid;
} else {
ng = mid;
}
}
p(ok);
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
if (icpc) {
while (solve())
;
return 0;
}
ll q, testcase = 1;
if (multicase) {
cin >> q;
} else {
q = 1;
}
while (q--) {
solve();
testcase++;
}
// solve();
return 0;
} |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define int long long
const int maxn = 2e5+10;
int lst[300];
int Minus[300];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
for(int i = 'a';i <= 'z';i++)lst[i] = n;
ll ans = 0;
if(s[n-1] != s[n-2])Minus[(int)s[n-1]]++;
for(int i = n-2;i >= 0;i--){
if(i > 0 and s[i-1] != s[i] and s[i+1] != s[i])Minus[(int)s[i]]++;
if(s[i] == s[i+1] and lst[(int)s[i]] != i+1){
ans += lst[(int)s[i]] - i - 2 - (Minus[(int)s[i]]?Minus[(int)s[i]]:0ll);
// cout << i << " " << lst[(int)s[i]] << " " << Minus[(int)s[i]] << " ans: " << lst[(int)s[i]] - i - 2 - (Minus[(int)s[i]]?Minus[(int)s[i]]:0ll) << endl;
lst[(int)s[i]] = i;
for(int j = 'a';j <= 'z';j++)if(j != s[i])lst[j] = n;
for(int j = 'a';j <= 'z';j++)Minus[j] = 0;
}
if(s[i] == s[i+1] and lst[(int)s[i]] == i+1)lst[(int)s[i]] = i;
// lst[(char)s[i]] = i;
// Minus[(int)s[i]]++;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
typedef vector<vector<bool> > vvb;
#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 irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = int(n)-1; i >= 0; --i)
#define MES(a) MES2 a
#define MES2(a0,a1,a2,a3,a4,x,...) x
#define mes_1(x1) cout<<x1<<endl
#define mes_2(x1,x2) cout<<x1<<" "<<x2<<endl
#define mes_3(x1,x2,x3) cout<<x1<<" "<<x2<<" "<<x3<<endl
#define mes_4(x1,x2,x3,x4) cout<<x1<<" "<<x2<<" "<<x3<<" "<<x4<<endl
#define mes_5(x1,x2,x3,x4,x5) cout<<x1<<" "<<x2<<" "<<x3<<" "<<x4<<" "<<x5<<endl
#define mes(...) CHOOSE((__VA_ARGS__,mes_5,mes_4,mes_3,mes_2,mes_1,~))(__VA_ARGS__)
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define ynmes(a) (a) ? mes("Yes") : mes("No")
#define YNmes(a) (a) ? mes("YES") : mes("NO")
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define Rev(a) reverse(a.begin(), a.end())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = { 1, 0, -1, 0, 1, -1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, 1, 1, -1, -1 };
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; }
struct io { io() { ios::sync_with_stdio(false); cin.tie(0); } };
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
ll fact_mod(ll n, ll mod) {
ll f = 1; for (ll i = 2; i <= n; i++) f = f * (i % mod) % mod;
return f;
}
ll modpow(ll x, ll n, ll mod) {
if(n == 0) return 1;
ll res = modpow((x * x) % mod, n / 2 , mod);
if(n & 1) res = (res * x) % mod;
return res;
}
ll modncr(ll n, ll r, ll mod) {
if(r > n-r) r = n-r;
if(r == 0) return 1;
ll a = 1;
rep(i, r) a = a * ((n-i) % mod) % mod;
ll b = modpow(fact_mod(r, mod), mod-2, mod);
return (a % mod) * (b % mod) % mod;
}
signed main() {
string s;
cin >> s;
ll r = 0;
ll n = s.size();
stack <char> stk;
rep(i, n) {
if (i && s[i] == s[i-1]) stk.push(s[i]);
}
if (stk.empty()) {
mes(0);
re0;
}
ll tmp = 0;
drep(i, n) {
if (stk.empty()) break;
if (i && s[i] == s[i-1]) {
stk.pop();
r += tmp;
tmp = 0;
if (!stk.empty() && stk.top() != s[i-1]) tmp += n-i;
} else {
if (stk.top() != s[i]) tmp++;
}
}
mes(r);
}
|
#include<bits/stdc++.h>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x) x.begin(),x.end()
#define puts(x) cout << (x) << "\n"
constexpr int mod = 1000000007;
using namespace std;
int input() { int t; cin >> t; return t; }
signed main() {
int n, x[123], y[123];
cin >> n;
for1(i, n)cin >> x[i] >> y[i];
bool b = 0;
for1(i, n)for1(j, i - 1)for1(k, j - 1) {
if ((x[j] - x[i]) * (y[k] - y[j]) == (x[k] - x[j]) * (y[j] - y[i]))b = 1;
}
puts(b ? "Yes" : "No");
} | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define show(x) cout << #x << " = " << (x) << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo(x) cout<<((x)?"Yes":"No")<<newl;
#define YESNO(x) cout<<((x)?"YES":"NO")<<newl;
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
template<class A, class B> using umap = unordered_map<A, B>;
template<class A> using uset = unordered_set<A>;
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
F0R(j, sz(v)) i >> v[j];
return i;
}
template<class A, class B> istream& operator>>(istream& i, pair<A, B>& p) {
return i >> p.first >> p.second;
}
template<class A, class B, class C> istream& operator>>(istream& i, tuple<A, B, C>& t) {
return i >> get<0>(t) >> get<1>(t) >> get<2>(t);
}
template<class T> ostream& operator<<(ostream& o, const pair<T, T>& v) {
o << "(" << v.first << "," << v.second << ")";
return o;
}
template<class T> ostream& operator<<(ostream& o, const vector<T>& v) {
F0R(i, v.size()) {
o << v[i] << ' ';
}
o << newl;
return o;
}
template<class T> ostream& operator<<(ostream& o, const set<T>& v) {
for (auto e : v) {
o << e << ' ';
}
o << newl;
return o;
}
template<class T1, class T2> ostream& operator<<(ostream& o, const map<T1, T2>& m) {
for (auto& p : m) {
o << p.first << ": " << p.second << newl;
}
o << newl;
return o;
}
#if 1
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string S; cin >> S;
deque<char> T;
bool flip = false;
F0R(i, sz(S)) {
char c = S[i];
if (c == 'R') {
flip = !flip;
}
else {
if (!flip) {
if (sz(T) && T.back() == c) {
T.pop_back();
}
else {
T.push_back(c);
}
}
else {
if (sz(T) && T.front() == c) {
T.pop_front();
}
else {
T.push_front(c);
}
}
}
}
if (!flip) {
F0R(i,sz(T)) {
cout << T[i];
}
}
else {
RF0(i, sz(T)) {
cout << T[i];
}
}
cout << newl;
}
#endif
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
const ll mod = 1e9 + 7;
int inf = 1000000000; //10e9
ll power(int x, int n)
{
ll xn = 1;
rep(i, n)
{
xn *= x;
}
return xn;
}
int main()
{
ll n;
cin >> n;
bool ans = false;
ll tmp = 1;
int a, b;
for (int i = 1; tmp <= n; i++)
{
for (int j = 1; tmp <= n; j++)
{
tmp = power(5, i) + power(3, j);
if (tmp == n)
{
ans = true;
a = j;
b = i;
break;
}
}
if (ans)
{
break;
}
tmp = power(5, i) + 3;
}
if (ans)
{
cout << a << ' ' << b << endl;
}
else
{
cout << -1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define rep(i, a, n) for(int i = a; i < n; ++i)
#define per(i, a, n) for(int i = n-1; i >= a; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
using namespace std;
ll myPow(ll x, ll p){
ll y = 1;
while(p--){
y *= x;
}
return y;
}
void test_case(){
ll s;
scanf("%lld", &s);
for(ll a = 1; ; a++){
ll x = myPow(3, a);
if(x >= s) break;
for(ll b = 1; ; ++b){
ll y = myPow(5, b);
if(y >= s) break;
if(x+y == s){
printf("%lld %lld", a, b);
return;
}
}
}
printf("-1\n");
}
int main()
{
test_case();
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define mii map<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define eb emplace_back
#define ef emplace_front
const int INF=2147483647;
const int MOD=1000000007;
const int mod=998244353;
const double eps=1e-12;
int a,b,c;
double prob[102][102][102];
double res;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>a>>b>>c;
prob[a][b][c]=1;
for(int i=a;i<=100;i++){
for(int j=b;j<=100;j++){
for(int k=c;k<=100;k++){
if( (i==100 and j!=100 and k!=100) or (i!=100 and j==100 and k!=100) or (i!=100 and j!=100 and k==100) ) continue;
prob[i][j][k+1]+=prob[i][j][k]*(double)k/(i+j+k);
prob[i][j+1][k]+=prob[i][j][k]*(double)j/(i+j+k);
prob[i+1][j][k]+=prob[i][j][k]*(double)i/(i+j+k);
}
}
}
for(int i=0;i<=100;i++){
for(int j=0;j<=100;j++){
for(int k=0;k<=100;k++){
if( (i==100 and j!=100 and k!=100) or (i!=100 and j==100 and k!=100) or (i!=100 and j!=100 and k==100) ){
res+=prob[i][j][k]*((double)i+j+k-a-b-c);
}
}
}
}
cout<<fixed<<setprecision(10)<<res<<endl;
/***debug***
for(int i=a;i<=100;i++){
for(int j=b;j<=100;j++){
for(int k=c;k<=100;k++){
cout<<fixed<<setprecision(10)<<prob[i][j][k]<<" ";
}
cout<<endl;
}
cout<<endl;
}
cout<<endl;
***debug***/
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
map<string,double> dp;
double solve(int a,int b,int c) {
if(a==100 or b==100 or c==100)
return 0;
string key=to_string(a)+" "+to_string(b)+" "+to_string(c);
if(dp.find(key)!=dp.end())
return dp[key];
double p=((solve(a+1,b,c)+1)*a)/(a+b+c);
double q=((solve(a,b+1,c)+1)*b*1.0)/(a+b+c);
double r=((solve(a,b,c+1)+1)*c*1.0)/(a+b+c);
return dp[key]=p+q+r;
}
signed main(){
int a,b,c;
cin>>a>>b>>c;
printf("%0.9lf",solve(a,b,c));
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define N 2005
#define mp make_pair
using namespace std;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return x*f;
}
int n,m,f[N][N],dist[N],vis[N],v[N],w[N],head[N],nxt[N],cnt,self_circle[N];
void add(int a,int b,int c)
{
v[++cnt]=b;
w[cnt]=c;
nxt[cnt]=head[a];
head[a]=cnt;
}
void dij(int S)
{
memset(dist,0x3f,sizeof(dist));
memset(vis,0,sizeof(vis));
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >q;
q.push(mp(0,S));
dist[S]=0;
while(!q.empty())
{
int c=q.top().second;q.pop();
if(vis[c])continue;
vis[c]=1;
for(int i=head[c];i;i=nxt[i])
{
if(dist[v[i]]>dist[c]+w[i])
{
dist[v[i]]=dist[c]+w[i];
q.push(mp(dist[v[i]],v[i]));
}
}
}
}
int main()
{
memset(self_circle,0x3f,sizeof(self_circle));
n=read();m=read();
for(int i=1;i<=m;i++)
{
int x=read(),y=read(),z=read();
if(x==y)self_circle[x]=min(self_circle[x],z);
else add(x,y,z);
}
for(int i=1;i<=n;i++)
{
dij(i);
memcpy(f[i],dist,sizeof(f[i]));
}
// for(int i=1;i<=n;i++)
// {
// for(int j=1;j<=n;j++)
// {
// printf("%d ",f[i][j]);
// }
// puts("");
// }
for(int i=1;i<=n;i++)
{
int minn=self_circle[i];
for(int j=1;j<=n;j++)
{
if(i==j)continue;
minn=min(minn,f[i][j]+f[j][i]);
}
if(minn==0x3f3f3f3f)puts("-1");
else printf("%d\n",minn);
}
return 0;
}
| #include <bits/stdc++.h>
#define ll int
#define MAXN 2005
#define MAX 2005
using namespace std;
vector<ll> adjlist[MAX];
ll n, m;
ll bfs(ll start) {
ll mark[MAX], res = 0;
memset(mark, 0, sizeof(mark));
queue<ll> q;
q.push(start);
mark[start] = 1;
while(!q.empty()) {
ll top = q.front();
q.pop();
for(ll i = 0; i < adjlist[top].size(); i++) {
ll next_cur = adjlist[top][i];
if(!mark[next_cur]) {
q.push(next_cur);
mark[next_cur] = 1;
}
}
}
for(ll i = 1; i <= n; i++) {
if(mark[i])
res++;
}
return res;
}
int main() {
cin>>n>>m;
for(ll i = 0 ; i < m; i++) {
ll u,v;
cin>>u>>v;
adjlist[u].push_back(v);
}
ll ans = 0;
for(ll i = 1; i <= n; i++) {
ans += bfs(i);
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/segtree>
//using namespace atcoder;
using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int inf = 1001001001;
const ll mod = 1000000007;
const ll INF = 1ll<<60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
struct UnionFind {
vector<int> parents;
UnionFind() {}
UnionFind(int n) : parents(n, -1) {}
int leader(int x) {
if (parents[x] < 0) return x;
else return parents[x] = leader(parents[x]);
}
bool merge(int x, int y) {
x = leader(x);
y = leader(y);
if (x == y) return false;
if (parents[x] > parents[y]) swap(x, y);
parents[x] += parents[y];
parents[y] = x;
return true;
}
bool same(int x, int y) { return leader(x) == leader(y); }
int size(int x) { return -parents[leader(x)]; }
void init(int n) { parents.assign(n, -1);} // reset
};
int main() {
int n; cin >> n;
vl a(n); rep(i,n) cin >> a[i];
vector<pl> aa(n);
rep(i,n) aa[i].first = a[i], aa[i].second = i;
sort(all(aa));
reverse(all(aa));
UnionFind uf(n);
ll ans = 0;
ll m = 1;
rep(i,n) {
ll ai = aa[i].first, id = aa[i].second;
ans = max(ans, m*ai);
if (id > 0 && a[uf.leader(id)] <= a[uf.leader(id-1)]) {
chmin(a[uf.leader(id-1)], a[uf.leader(id)]);
chmin(a[uf.leader(id)], a[uf.leader(id-1)]);
uf.merge(id, id-1);
m = max(m, (ll)uf.size(id));
ans = max(ans, m*ai);
}
if (id < n-1 && a[uf.leader(id)] <= a[uf.leader(id+1)]) {
chmin(a[uf.leader(id+1)], a[uf.leader(id)]);
chmin(a[uf.leader(id)], a[uf.leader(id+1)]);
uf.merge(id, id+1);
m = max(m, (ll)uf.size(id));
ans = max(ans, m*ai);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin>>n;
vector<int> a(n);
for(int i= 0; i<n; i++) cin>>a[i];
int ans = 0;
for(int i = 0, h; i<n; i++){
h = a[i];
for(int j = i; j<n; j++){
h = min(h, a[j]);
ans = max(ans, h*(j-i+1));
}
}
cout<<ans<<"\n";
return 0;
} |
#include<bits/stdc++.h>
#define re register
#define ll long long
using namespace std;
const int lzw=2e5+3;
int n,a[lzw];
ll ans,sum[lzw],Max[lzw],maxx;
int main(){
scanf("%d",&n);
for(re int i=1;i<=n;i++) scanf("%d",&a[i]);
for(re int i=1;i<=n;i++){
sum[i]=sum[i-1]+a[i];
maxx=max(maxx,sum[i]);
Max[i]=maxx;
}
ll pos=0;
for(re int i=1;i<=n;i++){
ans=max(ans,pos+Max[i]);
pos+=sum[i];
}
printf("%lld\n",ans);
return 0;
} | #include <bits/stdc++.h>
//#include <sstream>
using namespace std;
#define ll long long int
#define us unsigned
#define t() int test;cin>>test;while(test--)
#define ip(a) int a;cin>>a
#define ipll(a) ll a;cin>>a
#define iparr(a,n) int a[n];for(int i=0;i<n;i++){cin>>a[i];}
#define ipllarr(a,n) ll a[n];for(int i=0;i<n;i++){cin>>a[i];}
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>n;i--)
#define llrep(i,a,n) for(ll i=a;i<n;i++)
#define llrepr(i,a,n) for(ll i=a;i>n;i--)
#define urep(i,a,n) for(us int i=a;i<n;i++)
#define urepr(i,a,n) for(us int i=a;i>n;i--)
#define nl cout<<endl
#define pb push_back
#define IOS ios::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define prblocks(v,n) cout<<"\t";rep(i,0,n){cout<<v[i]<<" ";}nl
#define no cout<<"NO";nl
#define yes cout<<"YES";nl
#define all(a) a.begin(),a.end()
vector<bool> v((int)1e6 +1,1);
void set_v(){
for(int i=2;i< (int)1e6+1;i++){
if(v[i]){
for(int j=i;(i*j)<(int)1e6+1;j++){
v[i*j]=0;
}
}
}
}
//// A->
//void solve(){
//
//}
// B->
void solve(){
ip(n);
int tepm,sum=0;
rep(i,0,n){
cin>>tepm;
sum += max(0,tepm-10);
}
cout<<sum;
}
//// C->
//bool adj[2001][2001];
//int counts[2001];
//void solve(){
// memset(adj,0,sizeof(adj));
// memset(counts,0,sizeof(counts));
// ip(N);
// rep(i,1,N+1){
// adj[i][i]=1;
// }
// while(N--){
// ip(a);
// ip(b);
// adj[a][b]=1;
// }
//
//}
void testing(int t){
}
int main(){
IOS
// set_v();
// memset(t,0,sizeof(t));
int qwertyuiop=1;
// cin>>qwertyuiop;
// qwertyuiop++;
while(qwertyuiop--){
solve();
// testing(qwertyuiop);
}
return 0;
}
|
#include "bits/stdc++.h"
#include "random"
#include <unistd.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vi>
#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define MOD int(1e9) + 7
#define PAI 3.1415926535
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define chmax(x, y) x = max(x,y)
#define chmin(x, y) x = min(x,y)
#define pr(x) cout << x << endl
#define Endl endl
#define rep(i, n) for(int i = 0 ; i < n; ++i)
const int dx2[4] = {0,1,0,1};
const int dy2[4] = {0,0,1,1};
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
const int ddx[8] = {-1,0,1,-1,1,-1,0,1};
const int ddy[8] = {-1,-1,-1,0,0,1,1,1};
const int inf = 99999999;
const ll linf = 1LL << 62;
ll gcd(ll a,ll b){
if(a < b)swap(a , b);
if(a % b != 0) return(gcd(b, a%b));
return b;
}
ll lcm(ll a,ll b){
if(a < b)swap(a , b);
return (a / gcd(a , b)) * b;
}
int Uniform_Random(int a, int b){ // (a <= x <= b)
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> rv1(a, b);
return rv1(mt);
}
int main(){
ll N; cin >> N;
ll ans = N;
set<ll> st;
for(ll i = 2; i <= sqrt(N); ++i){
ll cnt = 2;
if(st.find(i) == st.end()){
while(pow(i, cnt) <= N){
st.insert(pow(i, cnt));
ans --;
cnt ++;
}
}
}
cout << ans << endl;
return 0;
} | /********************************************************************
* *
* *
* Coded By colin! *
* *
* *
********************************************************************/
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b){
if(b==0)return a;
else return gcd(b,a%b);
}
ll lcm(ll a, ll b){
return a*b/gcd(a,b);
}
ll nCr(ll n, ll r){
if(n==r||r==0)
{
return 1;
}
return nCr(n-1,r-1)+nCr(n-1,r);
}
ll nPr(ll n, ll r){
ll i,per=1;
for(i=n; i>=n-r+1; i--)
{
per*=i;
}
return per;
}
ll catalan(ll n){
return nCr(2*n,n) / (n+1);
}
int main()
{
int n; cin>>n;
ll cnt=0;
int arr[200005];
ll na[201]={0};
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
na[arr[i]%200]++;
}
for(int j=0;j<200;j++)
{
cnt=cnt+(na[j]*(na[j]-1))/2;
}
printf("%lld",cnt);
} |
#include <bits/stdc++.h>
using namespace std;
bool can_evaluate(string &X, long long B, long long M){
long long val = 0;
for(int i = 0; i < X.size(); i++){
int x = X[i] - '0';
if(val > (M-x)/B) return false;
val = val*B + x;
}
return val <= M;
}
int main(){
string X; long long M;
while(cin >> X >> M){
if(X.size() == 1){
printf("%d\n", stod(X) <= M ? 1 : 0);
continue;
}
int min_b = 0;
for(char ch : X){
min_b = max(min_b, ch-'0'+1);
}
if(!can_evaluate(X, min_b, M)){
printf("0\n");
continue;
}
long long max_b = min_b;
while(can_evaluate(X, max_b, M)) max_b <<= 1;
long long lo = min_b, up = max_b, B = min_b;
while(lo <= up){
long long mid = (lo + up) >> 1;
if(can_evaluate(X, mid, M)){
lo = mid+1;
B = mid;
} else {
up = mid-1;
}
}
printf("%lld\n", B - min_b + 1);
}
}
| #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,-1,0};
long double eps = 1e-9;
long double pi = acos(-1);
using lll = __int128_t;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
string s;
cin>>s;
ll n;
cin>>n;
ll ma = 0;
for(ll i=0;i<(int)s.size();i++)chmax(ma,s[i]-'0');
if(s.size() == 1){
// assert(ma>n);
if(ma > n)cout << 0 << endl;
else cout << 1 << endl;
return 0;
}
int x = s.size();
lll low=0,up=1000000000000000009,mid;
while(up-low>1){
mid=(up+low)/2;
lll m = n;
bool pos = 1;
for(int i=1;i<x;i++)m/=mid;
if(m == 0)pos=false;
if(pos){
lll now = 0;
for(int i=0;i<x;i++){
now *= mid;
now += s[i]-'0';
}
if(now > n)pos=false;
}
if(pos){
low=mid;
}
else{
up=mid;
}
}
chmin(low,n);
ll ans = low - ma;
chmax(ans,0);
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int64_t X,Y,R;
int64_t in(){
double x; cin >> x;
return round(10000*x);
}
int64_t f(){
int64_t cnt=0;
int64_t yUpper;
if(R+Y>=0){
yUpper=(R+Y)-((R+Y)%10000);
}else{
if((R+Y)%10000!=0) yUpper=(R+Y)-(10000+(R+Y)%10000);
else yUpper=(R+Y);
}
int64_t x1,x2;
if(X>=0){
x1=X+(10000-X%10000);
x2=X-X%10000;
}else{
x1=X-X%10000;
x2=X-(10000+X%10000);
}
int64_t c1=0,c2=0;
while(yUpper>=Y){
int64_t u=yUpper-Y;
while(true){
int64_t s=x1-X,t=X-x2;
if(s*s + u*u > R*R && t*t + u*u > R*R){
cnt+=c1+c2;
break;
}
if(s*s + u*u <= R*R){
x1+=10000;
c1++;
}
if(t*t + u*u <= R*R){
x2-=10000;
c2++;
}
}
yUpper-=10000;
}
int64_t yLower;
if(Y-R<0){
yLower=(Y-R)-((Y-R)%10000);
}else{
if((Y-R)%10000!=0) yLower=(Y-R)+(10000-(Y-R)%10000);
else yLower=(Y-R);
}
int64_t x3,x4;
if(X>=0){
x3=X+(10000-X%10000);
x4=X-X%10000;
}else{
x3=X-X%10000;
x4=X-(10000+X%10000);
}
int64_t c3=0,c4=0;
while(yLower<Y){
int64_t u=Y-yLower;
while(true){
int64_t s=x3-X,t=X-x4;
if(s*s + u*u > R*R && t*t + u*u > R*R){
cnt+=c3+c4;
break;
}
if(s*s + u*u <= R*R){
x3+=10000;
c3++;
}
if(t*t + u*u <= R*R){
x4-=10000;
c4++;
}
}
yLower+=10000;
}
return cnt;
}
int main(){
X=in(); Y=in(),R=in();
cout << f() << endl;
return 0;
} | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long
#define min3(a,b,c) min(min((a),(b)),(c))
#define min4(a,b,c,d) min(min((a),(b)),min((c),(d)))
#define max3(a,b,c) max(max((a),(b)),(c))
#define max4(a,b,c,d) max(max((a),(b)),max((c),(d)))
#define S second
#define F first
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 3.14159265358979323846;
#define MOD 1000000007
using namespace std;
bool check1 (int n)
{
while(n)
{
int r = n % 10;
if(r == 7)
return true;
n /= 10;
}
return false;
}
bool check2 (int n)
{
while(n)
{
int r = n % 8;
if(r == 7)
return true;
n /= 8;
}
return false;
}
int main()
{
FAST;
int n;
cin >> n;
int c = 0;
for(int i = 1; i <= n; i++)
{
if(check1(i) || check2(i))
{
c += 1;
}
}
cout << n - c << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------
int N;
ll A[202020];
const ll mo=998244353;
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>N;
FOR(i,N) cin>>A[i];
sort(A,A+N);
ll ret=0;
ll sum=0;
FOR(i,N) {
(ret=ret+(sum+A[i])*A[i])%=mo;
sum=(sum*2+A[i])%mo;
}
cout<<ret<<endl;
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// ascii value of ('0'-'9') is(48 - 57) and (a-z) is (97-122) and (A-Z) is(65-90) and 32 for space
#define int long long
#define endl "\n"
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
// use error(args..)
const long long INF=1e18;
const int32_t MOD=1e9+7;
const int32_t MM=998244353;
const int N=2e7+5;
void solve() {
int n;
cin>>n;
vector <int> v(n);
int sum = 0;
for(int i=0; i<n; i++)
{
cin>>v[i];
sum += v[i];
}
vector <bool> dp(sum + 1);
dp[0] = true;
int ans = 1e18;
for(int i=0; i<n; i++)
{
for(int j = sum; j>= v[i]; j--)
dp[j] = dp[j] | dp[j - v[i]];
}
for(int i = 0; i<=sum; i++)
{
//cout<<i<<" "<<dp[i]<<endl;
if(dp[i])
{
ans = min(ans, max(i, sum-i));
}
}
cout<<ans<<endl;
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("inp.txt", "r", stdin);
freopen("newop.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
while(t--)
solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct Matrix{
vector<vector<ll>> M;
Matrix(int H,int W):M(H,vector<ll>(W,0)){}
Matrix(int H,int W,ll init):M(H,vector<ll>(W,init)){}
void assign(int H,int W,ll init) { M.assign(H,vector<ll>(W,init)); }
void build_E(){
int h=M.size();
int w=M[0].size();
assign(h,w,0);
for(int i=0;i<h&&i<w;i++){
M[i][i]=1;
}
}
// note:for 2D
void build_rotR(){
int h=M.size();
int w=M[0].size();
assign(h,w,0);
M[0][0]=0;
M[0][1]=1;
M[1][0]=-1;
M[1][1]=0;
}
// note:for 2D
void build_rotL(){
int h=M.size();
int w=M[0].size();
assign(h,w,0);
M[0][0]=0;
M[0][1]=-1;
M[1][0]=1;
M[1][1]=0;
}
Matrix operator*(Matrix a){
int h1=M.size();
int w1=M[0].size();
int w2=a.M[0].size();
Matrix res(h1,w2);
for(int i=0;i<h1;i++){
for(int j=0;j<w2;j++){
for(int k=0;k<w1;k++){
res[i][j]+=M[i][k]*a[k][j];
}
}
}
return res;
}
vector<ll>& operator[](int i){ return M[i]; }
};
int main(){
int n;
cin>>n;
vector<Matrix> ms(n,Matrix(3,1));
for(auto &m:ms){
cin>>m[0][0]>>m[1][0];
m[2][0]=1;
}
int m;
cin>>m;
const Matrix dim3(3,3,0);
vector<Matrix> accum_m(m+1,dim3);
accum_m[0].build_E();
Matrix rotL(dim3);
rotL.build_rotL();
rotL[2][2]=1;
Matrix rotR(dim3);
rotR.build_rotR();
rotR[2][2]=1;
Matrix mx(dim3);
mx.build_E();
mx[0][0]=-1;
Matrix my(dim3);
my.build_E();
my[1][1]=-1;
for(int i=0;i<m;i++){
int op,p;
cin>>op;
switch(op){
case 1:
accum_m[i+1]=rotR*accum_m[i];
break;
case 2:
accum_m[i+1]=rotL*accum_m[i];
break;
case 3:
cin>>p;
mx[0][2]=2*p;
accum_m[i+1]=mx*accum_m[i];
break;
case 4:
cin>>p;
my[1][2]=2*p;
accum_m[i+1]=my*accum_m[i];
break;
}
}
int q;
cin>>q;
for(int i=0;i<q;i++){
ll a,b;
cin>>a>>b;
b--;
Matrix ans=accum_m[a]*ms[b];
cout<<ans[0][0]<<' '<<ans[1][0]<<'\n';
}
} | //#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <bitset>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cassert>
#include <random>
using namespace std;
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
solve();
}
#define int long long
const int N = 5e5 + 100, K = 3e5, A = 2e5 + 100, MOD = 1e9 + 7, base = 131, INF = 1e18;
int n, q, c[N], p[N], ans[N], sum;
vector < int > a[N];
vector < pair < int, int > > b;
void dfs(int v, int pp) {
p[v] = pp;
for (int i = 0; i < a[v].size(); i++) {
int to = a[v][i];
if (to == pp) continue;
dfs(to, v);
}
}
void dfs1(int v) {
sum += c[v];
ans[v] = sum;
for (int i = 0; i < a[v].size(); i++) {
int to = a[v][i];
if (to == p[v]) continue;
dfs1(to);
}
sum -= c[v];
}
void solve() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
int f, s;
cin >> f >> s;
f--, s--;
a[f].push_back(s);
a[s].push_back(f);
b.push_back({f, s});
}
dfs(0, -1);
cin >> q;
while (q--) {
int t, e, x;
cin >> t >> e >> x;
e--;
if (t == 1) {
int f = b[e].first, s = b[e].second;
if (p[f] == s) {
c[f] += x;
} else {
c[0] += x;
c[s] -= x;
}
} else {
int f = b[e].first, s = b[e].second;
if (p[s] == f) {
c[s] += x;
} else {
c[0] += x;
c[f] -= x;
}
}
}
dfs1(0);
for (int i = 0; i < n; i++) {
cout << ans[i] << '\n';
}
}
|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
// clang-format off
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
#define Endl endl
#define itn int
#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 = (int)(a), i##_len=(b); i < i##_len; i++)
#define rep3(i, a, b) for (int i = (int)(a), i##_len=(b); i >= i##_len; i--)
#define FOR(i, a) for (auto &i: a)
#define ALL(obj) begin(obj), end(obj)
#define _max(x) *max_element(ALL(x))
#define _min(x) *min_element(ALL(x))
#define _sum(x) accumulate(ALL(x), 0LL)
#define LOWER_BOUND(A, key) distance(begin(A), lower_bound(ALL(A), key))
#define UPPER_BOUND(A, key) distance(begin(A), upper_bound(ALL(A), key))
const int MOD = 1000000007;
// const int MOD = 998244353;
const int INF = (int)(1e13 + 7);
const double EPS = 1e-8;
const double PI = 3.14159265358979;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
template <class T> using VVV = vector<vector<vector<T>>>;
template <class T, class S> using P = pair<T, S>;
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}
int _ceil(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
int _mod(int &a) {a = a >= 0 ? a % MOD : a - (MOD * _ceil(a, MOD));return a;}
int _pow(int a, int b) {int res = 1;for (a %= MOD; b; a = a * a % MOD, b >>= 1)if (b & 1) res = res * a % MOD;return res;}
struct mint {long long x;mint(long long 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;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) { (x *= a.x) %= MOD;return *this; }mint operator+(const mint a) const { return mint(*this) += a; }mint operator-(const mint a) const { return mint(*this) -= a; } mint operator*(const mint a) const { return mint(*this) *= a; }mint pow(long long t) const {if (!t) return 1;mint a = pow(t >> 1);a *= a;if (t & 1) a *= *this;return a;}mint inv() const { return pow(MOD - 2); }mint &operator/=(const mint a) { return *this *= a.inv(); }mint operator/(const mint a) const { return mint(*this) /= a; }};istream &operator>>(istream &is, mint &a) { return is >> a.x; }ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// clang-format on
class ABrick {
public:
static void solve(istream &cin, ostream &cout) {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int N, W;
cin >> N >> W;
cout << N / W << endl;
}
};
signed main() {
ABrick solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| #pragma GCC optimize("O3") //
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;
typedef unsigned long long ull;
unsigned seed = chrono::system_clock::now().time_since_epoch().count();
mt19937 eng(seed);
ll random2(){
return (1ll << 31ll)*eng()+eng();
}
ll n,m,k,q,T;
const ll big = 1000000007;
const ll big2 = 1000000009;
const ll mod = 998244353;
const int MAXN = 400001;
vi P,PI;
vi moves;
void mov(int i){
assert(i%2 == sz(moves)%2);
assert(i < n-1);
swap(P[i], P[i+1]);
PI[P[i]] = i;
PI[P[i+1]] = i+1;
/*
cerr << i+1 << " d\n";
rep(c1,0,n){
cerr << P[c1]+1 << " ";
}cerr << "\n";
*/
moves.push_back(i+1);
}
void solve(int i){
if(PI[i] == i)return;
// cerr << PI[i]+1 << " fds\n";
if(PI[i]%2 != sz(moves)%2){
while(PI[i] != i){
mov(PI[i]-1);
}
return;
}
int j = PI[i];
if(j < n-3){
mov(j+2);
solve(i);
return;
}
if(j > i+1){
mov(j-2);
solve(i);
return;
}
if(j >= 2 && j-1 == i){
mov(j-2);
mov(j-1);
mov(j-2);
mov(j-1);
mov(j-2);
//mov(j-1);
solve(i);
return;
}
mov(j);
solve(i);
return;
}
bool srt(){
rep(c1,0,n-1){
if(P[c1] > P[c1+1])return 0;
}
return 1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen("fhc.txt","r",stdin);
//freopen("autput.txt","w",stdout);
ll a,b,c,d,e;
cin >> T;
rep(c4,0,T){
cin >> n;
P.clear();
PI.clear();
moves.clear();
rep(c1,0,n){
cin >> a;
a--;
P.push_back(a);
PI.push_back(1);
}
rep(c1,0,n){
PI[P[c1]] = c1;
}
rep(c1,0,n){
solve(c1);
}
if(sz(moves) > n*n){
cerr << "ERROR: " << sz(moves) << " moves for n=" << n << "\n";
}
if(!srt()){
cerr << "ERROR: not sorted n=" << n << "\n";
}
cout << sz(moves) << "\n";
trav(y, moves){
cout << y << " ";
}cout << "\n";
}
return 0;
}
|
/*
This C++ Source Is
Writen By syksykCCC
(2020)
*/
#include <bits/stdc++.h>
#define rep(i, x, y) for(register int i = x; i < y; i++)
#define REP(i, x, y) for(register int i = x; i <= y; i++)
#define per(i, x, y) for(register int i = x; i > y; i--)
#define PER(i, x, y) for(register int i = x; i >= y; i--)
#define repl(i, x, y) for(register long long i = x; i < y; i++)
#define REPL(i, x, y) for(register long long i = x; i <= y; i++)
#define perl(i, x, y) for(register long long i = x; i > y; i--)
#define PERL(i, x, y) for(register long long i = x; i >= y; i--)
#define LLL __int128
#define int128 __int128
#define DEBUG(x) cerr << #x << " : " << x << endl
using namespace std;
typedef unsigned int uint;
typedef long long int64;
typedef long long LL;
typedef unsigned long long uint64;
typedef unsigned long long ULL;
typedef long double LLF;
inline void NO() { cout << "NO\n"; }
inline void YES() { cout << "YES\n"; }
inline void NEG() { cout << "-1\n"; }
template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return a > b ? a = b, true : false; }
template<typename T> inline void read(T &val)
{
val = 0; char c = getchar(); int f = 1;
while(!isdigit(c)) { if(c == '-') f = -1; c = getchar(); }
while(isdigit(c)) { val = (val << 3) + (val << 1) + (c ^ 48); c = getchar(); }
val *= f;
}
template<typename T> void write_(T val) { if(!val) return; write_(val / 10); putchar(val % 10 + 48); }
template<typename T> inline void write(T val)
{
if(val == 0) putchar(48);
else if(val < 0) { putchar('-'); write_(-val); }
else write_(val);
}
#define int long long
const int MOD = 1e9 + 7;
int T, N, A, B;
signed main()
{
#ifdef LOCAL
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
// ios::sync_with_stdio(false);
read(T);
while(T--)
{
read(N); read(A); read(B);
if(A + B > N)
{
puts("0");
continue;
}
int x = N - A - B + 2;
printf("%lld\n", (2LL * x * (x - 1) % MOD * (N - A + 1) % MOD * (N - B + 1) % MOD
- (x * (x - 1) % MOD * x % MOD * (x - 1) % MOD) + MOD) % MOD);
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
//infの設定
#define INF32 2147483647
#define INF64 9223372036854775807
#define PRIME (ll)1000000007
#define PI 3.141592653589793238
//repマクロ
#define rep(i,m,n) for (int i=(m); (i)<(int)(n); ++(i))
#define rrep(i,m,n) for (int i=(m); (i)>(int)(n); --(i))
//その他
#define eb emplace_back
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<long long,long long> Pl;
//#define int long long
//Combinatonを巨大素数で割った余りを出力するやーつ)
vector<ll> fac(5050505,INF64),finv(5050505,INF64),inv(5050505,INF64);
ll MOD=1000000007;
void cprimeInit(ll n){
fac.at(0)=fac.at(1)=1;
finv.at(0)=finv.at(1)=1;
inv.at(1)=1;
for(ll i=2;i<n+1;i++){
fac.at(i)=fac.at(i-1)*i%MOD;
inv.at(i)=MOD-inv.at(MOD%i)*(MOD/i)%MOD;
finv.at(i)=finv.at(i-1)*inv.at(i)%MOD;
}
}
long long cprime(ll n,ll k){
if(n<k) return 0;
if(n<0||k<0) return 0;
return fac.at(n)*(finv.at(k)*finv.at(n-k)%MOD)%MOD;
}
int main(){
ll N,M,K; cin>>N>>M>>K;
ll ans=0;
if(N-K>M){
ans=0;
}else{
cprimeInit(2020202);
ans=cprime(N+M,N)-cprime(N+M,N-K-1);
}
cout<<(ans+PRIME)%PRIME<<endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
#define P 1000000007
#define rep(i,n) for(i=0;i<n;++i)
#define re(i,a,n) for(i=a;i<=n;++i)
#define repr(i,a,n) for(i=a;i>=n;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ub(v,val) upper_bound(v.begin(),v.end(),val)
#define np(str) next_permutation(str.begin(),str.end())
#define lb(v,val) lower_bound(v.begin(),v.end(),val)
#define sortv(vec) sort(vec.begin(),vec.end())
#define rev(p) reverse(p.begin(),p.end());
#define mset(a,val) memset(a,val,sizeof(a));
#define at(s,pos) *(s.find_by_order(pos))
#define set_ind(s,val) s.order_of_key(val)
#define PI 3.14159265
#define block_size ((ll)sqrt(3e5) + 1)
/*#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
// Important header files
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
const int maxn = 1<<18 ;
ll dp[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t,i,j,l,r,f,e,x,y,mid,z,w,k,d,c,n,a,b,m;
ll t1,t2,t3,ans=0,tc ;
t=1;
cin >> n >> m ;
vector<pair<ll,pair<ll,ll>>> co(m);
rep(i,m)
{
cin >> co[i].fi >> co[i].se.fi >> co[i].se.se ;
}
sortv(co);
x=1<<n;
mset(dp,0);
dp[0]=1;
re(i,0,x-2)
{
ll mx=0;
//cout << i << endl ;
f=0;
rep(j,m)
{
t1=0;
t2=__builtin_popcount(i);
if(t2>=co[j].fi) continue;
rep(k,n)
{
y=1<<k;
if((y&i)!=0)
{
//cout << k << " " ;
if(k<co[j].se.fi) t1++;
}
}
if(t1==co[j].se.se) mx=max(mx,co[j].se.fi);
if(t1>co[j].se.se) f=1;
}
//cout << endl ;
//cout << i << " " ;
//cout << mx << endl ;
if(f) continue;
for(j=mx;j<n;++j)
{
y=1<<j;
//cout << j << endl ;
if(y&i) continue;
dp[i|y]+=dp[i];
}
}
//rep(i,x) cout << dp[i] << " " ;
cout << dp[x-1] << endl ;
return 0;
} | #include "bits/stdc++.h"
#include<sstream>
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const long long inf = 1e18;
const ll INFL = 1e18;
const ll MOD = 1e9 + 7;
int digit(ll x) {
int digits = 0;
while(x > 0){
x /= 10;
digits++;
}
return digits;
}
ll gcd(long long a,long long b) {
if (a < b) swap(a,b);
if (b == 0) return a;
return gcd(b,a%b);
}
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;
}
ll lcm(ll a,ll b){
return ((a * b == 0)) ? 0 : (a / gcd(a,b) * b);
}
double DegreeToRadian(double degree){
return degree * M_PI / 180.0;
}
long long modpow(long long a, long long b, long long m){
long long ans = 1;
while(b > 0){
if (b % 2 == 1){
ans *= a;
ans %= m;
}
a *= a;
a %= m;
b /= 2;
}
return ans;
}
long long comb(long long x, long long y){
int z;
if (y == 0) return 1;
else {
z = modpow(x, y/2, MOD)*modpow(x, y/2, MOD)%MOD;
if (y % 2 == 1) z = z*x%MOD;
return z;
}
}
vector<pair<long long, long long>> prime_fact(long long x){
vector<pair<long long, long long>> res;
for(int i = 2;i*i <= x;i++){
if (x % i == 0){
long long cnt = 0;
while(x % i == 0){
cnt++;
x /= i;
}
res.push_back({i, cnt});
}
}
if (x != 1){
res.push_back({x, 1});
}
return res;
}
int64_t mod_inv(int64_t a, int64_t m){
int64_t b = m, u = 1, v = 0;
while(b){
int64_t t = a/b;
a -= t*b;
swap(a, b);
u -= t*v;
swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
// {g, x, y}: ax + by = g
tuple<long long, long long, long long> extgcd(long long a, long long b){
if (b == 0) return {a, 1, 0};
long long g, x, y;
tie(g, x, y) = extgcd(b, a % b);
return {g, y, x - a/b*y};
}
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
//////////////////////////////////////////////////////////////
int main(){
int n,k;
cin >> n >> k;
for(int i = 0;i < k;i++){
string tmp = to_string(n);
sort(tmp.begin(), tmp.end());
int mini = stoi(tmp);
sort(tmp.begin(), tmp.end(), greater<>());
int mx = stoi(tmp);
n = mx - mini;
}
cout << n << endl;
} |
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cat(x) cerr << #x << " = " << x << endl
using ll = long long;
using namespace std;
const int MOD = 1e9 + 7;
ll bin_pow(ll a, ll b) {
ll c = 1;
while (b) {
if (b & 1) c = c * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return c;
}
int n, m, a, s;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> a;
s += a;
}
int x = n + m - 1 + 1;
int y = s + n - 1 + 1;
//~ cout << x << " " << y << endl;
if (x < y) {
cout << 0 << endl;
}
else {
ll res = 1;
for (int i = 1; i <= y; ++i)
res = res * bin_pow(i, MOD - 2) % MOD * (x - i + 1) % MOD;
cout << res << endl;
}
return 0;
}
| #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
#include<math.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,n) for(ll i=1;i<=n;i++)
#define ALLOF(c) (c).begin(), (c).end()
#define Pa pair<ll,ll>
const ll mod=1000000007;
const ll modq=998244353;
const ll INF=1e12;
const ll inf=-1;
ll ABS(ll a){return max(a,-a);}
ll modpow(ll a,ll n) {
ll res = 1;
while (n>0) {
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
// a^{-1} mod を計算する
ll modinv(ll a) {
return modpow(a, mod - 2);
}
ll nCk(ll n,ll k){
ll nck=1;
rep(i,k){
nck=(nck*(n-i))%mod;
nck=(nck*modinv(k-i))%mod;
}
return nck;
}
int main(void){
ll N,M,Asum=0;
cin>>N>>M;
rep(i,N){
ll A;
cin>>A;
Asum+=A;
}
if(M<Asum){
cout<<0<<endl;
return 0;
}
cout<<nCk(M+N,N+Asum)<<endl;
return 0;
} |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define real long double
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pi M_PI
#define elif else if
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const int INF = 2e18, MOD = 998244353, RANDOM = chrono::steady_clock::now().time_since_epoch().count();
const real EPS = 1e-12;
mt19937 rng(RANDOM);
struct chash {
int operator() (int x) const { return (x ^ RANDOM) % MOD; }
};
int n;
vector<vector<int>> people;
vector<int> ind;
vector<pair<int, int>> answer;
int search(){
int cnt = 0;
for (int i=0; i<n - 1; ++i){
if (people[i][2] == people[i][3]) continue;
if (people[i][1] >= people[i][0]) return -1;
int j = ind[people[i][3]];
if (people[j][1] >= people[j][0]) return -1;
ind[people[i][2]] = j;
ind[people[i][3]] = people[i][3];
swap(people[i][1], people[j][1]);
swap(people[i][2], people[j][2]);
answer.push_back({people[i][3], people[j][3]});
++cnt;
}
return cnt;
}
void debug(){
cerr << "\n";
cerr << "\n";
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
// cout.precision(6);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n;
people.assign(n, vector<int>(4, 0));
ind.assign(n, 0);
vector<int> b(n);
for (int i=0; i<n; ++i) cin >> people[i][0];
for (int i=0; i<n; ++i) cin >> b[i];
for (int i=0; i<n; ++i){
cin >> people[i][2];
--people[i][2];
people[i][1] = b[people[i][2]];
people[i][3] = i;
}
sort(all(people));
for (int i=0; i<n; ++i) ind[people[i][2]] = i;
int res = search();
cout << res << "\n";
if (res != -1) for (auto i: answer) cout << i.f + 1 << " " << i.s + 1 << "\n";
} | #include<bits/stdc++.h>
using namespace std;
int n,a[200100],b[200100],p[200100],q[200100];
pair<int,int> pa[200100];
vector<pair<int,int> > vec;
int main(){
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],pa[i]=make_pair(a[i],i);
for(int i=1;i<=n;i++) cin>>b[i];
for(int i=1;i<=n;i++) cin>>p[i],q[p[i]]=i;
for(int i=1;i<=n;i++) if(a[i]<=b[p[i]]&&p[i]!=i){
cout<<-1<<endl;
return 0;
}
sort(pa+1,pa+n+1);
int res=0;
for(int ii=1;ii<=n;ii++){
int i=pa[ii].second;
if(p[i]==i) continue;
res++;
int j=q[i];
q[p[i]]=j;q[i]=i;
p[j]=p[i];p[i]=i;
vec.push_back(make_pair(i,j));
}
cout<<res<<endl;
for(int i=0;i<res;i++) cout<<vec[i].first<<' '<<vec[i].second<<endl;
return 0;
}
|
#include <math.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;
const ll INF_ll = 1e17;
const int INF = 1e8;
int main() {
int N;
cin >> N;
if (N >= 0) {
cout << N << endl;
} else {
cout << 0 << endl;
}
return 0;
} | /*
* @author : ashnove
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl;
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
//#define mod 100000007
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return vector< vector<ll> >(n, vector<ll>(m));}
bool compare(char &s1,char &s2){return s1 > s2;}
bool sortmahstyle(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
if(a.first < b.first )
return true;
if( a.first==b.first && a.S != b.second )
return true;
return false;
}
//me
ll const mod = 998244353;
ll const inf = 1e18;
ll const maxn = 1e5+1;
void solve()
{
ll x; cin >> x;
cout << (x>=0?x:0);
}
int main() {
Knucklehead
//*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
/**/
ll t;
/**/t=1;
/*/cin>>t;/**/
f(testcases,0,t){
//cout << "Case #" <<testcases+1<<": ";
solve();
}
return 0;
} |
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
using namespace std;
const int N = 200000;
int aa[N << 1], bb[N], ii[N << 1];
long long dd[N << 1];
int main() {
int n; cin >> n;
long long b_; cin >> b_;
for (int i = 0; i < n; i++)
cin >> aa[i << 1 | 0] >> aa[i << 1 | 1] >> bb[i], aa[i << 1 | 1]++;
for (int h = 0; h < n << 1; h++)
ii[h] = h;
sort(ii, ii + (n << 1), [] (int i, int j) { return aa[i] < aa[j]; });
map<int, int> mp;
int a_ = 0;
for (int h = 0; h < n << 1; h++) {
int a = aa[ii[h]];
mp[a] = h + 1 == n << 1 || aa[ii[h + 1]] != a ? a_++ : a_;
}
for (int i = 0; i < n; i++)
dd[mp[aa[i << 1 | 0]]] += bb[i], dd[mp[aa[i << 1 | 1]]] -= bb[i];
for (int a = 1; a < a_; a++)
dd[a] += dd[a - 1];
set<int> s;
for (int i = 0; i < n << 1; i++)
s.insert(aa[i]);
long long ans = 0;
while (s.size() >= 2) {
int a = *s.begin(); s.erase(s.begin());
int b = *s.begin();
ans += min(dd[mp[a]], b_) * (b - a);
}
ans += min(dd[mp[*s.begin()]], b_);
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second
using namespace std;
typedef long long ll;
int a[200005], b[200005];
pair <int, int> masA[200005], masB[200005];
int perm[200005], fen[200005];
int f(int x)
{
return (x & (-x));
}
int get_sum(int pos, int n)
{
int s = 0;
for (int i = pos; i <= n; i += f(i)) s += fen[i];
return s;
}
void update(int pos, int n)
{
for (int i = pos; i > 0; i -= f(i)) fen[i]++;
return;
}
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
masA[i] = mp(a[i] + i, i);
}
for (int i = 1; i <= n; i++)
{
cin >> b[i];
masB[i] = mp(b[i] + i, i);
}
sort(masA + 1, masA + n + 1);
sort(masB + 1, masB + n + 1);
bool fl = true;
for (int i = 1; i <= n; i++)
if (masA[i].x != masB[i].x) fl = false;
if (!fl) cout << "-1\n", exit(0);
for (int i = 1; i <= n; i++) perm[masA[i].y] = masB[i].y;
ll ans = 0;
for (int i = 1; i <= n; i++)
{
ans += get_sum(perm[i], n);
update(perm[i], n);
}
cout << ans << '\n';
return 0;
} |
/*** keep hungry and calm CoolGuang! ***/
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#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 d(x) printf("%lld\n",x);
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll INF= 1e18;
const ll maxn = 4e5+700;
const int mod= 1e9+7;
const int up = 1e9;
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
ll n,m,p;
ll dp[1005][1005];
ll a[maxn],b[maxn];
int main(){
read(n);read(m);
for(int i=1;i<=n;i++) read(a[i]);
for(int i=1;i<=m;i++) read(b[i]);
for(int i=1;i<=n;i++)
for(int k=1;k<=m;k++)
dp[i][k] = INF;
dp[0][0] = 0;
for(int i=1;i<=n;i++) dp[i][0] = i;
for(int k=1;k<=m;k++) dp[0][k] = k;
for(int i=1;i<=n;i++){
for(int k=1;k<=m;k++){
dp[i][k] = min(dp[i-1][k]+1,dp[i][k-1]+1);
dp[i][k] = min(dp[i][k],dp[i-1][k-1]+(a[i]!=b[k]));
}
}
/*for(int i=1;i<=n;i++){
for(int k=1;k<=m;k++){
printf("%lld ",dp[i][k]);
}
printf("\n");
}*/
ll ans = INF;
for(int i=0;i<=n;i++){
for(int k=0;k<=m;k++){
ans = min(ans,dp[i][k] + n-i + m-k);
}
}
printf("%lld\n",ans);
return 0;
}
/***
2 4
2 3
1 1 2 3
***/
| #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0;i < (n);i++)
template<typename T>
void chmin(T & a, const T & b) { a = min(a, b); }
vector<vector<ll>> dp;
int main() {
const int INF = 1001001001;
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
rep(i, n) cin >> a[i];
rep(j, m) cin >> b[j];
dp = vector<vector<ll>>(n + 1, vector<ll>(m + 1, INF));
dp[0][0] = 0;
rep(i, n + 1) rep(j, m + 1) {
if (i < n) chmin(dp[i + 1][j], dp[i][j] + 1);
if (j < m) chmin(dp[i][j + 1], dp[i][j] + 1);
if (i < n && j < m) {
int co = 0;
if (a[i] != b[j]) co = 1;
chmin(dp[i + 1][j + 1], dp[i][j] + co);
}
}
cout << dp[n][m] << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, s[N], e[N], tim = 1;
vector<int> adj[N];
vector<int> lvl[N];
int cnt(int idx, int l, int r)
{
return upper_bound(lvl[idx].begin(), lvl[idx].end(), r) - lower_bound(lvl[idx].begin(), lvl[idx].end(), l);
}
void dfs(int u = 1, int l = 0)
{
s[u] = tim;
lvl[l].push_back(s[u]);
for (int v: adj[u])
{
tim ++;
dfs(v, l + 1);
}
e[u] = tim;
}
int main(int argc, char const *argv[])
{
cin >> n;
for (int i = 2; i <= n; ++i)
{
int p;
cin >> p;
adj[p].push_back(i);
}
dfs();
int q;
cin >> q;
while (q --)
{
int u, v;
cin >> u >> v;
cout << cnt(v, s[u], e[u]) << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using iPair = pair<int,int>;
using lPair = pair<ll, ll>;
using ivector = vector<int>;
using lvector = vector<long>;
using ivv = vector<vector<int>>;
using lvv = vector<vector<ll>>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
#define dump(x) cout << #x << " = " << (x) << endl
#define ALL(x) begin(x),end(x)
#define rep(i,s,e) for(ll i=(s); i<(ll)(e); ++i)
#define repRev(i,s,e) for(ll i=(e-1); i>=(ll)(s); --i)
#define range(i,s,n) for(ll i=(s), i_stop=(s)+(n); i<i_stop; ++i)
#define rangeRev(i,s,n) for(ll i=(s), i_stop=(s)-(n); i>i_stop; --i)
#define foreach(x,container) for(auto &&x:container)
template<typename T> bool chmax(T& a, const T b) {if(a<b) {a=b;return true;} return false;}
template<typename T> bool chmin(T& a, const T b) {if(a>b) {a=b;return true;} return false;}
template<typename T> void printArr(vector<T> &arr){
for(auto &x:arr) {cout << x << " ";} cout << endl;
}
/*
https://atcoder.jp/contests/abc202/tasks/abc202_e
## 關鍵詞：
## 題意：
一個由N <= 2e5個節點組成的樹。樹根爲頂點1。
給出以下Q <= 2e5個問題：
給定U_i, D_i，求所有深度爲D_i且到達根節點的最短路徑包含U_i的節點數量。
## 思路：
本來的思路：用一個集合記錄每個節點的最短路徑上的頂點，但這樣一定會超時……
https://atcoder.jp/contests/abc202/editorial/1864
用DFS從根節點遍歷整棵樹，同時記錄每個頂點進入和退出的順序，in_i和out_i。
「x到root最短路徑包含y」 a.k.a 「x是y的子孫」的充分必要條件是：
「in_y <= in_x <= out_x <= out_y」，實際上只需要關注in_x即可。
用一個數組按照深度保存節點，並且按照in的順序從小到大排序。
實際求數量只需做兩次二分。
## 雜多：
1. 學到了如何用O(N)的預處理來在O(1)時間內解「x是否是y的祖先」這個問題。
2. 根據題解的思路，
*/
void solve(){
int n;
#define maxn 200005
int in[maxn], out[maxn], depth[maxn]={0};
ivector son[maxn];
ivector dvector[maxn]; dvector[0] = {1};
// 讀取
cin>>n;
range(i,2,n-1) {
int p; cin>>p; son[p].push_back(i);
}
// dfs遍歷
auto dfs = [&](auto self, int ith, int &cnt) -> void {
in[ith] = cnt++;
foreach(v,son[ith]) {
depth[v] = depth[ith] + 1;
dvector[depth[v]].push_back(v);
self(self, v, cnt);
}
out[ith] = cnt++;
};
int cnt = 0;
dfs(dfs, 1, cnt);
// 對所有dvector[i]按照in的順序排序
range(i,0,maxn) {
sort(ALL(dvector[i]), [&](const int &a, const int &b) {
return in[a] < in[b];
});
}
// 在[l,r)範圍內，尋找是check成立的最小下標
auto lower = [&](int l, int r, auto check) -> int {
while(l<r) {
int m = l + (r-l) / 2;
if(!check(m)) l = m+1;
else r = m;
}
return l;
};
// 在[l,r)範圍內，尋找是check不成立的最小下標
auto upper = [&](int l, int r, auto check) -> int {
while(l<r) {
int m = l + (r-l) / 2;
if(check(m)) l = m+1;
else r = m;
}
return l;
};
int q; cin>>q;
while(q--) {
int u,d; cin>>u>>d;
if(depth[u]>d) {cout<<0<<endl; continue;}
// 在x \in dvector[d]當中，尋找所有滿足 in[u] <= in[x] <= out[u]的節點
auto pl = lower(0, dvector[d].size(), [&](int ith) {
return in[dvector[d][ith]] >= in[u];
});
auto pr = upper(0, dvector[d].size(), [&](int ith) {
return in[dvector[d][ith]] <= out[u];
});
cout<<pr-pl<<endl;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
bool check(string iStr,string jStr){
bool retval = false;
for(int i=0;i<iStr.length();i++){
//std::cout << iStr[i] << " " << jStr[i] << endl;
if(iStr[i] != jStr[i])
retval = ! retval;
}
return retval;
}
int main(void)
{
int64_t N;
cin >> N;
int64_t M;
cin >> M;
vector<string> S(N);
for(int i = 0; i < N; i++){
cin >> S[i];
}
vector<bool> checkVal(N);
int64_t checkCount = 0;
for(int i=1;i<N;i++){
if(check(S[0],S[i])){
checkVal[i] = true;
checkCount++;
}
else{
checkVal[i] = false;
}
}
// for(int i=1;i<N;i++){
// std::cout << "check :" << checkVal[i] << endl;
// }
int64_t ans = 0;
ans += checkCount;
for(int i=1;i<N;i++){
if(checkVal[i]== false){
ans += checkCount;
}else{
checkCount--;
int tmp = N-i-1-checkCount;
ans += tmp;
//std::cout << " tmp :" << tmp << " N :" << N << " i :" << i << " checkCount :" << checkCount<< endl;
}
//std::cout << ans << endl;
}
std::cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define N 2010
#define pp pair<int,int>
#define ppp pair<pp,int>
#define M 26
#define fi first
#define si second
using namespace std;
int n, m, x, y, u, v, l;
char dp[N][N];
bool vis[N][N];
queue<ppp>q;
vector<pp>g[M];
ppp tmp;
int s[4][2] = {{ -1, 0}, {1, 0}, {0, -1}, {0, 1}};
bool isValid(int x, int y) {
return (x >= 0 && y >= 0 && x < n && y < m && dp[x][y] != '#');
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout.precision(10);
cin >> n >> m;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
cin >> dp[i][j];
if (dp[i][j] == 'S') {
vis[i][j] = true;
q.push(make_pair(make_pair(i, j), 0));
}
if (dp[i][j] >= 'a' && dp[i][j] <= 'z') {
g[dp[i][j] - 'a'].push_back(make_pair(i, j));
}
}
while (!q.empty()) {
tmp = q.front();
q.pop();
l = tmp.si;
u = tmp.fi.fi;
v = tmp.fi.si;
if (dp[u][v] == 'G') {
cout << l << endl;
return 0;
}
if (dp[u][v] >= 'a' && dp[u][v] <= 'z') {
for (int i = 0; i < g[dp[u][v] - 'a'].size(); i++) {
x = g[dp[u][v] - 'a'][i].fi;
y = g[dp[u][v] - 'a'][i].si;
if (!vis[x][y]) {
if (dp[x][y] == 'G') {
cout << l + 1 << endl;
return 0;
}
q.push(make_pair(make_pair(x, y), l + 1));
vis[x][y] = true;
}
}
}
for (int i = 0; i < 4; i++) {
x = s[i][0] + u;
y = s[i][1] + v;
if (isValid(x, y) && !vis[x][y]) {
if (dp[x][y] == 'G') {
cout << l + 1 << endl;
return 0;
}
q.push(make_pair(make_pair(x, y), l + 1));
vis[x][y] = true;
}
}
}
cout << -1 << endl;
return 0;
} |
#define _CRT_SECURE_NO_WARNINGS
#include <initializer_list>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <time.h>
#include <limits.h>
#define rep(unt) for (int i = 0; i < unt; ++i)
#define each(var, st) for (auto var : st)
#define all(x) (x).begin(), (x).end()
#define mp(a, b) make_pair((a), (b))
#define pii pair<int, int>
#define pb push_back
#define ins insert
#define db double
#define ldb long double
#define pll pair<long long, long long>
#define ci const int
#define ll long long
#define INF 1000000007
#define LLINF 1000000000000000007
#define rt return
using namespace std;
mt19937 rng(time(0));
uniform_int_distribution<int> uid(-INF, INF);
#define int long long
struct v3 {
int x=0,y=0,z=0;
v3(int x, int y, int z): x(x), y(y), z(z) {}
};
void solve(bool debug=false) {
int res = 0;
int n, k; cin >> n >> k;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
res += i * 100 + j;
}
}
cout << res;
}
template <size_t SZ, class T>inline void clear1dArray(T(&st)[SZ],T fillValue)
{rep(SZ)st[i]=fillValue;}
template<size_t SZn,size_t SZm,class T>inline void clear2dArray(T(&st)[SZn][SZm],T fillValue)
{rep(SZn)for(int j=0;j<SZm;++j)st[i][j]=fillValue;}
void clear() {
}
signed main(signed argc,char* argv[]) {
if (argc==2&&strcmp(argv[1],"__DEBUG__")==0){
int t=0;cin>>t;
string ph;
getline(cin, ph);
for(int i=1; i<=t;++i){
cout << "Case #" << i << ":" << "\n";
solve(true);
cout << "\n";
clear();
}
}
else solve();
return 0;
} | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int N,M;
cin >> N >> M;
int sum = 0;
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
sum += i*100 + j;
}
}
cout << sum << endl;
}
|
/*
ID:ACwisher
LANG:C++
TASK:
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=200010;
int n,x[N],y[N],fa[N<<1],e[N<<1],sum[N<<1],sumn[N<<1];
bool vis[N<<1];
int find(int x){ return (x==fa[x])?x:fa[x]=find(fa[x]); }
void merge(int x,int y){ x=find(x); y=find(y); if(x!=y) fa[x]=y; }
int main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdiout);
scanf("%d",&n);
for(int i=1;i<=400000;i++) fa[i]=i;
for(int i=1;i<=n;i++){
scanf("%d%d",&x[i],&y[i]);
merge(x[i],y[i]); vis[x[i]]=vis[y[i]]=1;
}
for(int i=1;i<=400000;i++)
e[i]=find(i),sumn[e[i]]++;
for(int i=1;i<=n;i++) sum[e[x[i]]]++;
int ans=0;
for(int i=1;i<=400000;i++)
if(vis[i]&&e[i]==i)
ans+=min(sum[i],sumn[i]);
printf("%d\n",ans);
return 0;
}
| #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define lc(x) ((x)<<1)
#define rc(x) (((x)<<1)|1)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
const ll LINF=1e18;
const ll MOD=1e9+7;
const int INF=0x3f3f3f3f;
const int MAXN=400050;
int a[MAXN],b[MAXN],fa[MAXN],cyc[MAXN];
int find(int x){
return fa[x]==x?x:(fa[x]=find(fa[x]));
}
void merge(int x,int y){
int fax=find(x),fay=find(y);
fa[fay]=fax;
}
void solve(int T){
int n;
scanf("%d",&n);
for(int i=1;i<MAXN;i++){
fa[i]=i;
cyc[i]=0;
}
int u,v,fau,fav;
int ans=0;
for(int i=1;i<=n;i++){
scanf("%d%d",&u,&v);
fau=find(u),fav=find(v);
if(fau==fav){
if(cyc[fau]==0){
cyc[fau]=1;
ans++;
}
}else if(cyc[fau]==0||cyc[fav]==0){
ans++;
fa[fav]=fau;
cyc[fau]|=cyc[fav];
}
}
printf("%d\n",ans);
}
signed main(){
//IOS;
int t=1;
//scanf("%d",&t);
for(int i=1;i<=t;i++){
solve(i);
}
} |
/**
* author: Anchord
* created: 11.12.2020
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long ans = 1;
for(long long i = 2; i <= n; ++i){
ans = (ans*i) / __gcd(ans, i);
}
ans++;
cout << ans << '\n';
return 0;
}
| #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
using ll = long long ;
#define rep(i,n) for (int i=0; i < (n); ++i)
const ll lim = 1e18 ;
ll gcd(ll x,ll y){
return y ? gcd(y,x%y) : x ;
}
ll lcm(ll x,ll y){
return x*y/gcd(x,y) ;
}
int main() {
ll n ;
cin >> n ;
ll ans ;
ans = 2 ;
for (ll i = 3; i <= n; i++)
{
ans = lcm(i,ans) ;
}
cout << ans + 1 << endl ;
return 0 ;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
vector<vector<ll>> calc_ncr(const int n){
vector<vector<ll>> ret(n+1, vector<ll>(n+1, 0));
for(int i=0; i<=n; ++i){
ret[i][0] = 1;
for(int j=1; j<i; ++j){
ret[i][j] = ret[i-1][j] + ret[i-1][j-1];
}
ret[i][i] = 1;
}
return ret;
}
ll solve_naive(const int n, const int m, const vector<int> &a){
const auto ncr = calc_ncr(m);
if(n==3){
ll ret = 0;
for(int b0=a[0]; b0<=m-2; ++b0){
for(int b1=a[1]; b0+b1<=m-1; ++b1){
for(int b2=a[2]; b0+b1+b2<=m; ++b2){
ret += ncr[b0][a[0]] * ncr[b1][a[1]] * ncr[b2][a[2]];
}
}
}
return ret;
}else{
return 0;
}
}
ll inv(ll a, ll b = MOD){
ll x0 = 1, y0 = 0, x1 = 0, y1 = 1;
while (b != 0) {
const ll q = a / b;
ll tmp = a % b;
a = b;
b = tmp;
tmp = x0 - q * x1;
x0 = x1;
x1 = tmp;
tmp = y0 - q * y1;
y0 = y1;
y1 = tmp;
}
return (x0 + MOD) % MOD;
}
vector<ll> calc_ncr_n(const ll n, const ll r_max){
vector<ll> ret(r_max+1);
ret[0] = 1;
for(ll r=1; r<=r_max; ++r){
ret[r] = ((ret[r-1] * (n - r + 1)) % MOD * inv(r)) % MOD;
}
return ret;
}
ll solve(const int n, const int m, const vector<int> &a){
ll sum_a = 0;
for(int i=0; i<n; ++i)sum_a += a[i];
const auto ncr = calc_ncr_n(m+n, sum_a+n+1);
return ncr[sum_a+n];
}
int main()
{
ll n, m;
cin >> n >> m;
vector<int> a(n);
for(int i=0; i<n; ++i)cin >> a[i];
//cout << solve_naive(n, m, a) << endl;
cout << solve(n, m, a) << endl;
} | #include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int Mod = 1e9+7;
int power(int a,int b){
if(b==0) return 1;
int temp = power(a,b/2)%Mod;
if(b%2==0){
return (temp*temp)%Mod;
}else{
return (a*((temp*temp)%Mod))%Mod;
}
}
int nCr(int n,int r){
if(r>n) return 0;
int num=1;
for(int i=n;i>=(n-r+1);i--){
num=(num*i)%Mod;
}
int den=1;
for(int i=1;i<=r;i++){
den=(den*i)%Mod;
}
return (num*power(den,Mod-2))%Mod;
}
signed main(){
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n,m;
cin>>n>>m;
int a[n];
int sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
if(sum>m){
cout<<0<<endl;
return 0;
}
int ans=1;
int options=1;
for(int i=0;i<n;i++){
if(a[i]==0){
options++;
continue;
}
for(int j=1;j<=a[i];j++){
if(j==a[i]){
options+=2;
}else{
options+=1;
}
}
}
ans = nCr(m-sum+options-1,options-1);
cout<<ans<<endl;
} |
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;
//n=1ならsecond
//n odd 先手はxorを0にしたい
//n even 先手はxor!=0にしたい
void solve(){
ll n;scanf("%lld", &n);
vector<ll> a(n);
re(i, n) scanf("%lld", &a[i]);
if(n%2==0){
sort(all(a));
bool f = true;
for(int i=0;i<n;i+=2){
if(a[i]!=a[i+1]){
f = false;
break;
}
}
//全要素偶数個
if(f){
std::cout << "Second" << '\n';
return;
}else{
std::cout << "First" << '\n';
return;
}
}else{
std::cout << "Second" << '\n';
return;
}
}
int main(){
ll T;std::cin >> T;
re(i, T) solve();
}
| // dont stop until you reach there
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define rep(i,j,k) for(int i=j;i<k;i+=1)
#define rrep(i,j,k) for(int i=n-1;i>=0;i-=1)
#define sorti(v) sort(v.begin(),v.end())
#define sortd(v) sort(v.begin(),v.end(),greater<int>())
#define mm map<int,int>
#define vv vector<int>
#define tmm map<int,map<int,int>>
#define trav(a, x) for(auto& a : x)
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(),v.end()
#define pb push_back
#define alot(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define code ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int MOD=1e9+7;
const double pi=acos(-1.0);
//memset(array_name,value_to_be_intialized,sizeof(array_name));
// __builtin_popcount(n) count no of set bit in number n
//next_permutation(s.begin(),s.end());
/*int change(string g){
int p=10;
int ans=g[g.length()-1]-'0';
for(int i=g.length()-2;i>=0;i--){
int j=g[i]-'0';
ans=p*ans+j;
}
return ans;
}
int binpow(int a,int b){
int res=1;
while(b>0){
if(b&1)res*=a;
a*=a;
b>>=1;
}
return res;
}
// lower_bound==> if the element is present it return its first occurence else 1st element which is greater than
// upper_bound==> it will always return iterator to element which is greater than searched element
*/
int32_t main ()
{
code;
int tt;
//cin>>tt;
tt=1;
while(tt--){
int n,m;
cin>>n>>m;
vv a;
vv b;
rep(i,0,n){
int p;
cin>>p;
a.pb(p);
}
rep(i,0,n){
int p;
cin>>p;
b.pb(p);
}
int sum1=0,sum2=0;
set<int>st;
rep(i,0,m){
int p,q;
cin>>p>>q;
p--;
q--;
st.insert(p);
st.insert(q);
}
trav(x,st){
sum1+=a[x];
sum2+=b[x];
}
if(m==0){
if(a==b)cout<<"Yes\n";
else cout<<"No\n";
}
else if(sum1==sum2)cout<<"Yes\n";
else cout<<"No\n";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define fastIO std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0)
#define Local
#ifdef Local
#define dbg(args...) do { cout << #args << " -> "; err(args); } while (0)
void err() { std::cout << std::endl; }
template<typename T, typename...Args>
void err(T a, Args...args) { std::cout << a << ' '; err(args...); }
template <template<typename...> class T, typename t, typename... A>
void err(const T <t> &arg, const A&... args) {
for (auto &v : arg) std::cout << v << ' '; err(args...); }
#else
#define dbg(...)
#endif
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
const ll mod = 1000000007;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
const int N = 100 + 10;
int n, a[N];
int main()
{
fastIO;
cin >> n;
rep (i,0,n) cin >> a[i];
int ans = 0, num = 0;
rep (i,2,1001) {
int cnt = 0;
rep (j,0,n) {
if (a[j] % i == 0) cnt++;
}
if (cnt > num) {
num = cnt;
ans = i;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORE(i,I) for(const auto &(i):(I))
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
#define INF32 2147483647
#define INF64 9223372036854775807
#define MOD 1000000007
#define PI acos(-1)
#define endl '\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(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n; cin >> n;
ll i = 1, ans = 0;
while(n > 0){
n -= i;
i++;
ans++;
}
cout << ans << endl;
return 0;
} |
#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
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
bool a[n];
memset(a, false, sizeof(a));
bool can = true;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
x--;
if (a[x]) can = false;
a[x] = true;
}
for (int i = 0; i < n; i++) {
if (!a[i]) can = false;
}
if (can) cout << "Yes\n";
else cout << "No\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d<<endl;
#define vecp(p) int aa;cin>>aa;(p).push_back(aa);
#define vecpl(p) long long aa;cin>>aa;(p).push_back(aa);
#define vecps(p) string aa;cin>>aa;(p).push_back(aa);
#define vecp2(p) cin>>aa;(p).push_back(aa);
#define vecpl2(p) long long a b;cin>>ab;(p).push_back(ab);
#define vecps2(p) string ab;cin>>ab;(p).push_back(ab);
#define sorts(c) sort((c).begin(),(c).end());
#define reverses(c) reverse((c).begin(),(c).end());
#define vec(b) vector<int> (b);
#define vecl(b) vector<long long> (b);
#define vecs(b) vector<string> (b);
#define pb(b,a) (b).push_back((a));
#define doublece(a,b) cout<<(a)<<' '<<(b)<<endl;
#define pairs(s) vector<pair<int,int>> (s);
#define pairsp(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define MOD 1000000007
#define cey ce("Yes")
#define cen ce("No")
#define ceY ce("YES")
#define ceN ce("NO")
int main()
{
int T;
cin >> T;
fx(T) {
string S;
cin >> S;
bool a = true;
fy(S.size()) {
if (S[y] != 'a') { a = false; }
}
if (a) {
ce(-1)
}
else if (S>"atcoder") {
ce(0)
}
else {
int ans = 0;
while (S[ans] == 'a') { ans++; }
if (ans>0&&S[ans] > 't') { ans--; }
ce(ans)
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 1007, inf = 1e9;
char s[sz][sz];
int main() {
int h, w;
cin >> h >> w;
int x, y;
cin >> x >> y;
x--, y--;
for(int i=0; i<h; i++) scanf("%s", s[i]);
if(s[x][y] == '#') {
puts("0");
return 0;
}
int ans = 1;
for(int i=x-1; i>=0; i--) {
if(s[i][y] == '#') break;
ans++;
}
for(int i=x+1; i<h; i++) {
if(s[i][y] == '#') break;
ans++;
}
for(int i=y-1; i>=0; i--) {
if(s[x][i] == '#') break;
ans++;
}
for(int i=y+1; i<w; i++) {
if(s[x][i] == '#') break;
ans++;
}
printf("%d\n", ans);
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int H,W,X,Y;
cin >>H>>W>>X>>Y;
vector<vector<char>> data(H,vector<char>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin >> data.at(i).at(j);
}
}
int ans=0;
for(int i=0;Y-1+i<W;i++){
if(data.at(X-1).at(Y-1+i)=='#') break;
ans++;
}
for(int i=0;Y-1-i>=0;i++){
if(data.at(X-1).at(Y-1-i)=='#') break;
ans++;
}
for(int i=0;X-1+i<H;i++){
if(data.at(X-1+i).at(Y-1)=='#') break;
ans++;
}
for(int i=0;X-1-i>=0;i++){
if(data.at(X-1-i).at(Y-1)=='#') break;
ans++;
}
cout << ans-3;
} |
/*
{
######################
# Author #
# Gary #
# 2020 #
######################
*/
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) for(int a=0;a<b;++a)
#define SRAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define random(a) rng()%a
#define ALL(a) a.begin(),a.end()
#define POB pop_back
#define ff fflush(stdout)
#define fastio ios::sync_with_stdio(false)
#define check_min(a,b) a=min(a,b)
#define check_max(a,b) a=max(a,b)
using namespace std;
//inline int read(){
// int x=0;
// char ch=getchar();
// while(ch<'0'||ch>'9'){
// ch=getchar();
// }
// while(ch>='0'&&ch<='9'){
// x=(x<<1)+(x<<3)+(ch^48);
// ch=getchar();
// }
// return x;
//}
const int INF=0x3f3f3f3f;
typedef pair<int,int> mp;
/*}
*/
int n;
int main(){
cin>>n;
string s,t;
cin>>s>>t;
LL rest=0;
stack<int> sta;
rl(i,n-1,0){
if(s[i]=='1'){
sta.push(i);
}
if(t[i]=='1'){
if(sta.empty()){
cout<<-1<<endl;;
return 0;
}
if(sta.size()%2==0){
int t=sta.top();
sta.pop();
rest+=sta.top()-i;
sta.pop();
sta.push(t);
}
else{
rest+=sta.top()-i;
sta.pop();
}
}
}
if(sta.size()&1){
cout<<-1<<endl;
}
else{
while(!sta.empty()){
int a,b;
a=sta.top();sta.pop();
b=sta.top(); sta.pop();
rest+=b-a;
}
cout<<rest<<endl;
}
return 0;
}
/** 程序框架：
*
*
*
*
**/
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); ++i)
const int MAX = 510000;
const long long INF = 1LL<<60;
const int MOD = 10007;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
//二項係数ライブラリ
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
if (n == k) {
return 1;
}
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int gcd(ll N){
ll ans=1;
for(ll i=sqrt(N)+1; 0<i; i--){
if(N%i==0){
ans=i;
break;
}
}
return ans;
}
//桁和
int digsum(ll N){
bool a=true;
ll ans=0;
while(a==true){
if(0<N){
ans+=N%10;
N-=N%10;
N/=10;
}
else{
a=false;
}
}
return ans;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); //xの根をrx
int ry = root(y); //yの根をry
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
// vector<vector<int>> A(3, vector<int>(4));
int main() {
ll N;
cin>>N;
string T;
cin>>T;
ll e=3;
rep(i,10){
e*=10;
}
ll a=(e-N+1)/3;
ll b=a;
ll c=a;
if((e-N+1)%3==1){
a++;
}
else if((e-N+1)%3==2){
a++;
b++;
}
ll ans=0;
vector<char>A(N);
vector<char>B(N);
vector<char>C(N);
rep(i,N){
if(i%3==0){
A[i]='1';
B[i]='1';
C[i]='0';
}
else if(i%3==1){
A[i]='1';
B[i]='0';
C[i]='1';
}
else{
A[i]='0';
B[i]='1';
C[i]='1';
}
}
bool d=true;
bool G=true;
bool f=true;
rep(i,N){
if(T[i]!=A[i]){
d=false;
}
if(T[i]!=B[i]){
G=false;
}
if(T[i]!=C[i]){
f=false;
}
}
if(d==true){
ans+=a;
}
if(G==true){
ans+=b;
}
if(f==true){
ans+=c;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define V vector
#define debug(v) {for(auto i: v) cout << i << " "; cout << endl;}
#define vcin(v) rep(i, v.size()) cin >> v[i]
#define wcin(v, w) rep(i, v.size()) cin >>v[i] >>w[i]
ll MOD=1000000007;
int main(){
ll n;
cin >>n;
string s;
cin >>s;
if(s[0]!=s[n-1]){
cout <<1;
return 0;
}
char c=s[0];
for(ll i=1;i<n-1;i++){
if(s[i]!=c&&s[i+1]!=c){
cout <<2;
return 0;
}
}
cout <<-1;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<pair<ll, ll> > vii;
typedef pair<ll,ll> pii;
typedef multiset<pair<ll, ll> > msii;
typedef multiset<ll> msi;
typedef set<pair<ll, ll> > sii;
typedef set<ll> si;
typedef map<ll, ll> mii;
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define for1(x, a, b) for(x=a; x<b; x++)
#define for2(x, a, b) for(x=a, x>=b; x--)
//#define endl "\n"
#define all(x) x.begin(), x.end()
#define p pair
#define mp make_pair
#define read freopen("input.txt","r",stdin)
#define write freopen("output.txt","w",stdout)
#define pb push_back
#define ff first
#define ss second
#define bb begin
#define arr_ub(arr, n, x) upper_bound(arr, arr+n, x)-arr
#define arr_lb(arr, n, x) lower_bound(arr, arr+n, x)-arr
#define u_p(v, x) upper_bound(v.begin(), v.end(), x)-v.begin()
#define l_b(v, x) lower_bound(v.begin(), v.end(), x)-v.begin()
const ll sz=1e6+123;
#define INF 1000000000000000007
#define MOD 1000000007
#define stringLen 18446744073709551620
#define pi 3.1415926536
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
int n;
string s;
void dfs(){
}
int main(){
cin >> n;
cin >> s;
if(s[0]!=s[n-1]){
cout << 1;
return 0;
}
vector<int> st;
for(int i=0; i<n-1; i++){
if(s[i]==s[0]){
if(s[i+1]!=s[i] ){
st.pb(s[i]);
}
}else{
st.pb(s[i]);
}
}
st.pb(s[n-1]);
bool ok = true;
int nt = st.size();
if(nt==1){
cout<<-1;
return 0;
}
if(nt%2 ==1){
for(int i=2; i<nt; i+=2){
if(st[i]!=st[0]){
ok = false;
break;
}
}
if(ok){
cout << -1;
return 0;
}
}
cout << 2;
return 0;
// vector<vector<bool>> Fs(n, vector<bool>(n,false));
// int first = 0;
// int init_length=1;
// int last = first+init_length;
// // while(init_length<n-2){
// int ans = 0;
// while(last<n){
// if (s[first]!= s[last] && !Fs[last][init_length]){
// ans++;
// Fs[last][init_length] = true;
// first = last+1;
// if(s[first]!=s[n-1]){
// cout<<ans+1;
// return 0;
// }
// last = first+1;
// }else{
// last++;
// }
// }
// if(first==n){
// cout << ans;
// return 0;
// }
// init_length++;
// first = 0;
// last=first+init_length;
//}
// cout << -1;
// return 0;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#define N 1000005
using namespace std;
int n, s, ans, a[N], b[N], v[N];
vector<int> num;
int f(int p) {return p > 0 ? p : -p;}
int main()
{
int i, j, k;
cin >> n;
for (i = 0, j = 1; i < n; i++, j *= 2);
for (i = 1; i <= j; i++) {
scanf ("%d", &a[i]);
}
for (i = 1; i <= n; i++) {
num.clear();
for (k = 1; k <= j; k++) {
if (v[k]) continue;
num.push_back(k);
if (num.size() == 2) {
if (a[num[0]] > a[num[1]]) {v[num[1]] = 1; ans = num[1];}
else {v[num[0]] = 1; ans = num[0];}
num.clear();
}
}
}
cout << ans;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>> n;
int iter = pow(2,n) + .000001;
//cout<< iter;
vector<int>vec;
for(int i = 1; i <= iter; i++)
{
int input;
cin>> input;
vec.push_back(input);
}
if(n == 1)
{
if(vec[0] > vec[1])
cout<< 2;
else
cout<< 1;
}
else
{
vector<int>temp;
temp = vec;
int res;
while(1)
{
//vector<int>temp;
//temp = vec;
vector<int>vec_tmp;
for(int i = 0; i < temp.size(); i+=2)
{
vec_tmp.push_back(max(temp[i],temp[i+1]));
}
temp = vec_tmp;
if(vec_tmp.size() == 2)
{
res = min(vec_tmp[0],vec_tmp[1]);
//cout<< vec_tmp[0] << " " << vec_tmp[1] << "\n";
break;
}
}
for(int i = 0; i < vec.size(); i++)
{
if(vec[i] == res)
{
cout<< i+1;
break;
}
}
}
return 0;
}
|
/*
Auth: Loxilante
Time: 2020/11/15
Prog: A
Lang: cpp
*/
#include <bits/extc++.h>
#define rep(i, l, r) for(int i = l; i < r; i++)
#define hrp(i, l, r) for(int i = l; i <= r; i++)
#define rev(i, r, l) for(int i = r; i >= l; i--)
#define ms(n, t) memset(n, t, sizeof(n))
#define pb push_back
#define int ll
#ifndef JOEON
#define D(...) 97
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
template<typename tn = int> inline tn next(void) { tn k; cin>>k; return k; }
signed main(void)
{
clock_t Begin = clock();
#ifdef JOEON
// freopen("C:\\Users\\Joeon\\Desktop\\IN.txt", "r", stdin);
// freopen("C:\\Users\\Joeon\\Desktop\\OUT.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n = next();
cout<<(n < 0 ? 0 : n)<<endl;
clock_t End = clock();
D((double)(End-Begin)/CLOCKS_PER_SEC);
return 0;
}
/*
*/ | /**
* author: Anchord
* created: 15.01.2021
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long N; cin >> N;
long long A[N], B[N];
for(int i = 0; i < N; ++i){
cin >> A[i];
}
for(int i = 0; i < N; ++i){
cin >> B[i];
}
long long ans = 0, m = 0;
for(int i = 0; i < N; ++i){
m = max(m, A[i]);
ans = max(ans, m*B[i]);
cout << ans << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
#define pb(x) push_back(x)
using namespace std;
using ll=long long;
const int N=300005;
const ll M=998244353;
int a[N],b[N],c[N];
map<int,int> g;
vector<int> f[N];
int gt=0,n;
void upd(int x){for(;x<=n;x+=x&-x)c[x]++;}
int q(int x){int res=0;for(;x;x-=x&-x)res+=c[x];return res;}
void f1(){
scanf("%d",&n);
for(int i=1;i<=n;i++){scanf("%d",&a[i]);a[i]+=i;}
for(int i=1;i<=n;i++){
scanf("%d",&b[i]);b[i]+=i;
if(!g.count(b[i])){g[b[i]]=++gt;f[gt].pb(0);}
f[g[b[i]]].pb(i);
}
for(int i=1;i<=n;i++){
if(!g.count(a[i])){printf("-1");return ;}
int na=g[a[i]];
++f[na][0];
if(f[na][0]>f[na].size()-1){printf("-1");return ;}
a[i]=f[na][f[na][0]];
}
ll ans=0;
for(int i=n;i>=1;i--){
ans+=q(a[i]-1);
upd(a[i]);
}
printf("%lld",ans);
}
int main(){
f1();
return 0;
}
/*
*/ | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#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{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on
#include <map>
#include <deque>
#include <functional>
template<typename T>
class SegmentTreeOneAll {
using Func = function<T(T, T)>;
public:
vector<T> data;
int n;
T init;
Func update_func;
Func query_func;
SegmentTreeOneAll(int _n, T _init, Func up, Func qu) {
init = _init;
update_func = up;
query_func = qu;
for (n = 1; n < _n; n *= 2)
;
data.resize(2 * n - 1, init);
}
void update(int pos, T val) {
pos += n - 1;
data[pos] = update_func(data[pos], val);
while (pos > 0) {
pos = (pos - 1) / 2;
data[pos] = query_func(data[2 * pos + 1], data[2 * pos + 2]);
}
}
T query(int l, int r) {
T resL = init, resR = init;
for (l += n - 1, r += n - 1; l < r; l = l / 2, r = (r - 1) / 2) {
if (!(l & 1)) {
resL = query_func(resL, data[l]);
}
if (!(r & 1)) {
resR = query_func(data[r - 1], resR);
}
}
return query_func(resL, resR);
}
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
input(n);
vector<int> a(n), b(n);
map<int, deque<int>> m;
rep(i, 0, n) {
input(a[i]);
a[i] += i;
m[a[i]].push_back(i);
}
vector<int> idx(n, -1);
rep(i, 0, n) {
input(b[i]);
b[i] += i;
if (m[b[i]].size()) {
int index = m[b[i]].front();
m[b[i]].pop_front();
idx[index] = i;
} else {
print(-1);
return 0;
}
}
rep(i, 0, n) {
if (idx[i] == -1) {
print(-1);
return 0;
}
}
auto SUM = [](ll s, ll t) { return s + t; };
SegmentTreeOneAll<ll> seg(n, 0LL, SUM, SUM);
ll ans = 0;
rep(i, 0, n) {
int val = idx[i];
ans += seg.query(val, n);
seg.update(val, 1);
}
print(ans);
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<PII> VPI;
typedef vector<PLL> VPL;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pf push_front
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ub upper_bound
#define lb lower_bound
//#include <atcoder/all>
//using namespace atcoder;
//typedef modint1000000007 mint;
int main(){
int N;
cin>>N;
VL A(N),B(N);
rep(i,N) cin>>A[i];
rep(i,N) cin>>B[i];
ll ans=0;
rep(i,N) ans+=B[i];
VVL X(2,VL(N/2));
rep(i,N) X[i%2][i/2]=A[i]-B[i];
rep(i,2) sort(all(X[i]));
rep(i,N/2){
ll tmp=X[0][N/2-1-i]+X[1][N/2-1-i];
if(tmp>0) ans+=tmp;
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
const int N = 400000;
bool tag[N + 5]; int fa[N + 5], s[N + 5];
int find(int x) {return (fa[x] == x ? x : fa[x] = find(fa[x]));}
void unite(int x, int y) {
int fx = find(x), fy = find(y);
if( fx != fy ) fa[fx] = fy, tag[fy] |= tag[fx], s[fy] += s[fx];
else tag[fx] = true;
}
int main() {
int n; scanf("%d", &n);
for(int i=1;i<=N;i++) fa[i] = i, s[i] = 1;
for(int i=1,a,b;i<=n;i++) scanf("%d%d", &a, &b), unite(a, b);
int ans = 0;
for(int i=1;i<=N;i++) if( find(i) == i )
ans += s[i] - (!tag[i]);
printf("%d\n", ans);
} |
#include <bits/stdc++.h>
using namespace std;
using llint = long long;
#define rep(a,n) for(int i=a;i<(n);++i)
int main() {
int N;
cin >> N;
int judge = N * 1.08;
if(judge > 206){
cout << ":(" << endl;
}else if(judge == 206){
cout << "so-so" << endl;
}else{
cout << "Yay!" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define vll vector<long long>
#define ll long long
#define pii pair<int,int>
const ll mod=1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("inputf.txt","r",stdin);
freopen("outputf.txt","w",stdout);
#endif
string s;
cin>>s;
for(int i=1;i<s.size();i++){
cout<<s[i];
}
cout<<s[0];
return 0;
} |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define read(x) for(auto& qw : (x)) cin >> qw;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const int MAX = 2e3 + 10;
/*
row: i
col: N + j
*/
vector<int> g[MAX];
vector<int> vis(MAX, 0);
int N,M;
char A[MAX][MAX];
void print(int v){
if(v < N){
cout << "row " << v;
}
else cout << "col " << v-N;
}
void dfs(int v){
vis[v] = 1;
for(int u : g[v]){
if(!vis[u]){
/*print(v);
cout << " ";
print(u);
cout << endl;*/
dfs(u);
}
}
}
void test_case(){
cin >> N >> M;
for(int i = 0; i < N; i++){
for(int j = 0; j < M; j++){
cin >> A[i][j];
if(A[i][j] == '#'){
g[i].pb(N+j);
g[N+j].pb(i);
}
}
}
int ans = 0;
dfs(0);
dfs(N-1);
dfs(N);
dfs(N+M-1);
for(int i = 1; i < N; i++){
if(!vis[i]){
ans++;
dfs(i);
}
}
int ans1 = 0;
vis.assign(MAX,0);
dfs(0);
dfs(N-1);
dfs(N);
dfs(N+M-1);
for(int i = N+1; i < N+M; i++){
if(!vis[i]){
ans1++;
dfs(i);
}
}
cout << min(ans, ans1) << endl;
}
int main(){ _
int tt = 1;
// cin >> tt;
while(tt--){
test_case();
}
return 0;
}
| //#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <fstream>
#include <iterator>
#include <random>
#include <chrono>
#include <complex>
#include <thread>
#include <bitset>
#include <assert.h>
#define forr(i,start,count) for (int i = (start); i < (start)+(count); ++i)
#define set_map_includes(set, elt) (set.find((elt)) != set.end())
#define readint(i) int i; cin >> i
#define readll(i) ll i; cin >> i
#define readdouble(i) double i; cin >> i
#define readstring(s) string s; cin >> s
typedef long long ll;
using namespace std;
//using namespace atcoder;
//ll modd = (1000LL * 1000LL * 1000LL + 7LL);
ll modd = 998244353;
class UnionFind {
public:
vector<int> parent;
vector<int> size;
// size[i] = number of nodes in tree rooted at i
// Note: not necessarily correct if i is not a root node
set<int> roots;
UnionFind(int n) : parent(n), size(n) {
forr(i,0,n) { roots.insert(i); }
forr(i,0,n) {
parent[i] = i; size[i] = 1;
}
}
int Find(int p) {
int root = p;
while (root != parent[root]) { root = parent[root]; }
while (p != root) {
int newp = parent[p];
parent[p] = root;
p = newp;
}
return root;
}
void Union(int p, int q) {
int rootP = Find(p);
int rootQ = Find(q);
if (rootP == rootQ) return;
if (size[rootP] < size[rootQ]) {
parent[rootP] = rootQ;
size[rootQ] += size[rootP];
roots.erase(rootP);
}
else {
parent[rootQ] = rootP;
size[rootP] += size[rootQ];
roots.erase(rootQ);
}
}
};
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(17);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> rand_gen(0, modd); // rand_gen(rng) gets the rand no
// auto start = chrono::steady_clock::now();
// readint(test_cases);
int test_cases = 1;
forr(t, 1, test_cases) {
readint(h); readint(w);
vector<string> grid;
forr(i,0,h) {
readstring(s);
grid.push_back(s);
}
UnionFind uf(h+w);
uf.Union(0, h+0);
uf.Union(h-1, h+0);
uf.Union(0, h+w-1);
uf.Union(h-1, h+w-1);
forr(i,0,h) {
forr(j,0,w) {
if (grid[i][j]=='#') {
uf.Union(i, h+j);
}
}
}
UnionFind ufh(h);
forr(i,0,h) {
forr(j,0,h) {
if (uf.Find(i)==uf.Find(j)) {
ufh.Union(i,j);
}
}
}
UnionFind ufv(w);
forr(i,0,w) {
forr(j,0,w) {
if (uf.Find(h+i)==uf.Find(h+j)) {
ufv.Union(i,j);
}
}
}
cout << min(ufv.roots.size()-1, ufh.roots.size()-1) << endl;
}
// auto stop = chrono::steady_clock::now();
// auto duration = chrono::duration_cast<chrono::milliseconds>(stop - start);
// cout << "Duration: " << duration.count() << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define PRINT(x) cerr<<#x<<'='<<x<<endl
#define NL(x) " \n"[(x)]
#define sz(x) int((x).size())
#define all(x) begin(x),end(x)
#define mid (l+r)/2
#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define lld long long
#define pii pair<int,int>
#define pli pair<lld,int>
#define pil pair<int,lld>
#define pll pair<lld,lld>
#define INF 1000000000
#define LINF 1000000000000000000LL
#define EPS 1e-9
using namespace std;
#define MAXN 200010
map<lld, lld> e;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
lld N, C; cin >> N >> C;
for(int i = 1; i <= N; i++) {
lld a, b, c; cin >> a >> b >> c;
e[a] += c;
e[b+1] -= c;
}
lld cur = 0, pretx = 0;
lld rez = 0;
for(auto x : e) {
lld idx = x.fi, val = x.se;
rez += min(cur, C)*(idx-pretx);
cur += val;
pretx = idx;
}
cout << rez;
return 0;
}
| #include<bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i, 0, n)
#define all(x) (x).begin(),(x).end()
const int INF = 1e9+1;
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
ll N, C;
cin >> N >> C;
vector<pair<ll, ll>> D;
REP(i, N) {
int a, b, c;
cin >> a >> b >> c;
D.push_back(make_pair(a-1, c));
D.push_back(make_pair(b, -c));
}
sort(all(D));
ll ans = 0;
ll fee = 0;
ll t = 0;
for (auto [x, y] : D) {
if (x != t) {
ans += min(C, fee)*(x-t);
t = x;
}
fee += y;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K){
for (int i = 0; i < K; i++)
{
if (N % 200 == 0){
N = N / 200;
}else{
N = N * 1000;
N = N + 200;
}
}
cout << N << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
int main(){
long long N;
scanf("%lld",&N);
long long K;
scanf("%lld",&K);
solve(N, K);
return 0;
}
| #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = my_getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = my_getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
inline void rd(long long &x){
int k;
int m=0;
x=0;
for(;;){
k = my_getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = my_getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
inline void rd(__int128_t &x){
int k;
int m=0;
x=0;
for(;;){
k = my_getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = my_getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
inline int rd_int(void){
int x;
rd(x);
return x;
}
struct MY_WRITER{
char buf[1048576];
int s;
int e;
MY_WRITER(){
s = 0;
e = 1048576;
}
~MY_WRITER(){
if(s){
fwrite_unlocked(buf, 1, s, stdout);
}
}
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
MY_WRITER_VAR.s = 0;
}
MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
my_putchar_unlocked(a);
}
inline void wt_L(int x){
int s=0;
int m=0;
char f[10];
if(x<0){
m=1;
x=-x;
}
while(x){
f[s++]=x%10;
x/=10;
}
if(!s){
f[s++]=0;
}
if(m){
my_putchar_unlocked('-');
}
while(s--){
my_putchar_unlocked(f[s]+'0');
}
}
inline void wt_L(long long x){
int s=0;
int m=0;
char f[20];
if(x<0){
m=1;
x=-x;
}
while(x){
f[s++]=x%10;
x/=10;
}
if(!s){
f[s++]=0;
}
if(m){
my_putchar_unlocked('-');
}
while(s--){
my_putchar_unlocked(f[s]+'0');
}
}
inline void wt_L(__int128_t x){
int s=0;
int m=0;
char f[40];
if(x<0){
m=1;
x=-x;
}
while(x){
f[s++]=x%10;
x/=10;
}
if(!s){
f[s++]=0;
}
if(m){
my_putchar_unlocked('-');
}
while(s--){
my_putchar_unlocked(f[s]+'0');
}
}
int main(){
int Lj4PdHRW;
__int128_t N;
rd(N);
int KL2GvlyY = rd_int();
for(Lj4PdHRW=(0);Lj4PdHRW<(KL2GvlyY);Lj4PdHRW++){
if(N%200==0){
N /= 200;
continue;
}
N = N * 1000 + 200;
}
wt_L(N);
wt_L('\n');
return 0;
}
// cLay version 20210508-1 [beta]
// --- original code ---
// {
// __int128_t @N;
// REP(rd_int()){
// if(N%200==0) N /= 200, continue;
// N = N * 1000 + 200;
// }
// wt(N);
// }
|
#include<bits/stdc++.h>
using namespace std;
long long pow(int k){
if (k==0) return 1;
else return 2*pow(k-1);
}
int main(){
long long N;
cin >> N;
int k = 0;
priority_queue<long long , vector<long long> , greater<long long>> pq;
while(N>=pow(k)){
long long a,b;
a = N/pow(k);
b = N - a * pow(k);
long long sum = a + b + k;
pq.push(sum);
k++;
}
cout << pq.top() << endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <string>
using namespace std;
int main() {
uint64_t N;
cin >> N;
uint64_t a, b, c;
uint64_t ans = N;
for (b = 0; b < 100; b++){
if (1LL<<b > N) break;
for (int bb = b; bb < 100; bb++){
if (1LL<<bb > N) break;
c = N % (1LL<<bb);
a = (N - c) / (1LL<<b);
ans = min(ans, a+b+c);
}
// c = N % (1<<b);
// a = (N - c) / (1<<b);
// ans = min(ans, a+b+c);
// cout << b << " " << a << " " << c << " " << ans <<endl;
}
cout << ans <<endl;
return 0;
} |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#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 mydeb(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
//#define mydeb(fmt, ...)
int main()
{
int64_t t,n;
cin >> t >> n;
cout << (n*100+(t-1))/t*(100+t)/100 -1 << endl;
}
| #include<bits/stdc++.h>
#pragma GCC optimize("Ofast","unroll-loops")
#define INF 2147483647
#define ll long long
#define ft first
#define sec second
#define pb push_back
#define pi pair<ll,int>
using namespace std;
ll t,n,a,b;
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> a >> b;
int x=min(a,b),y=max(a,b);
cout << (x+3>y?"Yes":"No");
return 0;
} |
#ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#define MY_IS_DEBUG (true)
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#define MY_IS_DEBUG (false)
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
constexpr int IMIN = numeric_limits<int>::min();
constexpr int IMAX = numeric_limits<int>::max();
constexpr ll LLMIN = numeric_limits<ll>::min();
constexpr ll LLMAX = numeric_limits<ll>::max();
template <typename T> bool chmax(T& maxval, T const& newval) { if (newval > maxval) { maxval = newval; return true; } return false; }
template <typename T> bool chmin(T& minval, T const& newval) { if (newval < minval) { minval = newval; return true; } return false; }
MY_NAMESPACE(testbed)
void dfs_route(int this_v, vector<vector<int>> const& edges, vector<int>& route, vector<int>& visited)
{
route.push_back(this_v);
visited[this_v] = route.size() - 1;
for (int i = 0; i < (int)edges[this_v].size(); i++)
{
int next_v = edges[this_v][i];
if (visited[next_v] != IMAX)
continue;
dfs_route(next_v, edges, route, visited);
}
}
ll dfs(int this_i, vector<vector<int>> const& edges, vector<int> const& route, vector<int>& colours)
{
int this_v = route[this_i];
int this_colour = colours[this_v];
for (int i = 0; i < (int)edges[this_v].size(); i++)
{
int test_v = edges[this_v][i];
int test_colour = colours[test_v];
if (test_colour == this_colour)
return 0;
}
int next_i = this_i + 1;
if (next_i == route.size())
return 1;
int next_v = route[next_i];
ll ans = 0;
colours[next_v] = 0;
ans += dfs(next_i, edges, route, colours);
colours[next_v] = 1;
ans += dfs(next_i, edges, route, colours);
colours[next_v] = 2;
ans += dfs(next_i, edges, route, colours);
colours[next_v] = IMAX;
return ans;
}
int main()
{
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> edges(n);
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back(b);
edges[b].push_back(a);
}
ll ans = 1;
vector<int> visited(n, IMAX);
vector<int> colours(n, IMAX);
for (int v = 0; v < n; v++)
{
if (visited[v] == IMAX)
{
vector<int> route;
dfs_route(v, edges, route, visited);
colours[v] = 0;
ll this_ans = dfs(0, edges, route, colours);
this_ans *= 3;
ans *= this_ans;
}
}
cout << ans << "\n";
return 0;
}
MY_NAMESPACE_
| #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%d",&x,&y)
#define P(x) printf("%d\n",x)
#define all(v) v.begin(),v.end()
#define FF first
#define SS second
#define pb push_back
#define mp make_pair
typedef long long int LL;
typedef pair<int, int > pii;
typedef vector<int > vi;
const int N = 20;
int G[N][N];
int n;
int col[N];
int bit(int mask, int x) {
return (mask >> x) & 1;
}
bool singlecol(int mask) {
rep(i,0,n) if(bit(mask, i)) {
rep(j,i+1,n) if(bit(mask, j)) {
if(G[i][j]) return false;
}
}
return true;
}
bool dfs(int c, int mask, int cc) {
if(col[c] != -1) {
return col[c] == cc;
}
col[c] = cc;
bool res = true;
rep(i,0,n) if(bit(mask, i) && G[c][i]) {
res &= dfs(i, mask, cc ^ 1);
}
return res;
}
LL twocol(int mask) {
memset(col, -1, sizeof(col));
LL res = 1;
rep(i,0,n) if(bit(mask, i) && col[i] == -1) {
if(!dfs(i, mask, 0)) {
res = 0;
} else {
res *= 2;
}
}
return res;
}
int main() {
int m;
S2(n,m);
rep(i,0,m) {
int x,y;
S2(x,y);
x--; y--;
G[x][y] = G[y][x] = 1;
}
int mx = (1 << n) - 1;
LL ans = 0;
rep(i,0,1<<n) {
if(!(i & 1)) continue;
if(singlecol(i)) {
ans += twocol((~i) & mx);
// printf("%d %lld\n",i,ans);
}
}
ans *= 3;
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+10;
map<string,int>f,fff;
string x[N];
int main(){
int n; cin>>n;
for(int i=0;i<n;i++){
cin>>x[i];
if(fff[x[i]]) continue;
fff[x[i]]=1;
int len=x[i].size();
//for(int j=1;j<=len;j++){
int ff=(x[i][0]=='!');
f[x[i].substr(ff)]++;
// for(int k=ff;k+j-1<len;k++){
// f[x[i].substr(k,j)]++;
// }
//}
//cout<<"check is "<<x[i].substr(0)<<endl;
}
int res=0;
for(pair<string,int>i :f){
if(i.second>1){
res=1;
cout<<i.first<<endl;
break;
}
}
if(!res){
cout<<"satisfiable"<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <algorithm>
#include <iterator>
#include <vector>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
cin >> N;
vector<string> n(N);
vector<string> e(N);
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s[0] == '!') {
e.push_back(s.erase(0, 1));
} else {
n.push_back(s);
}
}
sort(n.begin(), n.end());
sort(e.begin(), e.end());
vector<string> inter;
set_intersection(n.begin(), n.end(), e.begin(), e.end(),
back_inserter(inter));
string output = "satisfiable";
for (int i = 0; i < inter.size(); i++) {
if (inter[i] != "") output = inter[i];
}
cout << output << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define INF 1e9
#define eps 1e-6
typedef long long ll;
using namespace std;
struct S{
ll v;
int tp;
}s[200010];
map <ll, bool> m1, m2, m3;
int n, cnt1, cnt2, cnt3, ss1, ss2, ss3, L, R;
ll s1[200010], s2[200010], s3[200010], ans = 1e18, anss = 1e18, ANS = 1e18;
char c[3];
inline ll abss(ll x){
return x > 0 ? x : -x;
}
int main(){
int t = 1;
// cin >> t;
while(t--){
cin >> n, n *= 2;
for(int i = 1; i <= n; i++){
cin >> s[i].v >> c;
if(c[0] == 'R') s[i].tp = 1, cnt1++;
if(c[0] == 'G') s[i].tp = 2, cnt2++;
if(c[0] == 'B') s[i].tp = 3, cnt3++;
}
if(cnt1 % 2 == 0 && cnt2 % 2 == 0 && cnt3 % 2 == 0){
puts("0");
return 0;
}
for(int i = 1; i <= n; i++){
if(s[i].tp == 1) s1[++ss1] = s[i].v;
if(s[i].tp == 2) s2[++ss2] = s[i].v;
if(s[i].tp == 3) s3[++ss3] = s[i].v;
}
sort(s1 + 1, s1 + ss1 + 1);
sort(s2 + 1, s2 + ss2 + 1);
sort(s3 + 1, s3 + ss3 + 1);
for(int i = 1; i <= ss1; i++)
m1[s1[i]] = 1;
for(int i = 1; i <= ss2; i++)
m2[s2[i]] = 1;
for(int i = 1; i <= ss3; i++)
m3[s3[i]] = 1;
if(cnt3 % 2 == 0){
for(int i = 1; i <= ss1; i++){
R = lower_bound(s2 + 1, s2 + ss2 + 1, s1[i]) - s2;
L = R - 1;
if(R >= 1 && R <= ss2) ANS = min(ANS, abss(s2[R] - s1[i]));
if(L >= 1 && L <= ss2) ANS = min(ANS, abss(s2[L] - s1[i]));
}
for(int i = 1; i <= ss2; i++)
if(m1[s2[i]] == 1){
puts("0");
return 0;
}
for(int i = 1; i <= ss1; i++){
R = lower_bound(s3 + 1, s3 + ss3 + 1, s1[i]) - s3;
L = upper_bound(s3 + 1, s3 + ss3 + 1, s1[i]) - s3 - 1;
if(R >= 1 && R <= ss3) ans = min(ans, abss(s3[R] - s1[i]));
if(L >= 1 && L <= ss3) ans = min(ans, abss(s3[L] - s1[i]));
}
for(int i = 1; i <= ss2; i++){
R = lower_bound(s3 + 1, s3 + ss3 + 1, s2[i]) - s3;
L = upper_bound(s3 + 1, s3 + ss3 + 1, s2[i]) - s3 - 1;
if(R >= 1 && R <= ss3) anss = min(anss, abss(s3[R] - s2[i]));
if(L >= 1 && L <= ss3) anss = min(anss, abss(s3[L] - s2[i]));
}
printf("%lld\n", min(ans + anss, ANS));
}
if(cnt2 % 2 == 0){
for(int i = 1; i <= ss1; i++){
R = lower_bound(s3 + 1, s3 + ss3 + 1, s1[i]) - s3;
L = R - 1;
if(R >= 1 && R <= ss3) ANS = min(ANS, abss(s3[R] - s1[i]));
if(L >= 1 && L <= ss3) ANS = min(ANS, abss(s3[L] - s1[i]));
}
for(int i = 1; i <= ss3; i++)
if(m1[s3[i]] == 1){
puts("0");
return 0;
}
for(int i = 1; i <= ss1; i++){
R = lower_bound(s2 + 1, s2 + ss2 + 1, s1[i]) - s2;
L = upper_bound(s2 + 1, s2 + ss2 + 1, s1[i]) - s2 - 1;
if(R >= 1 && R <= ss2) ans = min(ans, abss(s2[R] - s1[i]));
if(L >= 1 && L <= ss2) ans = min(ans, abss(s2[L] - s1[i]));
}
for(int i = 1; i <= ss3; i++){
R = lower_bound(s2 + 1, s2 + ss2 + 1, s3[i]) - s2;
L = upper_bound(s2 + 1, s2 + ss2 + 1, s3[i]) - s2 - 1;
if(R >= 1 && R <= ss2) anss = min(anss, abss(s2[R] - s3[i]));
if(L >= 1 && L <= ss2) anss = min(anss, abss(s2[L] - s3[i]));
}
printf("%lld\n", min(ANS, ans + anss));
}
if(cnt1 % 2 == 0){
for(int i = 1; i <= ss3; i++){
R = lower_bound(s2 + 1, s2 + ss2 + 1, s3[i]) - s2;
L = R - 1;
if(R >= 1 && R <= ss2) ANS = min(ANS, abss(s2[R] - s3[i]));
if(L >= 1 && L <= ss2) ANS = min(ANS, abss(s2[L] - s3[i]));
}
for(int i = 1; i <= ss3; i++)
if(m2[s3[i]] == 1){
puts("0");
return 0;
}
for(int i = 1; i <= ss2; i++){
R = lower_bound(s1 + 1, s1 + ss1 + 1, s2[i]) - s1;
L = upper_bound(s1 + 1, s1 + ss1 + 1, s2[i]) - s1 - 1;
if(R >= 1 && R <= ss1) ans = min(ans, abss(s1[R] - s2[i]));
if(L >= 1 && L <= ss1) ans = min(ans, abss(s1[L] - s2[i]));
}
for(int i = 1; i <= ss3; i++){
R = lower_bound(s1 + 1, s1 + ss1 + 1, s3[i]) - s1;
L = upper_bound(s1 + 1, s1 + ss1 + 1, s3[i]) - s1 - 1;
if(R >= 1 && R <= ss1) anss = min(anss, abss(s1[R] - s3[i]));
if(L >= 1 && L <= ss1) anss = min(anss, abss(s1[L] - s3[i]));
}
printf("%lld\n", min(ANS, ans + anss));
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
const int N = 4e5 + 10;
int n, ans[N], p[N];
set <int> s[2];
set <int> :: iterator it;
pii a[N];
int main() {
scanf("%d", &n), n *= 2;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i].first);
a[i].second = i;
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n/2; i++) {
s[0].insert(a[i].second), s[1].insert(a[i + n/2].second);
p[a[i + n/2].second] = 1;
}
// puts("OK");
for (int i = 1; i < n; i++)
if (!ans[i]) {
int x = p[i];
s[x].erase(i), ans[i] = 1;
it = s[x^1].upper_bound(i);
ans[*it] = 2, s[x^1].erase(it);
}
for (int i = 1; i <= n; i++)
printf("%c", ans[i] == 1 ? '(' : ')');
} |
// Problem Link -
#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<ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define inf 1e18
#define endl "\n"
#define pb push_back
#define pi pair<ll, ll>
#define vi vector<ll>
#define vpi vector<pi>
#define vvi vector<vi>
#define vvpi vector<vector<pi>>
#define vs vector<string>
#define ump unordered_map
#define pq_max priority_queue<ll>
#define pq_min priority_queue<ll, vi, greater<ll>>
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define mid(l, r) (l + (r - l) / 2)
#define loop(i, a, b) for (ll i = (a); i <= (b); i++)
#define looprev(i, a, b) for (ll i = (a); i >= (b); i--)
#define log(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
#define logarr(arr, a, b) \
for (int z = (a); z <= (b); z++) \
cout << (arr[z]) << " "; \
cout << endl;
#define token(str, ch) (std::istringstream var((str)); vs v; string t; while (getline((var), t, (ch))) { v.pb(t); } return v;)
vs tokenizer(string str, char ch)
{
std::istringstream var((str));
vs v;
string t;
while (getline((var), t, (ch)))
{
v.pb(t);
}
return v;
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
cout << *it << " = " << a << endl;
err(++it, args...);
}
//typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void file_i_o()
{
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
}
int main(int argc, char const *argv[])
{
file_i_o();
ll n=3;
// cin>>n;
vi a(n);
loop(i,0,n-1)
{
cin>>a[i];
}
sort(all(a));
cout<<a[1]+a[2];
return 0;
} | #include<bits/stdc++.h>
#define SORT(v) sort(v.rbegin() , v.rend())
#define si(n) scanf( "%d" , &n)
#define sii(n , m) scanf( "%d %d" , &n , &m)
#define sl(n) scanf( "%lld" , &n)
#define sll(n , m) scanf( "%lld %lld" , &n, &m)
#define ss(cad) scanf( "%s" , cad)
#define sz(x) (int)x.size()
#define PB push_back
#define fst first
#define scn second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define N_MAX 1000010
#define M 1000000007
#define EPS 1e-9
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<pi> vp;
int main(){
int a, b, c;
sii(a, b);
si(c);
int ans = max(b+c, max(a+b, a+c));
printf("%d\n", ans);
return 0;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <fstream>
#include <bitset>
#include <cassert>
#include <functional>
#include <cstring>
#include <ctime>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
#define sec second
#define fir first
#define pb push_back
#define mp make_pair
#define REP(i , n) for (int i = 0 ; i < (n) ; i++)
#define BACK(i , n) for (int i = (n) - 1 ; i >= 0 ; i--)
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int , int>;
using ll = long long;
using ld = long double;
const int MAX = 1e9 , MIN = - MAX , MOD = 1e9 + 7;
const ll MAX_LL = 1e18 , MIN_LL = -MAX_LL;
int N , T , ans = 0 , arr[40];
vector<int> vec = {0};
void gener(int tot , int idx){
if (tot > T)
return;
if (idx == N)
vec.push_back(tot);
else if (idx == N / 2){
int l = 0 , r = vec.size() - 1;
while(l < r){
int mid = (l + r >> 1) + (l + r & 1);
if (vec[mid] + tot > T)
r = mid - 1;
else
l = mid;
}
ans = max(ans , vec[l] + tot);
}
else{
gener(tot + arr[idx] , idx + 1);
gener(tot , idx + 1);
}
}
int main(){
cin >> N >> T;
REP(i , N)
cin >> arr[i];
if (N == 1)
return 0 * printf("%d\n" , arr[0] <= T ? arr[0] : 0);
gener(arr[N / 2] , N / 2 + 1);
gener(0 , N / 2 + 1);
sort(begin(vec) , end(vec));
gener(0 , 0);
cout << ans << endl;
}
| //#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <array>
#include <cassert>
//#include <chrono>
#include <cmath>
//#include <cstring>
//#include <functional>
//#include <iomanip>
#include <iostream>
#include <map>
//#include <numeric>
//#include <queue>
//#include <random>
#include <set>
#include <vector>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define int long long
#define ll int
#define all(a) a.begin(),a.end()
#define rev(a) a.rbegin(),a.rend()
//typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; //less_equal for multiset
#define ar array
#define pb push_back
#define fi(a,b) for(int i=a;i<(b);i++)
#define fj(a,b) for(int j=a;j<(b);j++)
#define fk(a,b) for(int k=a;k<(b);k++)
const double pi=acosl(-1);
void solve()
{
int n,t;
cin>>n>>t;
int mid=n/2;
vector<int> a(n);
fi(0,n)
{
cin>>a[i];
}
set<int> s;
fi(0,(1<<mid))
{
int sum=0;
fj(0,mid)
{
if(i&(1LL<<j))
sum+=a[j];
}
if(sum<t)
{
s.insert(sum);
}
}
mid=n-mid;
s.insert(0);
int ans=0;
fi(0,(1<<mid))
{
int sum=0;
fj(0,mid)
{
if(i&(1LL<<j))
sum+=a[j+n/2];
}
if(sum>t) continue;
auto it=s.upper_bound(t-sum);
it--;
ans=max(ans,sum+*it);
}
cout<<ans<<'\n';
}
signed main()
{
FAST;
int tt=1;
//cin>>tt;
while(tt--)
{
solve();
}
}
//int dx[] = {+1,-1,+0,+0,-1,-1,+1,+1}; // Eight Directions
//int dy[] = {+0,+0,+1,-1,+1,-1,-1,+1}; // Eight Directions
//int dx[]= {-2,-2,-1,1,-1,1,2,2}; // Knight moves
//int dy[]= {1,-1,-2,-2,2,2,-1,1}; // Knight moves
// For (a^b)%mod, where b is large, replace b by b%(mod-1)..{because we solve this by introducing log ..do same for general cases}
// a+b = (a|b)+(a&b)
// a+b = 2*(a&b)+(a^b)
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long(i)=0;(i)<(n);(i)++)
#define kiriage(a,b) ((a)+(b)-1)/(b)
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
int main(){
long n,a,b,c;
cin >> n;
long ans = LONG_MAX;
rep(i,n)
{
cin >> a >> b >> c;
long rem = c - a;
if(rem > 0)
{
ans = min(ans, b);
}
}
if(ans == LLONG_MAX) ans = -1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define ALL(v) v.begin(),v.end()
#define sz(v) (ll)v.size()
const ll INF = 1e18;
const ll MOD = 998244353;
int main() {
ll n;
cin >> n;
vector<ll> a(n), p(n), x(n);
for(ll i = 0; i < n; i++) cin >> a[i] >> p[i] >> x[i];
ll ans = INF;
for(ll i = 0; i < n; i++) {
if(x[i]-a[i] > 0){
chmin(ans, p[i]);
}
}
cout << (ans==INF ? -1 : ans) << endl;
return 0;
} |
//
// Created by Tetsuya Shiota on 2019-04-13.
//
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b, n) for (Int i = b; i < Int(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(e, o) for (auto &&e : o)
#ifdef LOCAL
#define pp(x) cerr << __LINE__ << ' ' << #x << " = " << (x) << endl
#define dump(x) \
cerr << __LINE__ << ' ' << #x << " : "; \
FOR(e, x) cerr << e << ' '; \
cerr << endl;
#else
#define pp(x)
#define dump(x)
#endif
using namespace std;
using Int = long long;
using vi = vector<Int>;
using vvi = vector<vi>;
using pii = pair<Int, Int>;
const Int dy[] = {-1, 0, 1, 0};
const Int dx[] = {0, 1, 0, -1};
template <typename T> void reverse(vector<T> &v) {
reverse(v.begin(), v.end());
}
template <typename T> void sort(vector<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void rsort(vector<T> &v) { sort(v.rbegin(), v.rend()); }
template <typename T> T sum(const vector<T> &v) {
return accumulate(v.begin(), v.end(), T(0));
}
template <class T> void update_max(T &a, const T &b) { a = max(a, b); }
template <class T> void update_min(T &a, const T &b) { a = min(a, b); }
vector<pair<char, Int>> merge_cont_char(const string &s) {
vector<pair<char, Int>> ret;
if (s.empty())
return ret;
ret.push_back(make_pair(s[0], 0));
FOR(c, s) {
if (ret.back().first == c)
ret.back().second++;
else
ret.push_back(make_pair(c, 1));
}
return ret;
}
class Shakutori {
public:
// 全体の範囲
// [0, end)
// 注目している範囲
// [tail, head)
Int head, tail, end = 0;
bool moveHead() {
if (head == end) {
return false;
}
head++;
return true;
}
void moveTail() { tail++; }
bool valid() {
if (head == tail)
return true;
// [tail, head)
// が解として適当か検証する
return true;
}
void solve() {
head = tail = 0;
Int ans = 0;
while (moveHead()) {
while (!valid()) {
moveTail();
}
// ここで解を更新する
}
}
};
class Solver {
public:
Int ans = 0, N;
vi A, B;
Solver() {}
void input() {
cin >> N;
A = B = vi(N);
FOR(a, A)cin >> a;
FOR(b, B)cin >> b;
}
void solve() {
rep(i, N){
ans += A[i] * B[i];
}
}
void output() {
cout << (ans == 0) <<endl;
}
};
void initilization() {
struct BoolName : numpunct<char> {
string t, f;
BoolName(string t = "Yes", string f = "No") : t(t), f(f) {}
string do_truename() const { return t; }
string do_falsename() const { return f; }
};
cin.tie(nullptr);
ios::sync_with_stdio(0);
cout << fixed << setprecision(15) << boolalpha;
cout.imbue(locale(cout.getloc(), new BoolName));
}
int main() {
initilization();
#ifdef LOCAL
while (1) {
Solver s;
s.input();
if (cin.eof())
break;
s.solve();
s.output();
}
#else
Solver s;
s.input();
s.solve();
s.output();
#endif
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
int A[100000], B[100000];
int i = 0;
cin >> N;
//Aの読み込み
while (i < N) {
cin >> A[i];
i++;
}
//Bの読み込み
i = 0;
while (i < N) {
cin >> B[i];
i++;
}
//内積の計算
int sum = 0;
i = 0;
while (i < N) {
sum += A[i] * B[i];
i++;
}
//内積の判定
if (sum == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} |
#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 sz(x) (int)((x).size())
#define ms(x, v) memset((x), v, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define REP(x, n) for(int x = 0; x < n; x++)
#define REPV(x, v, n) for(int x = v; x < n; x++)
#define REVE(x, n) for(int x = n; x >= 0; x--)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;
using vvi = vector<vi>;
class UnionFind
{
int N, cnt;
vector<int> parent, size;
public:
UnionFind() { N = 0; }
UnionFind(int N) :N(N) { clear(); }
void clear() { cnt = N; size.assign(N + 1, 1); parent.assign(N + 1, 0); for(int i = 1; i <= N; i++) parent[i] = i; }
void reset(int sz) { N = sz; clear(); }
inline int count() const { assert(N != 0); return cnt; }
int getSetSize(int i) { assert(N != 0 && i >= 1 && i <= N); return size[findSet(i)]; }
int findSet(int i) { assert(N != 0 && i >= 1 && i <= N); return (parent[i] == i) ? i : (parent[i] = findSet(parent[i])); }
bool isSameSet(int i, int j) { assert(N != 0 && i >= 1 && i <= N && j >= 1 && j <= N); return findSet(i) == findSet(j); }
void unite(int i, int j)
{
assert(N != 0 && i >= 1 && i <= N && j >= 1 && j <= N);
int x = findSet(i), y = findSet(j);
if(x == y)
return;
if(size[x] < size[y])
swap(x, y);
parent[y] = x;
size[x] += size[y];
cnt--;
}
};
const ld eps = 1e-7;
int N;
pll nails[111];
bool can(ld R)
{
UnionFind uf(N + 2);
int up = N + 1, down = N + 2;
REPV(i, 1, N + 1)
{
if(100 - nails[i].second <= 2 * R) uf.unite(i, up);
if(100 + nails[i].second <= 2 * R) uf.unite(i, down);
}
REPV(i, 1, N + 1)
REPV(j, i + 1, N + 1)
if(pow(nails[i].first - nails[j].first, 2) + pow(nails[i].second - nails[j].second, 2) <= 4 * R * R)
uf.unite(i, j);
return !uf.isSameSet(up, down);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
REPV(i, 1, N + 1) cin >> nails[i].first >> nails[i].second;
ld lo = 0.0, hi = 500.0;
while(hi - lo > eps)
{
ld mid = (hi + lo) / 2.0;
if(can(mid)) lo = mid;
else hi = mid;
}
cout.precision(9);
cout << fixed << lo << "\n";
return 0;
}
| // 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>
// Container Control
#include <algorithm>
using namespace std;
#define rep( i, n ) for( int i = 0; i < n; ++i )
#define irep( i, n ) for( int i = n-1; i >= 0; --i )
#define reep( i, s, n ) for ( int i = s; i < n; ++i )
#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )
#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all( v ) v.begin(), v.end()
#define fs first
#define sc second
#define vc vector
// for visualizer.html
double SCALE = 1.0;
double OFFSET_X = 0.0;
double OFFSET_Y = 0.0;
#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << "," \
<< SCALE*(y) + OFFSET_Y << "," \
<< SCALE*(a) + OFFSET_X << "," \
<< SCALE*(b) + OFFSET_Y << ")" << endl;
#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << "," \
<< SCALE*(y) + OFFSET_Y << "," \
<< SCALE*(r) << ")" << endl;
typedef long long ll;
typedef complex<double> Point;
typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vector<int> > vii;
typedef vector< vector<double> > vdd;
typedef vector<int>::iterator vi_itr;
const int IINF = 1 << 28;
const int MOD = 1e9+7;
const double INF = 1e30;
const double EPS = 1e-10;
const double PI = acos(-1.0);
// Direction : L U R D
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1 };
struct Node {
vector<int> edge;
vector<int> weight;
};
struct Graph {
vector<Node> node;
};
bool is_reachable_graph ( const Graph& g, const int beg_node, const int end_node ) {
queue<int> que;
que.push(beg_node);
vector<bool> exist(g.node.size(), false);
while ( !que.empty() ) {
int n = que.front(); que.pop();
if ( exist[n] ) continue;
exist[n] = true;
rep(i, g.node[n].edge.size() ) {
que.push(g.node[n].edge[i]);
}
}
return exist[end_node];
}
int main()
{
vector<Point> p;
int n;
cin >> n;
double dist[120][120];
p.resize(n);
rep(i, n) {
double x, y;
cin >> x >> y;
p[i] = Point(x, y);
}
rep(i, n) rep(j, n) dist[i][j] = sqrt(norm(p[i] - p[j]));
rep(i, n) dist[n][i] = dist[i][n] = abs(p[i].imag() - 100);
rep(i, n) dist[n+1][i] = dist[i][n+1] = abs(p[i].imag() + 100);
dist[n][n+1] = dist[n+1][n] = 200;
vector<tuple<double, int, int>> v;
rep(i, n) reep(j, i+1, n) v.emplace_back(dist[i][j], i, j);
rep(i, n) v.emplace_back(abs(p[i].imag() - 100), i, -1);
rep(i, n) v.emplace_back(abs(p[i].imag() + 100), i, -2);
sort(all(v));
rep(i, v.size()) {
double r = get<0>(v[i]);
Graph g;
g.node.resize(n+2);
rep(i, n+2) reep(j, i+1, n+2) {
if ( dist[i][j] < r + EPS ) {
g.node[i].edge.emplace_back(j);
g.node[j].edge.emplace_back(i);
}
}
if ( is_reachable_graph(g, n, n+1) ) {
printf("%23.16E\n", r / 2.0);
break;
}
}
}
|
#include <iostream>
int n, k, m;
int dp[105][500005], tmp[500005];
int Add(int x, int y)
{
return x + y >= m ? x + y - m : x + y;
}
int Sub(int x, int y)
{
return x - y < 0 ? x - y + m : x - y;
}
int Mul(int x, int y)
{
return 1ll * x * y % m;
}
int main()
{
std::cin >> n >> k >> m;
dp[0][0] = 1;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j <= 500000; j++)
{
if(j < i)
{
tmp[j] = dp[i - 1][j];
}
else
{
tmp[j] = Add(tmp[j - i], dp[i - 1][j]);
}
}
for(int j = 0; j <= 500000; j++)
{
int r = j - i * (k + 1);
dp[i][j] = Sub(tmp[j], r < 0 ? 0 : tmp[r]);
}
}
for(int i = 1; i <= n; i++)
{
int l = 1 - i, r = n - i;
int ans = 0;
for(int j = 1; j <= 500000; j++)
{
if(l != 0 and r != 0)
{
ans = Add(ans, Mul(dp[-l][j], dp[r][j]));
}
}
std::cout << Add(Mul(ans, k + 1), k) << '\n';
}
} | #pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <stdio.h>
constexpr int HeighestDim = 505000;
int n, m, k;
long long int res[101];
int dim_a = 0, dim_b = 0;
int A[HeighestDim + 1], B[HeighestDim];
void mult_a(int v){
for(int i = dim_a, j = i - v; j >= 0; --i, --j){ A[i] -= A[j]; if(A[i] < 0) A[i] += m; }
}
void div_a(int v){
for(int i = v, j = 0; i <= dim_a; ++i, ++j){
A[i] += A[j]; if(A[i] >= m) A[i] -= m;
}
}
void mult_b(int v){
dim_b += v;
for(int i = dim_b, j = i - v; j >= 0; --i, --j){
B[i] -= B[j]; if(B[i] < 0) B[i] += m;
}
}
void div_b(int v){
for(int i = v, j = 0; i <= dim_b; ++i, ++j){
B[i] += B[j]; if(B[i] >= m) B[i] -= m;
}
}
int len = 0;
char Buffer[20];
char Output[1500];
int main(void){
A[0] = 1; B[0] = 1;
scanf("%d%d%d", &n, &k, &m);
if(n == 1){ printf("%d\n", k); return 0; }
else if(n == 2){ printf("%d\n%d\n", k, k); return 0; }
else if(n == 3){
printf("%d\n%d\n%d\n", k, k * static_cast<long long int>(k + 2) % m, k);
return 0;
}
res[1] = k; res[n] = k; ++k;
const int hd = (n >> 1) + (n & 1);
const int nmt = n - 2;
{
int i, j;
for(i = 1, j = k; i <= hd; ++i, j += k){ dim_a += j; mult_a(j); div_a(i); }
for(; i <= nmt; ++i, j += k){ mult_a(j); div_a(i); }
mult_b(k); div_b(1);
}
for(int i = 2, j = n - 1, I = 2 * k, J = k * (n - 2); ; I += k, J -= k){
long long int res_v = 1;
for(int d = 1; d <= dim_b; ++d){
res_v += static_cast<long long int>(A[d]) * B[d];
if(res_v > 7'000'000'000'000'000'000) res_v %= m;
}
res_v %= m; if(res_v) res_v = (k * res_v - 1) % m; else res_v = m - 1;
res[i] = res_v; res[j--] = res_v;
if(i + 1 > j) break;
mult_a(j); div_a(J);
mult_b(I); div_b(i++);
}
for(int i = 1; i <= n; ++i){
if(res[i]){
int l = 0;
do { Buffer[l++] = res[i] % 10; res[i] /= 10; } while(res[i]);
while(l--) Output[len++] = Buffer[l] ^ '0';
}
else Output[len++] = '0';
Output[len++] = '\n';
}
fwrite(Output, 1, len, stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define INF (1e9)
vvi A;
int N, K;
// index が条件を満たすかどうか
bool isOK(ll val) {
vvi B(N + 1, vi(N + 1, 0));
// imosu
// B[i+1][j+1] = A[0][0] ~ A[i][j]
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
B[i + 1][j + 1] = B[i + 1][j] + B[i][j + 1] - B[i][j];
if (A[i][j] <= val) B[i + 1][j + 1] += 1;
}
}
// for (int i = 0; i <= N; i++) {
// for (int j = 0; j <= N; j++) {
// cout << B[i][j];
// }
// cout << endl;
// }
// cout << endl;
for (int i = 0; i <= N - K; i++) {
for (int j = 0; j <= N - K; j++) {
// A[i, j] ~ A[i+K, j+K]
// cout << val << ": "
// << "A[" << i << "][" << j << "] ~ A[" << i + K - 1 << "]["
// << j + K - 1 << "]" << endl;
// for (int a = i; a < i + K; a++) {
// for (int b = j; b < j + K; b++) {
// if (A[a][b] <= val)
// cout << A[a][b] << ' ';
// else
// cout << "_ ";
// }
// cout << endl;
// }
ll s = B[i + K][j + K] - B[i + K][j] - B[i][j + K] + B[i][j];
// cout << s << "*2 >= " << K << "*" << K << endl;
// cout << endl;
if (s * 2 >= K * K) return true;
}
}
return false;
}
ll binary_search() {
ll ng = -1;
ll ok = 1e9 + 1;
// ok と ng のどちらが大きいかわからないことを考慮
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2; // オーバーフロー注意
// cout << ok << ' ' << mid << ' ' << ng << endl;
if (isOK(mid))
ok = mid;
else
ng = mid;
}
return ok;
}
int main() {
cin >> N >> K;
A = vvi(N, vi(N));
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < N; j++) {
cin >> A[i][j];
}
}
ll ans = binary_search();
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --i)
using ll = long long;
using ld = long double;
using namespace std;
int n, k, MOD = 998244353;
ll res;
int f(int x) {
if (2 * n < x) return 0;
if (x - 1 <= n) return x - 1;
return 2 * n - x + 1;
}
int main() {
scanf("%d%d", &n, &k);
rep(s, 2, 2 * n) {
int s2 = s - k;
if (s2 <= 1) continue;
res += 1LL * f(s) * f(s2);
}
printf("%lld\n", res);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
/*
for(int i=0;i<n;i++){
}
*/
int main(){
int n;
cin>>n;
ll ans=0;
for(int i=1;i*i<=n;i++){
/*
int ok=-1;
int ng=n+1;
while(ng-ok>1){
int mid=(ok+ng)/2;
if(mid*i>n) ng=mid;
else ok=mid;
}
*/
ans+=n/i/i;
for(int j=i+1;i*j<=n;j++){
ans+=n/i/j *2;
}
}
cout<<ans<<endl;
}
| #pragma region shig_templates
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pairI2;
typedef pair<LL, LL> pairLL2;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
#define shig_for(i, a, b) for(int i = (a); i < (b); ++i)
#define shig_rep(i, n) shig_for(i, 0, n)
#define shig_forB(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define shig_repB(bit,n) shig_forB(bit,0,n)
#define CINI(a) int (a); cin >> (a)
#define CINLL(a) LL (a); cin >> (a)
#define CINI2(a, b) int a, b; cin >> (a) >> (b)
#define CINLL2(a, b) LL a, b; cin >> (a) >> (b)
#define tmp int temp = 0
#define str string s
template<class T> void COUT(T&& t){ cout << t << endl; }
template<class T,class... Ts>
void COUT(T&& t,Ts&&... ts){ cout << t << " "; COUT(ts...); }
void CIN() {}
template<class T,class... Ts> void CIN(T&& t,Ts&&... ts){ cin >> t; CIN(ts...); }
#pragma endregion
LL check(LL x){
LL cnt = 0;
for(LL i = 1; i*i <= x; i++){
if(i*i == x){
cnt+=1;
continue;
}
if(x % i == 0)cnt+=2;
}
return cnt;
}
int main(){
LL ans = 0;
LL K; CIN(K);
for(LL i = 1; i <= K; i++){
LL n = check(i);
LL yoko = K / i;
ans += n*yoko;
}
COUT(ans);
//for(string& s : S) cin >> s;
//cout << "Atcoder " << N << endl;
//cout << fixed << setprecision(10) << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dbl;
#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
const ll INF = 1LL<<60;
const ll MOD = 1'000'000'007LL;
const dbl EPS = 1e-12;
const dbl PI = 3.14159265358979323846;
#define coutALL(x) for(auto i=x.begin();i!=--x.end();++i)cout<<*i<<' ';cout<<*--x.end()<<endl;
ll myceil(ll a,ll b){return (a+(b-1))/b;}
ll myfloor(ll a,ll b){return a/b;}
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;}
int N, M;
vector<string> s;
vector<char> CHARS = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', '.'};
void printMat(const vector<string> &mat) {
for (int i = 0; i < mat.size(); ++i) {
cout << mat[i] << endl;
}
}
ll count_blank(const vector<string> &mat) {
ll cnt = 0;
REP(i, N) {
REP(j, N) {
if (mat[i][j] == '.')
cnt++;
}
}
return cnt;
}
ll calc_score(const vector<string> &mat) {
ll score = 0;
int c = 0;
REP(k, M) {
string pat = s[k];
bool found = false;
REP(i, N) {
if (found)
break;
REP(j, N) {
bool horiz = true;
bool vert = true;
REP(p, pat.size()) {
if (mat[i][(j+p)%N] != pat[p]) {
horiz = false;
break;
}
}
if (horiz) {
c++;
found = true;
break;
}
REP(p, pat.size()) {
if (mat[(i+p)%N][j] != pat[p]) {
vert = false;
break;
}
}
if (vert) {
c++;
found = true;
break;
}
}
}
}
if (c < M) {
return int(round(1e8 * c * 1.0 / M));
} else if (c == M) {
ll d = count_blank(mat);
return int(round(1e8 * 2 * N * N * 1.0 / (2 * N * N - d)));
}
}
vector<string> solve_random() {
vector<string> ret;
REP(i, N) {
string tmp_str = "";
REP(j, N) {
tmp_str += CHARS[rand()%9];
}
ret.push_back(tmp_str);
}
return ret;
}
signed main(){
cout<<fixed<<setprecision(15);
srand(time(nullptr));
cin >> N >> M;
s.assign(M, "");
REP(i, M) cin>>s[i];
vector<string> mat = solve_random();
printMat(mat);
// cout << calc_score(mat) << endl;
return 0;
} | //In the name of Allah :)
#include <bits/stdc++.h>
using namespace std;
string to_string(char c) { return string(1,c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return (string)s; }
string to_string(string s) { return s; }
template<class A> string to_string(complex<A> c) {
stringstream ss; ss << c; return ss.str(); }
string to_string(vector<bool> v) {
string res = "{"; for(int i = 0; i < (int)v.size(); i++) res += char('0'+v[i]);
res += "}"; return res; }
template<size_t SZ> string to_string(bitset<SZ> b) {
string res = ""; for(size_t i = 0; i < SZ; i++) res += char('0'+b[i]);
return res; }
template<class A, class B> string to_string(pair<A,B> p);
template<class T> string to_string(T v) { // containers with begin(), end()
bool fst = 1; string res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += to_string(x);
}
res += "}"; return res;
}
template<class A, class B> string to_string(pair<A,B> p) {
return "("+to_string(p.first)+", "+to_string(p.second)+")"; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define wis(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "] : [", DBG(__VA_ARGS__)
#else
#define wis(...) 0
#endif
typedef long long ll;
#define all(x) (x).begin(), (x).end()
int main(){
ios::sync_with_stdio(0);
double a, b, c, d;
cin >> a >> b >> c >> d;
cout << fixed << setprecision(10) << (b * c + d * a) / (b + d) << '\n';
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int A[100000];
int64_t are[100000];
int main() {
int K, N, M; cin >> K >> N >> M;
int sum = 0;
REP(i, K) {
int64_t a; cin >> a;
int64_t a2 = a * M;
A[i] = a2 / N;
are[i] = (a2 - A[i] * N) << 32 | i;
sum += A[i];
}
nth_element(are, are + K - M + sum, are + K);
for(int i = K - 1; i >= K - M + sum; i--) A[are[i] & (1 << 20) - 1]++;
REP(i, K) cout << A[i] << " ";
return 0;
} | #include<stdio.h>
#include<iostream>
#include<string>
#include<sstream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<tuple>
using namespace std;
int main(){
long long k;
long long n;
long long m;
long long a[200000];
long long sum=0;
long long kiriage=0;
vector<pair<double,int>> vec;
vector<pair<int,int>> vec2;
cin >> k;
cin >> n;
cin >> m;
for (int i = 0; i < k; i++){
cin >> a[i];
// vec.push_back({(double)((m*a[i]/n)-floorl((double)(m*a[i]/n))),(double)i});
vec.push_back({(double)(-m*a[i]+n*floorl((double)(m*a[i]/n))),(double)i});
vec2.push_back({i,floor((double)(m*a[i]/n))});
sum+=floor((double)(m*a[i]/n));
}
kiriage=m-sum;
sort(vec.begin(),vec.end());
for(int i = 0; i < kiriage; i++){
vec2.at(vec.at(i).second).second+=1;
}
sort(vec2.begin(),vec2.end());
for (int i = 0; i < k; i++){
cout << (vec2.at(i).second);
cout << " ";
}
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define YES() cout << "YES" << endl
#define NO() cout << "NO" << endl
#define println(x) cout << x << endl
#define print(x) cout << x << " "
template<typename T, typename U>
inline bool CMAX(T &m, U x) { if (m < x) { m = x; return true; } return false; }
template<typename T, typename U>
inline bool CMIN(T &m, U x) { if (m > x) { m = x; return true; } return false; }
typedef long long lint;
typedef long double ldouble;
const int INF = 1e9;
const lint LINF = 1e18;
const int MOD = 1e9+7;
int main(){
int a, b;
cin >> a >> b;
REPR(i, b + 1){
if(b / i > ceil(a / (double)i)){
println(i);
return 0;
}
}
return 0;
} | // #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <complex>
using namespace std;
/* alias */
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using Pi = pair<int, int>;
using Pll = pair<ll, ll>;
using T3 = tuple<int, int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vPi = vector<Pi>;
using vPll = vector<Pll>;
/* REP macro */
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, n) for (int i = s; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define srrep(i, s, n) for (int i = s; i <= (n); ++i)
#define vrep(i, e) for (int i = e; i >= 0; i--)
/* define short */
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define seci [](Pi a, Pi b) { return a.se < b.se; }
#define secll [](Pll a, Pll b) { return a.se < b.se; }
/* Answer YesNo */
#define YESNO(bool) if (bool) { cout << "YES" << endl; } else { cout << "NO" << endl; }
#define YesNo(bool) if (bool) { cout << "Yes" << endl; } else { cout << "No" << endl; }
#define yesno(bool) if (bool) { cout << "yes" << endl; } else { cout << "no" << endl; }
/* print */
template<typename T>void pf(const T &t) { printf("%.10f\n", t); }
template<typename T>void pf(const T &a, const T &b) { printf("%.10f %.10f\n", a, b); }
template<typename T>void pr(const T &t) { cout << t << endl; }
template<typename T>void pr(const T &a, const T &b) { cout << a << " " << b << endl; }
template<typename T>void pr(const pair<T, T> &p) { cout << p.fi << " " << p.se << endl; }
template<typename T>void pr(const vector<T> &a) { for (T t : a) { cout << t << " "; } cout << endl; }
template<typename T>void pr(const vector<vector<T> > &a) { for (auto t : a) { pr(t); } }
template<typename T>void pr(const vector<pair<T, T> > &a) { for (auto p : a) { pr(p); } }
template<typename T>void pr(const map<T, T> mp) { for (pair<T, T> p : mp) { pr(p); } }
/* other */
template<typename T>ll sum(vector<T> &a) { ll tot = 0; for (T x : a) { tot += (ll)x; } return tot; }
template<typename T>int lowb(const vector<T> &a, const T &x) { return (int)distance(a.begin(), lower_bound(rng(a), x)); }
template<typename T>int uppb(const vector<T> &a, const T &x) { return (int)distance(a.begin(), upper_bound(rng(a), x)); }
/* const Num */
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
const int mod = 1e9 + 7;
const double PI = acos(-1);
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n) { cin >> a[i]; }
map<int, int> mp;
ll ans = 0;
rep(j, n) {
ans += j - mp[a[j]];
mp[a[j]]++;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, SZ(v)) {
if (i) os << " ";
os << v[i];
}
return os;
}
template <class T>
void debug(const vector<T> &v) {
cout << "[";
REP(i, SZ(v)) {
if(i) cout << ", ";
cout << v[i];
}
cout << "]" << endl;
}
template<class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << p.first << " " << p.second;
}
template <class T, class U>
void debug(const pair<T, U> &p) {
cout << "(" << p.first << " " << p.second << ")" << endl;
}
template<class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;
const ll MOD = 1e9 + 7;
const ll MOD998 = 998244353;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const int inf = INT_MIN;
const ll linf = LLONG_MIN;
const ld eps = 1e-9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
vi a(3);
REP(i, 3) {
cin >> a[i];
}
sort(ALL(a));
if(a[1] - a[0] == a[2] - a[1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
int main()
{
ll i,j,n,q;
cin >> n;
string s;
cin >> s;
cin >> q;
ll id=0;
while(q--)
{
ll t,l,r;
cin >> t >> l >> r;
if(t==2)
{
id^=1;
continue;
}
l--,r--;
if(id==0)swap(s[l],s[r]);
else
{
if(l<n)l+=n;
else if(l>n)l-=n;
if(r>=n)r-=n;
else if(r<n)r+=n;
//cout << l << " " << r << endl;
swap(s[l],s[r]);
}
}
if(id)
{
for(i=n;i<2*n;i++)cout<<s[i];
for(i=0;i<n;i++)cout<<s[i];
cout<<endl;
}
else
{
cout << s << endl;
}
}
|
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(int i = begin; i < (int)(end); i++)
#define contains(v, x) (find(all(v), x) != v.end())
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }
template<class T> bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }
template<class T> T roundup(T a, T b){ return (a + b - 1) / b; }
const double PI = 3.14159265359;
const vector<int> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
const vector<int> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};
using ll = long long;
struct Edge{ int to; ll cost; Edge(int to, ll cost) : to(to), cost(cost) {} };
const ll MOD = (ll)1e9 + 7;
const ll INF = (ll)1e9;
using P = pair<ll, int>;
using Graph = vector<vector<int>>;
/*#include <atcoder/all>
using namespace atcoder;
using mint = modint;*/
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
//mint::set_mod(MOD);
string s;
cin >> s;
reverse(all(s));
int n = s.size();
ll ans = 0;
vector<int> cnt(26);
rep(i, 0, n - 1){
if(s[i] == s[i + 1]){
ans += i - cnt[s[i] - 'a'];
fill(all(cnt), 0);
cnt[s[i] - 'a'] = i + 2;
i++;
}else cnt[s[i] - 'a']++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
template<class T, class U> T &ctmax(T &x, const U &y){ return x = max<T>(x, y); }
template<class T, class U> T &ctmin(T &x, const U &y){ return x = min<T>(x, y); }
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T, class Compare = less<>> using Tree = tree<T, null_type, Compare, rb_tree_tag, tree_order_statistics_node_update>;
// DEBUG BEGIN
#ifdef LOCAL
template<class L, class R> ostream &operator<<(ostream &out, const pair<L, R> &p){
return out << "(" << p.first << ", " << p.second << ")";
}
template<class Tuple, size_t N> struct TuplePrinter{
static ostream &print(ostream &out, const Tuple &t){ return TuplePrinter<Tuple, N-1>::print(out, t) << ", " << get<N-1>(t); }
};
template<class Tuple> struct TuplePrinter<Tuple, 1>{
static ostream &print(ostream &out, const Tuple& t){ return out << get<0>(t); }
};
template<class... Args> ostream &print_tuple(ostream &out, const tuple<Args...> &t){
return TuplePrinter<decltype(t), sizeof...(Args)>::print(out << "(", t) << ")";
}
template<class ...Args> ostream &operator<<(ostream &out, const tuple<Args...> &t){
return print_tuple(out, t);
}
template<class T> ostream &operator<<(enable_if_t<!is_same<T, string>::value, ostream> &out, const T &arr){
out << "{"; for(auto &x: arr) out << x << ", ";
return out << (arr.size() ? "\b\b" : "") << "}";
}
template<size_t S> ostream &operator<<(ostream &out, const bitset<S> &b){
for(int i = 0; i < S; ++ i) out << b[i];
return out;
}
void debug_out(){ cerr << "\b\b " << endl; }
template<class Head, class... Tail>
void debug_out(Head H, Tail... T){ cerr << H << ", ", debug_out(T...); }
void debug2_out(){ cerr << "-----DEBUG END-----\n"; }
template<class Head, class... Tail>
void debug2_out(Head H, Tail... T){ cerr << "\n"; for(auto x: H) cerr << x << "\n"; debug2_out(T...); }
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#define debug2(...) cerr << "----DEBUG BEGIN----\n[" << #__VA_ARGS__ << "]:", debug2_out(__VA_ARGS__)
#else
#define debug(...) 42
#define debug2(...) 42
#endif
// DEBUG END
int main(){
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(ios::badbit | ios::failbit);
auto __solve_tc = [&](int __tc_num){
string s{"atcoder"}, t;
cin >> t;
int n = (int)t.size();
int res = numeric_limits<int>::max();
for(auto i = 0; i <= min(7, (int)t.size()); ++ i){ // first mismatch at i
string obj(s.begin(), s.begin() + i);
for(auto c = i != 7 ? s[i] + 1 : 'a'; c <= 'z'; ++ c){
obj += c;
vector<int> ord(n, -1);
for(auto p = 0; p < (int)obj.size(); ++ p){
for(auto i = 0; i < n; ++ i){
if(!~ord[i] && obj[p] == t[i]){
ord[i] = p;
goto OK;
}
}
goto DONE;
OK:;
}
{
int temp = (int)obj.size();
Tree<int> tr;
int cur = 0;
for(auto &x: ord){
if(!~x){
x = temp ++;
}
cur += (int)tr.size() - tr.order_of_key(x);
tr.insert(x);
}
debug(obj, cur);
ctmin(res, cur);
}
DONE:;
obj.pop_back();
}
}
res == numeric_limits<int>::max() ? cout << "-1\n" : cout << res << "\n";
return 0;
};
int __tc_cnt;
cin >> __tc_cnt;
for(auto __tc_num = 0; __tc_num < __tc_cnt; ++ __tc_num){
__solve_tc(__tc_num);
}
return 0;
}
/*
*/
////////////////////////////////////////////////////////////////////////////////////////
// //
// Coded by Aeren //
// //
//////////////////////////////////////////////////////////////////////////////////////// |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main()
{
ll n;
cin>>n;
ll i,j=0;
string s,x,p,h[n+5];
map<string,ll>a,b;
for(i=0;i<n;i++){
cin>>h[i];
s=h[i];
if(s[0]!='!'){
x="!";
x+=s;
a[x]++;
}
else{
b[s]++;
}
}
for(i=0;i<n;i++){
s=h[i];
if(a[s]&&b[s]){
for(ll g=1;g<s.size();g++)
cout<<s[g];
cout<<endl;
return 0;
}
}
puts("satisfiable");
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=200010;
char p[maxn][12];
const ll mod=1000000009651;
struct pair_hash
{
template<class T1, class T2>
std::size_t operator() (const std::pair<T1, T2>& p) const
{
auto h1 = std::hash<T1>{}(p.first);
auto h2 = std::hash<T2>{}(p.second);
return h1 ^ h2;
}
};
unordered_map<pair<ll,ll>,int,pair_hash>mp;
int main(){
int n;
char q[12];
scanf("%d",&n);
int num=0;
ll k,f;
for(int i=1;i<=n;i++){
getchar();
scanf("%s",q);
if(q[0]!='!'){
k=0;
f=0;
int w=strlen(q);
for(int i=0;i<w;i++){
k=(k*109139+(int)q[i])%mod;
f=(f*8893+(int)q[i])%mod;
}
mp[make_pair(k,f)]=1;
}
else strcpy(p[num++],q);
}
int flag=0;
for(int i=0;i<num;i++){
k=0;
f=0;
int w=strlen(p[i]);
for(int j=1;j<w;j++){
k=(k*109139+(int)p[i][j])%mod;
f=(f*8893+(int)p[i][j])%mod;
}
if(mp[make_pair(k,f)]>0){
for(int j=1;j<w;j++){
printf("%c",p[i][j]);
}
flag=1;
break;
}
}
if(flag==0)printf("satisfiable\n");
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B; cin >> A >> B;
if(A+B >= 15 && B >= 8 ) cout << 1;
else if(A+B >= 10 && B >= 3) cout << 2;
else if(A + B >= 3) cout << 3;
else cout << 4;
}
| // include
#include <algorithm>
#include <complex>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
//型短縮
#define ll long long
//マクロ定義
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B;
cin >> A >> B;
int nyuko = A + B;
if (nyuko >= 15 && B >= 8) {
cout << 1;
} else if (nyuko >= 10 && B >= 3) {
cout << 2;
} else if (nyuko >= 3) {
cout << 3;
} else {
cout << 4;
}
} |
#include <iostream>
using namespace std;
int main()
{
int x;
std::cin >> x;
if(x>=0)
cout<< x;
else
cout<< 0<<endl;
return 0;
}
| #include <stdio.h>
int main(){
int N;
scanf("%d",&N);
printf("%d",N-1);
return 0;
} |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep_S(i,r,n) for(int i = r; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
#define Output(a) cout << a << endl
typedef long long int ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<string> vst;
const ll INF = 0x1fffffffffffffff;
const ll MOD = 1000000007;
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; }
int main(){
ll n,cnt=0; cin >> n;
vll a(n);
vll b(200);
rep(i, n) cin >> a[i];
rep(i,n){
b[a[i]%200]++;
}
rep(i,200){
cnt = cnt + (b[i] * (b[i] - 1)) / 2;
}
cout << cnt << endl;
} | #include<bits/stdc++.h>
using namespace std;
const int MaxN = 2e5;
const int MaxA = 1e9;
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int N, v;
while(cin >> N){
long ans = 0;
vector<int> cnt(200);
for(int i = 0; i < N; i++){
cin >> v;
v = v % 200;
ans += cnt[v];
cnt[v] += 1;
}
cout << ans << '\n';
}
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long(i)=0;(i)<(n);(i)++)
void dfs_root(vector<vector<long long>>& Graph, vector<long long>&root, vector<bool>&seen, long long cur){
for(auto it : Graph[cur]){
if(!seen[it]){
seen[it] = true;
root[it] = cur;
dfs_root(Graph, root, seen, it);
}
}
}
void dfs_add(vector<vector<long long>>& Graph, vector<long long>&root, vector<bool>&seen, vector<long long> &add,long long cur, long long s){
// current の addを処理
seen[cur] = true;
root[cur] = add[cur] + s;
for(auto it : Graph[cur]){
if(!seen[it]){
dfs_add(Graph, root, seen, add, it, s + add[cur]);
}
}
}
int main(){
long long n;
cin >> n;
vector<long long> a(n),b(n);
vector<vector<long long>> Graph(n);
rep(i,n - 1){
cin >> a[i] >> b[i];
a[i]--; b[i]--;
Graph[a[i]].push_back(b[i]);
Graph[b[i]].push_back(a[i]);
}
long long q;
cin >> q;
vector<long long> root(n, -1);
vector<bool> seen(n, false);
seen[0] = true;
dfs_root(Graph, root, seen, 0);
vector<long long> add(n,0);
rep(i,q){
long long t,e,x;
cin >> t >> e >> x;
long long A,B;
A = a[e - 1];
B = b[e - 1];
if(t == 2)
swap(A,B);
if(root[A] == B){
add[A] += x;
} else {
add[0] += x;
add[B] -= x;
}
}
rep(i,n) root[i] = 0;
rep(i,n) seen[i] = false;
seen[0] = true;
dfs_add(Graph, root, seen , add, 0, 0);
rep(i,n){
cout << root[i] << endl;
}
return 0;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
#define pp pair<ll,ll>
#define ll int
#define True 1
#define gcd __gcd
#define range(i,a,b,c) for(ll i=a;i<b;i+=c)
#define int long long
#define lb lower_bound
#define ub upper_bound
#define False 0
#define maxa(p,q) *max_element(p,q)
#define mina(p,q) *min_element(p,q)
#define pq priority_queue<int>
#define all(v) v.begin(),v.end()
#define len(p) p.size()
#define append pb
#define foi(p,n) for(int i=p;i<n;i++)
#define ini(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define fi first
#define swap(i,j) {int temp=i,i=j,j=temp;}
#define sec second
#define mp make_pair
#define tc while(t--)
#define N ((ll)1001)
#define gtc(a,b) cout<<"Case #"<<a<<": "<<b<<endl;
#define va(n) vector<ar<ll,n>>
#define fo(n) for(int i=0;i<n;i++)
#define rev(n) for(int i=n-1;i>=0;i--)
#define foj(m,n) for(int j=m;j<n;j++)
#define INF 9999999999
#define ar array
#define vp vector<pair<int,int>>
#define vc vector<int>
#define print(p) cout<<p<<"\n";
#define pr(p) cout<<p<<" ";
#define pr2(p,q) cout<<p<<" "<<q<<endl;
#define pr3(p,q,r) cout<<p<<" "<<q<<" "<<r<<endl;
#define pr4(p,q,r,s) cout<<p<<" "<<q<<" "<<r<<" "<<s<<endl;
#define pra(a) for(ll i: a) cout<<i<<" "; cout<<endl;
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define isvalid(i,j) (0<=i and i<n and 0<=j and j<m)
#define gh fflush(stdout)
#define why {print("LOL") return 0;}
using namespace std;
ll n,m,t,k,r,maxn,x,y,flag=0,l1,r1,l2,r2,parity[2]={0,0},ok,q,need,p;
ll mod=1e9+7;
signed main()
{
fio
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("all.txt", "w", stdout);
#endif
t=1;
//cin>>t;
ll uu=t;
tc{
cin>>n>>m;
va(3) a[n+1];
multiset<ar<ll,2>> s;
fo(m) {
ll x,y,c,d;
cin>>x>>y>>c>>d;
a[x].pb({y,c,d});
a[y].pb({x,c,d});
}
ll dis[n+1];
fo(n+1) dis[i]=-1;
dis[1]=0;
s.insert({0,1});
while(s.size()){
auto i=*s.begin();
s.erase(s.begin());
for(auto j: a[i[1]]){
for(ll k=max(i[0],(ll)sqrt(j[2])-5);k<=max(i[0],(ll)sqrt(j[2])+5);k++)
if(k>=i[0] and (dis[j[0]]==-1 or dis[j[0]]>k+j[1]+j[2]/(k+1))){
if(s.find({dis[j[0]],j[0]})!=s.end())
s.erase(s.find({dis[j[0]],j[0]}));
dis[j[0]]=k+j[1]+j[2]/(k+1);
s.insert({dis[j[0]],j[0]});
}
}
}
print(dis[n])
}
return 0;}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define int ll
#define ld long double
#define reps(i,s,n) for(int i=(s);i<(int)(n);i++)
#define rep(i,n) reps(i,0,n)
#define rreps(i,s,n) for(int i=(int)(s-1);i>=n;i--)
#define rrep(i,n) rreps(i,n,0)
#define all(v) (v).begin(),(v).end()
#define mset(a,n) memset(a,n,sizeof(a))
#define eras(v,n) (v).erase(remove(all(v),n),(v).end())
#define uni(v) sort(all(v));(v).erase(unique(all(v)),(v).end())
#define bcnt(i) __builtin_popcount(i)
#define fi first
#define se second
constexpr ll INF = 1e18;
constexpr ll MOD = 1000000007;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>T min(vector<T> &v) { return *min_element(v.begin(),v.end()); }
template<class T>T max(vector<T> &v) { return *max_element(v.begin(),v.end()); }
template<class T>T modpow(T a, T b, T m) { a %= m; T r = 1; while (b > 0) { if (b & 1) r = (r * a) % m; a = (a * a) % m; b >>= 1; } return r; }
ll modinv(ll a,ll m=MOD) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
template<class T>string radixconv(T n, T k){ string s; while(n/k){ s=to_string(n%k)+s; n/=k; } s=to_string(n%k)+s; return s; }
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(11);
cerr << fixed << setprecision(6);
int ans=INF;
int n;
cin >> n;
vector<int> a(n),b(n);
rep(i,n){
cin >> a[i] >> b[i];
chmin(ans,a[i]+b[i]);
}
rep(i,n)rep(j,n)if(i!=j)chmin(ans,(int)max(a[i],b[j]));
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define rep(i, n) for(int i = 0;i < n;i++)
#define rep1(i, n) for(int i = 1;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(a) (a).begin(),(a).end()
vector<vector<ll>> near8={{-1,1},{0,1},{1,1},{-1,0},{1,0},{-1,-1},{0,-1},{1,-1}};
vector<vector<ll>> near4={{0,1},{-1,0},{1,0},{0,-1}};
ll INF = INT64_MAX;
bool ll_sqrt(ll x, ll& lower_bound, ll& upper_bound)
{
constexpr ll ll_max = numeric_limits<ll>::max();
bool first_boost = true;
lower_bound = 0;
upper_bound = x;
while (upper_bound - lower_bound > 1)
{
if (first_boost)
{
ll guess = (ll)sqrt((double)x);
lower_bound = max(guess - 1, (ll)0);
upper_bound = lower_bound + 3;
first_boost = false;
}
ll newval = (lower_bound + upper_bound) / 2;
if ((newval != 0) && (newval > ll_max / newval)) // newval*newval becomes overflow
upper_bound = newval; // because overflow means newval is too big
else
{
ll newval_sqr = newval * newval;
if (newval_sqr < x)
lower_bound = newval;
else
upper_bound = newval;
}
}
if ((upper_bound != 0) && (upper_bound > ll_max / upper_bound))
{
if (lower_bound * lower_bound == x)
upper_bound = lower_bound;
}
else
{
if (lower_bound * lower_bound == x)
upper_bound = lower_bound;
else if (upper_bound * upper_bound == x)
lower_bound = upper_bound;
}
bool is_exact = (lower_bound == upper_bound);
return is_exact;
}
ll ll_ceil(ll x, int digit);
ll ll_floor(ll x, int digit);
ll ll_floor(ll x, int digit)
{
if (x < 0)
return -ll_ceil(-x, digit);
ll div = 1;
while (digit != 0)
{
div *= 10;
digit--;
}
ll modval = x % div;
ll ans = x - modval;
return ans;
}
ll ll_ceil(ll x, int digit)
{
if (x < 0)
return -ll_floor(-x, digit);
ll div = 1;
while (digit != 0)
{
div *= 10;
digit--;
}
ll modval = x % div;
ll ans = x - modval;
if (modval != 0)
ans += div;
return ans;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll N) : par(N) { //最初は全てが根であるとして初期化
for(ll i = 0; i < N; i++) par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); //xの根をrx
ll ry = root(y); //yの根をry
if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
};
ll H,W;
vector<vector<char>> map1(501, vector<char>(501,'#'));
bool solve(ll h, ll w){
ll nexth=0;
ll nextw=0;
for(vector<ll> to:near4){
nexth = h+to[0];
nextw = w+to[1];
if(nexth < 0 || nexth >=H || nextw < 0 || nextw >=W || map1[nexth][nextw] == '#'){
continue;
}
if(map1[nexth][nextw] =='g'){
return true;
}
map1[nexth][nextw]='#';
if(solve(nexth, nextw)){
return true;
};
}
return false;
}
int main() {
ll N;
cin >> N;
ll A[N];
ll in ;
UnionFind nums(200002);
rep(i,N){
cin >> A[i];
}
ll ans=0;
ll a, b;
rep(i, N/2){
a = A[i];
b = A[N-i-1];
if(!nums.same(a,b)){
ans++;
nums.unite(a,b);
}
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
printf("%d %d\n", (i*2 + 1) % n + 1, (i*2 + 2) % n + 1);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define D(n) DW(i, n)
#define DD(n) DW(j, n)
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vpll = vector<pll>;
using vtll = vector<tll>;
using gr = vector<vll>;
using wgr = vector<vpll>;
void add_edge(gr&g,ll x, ll y){ g[x].pb(y);g[y].pb(x); }
void add_edge(wgr&g,ll x, ll y, ll z){ g[x].eb(y,z);g[y].eb(x,z); }
template<typename T,typename U>
ostream& operator<<(ostream& os, const pair<T,U>& p) {
cerr << ' ' << p.x << ',' << p.y; return os; }
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for(auto x: v) os << ' ' << x; return os; }
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
for(auto x: v) os << ' ' << x; return os; }
template<typename T,typename U>
ostream& operator<<(ostream& os, const map<T,U>& v) {
for(auto x: v) os << ' ' << x; return os; }
struct d_ {
template<typename T> d_& operator,(const T& x) {
cerr << ' ' << x; return *this;}
} d_t;
#define dbg(args ...) { d_t,"|",__LINE__,"|",":",args,"\n"; }
#define deb(X ...) dbg(#X, "=", X);
#define EPS (1e-10)
#define INF (1LL<<61)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
int main(void) {
ios_base::sync_with_stdio(false);
ll n; cin >> n;
F(n) cout << 1+(2*i+1)%n << " " << 1+(2*i)%n << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//typedef tree <int,null_type,less <int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// #include <ext/rope>
// using namespace __gnu_cxx;
typedef long long int ll;
typedef long double ld;
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define rep(g, i, n) for (ll g = i; g < n; g++)
#define rev(g, n, i) for (ll g = n - 1; g >= i; g--)
#define all(v) v.begin(), v.end()
#define pb push_back
#define mxe(v) *max_element(v.begin(), v.end())
#define mne(v) *min_element(v.begin(), v.end())
#define ve vector
#define lb lower_bound
#define ub upper_bound
#define bb break
#define cc continue
#define rem 1000000007
#define PI 3.141592653589793238462643383279502
ll power(ll x, ll y, ll p)
{
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p)
{
return power(n, p - 2, p);
}
struct point
{
ll x, y;
};
int main()
{
FAST
// freopen("input1.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
/*ll tests;
cin>>tests;
rep (gg,0,tests)
{}*/
ll n,
m;
cin >> n >> m;
ve<string> arr(n);
rep(i, 0, n)
{
cin >> arr[i];
}
ll cnt = 0, ans = 0;
rep(i, 0, n)
{
cnt=0;
arr[i].pb('#');
rep(j, 0, m + 1)
{
if (arr[i][j] == '.')
{
cnt++;
}
else if (cnt!=0)
{
ans += cnt - 1;
cnt = 0;
}
// cout<<"cnt.. "<<cnt<<"\n";
}
arr[i].pop_back();
}
rep(j, 0, m)
{
cnt=0;
rep(i, 0, n)
{
if (arr[i][j] == '.')
{
cnt++;
}
else if (cnt!=0)
{
ans += cnt - 1;
cnt = 0;
}
}
if (cnt!=0)
ans += cnt - 1;
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m;
vector<int> w;
vector<tuple<int,int>>brg; // v / l
vector <vector<int>> adjList;
vector <int> segmentTree;
void build(int l, int r,int index){
if (l==r) segmentTree[index]=get<1>(brg[l]);
else{
int mid = l+r >>1;
build(l,mid,index*2);
build(mid+1,r,index*2+1);
segmentTree[index]=max(segmentTree[index*2],segmentTree[index*2+1]);
}
}
int get (int tl, int tr, int l, int r, int index) {
if (l>r) return -1;
if (l==tl && r==tr) return segmentTree[index];
int mid = tl+tr >>1;
return max(get(tl,mid,l,min(r,mid),index*2),get(mid+1,tr,max(l,mid+1),r,index*2+1));
}
vector<vector<ll>> dp;
long long getLongest(int f, int t){
if (dp[t][f]!=-1) return dp[t][f];
if (t==f) return 0;
assert(t>f);
ll re=adjList[t][f];
int t2=t-1;
while(t2>f){
ll tmp1=getLongest(f,t2);
ll tmp2=getLongest(t2,t);
ll tmp=tmp1+tmp2;
if (re<tmp){
re=tmp;
}
t2--;
}
return dp[t][f]=re;
}
int main() {
cin>>n>>m;
w.assign(n,0);
for (int i=0;i<n;i++){
cin>>w[i];
}
sort(w.begin(),w.end());
brg.assign(m,{0,0});
for (int i=0;i<m;i++) {
cin>>(get<1>(brg[i]))>>get<0>(brg[i]);
if (get<0>(brg[i])<w[0]) {
cout<<-1<<endl;
return 0;
}
}
sort(brg.begin(),brg.end());
segmentTree.assign(4*m+1,-1);
build(0,m-1,1);
long long re =INT_MAX;
adjList.assign(n,vector<int>());
for (int i=0;i<n;i++){
adjList[i].assign(i,0);
}
do{
long long retmp=0;
vector<long long> acu(n+1);
for (int i=0;i<n;i++) acu[i+1]=acu[i]+w[i];
// from i to j = acu[j+1]-acu[i]
for (int i=1;i<n;i++){
for (int j=i-1;j>=0;j--){
ll wei=acu[i]-acu[j];
wei+=w[i];
auto it = upper_bound(brg.begin(),brg.end(),make_tuple(wei,INT_MIN));
if (it==brg.begin()) {
adjList[i][j]=0;
continue;
}
it--;
int l=it-brg.begin();
adjList[i][j]=get(0,m-1,0,l,1);
}
}
dp.clear();
dp.assign(n,vector<ll>(n,-1));
retmp=getLongest(0,n-1);
if (re>retmp){
re=retmp;
}
}
while (next_permutation(w.begin(),w.end()));
cout<<re<<endl;
return 0;
} |
#include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM()
struct MyExc : exception {};
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N, L; cin >> N >> L;
vector<ll> A(N + 2), B(N + 2);
for (ll i = 1; i <= N; i++) cin >> A[i];
for (ll i = 1; i <= N; i++) cin >> B[i];
A[0] = B[0] = 0;
A[N+1] = B[N+1] = L+1;
auto func = [&](ll st, ll en, ll dir) -> ll {
ll ret = 0;
if (dir > 0) {
if (B[en] + 1 != B[en + 1]) return -1;
ll p = st;
ll q = st;
while (p <= en) {
while (q <= en && B[p] != A[q] - (q - p)) q++;
ret += q - p;
while (p < q && B[p] == A[q] - (q - p)) p++;
}
return ret;
}else {
if (B[st] - 1 != B[st - 1]) return -1;
ll p = en;
ll q = en;
while (p >= st) {
while (q >= st && B[p] != A[q] + (p - q)) q--;
ret += p - q;
while (q < p && B[p] == A[q] + (p - q)) p--;
}
return ret;
}
};
ll st = 0;
ll ans = 0;
ll dir = 0;
try {
for (ll i = 0; i < N + 2; i++) {
if (A[i] == B[i]) {
if (st < i) {
ans += func(st, i - 1, dir);
}
st = i + 1;
}else if (i == st) {
if (B[i] < A[i]) dir = -1;
else dir = 1;
}else if (dir == 1 && B[i] < A[i]) {
throw MyExc();
}else if (dir == -1 && B[i] > A[i]) {
ans += func(st, i - 1, dir);
st = i;
dir = 1;
}
}
cout << ans << endl;
}catch(const MyExc& e) {
cout << -1 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 1000000000000000000;
int main()
{
int n;
ll x;
cin >> n >> x;
ll a[105];
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = INF;
for(int c = 1; c <= n; c++){
ll dp[102][102];
for(int j = 0; j <= c; j++){
for(int k = 0; k < c; k++) dp[j][k] = -INF;
}
dp[0][0] = 0;
for(int i = 0; i < n; i++){
ll d[102][102];
for(int j = 0; j <= c; j++){
for(int k = 0; k < c; k++) d[j][k] = dp[j][k];
}
for(int j = 1; j <= c; j++){
for(int k = 0; k < c; k++) d[j][k] = max(d[j][k], dp[j - 1][(k + c - a[i] % c) % c] + a[i]);
}
swap(dp, d);
}
if(dp[c][x % c] >= 0) ans = min(ans, (x - dp[c][x % c]) / c);
}
cout << ans << endl;
}
|
//#pragma GCC optimize ("O3", "unroll-loops")
//#pragma GCC target ("avx2")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define all_of(v) (v).begin(), (v).end()
#define sort_unique(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define fi first
#define se second
//const int MAXN = 300005;
//const LL INF = (LL) 1e9 + 8763;
const LL MOD = (LL) 1e9 + 7;
using namespace std;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> using maxheap = priority_queue<T, vector<T>, less<T>>;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// function<vector<int>(int, int, int)> func = [&] (int m, int l, int c) {};
LL qpow(LL a, LL pw, LL mod) {
LL res = 1;
a %= mod;
while (pw) {
if (pw & 1) res = res * a % mod;
a = a * a % mod;
pw >>= 1;
}
return res;
}
LL mod_inv(LL a, LL mod) {
// for prime
a %= mod;
return qpow(a, mod - 2, mod);
}
/* fac, C, H */
const int LIM = 2000005; // Double for H(n, k)
LL fac[LIM], finv[LIM];
void init_fac(LL mod) {
fac[0] = finv[0] = 1;
for (int i = 1; i < LIM; i++) {
fac[i] = fac[i - 1] * i % mod;
finv[i] = qpow(fac[i], mod - 2, mod);
}
}
LL C(LL n, LL k, LL mod) {
assert(n < mod && k < mod); // otherwise, use Lucas
if (k > n || n < 0 || k < 0) return 0;
return fac[n] * finv[k] % mod * finv[n - k] % mod;
}
void solve() {
init_fac(MOD);
LL n, m, k;
cin >> n >> m >> k;
if (n - m > k) {
cout << "0\n";
return;
}
cout << (C(n + m, n, MOD) - C(n + m, m + k + 1, MOD) + MOD) % MOD << '\n';
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int tc = 1;
// cin >> tc;
for (int i = 1; i <= tc; i++) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define int long long
int32_t main() {
cin.tie(0); ios_base::sync_with_stdio(false);
int dp[31][31];
dp[0][0] = 1;
for (int i = 0; i <= 30; ++i) {
for (int j = 0; j <= 30; ++j) {
if (i + j == 0) continue;
dp[i][j] = 0;
if (i - 1 >= 0) dp[i][j] += dp[i - 1][j];
if (j - 1 >= 0) dp[i][j] += dp[i][j - 1];
}
}
int a, b, k;
cin >> a >> b >> k;
while (a + b) {
if (a >= 1 && dp[a - 1][b] >= k) cout << 'a', a--;
else {
assert(b);
cout << 'b';
if (a) k -= dp[a - 1][b];
b--;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a + b >= a + c && a + b >= b + c)
{
cout << a + b;
}
else if (a + c >= a + b && a + c >= b + c)
{
cout << a + c;
}
else
{
cout << b + c;
}
}
| #include <iostream>
#include <bits/stdc++.h>
#define inf 1000000007
#define mod 1000000007
#define ll long long
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
using namespace std;
//fast I/O
auto optimizer = []() { // makes I/O fast
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
return 0;
}();
// Snippet for computing ncr and factorials
// All computations done modulo 'mod'
vll fact,ifact;
void compute_factorials(ll n)
{
fact.resize(n+1);
ifact.resize(n+1);
fact[0]=1;ifact[0]=1;
fact[1]=1;ifact[1]=1;
vll inverse_of_number(n+1);
inverse_of_number[0]=1; // inverse is not 1 but taken for easy code
inverse_of_number[1]=1;
for(ll i=2;i<=n;i++)
{
inverse_of_number[i] = (inverse_of_number[mod % i] * (mod - (mod / i)) ) % mod;
fact[i]=(fact[i-1]*i)%mod;
ifact[i]=(ifact[i-1]*inverse_of_number[i])%mod;
}
return;
}
ll ncr(ll n,ll r)
{
if(n<0 || r>n || r<0)
return 0;
ll ans=fact[n];
ans=(ans*ifact[r])%mod;
ans=(ans*ifact[n-r])%mod;
return ans;
}
//DSU start ---
ll find_sets(vector<ll> &v, ll a){
if(v[a] < 0){
return a;
}
return v[a] = find_sets(v,v[a]);
}
void union_sets(vector<ll> &v, ll a, ll b){
a = find_sets(v,a);
b = find_sets(v,b);
if(a != b){
if(v[a] < v[b]){
v[a] += v[b];
v[b] = a;
}
else{
v[b] += v[a];
v[a] = b;
}
}
}
//---end DSU
//power mode where (x^y) % p is calculated in log (y) time
int power(ll x, ll y, ll p)
{
int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1; // y = y/2
x = (x*x) % p;
}
return res;
}
void print(vector<ll> &vect){
for(auto num : vect){
cout << num << " ";
}
cout << endl;
}
void printll(vector<vector<ll>> &vect){
for(auto num : vect){
for(auto itr : num){
cout << itr << " ";
}
cout << endl;
}
}
//seive
ll N = 1e5;
vll lpf(N+1,0);
void leastPrimeFactor(){
lpf[1] = 1;
for (int i = 2; i <= N; i++){
if(lpf[i] == 0){
lpf[i] = i;
for (int j = 2*i; j <= N; j += i){
if (lpf[j] == 0){
lpf[j] = i;
}
}
}
}
}
//Code -
int main() {
ll n,i,j,t,m,temp,k,z;
ll a,b,c;
cin >> a >> b >> c;
cout << max((a+b),max((b+c),(c+a)));
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin>>N;
vector<string> S(N);
rep(i,N) cin>>S[i];
vector<vector<int>> D(N,vector<int> (N,0));
rep(i,N) rep(j,N) D[i][j]=S[i][j]-'0';
rep(i,N) D[i][i]=1;
for(int k=0;k<N;k++){
for(int i=0;i<N;i++) for(int j=0;j<N;j++){
if(D[i][k]&&D[k][j]) D[i][j]=1;
}
}
vector<int> num(N,0);
rep(i,N) rep(j,N) num[j]+=D[i][j];
double ans=0.0;
rep(i,N) ans+=1.0/(double)num[i];
cout<<fixed<<setprecision(15)<<ans<<endl;
return 0;
}
| #include <bits/stdc++.h>
#define N 105
using namespace std;
template <typename T>
inline void read(T &num) {
T x = 0, f = 1; char ch = getchar();
for (; ch > '9' || ch < '0'; ch = getchar()) if (ch == '-') f = -1;
for (; ch <= '9' && ch >= '0'; ch = getchar()) x = (x << 3) + (x << 1) + (ch ^ '0');
num = x * f;
}
int n, e[N][N], cnt[N];
long double ans;
bool vis[N];
void dfs(int x) {
vis[x] = 1; cnt[x]++;
for (int i = 1; i <= n; i++) {
if (e[x][i] && !vis[i]) dfs(i);
}
}
long double calc(int x) {
long double res = x * 1.0 / (x+1);
return res;
}
int main() {
// freopen("1.in", "r", stdin);
read(n); ans = n;
for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
scanf("%1d", &e[i][j]);
}
for (int i = 1; i <= n; i++) {
memset(vis, 0, sizeof(vis));
dfs(i); cnt[i]--;
}
for (int i = 1; i <= n; i++) {
long double now = calc(cnt[i]);
ans -= now;
}
printf("%.20Lf\n", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace::std;
int main() {
int N;
cin >> N;
int p = 0;
int i = 0;
while(p < N) {
p += i + 1;
i += 1;
}
cout << i << endl;
} |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#if __cplusplus >= 201402L
#include <shared_mutex>
#endif
#if __cplusplus >= 201703L
#include <any>
#include <charconv>
// #include <execution>
#include <filesystem>
#include <optional>
#include <memory_resource>
#include <string_view>
#include <variant>
#endif
#if __cplusplus > 201703L
#include <barrier>
#include <bit>
#include <compare>
#include <concepts>
#if __cpp_impl_coroutine
# include <coroutine>
#endif
#include <latch>
#include <numbers>
#include <ranges>
#include <span>
#include <stop_token>
#include <semaphore>
#include <source_location>
#include <syncstream>
#include <version>
#endif
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r", stdin);
freopen("output.txt","w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long n;
cin>>n;
long ans;
for(int i=1;i<pow(10,5);i++){
ans=i*(i+1);
ans=ans/2;
if(ans>=n){cout<<i;
break;}
}
}
|
//g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define P pair<ll,ll>
ll MOD = 1e9 + 7;
int INF = 1 << 30;
ll INFL = 1LL << 60;
ll MODP = 998244353;
ll lmax(ll x,ll y){
if(x < y) return y;
else return x;
}
ll lmin(ll x, ll y){
if(x > y)return y;
else return x;
}
ll gen(ll x,ll y){
if(y == 0)return 1;
if(y == 1)return x;
if(y%2 == 1){
return ((x%MOD)*gen(x,y-1)%MOD)%MOD;
}else{
ll res = gen(x,y/2)%MOD;
return ((res%MOD)*(res%MOD))%MOD;
}
}
ll gcd(ll x, ll y){
if(x < y) swap(x,y);
if(y == 0) return x;
return gcd(y,x%y);
}
ll lcm(ll x,ll y){
ll s = gcd(x,y);
x /= s;
y /= s;
return x*y*s;
}
int main(){
int n;
cin >> n;
int ans = 0;
for(int i = 1;i <= n;i++){
int m = i;
bool ok1 = true,ok2 = true;
while(m > 0){
if(m%10 == 7){
ok1 = false;
}
m /= 10;
}
m = i;
while(m > 0){
if(m%8 == 7){
ok2 = false;
}
m /= 8;
}
if(ok1 && ok2)ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
struct Edge {
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
const int MAX = 10000000;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
const ll INF = LLONG_MAX;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
/****** define constant end ********/
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \
debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
std::cerr << " " << h;
if (sizeof...(t) > 0) std::cout << " :";
debug_out(t...);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
for (std::size_t i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
return a > b && (a = b, true);
}
int solve() {
ll n;
cin >> n;
vl p(n);
vector<bool> m(200005);
REP(i, n){
cin >> p[i];
}
ll now = 0;
REP(i, n){
m[p[i]] = true;
FOR(j, now, 200005){
if(!m[j]){
cout << j << endl;
if(now < j){
now = j;
}
break;
}
}
}
return 0;
}
int main() {
// clock_t start = clock();
cout << std::fixed << std::setprecision(10);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int end_solve = solve();
/*
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC *
1000.0; printf("time %lf[ms]\n", time);
*/
return end_solve;
}
|
Subsets and Splits