code1
stringlengths 54
12k
| code2
stringlengths 66
12k
| similar
int64 0
1
| __index_level_0__
int64 24
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
int n,k;
vector<pi>spots;
int arr[55][55];
int psum[55][55];
vector<ll>y_index;
vector<ll>x_index;
vector<ll>::iterator it;
long long minarea = numeric_limits<long long>::max();
void solve(){
for(int y_start=0; y_start<y_index.size(); y_start++){
for(int y_fin = y_start+1; y_fin<y_index.size(); y_fin++){
for(int x_start = 0; x_start<x_index.size(); x_start++){
for(int x_fin = x_start+1; x_fin<x_index.size(); x_fin++){
int num = psum[y_fin+1][x_fin+1]-psum[y_start][x_fin+1]-psum[y_fin+1][x_start]+psum[y_start][x_start];
if(num>=k){
long long x = x_index[x_fin]-x_index[x_start];
long long y = y_index[y_fin]-y_index[y_start];
minarea = min(minarea,x*y);
}
}
}
}
}
}
int main(){
cin>>n>>k;
for(int i=0; i<n; i++){
long long x,y;
cin>>x>>y;
spots.push_back(pi(y,x));
x_index.push_back(x);
y_index.push_back(y);
}
sort(all(y_index));
sort(all(x_index));
y_index.erase(unique(all(y_index)),y_index.end());
x_index.erase(unique(all(x_index)),x_index.end());
for(int i=0; i<spots.size(); i++){
int y = spots[i].first;
int x = spots[i].second;
it = lower_bound(all(y_index),y);
int yindex = (int)(it-y_index.begin()+1);
it = lower_bound(all(x_index),x);
int xindex = (int)(it-x_index.begin()+1);
arr[yindex][xindex]++;
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
psum[i][j] = arr[i][j];
psum[i][j]+=psum[i][j-1];
}
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) psum[i][j]+=psum[i-1][j];
}
solve();
cout<<minarea;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
const int MOD = 1e9 + 7;
int main()
{
int n;
cin >> n;
rep(i,n/4+1){
rep(j,n/7+1){
if(4*i+7*j==n){
cout << "Yes" << endl;
return (0);
}
}
}
cout << "No" << endl;
return (0);
} | 0 | 40,576,230 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> vals(n + 1);
for (int i = 0; i < n; i++) {
cin >> vals[i + 1];
}
vector<int> adj[n + 1];
for (int i = 0; i < m; i++) {
int p, q;
cin >> p >> q;
adj[p].push_back(q);
adj[q].push_back(p);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!adj[i].size()) {
ans++;
continue;
}
bool ok = 1;
for (int j = 0; j < adj[i].size(); j++) {
if (vals[adj[i][j]] >= vals[i]) {
ok = 0;
break;
}
}
if (ok) ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t % mod;
} else {
return modpow(m, n - 1) * m % mod;
}
}
long long power(long long m, long long n) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t;
} else {
return modpow(m, n - 1) * m;
}
}
long long moddiv(long long a, long long b) { return (a * modpow(b, mod - 2)) % mod; }
const ll INF = 1LL << 60;
void print_binary(long long a) {
for (int i = 31; i >= 0; i--) {
cout << (a >> i & 1);
}
cout << endl;
}
ll nCkmod(ll n, ll k) {
ll denomi = 1;
for (int i = n; i > n - k; i--) {
denomi *= i;
denomi %= mod;
}
ll numera = 1;
REP(i, k) {
numera *= (i + 1);
numera %= mod;
}
return moddiv(denomi, numera);
}
vector<vector<ll>> graph;
vector<ll> as;
vector<ll> ans;
ll memo[101][100001];
void dfs(ll cur, ll parent) {
ans[cur] = ans[parent] + as[cur];
REP(i, graph[cur].size()) {
if (graph[cur][i] != parent) {
dfs(graph[cur][i], cur);
}
}
}
int main() {
ll n, q;
cin >> n >> q;
graph.resize(n);
ans.resize(n);
REP(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
as.resize(n);
REP(i, q) {
int p, x;
cin >> p >> x;
p--;
as[p] += x;
}
dfs(0, 0);
for (auto x : ans) {
cout << x << " ";
}
} | 0 | 31,021,152 |
#include<iostream>
using namespace std;
int main(void)
{
int a,b,x;
cin >> a >> b >> x;
for(int i=0;i<=b;i++)
if(a+i==x)
{
cout << "YES";
return 0;
}
cout << "NO";
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
int n = 0;
for (auto e : vec) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& st) {
int n = 0;
for (auto e : st) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::map<T, U>& mp) {
int n = 0;
for (auto e : mp) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& e : vec) is >> e;
return is;
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out() { std::cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head&& head, Tail&&... tail) {
std::cerr << head;
if (sizeof...(Tail) != 0) std::cerr << ", ";
debug_out(std::forward<Tail>(tail)...);
}
using namespace std;
using int64 = long long;
int main() {
const int64 divide_by = 1e9 + 7;
int64 N, K;
cin >> N >> K;
int64 tmp = K;
int64 ans = 0;
while (tmp <= N + 1) {
int64 sm = (-1) * pow(tmp, 2) + tmp * (N + 1) + 1;
int64 amari = sm % divide_by;
ans += amari;
tmp++;
}
cout << ans % divide_by << endl;
return 0;
} | 0 | 53,134,167 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<P> RED;
rep(i, n) {
int a, b;
cin >> a >> b;
RED.push_back({-b, a});
}
sort(RED.begin(), RED.end());
rep(i, n) {
RED[i].first *= -1;
}
vector<P> BULE;
rep(i, n) {
int c, d;
cin >> c >> d;
BULE.push_back({c, d});
}
sort(BULE.begin(), BULE.end());
vector<bool> check(n, false);
int ans = 0;
rep(i, n) {
rep(j, n) {
if (check[j]) continue;
if (BULE[i].first > RED[j].second && BULE[i].second > RED[j].first) {
check[j] = true;
ans++;
break;
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
int main() {
ll n, l, t;
cin >> n >> l >> t;
vector<pair<ll, ll>> v(n);
vector<ll> u(n);
ll k = 0;
ll cnt = n*MOD;
for (ll i = 0; i < n; ++i) {
ll a, b;
scanf("%li %li", &a, &b);
v[i] = make_pair(a, b);
u[i] = ((a+(b == 1 ? t : -t) + l*MOD)%l);
if(i == 0) k = u[i];
if(b == 1) cnt -= (t-l+a+l)/l;
else cnt += (t-a-1+l)/l;
}
cnt %= n;
sort(u.begin(), u.end());
for (int i = 0; i < n; ++i) {
printf("%li\n", u[(-cnt+n+i)%n]);
}
return 0;
} | 0 | 81,334,592 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, X = 0;
int max;
cin >> N;
vector<string> s(N);
for(int i = 0; i < N ; i++) {
cin >> s.at(i);
}
cin >> M;
vector<string> t(M);
for(int i = 0; i < M ; i++) {
cin >> t.at(i);
}
max = 0;
for(int i = 0; i < N ; i++) {
for(int j = M-1; j >= 0 ; j--) {
if(s.at(i) == t.at(j) && t.at(j) != "") {
X--;
t.at(j) = "";
}
}
for(int k = N-1; k >= i; k--) {
if(s.at(i) == s.at(k) && s.at(k) != "") {
X++;
s.at(k) = "";
}
}
if(max < X) {
max = X;
}
X = 0;
}
cout << max << endl;
} | #include <iostream>
#include <vector>
#include<list>
#include <algorithm>
#include <string>
#include <math.h>
#include<map>
#include <utility>
#include<queue>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define INF (1e10)
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
#define MOD 1000000007
template<typename T>
int vector_finder(std::vector<T> vec, T number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
template<typename T>
T gcd(T a,T b){
if(b>0){
return gcd(b, a % b);
}else{
return a;
}
}
template<typename T>
T lcm(T a,T b){
T g = gcd(a, b);
return a * b / g;
}
void clear( std::queue<pair<int,int> > &q )
{
std::queue<pair<int,int> > empty;
std::swap( q, empty );
}
bool IsPrime(int num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
template<typename T>
std::vector<T> enum_div(T n)
{
std::vector<T> ret;
for(T i=1 ; i*i<=n ; ++i)
{
if(n%i == 0)
{
ret.push_back(i);
if(i!=1 && i*i!=n)
{
ret.push_back(n/i);
}
}
}
return ret;
}
int N,M;
int main()
{
cin>>N;
long long a[N];
long long mx=0;
int idx=0;
REP(i,0,N){
cin>>a[i];
if(a[i]>mx){
mx=a[i];
idx=i;
}
}
long long mx2=mx/2;
long long dif=INF;
int id=0;
REP(i,0,N){
if(dif>abs(a[i]-mx2)){
dif=abs(a[i]-mx2);
id=i;
}
}
if(a[idx]==100&&a[id]==100){
cout<<100<<" "<<0<<endl;
}else{
cout<<a[idx]<<" "<<a[id]<<endl;
}
return 0;
} | 0 | 86,928,018 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ll ans = a[0];
for (int i = 1; i < n; i++) {
ans = gcd(ans, a[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using edge = struct {int to; ll cost;};
#define mod 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1 << 29)
void solve()
{
int n;
cin >> n;
list<pair<int, int>> red, bule;
REP(i, n) {
int a, b;
cin >> a >> b;
red.push_back(make_pair(a, b));
}
REP(i, n) {
int c, d;
cin >> c >> d;
bule.push_back(make_pair(c, d));
}
bule.sort();
int ans = 0;
for(auto b : bule){
int y = -1;
auto removeItem = red.end();
for(auto itr = red.begin(); itr != red.end(); ++itr){
if(b.first > (*itr).first && b.second > (*itr).second) {
if(y < (*itr).second) {
y = (*itr).second;
removeItem = itr;
}
}
}
if(removeItem != red.end()) {
red.erase(removeItem);
ans++;
}
}
cout << ans << "\n";
}
int main()
{
solve();
return 0;
} | 0 | 56,368,568 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;
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; }
string s;
int main() {
cin >> s;
int cb = 0;
ll ans = 0;
for (auto c : s) {
if (c == 'B') {
cb++;
}
else {
ans += cb;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 100000000
int n,a,b,c,ans=INF;
vector<int> l;
void dfs(int A,int B,int C,int number,int MP){
if(number==n){
if(!(A==0 || B==0 || C==0)){
ans=min(ans,MP+abs(A-a)+abs(B-b)+abs(C-c));
}
return;
}
dfs(A+l[number],B,C,number+1,MP+10);
dfs(A,B+l[number],C,number+1,MP+10);
dfs(A,B,C+l[number],number+1,MP+10);
dfs(A,B,C,number+1,MP);
return;
}
int main(){
cin>>n>>a>>b>>c;
l.resize(n);
for(int i=0;i<n;i++){cin>>l[i];}
dfs(0,0,0,0,0);
cout<<ans-30<<endl;
return 0;
} | 0 | 49,162,663 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int M;
cin >> M;
ll S = 0, D = 0;
for (int i = 0; i < M; i++) {
ll d, c;
cin >> d >> c;
S += d * c;
D += c;
}
cout << D - 1 + (S - 1) / 9 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 2000000000
typedef long long ll;
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
int main() {
ll N;
cin >>N;
ll n = sqrt(N)+1;
ll max=1;
rep2(i,n){
if((N%i) == 0){
max = i;
}
}
ll ans = max + N/max -2;
cout << ans << endl;
return 0;
} | 0 | 49,565,726 |
#include <bits/stdc++.h>
using namespace std;
static const int INFH = (1<<30)-1;
static const int INFL = -INFH;
vector<pair<char, int>> runLength(string x)
{
char now = x[0];
int count = 1;
vector<pair<char, int>> ret;
for (int i = 1; i < x.size(); ++i)
{
if(x[i] != now)
{
ret.push_back(make_pair(now, count));
now = x[i];
count = 1;
}
else
{
++count;
}
}
ret.push_back(make_pair(now, count));
return ret;
}
long long int wa(long long int x)
{
if (x%2==0)
{
return (long long int)((x/2)*(x+1));
}
else
{
return (long long int)(x*((x+1)/2));
}
}
int main()
{
string in;
cin >> in;
vector<pair<char, int>> r = runLength(in);
long long int ans = 0;
if(r.size() == 1)
{
cout << wa(r[0].second) << endl;
return 0;
}
for (int i = 0; i < r.size(); ++i)
{
if(i == 0 && r[i].first == '>')
{
ans += wa(r[i].second);
}
else if (i == r.size() - 1 && r[i].first == '<')
{
ans += wa(r[i].second);
}
else
{
ans += wa(max(r[i].second, r[i + 1].second)) + wa(min(r[i].second, r[i + 1].second)-1);
++i;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
int main()
{
int w, h;
cin >> w >> h;
vector<int> p(w), q(h);
rep(i, w)
{
cin >> p[i];
}
rep(i, h)
{
cin >> q[i];
}
using A = pair<int, int>;
vector<A> axes;
rep(i, w)
{
axes.push_back(make_pair(p[i], 0));
}
rep(i, h)
{
axes.push_back(make_pair(q[i], 1));
}
sort(axes.begin(), axes.end());
int64_t result = 0;
int x = 0, y = 0;
rep(i, w + h)
{
int v;
int dir;
tie(v, dir) = axes[i];
if (dir == 0) {
result += (int64_t)v * (h + 1 - y);
x++;
} else {
result += (int64_t)v * (w + 1 - x);
y++;
}
}
cout << result << endl;
return 0;
} | 0 | 98,690,852 |
#include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int,int> pii;
int a, c;
string b;
signed main()
{
cin >> a >> b;
int res = 0;
c += b[0]-'0', c*=10;
c += b[2]-'0', c*=10;
c += b[3]-'0';
res = a * c / 100;
cout << res << '\n';
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
#define int ll
signed main(){
int H,W;
cin >> W >> H;
vector<int>p(W),q(H);
for(auto & e : p) cin >> e;
for(auto & e : q) cin >> e;
using pi = pair<int,int>;
vector<pi>v;
for(auto e : p)
v.push_back({e,1});
for(auto e : q)
v.push_back({e,0});
sort(v.begin(),v.end());
int pc = 0,qc = 0;
int sum = 0;
for(auto e : v){
int cost = e.first, isP = e.second;
if(isP){
int cnt = H - qc + 1;
sum += cnt * cost;
++pc;
} else {
int cnt = W - pc + 1;
sum += cnt * cost;
++qc;
}
}
cout << sum << endl;
} | 0 | 87,458,639 |
#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;
map<string, int> mp;
rep(i,n) {
string s;
cin >> s;
sort(s.begin(), s.end());
mp[s]++;
}
ll ans = 0;
for (auto m : mp) {
if (m.second < 2) continue;
ans += (ll) m.second * (m.second - 1) / 2;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define itfr(it,x) for(it=x.begin();it!=x.end();it++)
#define flash ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
int main()
{
flash;
ll T=1,t,n,m,q,k,i,j;
while(T--)
{
cin>>n>>k;
string s;
cin>>s;
vector<pair<ll,ll>> rng;
rng.pb(mp(0,0));
FOR(i,0,s.length())
{
if(s[i]=='1')
{
j=i;
while (s[j]=='1')
j++;
rng.pb(mp(i,j));
i = j-1;
}
}
rng.pb(mp(s.length(),s.length()));
ll ans=0;
FOR(i,0,rng.size())
{
j = min(i+k,(ll)rng.size()-1);
ll len = rng[j].s - rng[i].f;
ans = max(ans,len);
}
cout<<ans<<endl;
}
} | 0 | 16,286,906 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int m, h;
cin >> s;
while(s != "-") {
cin >> m;
for(int i = 0;i < m;i++) {
cin >> h;
s = s.substr(h, s.size() - h) + s.substr(0, h);
}
cout << s << endl;
cin >> s;
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main() {
int N, M;
cin >> N >> M;
vector<int>p(N);
for (int i = 0; i < N; i++){
cin >> p.at(i);
}
UnionFind UF(N);
for (int i = 0; i < M; i++){
int X, Y;
cin >> X >> Y;
X -= 1;
Y -= 1;
UF.unite(X, Y);
}
int count = 0;
for (int i = 0; i < N; i++){
if (UF.same(p.at(i)-1, i)){
count++;
}
}
cout << count << endl;
return 0;
} | 0 | 6,811,227 |
#include "iostream"
#include "string"
int Dice[6];
class DiceMove
{
private:
public:
DiceMove(){}
void Move(char dir) {
int temp;
if (dir == 'N') {
temp = Dice[0];
Dice[0] = Dice[1];
Dice[1] = Dice[5];
Dice[5] = Dice[4];
Dice[4] = temp;
}
if (dir == 'S') {
temp = Dice[0];
Dice[0] = Dice[4];
Dice[4] = Dice[5];
Dice[5] = Dice[1];
Dice[1] = temp;
}
if (dir == 'E') {
temp = Dice[0];
Dice[0] = Dice[3];
Dice[3] = Dice[5];
Dice[5] = Dice[2];
Dice[2] = temp;
}
if (dir == 'W') {
temp = Dice[0];
Dice[0] = Dice[2];
Dice[2] = Dice[5];
Dice[5] = Dice[3];
Dice[3] = temp;
}
}
};
int main()
{
int n, fr, up, count = 0;
char dir;
DiceMove move;
std::string direction;
for (int i = 0; i < 6; i++)
std::cin >> Dice[i];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> up >> fr;
while (1) {
if (Dice[1] == up && Dice[0] == fr) {
move.Move('W');
move.Move('W');
move.Move('N');
}
if (Dice[0] == up && Dice[1] == fr) break;
else {
if (count == 3) {
move.Move('W');
count = 0;
}
else {
move.Move('N');
count++;
}
}
}
std::cout << Dice[2] << std::endl;
count = 0;
}
return 0;
} | #include<bits/stdc++.h>
#define hell 1000000007
#define M 1000000007
#define Maxi 10000000000000000
#define lcm(a,b) (a*b)/__gcd(a,b)
#define ll long long
#define vll vector<ll>
#define vi vector<long long>
#define pll vector< pair<ll,ll> >
#define pb push_back
#define all(v) v.begin(),v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define F first
#define S second
#define rep(i,a,b) for(i=a;i<b;i++)
#define parr(a,n) for(i=0;i<n;i++) cout<<a[i]<<" ";cout<<endl;
#define pcont(a) for(auto i:a) cout<<i<<" ";cout<<endl;
#define ret(x) return cout<<x,0;
#define dbg(x) cout << #x << " is " << x << endl;
#define endl '\n'
#define pi 3.141592653589793238
#define trace(x) cerr << #x << ": " << x << endl;
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << endl;
#define trace4(a, b, c, d) cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " << #f << ": " << f << endl;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll n;
cin>>n;
ll ans=n*(n-1)/2;
cout<<ans<<endl;
} | 0 | 59,683,583 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a>=b&&c>=d)
{
b=b+d;
cout<<b;
}
else if(a<=b&&c<=d)
{
a=a+c;
cout<<a;
}
else if(a>=b&&c<=d)
{
b=b+c;
cout<<b;
}
else if(a<=b&&c>=d)
{
a=a+d;
cout<<a;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL,LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI;
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<int>> PQLP;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EB emplace_back
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define SORTR(c) sort((c).rbegin(), (c).rend())
#define LB lower_bound
#define UB upper_bound
#define NEXP next_permutation
#define FI first
#define SE second
#define Vmin(a) *min_element((a).begin(),(a).end())
#define Vmax(a) *max_element((a).begin(),(a).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REPR(i,n) FORR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX/2;
const LL LINF = LLONG_MAX/3;
const int RINF = INT_MIN/2;
const LL RLINF = LLONG_MIN/3;
const LL MOD = 1e9+7;
const LL MODD = 998244353;
const int MAX = 510000;
inline bool Eq(double a, double b) { return fabs(b - a) < EPS; }
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; }
#define COUT(x) cout << (x) << endl
#define COUT2(x,y) cout << (x) << " " << (y) << endl
#define COUT3(x,y,z) cout << (x) << " " << (y) << " " << (z) << endl
#define PR(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
#define BC(x) __builtin_popcountll(x)
VI dx = {1,0,-1,0,1,1,-1,-1};
VI dy = {0,1,0,-1,1,-1,1,-1};
VC dc = {'R','D','L','U'};
VS ds = {"R","D","L","U","RD","RU","LD","LU"};
LL Gcd(LL a, LL b) {return __gcd(a,b);}
LL Lcm(LL a, LL b) {return a/Gcd(a,b)*b;}
LL ModPow(LL A, LL N, LL M){
LL res = 1;
while(N>0){
if(N&1) res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
template<class T> void VCout(vector<T> &v){
int N = SZ(v);
REP(i,N){
cout << v.at(i);
if(i == N-1) cout << endl;
else cout << " ";
}
return;
}
int main() {
cout << fixed << setprecision(12);
int K; cin >> K;
deque<PII> deq;
deq.EB(1,1);
int ans;
VB used(K,false);
while(1){
PII now = deq.front(); deq.POF();
if(used.at(now.FI)) continue;
if(now.FI%K == 0){
ans = now.SE;
break;
}
used.at(now.FI) = true;
deq.EB((now.FI+1)%K,now.SE+1);
deq.emplace_front((now.FI*10)%K,now.SE);
}
COUT(ans);
return 0;
} | 0 | 15,236,373 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
typedef pair<ll,ll> pll;
const int N = 1e2+2;
const int INF = 1e9;
int n, m;
int dr[2] = {0,1};
int dc[2] = {1,0};
int dp[N][N];
char ar[N][N];
bool inRange(int r, int c)
{
return r >= 1 && r <= n && c >= 1 && c <= m;
}
int solve(int r, int c)
{
if (r == n && c == m)
return ar[r][c] == '#';
if (dp[r][c] != -1)
return dp[r][c];
int ret = INF;
for (int i = 0; i < 2; i++)
{
int nr = r + dr[i];
int nc = c + dc[i];
if (!inRange(nr,nc))
continue;
ret = min(ret, solve(nr,nc) + (ar[r][c] == '#' && ar[nr][nc] == '.'));
}
return dp[r][c] = ret;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
cin >> ar[i][j];
}
}
memset(dp,-1,sizeof(dp));
cout << solve(1,1) << '\n';
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll h,w,m,a,b,k;
cin>>h>>w;
if(h%3==0||w%3==0){
cout<<0;
return 0;
}
if(h>w){
m=w;
}else{
m=h;
}
a=(h+1)/3;
b=w/2;
k=max({a*w,(h-a)*b,(h-a)*(w-b)})-min(a*w,(h-a)*b);
if(m>k){
m=k;
}
a=(w+1)/3;
b=h/2;
k=max({a*h,(w-a)*b,(w-a)*(h-b)})-min(a*h,(w-a)*b);
if(m>k){
m=k;
}
cout<<m;
} | 0 | 41,469,065 |
#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>;
ll n;
ll ans = 0;
int f(ll x){
ll m = n/x-1;
if(m != 0) if(n/m == n%m) ans += m;
return 0;
}
int main(){
cin >> n;
ll n_ya = n;
for(ll i_ya = 1; i_ya * i_ya <= n_ya; i_ya++){
if(n_ya % i_ya == 0){
f(i_ya);
if(i_ya != n_ya/i_ya){
f(n_ya/i_ya);
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end()
#define sz(x) (x).size()
ll gcd(ll a, ll b);
ll sum(int n);
void go(){
int n;cin>>n;
double s=0;
while(n--){
int x;cin>>x;
s+=(double) 1/x;
}
double ans=(double) 1 / s;
cout << ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
go();
return 0;
}
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll sum(int n){
if(n == 0){
return n;
}else{
return sum(n/10) + n%10;
}
} | 0 | 24,710,827 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using namespace std;
ll n, k;
const ll mod = 1000000007;
int main(){
int n, k;
cin >> n >> k;
if(n%k==0) out(0);
else out(1);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(n, 0));
vector<vector<int>> b(n, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--; y--;
a.at(x).at(y) = 1;
b.at(y).at(x) = 1;
}
vector<int> order(n);
for (int i = 0; i < n; i++) {
order.at(i) = i;
}
int ans = 0;
do {
if (order.at(0) != 0) { continue; }
bool ok = true;
for (int i = 1; i < n; i++) {
int from = order.at(i-1);
int to = order.at(i);
if (a.at(from).at(to)) { continue; }
if (b.at(from).at(to)) { continue; }
ok = false;
}
if (ok) { ans++; }
} while (next_permutation(order.begin(), order.end()));
cout << ans << endl;
return 0;
} | 0 | 25,420,580 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool valid(int lx,int ux,int ly,int uy,int x,int y){
return lx<=x&&x<ux&&ly<=y&&y<uy;
}
ll power(ll x,ll p){
if(p==0)return 1;
ll res=power(x*x%mod,p/2);
if(p%2==1)res=res*x%mod;
return res;
}
ll f2(int n, int p, string s){
ll ans=0;
reverse(all(s));
rep(i,n){
if((s[i]-'0')%p==0) ans += (n-i);
}
return ans;
}
ll f5(int n, int p, string s){
ll ans=0;
reverse(all(s));
rep(i,n){
if((s[i]-'0')%p==0) ans += (n-i);
}
return ans;
}
ll fp(int n, int p, string s){
ll ans=0;
reverse(all(s));
vector<int> res(n,0);
rep(i,n){
res[i] = (s[i]-'0') % p;
}
ll ten=10;
repi(i,1,n){
res[i] = (res[i]*ten + res[i-1]) % p;
ten = ten*10 % p;
}
map<int, ll>mp;
rep(i,n){
mp[res[i]] += 1;
}
rep(i,p) ans += mp[i] * (mp[i]-1)/2;
ans += mp[0];
return ans;
}
int main()
{
int n,p;
string s;
cin>>n>>p>>s;
ll ans;
if(p==2) ans = f2(n,p,s);
else if(p==5) ans = f5(n,p,s);
else ans = fp(n,p,s);
cout<<ans<<endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
string s;
ll k;
cin >> s >> k;
ll count=0;
char ans=0;
for(int i=0;i<s.size();i++){
if(s[i]=='1'){
count++;
if(count==k){
ans='1';
break;
}
}else{
ans=s[i];
break;
}
}
cout << ans << endl;
return 0;
} | 0 | 31,218,732 |
#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
#define ll __int64
const int INF=111111111;
int n,k;
int a[111111];
const int N=5005;
const int K=5005;
bool dp[N][K];
int t[N];
void dynamic_programming(int x){
rep(i,N)rep(j,K)dp[i][j]=0;
int pos=0;
rep(i,n)if(x!=i)t[pos++]=a[i];
dp[0][0]=1;
rep(i,pos){
rep(j,K+1){
if(dp[i][j]){
if(j+t[i]<=K){dp[i+1][j+t[i]]=1;}
dp[i+1][j]=1;
}
}
}
}
int main(){
cin>>n>>k;
rep(i,n)cin>>a[i];
sort(a,a+n);
int ans=0;
int l=-1,r=n,mid=(l+r)/2;
while(r-l>1){
bool is=0;
dynamic_programming(mid);
if(k-a[mid]<=0)is=1;
else for(int j=k-a[mid];j<k;j++)if(dp[n-1][j])is=1;
if(!is)l=mid;
else r=mid;
mid=(r+l)/2;
}
cout<<r<<endl;
return 0;
} | #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; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
template<class T> void warshall_floyd(vector<T>& G){
int N = G.size();
REP(k,N){
REP(i,N){
REP(j,N){
G[i][j] = min(G[i][j], G[i][k]+G[k][j]);
}
}
}
}
int main() {
int N,M; cin >> N >> M;
vector<vector<int>> G(N,vector<int>(N,INF));
REP(i,N){
G[i][i] = 0;
}
REP(i,M){
int a,b,c; cin >> a >> b >> c;
a--;
b--;
G[a][b] = c;
G[b][a] = c;
}
vector<vector<int>> G_origin(G);
warshall_floyd(G);
int ans = 0;
REP(i,N){
FOR(j,i+1,N){
if(G[i][j]!=G_origin[i][j] && G_origin[i][j]!=INF) ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 49,030,202 |
#include<bits/stdc++.h>
#pragma GCC optimize("O2")
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define endl "\n"
#define forn(i,x,n) for(int i=x; i<n; i++)
#define forit(it, m) for(decltype(m)::iterator it = m.begin(); it!=m.end(); ++it)
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void zeus()
{
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 fast_pow(long long base, long long n, long long M)
{
if (n == 0)
return 1;
if (n == 1)
return base;
long long halfn = fast_pow(base, n / 2, M);
if (n % 2 == 0)
return ( halfn * halfn ) % M;
else
return ( ( ( halfn * halfn ) % M ) * base ) % M;
}
int findMMI_fermat(int n, int M)
{
return fast_pow(n, M - 2, M);
}
int32_t main() {
zeus();
int s,w; cin>>s>>w;
if(w>=s){
cout<<"unsafe"<<endl;
}
else{
cout<<"safe"<<endl;
}
} | #include <bits/stdc++.h>
#define PB emplace_back
using namespace std;
const int N = 5e5+100;
int par[N], sz[N];
vector<int>com[N];
int fat(int x) {
while(x != par[x]) x = par[x];
return x;
}
void add(int u, int v) {
u = fat(u);
v = fat(v);
if(u != v) {
if(sz[u] < sz[v]) swap(u, v);
sz[u] += sz[v];
for(int uu: (com[v])) com[u].PB(uu);
par[v] = u;
com[v].clear();
}
}
int main () {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n, m;
cin >> n >> m;
iota(par, par + n , 0);
fill(sz, sz + n, 1);
for(int i = 0 ; i < n ; i++ ) {
com[i].PB(i);
}
while(m--) {
int t, u1, u2;
cin >> t >> u1 >> u2;
if(t) cout << (fat(u1) == fat(u2)) << '\n';
else add(u1, u2);
}
} | 0 | 6,289,328 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
#define MODSIZE 1000000007
int main(){
int n;
scanf("%d", &n);
if(n < 1200) printf("ABC\n");
else printf("ARC\n");
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=(n)-1;i>=0;i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int,int>
#define vp vector<par<int,int>>
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a,0,sizeof(a))
#define inf (1ll<<60)
#define Yes(f) cout<<(f?"Yes":"No")<<endl
#define yes(f) cout<<(f?"yes":"no")<<endl
#define YES(f) cout<<(f?"YES":"NO")<<endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
using namespace std;
const int mod=1e9+7;
const string sp=" ";
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(12);
}
signed main(){
init();
run();
return 0;
}
void run(){
int n;
cin>>n;
cout<<180*(n-2)<<endl;
} | 0 | 56,950,195 |
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
ll gcd(ll a,ll b){
if(a%b==0)return b;
else return gcd(b,a%b);
}
int main(){
ll a,b,c,d;
cin >>a>>b>>c>>d;
ll total=b-a+1;
ll cd=c*d/gcd(c,d);
ll tmp1=b/c-(a-1)/c;
ll tmp2=b/d-(a-1)/d;
ll tmp3=b/cd-(a-1)/cd;
cout <<total-tmp1-tmp2+tmp3<<endl;
} | #include <stdio.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <cctype>
#include <iostream>
#include <vector>
#include <deque>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repi(i,l,n) for(int (i)=(int)(l);(i)<(int)(n);(i)++)
#define d_arr(arr, h, w) rep(i,(h) ){ cout << "["; rep(j,(w) ) { cout << (arr)[i][j] << ", "; } cout << "]" << endl;}
typedef pair<int ,int> P;
string a[] = {".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"};
int main()
{
int n;
int index;
int count=0;
string s;
int loop;
cin >> loop;
rep(i, loop)
{
string s;
cin >> s;
rep(j, s.size() )
{
string st;
st[0] = s[j];
n = atoi( &st[0] );
if( n == 0 && count == 0) { continue; }
else if( n == 0 )
{
cout << a[index - 1][(count - 1) % a[index - 1].size() ];
count = 0;
}
else
{
index = n;
count++;
}
}
cout << endl;
}
} | 0 | 53,149,561 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
#define debug(x) (cout << # x ": " << x << endl)
#define int long long int
#define repeat(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
signed main() {
double l;
cin >> l;
printf("%.12f", pow(l / 3, 3));
return 0;
} | #include <iostream>
#include <cstdio>
#include <list>
#include <algorithm>
using namespace std;
int main() {
int n,x;
char a[20];
list<int> v;
cin>>n;
for (int i=0;i<n;i++){
scanf("%s", a);
if(a[0]=='i'){
cin>>x;
v.push_front(x);
}else if(a[6]=='L'){
v.pop_back();
}else if(a[6]=='F'){
v.pop_front();
}else if(a[0]=='d'){
cin>>x;
for(list<int>::iterator it=v.begin();it!=v.end();it++) {
if(*it==x){
v.erase(it);
break;
}
}
}
}
int i=0;
for(list<int>::iterator it=v.begin();it!=v.end();it++){
if(i++) cout<<' ';
cout<<*it;
}
cout<<'\n';
return 0;
} | 0 | 69,844,823 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int w, h; cin >> w >> h;
vector<pair<int,int> > e;
for(int i = 0; i < w; i++){
int x; cin >> x;
e.push_back({x, 0});
}
for(int i = 0; i < h; i++){
int x; cin >> x;
e.push_back({x, 1});
}
long long ans = 0;
int cw = 0, ch = 0;
sort(e.begin(), e.end());
for(auto p : e){
int x, o; tie(x, o) = p;
if(o){
ans += 1ll * (w - cw + 1) * x;
ch++;
} else {
ans += 1ll * (h - ch + 1) * x;
cw++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cctype>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
#define MAX_N 305
using namespace std;
bool debug=false;
int d[12][12];
void init(){
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
if(i==j) d[i][j]=0;
else d[i][j]=INF;
}
}
}
void make(int n){
int a,b,c;
for(int i=0;i<n;i++){
cin>>a>>b>>c;
d[a][b]=c;d[b][a]=c;
}
}
void wf(){
for(int k=0;k<10;k++){
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
}
}
}
}
void solve(){
int mini=INF,num;
for(int i=0;i<=10;i++){
int sum=0;
for(int j=0;j<=10;j++){
if(d[i][j]!=INF)sum+=d[i][j];
}
if(sum<mini&&sum!=0){
mini=sum;
num=i;
}
}
cout<<num<<" "<<mini<<endl;
}
int main(){
int n;
while(cin>>n){
if(n==0)break;
init();
make(n);
wf();
solve();
}
return 0;
} | 0 | 8,451,572 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n,x;
cin>>n>>x;
ll a[n];
int num=0;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=1;i<n;i++){
if(a[i]+a[i-1]>=x)num=i;
}
if(!num){
cout << "Impossible"<<endl;
return 0;
}
cout<<"Possible"<<endl;
for(int i=1;i<num;i++){
cout << i<<endl;
}
for(int i=n-1;i>num;i--){
cout << i<<endl;
}
cout << num<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9+7;
const int N = 1e6+7;
vector<int> mf(N, -1);
int modfact(int n) {
if (mf[n] != -1) return mf[n];
if (n == 0) return mf[0] = 1;
return mf[n] = (ll)n * modfact(n-1) % MOD;
}
int modinv(int a) {
int b = MOD, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= MOD;
if (u < 0) u += MOD;
return u;
}
vector<int> mif(N, -1);
int modinvfact(int n) {
if (mif[n] != -1) return mif[n];
if (n == 0) return mif[0] = 1;
return mif[n] = (ll)modinv(n) * modinvfact(n-1) % MOD;
}
int modcomb(int n, int k) {
return (ll)modfact(n) * modinvfact(k) % MOD * modinvfact(n-k) % MOD;
}
int main() {
int x, y;
cin >> x >> y;
if ((2*x-y)%3 || (2*y-x)%3) {
cout << 0 << endl;
return 0;
}
int a = (2*x-y)/3;
int b = (2*y-x)/3;
if (a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
int ans = modcomb(a+b, a);
if (ans < 0) ans += MOD;
cout << ans << endl;
return 0;
} | 0 | 44,642,265 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
double x1, y1, x2, y2, x3, y3, xp, yp;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
x2-=x1;
x3-=x1;
xp-=x1;
y2-=y1;
y3-=y1;
yp-=y1;
double m=(x3*y2-x2*y3);
double p=(x3*yp-xp*y3)/m;
double q=(xp*y2-x2*yp)/m;
cout<<((p>=0&&q>=0&&p+q<=1)?"YES\n":"NO\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
ll f(ll n, ll m) {
return (n * n) % m;
}
int main() {
ll N, X, M; cin >> N >> X >> M;
ll A, preA, ans = 0;
ll loopcnt = 0, cnt = 0, sum_loop = 0, rec_A;
vector<bool> visit(100001);
bool dub = false;
for(int i = 1; i <= N; i++) {
if(i == 1) {
A = X;
ans += A;
visit[A] = true;
cnt++;
continue;
}
preA = A;
A = f(A, M);
if(dub) {
if(A == rec_A) break;
ans += A; sum_loop += A; loopcnt++; cnt++;
}
else {
if(visit[A]) {
dub = true; rec_A = A; sum_loop += A; loopcnt++;
}
ans += A;
cnt++;
visit[A] = true;
}
}
A = preA;
if(dub) {
ans += sum_loop * ((N - cnt) / loopcnt);
ll rem = (N - cnt) % loopcnt;
for(int i = 0; i < rem; i++) {
A = f(A, M);
ans += A;
}
}
cout << ans << endl;
return 0;
} | 0 | 55,886,085 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES"<<endl;
#define Yes cout<<"Yes"<<endl;
#define NO cout<<"NO"<<endl;
#define No cout<<"No"<<endl;
#define yes cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a,a+n);
#define sr() sort(a,a+n,greater<ll>());
#define v() sort(v.begin(),v.end());
#define vr() sort(v.begin(),v.end(),greater<ll>());
#define mod 1000000007
#define fast() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll gcd(ll a, ll b){if(!b)return a;return gcd(b, a % b);}
ll power(ll x,ll y,ll p){ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
int main() {
fast();
{
int n,k;
cin>>n>>k;
set<int>s;
map<ll,ll>m;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
s.insert(x);
m[x]++;
}
if(m.size()<=k)
cout<<0<<endl;
else
{
vi v;
for(auto t:m)
v.pb(t.se);
sort(v.begin(),v.end());
ll s=0;
for(int i=0;i<v.size()-k;i++)
{
s+=v[i];
}
cout<<s<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
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; }
const ll MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
ll modpow(ll a, ll n){
if(n==0)return 1;
if(n%2==0){
ll t=modpow(a,n/2);
return t*t%MOD;
}
return a*modpow(a,n-1)%MOD;
}
ll modinv(ll a){
return modpow(a,MOD-2);
}
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;
}
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int n = 1) {
init(n);
}
void init(int n = 1) {
par.resize(n); rank.resize(n);
for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
int r = root(par[x]);
return par[x] = r;
}
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (rank[x] < rank[y]) swap(x, y);
if (rank[x] == rank[y]) ++rank[x];
par[y] = x;
return true;
}
};
vector<vector<int>>G;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
int m;
cin >> m;
ll tot=0;
ll sum=0;
rep(i,m){
ll d,c;
cin >> d >> c;
tot+=d*c;
sum+=c;
}
ll ans=0;
ans+=sum-1+(tot-1)/9;
cout << ans << endl;
} | 0 | 38,553,196 |
#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() {
ll n; cin >> n;
map<ll, ll> mp;
rep(i, n) {
ll a; cin >> a;
mp[a]++;
}
vector<ll> vc;
for (auto it=mp.begin();it!=mp.end();it++) {
if(it->second >= 2) {
rep(i, it->second/2)
vc.push_back(it->first);
}
}
sort(vc.begin(), vc.end());
ll m = vc.size();
if(m < 2) cout << 0;
else cout << vc[m-1] * vc[m-2];
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
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;}
typedef pair<int, int> pair;
double rad(double a) {return a * 180 / PI;}
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int dp[100050];
int main(){
int N;
cin >> N;
vector<ll> A(N);
rep(i,N) cin >> A.at(i);
ll a1 = __gcd(A.at(0),A.at(1));
ll ans = a1;
for (int i = 1; i < N; i++) {
ll a = __gcd(A.at(i - 1),A.at(i));
ans = __gcd(ans,a);
}
cout << ans << endl;
return 0;
} | 0 | 44,344,511 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1000000000
using namespace std;
typedef long long ll;
int main() {
int N, A, B;
cin >> N >> A >> B;
int mid = abs(A - B) - 1;
if (mid%2 != 0){
cout << "Alice" << endl;
}
else{
cout << "Borys" << endl;
}
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define dbg(x) cerr << #x << " = " << x << '\n'
#define sz(x) (int)x.size()
#define all(a) (a.begin(),a.end())
#define ff first
#define ss second
#define pii pair<int,int>
#define lcm(a,b) (a*b)/__gcd(a,b)
using namespace std;
inline void solve(){
int n,m,x; cin>>n>>m>>x;
int a[n][m+1],ans=1000000000;
for (int i=0;i<n;i++)
for (int &j: a[i]) cin>>j;
for (int i=0;i<(1<<n);i++){
vi h(m+1,0); int cnt=0;
for (int j=0;j<n;j++){
if ((i>>j)&1){
for (int k=0;k<=m;k++){
if (k==0) cnt += a[j][0];
else h[k] += a[j][k];
}
}
}
if (cnt<ans){
bool flag=true;
for (int j=1;j<=m;j++){
if (h[j]<x) flag=false;
}
if (flag) ans=cnt;
}
}
cout << ((ans==1000000000)?"-1":to_string(ans)) << endl;
}
signed main()
{
int n=1;
while (n--) solve();
return 0;
} | 0 | 34,254,937 |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
ll n, m, x, y;
cin >> n >> m >> x >> y;
ll a1= -555, a2 = 100; ll f;
for(ll i = 0; i < n; i ++){
cin >> f;
a1 = max(a1, f);
}
for(ll i = 0; i < m; i ++){
cin >> f;
a2 = min(a2, f);
}
if(a1 < a2 && a2 <= y && a2 > x ){
cout << "No War";
return 0;
}
cout << "War";
return 0;
} | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr int inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
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;
}
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
#pragma endregion
#define int long long
signed main() {
string s;cin >> s;
reverse(all(s));
rep(i, s.size()) {
if(s[i]=='m') {
if(s.substr(i,5) == "maerd") {
i+=4;
continue;
}
cout << "NO\n";
return 0;
}
else if(s[i]=='e') {
if(s.substr(i, 5)=="esare") {
i+=4;
continue;
}
cout << "NO\n";
return 0;
}
else if(s[i]=='r') {
if(s.substr(i,6)=="resare") {
i+=5;
continue;
}
else if(s.substr(i, 7)=="remaerd") {
i+=6;
continue;
}
cout << "NO\n";
return 0;
cout << "NO\n";
return 0;
}
else {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
return 0;
} | 0 | 84,183,686 |
#include<bits/stdc++.h>
#define INFTY 1<<20
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const int MOD=1000000007;
int n;
int x[102],cnt=0;
int main(){
ll n,m;
cin>>n>>m;
ll ans;
if(n==1&&m==1)ans = 1;
else if(n==1||m==1)ans = n*m-2;
else ans = n*m-2*(n+m-2);
cout<< ans <<endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mod 1000000007
using namespace std;
int main()
{fast;
ll t =1;
while(t--){
ll h,w,m;
cin>>h>>w>>m;
vector<ll> a[h+1], b[w+1];
map<ll,bool> che[h+1];
ll ma=-1, mi=-1, mh=-1, mw=-1;
ll s=0;
while(m--){
ll u,v;
cin>>u>>v;
a[u].push_back(v);
b[v].push_back(u);
ll n = a[u].size();
if(ma < n){
mh = u;
ma = a[u].size();
}
n = b[v].size();
if(mi < n){
mw = v;
mi = b[v].size();
}
che[u][v] = true;
}
ll ans = mi + ma -1;
for(ll j=1; j<=w;j++)
if(b[j].size()==mi)
s++;
for(ll i=1; i<=h;i++){
ll po=0;
for(auto j: a[i]){
if(b[j].size()==mi)
po++;
}
if(po!=s && a[i].size() == ma)
{ans++;
break;}
}
cout<<ans<<endl;
}
return 0;
} | 0 | 41,295,389 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define EACH(t,i,c) for(t::iterator i=(c).begin(); i!=(c).end(); ++i)
const double EPS = 1e-10;
const double PI = acos(-1.0);
int main(){
ll N,M;
while(cin>>N>>M,N|M){
vi D(N),P(N);
ll total=0;
REP(i,N){
cin>>D[i]>>P[i];
total+=P[i]*D[i];
}
vector<pii> p(N);
REP(i,N){
p[i]=make_pair(P[i],i);
}
sort(RALL(p));
ll ans=total;
REP(i,N){
int ii=p[i].second;
if(M-D[ii]>=0){
M-=D[ii];
ans-=P[ii]*D[ii];
}else{
ans-=M*P[ii];
M=0;
}
if(M==0){
break;
}
}
cout<<ans<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int maxn=(1<<26)+100;
const int maxm=2e5+100;
int g[maxn];
char s[maxm];
int dp[maxm];
int main() {
ios::sync_with_stdio(0);
cin >> (s+1);
fill(g,g+maxn,1001000);
g[0]=0;
dp[0]=1;
int cd=0,len=strlen(s+1);
for(int i=1;i<=len;++i) {
dp[i]=1001000;
int tmp=s[i]-'a';
cd^=(1<<tmp);
for(int j=0;j<26;++j) {
int p=(1<<j)^cd;
dp[i]=min(g[p]+1,dp[i]);
}
dp[i]=min(g[cd]+1,dp[i]);
g[cd]=min(g[cd],dp[i]);
}
cout << dp[len] << endl;
return 0;
} | 0 | 15,364,100 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(),(a).end()
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; }
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double PI = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main()
{
int n; cin >> n;
vector<P> red(n), blue(n);
rep(i, n)
{
int a, b; cin >> a >> b;
red[i] = make_pair(a, b);
}
rep(i, n)
{
int a, b; cin >> a >> b;
blue[i] = make_pair(a, b);
}
sort(ALL(blue));
vector<bool> seen(n);
int ans = 0;
rep(i, n)
{
int tmp = -1, maxy;
bool f = false;
rep(j, n)
{
if (red[j].first < blue[i].first && red[j].second < blue[i].second &&
red[j].second > tmp && !seen[j])
{
tmp = red[j].second;
maxy = j;
f = true;
}
}
if (f)
{
seen[maxy] = true;
ans++;
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main(){
int i,n,m,di,pi,o;
int p[11];
for (i=0;i<11;i++)
p[i] = 0;
while(true){
cin >> n >> m;
if (n == 0)
break;
for (i = 0;i<n;i++){
cin >> di >> pi;
p[pi] += di;
}
i = 10;
while(i>=0){
if (p[i] > m){
p[i] -= m;
break;
}
else{
m -= p[i];
p[i] = 0;
}
i--;
}
o = 0;
for(i=0;i<=10;i++){
o += i*p[i];
p[i] = 0;
}
cout << o << endl;
}
return 0;
} | 0 | 100,687,395 |
#include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b,c;
cin>>a>>b>>c;
if(a==b&&c==a) cout<<"Yes";
else cout<<"No";
cout<<"\n";
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> void chmax(T &a, U b) { if (a < b) a = b; }
template<class T, class U> void chmin(T &a, U b) { if (b < a) a = b; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
string s, t; cin >> s >> t;
vector<string> se;
rep(i, si(s) - si(t) + 1) {
bool ok = true;
rep(j, si(t)) if (s[i + j] != t[j] && s[i + j] != '?') ok = false;
string tmp = s;
if (ok) {
rep(j, si(t)) tmp[i + j] = t[j];
rep(j, si(s)) if (tmp[j] == '?') tmp[j] = 'a';
se.emplace_back(tmp);
}
}
if (se.empty()) cout << "UNRESTORABLE" << endl;
else cout << *min_element(all(se)) << endl;
return (0);
} | 0 | 24,554,777 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
int n, a[100001];
int dp[100001];
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
fill(dp, dp + n, INF);
for (int i = 0; i < n; i++) {
*lower_bound(dp, dp + n, a[i]) = a[i];
}
cout << lower_bound(dp, dp + n, INF) - dp << endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string s ;
cin >> s ;
int n=s.size();
int c=0;
int d=0;
for(int i=0;i<n;i++){
if(i==0){
if(s.at(i)!='A'){
cout <<"WA" << endl;
break;
}
}
if(i==1){
if(s.at(i)<97||s.at(i)>122){
cout << "WA" <<endl;
break;
}
}
if(i>1&&i<n-1){
if(s.at(i)>=97&&s.at(i)<=122){
c++;
}
if(s.at(i)=='C'){
d++;
}
}
if(i==n-1){
if(s.at(i)<97||s.at(i)>122){
cout << "WA" <<endl;
break;
}
if(s.at(i)>=97&&s.at(i)<=122&&c==n-4&&d==1){
cout << "AC"<< endl;
}
else{
cout << "WA" <<endl;
}
}
}
} | 0 | 2,811,799 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
string S;
int main() {
cin >> S;
string res = (S[2]==S[3] && S[4]==S[5]) ? "Yes" : "No";
cout << res << endl;
} | #include <stdio.h>
void seiseki(int m, int f, int r);
int main(void)
{
int m, f, r;
while(1){
scanf("%d %d %d", &m, &f, &r);
if(m == -1 && f == -1 && r == -1){
break;
}
else{
seiseki(m, f, r);
}
}
return 0;
}
void seiseki(int m, int f, int r)
{
if((m == -1) || (f == -1) || ((m + f) < 30)){
printf("F\n");
}
else if(((m + f) < 50) && (r < 50)){
printf("D\n");
}
else if((m + f) < 65){
printf("C\n");
}
else if((m + f) < 80){
printf("B\n");
}
else{
printf("A\n");
}
} | 0 | 90,983,875 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((int)(x).size())
typedef long long ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<typename T> void view(T e){std::cout << e << std::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 (a>b) { a=b; return true; } return false; }
const int inf = 1 << 30;
const ll INF = 1LL << 62;
int main(){
int n, k;
cin >> n >> k;
VL x(n), y(n);
vector<pair<ll, ll>> c(n);
rep(i,n){
cin >> x[i] >> y[i];
c[i].first = x[i];
c[i].second = y[i];
}
sort(all(x));
sort(all(y));
ll ans = INF;
for(int xi = 0; xi < n; xi++){
for(int xj = xi+1; xj < n; xj++){
for(int yi = 0; yi < n; yi++){
for(int yj = yi+1; yj < n; yj++){
ll xl = x[xi], xr = x[xj];
ll yl = y[yi], yh = y[yj];
int cnt = 0;
rep(i,n){
bool inx = xl <= c[i].first && c[i].first <= xr;
bool iny = yl <= c[i].second && c[i].second <= yh;
if (inx && iny) cnt++;
}
if (cnt >= k){
ll area = (xr - xl) * (yh - yl);
ans = min(ans, area);
}
}
}
}
}
cout << ans << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int H, W;
while( cin >> H >> W )
{
if( H == 0 && W == 0 )
break;
for( int i = 0; i < H; i++ )
{
for( int j = 0; j < W; j++ )
{
if( i == 0 || j == 0 || i == H - 1 || j == W - 1 )
cout << '#';
else
cout << '.';
}
cout << endl;
}
cout << endl;
}
return 0;
} | 0 | 74,561,426 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> V(N);
for (long long i = 0; i < N; i++)
cin >> V.at(i);
vector<long long> W(N,0);
for (long long j = 0; j < N; j++)
W.at(V.at(j) - 1)++;
vector<long long> X(N);
for (long long k = 0; k < N; k++)
X.at(k) = W.at(V.at(k) - 1);
long long sum = 0;
for (long long l = 0; l < N; l++)
sum += W.at(l)*(W.at(l) - 1)/2;
for (long long m = 0; m < N; m++)
cout << sum - X.at(m) + 1 << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
string s;
cin >> s;
vector<bool> dp(100005, false);
dp[0] = true;
rep(i,s.size()-4){
if(!dp[i]) continue;
if(s[i] == 'd' && s[i+1] == 'r' && s[i+2] == 'e' && s[i+3] == 'a' && s[i+4] == 'm') dp[i+5] = true;
if(s[i] == 'd' && s[i+1] == 'r' && s[i+2] == 'e' && s[i+3] == 'a' && s[i+4] == 'm' && s[i+5] == 'e' && s[i+6] == 'r') dp[i+7] = true;
if(s[i] == 'e' && s[i+1] == 'r' && s[i+2] == 'a' && s[i+3] == 's' && s[i+4] == 'e') dp[i+5] = true;
if(s[i] == 'e' && s[i+1] == 'r' && s[i+2] == 'a' && s[i+3] == 's' && s[i+4] == 'e' && s[i+5] == 'r') dp[i+6] = true;
}
if(dp[s.size()]) cout << "YES" << endl;
else cout << "NO" << endl;
} | 0 | 90,506,076 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
cout << (1900 * M + 100* (N-M)) * (1 << M) << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
ll n;
cin>>n;
vector<ll> spf(n + 1, 0);
spf[1] = 1;
for(ll i=2; i<=n; i+=2)
{
spf[i] = 2;
}
for(ll i=3; i<=n; i+=2)
{
if(spf[i] == 0)
{
spf[i] = i;
for(ll j=i*2; j<=n; j+=i)
{
if(spf[j] == 0)
{
spf[j] = i;
}
}
}
}
ll ans = 1;
for(ll i=2; i<=n; i++)
{
ll t = i;
ll val = 1;
while(t > 1)
{
ll p = spf[t];
ll cnt = 0;
while(t%p == 0)
{
t = t/p;
cnt++;
}
val = val*(cnt+1);
}
ans = ans + i*val;
}
cout<<ans<<'\n';
} | 0 | 82,546,783 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define INF (ll)2e14
#define MOD ((ll)1e9+7)
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define bit(n) (1LL<<(n))
#define cauto const auto&
#define println(v) cout << v << "\n";
void show(vector<vector<ll>>& arr, int w) {
cout << right << setw(w) << "#";
REP(i, SZ(arr[0])) {
cout << right << setw(w) << i;
}
cout << endl;
REP(i, SZ(arr)) {
cout << right << setw(w) << i;
REP(j, SZ(arr[0])){
cout << right << setw(w) << arr[i][j];
}
cout << endl;
}
}
inline vector<vector<vector<ll>>> makeVector(ll i, ll j, ll k) {
vector<vector<vector<ll>>> v(i, vector<vector<ll>>(j, vector<ll>(k, 0)));
return v;
}
inline vector<vector<ll>> makeVector(ll i, ll j) {
vector<vector<ll>> v(i, vector<ll>(j, 0));
return v;
}
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 InputIterator>
InputIterator adv(InputIterator x, typename std::iterator_traits<InputIterator>::difference_type n) {
advance(x, n);
return x;
}
class mod {
static ll fact[];
public:
template<class... A>
static ll mul(A... args) {
ll res = 1;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res * i) % MOD;
}
return res;
}
static ll power(ll base, ll exp) {
if (exp == 0) return 1;
if (exp & 1) {
return mul(base, power(base, exp - 1));
} else {
ll p = power(base, exp / 2);
return mul(p, p);
}
}
static ll factorial(int n) {
if (fact[n] != 0) return fact[n];
if (n == 0) return 1;
return fact[n] = mul(n, factorial(n - 1));
}
static ll inverse(int n) {
return power(n, MOD - 2);
}
static ll comb(int n, int r) {
if (r < 0 || r > n) return 0;
return mul(factorial(n), inverse(factorial(n - r)), inverse(factorial(r)));
}
template<class... A>
static ll div(ll dividend, A... args) {
ll res = dividend;
for (ll i : std::initializer_list<ll>{args...}) {
res = mul(res, inverse(i));
}
return res;
}
template<class... A>
static ll add(A... args) {
ll res = 0;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res + i) % MOD;
}
return res;
}
template<class... A>
static ll sub(ll l, A... args) {
ll res = l;
for (ll i : std::initializer_list<ll>{args...}) {
res = (res - i + MOD) % MOD;
}
return res;
}
};
ll mod::fact[(int) 1e6 + 1];
int ni() {
int i;
cin >> i;
return i;
}
ll nll() {
ll l;
cin >> l;
return l;
}
int main()
{
int N = ni();
int K = ni();
vector<ll> H(N);
H[0] = 0;
REP(i, N) H[i+1] = nll();
auto dp = makeVector(N+1, N+1);
REP(i, N+1) REP(j, N+1) dp[i][j] = INF;
dp[0][0] = 0;
FOR(i, 1, N+1) {
FOR(s, 1, i+1) {
REP(li, i) {
dp[i][s] = min(dp[i][s], dp[li][s-1] + max(0LL, H[i] - H[li]));
}
}
}
ll ans = INF;
REP(i, N+1) {
ans = min(ans, dp[i][N-K]);
}
println(ans);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9+7;
const double EPS = 1e-10;
const double PI = acos(-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; }
int main() {
int n, a, b;
cin >> n >> a >> b;
vector<int> cnt(3, 0);
rep(i, n) {
int p; cin >> p;
if (p <= a) cnt[0]++;
else if (p <= b) cnt[1]++;
else cnt[2]++;
}
int ans = INF;
rep(i, 3) chmin(ans, cnt[i]);
cout << ans << endl;
} | 0 | 40,421,314 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;
int main(){
ll n, m, d;
cin >> n >> m >> d;
if(d == 0)printf("%.10f\n", 1.0 * (m - 1) / n);
else printf("%.10f\n", 2.0 * (n - d) * (m - 1) / n / n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
return (a ? gcd(b%a, a) : b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int main() {
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
ll ans = 1;
for (auto x : a) ans = lcm(ans, x);
bool ok = true;
for (auto x : a) {
if (not ( (ans / x) & 1 ) ) ok = false ;
}
if (ok) {
ans = int((double)m/ans + 0.5);
} else
ans = 0;
cout << ans << "\n";
return 0;
} | 0 | 92,125,835 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const vector<int> di = {-1, 0, 1, 0};
const vector<int> dj = { 0, -1, 0, 1};
void chmin(int &a, int b) { if (a > b) a = b; }
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); }
struct UnionFind {
vector<int> par;
UnionFind(int N): par(N) {
for (int i=0;i<N;++i) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main(){
int N, M;
cin >> N >> M;
vector<int> P(N);
rep(i, N) cin >> P.at(i);
UnionFind tree(N);
rep(i, M) {
int x, y;
cin >> x >> y;
x--, y--;
tree.unite(x, y);
}
int ans = 0;
rep(i, N) if (tree.same(i, P.at(i)-1)) ans++;
cout << ans << endl;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll a,b;
cin >> a >> b;
if((b-a)%4==0){
if(a%2==0)cout << b <<endl;
else cout << a << endl;
}
else if((b-a)%4==1){
if(a%2==0)cout << 1 << endl;
else{
ll c=a^b;
cout << c << endl;
}
}
else if((b-a)%4==2){
if(a%2==0){
ll c=b^1;
cout << c << endl;
}
else{
ll c=a^1;
cout << c << endl;
}
}
else{
if(a%2==0)cout << 0 << endl;
else{
ll c=a^1^b;
cout << c << endl;
}
}
} | 0 | 49,124,751 |
#include<bits/stdc++.h>
#define ll long long int
#define fr(i,n) for(ll i=0; i<n; i++)
#define fre(i,n) for(ll i=1; i<=n; i++)
#define pb push_back
#define mp(i,j) make_pair(i,j)
#define fi first
#define se second
#define pii pair<ll,ll>
#define ve vector
#define piii pair<pii, ll>
#define FAST ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
using namespace std;
ll mod = 1e9+7;
ll dp[110][100010];
ll sum[100010];
vector<ll> v;
int main(){
ll n,x,k;
cin>>n>>k;
v.push_back(0);
for(int i=0; i<n; i++){
cin>>x;
v.push_back(x);
}
for(int i=1; i<=k; i++)
dp[0][i] = 0;
dp[0][0] = 1;
for(int i=1; i<=n; i++){
for(int j=1; j<=k; j++){
dp[i-1][j] += dp[i-1][j-1];
dp[i-1][j] %= mod;
}
for(int j=0; j<=k; j++){
dp[i][j] = dp[i-1][j];
dp[i][j] -= ( j-v[i]-1 >= 0 )?dp[i-1][j-v[i]-1]:0;
dp[i][j] += mod;
dp[i][j] %= mod;
}
}
cout<<dp[n][k]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(a,b,sizeof(a))
#define sz(x) ((int)size(x))
#define eb emplace_back
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define vi vector<int>
#define pii pair<int,int>
#define mii map<int,int>
#define F first
#define S second
#define remax(a,b) a=max(a,b)
#define remin(a,b) a=min(a,b)
#define bitcount(x) __builtin_popcountll(x)
#define iceil(n,x) (((n)-1)/(x)+1)
#define dbug(x) cout<<#x<<": "<<(x)<<"\n"
#define flush fflush(stdout)
#define show(x) for(auto zz:x)cout<<zz<<" ";cout<<"\n";
#define show2(x) for(auto zz:x)cout<<zz.F<<" "<<zz.S<<"\n";
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const ld pi=acos(-1);
const ll inf=1e18,M=1e9+7;
const int N=1;
void solve()
{
int h1,m1,h2,m2;
cin>>h1>>m1>>h2>>m2;
int k;
cin>>k;
int a=h1*60+m1;
int b=h2*60+m2;
b-=k;
cout<<b-a;
}
int32_t main()
{
fast();
int t=1;
for(int z=1;z<=t;++z)
{
solve();
}
return 0;
} | 0 | 96,786,632 |
#include <iostream>
using namespace std;
int main() {
int integers[101] = {};
int n;
while (cin >> n) {
integers[n]++;
}
int modeValue = 0;
for (int i = 1; i < 101; i++) {
if (modeValue < integers[i]) {
modeValue = integers[i];
}
}
for (int i = 1; i < 101; i++) {
if (modeValue == integers[i]) {
cout << i << endl;
}
}
} | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat;
typedef vector<vector<bool> > matb;
typedef vector<string> vst;
typedef pair<lli,lli> pll;
typedef pair<double,double> pdd;
lli n;
void output(pdd x){
printf("%.12lf %.12lf\n",x.first,x.second);
}
void coch(pdd from,pdd to,lli d){
if(d == 0){
output(from);
return;
}
pdd s = pdd((from.first*2+to.first)/3,(from.second*2+to.second)/3);
pdd t = pdd((from.first+to.first*2)/3,(from.second+to.second*2)/3);
pdd t_s = pdd(t.first-s.first,t.second-s.second);
pdd u = pdd(s.first+t_s.first/2-t_s.second*sqrt(3.0)/2,s.second+t_s.first*sqrt(3.0)/2+t_s.second/2);
coch(from,s,d-1);
coch(s,u,d-1);
coch(u,t,d-1);
coch(t,to,d-1);
}
int main(){
cin >> n;
coch(pdd(0,0),pdd(100,0),n);
output(pdd(100,0));
return 0;
} | 0 | 18,267,944 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main()
{
string a;
int ans = 0;
cin >> a;
if (a.at(0) == 'S') {
ans = 0;
if (a.at(1) == 'R') {
ans = 1;
if (a.at(2) == 'R') ans = 2;
} else {
if (a.at(2) == 'R') ans = 1;
}
} else {
ans = 1;
if (a.at(1) == 'R') {
ans = 2;
if (a.at(2) == 'R') ans = 3;
}
}
cout << ans << endl;
} | #include<iostream>
using namespace std;
int main (void){
int n,w,start,goal,x,y,gosen,man,sen;
cin>>n>>w;;
start=1000*n;
goal=(w-start)/1000;
goal=goal+4;
x=goal/9;
x*=2;
if(goal%9<=4)
{
y=goal%9;y*=2;
}
else
{
y=goal%9-4;
y*=2;
y--;
x++;
}
if(x+y<8||y-x<-2*n+8)
{
cout<<-1<<" "<<-1<<" "<<-1<<endl;
}
else
{
y=8-y;
man=(x-y)/2;
gosen=y;
sen=n-man-gosen;
cout<<man<<" "<<gosen<<" "<<sen<<endl;
}
} | 0 | 19,597,586 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
#define rep(i, n) for(long long i=0; i<n; i++)
#define reps(i, s, e) for(long long i=s; i<e; i++)
#define repr(i, n) for(long long i=n-1; i>=0; i--)
#define reprs(i, s, e) for(long long i=e-1; i>=s; i--)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, k;
cin >> a >> b >> c >> k;
if(k <= a){
cout << k << endl;
return 0;
}
k -= a;
if(k <= b){
cout << a << endl;
return 0;
}
k -= b;
cout << a - k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 30000000001;
int main(){
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> ax(x), by(y), cz(z);
for(int i=0; i<x; ++i) cin >> ax[i];
for(int i=0; i<y; ++i) cin >> by[i];
for(int i=0; i<z; ++i) cin >> cz[i];
sort(ax.rbegin(),ax.rend());
sort(by.rbegin(),by.rend());
sort(cz.rbegin(),cz.rend());
vector<ll> ans;
for(int i1=0; i1<x; ++i1){
if(i1+1 > k) break;
for(int i2=0; i2<y; ++i2){
if((i1+1)*(i2+1) > k) break;
for(int i3=0; i3<z; ++i3){
if((i1+1)*(i2+1)*(i3+1) > k) break;
ans.push_back(ax[i1] +by[i2] +cz[i3]);
}
}
}
sort(ans.rbegin(),ans.rend());
for(int i=0; i<k; ++i){
printf("%lld\n",ans[i]);
}
} | 0 | 32,740,738 |
#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, h;
cin >> n >> h;
vector<int> a(n);
vector<int> b(n);
int ma = 0;
rep(i, n) {
int aa, bb;
cin >> aa >> bb;
a.at(i) = aa;
b.at(i) = bb;
ma = max(ma, aa);
}
sort(b.rbegin(), b.rend());
int bi = 0;
int cnt = 0;
while (h > 0) {
if (bi != n && b.at(bi) > ma) {
h -= b.at(bi);
bi++;
cnt++;
} else {
cnt += (h + ma - 1) / ma;
h = 0;
break;
}
}
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int maN = 1e6+5;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i< n; ++i)
{
cin >> a[i];
}
vector<ll> def(n,0);
ll sum = 0;
for(int i = 1; i < n; ++i)
{
if(a[i] < a[i-1] )
{
sum += a[i-1]-a[i];
a[i] += a[i-1]-a[i];
}
}
cout << sum;
return 0;
} | 0 | 87,621,644 |
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i,j;
int y[100],a,b,c,n,x;
while(cin>>n>>a>>b>>c>>x&&n+a+b+c+x){
for(i=0;i<n;i++)
cin>>y[i];
j=0;
for(i=0;i<10001;i++){
if(y[j]==x){
j++;
if(j==n)
break;
}
x=(a*x+b)%c;
}
if(i==10001)
cout<<-1<<endl;
else
cout<<i<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<ll>;
using vvi = vector<vi>;
int main() {
int n;
cin >> n;
vi a(n);
vi sum(n+1);
rep(i, n) {
cin >> a[i];
sum[i+1] = sum[i] + a[i];
}
sort(sum.begin(), sum.end());
ll ans = 0LL;
map<ll, ll> mp;
rep(i, n+1) {
mp[sum[i]]++;
}
for(auto x:mp) {
ans += x.second*(x.second-1)/2;
}
cout << ans << endl;
} | 0 | 2,872,409 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
int l = 0, r = 0;
rep(i, n){
if(s[i] == '(') l++;
else r++;
if(r > l){
cnt ++;
l++;
}
}
rep(i, cnt) cout << '(';
cout << s;
rep(i, l - r) cout << ')';
cout << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void){
string S;
cin >> S;
char a,b;
int count[2] = {0};
for(int i=0;i<S.size();i++){
if(i == 0){
a = S[i];
count[0]++;
continue;
}
if(S[i] == a){
count[0]++;
}
else{
if(count[1] == 0){
b = S[i];
count[1]++;
}
else if(S[i] == b){
count[1]++;
}
}
}
if(count[0] == 2 && count[1] == 2){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 | 47,280,417 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll N, M;
ll sum;
map<int, ll> mp;
int main(){
cin >> N >> M;
for(int i = 1; i <= N; i++){
ll A;
cin >> A;
sum += A;
sum %= M;
mp[sum]++;
}
ll ans = 0;
for(auto& u : mp){
if(u.first == 0) ans += u.second;
ans += u.second * (u.second - (ll)1) / (ll)2;
}
cout << ans << endl;
return 0;
} | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
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;
}
}
int main(void)
{
lli H, N;
cin >> H >> N;
lli a[10010], b[10010];
for (int i = 0; i < N; i++)
{
cin >> a[i] >> b[i];
}
lli dp[10010];
for (int i = 0; i <= H; i++)
{
dp[i] = 1000000000000000;
}
dp[0] = 0;
for (int i = 1; i <= H; ++i)
{
for (int j = 0; j < N; ++j)
{
if (i > a[j])
{
chmin(dp[i], dp[i - a[j]] + b[j]);
}
else
{
chmin(dp[i], b[j]);
}
}
}
cout << dp[H] << endl;
return 0;
} | 0 | 44,462,626 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,l,r) for(int i = l; i < r; ++i)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll int> dp(n+1, 0);
vector<int> h(n+1, 0);
rep(i, 1, n+1) cin >> h[i];
dp[2] = abs(h[1]-h[2]);
for(int i = 3; i <= n; ++i) {
dp[i] = min(dp[i-2] + abs(h[i]-h[i-2]), dp[i-1] + abs(h[i]-h[i-1]));
}
cout << dp[n] << endl;
} | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(std::string S){
bool ans = true;
string tmp = S.substr(2, S.size() - 3);
int countC = 0;
REP(i, tmp.size())
if (tmp[i] == 'C') countC++;
if (S[0] != 'A') ans = false;
else if (countC != 1) ans = false;
else {
S.erase(0, 1);
S.erase(S.find("C"), 1);
REP(i, S.size())
if (!(islower(S[i]))) ans = false;
}
if (ans) cout << "AC" << '\n';
else cout << "WA" << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
std::string S;
std::cin >> S;
solve(S);
return 0;
} | 0 | 87,865,761 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
double a;
double sum = 0;
for(int i=0; i<n; i++) {
cin >> a;
sum += 1/a;
}
cout << fixed << setprecision(15) << 1/sum << endl;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
int n, m;
const long long MOD = 1000000007;
long long C(long long a) {
return a * (a - 1) / 2;
}
int main() {
while (cin >> n >> m) {
long long xsum = 0;
long long cx = 0; cin >> cx;
for (int i = 0; i < n-1; ++i) {
long long tmp = C(n) - C(i+1) - C(n-1-i);
long long x; cin >> x;
xsum += (x - cx) * tmp % MOD;
xsum %= MOD;
cx = x;
}
long long ysum = 0;
long long cy = 0; cin >> cy;
for (int i = 0; i < m-1; ++i) {
long long tmp = C(m) - C(i+1) - C(m-1-i);
long long y; cin >> y;
ysum += (y - cy) * tmp % MOD;
ysum %= MOD;
cy = y;
}
cout << (xsum * ysum) % MOD << endl;
}
} | 0 | 64,550,705 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define int long long
#define CONTAINS(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define CONTAINS_MAP(m, a) (m).find((a)) != m.end()
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
const int MOD = 1000000007;
int m_add(int a, int b)
{
return (a + b) % MOD;
}
int m_sub(int a, int b)
{
return (a + MOD - b) % MOD;
}
int m_mul(int a, int b)
{
return (a * b) % MOD;
}
int m_pow(int x, int n)
{
if (n == 0) return 1;
ll res = m_pow((x * x) % MOD, n / 2);
if (n & 1) res = (res * x) % MOD;
return res;
}
int m_divide(int a, int b)
{
return m_mul(a, m_pow(b, MOD - 2));
}
int m_comb(int n, int r)
{
int i;
int p = 1;
for (i = 1; i <= r; i++)
{
p = m_mul(p, (n - i + 1));
p = m_divide(p, i);
}
return p;
}
int m_comb_with_rep(int n, int r)
{
return m_comb(n + r - 1, r);
}
int N, M;
int dp[100010];
bool flg[100010];
signed main()
{
cin >> N >> M;
REP(i, M)
{
int a;
cin >> a;
flg[a] = true;
}
if (!flg[1]) dp[1] = 1;
if (!flg[2]) dp[2] = 1;
for (int i = 2; i <= N; i++)
{
if (!flg[i])
{
dp[i] = m_add(dp[i - 1], dp[i]);
dp[i] = m_add(dp[i - 2], dp[i]);
}
}
cout << dp[N] << endl;
} | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int,int>;
int main(){
int N;
cin >> N;
int ans = 0;
vector<int> P(N);
vector<int> Q(N);
vector<int> v(N);
for (int i = 0; i < N; i++) {
v.at(i) = i+1;
}
for (int i = 0; i < N; i++) {
cin >> P.at(i);
}
for (int i = 0; i < N; i++) {
cin >> Q.at(i);
}
int cnt = 0, p = 0, q = 0;
do {
bool pt = true, qt = true;
cnt++;
for (int i = 0; i < N; i++) {
if(v.at(i) != P.at(i)) pt = false;
if(v.at(i) != Q.at(i)) qt = false;
}
if(pt == true) p = cnt;
if(qt == true) q = cnt;
} while (next_permutation(v.begin(), v.end()));
cout << abs(p-q) << endl;
return 0;
} | 0 | 54,543,178 |
#include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int sum = 0;
for (int i = 0;; i++)
{
sum += i;
if (sum >= n)
{
int d = sum - n;
for (int j = 1; j <= i; j++)
{
if (j != d)
cout << j << endl;
}
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B,C,D;
cin >> A >> B >> C >> D;
if(B < D){
if(C <= A && B <= D) cout << B - A << endl;
else if(B < C) cout << 0 << endl;
else cout << B - C << endl;
}
else{
if(A <= C && D <= B) cout << D - C << endl;
else if(D < A) cout << 0 << endl;
else cout << D - A << endl;
}
} | 0 | 39,984,490 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a[3];
cin >> a[0] >> a[1] >> a[2];
if(a[0] == a[1] && a[1] == a[2]){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define ret return
#define rep(q, i, n) for(int q=i; q<n; q++)
#define forn(i, n) for(int i=0; i<n; i++)
#define mems(a,x) memset(a,x,sizeof(a))
#define ll long long
#define pb push_back
#define em emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define pii pair<int,int>
#define pdd pair<double, double>
#define see(x) cerr<< __LINE__ << ": " << (#x) << " is "<< (x) <<'\n';
#define seecontent(v) for(auto x : v) { cout << x << " ";} cout << "\n\n";
#define PI 2*acos(0.0)
#define lcm(a, b) ((a / __gcd(a, b) ) * b)
#define filein freopen ("input.txt", "r", stdin)
#define fileout freopen ("output.txt", "w", stdout)
#define mx 100005
#define INF 1e18
#define MOD 1000000007
#define MIN 0
using namespace std;
int main()
{
fastio;
int r,c;
cin >>r>>c;
char a[r][c], x;
forn(i, r)
{
forn(j, c)
{
cin >> x;
a[i][j]=x;
}
}
int dp[r][c];
if(a[0][0]=='#')
dp[0][0]=1;
else
dp[0][0]=0;
for(int i=0; i<r; i++)
{
for(int j=0; j<c; j++)
{
if(i==0 && j==0)
continue;
else if(i==0)
{
dp[i][j] = dp[i][j-1] + ((a[i][j-1]=='.' && a[i][j]=='#') ? 1:0);
}
else if(j==0)
{
dp[i][j] = dp[i-1][j] + ((a[i-1][j]=='.' && a[i][j]=='#') ? 1:0);
}
else
{
dp[i][j]=min(dp[i-1][j] + ((a[i-1][j]=='.' && a[i][j]=='#') ? 1:0),
dp[i][j-1] + ((a[i][j-1]=='.' && a[i][j]=='#') ? 1:0));
}
}
}
cout << dp[r-1][c-1] << "\n";
return 0;
} | 0 | 30,990,854 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
#define in3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define in4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define inp(p) in2(p.F,p.S)
#define llin(a) cin >> a
#define llin2(a,b) cin >> a >> b
#define llin3(a,b,c) cin >> a >> b >> c
#define inl(a) scanf("%lld",&a)
#define read(v,i,n) for(i=0;i<n;i++)in(v[i])
#define twodread(mat,i,j,n,m) rep(i,n){rep(j,m)in(mat[i][j]);}
#define sc(ch) scanf("%c",&ch)
#define sstr(str) scanf("%s",str)
#define pr(a) printf("%d ",a)
#define pr2(a,b) printf("%d %d\n",a,b)
#define pr3(a,b,c) printf("%d %d %d\n",a,b,c)
#define prp(p) pr2(p.F,p.S)
#define out(a) printf("%d\n",a)
#define outl(a) printf("%lld\n",a)
#define llpr(a) cout << a << " "
#define llpr2(a,b) cout << a << " " << b << " "
#define llout(a) cout << a << "\n"
#define pinttwod(mat,i,j,n,m) rep(i,n){rep(j,m)pr(mat[i][j]); lin;}
#define plltwod(mat,i,j,n,m) rep(i,n){rep(j,m)llpr(mat[i][j]); lin;}
#define byes printf("YES\n")
#define bno printf("NO\n")
#define yes printf("Yes\n")
#define no printf("No\n")
#define lin printf("\n")
#define test(q) cout << "Case #" << q << ": "
#define rep(i,n) for(i=0;i<n;++i)
#define fone(i,n) for(i=1;i<=n;++i)
#define rrep(i,n) for(i=n-1;i>=0;--i)
#define lp(i,a,b) for(i=a;i<b;++i)
#define rlp(i,a,b) for(i=a;i>=b;--i)
#define all(vec) vec.begin(),vec.end()
#define lower(v,k) lower_bound(v.begin(),v.end(),k)-v.begin()
#define upper(v,k) upper_bound(v.begin(),v.end(),k)-v.begin()
#define tf(mytuple) get<0>(mytuple)
#define ts(mytuple) get<1>(mytuple)
#define tt(mytuple) get<2>(mytuple)
#define sz(x) (int)x.size()
#define inrange(i,a,b) (i>=a && i<=b)
#define FLUSH fflush(stdout)
#define precision(x) cout << setprecision(x) << fixed
#define remax(a,b) a=max(a,b)
#define remin(a,b) a=min(a,b)
#define middle() ((l+h)/2)
#define lchild(p) 2*p
#define rchild(p) 2*p+1
#define lseg l,m,2*p
#define rseg m+1,h,2*p+1
#define bhardo(mat,i,j,n,m,t) rep(i,n){rep(j,m)mat[i][j]=t;}
#define bitcount(x) __builtin_popcount(x)
#define bitcountll(x) __builtin_popcountll(x)
#define biton(mask,i) ((mask>>i)&1)
#define bitoff(mask,i) (!((mask>>i)&1))
#define toggle(mask,i) (mask^=(1<<(i)))
#define mul(p,q) ((ll)(p)*(ll)(q))
#define dbg(v,i,n) for(i=0;i<n;i++)pr(v[i]); lin
#define ck printf("continue\n")
#define debug(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 << "\n";
err(++it, args...);
}
#define ll long long int
#define ii pair<int,int>
#define pli pair<ll,int>
#define lii pair<ll,ll>
#define triple tuple<int,int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<pair<int,int> >
#define vvi vector<vector<int> >
#define viii vector<pair<pair<int,int>,int> >
#define vvii vector<vector<pair<int,int> > >
const double PI = acos(-1);
const double eps = (1e-9);
const ll INF = 2e18;
const int M = (1e9)+7;
const int N = (3e5)+3;
int cnt[N];
int ar[N];
int query[N];
int ans[N];
void solve()
{
int i,n,a,k;
in(n);
rep(i,n)
in(a),cnt[a]++;
int m=0;
rep(i,N)
if(cnt[i]>0)ar[cnt[i]]++,m++;
lp(i,1,N)
ar[i]+=ar[i-1];
rep(i,N-1)
query[i+1]=query[i]+(m-ar[i]);
lp(i,1,N)
query[i]/=i;
lp(i,1,N)
a=query[i],ans[a]=i;
rrep(k,n)
remax(ans[k],ans[k+1]);
fone(k,n)
out(ans[k]);
}
int main()
{
int t=1;
while(t--)
solve();
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<iomanip>
#include<set>
#include<numeric>
#include<sstream>
#include<random>
#include<cassert>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
const int inf = 1e9 + 7;
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
#define ceil(a, b) a / b + !!(a % b)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s = "qwertasdfgzxcvb";
string t = "yuiophjklnm";
string u;
while (cin >> u && u != "#") {
int flg = -1;
int bflg = -1;
int c = 0;
rep(i, u.size()) {
rep(j, s.size()) if (u[i] == s[j]) flg = 0;
rep(j, t.size()) if (u[i] == t[j]) flg = 1;
if (flg != bflg) c++;
bflg = flg;
}
cout << c - 1 << endl;
}
} | 0 | 69,319,895 |
#include<iostream>
using namespace std;
typedef long long ll;
const int N = 2000006;
int a[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++){
int x;
cin>>x;
}
cout<<(1 + (n-2)/(k-1))<<endl;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
ll n,m;
cin >> n >> m;
vector <vector <ll>> ab(n,vector <ll> (2));
rep(i,n){
cin >> ab[i][0] >> ab[i][1];
}
sort(ab.begin(),ab.end());
ll k=0,ans=0,j=0;
while(k<m){
k+=ab[j][1];
if(k>m){
ans+=ab[j][0]*(ab[j][1]-(k-m));
}
else{
ans+=ab[j][0]*ab[j][1];
}
++j;
}
cout << ans << endl;
return 0;
} | 0 | 79,437,887 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main()
{
ll n;
cin >> n;
vector<ll> a(n),t(n);
for(int i = 0; i < n; i++) cin >> t[i];
for(int i = 0; i < n; i++) cin >> a[i];
if(a[0] != t[n-1]){
cout << 0 << endl;
}else
{
ll ans = 1;
for(int i = 1; i < n-1; i++){
if(t[i] == t[i-1] && a[i] == a[i+1]){
ans *= min(t[i],a[i]);
ans %= mod;
}else if(t[i] > t[i-1] && a[i] == a[i+1] && a[i] < t[i]){
ans = 0;
}else if(t[i] == t[i-1] && a[i] > a[i+1] && a[i] > t[i]){
ans = 0;
}else if(t[i] > t[i-1] && a[i] > a[i+1] && a[i] != t[i]){
ans = 0;
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string a,b;cin>>a>>b;
int c=a.size(),d=b.size();
if(c>d){
cout<<"GREATER"<<endl;
return 0;
}
else if(c<d){
cout<<"LESS"<<endl;
return 0;
}
else {
rep(i,c){
if(a[i]==b[i])continue;
else if(a[i]>b[i]){
cout<<"GREATER"<<endl;
return 0;
}
else {
cout<<"LESS"<<endl;
return 0;
}
}
}
cout<<"EQUAL"<<endl;
} | 0 | 1,409,372 |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define rep(i,n,z) for(int i=z;i<n;i++)
#define rrep(i,z) for(int i=z;i>=0;i--)
#define nl cout<<endl
#define vi vector<int>
#define vlli vector<long long int>
#define umap unordered_map
#define pb push_back
#define mp make_pair
#define ss second
#define ff first
#define ipair pair <int,int>
#define llipair pair <lli,lli>
#define pq priority_queue
#define displaymatrix(a,m,n) for(int i=0;i<m;i++){for(int j=0;j<n;j++)cout<<a[i][j]<<" ";cout<<endl;}
#define printarray(a,n) for(int i=0;i<n;i++){cout<<a[i]<<" ";}nl;
#define vinput(a,n) vlli a(n);rep(i,n,0)cin>>a[i]
#define ainput(a,n) rep(i,n,0)cin>>a[i]
#define SO(a) sort(a.begin(),a.end())
#define all(x) (x).begin(),(x).end()
#define SOP(a,comp) sort(a.begin(),a.end(),comp)
#define inf INT_MAX
#define endl '\n'
const int N = 1e7+ 5;
vlli a(N,1),ans(N,0);
int main()
{
fastio;
int n;
cin>>n;
rep(i,N,2){
for(int j = i; j < N; j+= i)a[j]++;
}
ans[1] = 1;
rep(i,N,2){
ans[i] += ans[i - 1];
ans[i] += i*1LL*a[i];
}
cout<<ans[n]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, k, x, y;
cin >> n >> k >> x >> y;
if (n < k) {
cout << n*x;
}
else {
cout << k*x + (n - k)*y;
}
} | 0 | 2,435,780 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>using arr=vector<vector<T>>;
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} cout << a[a.size()-1] << endl;}
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()
{
int n, m; cin >> n >> m;
vector<int> a(n+1, 0);
int k;
rep(i, m){
cin >> k;
a[k] = -1;
}
a[0] = 1;
if(a[1]!=-1) a[1]=1;
FOR(i, 2, n+2){
if(a[i]==-1) continue;
FOR(j, 1, 3){
a[i] += (a[i-j]==-1? 0 : a[i-j]);
}
a[i] %= MOD;
}
pr(a[n]);
return 0;} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
vector<int> pow(200);
for(int i=1; i<=200; i++){
pow[i] = i*i;
}
int n, d;
cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d,0));
for(int i=0; i<n; i++){
for(int j=0; j<d; j++){
cin >> x[i][j];
}
}
int ans=0;
for(int i=0; i<n-1; i++){
for(int j=i+1; j<n; j++){
int dif=0;
for(int k=0; k<d; k++){
dif += (x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
}
for(int l=1; l<200; l++){
if(pow[l]==dif) ans ++;
}
}
}
cout << ans << endl;
} | 0 | 44,436,223 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);++i)
typedef long long int ll;
using namespace std;
int main(void) {
int m, nmin, nmax;
while(cin >> m >> nmin >> nmax && m) {
vector<int> p(m);
REP(i, m) scanf("%d", &p[i]);
sort(p.begin(), p.end(), greater<int>());
int gap = 0;
int ans = 0;
for(int i=nmin-1; i<nmax; ++i) {
if(p[i]-p[i+1] >= gap) {
gap = p[i]-p[i+1];
ans = i+1;
}
}
printf("%d\n", ans);
}
} | #include <cstdio>
using namespace std;
typedef long long ll;
const int N = 1e5 + 500;
int n;
ll A[N], P[2 * N], pot, P2[2 * N];
int main(){
scanf("%d", &n);
for(int i = 0;i < n;i++){
scanf("%lld", A + i);
pot += A[i];
}
if(pot % ((ll)n * (n + 1) / 2) != 0){
printf("NO\n");
return 0;
}
pot /= (ll)n * (n + 1) / 2;
for(int i = 0;i < n;i++){
ll x = pot - (A[i] - A[(n + i - 1) % n]);
if(x % (ll)n != 0 || x < 0){
printf("NO\n");
return 0;
}
x /= n;
P[i] += x; P[i + n] -= x;
P2[i + n] -= x * n;
}
for(int i = 1;i < 2 * n;i++)
P[i] += P[i - 1];
P2[0] += P[0];
for(int i = 1;i < 2 * n;i++)
P2[i] += P2[i - 1] + P[i];
for(int i = 0;i < n;i++){
if(A[i] != P2[i] + P2[i + n]){
printf("NO\n");
return 0;
}
}
printf("YES\n");
return 0;
} | 0 | 74,860,511 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
int main(){
int w,b;
cin >> w >> b;
w--;
b--;
cout << 100 << ' ' << 100 << endl;
string whiteBoard = "", blackBoard="";
rep(i,50){
whiteBoard += ".";
blackBoard += "#";
}
string dotBlackBoard,dotWhiteBoard;
rep(i,100){
if(i % 2 == 1){
dotBlackBoard = whiteBoard;
dotWhiteBoard = blackBoard;
rep(j,20){
if(j % 2 == 0) continue;
else if(b > 0) {
dotBlackBoard[j] = '#';
b--;
}
}
rep(j,20){
if(j % 2 == 0) continue;
else if(w > 0) {
dotWhiteBoard[j] = '.';
w--;
}
}
cout << dotBlackBoard << dotWhiteBoard << endl;
}else{
cout << whiteBoard << blackBoard << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h,w;
cin >> h >> w;
vector<vector<string>> s(h,vector<string>(w));
for(int i=0;i<h;i++) for(int j=0;j<w;j++) cin >> s[i][j];
string alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(s[i][j]=="snuke"){
cout << alphabet[j] << i+1 << endl;
return 0;
}
}
}
return 0;
} | 0 | 70,608,937 |
#include<bits/stdc++.h>
#define Abra_Ka_Dabra ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
const long long mod = 1e9 + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
Abra_Ka_Dabra
string x, y;
cin >> x >> y;
if (x[0] == '-') x.erase(x.begin());
if (y[0] == '-') y.erase(y.begin());
if (x.size() > y.size()) cout << "GREATER\n";
else if (x.size() < y.size()) cout << "LESS";
else {
for (int i = 0; i < x.size(); i++) {
if (x[i] > y[i]) {
cout << "GREATER\n";
return 0;
} else if (x[i] < y[i]) {
cout << "LESS";
return 0;
}
}
cout << "EQUAL\n";
}
return 0;
} | #include <iostream>
using namespace std;
int dfs(int x, int y, int z){
int count =0;
if(x==0 && y==0) return 1;
if(x>0){
for(int i =z; i<10; i++){
if(y-i>=0) count+=dfs(x-1, y-i, i+1);
}
}
return count;
}
int main(void){
int n, s;
while(cin >> n >> s, n||s){
cout << dfs(n, s, 0) << endl;
}
return 0;
} | 0 | 17,224,397 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
bool compPair(const pair<int, int>& arg1, const pair<int, int>& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a = b; } }
int main(void) {
llint n, k;
cin >> n >> k;
if(k%2==1) {
llint kbai, ans;
kbai = n/k;
ans = kbai*kbai*kbai;
cout << ans << endl;
}
else {
llint kbai, ans, kmod;
kbai = n/k;
ans = kbai*kbai*kbai;
kmod=0;
for(llint in=1;in<=n;in++) {
if(in%k==(k/2)) kmod++;
}
ans += kmod*kmod*kmod;
cout << ans << endl;
}
return 0;
} | #include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<set>
#include<regex>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<iomanip>
#include<cstring>
#include<map>
#include<functional>
#include<unordered_map>
#define _USE_MATH_DEFINES
#define inf 999999999999999999
#define rep(i,n,m) for(lli i=(lli)(n);i<(lli)(m);++i)
#define reep(i,n,m) for(int i=(int)(n);i<=(int)(m);++i)
#define per(i,m,n) for(lli i=(int)(m)-1;i>=(int)(n);--i)
#define st(n) sort(n.begin(), n.end())
#define rev(n) reverse(n.begin(),n.end())
#define ou(S) cout << S << endl
#define pb(n) push_back(n)
#define ue(N) N.erase(unique(N.begin(),N.end()),N.end());
#define nou(S) cout << S
#define hou(S) cout << setprecision(30) << S << endl
#define vec(K,L,N,S) vector<L> K(N,S)
#define dv(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define tv(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<lli,lli>
#define paf(L,R) pair<L,R>
#define maxx 5100000
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define endl "\n"
typedef long long int lli;
typedef unsigned long long int uli;
const uli mod = 1e9 + 7;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, d, x, sum = 0;
cin >> n >> d >> x;
for(int i = 0; i < n; ++i) {
int a; cin >> a;
if(a ==1)
sum += d;
else sum += d / a + 1;
if(d % a == 0&&a!=1)
--sum;
}
cout << sum + x << endl;
} | 0 | 81,668,596 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vll vector<ll>
#define rep(c, a, b) for(ll c=a;c<b;c++)
#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;
int main(int argc, char const *argv[]) {
vll a(5, 0);
ll x, y;
re(i, 3){
std::cin >> x >> y;
a[x]++, a[y]++;
}
ll r = 0, l = 100000;
rep(i, 1, 5){
r = max(r, a[i]);
l = min(l, a[i]);
}
if(r==2&&l==1) std::cout << "YES" << '\n';
else std::cout << "NO" << '\n';
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main(){cout<<fixed<<setprecision(10);
int a,b,c;
cin>>a>>b>>c;
map<int,int> cnt;
cnt[a]++;cnt[b]++;cnt[c]++;
cout<<cnt.size()<<endl;
} | 0 | 64,486,515 |
#include <iostream>
using namespace std;
int main()
{
char a, b;
cin >> a >> b;
if(a==b) cout << "H";
else cout << "D";
} | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<char> vc;
typedef vector<vc> vcc;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim)
{
uniform_int_distribution<int> uid(0, lim - 1);
return uid(rang);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int mod = 1'000'000'007;
const int N = 3e5, M = N;
vi g[N];
int a[N];
void solve()
{
ll i, j, n, m;
cin >> n;
vi a(n);
ll sum = 0;
fo(i, n)
{
cin >> a[i];
sum += a[i];
}
ll avg = 0;
ll avg1 = 0;
ll avg2 = 0;
avg = sum / n;
avg1 = avg + 1;
avg2 = avg - 1;
ll ans = 0, ans1 = 0, ans2 = 0;
fo(i, n)
{
ll dif = a[i] - avg;
ll dif1 = a[i] - avg1;
ll dif2 = a[i] - avg2;
ans += dif * dif;
ans1 += dif1 * dif1;
ans2 += dif2 * dif2;
}
cout << min({ans, ans1, ans2}) << endl;
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
while (t--)
{
solve();
}
return 0;
}
int mpow(int base, int exp)
{
base %= mod;
int result = 1;
while (exp > 0)
{
if (exp & 1)
result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int n, int m)
{
int i, u, v;
while (m--)
{
cin >> u >> v;
u--, v--;
g[u].pb(v);
g[v].pb(u);
}
}
void dfs(int u, int par)
{
for (int v : g[u])
{
if (v == par)
continue;
dfs(v, u);
}
} | 0 | 77,631,776 |
#include<iostream>
using namespace std;
bool isStable (char C[], int A[], int N, char c[], int a[]) {
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
for (int x = 0; x < N - 1; x++) {
for (int y = x + 1; y < N; y++) {
if (A[i] == A[j] && A[i] == a[x] && A[i] == a[y] && c[x] == C[j] && c[y] == C[i]) {
return false;
}
}
}
}
}
return true;
}
bool bubbleSort (char C[], int A[], int N, char c[], int a[]) {
bool flag = true;
while (flag) {
flag = false;
for (int i = N - 1; i > 0; i--) {
if (A[i] < A[i - 1]) {
swap (C[i], C[i - 1]);
swap (A[i], A[i - 1]);
flag = true;
}
}
}
return isStable(C, A, N, c, a);
}
bool selectionSort (char C[], int A[], int N, char c[], int a[]) {
for (int i = 0; i < N - 1; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (i != minj) {
swap (C[i], C[minj]);
swap (A[i], A[minj]);
}
}
return isStable(C, A, N, c, a);
}
void disp (char C[], int A[], int N, bool stable) {
for (int i = 0; i < N; i++) {
if (i > 0) {
cout << " ";
}
cout << C[i] << A[i];
}
cout << endl;
if (stable) {
cout << "Stable" << endl;
} else {
cout << "Not stable" << endl;
}
}
int main () {
int N;
char C[36], Cb[36], Cs[36];
int A[36], Ab[36], As[36];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> C[i] >> A[i];
Cb[i] = C[i];
Cs[i] = C[i];
Ab[i] = A[i];
As[i] = A[i];
}
bool stableB = bubbleSort(Cb, Ab, N, C, A);
bool stableS = selectionSort(Cs, As, N, C, A);
disp (Cb, Ab, N, stableB);
disp (Cs, As, N, stableS);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
int X, Y;
bool D[20202];
char str[10101];
vector<int> XM, YM, V;
int main(){
scanf("%s", str+1);
scanf("%d %d", &X, &Y);
int cnt=0, xy=1;
for (int i=1; str[i]; i++){
if (str[i] == 'F') cnt++;
else{
if (xy == 1) XM.push_back(cnt);
else YM.push_back(cnt);
cnt=0, xy = -xy;
}
}
if (xy == 1) XM.push_back(cnt);
else YM.push_back(cnt);
int l = XM[0]+10000, r = XM[0]+10000;
D[XM[0]+10000] = true;
for (int i=1; i<(int)XM.size(); i++){
V.clear();
for (int j=l; j<=r; j++) {
if (D[j]) V.push_back(j);
D[j] = false;
}
l = 20000, r = 0;
for (int t : V){
l = min(l, t-XM[i]);
r = max(r, t+XM[i]);
D[t-XM[i]] = D[t+XM[i]] = true;
}
}
if (!D[X+10000]){
puts("No");
return 0;
}
memset(D, false, sizeof D);
l = 10000, r = 10000;
D[10000] = true;
for (int i=0; i<(int)YM.size(); i++){
V.clear();
for (int j=l; j<=r; j++) {
if (D[j]) V.push_back(j);
D[j] = false;
}
l = 20000, r = 0;
for (int t : V){
l = min(l, t-YM[i]);
r = max(r, t+YM[i]);
D[t-YM[i]] = D[t+YM[i]] = true;
}
}
if (!D[Y+10000]){
puts("No");
return 0;
}
puts("Yes");
return 0;
} | 0 | 63,877,405 |
#include<iostream>
using namespace std;
#define N_MAX 45
int table[N_MAX];
int fib(int n){
if(n==0 || n==1) return 1;
if(table[n]) return table[n];
return (table[n]= fib(n-2)+fib(n-1));
}
int main()
{
for(int i=0; i<N_MAX; i++) table[i] = 0;
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
for (int i=0; i<1e6; i++) {
if ((int)(i*0.08) == a && (int)(i*0.1) == b) {
cout << i << "\n";
return 0;
}
}
cout << "-1\n";
} | 0 | 70,472,246 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll ch[102][5][2];
int main() {
string s;
cin>>s;
ll m;
cin>>m;
ch[0][0][0]=1;
for(ll i=0;i<s.size();i++){
ll now=s[i]-'0';
for(ll j=0;j<10;j++){
for(ll k=0;k<=3;k++){
if(j==0){
if(j==now){
ch[i+1][k][0]+=ch[i][k][0];
}
else if(j<now){
ch[i+1][k][1]+=ch[i][k][0];
}
ch[i+1][k][1]+=ch[i][k][1];
}
else{
if(j==now){
ch[i+1][k+1][0]+=ch[i][k][0];
}
else if(j<now){
ch[i+1][k+1][1]+=ch[i][k][0];
}
ch[i+1][k+1][1]+=ch[i][k][1];
}
}
}
}
cout << ch[s.size()][m][0]+ch[s.size()][m][1];
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a){
for (int i = 0; i < a.size(); i++)
{
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a){
for (int i=0;i<a.size();i++){
for (int j=0;j<a[i].size();j++){
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(vector<long long int> a){
int n = a.size();
for (int j=0;j<n;j++) {
if (j != n-1) cout << a[j] << " ";
else cout << a[j] << endl;
}
}
void print(set<int> a){
for (auto x:a)
cout << x << " ";
cout << endl;
}
int main()
{
int n;
cin >> n;
vector<int> a(n);
int ans = inf;
rep(i, n) cin >> a[i];
rep2(i,-101,102){
int temp = 0;
rep(j, n)
{
temp += (i - a[j]) * (i - a[j]);
}
ans = min(ans, temp);
}
cout << ans << endl;
return 0;
} | 0 | 98,172,308 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
double n;
cin >> n;
double tmp = n / 3;
cout << fixed<<setprecision(12)<<tmp*tmp*tmp << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
ll n, x;
cin >> n >> x;
ll ans = n;
ll a = max(n - x, x), b = min(n - x, x);
while (b) {
ll q = a / b;
ll r = a % b;
ans += (b * 2) * q;
if (r == 0) ans -= b;
a = b, b = r;
}
cout << ans << endl;
} | 0 | 6,337,384 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define foreps(i, m, n) for(int i = m;i < n;i++)
# define ALL(x) (x).begin(), (x).end()
# define rall(x) (x).rbegin(), (x).rend()
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() {
ll H, W; cin >> H >> W;
vector<vector<char>> s(55, vector<char>(55));
reps(i, H) {
reps(j, W) cin >> s[i][j];
}
bool ans = true;
reps(i, H) {
reps(j, W) {
if (s[i][j] == '#' && s[i][j - 1] != '#' && s[i - 1][j] != '#' && s[i][j + 1] != '#' && s[i + 1][j] != '#') ans = false;
}
}
cout << (ans ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> d(n);
for(int i = 0; i < n; i++) cin >> d[i];
int ans = 0;
int j = 0;
for(int i = 0; i < n; i++){
if( i <= j ) continue;
else if( j == i ) continue;
else ans += d[j] * d[i];
if( i == n-1 ) {
j++;
i = j;
}
}
cout << ans << endl;
} | 0 | 13,336,818 |
#include<bits/stdc++.h>
int n,x,y,h,w,res;
using namespace std;
int main(){
cin>>n>>h>>w;
while(n--){
cin>>x>>y;
if(x>=h&&y>=w) res++;
}
cout<<res;
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define mp make_pair
#define fi first
#define sc second
typedef pair<int,int> P;
typedef pair<P,int> Pp;
int h,w,n;
char s[2000][2000];
bool used[2000][2000];
int bfs(int m){
REP(i,h)
REP(j,w)
used[i][j] = false;
int sx,sy;char c;
if(m == 0)
c = 'S';
else
c = m + '0';
REP(i,h)
REP(j,w)
if(c == s[i][j]){sx = i;sy = j;}
queue<Pp> que;
REP(i,4){
int x = sx + dx[i],y = sy + dy[i];
if((0 <= x && x < h && 0 <= y && y < w) && s[x][y] != 'X' && !used[x][y]){
if(s[x][y] == m + 1 + '0')
return 1;
que.push(Pp(P(x,y),1));
used[x][y] = true;
}
}
while(!que.empty()){
Pp p = que.front();que.pop();
REP(i,4){
int x = p.fi.fi + dx[i],y = p.fi.sc + dy[i];
if((0 <= x && x < h && 0 <= y && y < w) && s[x][y] != 'X' && !used[x][y]){
if(s[x][y] == m + 1 + '0')
return p.sc + 1;
que.push(Pp(P(x,y),p.sc + 1));
used[x][y] = true;
}
}
}
return 1000000000;
}
int main(){
scanf("%d%d%d",&h,&w,&n);
REP(i,h)
scanf("%s",s + i);
int sum = 0;
FOR(i,0,n){
sum += bfs(i);
}
printf("%d\n", sum);
return 0;
} | 0 | 48,900,597 |
#include "bits/stdc++.h"
using namespace std;
string calc(string s,string t){
int a=0,b=0;
int k=1;
for(int i=0;i<(int)s.length();i++){
if(s[i]=='m'){a+=k*1000;k=1;}
else if(s[i]=='c'){a+=k*100;k=1;}
else if(s[i]=='x'){a+=k*10;k=1;}
else if(s[i]=='i'){a+=k;k=1;}
else k=s[i]-'0';
}
for(int i=0;i<(int)t.length();i++){
if(t[i]=='m'){b+=k*1000;k=1;}
else if(t[i]=='c'){b+=k*100;k=1;}
else if(t[i]=='x'){b+=k*10;k=1;}
else if(t[i]=='i'){b+=k;k=1;}
else k=t[i]-'0';
}
int su=a+b;
string ret="";
int tmp=su/1000;
if(tmp==1) ret+="m";
else if(tmp>1) ret=ret+to_string(tmp)+"m";
su%=1000;
tmp=su/100;
if(tmp==1) ret+="c";
else if(tmp>1) ret=ret+to_string(tmp)+"c";
su%=100;
tmp=su/10;
if(tmp==1) ret+="x";
else if(tmp>1) ret=ret+to_string(tmp)+"x";
su%=10;
tmp=su;
if(tmp==1) ret+="i";
else if(tmp>1) ret=ret+to_string(tmp)+"i";
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
for(int i=0;i<n;i++){
string s,t;cin>>s>>t;
cout<<calc(s,t)<<endl;
}
} | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll a;
cin>>a;
string s;
string t;
vector<string> k(2*a);
cin>>s>>t;
rep(i,a){
k[2*i]=s[i];
k[2*i+1]=t[i];
}
rep(i,2*a){
cout<<k[i];
}
} | 0 | 15,195,093 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmds
#define y0 hNNNNy_yNNNNNN_sNh
#define y1 mNNNNNdtdNNNNNNtsNNm
#define yn mNNNNNNNNy___smNNNms
#define tm oooooosyysooooot
#define read tyhyt
#define rank ytmNmo
#define index yyy
#define pb push_back
#define pcnt __builtin_popcountll
#define rrep(i,a,b) for(int i = (b); i >= (a); i--)
#define rall(x,a) for(auto x : a)
#define MOD 1000000007
#define endl "\n"
typedef long long ll;
using namespace std;
const int N = 111;
int mat[N][N];
int n, k;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
int cur = (n - 1) * (n - 2) / 2;
if(cur < k) {
cout << -1 << endl;
return 0;
}
rep(i, 2, n) {
mat[1][i] = 1;
mat[i][1] = 1;
}
rep(i, 1, n) {
rep(j, i + 1, n) {
if(!mat[i][j] && cur > k) {
cur--;
mat[i][j] = 1;
mat[j][i] = 1;
}
}
}
vector<pair<int, int> > ans;
rep(i, 1, n) {
rep(j, i + 1, n) {
if(mat[i][j]) {
ans.pb({i, j});
}
}
}
cout << sz(ans) << endl;
rall(p, ans) {
cout << p.fi << " " << p.se << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
int para(int a,int b){
if(a%b==0)return 2*a-b;
else return a/b*2*b+para(b,a%b);
}
signed main(){
int n,x;cin>>n>>x;
int ret=0;
int y=n-x;
if(y<x)swap(x,y);
ret=n+para(y,x);
cout<<ret<<endl;
} | 0 | 19,451,273 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,0,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
signed main(){
map<int,int>memo;
REP(i,3){
int a;cin>>a;
memo[a]++;
}
int ans=0;
for(auto v:memo)ans++;
cout<<ans<<endl;
} | #include <iostream>
using namespace std;
int main(){
int a,b,c,d,e,n,ans=0;
while(cin >> n ){
for(int i=0;i<=9;i++){
for(int j=0;j<=9;j++){
for(int k=0;k<=9;k++){
for(int l=0;l<=9;l++){
if(i+j+k+l==n){
ans++;
}
}
}
}
}
cout << ans << endl;
ans =0;
}
} | 0 | 23,673,913 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;typedef double db;
typedef pair<int, int> pii;typedef pair<ll, ll> pll;
typedef pair<int,ll> pil;typedef pair<ll,int> pli;
#define Fi first
#define Se second
#define _Out(a) cerr<<#a<<" = "<<(a)<<endl
const int INF = 0x3f3f3f3f, MAXN = 1e6 + 7;
const ll LINF = 0x3f3f3f3f3f3f3f3f, MOD = 1e9+7;
const db Pi = acos(-1), EPS = 1e-6;
void test(){cerr << "\n";}template<typename T,typename...Args>void test(T x,Args...args){cerr<<x<<" ";test(args...);}
inline ll qpow(ll a, ll b){return b?((b&1)?a*qpow(a*a%MOD,b>>1)%MOD:qpow(a*a%MOD,b>>1))%MOD:1;}
inline ll qpow(ll a, ll b,ll c){return b?((b&1)?a*qpow(a*a%c,b>>1,c)%c:qpow(a*a%c,b>>1,c)) %c:1;}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline ll cede(ll a,ll b){if(b<0)return cede(-a,-b);if(a<0)return a/b;return (a+b-1)/b;}
inline ll flde(ll a,ll b){if(b<0)return flde(-a,-b);if(a<0)return (a-b+1)/b;return a/b;}
inline int sign(db x){return x<-EPS ? -1:x>EPS;}
inline int dbcmp(db l,db r){return sign(l - r);}
namespace Fast_IO{
const int MAXL((1 << 18) + 1);int iof, iotp;
char ioif[MAXL], *ioiS, *ioiT, ioof[MAXL],*iooS=ioof,*iooT=ioof+MAXL-1,ioc,iost[55];
char Getchar(){
if (ioiS == ioiT){
ioiS=ioif;ioiT=ioiS+fread(ioif,1,MAXL,stdin);return (ioiS == ioiT ? EOF : *ioiS++);
}else return (*ioiS++);
}
void Write(){fwrite(ioof,1,iooS-ioof,stdout);iooS=ioof;}
void Putchar(char x){*iooS++ = x;if (iooS == iooT)Write();}
inline int read(){
int x=0;for(iof=1,ioc=Getchar();ioc<'0'||ioc>'9';)iof=ioc=='-'?-1:1,ioc=Getchar();
for(x=0;ioc<='9'&&ioc>='0';ioc=Getchar())x=(x<<3)+(x<<1)+(ioc^48);return x*iof;
}
inline long long read_ll(){
long long x=0;for(iof=1,ioc=Getchar();ioc<'0'||ioc>'9';)iof=ioc=='-'?-1:1,ioc=Getchar();
for(x=0;ioc<='9'&&ioc>='0';ioc=Getchar())x=(x<<3)+(x<<1)+(ioc^48);return x*iof;
}
template <class Int>void Print(Int x, char ch = '\0'){
if(!x)Putchar('0');if(x<0)Putchar('-'),x=-x;while(x)iost[++iotp]=x%10+'0',x/=10;
while(iotp)Putchar(iost[iotp--]);if (ch)Putchar(ch);
}
void Getstr(char *s, int &l){
for(ioc=Getchar();ioc <'a'||ioc>'z';)ioc=Getchar();
for(l=0;ioc<='z'&&ioc>='a';ioc=Getchar())s[l++]=ioc;s[l] = 0;
}
void Putstr(const char *s){for(int i=0,n=strlen(s);i<n;++i)Putchar(s[i]);}
}
using namespace Fast_IO;
int cnt[MAXN];
void work()
{
int n=read();
int g=0;
for(int i=1;i<=n;i++)
{
int x=read();
g=gcd(g,x);
cnt[x]++;
}
int up=1e6;
bool ok=0;
for(int i=2;i<=up;i++)
{
int c=0;
for(int j=1;j*i<=up;j++)
{
c+=cnt[i*j];
}
if(c>1)
{
ok=1;break;
}
}
if(!ok)printf("pairwise coprime\n");
else if(g==1)printf("setwise coprime\n");
else printf("not coprime\n");
}
int main()
{
work();
} | #include<stdio.h>
int main(void)
{
int a,b;
double c,d;
scanf("%d %d",&a,&b);
printf("%d\n",a/b);
printf("%d\n",a%b);
c=a;
d=b;
printf("%.8lf\n",c/d);
return 0;
} | 0 | 94,625,938 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq;
typedef priority_queue<ll> pq;
const int MOD=1000000007;
const long double PI=3.1415926535897932;
int main(){
char x,y;cin>>x>>y;
if(x<y){
cout<<"<"<<endl;
}else if(x>y){
cout<<">"<<endl;
}else{
cout<<"="<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
if( a <= c && d <= b) {
cout << d - c << endl;
return 0;
}
else if( c <= a && b <= d) {
cout << b -a << endl;
return 0;
}
else if ( a <= c && c <= b) {
cout << b - c << endl;
return 0;
}
else if(c <= a && a <= d ) {
cout << d - a << endl;
return 0;
}
else cout << 0 << endl;
return 0;
} | 0 | 13,478,500 |
#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 all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define speedhack() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define form(i, n) for (size_t i = 0; i < size_t(n); ++i)
#define forn(i, n) for (size_t i = 1; i <= size_t(n); ++i)
template<class T> using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
long long mod(long long a, long long b) { return (a%b+b)%b; }
long long gcd(long long x, long long y) { return __gcd(x, y); }
long long lcm(long long x, long long y) { return x * 1ll * y / gcd(x, y); }
const long long MAXN = 1e9 + 9;
const long long SIZE = 3e5 + 5;
const long long MOD = 1e9 + 7;
int res;
int main() { speedhack()
string s, t;
cin >> s;
cin >> t;
for (int i = 0; i < (int)s.size(); i++)
if (s[i] != t[i])
++res;
cout << res;
return 0;
} | #include <iostream>
#include <vector>
#include <numeric>
#include <cmath>
using namespace std;
struct Point2D {
double x,y;
Point2D operator-(Point2D &p);
friend istream &operator>>(istream &is, Point2D &t);
friend double cross(Point2D &a, Point2D &b);
};
Point2D Point2D::operator-(Point2D &p) {
Point2D t;
t.x = x - p.x;
t.y = y - p.y;
return t;
}
istream &operator>>(istream &is, Point2D &t) {
is >> t.x >> t.y;
return is;
}
double cross(Point2D &a, Point2D &b) {
return a.x * b.y - a.y * b.x;
}
int judge(double t) {
if(t>0.0) return 1;
else if(t<0.0) return -1;
else return 0;
}
int main() {
vector<Point2D> t(3);
Point2D p;
while(cin >> t[0] >> t[1] >> t[2] >> p) {
int key = 0;
for(int i = 0; i < 3; i++) {
Point2D m = t[i] - t[( i + 1 ) % 3];
Point2D n = t[i] - p;
key += judge(cross(m, n));
}
cout << ((abs(key) == 3) ? "YES" : "NO") << endl;
}
return 0;
} | 0 | 57,779,413 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[55];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
REP(i, N) {
cin >> A[i];
}
ll ans = 0;
REP(left, K + 1) {
REP(right, K + 1) {
if (left + right > K || left + right > N)
break;
priority_queue<ll, vector<ll>, greater<ll>> q;
ll s = 0;
REP(i, left) {
s += A[i];
q.push(A[i]);
}
REP(i, right) {
s += A[N - 1 - i];
q.push(A[N - 1 - i]);
}
ans = std::max(ans, s);
ll k = K - (left + right);
while (!q.empty() && k > 0) {
ll t = q.top();
q.pop();
s -= t;
ans = std::max(ans, s);
k--;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n, q;
int par[maxn];
int siz[maxn];
int parent(int x) {
return par[x]==x ? x : par[x]=parent(par[x]);
}
void join(int x, int y) {
x = parent(x);
y = parent(y);
if (x==y) return;
if (siz[x]<siz[y]) swap(x,y);
siz[x] += siz[y];
par[y] = x;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>q;
for (int i=0; i<n; i++) {
siz[i]=1;
par[i]=i;
}
while (q--) {
int t;
cin>>t;
int u,v;
cin>>u>>v;
if (t==0) {
join(u,v);
} else {
cout<<(parent(u)==parent(v))<<"\n";
}
}
return 0;
} | 0 | 853,477 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct edge {
ll to;
ll cost;
};
struct UnionFind {
vector<int> UF;
vector<int> SIZE;
UnionFind(int N) : UF(N), SIZE(N, 1) {
for(int i = 0; i < N; i++) {
UF.at(i) = i;
}
}
int root(int x) {
if (UF.at(x) == x) {
return x;
}
return UF.at(x) = root(UF.at(x));
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) {
return;
}
if (SIZE.at(rx) < SIZE.at(ry)) {
UF.at(rx) = ry;
SIZE.at(ry) += SIZE.at(rx);
SIZE.at(rx) = 0;
}
else {
UF.at(ry) = rx;
SIZE.at(rx) += SIZE.at(ry);
SIZE.at(ry) = 0;
}
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) {
return SIZE.at(root(x));
}
};
int ctoi(char c){
if (c == '0') return 0;
if (c == '1') return 1;
if (c == '2') return 2;
if (c == '3') return 3;
if (c == '4') return 4;
if (c == '5') return 5;
if (c == '6') return 6;
if (c == '7') return 7;
if (c == '8') return 8;
if (c == '9') return 9;
return -1;
}
char to_char(int i){
if (i == 0) return '0';
if (i == 1) return '1';
if (i == 2) return '2';
if (i == 3) return '3';
if (i == 4) return '4';
if (i == 5) return '5';
if (i == 6) return '6';
if (i == 7) return '7';
if (i == 8) return '8';
if (i == 9) return '9';
return ' ';
}
ll BS(vector<ll> V, ll Q) {
sort(V.begin(), V.end());
int L = -1;
int R = V.size();
while (R - L > 1) {
int M = (L + R) / 2;
if (V.at(M) < Q) L = M;
else R = M;
}
if (R == int(V.size())) return INF;
return V.at(R);
}
bool PN(int x) {
if (x <= 1) return false;
if (x == 2) return true;
for (int i = 2; i < sqrt(x) + 1; i++) {
if (x % i == 0) return false;
}
return true;
}
ll modpow(ll A, ll N, ll M) {
ll ans = 1;
while (N > 0) {
if (N & 1) ans = ans * A % M;
A = A * A % M;
N >>= 1;
}
return ans;
}
int main() {
cout << fixed << setprecision(16);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
int M = 0;
int ans = 0;
vector<bool> R(N, false);
while (true) {
R.at(M) = true;
if (M == 1) {
break;
}
else if (R.at(A.at(M) - 1)) {
ans = -1;
break;
}
else {
M = A.at(M) - 1;
ans++;
}
}
cout << ans << endl;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#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 trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
const int MOD = 1e9+7;
const ll INF = 1e18;
const int MX = 1e5+5;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
namespace input {
template<class T> void sc(complex<T>& x);
template<class T1, class T2> void sc(pair<T1,T2>& p);
template<class T> void sc(vector<T>& a);
template<class T, size_t SZ> void sc(array<T,SZ>& a);
template<class T> void sc(T& x) { cin >> x; }
void sc(double& x) { string t; sc(t); x = stod(t); }
void sc(ld& x) { string t; sc(t); x = stold(t); }
template<class Arg, class... Args> void sc(Arg& first, Args&... rest) {
sc(first); sc(rest...);
}
template<class T> void sc(complex<T>& x) { T a,b; sc(a,b); x = cd(a,b); }
template<class T1, class T2> void sc(pair<T1,T2>& p) { sc(p.f,p.s); }
template<class T> void sc(vector<T>& a) { F0R(i,sz(a)) sc(a[i]); }
template<class T, size_t SZ> void sc(array<T,SZ>& a) { F0R(i,SZ) sc(a[i]); }
}
using namespace input;
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg> void ps(const Arg& first) {
pr(first); ps();
}
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...);
}
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0);
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); }
}
}
using namespace io;
ll a[MX], par[MX][20];
int main() {
setIO();
int n; sc(n);
F0R(i,n) sc(a[i]);
int l; sc(l);
F0R(i,n) par[i][0] = lower_bound(a,a+n,a[i]+l+1)-a-1;
FOR(i,1,20) F0R(j,n) par[j][i] = par[par[j][i-1]][i-1];
int q; sc(q);
F0R(i,q) {
int u,v; sc(u,v);
u--; v--; if (u > v) swap(u,v);
int w = u, ans = 0;
F0Rd(i,20) {
if (par[w][i] < v) {
ans += (1<<i);
w = par[w][i];
}
}
ps(ans+1);
}
return 0;
} | 0 | 86,347,960 |
#include <bits/stdc++.h>
using namespace std;
#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 print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<"{"<<_.first<<","<<_.second<<"}"<<", "; cerr<<"]"<<endl; }
using P = pair<int, int>;
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9+7;
const int INF = 1e9;
int main() {
int N;
string S;
cin>>N>>S;
ll ans = 1;
ll K = 0;
for(auto c: S){
if((c == 'W') == (K%2 == 0)){
K %= MOD;
ans *= K;
ans %= MOD;
if((--K)<0)break;
}
else{
K++;
K %= MOD;
}
}
if(K!=0){
cout<<0<<endl;
return 0;
}
rep1(i,N+1){
ans *= i;
ans %= MOD;
}
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++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using Graph = vector<vector<int>>;
ll calc(ll a, ll b, ll p){
if(b == 0) return 1;
else if(b%2 == 0){
ll d = calc(a,b/2,p);
return (d*d)%p;
}
else if(b%2 == 1){
return (a * calc(a,b-1,p))%p;
}
}
typedef pair<int,int> P;
bool is_prime(int n){
if(n == 1) return false;
for(int i = 2;i*i <= n;i++){
if(n%i == 0) return false;
}
return true;
}
int factorial(int a){
int res = 1;
while(a){
res *= a;
a--;
}
return res;
}
int main(){
int H,W,A,B;
cin >> H >> W >> A >> B;
vector<vector<int>> mat(H, vector<int>(W));
for(int i = 0;i<H;i++){
if(i < H-B){
for(int j = 0;j<W;j++){
if(j < A) mat[i][j] = 1;
else mat[i][j] = 0;
}
}
else if(i >= H-B){
for(int j = 0;j<W;j++){
if(j < A) mat[i][j] = 0;
else mat[i][j] = 1;
}
}
}
rep(i,H){
rep(j,W){
cout << mat[i][j];
if(j == W-1) cout << endl;
}
}
} | 0 | 23,971,549 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
void solve(long long N, std::vector<long long> A){
vector<ll> v(N+1, 0);
map<ll,ll> m;
ll ans = 0;
m[0] = 0;
rep(i, N) v[i+1] += v[i]+A[i];
for(int i=1; i<=N; i++) {
if(m.find(v[i])!=m.end()) {
m[v[i]]++;
ans += m[v[i]];
} else {
m[v[i]] = 0;
}
}
std::cout << ans << std::endl;
}
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
solve(N, std::move(A));
return 0;
} | #include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int n, L;
int a[N], Right[20][N], Left[20][N];
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
Kazakhstan
cin >> n;
rep(i, 1, n) cin >> a[i];
cin >> L;
int ptr = n;
per(i, n, 1) {
while (a[ptr] - a[i] > L) ptr--;
Right[0][i] = ptr;
}
ptr = 1;
rep(i, 1, n) {
while (a[i] - a[ptr] > L) ptr++;
Left[0][i] = ptr;
}
rep(dg, 1, 19) {
rep(i, 1, n) {
Right[dg][i] = Right[dg - 1][Right[dg - 1][i]];
Left[dg][i] = Left[dg - 1][Left[dg - 1][i]];
}
}
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
int ans = 0;
if (l > r) swap(l, r);
if (l < r) {
per(i, 19, 0) {
if (Right[i][l] < r) {
l = Right[i][l];
ans += (1 << i);
}
}
++ans;
}
else {
per(i, 19, 0) {
if (Left[i][l] > r) {
l = Left[i][l];
ans += (1 << i);
}
}
++ans;
}
cout << ans << nl;
}
ioi
} | 0 | 40,178,379 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c,d,e,f,g,h;
cin>>a>>b>>c;
if(b-c>=0)
{
cout<<"delicious";
}
else
{
d=abs(b-c);
if(d<=a)
cout<<"safe";
else
cout<<"dangerous";
}
} | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int64_t i = 0; i < (int64_t)n; i++)
#define REP_FOR(i, a, b) for (int64_t i = (int64_t)a; i < (int64_t)b; i++)
#define REP_REV(i, a, b) for (int64_t i = (int64_t)a; i > (int64_t)b; i--)
#define FORALL(v) (v).begin(), (v).end()
#define mp(a, b) make_pair(a, b)
#define eb(x) emplace_back(x)
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<int64_t, int64_t> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int64_t> vii;
typedef vector<vii> vvii;
const ll mod = 1e9 + 7;
const int64_t infi = 1147483600;
const ll infl = 4e18 + 5;
const char EOL = '\n';
const ll MOD = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n+1,0);
for (ll i = 0; i < n; ++i) {
cin >> a[i+1];
--a[i+1];
}
for (ll i = 0; i < n; ++i) {
a[i+1] += a[i];
a[i+1] %= k;
}
ll res = 0;
map<ll, ll> counts;
for (ll i = 0 ; i < n+1 ; ++i){
if (i >= k)--counts[a[i-k]];
res += counts[a[i]];
++counts[a[i]];
}
cout << res << endl;
} | 0 | 54,708,405 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> a(n);
vector<bool> b(n, false);
rep(i, n) cin >> a[i], --a[i];
int p = 0;
b[0] = true;
int ans = 0;
while (1)
{
++ans;
p = a[p];
if (p == 1)
{
cout << ans << endl;
return 0;
}
if (b[p])
{
cout << -1 << endl;
return 0;
}
b[p] = true;
}
} | #include<bits/stdc++.h>
using namespace std;
vector<int>p;
vector<int>rank;
void shokika(int size){
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++){
p[i]=i;
rank[i]=0;
}
}
int find(int x){
if(x==p[x])
return x;
return p[x]=find(p[x]);
}
int same(int x,int y){
if(find(x)==find(y))
return 1;
else
return 0;
}
void unite(int x,int y){
x=find(x);
y=find(y);
if(rank[x]>rank[y])
p[y]=x;
else
p[x]=y;
if(rank[x]==rank[y])
rank[y]++;
}
int main(){
int n,a,b,q;
int t;
cin>>n>>q;
shokika(n);
for(int i=0;i<q;i++){
cin>>t>>a>>b;
if(t==0) unite(a,b);
else if(t==1) {
if(same(a,b)) cout<<1<<endl;
else cout<<0<<endl;
}
}
return 0;
} | 0 | 32,588,520 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll h,w,ans=0,num;
cin>>w>>h;
ll p[w],q[h];
for(int i=0;i<w;i++){
cin>>p[i];
ans+=p[i];
}
for(int i=0;i<h;i++){
cin>>q[i];
ans+=q[i];
}
sort(p,p+w);
sort(q,q+h);
ll ps[w+1],qs[h+1];
ps[0]=qs[0]=0;
for(int i=1;i<=w;i++){
ps[i]=ps[i-1]+p[i-1];
}
for(int i=0;i<h;i++){
num=(lower_bound(p,p+w,q[i])-p);
ans+=(w-num)*q[i]+ps[num];
}
cout << ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
const int mod = 1000000007;
int add(int a, int b) { return (a += b) < mod? a : a - mod; }
int sub(int a, int b) { return (a -= b) >= 0? a : a + mod; }
int mul(int a, int b) { return 1LL * a * b % mod; }
void adds(int& a, int b) { a = add(a, b); }
void subs(int& a, int b) { a = sub(a, b); }
void muls(int& a, int b) { a = mul(a, b); }
void maxs(int& a, int b) { a = max(a, b); }
void mins(int& a, int b) { a = min(a, b); }
int pwr(int a, ll p) {
if (p == 0) return 1;
if (p & 1) return mul(a, pwr(a, p - 1));
return pwr(mul(a, a), p / 2);
}
int inv(int a) { return pwr(a, mod - 2); }
int n, m, s[2000], t[2000], dp[2001][2001];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> s[i];
for (int i = 0; i < m; ++i)
cin >> t[i];
for (int j = m - 1; j >= 0; --j)
{
int dq = 0;
for (int i = n - 1; i >= 0; --i)
{
dp[i][j] = dp[i][j + 1];
if (s[i] == t[j])
{
adds(dp[i][j], 1);
adds(dp[i][j], dq);
}
adds(dq, dp[i][j + 1]);
}
}
int sol = 1;
for (int i = 0; i < n; ++i)
adds(sol, dp[i][0]);
cout << sol;
} | 0 | 83,691,357 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p){os<<"("<<p.first<<","<< p.second<<")";return os;}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v){os<<"{";REP(i,(int)v.size()){if(i)os<<",";os<<v[i];}os<<"}";return os;}
template <typename T, size_t S> void printArray(const T (&array)[S]){for(auto val : array)std::cout << val << ", ";std::cout << "\n";}
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO" << endl;}
const double PI=acos(-1);
const ll MOD = 1000000007;
using Graph = vector<vector<int>>;
void solve(){
string s; cin >> s;
ll n = s.size() + 1;
vector<ll> a(n, 0);
ll cnt = 0;
s = '.' + s;
for(int i=n-1; i>=1; i--){
if(s[i] == '>'){
a[i] = cnt;
if(s[i-1] == '>'){
cnt++;
}
else cnt = 0;
}
else cnt = 0;
}
if(s[1] == '<') a[0] = 0;
else a[0] = a[1] + 1;
cnt = 1;
for(int i=1; i<=n-2; i++){
if(s[i] == '<'){
if(s[i+1] == '<'){
a[i] = cnt;
cnt++;
}
else{
a[i] = max(a[i+1] + 1, cnt);
cnt = 1;
}
}
else cnt = 1;
}
if(s[n-1] == '<') a[n-1] = cnt;
ll res = 0;
REP(i, n) res += a[i];
cout << res << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n,p;
cin >> n >> p;
vector<int> a(n);
int od=0;
for(int i = 0; i < n; i++) {
cin >> a[i];
if(a[i]%2) od++;
}
int ev=n-od;
ll ch[od+1];
ch[0]=1;
for(ll i = 1; i <= od; i++) {
ch[i]=ch[i-1]*(od-i+1)/i;
}
for(ll i = 0; i <= od; i++) cerr << od << " C " << i << " : " << ch[i] << "\n";
ll ans=0;
for(int i = 0; i <= od; i+=2) {
ans+=ch[i];
}
ans*=pow(2,ev);
if(p==1) ans=pow(2,n)-ans;
cout << ans << "\n";
return 0;
} | 0 | 67,340,815 |
#include <bits/stdc++.h>
using namespace std;
int n,a[666],i;
int main(){
cin>>n;
for(i=1;i<=n;i++)cin>>a[i];
for(i=1;i<=n;i++){
printf("node %d: key = %d, ",i,a[i]);
if(i!=1)printf("parent key = %d, ",a[i/2]);
if(i*2<=n)printf("left key = %d, ",a[i*2]);
if(i*2+1<=n)printf("right key = %d, ",a[i*2+1]);
puts("");
}
return 0;
} | #include <bits/stdc++.h>
int main() {
int n;
while(std::cin >> n, n != 0) {
std::string step;
bool last = false;
bool left = false, right = false;
int cnt = 0;
for(int i=0; i<n; ++i) {
std::cin >> step;
if(step == "lu") {
left = true;
} else if(step == "ru") {
right = true;
} else if(step == "ld") {
left = false;
} else if(step == "rd") {
right = false;
}
if(!last && left && right) {
last = true;
++cnt;
} else if(last && !left && !right) {
last = false;
++cnt;
}
}
std::cout << cnt << std::endl;
}
} | 0 | 20,254,695 |
#include <bits/stdc++.h>
using namespace std;
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; }
string s, t;
int main() {
cin >> s >> t;
bool flg = true;
vector<char> salp(26, '.');
vector<char> talp(26, '.');
for(int i = 0; i < s.length(); ++i) {
char ss = s.at(i); char tt = t.at(i);
int sint = ss - 'a';
int tint = tt - 'a';
if(salp.at(sint) != '.' || talp.at(tint) != '.') {
if(salp.at(sint) != tt || talp.at(tint) != ss) {
flg = false;
break;
}
}
salp.at(sint) = tt;
talp.at(tint) = ss;
}
if(flg) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const int INF = 1000000;
const double PI=3.14159265359;
int main(){
string s;cin>>s;
ll n=s.size();
string k="";
rep(i,0,n)if(s[i]!='x')k+=s[i];
bool e=true;
rep(i,0,(k.size()+1)/2){
if(k[i]!=k[k.size()-1-i])e=false;
}
if(!e){
out(-1);
return 0;
}
ll ans=0;
while(s.size()>1){
if(s[0]==s[s.size()-1]){
s.pop_back();
s.erase(s.begin());
}else{
ans++;
if(s[0]=='x'){
s+='x';
}else if(s[s.size()-1]=='x'){
s.insert(s.begin(),'x');
}else{
out(-1);
return 0;
}
}
}
out(ans);
return 0;
} | 0 | 51,742,897 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
int main(){
int n;
cin >> n;
int ans = 0;
for(int i = 1; i * 2 < n; ++i) {
++ans;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr <<__LINE__<< ": " <<#x<< " = " << x << endl
#define debug_vec(v) cerr<<__LINE__<<": "<<#v<<" = ";rep(i,v.size())cerr<<" "<<v[i];cerr<<endl
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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
void solve() {
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> P(a), Q(b), R(c);
rep(i, a) cin >> P[i];
rep(i, b) cin >> Q[i];
rep(i, c) cin >> R[i];
sort(rall(P));
sort(rall(Q));
sort(rall(R));
P.erase(P.begin() + x, P.end());
Q.erase(Q.begin() + y, Q.end());
vector<int> S;
for(auto p : P) S.push_back(p);
for(auto q : Q) S.push_back(q);
for(auto r : R) S.push_back(r);
sort(rall(S));
ll ans = 0;
rep(i, x + y) {
ans += S[i];
}
cout << ans << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | 0 | 26,478,385 |
#include<cstdio>
int main() {
long long X, Y;
scanf("%lld%lld", &X, &Y);
puts(X == Y || X == Y + 1 || Y == X + 1 ? "Brown" : "Alice");
} | #include<bits/stdc++.h>
using namespace std;
map<long long int,long long int> mp;
int main(){
int n;
long long int m;
cin >> n >> m;
long long int a[n];
long long int sum =0;
for(int i=0;i<n;i++){
cin >> a[i];
sum += a[i];
sum %= m;
mp[sum]++;
}
long long int ans=0;
for(auto u:mp){
if(u.first==0LL)ans += u.second;
ans += u.second*(u.second-1)/2;
}
cout << ans << endl;
} | 0 | 100,646,886 |
#include <stdio.h>
int main(void){
int A,B,C;
scanf("%d%d%d",&A,&B,&C);
if(C >= A && C <= B){
printf("Yes\n");
}
else{
printf("No\n");
}
} | #include <bits/stdc++.h>
using namespace std;
long long mod=pow(10,9)+7;
#define long long int
int main() {
int t=1;
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
while (t--) {
int dp[101][100005];
int n;
cin>>n;
int k;
cin>>k;
int arr[101];
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
for(int i=0;i<=arr[0];i++)
{
dp[0][i]=1;
}
for(int i=1;i<=n;i++)
{
vector<int>pre(k+1,0);
pre[0]=dp[i-1][0];
for(int j=1;j<=k;j++)
{
pre[j]=(pre[j-1]%mod+dp[i-1][j]%mod)%mod;
}
for(int j=0;j<=k;j++)
{
if(arr[i]>=j)
{
dp[i][j]=pre[j];
}
else
{
dp[i][j]=(pre[j]+mod-pre[j-arr[i]-1])%mod;
}
}
}
cout<<dp[n-1][k];
}
} | 0 | 29,557,766 |
#include <iostream>
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
ll res=1;
for(int i=1;i<=N;i++){
res*=(ll)i;
}
cout<<res<<endl;
return 0;
} | #include <stdio.h>
#include <string.h>
char s[10010];
int a[26], i, l;
main()
{
while(scanf("%s", s)!=EOF)
{
l=strlen(s);
for(i=0; i<l; i++)
{
if(s[i]==' ') continue;
if(s[i]>='A' && s[i]<='Z') a[s[i]-'A']++;
else if(s[i]>='a' && s[i]<='z') a[s[i]-'a']++;
}
}
for(i=0; i<26; i++)
{
printf("%c : %d\n", 'a'+i, a[i]);
}
} | 0 | 20,432,109 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
string s; int x, y; cin >> s >> x >> y;
vector<int> X, Y;
int turn = 0; int cnt = 0;
for(char c: s){
if(c == 'F') cnt++;
else{
if(turn%2==0){
X.push_back(cnt);
}else{
Y.push_back(cnt);
}
cnt = 0;
turn++;
}
}
if(turn%2==0) X.push_back(cnt);
else Y.push_back(cnt);
int sx = X.size(), sy = Y.size();
vector<vector<bool>> dx(sx+1, vector<bool>(8000*2+10));
vector<vector<bool>> dy(sy+1, vector<bool>(8000*2+10));
dx[0][8000] = true; dy[0][8000] = true;
rep(i, sx){
rep(j, 8000*2+10){
if(dx[i][j]){
dx[i+1][j+X[i]] = true;
if(i>0) dx[i+1][j-X[i]] = true;
}
}
}
rep(i, sy){
rep(j, 8000*2+10){
if(dy[i][j]){
dy[i+1][j+Y[i]] = true;
dy[i+1][j-Y[i]] = true;
}
}
}
if(dx[sx][x+8000] && dy[sy][y+8000]) cout << "Yes" << ln;
else cout << "No" << ln;
} | #include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#define repf(i, from, to) for (ll i = from; i < (to); ++i)
#define repr(i, from) for (ll i = from - 1; i >= 0; --i)
#define all(vec) vec.begin(), vec.end()
#define unless(cond) if (!(cond))
#define fi first
#define se second
using namespace std;
typedef long long ll;
template <typename T>
using V = vector<T>;
using VL = V<ll>;
using VVL = V<VL>;
template <typename T, typename U>
using P = pair<T, U>;
using PL = P<ll, ll>;
using VPL = V<PL>;
template <typename T>
inline bool chmax(T& a, T b);
template <typename T>
inline bool chmin(T& a, T b);
void print_ints(vector<ll> v);
template <typename T>
void drop(T a);
const ll INF = 1e18;
void solve() {
ll N, L;
cin >> N >> L;
VL as(N);
rep(i, N) cin >> as[i];
ll max_diff_i = -1;
ll max_diff = 0;
rep(i, N - 1) {
if (chmax(max_diff, as[i] + as[i + 1])) {
max_diff_i = i;
}
}
unless(max_diff >= L) drop("Impossible");
cout << "Possible" << endl;
rep(i, max_diff_i) cout << i + 1 << endl;
repr(i, N - 1) {
if (i == max_diff_i) break;
cout << i + 1 << endl;
}
cout << max_diff_i + 1 << endl;
}
struct exit_exception : public std::exception {
const char* what() const throw() { return "Exited"; }
};
#ifndef TEST
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
try {
solve();
} catch (exit_exception& e) {
}
return 0;
}
#endif
template <typename T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void print_ints(vector<ll> v) {
rep(i, v.size()) {
if (i > 0) {
cout << " ";
}
cout << v[i];
}
cout << endl;
}
template <typename T>
void drop(T res) {
cout << res << endl;
throw exit_exception();
} | 0 | 16,292,159 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
void solve()
{
int n;cin>>n;
string s;int ab=0,a=0,b=0,ans=0;
REP(i,n){
cin>>s;
REP(i,s.size()-2){
if(s[i]=='A'&&s[i+1]=='B')ans++;
}
if(s[0]=='B')b++;
if(s[s.size()-1]=='A')a++;
if(s[0]=='B'&&s[s.size()-1]=='A')ab++;
}
cout<<ans+min(a,b)+(a==b&&b==ab&&ab!=0?-1:0)<<endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k,s;
cin>>n>>k>>s;
if(n==k){
for(int i=0;i<n;i++) cout<<s<<" ";
cout<<endl;
}
else{
if(s==1){
for(int i=0;i<k;i++){
cout<<1;
if(i!=n-1) cout<<" ";
else cout<<endl;
}
for(int i=k;i<n;i++){
cout<<s+1;
if(i!=n-1) cout<<" ";
else {cout<<endl; return 0;}
}
}
else{
for(int i=0;i<k+1;i++){
if(i%2==0) cout<<s/2;
else cout<<(s+1)/2;
if(i!=n-1) cout<<" ";
else cout<<endl;
}
}
if(s==1e9){
for(int i=k+1;i<n;i++){
cout<<1;
if(i!=n-1) cout<<" ";
else cout<<endl;
}
}
else{
for(int i=k+1;i<n;i++){
cout<<s+1;
if(i!=n-1) cout<<" ";
else cout<<endl;
}
}
}
} | 0 | 72,002,922 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
using namespace std;
void func()
{
uint32_t N, maxAi(0), minAi(UINT32_MAX);
cin >> N;
for (size_t i = 0; i < N; ++i)
{
uint32_t Ai;
cin >> Ai;
maxAi = max(Ai, maxAi);
minAi = min(Ai, minAi);
}
cout << maxAi - minAi << endl;
}
int main() {
func();
return 0;
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
ll f(vll& ls, vll& ps, ll n, ll x) {
if (x <= 0) return 0;
if (n == 0) {
return 1;
}
if (x < ls[n - 1] + 1)
return f(ls, ps, n - 1, x - 1);
else if (x == ls[n - 1] + 1)
return ps[n - 1];
else
return ps[n - 1] + 1 + f(ls, ps, n - 1, x - 2 - ls[n - 1]);
}
int main() {
cout << fixed << setprecision(15);
ll n, x;
cin >> n >> x;
vll ls(n), ps(n);
ls[0] = 1;
rep(i, n - 1) ls[i + 1] = 2 * ls[i] + 3;
ps[0] = 1;
rep(i, n - 1) ps[i + 1] = 2 * ps[i] + 1;
ll ans = f(ls, ps, n, x);
cout << ans << endl;
return 0;
} | 0 | 15,048,227 |
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
for(int i=0;i<(int)(s.size());++i) {
cout << s[i];
if(i == (int)(s.size())-1) cout << endl;
else cout << " ";
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int x, y; cin >> x >> y;
if(x % y) cout << x << endl;
else cout << -1 << endl;
} | #include<iostream>
#include<stdio.h>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
char ch;
while(1){
scanf("%c", &ch);
if ( ch == '\n' ) break;
if(isalpha(ch)){
if(islower(ch)){
printf("%c", toupper(ch));
}
else if(isupper(ch)){
printf("%c", tolower(ch));
}
}
else{
cout << ch;
}
}
cout << endl;
} | 0 | 30,715,700 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
cout << (a + b + 1) / 2 << '\n';
return (0);
} | #include "bits/stdc++.h"
using namespace std;
#define FI freopen("input.txt", "r", stdin)
#define FO freopen("output.txt", "w", stdout)
#define FasterIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
#define mem(x,y) memset(x,y,sizeof(x));
#define pii pair<int,int>
#define mk make_pair
#define ff first
#define ss second
#define pb push_back
#define ppb pop_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define endl '\n'
const double PI = acos(-1.0);
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
int dx4[]= {+1, -1, +0, +0};
int dy4[]= {+0, +0, +1, -1};
#define isValid(a, b, R, C) (0 <= a && a < R) && (0 <= b && b < C)
int dx8[]= {+0, +0, +1, -1, -1, +1, -1, +1};
int dy8[]= {-1, +1, +0, +0, +1, +1, -1, -1};
int dr[] = {-1, 1, -2, -2, -1, 1, 2, 2};
int dc[] = {-2, -2, -1, 1, 2, 2, 1, -1};
void test_case()
{
int n, l;
cin >> n >> l;
vector <string> vc(n);
for(string &x: vc)cin >> x;
sort( all(vc) );
for(string x: vc)cout << x;
cout << endl;
}
int main()
{
#ifndef ONLINE_JUDGE
#endif
int T = 1;
for(int tc = 1; tc <= T; ++tc)
{
test_case();
}
return 0;
} | 0 | 84,100,905 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int H, W;
cin >> H >> W;
vector<string> C(H);
for (int i = 0; i < H; ++i) {
cin >> C.at(i);
cout << C.at(i) << endl;
cout << C.at(i) << endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#define MAX_H 50
using namespace std;
char C[MAX_H][MAX_H];
int main() {
int H, W;
cin >> H >> W;
for (int i = 0; i < H; ++i) {
string S;
cin >> S;
for (int j = 0; j < W; ++j) {
C[i][j] = S[j];
}
}
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
if (C[i][j] == '#') {
int cnt = 0;
if (i - 1 >= 0 && C[i - 1][j] == '#') {
++cnt;
}
if (i + 1 < H && C[i + 1][j] == '#') {
++cnt;
}
if (j - 1 >= 0 && C[i][j - 1] == '#') {
++cnt;
}
if (j + 1 < W && C[i][j + 1] == '#') {
++cnt;
}
if (cnt == 0) {
printf("No\n");
return 0;
}
}
}
}
printf("Yes\n");
} | 0 | 8,290,582 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <algorithm>
#include <stack>
#include <functional>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
typedef long long int lli;
#define N 1000000007
using namespace std;
int main(){
lli x,y,ans;
lli i,j;
cin>>x>>y;
if(x==y){
ans=0;
}
else{
ans=abs(abs(x)-abs(y));
if(abs(x)>=abs(y)){
if((x>=0)&&(y>=0)){
if(y==0){
ans+=1;
}
else{
ans+=2;
}
}
else{
if((x<=0)&&(y<=0)){
}
else{
ans+=1;
}
}
}
else{
if((x>=0)&&(y>=0)){
}
else{
if((x<=0)&&(y<=0)){
if(x==0){
ans+=1;
}
else{
ans+=2;
}
}
else{
ans+=1;
}
}
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
void solve() {
int N, K; cin >> N >> K;
string s; cin >> s;
vec v;
bool f = (s[0] == '1');
if(!f) v.push_back(0);
int cnt = 0;
rep(i, N){
if(f){
if(s[i] == '1'){
cnt++;
}else{
v.push_back(cnt);
cnt = 1;
f = false;
}
}else{
if(s[i] == '0'){
cnt++;
}else{
v.push_back(cnt);
cnt = 1;
f = true;
}
}
}
v.push_back(cnt);
if(s.back() == '0') v.push_back(0);
int res = 0, cur = 0, num = 0;
int tmp = 0;
int lim = 2*K+1;
while(num < (int)v.size()){
tmp += v[num];
num++;
if(num == lim){
res = max(res, tmp);
}else if(num > lim){
tmp += v[num++];
tmp -= v[cur++];
tmp -= v[cur++];
res = max(res, tmp);
}
}
res = max(res, tmp);
cout << res << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
} | 0 | 3,703,241 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(void){
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
if(x+r > w || y+r > h || x-r < 0 || y-r < 0)FIN("No");
else FIN("Yes");
return 0;
}
int StrToInt(string s){
stringstream ss;
ss << s;
int val;
ss >> val;
return val;
}
string IntToStr(int i){
stringstream ss;
ss << i;
return ss.str();
} | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n); i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define rrepi(i, a, b) for(intl i = (intl)(a); i >= (intl)(b); i--)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
#define m1(x) memset(x,1,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define alength(a) (sizeof(a) / sizeof(a[0]))
#define cin(i, a) rep(i, alength(a))cin >> a[i]
#define ccin(i, j, a) rep(i, alength(a))rep(j, alength(a[i]))cin >> a[i][j]
#define debug(x) cout << #x << ":" << x << endl
#define rdebug(i,x) rep(i, alength(x))cout << #x << "[" << i << "]:" << x[i] << endl
#define sqrt sqrtl
#define itn int
#define double ld
#define pb push_back
#define mp make_pair
const intl INF = 1e9;
const intl MOD = 1e9+7;
const ld eps = 1.0e-14;
void fp(bool f){cout << (f ? "Yes" : "No") << endl;}
void fp(bool f, string s, string t){cout << (f ? s : t) << endl;}
intl kai(intl k){
intl a = 1;
for(int i = 2; i <= k; i++){
a *= i;
}
return a;
}
intl gcd(intl a, intl b){
if(!b)return a;
return gcd(b, a % b);
}
intl lcm(intl a,intl b){
return a / gcd(a, b) * b;
}
intl digit10(intl a){
intl b = 0;
do{
a /= 10;
b++;
}while(a);
return b;
}
signed main(){
cout << fixed << setprecision(10);
string s,t;
cin >> s;
sort(all(s));
fp(s == "abc");
return 0;
} | 0 | 24,438,238 |