code1
stringlengths 54
12k
| code2
stringlengths 71
12k
| similar
int64 0
1
| __index_level_0__
int64 0
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll k, a, b; cin >> k >> a >> b;
ll cur = 0;
if(a < b) {
ll tim = k - (a - 1);
if(tim >= 2) {
cur += b;
}
cur += ((tim - 2) / 2) * (b - a);
cur += (tim % 2);
}
cout << max(cur, k + 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef queue<int> qi;
typedef stack<int> si;
typedef deque<int> dqi;
#define reps(i, a, b) for (int i = a; i < b; ++i)
#define rep(i, n) reps(i, 0, n)
#define REPS(i, a, b) reps(i, a, b)
#define REP(i, n) rep(i, n)
#define deps(i, a, b) for (int i = a; i >= b; --i)
#define dep(i, n) deps(i, n, 0)
#define DEPS(i, a, b) deps(i, a, b)
#define DEP(i, n) dep(i, n)
#define pf push_front
#define pb push_back
#define mp make_pair
#define fst first
#define FST fst
#define sec second
#define SEC sec
#define sz(obj) ((int)(obj).size())
#define all(v) (v).begin(), (v).end()
#define ALL(v) all(v)
const int INF = 999999999;
const int MOD = 1e9 + 7;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) elems.push_back(item);
item.clear();
}
else item += ch;
}
if (!item.empty()) elems.push_back(item);
return elems;
}
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; std::cin >> x; return x;}
template <typename T>
void print(std::vector<T>& v, char c = ' ') {
REP(i, v.size()) {
if (i != 0) std::cout << c;
std::cout << v[i];
}
std::cout << endl;
}
template <typename T> void print(T x) { std::cout << x << '\n'; }
signed main()
{
int n, m;
while (cin >> n >> m, n + m){
int a[n];
long long int maxsum = 0;
long long int ans = 0;
rep(i, n) a[i] = in();
rep(i, m) maxsum += a[i];
ans = maxsum;
reps(i, m, n) {
ans += a[i] - a[i - m];
maxsum = max(maxsum, ans);
}
print(maxsum);
}
return (0);
}
| 0
| 89,378,931
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() {
int N, M; cin >> N >> M;
vi A(M), B(M); rep(i, M) { cin >> A[i] >> B[i]; A[i]--; B[i]--; }
vector<vi> G(N);
rep(i, M) {
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
queue<int> q;
vi dist(N, INF);
vi pre(N, -1);
dist[0] = 0;
q.push(0);
while (!q.empty()) {
int p = q.front(); q.pop();
rep(i, G[p].size()) {
int a = G[p][i];
if (dist[a] != INF) continue;
q.push(a);
dist[a] = dist[p] + 1;
pre[a] = p;
}
}
cout << "Yes" << endl;
for (int i = 1; i < N; i++) {
cout << (pre[i] + 1) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using Matrix = vector<vector<T>>;
const ll inf = 1LL<<60;
int main()
{
string s; cin>>s;
ll k; cin>>k;
ll n = s.size();
{
bool flg = true;
rep(i, n-1) if (s[i] != s[i+1]) flg = false;
if (flg) {
cout << n*k/2 << endl;
return 0;
}
}
vector<ll> a;
ll t = 1;
rep(i, n-1) {
if (s[i] == s[i+1]) t++;
else {
a.push_back(t);
t = 1;
}
}
a.push_back(t);
ll ans = 0;
for (auto v:a) {
ans += v/2;
}
ans *= k;
if (s[0] == s[n-1]) {
ans -= (a[0]/2 + a.back()/2 - (a[0]+a.back())/2) * (k-1);
}
cout << ans << endl;
return 0;
}
| 0
| 93,269,972
|
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n + 1, vector<int>());
rep(i, m) {
int a, b;
cin >> a >> b;
v[a].push_back(b);
}
bool ok = false;
for (auto e: v[1]) {
for(auto e2: v[e]) {
if (e2 == n) {
ok = true;
}
}
}
if (ok) {
cout << "POSSIBLE" << endl;
} else {
cout << "IMPOSSIBLE" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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 mod=1000000007;
int main() {
int N,K;
string s;
cin>>N>>K>>s;
vector<int64_t>one;
vector<int64_t>zero;
if(s[0]=='0'){one.push_back(0);}
for(int i=0;i<N;i++){
if(s[i]=='1'){
int cnto=1;
while(i+1<N&&s[i+1]=='1'){cnto++;i++;}
one.push_back(cnto);
}
if(s[i]=='0'){
int cntz=1;
while(i+1<N&&s[i+1]=='0'){cntz++;i++;}
zero.push_back(cntz);
}
}
if(s[N-1]=='0'){one.push_back(0);}
int a=one.size(),b=zero.size();
for(int i=0;i<(int)one.size();i++){
if(i>0){one[i]+=one[i-1];}
}
for(int i=0;i<(int)zero.size();i++){
if(i>0){zero[i]+=zero[i-1];}
}
int MAX=0;
for(int i=0;i<(int)one.size();i++){
int r=0;
if(K>=zero.size()){
r=one[a-1];
if(b-1>=0){r+=zero[b-1];}
}
else if(i==0&&i+K<=a-1){r=one[i+K]+zero[i+K-1];}
else if(i>0&&i+K<=a-1){r=one[i+K]-one[i-1]+zero[i+K-1]-zero[i-1];}
chmax(MAX,r);
}
cout<<MAX<<endl;
return 0;
}
| 0
| 68,029,293
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64 h, w;
int n;
cin >> h >> w >> n;
map<tuple<int, int>, int> m;
for (int i = 0; i < n; i++) {
int r, c;
cin >> r >> c;
r--;
c--;
for (int dy = -1; dy <= 1; dy++) {
for (int dx = -1; dx <= 1; dx++) {
int nr = r + dy;
int nc = c + dx;
if (nr < 1 || h - 1 <= nr) continue;
if (nc <1 || w - 1 <= nc) continue;
m[make_tuple(nr, nc)]++;
}
}
}
vector<int64> rs(10);
rs[0] = (h - 2) * (w - 2);
for (const auto& kv : m) {
rs[kv.second]++;
rs[0]--;
}
for (int i = 0; i <= 9; i++) {
cout << rs[i] << endl;
}
}
|
#include <iostream>
#include <vector>
int main() {
using std::vector;
constexpr int inf = 1e9;
int n, m;
std::cin >> n >> m;
vector<vector<int>> d(n, vector<int>(n, inf));
for (int i = 0; i < n; i++) {
d.at(i).at(i) = 0;
}
vector<int> a(m), b(m), c(m);
for (int i = 0; i < m; i++) {
std::cin >> a.at(i) >> b.at(i) >> c.at(i);
a.at(i)--; b.at(i)--;
d.at(a.at(i)).at(b.at(i)) = c.at(i);
d.at(b.at(i)).at(a.at(i)) = c.at(i);
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d.at(i).at(j) = std::min(d.at(i).at(j), d.at(i).at(k) + d.at(k).at(j));
}
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (d.at(a.at(i)).at(b.at(i)) < c.at(i)) {
ans++;
}
}
std::cout << ans << std::endl;
}
| 0
| 58,363,660
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
map<int,int> mp;
ll tot = 0, ans = 0;
++mp[0];
for(int i=0; i<n; ++i){
int x;
cin >> x;
tot += x;
tot %= m;
ans += mp[tot];
++mp[tot];
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> dp(n + 1, -1);
queue<int> q;
dp[0] = 0;
q.push(0);
while(!q.empty()) {
int temp = q.front();
q.pop();
if (temp + 1 <= n && dp[temp + 1] < 0) {
dp[temp + 1] = dp[temp] + 1;
q.push(temp + 1);
}
for (int i = 6; temp + i <= n; i *= 6) {
if (dp[temp + i] < 0) {
dp[temp + i] = dp[temp] + 1;
q.push(temp + i);
}
}
for (int i = 9; temp + i <= n; i *= 9) {
if (dp[temp + i] < 0) {
dp[temp + i] = dp[temp] + 1;
q.push(temp + i);
}
}
}
cout << dp[n] << endl;
return 0;
}
| 0
| 13,739,477
|
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
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;}
const ll MOD = 1000000007;
const int INF = 1<<30;
int main(){
int N; cin >> N;
for (int x = 0; N - 4 * x >= 0; ++x){
if ((N - 4 * x) % 7 == 0) {cout << "Yes" << endl; return 0;}
}
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n){
if(n<=1)return false;
for(int i=2;i<=1001000;i++){
if(n%i==0)return false;
}
return true;
}
int main(){
long long n;
cin >> n;
long long f[1001001];
for(int i=0;i<1001001;i++)f[i]=0;
long long a = n;
long long ans = 0;
for(int i=2;i<=1001000;i++){
if(a%i==0){
for(int j=1;;j++){
f[i]++;
a = a/i;
if(a%i!=0)break;
}
}
}
for(int i=0;i<1001001;i++){
for(int j=1;;j++){
if(f[i]<j)break;
else{
ans++;
f[i]-=j;
}
}
}
if(isPrime(a))ans++;
cout << ans << endl;
}
| 0
| 4,175,206
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n; scanf("%d", &n);
int sum = (999 / 3) * 200 + (999 - 999 / 3) * 195 + 1;
rep(i, n) {
int y, m, d; scanf("%d%d%d", &y, &m, &d);
int ans = sum; y--; m--;
ans -= (y / 3) * 200 + (y - y / 3) * 195;
if ((y + 1) % 3)ans -= (m / 2) * 19 + (m - m / 2) * 20;
else ans -= m * 20;
ans -= d;
printf("%d\n", ans);
}
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
template <class T>
vector<T> sumup(const vector<T>& a) {
int N = a.size();
vector<T> res(N + 1);
for (int i = 0; i < N; i++) res[i + 1] = res[i] + a[i];
return res;
}
const ll INF = 1ll << 60;
int main() {
#ifdef DEBUG
ifstream ifs("in.txt");
cin.rdbuf(ifs.rdbuf());
#endif
int N, K;
while (cin >> N >> K) {
vector<ll> A(N);
for (ll& x : A) cin >> x;
A.insert(A.begin(), 0);
A.push_back(0);
N += 2;
vec<ll, 2> dp = make_v(N, K + 1, INF);
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
for (int k = 0; k <= K; k++) {
for (int j = i + 1; j < N; j++) {
int t = j - i - 1;
if (k + t > K) continue;
chmin(dp[j][k + t], dp[i][k] + max(0ll, A[j] - A[i]));
}
}
}
ll res = INF;
for (int k = 0; k <= K; k++) chmin(res, dp[N - 1][k]);
cout << res << endl;
}
return 0;
}
| 0
| 40,723,508
|
#include<bits/stdc++.h>
using namespace std;
long long n;
long long r[110], c[110];
vector<vector<long long>> dp(110, vector<long long>(110, -1));
long long rec(long long l, long long m){
if(dp[l][m] != -1) return dp[l][m];
if(l + 1 == m) return dp[l][m] = r[l] * c[l] * c[m];
else if(l == m) return dp[l][m] = 0;
else{
long long ans = 1e9;
for (long long i = l; i < m; i++)
{
long long len = rec(l, i) + r[l] * c[i] * c[m] + rec(i + 1, m);
ans = min(ans , len);
}
return dp[l][m] = ans;
}
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> r[i] >> c[i];
}
int ans = rec(0, n-1);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (int i = (a), i##_END_ = (b); i <= i##_END_; i++)
#define DNF(i, a, b) for (int i = (a), i##_END_ = (b); i >= i##_END_; i--)
template <typename Tp> void in(Tp &x) {
char ch = getchar(), f = 1; x = 0;
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') ch = getchar(), f = -1;
while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
x *= f;
}
template <typename Tp> void out(Tp x) {
if (x > 9) out(x / 10);
putchar(x % 10 + '0');
return;
}
template <typename Tp> Tp Max(const Tp &x, const Tp &y) {return x > y ? x : y;}
template <typename Tp> Tp Min(const Tp &x, const Tp &y) {return x < y ? x : y;}
template <typename Tp> bool chkmax(Tp &x, Tp y) {return x >= y ? 0 : (x=y, 1);}
template <typename Tp> bool chkmin(Tp &x, Tp y) {return x <= y ? 0 : (x=y, 1);}
const int MAXN = 100010;
int n;
int A[MAXN];
int abs(int x) {return x < 0 ? -x : x;}
int main()
{
in(n);
FOR(i, 1, n) in(A[i]);
std::sort(A + 1, A + n + 1);
int min = 0x3f3f3f3f, son;
FOR(i, 1, n - 1) {
if (abs(A[i] - A[n] / 2) <= min) min = abs(A[i] - A[n] / 2), son = A[i];
}
printf("%d %d\n", A[n], son);
return 0;
}
| 0
| 37,448,665
|
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
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 print(x) (cout << (x) << endl)
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
#define fs first
#define sc second
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const int INF = 1e9;
const ll LLINF = 1e16;
const ll MOD = 1e9+7;
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
ll stringcount(string s, char c) {
return count(s.cbegin(), s.cend(), c);
}
template<typename T>
T rp(T a, T b) {
return (a + b - 1) / b;
}
template<typename T>
T digsum(T n) {
T res = 0;
while(n > 0) {
res += n%10;
n /= 10;
}
return res;
}
bool kai (string s) {
string t{s};
reverse(begin(t), end(t));
return s == t;
}
using pint = pair<int, int>;
using pll = pair<ll, ll>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty())
elems.push_back(item);
item.clear();
}
else {
item += ch;
}
}
if (!item.empty())
elems.push_back(item);
return elems;
}
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> b(n - 1);
rep(i, n - 1) cin >> b[i];
b.push_back(LLINF);
ll ans = 0;
ans += b[0];
rep(i, n - 1){
ans += min(b[i], b[i + 1]);
}
print(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
double n, m, d;
cin >> n >> m >> d;
double ans = [&]() -> double {
if (d == 0) {
return 1.0 / n * (m - 1);
} else {
return 2.0 * (n - d) / n / n * (m - 1);
}
}();
cout << setprecision(20) << ans << endl;
}
| 0
| 79,040,863
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " = " << x << endl
#define Yes(c) cout << ((c) ? "Yes" : "No") << endl;
#define YES(c) cout << ((c) ? "YES" : "NO") << endl;
#define yes(c) cout << ((c) ? "yes" : "no") << endl;
#define possible(c) cout << ((c) ? "possible" : "impossible") << endl;
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE" : "INPOSSIBLE") << endl;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n);
REP(i,n){
cin >> a[i];
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
int mx = 0;
REP(i,k){
mx += a[i];
}
cout << mx << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define O_O ios_base::sync_with_stdio(0); cin.tie(NULL)
#define endl '\n'
#define PI acos(-1.0)
#define CASE(n) cout << "Case " << n << ": "
#define CASE_(n) cout << "Case " << n << endl
#define FIXED(n) cout << fixed << setprecision(n)
#define MOD 1000000007
inline void normal(long long &a) { a %= MOD; (a < 0) && (a += MOD); }
inline long long modMul(long long a, long long b) { normal(a), normal(b); return (a*b)%MOD; }
inline long long modAdd(long long a, long long b) { normal(a), normal(b); return (a+b)%MOD; }
inline long long modSub(long long a, long long b) { normal(a), normal(b); a -= b; normal(a); return a; }
inline long long modPow(long long b, long long p) { long long r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline long long modInverse(long long a) { return modPow(a, MOD-2); }
inline long long modDiv(long long a, long long b) { return modMul(a, modInverse(b)); }
int main()
{
O_O;
#ifndef ONLINE_JUDGE
freopen("input.in","r",stdin);
freopen("output.out","w",stdout);
#endif
long long t=1;
long long T = t;
while(t--)
{
int n,a,b;
cin >> n >> a >> b;
int diff = abs(a-b);
diff--;
if(diff%2==1) cout << "Alice\n";
else cout << "Borys\n";
}
return 0;
}
| 0
| 20,820,975
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair
const int INF = 1 << 24;
const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}, dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};
typedef unsigned long long ull;
typedef std::pair<int,int> P;
int a[86401];
int toSeconds(int h, int m, int s){
return h*3600 + m*60 + s;
}
int main(){
int N;
while(std::cin >> N, N){
std::fill(a, a+86401, 0);
REP(i, N){
int h1, m1, s1, h2, m2, s2;
scanf("%2d%*c%2d%*c%2d %2d%*c%2d%*c%2d", &h1, &m1, &s1, &h2, &m2, &s2);
int t1 = toSeconds(h1, m1, s1),
t2 = toSeconds(h2, m2, s2);
a[t1]++;
a[t2]--;
}
int res = a[0];
FOR(i, 1, 86401){
a[i] += a[i-1];
res = std::max(res, a[i]);
}
std::cout << res << std::endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N , arr[200003]; cin >> N;
for(int i = 1 ; i <= 2 * N ; ++i) cin >> arr[i];
sort(arr + 1 , arr + 2 * N + 1); long long sum = 0;
for(int i = 1 ; i <= 2 * N ; i += 2) sum += arr[i];
cout << sum; return 0;
}
| 0
| 69,447,027
|
#include<iostream>
using namespace std;
int main() {
string s; cin >> s;
bool a = false, b = false;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A')a = true;
if (s[i] == 'B')b = true;
}
cout << (a & b ? "Yes" : "No") << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define ul unsigned long long int
#define mp make_pair
#define endl "\n"
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define lb lower_bound
#define forn(i,n) for(ll i=0 ; i<n ; i++)
#define arr(a,n) for(ll i=0;i<n;i++){ cin>>a[i]; }
#define ub upper_bound
#define pb push_back
#define pi pair<int,int>
#define mod 1000000007
#define vectormax *max_element
#define vectormin *min_element
#define arraysize 1000000
#define setbit _builtin_popcountll
using namespace std;
ll ipow(ll x, ll n)
{
ll result = 1;
while (n) {
if (n & 1)
result = result * x ;
n = n / 2;
x = x * x;
}
return result;
}
int main(){
int r,g,b;
cin>>r>>g>>b;
int k;
cin>>k;
int count=0;
if(r>=g){
while(1){
if(g>r)
break;
g=g*2;
count++;
}
}
if(g>=b){
while(1){
if(b>g)
break;
b=b*2;
count++;
}
}
if(count>k)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
return 0;
}
| 0
| 54,295,712
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a = 0, b = 0, c = 0, k = 0;
cin >> a >> b >> c;
cin >> k;
int ct = 0;
while (a >= b)
{
++ct; b *= 2;
}
while (b >= c)
{
++ct; c *= 2;
}
if (ct <= k)
cout << "Yes";
else
cout << "No";
cout << endl;
}
|
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,k;
cin >> n >> k;
vector<ll> a(n);
ll p;
rep(i,n) {
cin >> a[i];
if(a[i]==1) p = i + 1;
}
ll ans = (n - 1 + k - 2)/(k - 1);
cout << ans;
return 0;
}
| 0
| 32,523,900
|
#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 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;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n, p;
cin >> n >> p;
string s;
cin >> s;
ll ans = 0;
if (10 % p == 0) {
rep(i, n) {
ll d = s[i] - '0';
if (d % p == 0) ans += i + 1;
}
cout << ans << endl;
return 0;
}
vll csum(n + 1, 0);
ll ten = 1;
vll cnt(p, 0);
cnt[0] = 1;
rep(i, n) {
ll d = s[n - 1 - i] - '0';
csum[i + 1] = (csum[i] + ten * d) % p;
ten = (ten * 10) % p;
ans += cnt[csum[i + 1]];
cnt[csum[i + 1]]++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "O3"
#define rep(i,a,n) for(long long i=a; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const double EPS = 1e-9;
const ll powll = 1LL<<1;
int main(void){
string s; cin >> s;
int w[s.size()] = {};
for(int i= s.size()-1; i >=0; i--){
if(s[i]=='W'){
if(i==s.size()-1) w[i] = 1;
else w[i] = w[i+1] + 1;
}else{
if(i==s.size()-1) w[i] = 0;
else w[i] = w[i+1];
}
}
ll ans = 0;
rep(i,0,s.size()){
if(s[i] == 'B'){
ans += w[i];
}
}
cout << ans << "\n";
}
| 0
| 10,888,492
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
(x<1200)?cout<<"ABC":cout<<"ARC";
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
char get_best_action(char tc) {
if(tc == 'r') {
return 'p';
} else if(tc == 's') {
return 'r';
} else {
return 's';
}
}
int main(){
int n, k; cin >> n >> k;
int r, s, p; cin >> r >> s >> p;
string t; cin >> t;
string h = "";
int ans = 0;
int tsize = t.size();
rep(i, tsize) {
char tc = get_best_action(t[i]);
if(i < k) {
h += tc;
if(tc == 'p') ans += p;
else if(tc == 's') ans += s;
else ans += r;
} else {
if(h[i-k] == tc) {
if(i+k < tsize) {
char tc2 = get_best_action(t[i+k]);
if(tc == 'p' && tc2 == 'p') h += 's';
else if(tc == 'p' && tc2 == 'r') h += 's';
else if(tc == 'p' && tc2 == 's') h += 'r';
else if(tc == 's' && tc2 == 's') h += 'r';
else if(tc == 's' && tc2 == 'r') h += 'p';
else if(tc == 's' && tc2 == 'p') h += 'r';
else if(tc == 'r' && tc2 == 'r') h += 'p';
else if(tc == 'r' && tc2 == 'p') h += 's';
else if(tc == 'r' && tc2 == 's') h += 'p';
} else {
if(tc == 'p') h += 's';
else if(tc == 's') h += 'r';
else h += 'p';
}
} else {
h += tc;
if(tc == 'p') ans += p;
else if(tc == 's') ans += s;
else ans += r;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 49,353,559
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
const double PI = acos(-1);
const int mod = 1e9+7;
const long long INF = (1LL << 60);
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
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;}
ll stringcount(string s, char c){return count(s.cbegin(), s.cend(), c);}
bool isInteger(double x){return floor(x) == x;}
ll ceil(ll a, ll b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmax(T &a, const T &b){ if(a < b){ a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b){ if(a > b){ a=b; return 1; } return 0; }
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
ll pret = 0, prex = 0, prey = 0;
bool ok = true;
rep(i, 0, n){
ll t, x, y;
cin >> t >> x >> y;
if((t - pret) < abs(x - prex) + abs(y - prey)) ok = false;
else if((t - pret) % 2 != (abs(x - prex) + abs(y - prey)) % 2) ok = false;
prex = x;
prey = y;
pret = t;
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin(), v.end())
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
template <class T>
inline void chmax(T &a, T b) {
a = std::max(a, b);
}
template <class T>
inline void chmin(T &a, T b) {
a = std::min(a, b);
}
#define mod (ll)(1e9 + 7)
#define INF LLONG_MAX
bool is_large(const vll &a, const vll &b) {
if (a[0] > b[0]) {
return true;
} else if (a[0] == b[0]) {
for (int i = 9; i > 0; i--) {
if (a[i] > b[i]) {
return true;
} else if (a[i] < b[i]) {
return false;
}
}
}
return false;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n, m;
cin >> n >> m;
vll a(m);
rep(i, m) {
cin >> a[i];
}
ll need[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vvll dp(n + 10, vll(10));
rep(i, n) {
if (i == 0 || dp[i][0] != 0) {
FORm(it, a) {
ll v = *it;
vll candidate = dp[i];
candidate[0]++;
candidate[v]++;
vll &target = dp[i + need[v]];
if (is_large(candidate, target)) {
target = candidate;
}
}
}
}
auto ans = dp[n];
for (int i = 9; i > 0; i--) {
rep(j, ans[i]) {
cout << i;
}
}
cout << endl;
return 0;
}
| 0
| 97,695,576
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
int a, b, c, d;
cin >> a >> b >> c >> d;
if(abs(a-c) <= d){
cout << "Yes";
return 0;
}
if(abs(a-b) <= d && abs(b-c) <= d){
cout << "Yes";
}
else
{
cout << "No";
}
}
|
#include <iostream>
#include <cmath>
using namespace std;
const int Max = 100;
const int Min = -100;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if((W > 0 && W <= Max) && (H > 0 && H <= Max) && (r > 0 && r <= Max))
{
if((0 <= (x-r)) && (0 <= (y-r)) && ((x+r) <= W) && ((y+r) <= H))
cout << "Yes";
else
cout << "No";
cout << endl;
}
else cout << "No" << endl;
return 0;
}
| 0
| 1,323,850
|
#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
int main() {
for (int a = 1; a < 10; a++) {
for (int b = 1; b < 10; b++) {
printf("%dx%d=%d\n", a, b, a*b);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++)
{
cin >> x[i];
}
int l, q;
cin >> l >> q;
vector<vector<int>> dp(31, vector<int>(n+1));
for(int i = 0; i < n; i++)
{
int now = x[i];
dp[0][i+1] = lower_bound(x.begin(), x.end(), now + l + 1) - x.begin();
}
dp[0][n] = -1;
for(int k = 0; k < 30; k++)
{
for(int i = 1; i <= n; i++)
{
if(dp[k][i] == -1) dp[k+1][i] = -1;
else dp[k+1][i] = dp[k][dp[k][i]];
}
}
while(q--)
{
int a, b;
cin >> a >> b;
int left = min(a, b);
int right = max(a, b);
int ans = 0;
for(int k = 30; k >= 0; k--)
{
int next = dp[k][left];
if(next >= 0 && next < right)
{
left = next;
ans |= 1 << k;
}
}
ans++;
cout << ans << endl;
}
}
| 0
| 100,351,265
|
#include <iostream>
using namespace std ;
using ll = long long ;
int main(){
ll a,b,k ;
cin >> a >> b >> k ;
for(int i=0;i<k;i++){
if(i&1){
b -= (b&1) ;
a += b/2 ;
b /= 2 ;
}else{
a -= (a&1) ;
b += a/2 ;
a /= 2 ;
}
}
cout << a << " " << b << endl ;
}
|
#include<bits/stdc++.h>
#define ios std::ios::sync_with_stdio(false)
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define mst(a,n) memset(a,n,sizeof(a))
#define dbg(a, b) cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<endl;
#define debug(a, b, c, d) cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl;
#define printa(a,l,r) for(int i = l; i <= r; i++){cout << a[i] << " \n"[i==r];}
#define printset(st) for(auto it:st){cout << it << " ";} cout << '\n';
#define printmap(mp) for(auto &it:mp){cout << it.se << " ";} cout << '\n';
using namespace std;
template<typename T>void read(T &res){bool flag=false;char ch;while(!isdigit(ch=getchar()))(ch=='-')&&(flag=true);for(res=ch-48;isdigit(ch=getchar());res=(res<<1)+(res<<3)+ch - 48);flag&&(res=-res);}
template<typename T>void Out(T x){if(x<0)putchar('-'),x=-x;if(x>9)Out(x/10);putchar(x%10+'0');}
const int N = 2e5 + 10, MOD = 1e9+7, inf = 0x3f3f3f3f;
signed main()
{ll a; string b;
while(cin >> a >> b){
ll sum = 0;
ll bb = b[0]-'0';
sum += a * bb;
bb = b[2]-'0';
sum += (a * bb)/10;
float summ = (a*bb)%10/10.0;
bb = b[3]-'0';
sum += (a * bb)/100;
summ += (a*bb)%100/100.0;
cout << sum + (int)summ<< "\n";
}
return 0;
}
| 0
| 53,608,862
|
#include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(st, itr) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
int main(int argc, char const* argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n)cin >> a[i] >> b[i];
bool ok = false;
ll sum = 0;
ll res = linf;
rep(i, n){
if(a[i] != b[i])ok = true;
sum += a[i];
if(a[i] > b[i])res = min(res, b[i]);
}
if(!ok){
cout << 0 << endl;
return 0;
}
cout << sum - res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
int main() {
int n,k;cin >>n>>k;
string s;cin >>s;
vector<int>num;
int now=1;
int cnt=0;
for (int i = 0; i < n; ++i) {
if(s[i]==(char)('0'+now)){
cnt++;
}
else {
num.push_back(cnt);
now=1-now;
cnt=1;
}
}
if(cnt!=0)num.push_back(cnt);
if(num.size()%2==0)num.push_back(0);
vector<int>sum(num.size()+1,0);
for (int i = 0; i < num.size(); ++i) {
sum[i+1]=sum[i]+num[i];
}
int ans=1;
for (int i = 0; i < num.size(); i+=2) {
int left=i;
int right=min(i+2*k+1,(int)num.size());
int tmp=sum[right]-sum[left];
ans=max(ans,tmp);
}
cout <<ans <<endl;
return 0;
}
| 0
| 30,989,886
|
#include <iostream>
using namespace std;
#include <stdio.h>
#include <string.h>
int main()
{
int n, T = 0, H = 0, Bool = 1;
char a[101], b[101];
cin >> n;
for (int i = 0; i < n; i++){
cin >> a >> b;
for (int j = 0; a[j] != '\0' && b[j] != '\0'; j++){
if (a[j] > b[j]) { T += 3; Bool = false; }
if (a[j] < b[j]) { H += 3; Bool = false; }
if (Bool == false) break;
if (a[j + 1] == '\0' || b[j+1] =='\0' ){
if (a[j + 1] == b[j + 1]) { T++; H++; }
else {
if (a[j + 1] == '\0') H += 3;
if (b[j + 1] == '\0') T += 3;
}
}
}
Bool = true;
}
printf("%d %d\n", T, H);
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int count_sw = 0;
void ss(int A[],int N){
for (int i = 0; i < N-1; i++) {
int min = A[i];
int k = i;
for (int j = i+1; j < N; j++) {
if (min > A[j]) {
min = A[j];
k = j;
}
}
if (i != k) {
swap(A[k],A[i]);
count_sw++;
}
}
}
int main(){
int N;
cin >> N;
int *A;
A = (int *)malloc(sizeof(int));
for(int i = 0; i < N; i++){
cin >> A[i];
}
ss(A,N);
for(int i = 0; i < N; i++){
cout << A[i];
if (i != N-1){
cout << " ";
}
}
cout << endl;
cout << count_sw << endl;
return 0;
}
| 0
| 77,795,916
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrepc(i, s, n) for (int i = (s); i >= (n); i--)
typedef long long ll;
typedef unsigned long long ull;
int a[100];
int b[100];
int c[100];
int d[100];
int f[100];
pair<int, int> blue[100];
int main()
{
int N, ans = 0;
cin >> N;
rep(i, N) cin >> a[i] >> b[i];
rep(i, N) cin >> blue[i].first >> blue[i].second;
sort(blue, blue + N);
rep(i, N) c[i] = blue[i].first, d[i] = blue[i].second;
rep(i, N) {
int ymax = -1;
int index = -1;
rep(j, N) {
if (f[j]) continue;
if (a[j] < c[i] && b[j] < d[i] && b[j] > ymax) {
index = j;
ymax = b[j];
}
}
if (index == -1) continue;
f[index] = true;
ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX = 7600000000LL;
int main(){
int T; scanf("%d", &T);
while(T--){
ll a, b, ans = 0; scanf("%lld%lld", &a, &b);
if(a==b) ans = 2*a-2;
else{
ll sq = sqrt(a*b);
if(sq*sq == a*b) sq--;
if(sq*(sq+1) >= a*b) ans = 2*sq-2;
else ans = 2*sq-1;
}
printf("%lld\n", ans);
}
return 0;
}
| 0
| 13,747,152
|
#include<iostream>
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
int n ;
cin >> n ;
int a[n+2] ;
a[0] = 0 ;
a[n+1] = 0 ;
int sum = 0 ;
for(int i=1;i<=n;i++){
cin >> a[i] ;
sum+= abs(a[i]-a[i-1]) ;
}
sum+=abs(a[n]-a[0]) ;
for(int i=1;i<=n;i++){
cout << sum-abs(a[i]-a[i-1])-abs(a[i+1]-a[i])+abs(a[i+1]-a[i-1]) << endl ;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
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;}
#define all(x) x.begin(), x.end()
#define mp make_pair
bool compare(Pi a, Pi b) {
if(a.first != b.first){
return a.first < b.first;
}else{
return a.second < b.second;
}
}
bool In_map(ll y,ll x,ll h,ll w){
if(y<0 || x<0 || y>=h || x>=w){
return 0;
}else{
return 1;
}
}
const vector<ll> dx{1,0,-1,0};
const vector<ll> dy{0,1,0,-1};
int main() {
vector<ll>a(5);
ll sum=0;
ll mn = 10;
rep(i,5){
cin>>a[i];
ll p = a[i]%10;
if(p==0){
sum+=a[i];
p=10;
}else{
sum+=a[i]+10-p;
}
chmin(mn,p);
}
cout << sum-10+mn << endl;
return 0;
}
| 0
| 1,176,491
|
#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 M = 1000002;
int main() {
ll n;
cin >> n;
vector<int> array(M);
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n) {
if(array[a[i]] != 0){
array[a[i]] = 2;
continue;
}
for(int j = a[i]; j < M; j += a[i]) array[j]++;
}
int ans = 0;
for(int ar : a) {
if(array[ar] == 1) ++ans;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define P = pair<int,int>;
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; }
signed main(){
int n,m,r;
cin >> n >> m >> r;
vint R(r);
rep(i,0,r){
int r;
cin >> R[i];
R[i]--;
}
vvint to(n,vint(n,INF));
rep(i,0,n){
to[i][i] = 0;
}
rep(i,0,m){
int a,b,c;
cin >> a >> b >> c;
a--;b--;
to[a][b] = c;
to[b][a] = c;
}
rep(i,0,n){
rep(j,0,n){
rep(s,0,n){
to[j][s] = min(to[j][s],to[j][i] + to[i][s]);
}
}
}
sort(R.begin(),R.end());
int ans = INF;
do{
int tmp = 0;
rep(i,0,r-1){
tmp += to[R[i]][R[i+1]];
}
ans = min(ans,tmp);
}while(next_permutation(R.begin(),R.end()));
cout << ans << endl;
}
| 0
| 39,318,372
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
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=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int A,B,K;
cin>>A>>B>>K;
int cnt=0;
vector<int>a;
for(int i=1;i<=A;i++){
if(A%i==0&&B%i==0){a.push_back(i);}
}
reverse(a.begin(),a.end());
cout<<a[K-1]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
ll gcd (ll a, ll b) {
if (b > a) {
ll tmp = b;
b = a;
a = tmp;
}
if (b == 0) return a;
return gcd(b, a % b);
}
int main(){
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
sort(A.begin(), A.end());
ll a = A.at(0);
for (int i = 1; i < N; i++) {
a = gcd(a, A.at(i));
}
cout << a << endl;
return 0;
}
| 0
| 13,321,192
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
int a[n + 1], b[n + 1];
for(int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for(int i = 0; i < n; i++) {
cin >> b[i];
}
b[n] = 0;
ll total = 0;
for(int i = 0; i < n + 1; i++) {
int mn = min(a[i], b[i]);
a[i] -= mn;
b[i] -= mn;
total += mn;
if(i + 1 == n + 1) {
break;
}
mn = min(a[i + 1], b[i]);
a[i + 1] -= mn;
b[i] -= mn;
total += mn;
}
cout << total << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#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();
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;
}
}
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N; cin >> N;
vector<int> mountains;
while(N--){
int m; cin >> m;
mountains.pb(m);
}
int can_see = 1;
int maxM = mountains[0];
for(int i = 1; i < mountains.size(); i++){
if(mountains[i] > maxM) maxM = mountains[i];
if(mountains[i-1] <= mountains[i] && mountains[i] >= maxM){
can_see++;
}
}
cout << can_see;
return 0;
}
| 0
| 47,573,791
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, len, minLen, index;
cin >> n >> m;
vector<int> a(n), b(n), c(m), d(m);
for (i = 0; i < n; i++) cin >> a[i] >> b[i];
for (i = 0; i < m; i++) cin >> c[i] >> d[i];
for (i = 0; i < n; i++) {
minLen = INT_MAX;
for (j = 0; j < m; j++) {
len = abs(a[i] - c[j]) + abs(b[i] - d[j]);
if (len < minLen) {
minLen = len;
index = j + 1;
}
}
cout << index << endl;
}
}
|
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long long MOD = 1000000007;
int N;
const int N_MAX = 201;
long long dist[N_MAX][N_MAX];
void floyd(){
for(int k = 0; k < N; k++){
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
}
ll M, edge[101][101];
signed main(){
cin >> N >> M;
ll a, b, c;
REP(i, N) REP(j, N) edge[i][j] = dist[i][j] = LONG_LONG_MAX / 2;
REP(i, N) edge[i][i] = dist[i][i] = 0;
REP(i, M){
cin >> a >> b >> c;
a--; b--;
edge[a][b] = edge[b][a] = dist[a][b] = dist[b][a] = c;
}
floyd();
ll ans = 0;
REP(i, N - 1){
FOR(j, i + 1, N){
if(edge[i][j] < LONG_LONG_MAX / 2 && edge[i][j] > dist[i][j]) ans++;
}
}
PRINT(ans);
return 0;
}
| 0
| 30,670,238
|
#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
#include <bitset>
#include <set>
using ll = long long;
using namespace std;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
const ll MOD = 1000000007;
const ll INF = 1 << 30;
const ll INF2 = 9000000000000000000LL;
const double INF3 = 900000000000000;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
const int tx[8] = { -1,0,1,-1,1,-1,0,1 }, ty[8] = { -1,-1,-1,0,0,1,1,1 };
#define ALL(x) (x).begin(),(x).end()
int main() {
while (true) {
int a, b;
cin >> a >> b;
if (a == 0 && b == 0)return 0;
int n, dp[1000][1000] = {0};
cin >> n;
for (int i = 1;i <= a;i++)dp[i][1] = 1;
for (int i = 1;i <= b;i++)dp[1][i] = 1;
for (int i = 0;i < n;i++) {
int x, y;
cin >> x >> y;
dp[x][y] = -1;
if (x == 1) {
for (int j = y;j <= b;j++)dp[1][j] = -1;
}
if (y == 1) {
for (int j = x;j <= a;j++)dp[j][1] = -1;
}
}
for (int i = 2;i <= a;i++) {
for (int j = 2;j <= b;j++) {
if (dp[i][j] == -1)continue;
else if (dp[i - 1][j] == -1 && dp[i][j - 1] == -1)dp[i][j] = -1;
else if (dp[i - 1][j] == -1)dp[i][j] = dp[i][j - 1];
else if (dp[i][j - 1] == -1)dp[i][j] = dp[i - 1][j];
else dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
cout << dp[a][b] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair < int , int >
const int N=20;
map<string , int > mp;
int main()
{ char a[N],b[N];
string s;
scanf("%s",a);
scanf("%s",b);
int x,y;
scanf("%d%d",&x,&y);
s=a;
mp[s]=x;
s=b;
mp[s]=y;
char z[N];
scanf("%s",z);
s=z;
mp[z]--;
s=a;
string q=b;
printf("%d %d",mp[s],mp[q]);
}
| 0
| 76,424,124
|
#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(){
int n;
cin >> n;
vector<int> a(n+1), b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll save=0;
rep(i,n+1){
save += min(a[i]+a[i+1],b[i]);
a[i+1] -= max(0,b[i]-a[i]);
if(a[i+1]<0) a[i+1]=0;
}
cout << save << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<string>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
bool used[27];
int main(){
string s;
cin >> s;
rep(i, (int)s.length()) {
used[s[i]-'a'] = 1;
}
if ( (int)s.length() < 26 ) {
rep(i, 26) {
if ( !used[i] ) {
s += char('a'+i);
break;
}
}
cout << s << endl;
}
else {
int id = -1;
for ( int i = (int)s.length()-2; i >= 0; --i ) {
if ( s[i] < s[i+1] ) {
id = i;
break;
}
}
if ( id == -1 ) {
cout << -1 << endl;
}
else {
string t = s.substr(0, id);
int idx2 = id + 1;
for ( int i = id + 1; i < (int)s.length(); ++i ) {
if ( s[i] < s[idx2] && s[i] > s[id] ) {
idx2 = i;
}
}
t += s[idx2];
cout << t << endl;
}
}
return 0;
}
| 0
| 17,381,777
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
int h,w,k;
cin>>h>>w>>k;
string c[h];
rep(i,h)cin>>c[i];
int ans=0;
rep(i,1<<h){
rep(j,1<<w){
int cnt=0;
rep(a,h){
rep(b,w){
if(((i>>a)&1)&&((j>>b)&1)&&(c[a][b]=='#')){
++cnt;
}
}
}
if(cnt==k)++ans;
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
int keta(ll n){int ans=0;while(n>0){n /= 10; ans++;}return ans;}
ll _pow(ll a,ll b){ll ans = 1;rep(i,b){ ans *= a;}return ans;}
int main() {
int h,w; cin>>h>>w;
string a[h];
rep(i,h) cin>>a[i];
map<int,bool> H,W;
rep(i,h){
bool flag = true;
rep(j,w){
if(a[i][j] == '#') flag = false;
}
if(flag){
H[i] = true;
}
}
rep(i,w){
bool flag = true;
rep(j,h){
if(a[j][i] == '#') flag = false;
}
if(flag){
W[i] = true;
}
}
rep(i,h){if(H[i]) continue;
rep(j,w){
if(W[j]) continue;
cout<<a[i][j];
}
cout<<endl;
}
return 0;
}
| 0
| 78,640,916
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
int t = (a + b) % 2;
double q = (a + b) / 2;
if (t == 1){
cout << q + 1 << endl;
}
else if(t == 0){
cout << q << endl;
}
}
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#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 ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
const int MAX_N = 1000010;
int id[MAX_N], sz[MAX_N];
void init(int n) {
REP(i,n) id[i] = i;
}
int root(int x) {
if (id[x] != x)
id[x] = root(id[x]);
return id[x];
}
bool same(int p, int q) {
return root(p) == root(q);
}
void unite(int p, int q) {
int i = root(p), j = root(q);
if (sz[i] < sz[j]) {
id[i] = j;
sz[j] += sz[i];
} else {
id[j] = i;
sz[i] += sz[j];
}
}
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, q, com, x, y;
cin >> n >> q;
init(n);
REP(i,q) {
cin >> com >> x >> y;
if (com == 0) unite(x, y);
else if (same(x, y)) cout << 1 << endl;
else cout << 0 << endl;
}
return 0;
}
| 0
| 72,049,255
|
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)
using namespace std;
ll INF = LONG_LONG_MAX;
ll mod = 1000000000 + 7;
template <typename T, typename L>
void read(vector<T> & _data, L & _size, bool _shift) {
_data.resize(_size + (ll)_shift);
for (ll i = (ll)_shift; i < _size + (ll)_shift; i++)
cin >> _data[i];
}
template <typename T, typename L>
void read(vector<vector<T>> & _data, L & _rows, L & _cols, bool _shiftRows, bool _shiftCols) {
_data.resize(_rows + (ll)_shiftRows);
for (ll i = 0; i < _rows + (ll)_shiftRows; i++)
_data[i].resize(_cols + (ll)_shiftCols);
for (ll i = (ll)_shiftRows; i < _rows + (ll)_shiftRows; i++)
for (ll j = (ll)_shiftCols; j < _cols + (ll)_shiftCols; j++)
cin >> _data[i][j];
}
template <typename T>
void write(vector<T> & _data, bool _shift) {
for (ll i = (ll)_shift; i < _data.size(); i++)
cout << _data[i] << " ";
cout << endl;
}
ll h, w, m;
vll x, y;
map<ll, ll> incol;
map<ll, ll> inrow;
map<ll, ll> cnt;
void solve() {
cin >> h >> w >> m;
x.resize(m); y.resize(m);
ll maxrow = 0, maxcol = 0;
rep(i, 0, m) {
cin >> x[i] >> y[i];
if (inrow.count(x[i]))
inrow[x[i]]++;
else
inrow[x[i]] = 1;
if (incol.count(y[i]))
incol[y[i]]++;
else
incol[y[i]] = 1;
}
rep(i, 0, m) {
maxrow = max(maxrow, inrow[x[i]]);
maxcol = max(maxcol, incol[y[i]]);
}
ll num = 0;
for (auto it = incol.begin(); it != incol.end(); it++) {
if (it->second == maxcol)
num++;
}
bool suc = 0;
rep(i, 0, m) {
if (inrow[x[i]] == maxrow && incol[y[i]] == maxcol) {
if (cnt.count(x[i]))
cnt[x[i]]++;
else
cnt[x[i]] = 1;
}
}
rep(i, 0, m) {
if (inrow[x[i]] == maxrow && cnt[x[i]] != num) {
suc = 1;
break;
}
}
if (suc)
cout << maxrow + maxcol;
else
cout << maxrow + maxcol - 1;
}
int main() {
bool _multipleTestCases = false;
if (_multipleTestCases) {
ll t; cin >> t;
while (t--)
solve();
}
else {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(x) (x).begin(), (x).end()
#define PB(x) push_back(x)
#define MP(x, y) make_pair(x, y)
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll my_abs(ll a);
ll a_n(ll a, ll n);
ll my_gcd(ll a, ll b);
ll inv(ll a);
ll madd(ll a, ll b, ll c);
ll msub(ll a, ll b);
ll mtime(ll a, ll b, ll c);
int main() {
ll s; cin >> s;
vector<ll> dp(s+1, 0);
dp[0] = 1;
for(ll i = 1; i <= s; i++) {
ll sum = 0;
for(ll j = i-3; j >= 0; j--) {
sum += dp[j];
sum %= MOD;
}
dp[i] = sum;
}
cout << dp[s] << endl;
return 0;
}
ll my_abs(ll a) {
if(a >= 0) return a;
else return -1 *a;
}
ll a_n(ll a, ll n) {
if(n == 0) return 1;
ll ret = a, count = 1;
while(count * 2 < n) {
ret *= ret;
count *= 2;
}
if(count == n) return ret;
else return (ret * a_n(a, n-count));
}
ll my_gcd(ll a, ll b) {
if(b == 0) return a;
return my_gcd(b, a%b);
}
ll inv(ll a) {
return a_n(a, MOD-2);
}
ll madd(ll a, ll b, ll c) {
ll ret = (a+b) % MOD;
return (ret+c) % MOD;
}
ll msub(ll a, ll b) {
if(a < b) return (a-b+MOD) % MOD;
else return (a-b) % MOD;
}
ll mtime(ll a, ll b, ll c) {
ll ret = (a*b) % MOD;
return (ret*c) % MOD;
}
| 0
| 99,828,602
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
t.pop_back();
if(s==t) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#define RREPS(i,n) for(ll (i)=(n);(i)>0;(i)--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
template<class T> inline void chmin(T& a, T b){
if (a > b){
a = b;
}
}
template<class T> inline void chmax(T& a, T b){
if (a < b){
a = b;
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
string S;
int A,B;
cin >> A >> B >> S;
bool ok = 1;
REP(i,A+B+1){
if(i == A){
if(S[i] != '-')ok = 0;
}else{
if('0' > S[i] || S[i] > '9'){
ok = 0;
}
}
}
cout << (ok ? "Yes" : "No") << "\n";
}
| 0
| 56,113,277
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll K;
cin >> K;
ll n = 50, r = K % n;
vector<ll> a(n);
for ( int i = 0; i < n; i++ ) {
a[i] = n - 1 + K / n;
}
for ( int i = 0; i < n; i++ ) {
if ( i < r ) {
a[i] += n - r + 1;
} else {
a[i] += -r;
}
}
cout << n << "\n";
for ( int i = 0; i < n; i++ ) {
cout << a[i] << " ";
}
cout << "\n";
return 0;
}
int main() {
solve();
return 0;
}
|
#include<map>
#include<cmath>
#include<ctime>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define qmin(x,y) (x=min(x,y))
#define qmax(x,y) (x=max(x,y))
#define mp(x,y) make_pair(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline int read(){
int ans=0,fh=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') fh=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
ans=ans*10+ch-'0',ch=getchar();
return ans*fh;
}
int n,m,d;
int main(){
n=read(),m=read(),d=read();
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
int x=i+j+m,y=i-j+m;
if((x/d)&1){
if((y/d)&1) printf("R");
else printf("Y");
}
else{
if((y/d)&1) printf("G");
else printf("B");
}
}
printf("\n");
}
return 0;
}
| 0
| 68,712,815
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
const int updn[] = {3, 0};
int n;
while (scanf("%d", &n), n){
int res = 0;
int state = 0;
for (int i = 0; i < n; i++){
string str;
cin >> str;
if (str == "lu") state += 1;
if (str == "ru") state += 2;
if (str == "ld") state -= 1;
if (str == "rd") state -= 2;
if (state == updn[res % 2]) res++;
}
cout << res << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
int sa,sb;
sa = a.size();
sb = b.size();
if(sa>sb){
cout << "GREATER" << endl;
return 0;
}else if(sa <sb){
cout << "LESS" << endl;
return 0;
}else if(sa == sb){
for(int i=0; i<sa; i++){
if(a[i] < b[i]){
cout << "LESS" << endl;
return 0;
}else if(a[i] > b[i]){
cout << "GREATER" << endl;
return 0;
}
}
cout << "EQUAL" << endl;
}
}
| 0
| 78,513,963
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for(const auto& e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void yn(bool j){cout << (j ? "Yes" : "No") << endl; return;}
template<class Head> void pt(Head&& head){cout << head << endl; return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> long long bcount(T1 v, T2 a){return upper_index(v, a) - lower_index(v, a);}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
ll gcd(ll a, ll b){
return a % b ? gcd(b , a % b) : b;
}
int main(){
ll N, K; cin >> N >> K;
vector<ll> a(N); rep(i, N) cin >> a[i];
ll ma = *max_element(all(a));
ll gc = *a.begin();
rep(i, N) gc = gcd(a[i], gc);
pt(K <= ma && (ma - K) % gc == 0 ? "POSSIBLE" : "IMPOSSIBLE");
}
|
#include <iostream>
using namespace std;
int main()
{
int h, w;
while(cin >> h >> w && h && w) {
while(h--) {
int w0 = w;
while(w0--) cout << '#';
cout << '\n';
}
cout << endl;
}
return 0;
}
| 0
| 60,703,098
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll i = r; i < n; i++)
#define RRep(i, r, n) for (ll i = n - 1; i <= r; i--)
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define int long long
#define pb push_back
const int dx[] = {0, -1, 0, 1};
const int dy[] = {1, 0, -1, 0};
const int MOD = (1000000007);
const int INF = (1LL << 60)-1;
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
using Graph = vector<vector<pair<int, int>>>;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
vector<int> a(6);
ll ans=0;
rep(i,6){
cin>>a[i];
}
sort(all(a));
rep(i,4){
if(a[i]==a[i+1]&&a[i+1]==a[i+2]){
ans++;
}
}
if(ans==0){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<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
| 96,402,715
|
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
#define int ll
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
const int INF = 1e9 + 7;
int go(int a, int b, int c) {
if(a % c == 0) {
return 2 * a;
}
int ans = 0;
ans += a / c * 2 * c + c;
ans += go(c-a%c, c, a%c) + a % c;
return ans;
}
signed main()
{
IO_OP;
int n, x;
cin >> n >> x;
cout << x + go(x, n, n-x) << endl;
}
|
#include <iostream>
using namespace std;
int main(){
int x,y;
while(cin >> x >> y, x+y){
if(x > y)swap(x,y);
cout << x << " " << y << endl;
}
return 0;
}
| 0
| 30,584,543
|
#include<cstdio>
#include<cstring>
#include<vector>
#define rep(i,a) for( int i = 0; i != (a); ++i )
#define repi(i,a,b) for( int i = (a); i != (b); ++i )
const int INF = 1<<28;
int n;
std::vector<int> r(100);
std::vector<std::vector<int> > dp( 100, std::vector<int>( 100, INF ) );
int main()
{
scanf( "%d", &n );
rep( i, n )
scanf( "%d%d", &r[i], &r[i+1] );
rep( i, n )
dp[i][i] = 0;
repi( k, 1, n ) rep( i, n-k ) repi( j, i, i+k )
dp[i][i+k] = std::min( dp[i][i+k], dp[i][j]+dp[j+1][i+k]+r[i]*r[j+1]*r[i+k+1] );
printf( "%d\n", dp[0][n-1] );
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
vector<ll> size(51);
ll ans(ll n, ll x){
if (n == 0)
return 1;
if (x == 1)
return 0;
if (x <= size[n-1] + 1)
return ans(n - 1, x - 1);
if (x == size[n-1] + 2)
return ans(n - 1, size[n-1]) + 1;
if (x < size[n])
return ans(n-1, size[n-1]) + 1 + ans(n-1, x - size[n-1] - 2);
return 2*ans(n-1, size[n-1]) + 1;
}
int main(void){
size[0] = 1;
for (int i = 0; i < 50; i++){
size[i + 1] = 2*size[i] + 3;
}
ll n, x;
cin >> n >> x;
cout << ans(n, x) << endl;
return 0;
}
| 0
| 2,187,718
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin>>N;
vector<int>D;
for (int i = 0; i < N; i++)
{
int d;
cin>>d;
D.push_back(d);
}
sort(D.begin(),D.end());
int ans=D[N/2]-D[(N/2)-1];
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int cnt[N];
fill(cnt, cnt + N, 0);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
cnt[--A]++;
}
sort(cnt, cnt + N);
int r = N - 1;
int S = N;
for (int i = 0, K = 1; i < N; i++, K++) {
while (r >= 0 && S < K * cnt[r]) S -= cnt[r--], K--;
cout << S / K << '\n';
}
return 0;
}
| 0
| 88,496,208
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a[3],ans;
for(int i=0;i<3;++i){
cin>>a[i];
}
sort(a,a+3);
ans=a[2]*10+a[1]+a[0];
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e10
typedef long long ll;
typedef long double ld;
int main(){
string x;
cin>>x;
string head, tail;
ll n=SIZE(x);
if(n<3){
cout<<0<<endl;
}else{
head=x.substr(0,n-2), tail=x.substr(n-2,2);
ll head_num=stoll(head), tail_num=stoll(tail);
cout<<((head_num*5>=tail_num)?1:0)<<endl;
}
return 0;
}
| 0
| 91,198,943
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int N, K;
int A[100010], B[100010];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
ll ans = 0;
for (int i = 0; i < N; i++) {
if ((A[i]|K) == K) ans += B[i];
}
for (int i = 0; i < 30; i++) {
if (!(K >> i & 1)) continue;
int K2 = (1 << i) - 1;
for (int j = i+1; j < 30; j++) {
K2 += (K >> j & 1) << j;
}
ll sub = 0;
for (int j = 0; j < N; j++) {
if ((A[j]|K2) == K2) sub += B[j];
}
ans = max(ans, sub);
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define PII pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) \
scanf("%d", &(name)[i])
#define GS(name) \
string(name); \
cin >> (name)
#define DEBUG(...) debug(__LINE__,__VA_ARGS__)
#define MOD 1000000007
using namespace std;
string to_string(string s) { return s; }
template <class T>
string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail>
void debug_print(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug_print(tail...);
}
template <class... T>
void debug(T... args) {
debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head head, Tail... tail) {
cout << to_string(head) << " ";
print(tail...);
}
int main() {
GI(N);
GVI(a,N);
int mx=*max_element(ALL(a)),mn=*min_element(ALL(a));
bool f=1;
for(int i=mn;i<=mx;++i){
int ct=0;
FOR(j,N){
if(a[j]==i)ct++;
}
if((i!=mn&&ct<2)||(mx%2==0&&i==mn&&ct!=1)||(mx%2==1&&i==mn&&ct!=2)){
f=0;
}
}
print(f?"Possible":"Impossible");
return 0;
}
| 0
| 88,822,950
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define _GLIBCXX_DEBUG
signed main() {
int N, K; cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
int ans = 0;
int mod = pow(10, 9)+7;
int sk = K*(K-1)/2;
sk %= mod;
rep(i, N) {
int k = 0;
int kk = 0;
rep(j, N) {
if(A[i] > A[j]) {
kk++;
if(i < j) k++;
}
}
ans += k*K;
ans %= mod;
ans += kk*sk;
ans %= mod;
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main(void){
int d;
while(true){
cin >>d;
if(cin.eof())
break;
int total=0;
for(int i=d; i<600; i+=d)
total+=d*i*i;
cout << total << endl;
}
return 0;
}
| 0
| 2,605,503
|
#include <iostream>
#include <string>
using namespace std;
int
main()
{
ios::sync_with_stdio(false);
while (true) {
string line;
getline(cin, line);
if (line == "-") {
break;
}
int m;
cin >> m; cin.ignore();
for (int i = 0; i < m; i++) {
int h;
cin >> h; cin.ignore();
line = line.substr(h) + line.substr(0, h);
}
cout << line << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
int p[MAX_N];
int idx[MAX_N];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &(p[i]));
p[i] -= 1;
idx[p[i]] = i;
}
set<int> st;
ll ans = 0LL;
for (int x = n - 1; x >= 0; --x) {
int i = idx[x];
ll c = 0LL;
{
st.insert(i);
vector<int> l(2, -1);
vector<int> r(2, n);
{
auto itr = st.find(i);
for (int j = 0; j < 2; ++j) {
if (itr == st.begin()) break;
--itr;
l[j] = *itr;
}
}
{
auto itr = st.find(i);
for (int j = 0; j < 2; ++j) {
++itr;
if (itr == st.end()) break;
r[j] = *itr;
}
}
vector<int> ls(2);
ls[0] = i - l[0];
ls[1] = l[0] - l[1];
vector<int> rs(2);
rs[0] = r[0] - i;
rs[1] = r[1] - r[0];
c = (ll)(ls[0] * rs[1]) + (ll)(ls[1] * rs[0]);
}
ans += c * (x + 1);
}
printf("%lld\n", ans);
return 0;
}
| 0
| 53,918,708
|
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pqueue priority_queue
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);
int main() {
ll N;
cin>>N;
if(N%2==1) {
cout<<0<<endl;
return 0;
}
N -= N%10;
ll ans=0;
ll tmp = 1;
while(tmp<N) {
ans += N/10/tmp;
tmp *= 5;
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
int main() {
ll h, w;
cin >> h >> w;
if (min(h, w) == 1) {
cout << 1 << endl;
return 0;
}
cout << ((h + 1) / 2) * ((w + 1) / 2) + (h / 2) * (w / 2) << endl;
}
| 0
| 36,821,545
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
long long n; cin >> n;
long long minx = 100000000;
long long k = 1;
while (k * k <= n){
if (n%k == 0){
long long x = max(to_string(n/k).size(), to_string(k).size());
minx = min(x, minx);
}
k ++;
}
cout << minx << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
ll n;cin>>n;
ll arr[n+1];
ll sum=0;
bool state=0;
for(int i=0;i<=n;i++){
cin>>arr[i];sum+=arr[i];
}
if(n==0){if(arr[0]==1){cout<<"1\n";return 0;}if(arr[0]==2){cout<<"-1\n";return 0;}}
ll cnt=1,node=1;
for(int i=1;i<=n;i++){
node=min(node*2,sum);
cnt+=node;
node-=arr[i];
sum-=arr[i];
if(node<0)state=1;
}
if(state||arr[0]>0){cout<<"-1\n";return 0;}
cout<<cnt<<"\n";
}
| 0
| 75,231,362
|
#include <stdio.h>
int main () {
int apel, apel2, slice;
scanf ("%d %d", &apel, &apel2);
slice = (apel * 3) + apel2;
printf ("%d", slice/2);
return 0;
}
|
#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
using namespace std;
#define PRINTARR(x, y) \
cerr << #x << "=\n"; \
for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
cerr << endl;
#define PRINTARR2(x, i0, i1) \
cerr << #x << "=\n"; \
for (int ii0 = 0; ii0 < i0; ii0++) { \
for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
cerr << endl; \
}
#define DUMPOUT cerr
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
REP(i, (int)vec.size())
os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
FORA(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
FORA(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define DUMP(...)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define ld long double
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
#define MAXN 100100
int a[MAXN];
signed main() {
cin.tie(0), ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N, L;
cin >> N >> L;
REP(i, N) cin >> a[i];
bool ok = false;
int index = 0;
REP(i, N - 1) {
if (a[i] + a[i + 1] >= L) {
ok = true;
index = i;
break;
}
}
if (ok) {
vec<int> ans;
print("Possible");
FOR(i, index, N - 1) { ans.pb(i); }
REPR(i, index - 1) { ans.pb(i); }
REP(i, N - 1) print(1 + ans[N - 2 - i]);
} else {
print("Impossible");
}
}
| 0
| 63,109,792
|
#include<bits/stdc++.h>
using namespace std;
int find_parent(int i,int par[])
{
if(i==par[i])
return i;
return par[i]=find_parent(par[i],par);
}
int main()
{
int n,m;
cin>>n>>m;
int par[n];
int sz[n];
for(int i=0;i<n;i++)
{
par[i]=i;
sz[i]=1;
}
int ma=1;
int a,b;
for(int i=0;i<m;i++)
{
cin>>a>>b;
a--,b--;
a=find_parent(a,par);
b=find_parent(b,par);
if(a!=b)
{
par[b]=a;
sz[a]+=sz[b];
ma=max(ma,sz[a]);
}
}
cout<<ma<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define si( x ) scanf("%d", &x)
#define sll( x ) scanf("%lld", &x)
#define mp make_pair
#define pb push_back
#define INF 1e18
using namespace std;
typedef pair < int , int > pii;
typedef long long ll;
ll dis[101][101];
int n, m;
int main( int argc, char *argv[] )
{
cin >> n >> m;
for(int i = 0 ; i < n ; i++) for(int j = 0 ; j < n ; j++){
if(i == j) dis[i][i] = 0;
else dis[i][j] = INF;
}
for(int i = 0 ; i < m ; i++){
int _a, _b, _w;
cin >> _a >> _b >> _w;
dis[_a][_b] = _w;
}
for(int k = 0 ; k < n ; k++){
for(int i = 0 ; i < n ; i++) for(int j = 0 ; j < n ; j++){
dis[i][j] = min( dis[i][j], dis[i][k] + dis[k][j] );
}
}
for(int i = 0 ; i < n ; i++){
if( dis[i][i] < 0 ) return !printf("NEGATIVE CYCLE\n");
}
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
if( j ) printf(" ");
if( dis[i][j] > 2e9 ){
printf("INF");
}
else printf("%d", dis[i][j]);
}
printf("\n");
}
}
| 0
| 50,588,722
|
#include<bits/stdc++.h>
using namespace std;
inline void ri(int &x){
x=0; static char c; bool t=0;
while(c=getchar(),c<'0'||c>'9') if(c=='-') t=1; else t=0;
do x=x*10+c-'0'; while(c=getchar(),c>='0'&&c<='9');
if(t) x=-x;
}
const int N=200024;
vector<int> Q[N];
int sg[N];
void dfs(int fa,int x){
int i,l=Q[x].size(),ne;
for(i=0;i<l;++i){
ne=Q[x][i];
if(ne==fa) continue;
dfs(x,ne);
sg[x]^=sg[ne]+1;
}
}
int main(){
int i,n,x,y; ri(n);
for(i=1;i<n;++i){
ri(x); ri(y);
Q[x].push_back(y);
Q[y].push_back(x);
}
dfs(-1,1);
if(sg[1]==0) puts("Bob");
else puts("Alice");
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char** argv) {
int x = 0;
int v[3] = {0};
for (int i = 0; i < 3; i++) {
cin >> v[i];
}
for (int i = 0; i < 2; i++) {
int j = i;
for (int k = i+1; k < 3; k++) {
if(v[j] > v[k]) {
j = k;
}
}
int temp = v[i];
v[i] = v[j];
v[j] = temp;
}
for (int i = 0; i < 2; i++) {
cout << v[i] << " ";
}
cout << v[2] << endl;
return 0;
}
| 0
| 1,871,170
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const ll MOD2=998244353;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrstuvwxyz";
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct edge{ll to,cost;};
int main() {
ll n,d,a;
cin >> n >> d >> a;
vector<P> p(n+1,{INF,0});
vl x(n+1,INF),h(n+1,0);
rep(i,n){
cin >> x[i] >> h[i];
h[i]=(h[i]-1)/a+1;
p[i].first=x[i];
p[i].second=h[i];
}
rep(i,n){
p[i].first=x[i];
p[i].second=h[i];
}
sort(p.begin(),p.end());
vl DIS(n);
vl delta(n,0);
ll atk=0;
ll R=0;
rep(i,n){
while(p[R+1].first<=2*d+p[i].first){
R++;
}
DIS[i]=R;
}
ll cnt=0;
rep(i,n){
if(delta[i]<0){
atk+=delta[i];
}
if(p[i].second>atk){
cnt+=(p[i].second-atk);
delta[DIS[i]+1]-=p[i].second-atk;
atk=p[i].second;
}
}
cout << cnt << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <cctype>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr ll INF = 3000000000000000000;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N), B(N), C(M), D(M);
REP(i, N) cin >> A[i] >> B[i];
REP(i, M) cin >> C[i] >> D[i];
REP(i, N) {
int ans = 0;
ll d = INF;
REP(j, M) {
if (abs(A[i] - C[j]) + abs(B[i] - D[j]) < d) {
ans = j + 1;
d = abs(A[i] - C[j]) + abs(B[i] - D[j]);
}
}
cout << ans << "\n";
}
return 0;
}
| 0
| 52,536,307
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string a, b;
cin >> a >> b;
int m = a.size(), n = b.size();
if (m < n) {
cout << "LESS" << "\n";
return 0;
}
else if (m > n) {
cout << "GREATER" << "\n";
return 0;
}
for (int i = 0; i < m; ++i) {
if (a[i] < b[i]) {
cout << "LESS" << "\n";
return 0;
}
else if (a[i] > b[i]) {
cout << "GREATER" << "\n";
return 0;
}
}
cout << "EQUAL" << "\n";
}
|
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
#define N 105
vector<int> neighbors[N];
queue<int> q;
int dist[N];
int vis[N];
int res = 0;
void bfs(int d){
if(q.empty()) return;
while(!q.empty()){
int temp = q.front();
q.pop();
if(dist[temp]!=-1){
if(d<dist[temp]) dist[temp] = d;
else {dist[temp] = dist[temp];}
}else {
dist[temp] = d;
}
for(int i = 0; i<neighbors[temp].size(); i++){
d = dist[temp] +1;
if(dist[neighbors[temp].at(i)] == -1){
q.push(neighbors[temp].at(i));
dist[neighbors[temp].at(i)] = d;
}
}
}
}
int main()
{
int n;
scanf("%d",&n);
memset(dist, -1, sizeof(dist));
memset(vis, -1, sizeof(dist));
for(int i = 0; i<n; i++){
int node;
scanf("%d",&node);
int num;
scanf("%d",&num);
for(int j = 0; j<num; j++){
int temp;
scanf("%d",&temp);
neighbors[node].push_back(temp);
}
}
q.push(1);
bfs(0);
for(int i = 1; i<=n; i++){
printf("%d %d\n",i, dist[i]);
}
return 0;
}
| 0
| 81,111,794
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >>a>>b>>c>>d;
int w,x,y,z;
x=d+c-a;
w=c-(d-b);
y=a-(d-b);
z=b+c-a;
cout <<w << ' ' << x << ' ' << y <<' ' << z << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;
ll fact[101];
int main(){
string n;
ll k;
cin >> n >> k;
fact[0] = 1;
for(int i = 1; i <= 100; i++){
fact[i] = fact[i-1]*i;
}
ll dp0[n.length()+1][k+1], dp1[n.length()+1][k+1];
for(int i = 0; i < k+1; i++){
dp0[0][i] = 0;
dp1[0][i] = 0;
}
dp0[0][0] = 0;
dp1[0][0] = 1;
for(int i = 1; i <= n.length(); i++){
for(int j = 0; j <= k; j++){
int d = n[i-1]-'0';
dp0[i][j] = dp0[i-1][j];
if(j != 0){
dp0[i][j] += dp0[i-1][j-1]*9;
if(d != 0){
dp0[i][j] += dp1[i-1][j-1]*(d-1);
dp0[i][j] += dp1[i-1][j];
}
} else {
dp0[i][j] = 1;
}
if(d != 0){
if(j != 0){
dp1[i][j] = dp1[i-1][j-1];
} else {
dp1[i][j] = 0;
}
} else {
dp1[i][j] = dp1[i-1][j];
}
}
}
cout << dp0[n.length()][k] + dp1[n.length()][k] << endl;
return 0;
}
| 0
| 69,736,004
|
#include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n;cin>>n;int a[n];for(int i=0;i<n;i++){cin>>a[i];}
#define outarr(a,n) for(int i=0;i<n;i++){cout<<a[i]<<" ";}
#define mod 1000000007
#define ff first
#define big 1e15
#define ss second
#define add push_back
#define remove pop_back
#define mapii map<int,int>
#define large *max_element
#define small *min_element
#define float double
#define pqi priority_queue<int>
#define mpqi priority_queue<int,vector<int>,greater<int>>
#define in(n) int n;cin>>n;
#define w(t) int t;cin>>t;while(t--)
#define vi vector<int>
#define vivi vector<vector<int>>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>pbds;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output3.txt", "w", stdout);
#endif
in(a); in(b); in(c); in(k);
int sum = 0;
int x = min(a, k);
k -= x;
sum += x;
k -= min(b, k);
int y = min(c, k);
k -= y;
sum -= y;
cout << sum << endl;
}
|
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define rrepSE(i,s,e) for (int i = (s); i > (e); i--)
#define ssort(v) sort(v.begin(), v.end())
#define gsort(v) sort(v.rbegin(), v.rend())
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
#define DEBUG_PRINT(var) std::cout << #var << " = " << var << "\n";
int main()
{
int n;
cin >> n;
string s; cin >> s;
int ans = 1;
char now = s[0];
repSE(i,1,s.size()) {
if (s[i] != now) {
ans ++; now = s[i];
}
}
cout << ans << "\n";
return 0;
}
| 0
| 85,388,497
|
#include <iostream>
#define MAX 45
using namespace std;
int f[MAX];
int fib(int n){
if(n==0||n==1) return f[n]=1;
if(f[n] != -1) return f[n];
return f[n]=fib(n-1)+fib(n-2);
}
int main(){
int n; cin >> n;
for(int i=0;i<=n;i++) f[i]=-1;
cout << fib(n) << endl;
}
|
#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#define intmax numeric_limits<int>::max()
#define llmax numeric_limits<ll>::max()
#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 rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>=1;i--)
#define all(vec) vec.begin(),vec.end()
#define sortt(vec) sort((vec).begin(),(vec).end())
#define rsort(vec) sort((vec).rbegin(), (vec).rend())
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef tuple<ll,ll,ll> tlll;
typedef tuple<int,int,int> tiii;
const ll mod=1e9+7;
const int inf=1<<30;
const ll lnf=1ll<<60;
int main(){
int n; cin >> n;
vector<int> a(n);
vector<int> b(n);
bool same=1;
ll sum=0;
rep(i,n){
cin >> a[i] >> b[i];
sum+=a[i];
if(a[i]!=b[i]) same=0;
}
if(same){
cout << 0 << endl;
return 0;
}
int mn=intmax;
rep(i,n){
if(a[i]>b[i]) chmin(mn,b[i]);
}
cout << sum-mn << endl;
}
| 0
| 9,376,726
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
int w, h, n;
cin >> w >> h >> n;
int p1 = 0, p2 = w, p3 = 0, p4 = h;
rep(i, n)
{
int x, y, a;
cin >> x >> y >> a;
if (a == 1)
p1 = max(p1, x);
if (a == 2)
p2 = min(p2, x);
if (a == 3)
p3 = max(p3, y);
if (a == 4)
p4 = min(p4, y);
}
int ans = max(p4 - p3, 0) * max(p2 - p1, 0);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a[1000];
int min, max;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i == 0)
{
min = a[i];
max = a[i];
}
else
{
if (max < a[i])
max = a[i];
if (min > a[i])
min = a[i];
}
}
int c[1000] = { 0 };
int k = 0;
for (int i = min; i <= max; i++, k++)
{
for (int j = 0; j < n; j++)
{
c[k] += (i - a[j]) * (i - a[j]);
}
}
sort(c, c + k);
cout << c[0] << endl;
}
| 0
| 73,612,478
|
#include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const int mod = 1e9 + 7, maxn = 2010;
const long double PI = acos(-1);
bool f(ll n){
ll l = n%10;
while(n){
if (abs(n%10 - l) > 1) return false;
n/=10;
}
return true;
}
int main (){
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> ans, a;
for (int i=1; i<10; i++) a.push_back(i), ans.push_back(i);
while(ans.size() < 100000){
vector<ll> next;
for (int i=0; i<10; i++){
for (auto x: a){
if (abs(x%10 - i) <= 1) {
next.push_back(x*10+i);
ans.push_back(x*10+i);
}
}
}
a = next;
}
sort(all(ans));
cout << ans[n-1] << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
static const LL MOD = 1000000007;
static const size_t MAX_N = 100001;
struct modll {
long long x;
modll() { }
modll(long long _x) : x(_x) { }
operator int() const { return (int)x; }
modll operator+(const modll &r) { return (x + r.x) % MOD; }
modll operator+=(const modll &r) { return x = (x + r.x) % MOD; }
modll operator-(const modll &r) { return (x + MOD - r.x) % MOD; }
modll operator-=(const modll &r) { return x = (x + MOD - r.x) % MOD; }
modll operator*(const modll &r) { return (x * r.x) % MOD; }
modll operator*(int r) { return (x * r) % MOD; }
modll operator*=(const modll &r) { return x = (x * r.x) % MOD; }
static modll modinv(int a) { return modpow(a, MOD - 2); }
static modll modpow(int a, int b) {
modll x = a, r = 1;
for (; b; b >>= 1, x *= x) if (b & 1) r *= x;
return r;
}
};
modll combination(LL n, LL r) {
static modll fact[MAX_N + 1], inv[MAX_N + 1];
if (!fact[0]) {
fact[0] = 1;
for (int i = 1; i <= MAX_N; ++i) {
fact[i] = fact[i - 1] * i;
}
inv[MAX_N] = modll::modinv(fact[MAX_N]);
for (int i = MAX_N; i >= 1; --i) {
inv[i - 1] = inv[i] * i;
}
}
if (r > n) {
return 0;
}
return (fact[n] * inv[r]) * inv[n - r];
}
int main(int argc, char *argv[]) {
int n, d;
cin >> n;
vector<int> pos(n + 1, -1);
for (int i = 0; i <= n; ++i) {
int a;
cin >> a;
if (pos[a] >= 0) {
d = i - pos[a];
}
pos[a] = i;
}
for (int i = 1; i <= n + 1; ++i) {
modll ans = combination(n + 1, i) - combination(n - d, i - 1);
cout << ans << endl;
}
return 0;
}
| 0
| 37,943,384
|
#include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
int main() {
int N;
cin>>N;
vector<string> S(N);
for(int i=0;i<N;i++){
cin>>S[i];
}
int M;
cin>>M;
vector<string> T(M);
for(int j=0;j<M;j++){
cin>>T[j];
}
int ans=0;
for(int i=0;i<N;i++){
int check=0;
for(int j=0;j<N;j++){
if(S[i]==S[j]){
check++;
}
}
for(int j=0;j<M;j++){
if(S[i]==T[j]){
check--;
}
}
ans=max(ans,check);
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int size = 0;
int S[2000000] = {0};
int parent(int i){
if(i % 2 == 1)return (i - 1) / 2;
else return (i - 2) / 2;
}
void insert(int *S, int k){
int i = size++;
while(i > 0){
int p = parent(i);
if(S[p] >= k) break;
else{
S[i] = S[p];
i = p;
}
}
S[i] = k;
}
int extractMax(int *S){
int ret = S[0];
int x = S[--size];
int i = 0;
while(i * 2 + 1 < size){
int l = i * 2 + 1, r = i * 2 + 2;
if(r < size && S[r] > S[l]) l = r;
if(S[l] <= x)break;
S[i] = S[l];
i = l;
}
S[i] = x;
return ret;
}
int main(){
string s;
int k;
while(1){
cin >> s;
if(s == "end"){
break;
}else if(s == "insert"){
cin >> k;
insert(S, k);
}else {
cout << extractMax(S) << endl;
}
}
}
| 0
| 96,418,589
|
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
string s,t,u;
ll a,b;
cin >> s >> t >> a >> b >>u;
if(u==s)cout << a-1 << " " << b << endl;
else cout << a << " " << b-1 << endl;
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
for (auto i = first;i != last;i++){
cin >> (*i);
}
}
template<class itr> void array_output(itr start,itr goal){
string ans = "",k = " ";
for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
if (!ans.empty()) ans.pop_back();
PRINT(ans);
}
ll gcd(ll a, ll b) {
return a ? gcd(b%a,a) : b;
}
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
typedef pair<ll,ll> P;
typedef pair<double,double> point;
const ll MAX = 200000;
constexpr ll nx[8] = {1,0,-1,0,1,-1,1,-1};
constexpr ll ny[8] = {0,1,0,-1,1,1,-1,-1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s,t;
cin >> s >> t;
vector<vector<ll>> c1(26),c2(26);
rep(i,s.length()){
c1[s[i]-'a'].push_back(i);
c2[t[i]-'a'].push_back(i);
}
SORT(c1);
SORT(c2);
Yes(c1 == c2);
}
| 0
| 75,260,935
|
#include<cstdio>
using namespace std;
#define god(x1,y1,x2,y2,x3,y3) x1*(y2-y3)+x2*(y3-y1)+x3*(y1-y2)
int main(){
double x1,y1,x2,y2,x3,y3,ax,ay;
while(scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3,&ax,&ay) != EOF){
if(god(x1,y1,x2,y2,x3,y3) > 0.0 && god(ax,ay,x1,y1,x2,y2) > 0.0 &&
god(ax,ay,x3,y3,x1,y1) > 0.0 && god(ax,ay,x2,y2,x3,y3) > 0.0){
printf("YES\n");
}
else if(god(x1,y1,x2,y2,x3,y3) < 0.0 && god(ax,ay,x1,y1,x2,y2) < 0.0 &&
god(ax,ay,x3,y3,x1,y1) < 0.0 && god(ax,ay,x2,y2,x3,y3) < 0.0){
printf("YES\n");
}
else printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int n;
string s;
cin >> n >> s;
auto strTOint = [&](char c){
return c - '0';
};
vector<int> a(s.size());
REP(i,s.size()){
a[i] = strTOint(s[i]);
}
int ans = 0;
REP(key,1000){
bool ok = false;
int key1 = key/100;
int key2 = (key-key1*100)/10;
int key3 = key-key1*100-key2*10;
int f1 = find(a.begin() , a.end(), key1) - a.begin();
if (f1 == n) continue;
int f2 = find(a.begin() + f1 +1, a.end(), key2) - a.begin();
if (f2 == n) continue;
int f3 = find(a.begin() + f2 + 1, a.end(), key3) - a.begin();
if(f3 != n){
++ans;
}
}
cout << ans << endl;
return 0;
}
| 0
| 9,244,614
|
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define sf scanf
#define si(a) sf("%d",&a)
#define sc(a) sf("%c",&a)
#define sii(a,b) sf("%d %d",&a,&b)
#define siii(a,b,c) sf("%d %d %d",&a,&b,&c)
#define sl(a) sf("%lld",&a)
#define sll(a,b) sf("%lld %lld",&a,&b);
#define slll(a,b,c) sf("%lld %lld %lld",&a,&b,&c);
#define pf printf
#define pfi(a) pf("%d\n",a)
#define pfii(a,b) pf("%d %d\n",a,b)
#define pfl(a) pf("%ld\n",a)
#define pfn pf("\n")
#define pfyes pf("YES\n")
#define pfno pf("NO\n")
#define pfYes pf("Yes\n")
#define pfNo pf("No\n")
#define wh while
#define wht(t) while(t--)
int main()
{
int t;
si(t);
cout<<t*t<<endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
const int mx = 200000 + 9;
bitset <mx> mark;
int d[mx];
vector <int> adj[mx];
int main() {
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b; cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
mark[1] = 1;
queue <int> q;
q.push(1);
while (!q.empty()) {
auto u = q.front();
q.pop();
for (auto v : adj[u]) {
if (mark[v]) continue;
mark[v] = 1;
d[v] = 1 + d[u];
q.push(v);
}
}
if (d[n] == 2) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << endl;
}
| 0
| 65,741,111
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main() {
int a,b;
cin >> a >> b;
if(a==b)
cout << "Draw" << endl;
else if(a!=1&&b!=1){
if(a<b)
cout << "Bob" << endl;
else
cout << "Alice" << endl;
}
else{
if(a==1){
cout << "Alice" << endl;
}
else
cout << "Bob" << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e9 + 7;
ll T = 1;
ll n, x, m, k, u, v;
string s, t;
void MAIN() {
cin>>s;
ll c0 = count(all(s),'0');
ll c1 = count(all(s),'1');
cout<<2*min(c0,c1);
}
int main() {
fastio; randomINT;
while (T--) {
MAIN();
}
return 0;
}
| 0
| 16,314,755
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void debug_out() {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
int main() {
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
freopen("in.txt", "r", stdin);
#else
#define debug(...) 3
fastIO;
#endif
int h, w, k;
cin >> h >> w >> k;
char mat[h + 1][w + 1];
forn(i, h) {
string cad;
cin >> cad;
forn(j, w) {
mat[i][j] = cad[j];
}
}
int ans = 0;
for(int mask1 = 0; mask1 < (1 << h); mask1++) {
for(int mask2 = 0; mask2 < (1 << w); mask2++) {
int cnt = 0;
forn(i, h) {
forn(j, w) {
bool bit1 = (mask1 & (1 << i));
bool bit2 = (mask2 & (1 << j));
if(!(bit1 || bit2) && mat[i][j] == '#')cnt++;
}
}
if(cnt == k)ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define repd(i, a, b) for (int i = a; i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
template <typename H>
bool chmin(H &v1, const H v2)
{
if (v1 > v2)
{
v1 = v2;
return true;
}
return false;
}
template <typename H>
bool chmax(H &v1, const H v2)
{
if (v1 < v2)
{
v1 = v2;
return true;
}
return false;
}
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
int main()
{
int a, b;
cin >> a >> b;
cout << (a + b) / 2 + ((a + b) % 2 != 0) << endl;
}
| 0
| 2,202,949
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 100
int INFTY = (1<<21);
int num,M[MAX][MAX];
int d[MAX];
void bfs(int s){
queue<int> q;
q.push(s);
int u,i,v;
for( i = 0; i < num; i++){
d[i] = INFTY;
}
d[s] = 0;
while( !q.empty()){
u = q.front();
q.pop();
for(v = 0; v < num; v++){
if( M[u][v] == 0){
continue;
}
if( d[v] != INFTY){
continue;
}
d[v] = d[u]+1;
q.push(v);
}
}
for(i = 0; i < num; i++){
cout << i+1 << " " << ( (d[i] == INFTY) ? (-1) : d[i] ) << endl;
}
}
int main(){
int u,k,v,i,j;
cin >> num;
for(i = 0; i < num; i++){
for(j = 0; j < num; j++){
M[i][j] = 0;
}
}
for(i = 0; i < num; i++){
cin >> u >> k;;
u--;
for(j = 0; j < k; j++){
cin >> v;
v--;
M[u][v] = 1;
}
}
bfs(0);
return 0;
}
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <string.h>
#define s(n) scanf("%d",&n)
#define sc(n) scanf("%c",&n)
#define sl(n) scanf("%I64d",&n)
#define sf(n) scanf("%lf",&n)
#define ss(n) scanf("%s",n)
#define INF (int)1e9
#define EPS 1e-9
#define bitcount __builtin_popcount
#define gcd __gcd
#define forall(i,a,b) for(int i=a;i<b;i++)
#define foreach(v, c) for( typeof( (c).begin()) v = (c).begin(); v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define pb push_back
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define mp make_pair
#define MOD 1000000007
typedef long long ll;
using namespace std;
int dp[101][101];
int main()
{
int h,w;
cin>>h>>w;
vector<string> vec;
for(int i = 0;i<h;i++)
{
string str;
cin>>str;
vec.push_back(str);
}
if(vec[0][0] == '#') dp[0][0] = 1;
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
if(i == 0 && j == 0) continue;
int val = INF;
if(i-1 >= 0)
{
val = dp[i-1][j];
if(vec[i-1][j] == '.' && vec[i][j] == '#') val += 1;
}
if(j-1 >=0)
{
int temp = dp[i][j-1];
if(vec[i][j-1] == '.' && vec[i][j] == '#') temp+=1;
val = min(val , temp);
}
dp[i][j] = val; }
}
cout<<dp[h-1][w-1]<<endl;
return 0;
}
| 0
| 3,622,952
|
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
typedef pair<int, int> P;
int main() {
ll n, m; cin >> n >> m;
vector<P> S(n), C(m);
loop(i,0,n) cin >> S[i].first >> S[i].second;
loop(i,0,m) cin >> C[i].first >> C[i].second;
const int INF = 1400000000;
vector<int> I(n);
loop(i,0,n) {
int min_ = INF;
loop(j,0,m) {
int d = abs(S[i].first - C[j].first) + abs(S[i].second - C[j].second);
if (min_ > d) {
I[i] = j + 1;
min_ = d;
}
}
}
loop(i,0,n) cout << I[i] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int curr=1;
set<int> s;
s.insert(n);
while( true)
{
if(n%2==0)
{
curr++;
n=n/2;
if( s.find(n)== s.end() )
{
s.insert(n);
}
else {
cout << curr;
break;
}
} else
{
n= 3*n+1;
curr++;
if( s.find(n)== s.end())
{
s.insert(n);
}
else {
cout << curr;
break;
}
}
}
}
| 0
| 98,278,936
|
#include<iostream>
#include<string>
#include<cctype>
using namespace std;
string shuffle(string str, int h){
string str1 = str.substr(0,h);
string str2 = str.substr(h, str.size()-h);
return str2 + str1;
}
int main(){
string card;
int i, h;
while(1){
cin>>card;
if (card=="-") break;
cin>>i;
for(int k=0; k<i; k++){
cin>>h;
card=shuffle(card,h);
}
cout<<card<<endl;
}
return 0;
}
|
#include <iostream>
#include <bitset>
using namespace std;
const long long INF = 1LL<<60;
int main() {
int n, k; cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
long long ans = INF;
for (int bit = 0; bit < (1<<n); bit++) {
int t = bitset<20>(bit).count();
if (t < k) continue;
long long cost = 0;
int highest = a[0];
for (int i = 1; i < n; i++) {
if (bit & (1<<i) && a[i] <= highest) {
cost += highest - a[i] + 1;
highest++;
}
else {
highest = max(highest, a[i]);
}
}
ans = min(ans, cost);
}
cout << ans << endl;
}
| 0
| 99,148,529
|
#include <iostream>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
long long X, Y;
cin >> X >> Y;
int cnt = 1;
X *= 2;
while(X <= Y){
cnt++;
X *= 2;
}
cout << cnt << '\n';
return 0;
}
|
#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;
int main(){
ll n,l,t;
cin>>n>>l>>t;
vector<pll> a(n);
ll cnt=0;
for(auto &i:a){
cin>>i.F>>i.S;
if(i.S!=a[0].S){
ll dist;
if(a[0].S==1){
dist=i.F-a[0].F;
}
else{
dist=a[0].F+l-i.F;
}
ll move=2*t;
if(dist<=move){move-=dist; cnt++; cnt+=move/l;}
}
}
cnt%=n;
if(a[0].S==2){
cnt=n-cnt;
cnt%=n;
vector<pll> W(n);
for(int i=0;i<n;i++){
W[i].S=i;
if(a[i].S==1){
W[i].F=(a[i].F+t)%l;
}
else{
W[i].F=(a[i].F-t)%l;
if(W[i].F<0){W[i].F+=l;}
}
}
sort(W.begin(),W.end());
ll s=-1;
for(int i=0;i<n;i++){
if(W[i].S==0){s=(i-cnt+n)%n;}
}
for(ll i=s;i<n;i++){
cout<<W[i].F<<endl;
}
for(ll i=0;i<s;i++){
cout<<W[i].F<<endl;
}
}
else{
vector<pll> W(n);
for(int i=0;i<n;i++){
W[i].S=n-i;
if(a[i].S==1){
W[i].F=(a[i].F+t)%l;
}
else{
W[i].F=(a[i].F-t)%l;
if(W[i].F<0){W[i].F+=l;}
}
}
sort(W.begin(),W.end());
ll s=-1;
for(int i=0;i<n;i++){
if(W[i].S==n){s=(i-cnt+n)%n;}
}
for(ll i=s;i<n;i++){
cout<<W[i].F<<endl;
}
for(ll i=0;i<s;i++){
cout<<W[i].F<<endl;
}
}
return 0;
}
| 0
| 75,034,256
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,i,j;
cin>>n>>k;
int m=1e9+7;
int a[n+1],s[k+1];
for(i=1;i<=n;i++)
cin>>a[i];
int dp[n+1][k+1];
dp[0][0]=1;
for(i=1;i<=k;i++)
dp[0][i]=0;
for(i=1;i<=n;i++)
{
s[0]=dp[i-1][0];
for(j=1;j<=k;j++)
s[j]=(s[j-1]+dp[i-1][j])%m;
for(j=0;j<=k;j++)
{
int x=s[j];
int y=j-a[i]-1;
if(y>=0)
x=(x-s[y]+m)%m;
dp[i][j]=x;
}
}
cout<<dp[n][k];
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int MOD = 1000000007;
double PI = 3.14159265358979323846;
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; }
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define For(i,s,n) for (int i=s;i<(int)(n);i++)
#define vi vector<int>
#define vii vector< vector<int> >
#define vs vector<string>
#define All(c) (c).begin(), (c).end()
#define Print(x) cout<<(x)<<"\n"
int main() {
string S;
cin >> S;
rep(i, 12) {
if (i == 4) cout << ' ';
cout << S[i];
}
cout << endl;
}
| 0
| 63,369,875
|
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void){
ll n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
ll m = INF;
for (int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
m = min(m, a[i]);
}
ll l = n * (n + 1)/2;
if (sum % l != 0 || sum / l > m){
cout << "NO" << endl;
}
else {
ll k = sum / l;
bool ok = 1;
for (int i = 0; i < n; i++){
if (a[(i + 1) % n] % n != (a[i] + k) % n){
ok = 0;
}
}
if(ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n, long long k, long long p);
private:
vector<vector<long long>> memo;
long long n_num;
long long k_num;
void Resize(long long n, long long k);
};
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) int((a).size())
#define rep(i,n) for(int(i)=0;(i)<(n);(i)++)
#define repe(i,n) for(int(i)=0;(i)<=(n);(i)++)
#define vsort(v) sort((v).begin(),(v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
#define kiriage(a,b) ((a)+(b)-1)/(b)
const int INF = 1e9;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long> vll;
int main() {
double a,b,x;
cin >> a >> b >> x;
double s = x / a;
double ans;
const double PI = 3.141592653589793;
if(s < a * b / 2)
{
double a2 = 2 * s / b;
ans = 90.000000 - atan(a2 / b) * 180 / PI;
}
else if(s == a * b / 2)
{
ans = 90.000000 - atan(a / b) * 180 / PI;
}
else
{
double buf = a * a / (2 * a * b - 2 * s);
ans = 90.000000 - atan(buf) * 180 / PI;
}
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
int getDigit(int n)
{
int i = 1;
while(1)
{
n = n / 10;
if(n == 1)
break;
i++;
}
return i;
}
int CalcSumOfDigit(int n)
{
int s = 0;
while(n)
{
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(97 <= *itr && *itr <= 122)
{
*itr = *itr - 32;
}
}
return str;
}
string lower(string str)
{
for(auto itr = str.begin();itr != str.end() ; itr++)
{
if(65 <= *itr && *itr <= 90)
{
*itr = *itr + 32;
}
}
return str;
}
Combi::Combi(){
n_num = -1;
k_num = -1;
};
ll Combi::Combination(ll n, ll k)
{
Resize(n,k);
ll ret;
if(memo[n][k] != 0)
{
ret = memo[n][k];
}
else if(n == k || k == 0)
{
memo[n][k] = 1;
ret = 1;
}
else
{
ret = Combination(n - 1, k - 1) + Combination(n - 1, k);
memo[n][k] = ret;
}
return ret;
}
void Combi::Resize(ll n, ll k)
{
if(n_num <= n || k_num <= k)
{
n_num = (n + 1) * 2;
k_num = (k + 1) * 2;
memo.resize(n_num);
for(auto itr = memo.begin(); itr != memo.end(); ++itr)
{
itr->resize(k_num);
}
}
}
long long Combi::nPk_modp(long long n, long long k, long long p)
{
ll ans = 1;
for(long long i = k; i <= n; i++)
{
ans = (ans * i) % p;
}
return ans;
};
| 0
| 56,522,798
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
char m, n;
int count=0;
m = s[0];
while (n != m){
n = m;
for (int i=0; i<s.length(); i++){
if (s[i] != m){
m = s[i];
s = s.substr(i);
count++;
break;
}
}
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int mod = (int) 1e9 + 7;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
for (int i = 0; i < m; ++i) {
cin >> t[i];
}
vector<long long> dp(m + 1, 1);
for (int i = 0; i < n; ++i) {
vector<long long> newDp(m + 1);
for (int j = 1; j <= m; ++j) {
if (s[i] == t[j - 1]) {
(newDp[j] += dp[j - 1]) %= mod;
}
}
for (int j = 1; j <= m; ++j) {
(newDp[j] += newDp[j - 1]) %= mod;
}
for (int j = 0; j <= m; ++j) {
(newDp[j] += dp[j]) %= mod;
}
swap(dp, newDp);
}
cout << dp.back() << '\n';
}
| 0
| 15,199,812
|
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int main() {
fastIO;
string n;
cin >> n;
for (auto ch : n) {
if (ch == '9')
cout << 1;
else if (ch == '1')
cout << 9;
else
cout << ch;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int main() {
int n,k; cin >> n >> k;
map<int,int> m;
for(int i = 0;i < n;i++){
int x; cin >> x;
auto result = m.find(x);
if(result == m.end()){
m.insert(make_pair(x,1));
}else{
result->second+=1;
}
}
vector<int> vec;
for(auto a:m){
vec.push_back(a.second);
}
sort(vec.begin(),vec.end());
int cnt = vec.size();
int ans = 0,i = 0;
while(cnt > k){
ans+=vec[i];i++;
cnt--;
}
cout << ans;
}
| 0
| 99,046,355
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,m;
cin>>n>>m;
int clear=0, pena=0, p;
string s;
map<int, int> ac;
map<int, int> wa;
while(m--){
cin>>p>>s;
if(ac[p]) continue;
if(s=="AC"){
clear++;
ac[p]=1;
pena+=wa[p];
}else if(s=="WA"){
wa[p]++;
}
}
cout<<clear<<" "<<pena<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n,m;
cin >> n >> m;
vector<ll> g[3];
for(int i=0;i<n;++i){
for(int j=0;j<3;++j){
ll x;
cin >> x;
g[j].push_back(x);
}
}
ll cal=0;
for(int bit=0;bit<(1<<3);++bit){
vector<ll> kouho;
for(int i=0;i<n;++i){
ll tmp=0;
for(int j=0;j<3;++j){
if(bit &(1<<j)) tmp+=g[j][i];
else tmp-=g[j][i];
}
kouho.push_back(tmp);
}
sort(kouho.rbegin(),kouho.rend());
ll res=0;
for(int i=0;i<m;++i){
res+=kouho[i];
}
cal=max(cal,res);
}
cout << cal << endl;
return 0;
}
| 0
| 16,370,040
|
#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<cmath>
#include<fstream>
#include <set>
const int MAXN =1e5+10;
const long long mod = 1e14 ;
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int inf= 0x3f3f3f3f;
#define eps 1e-8
#define PI 3.1415926535898
#define lowbit(x) (x&(-x))
using namespace std ;
typedef long long ll;
int a[15][15],c[15];
int main()
{
int ans=inf;
int n,m,x;
scanf("%d %d %d",&n,&m,&x);
for(int i=1;i<=n;i++)
{
scanf("%d",&c[i]);
for(int j=1;j<=m;j++) scanf("%d",&a[i][j]);
}
for(int i=1;i<2<<n;i++)
{
int num=i;
int vis[15],index=1;
while(num)
{
vis[index++]=num%2;
num/=2;
}
int need[15]={0},sum=0;
for(int j=1;j<=n;j++)
{
if(vis[j])
{
sum+=c[j];
for(int k=1;k<=m;k++)
{
need[k]+=a[j][k];
}
}
}
int flag=1;
for(int j=1;j<=m;j++)
{
if(need[j]<x)
{
flag=0;
break;
}
}
if(flag) ans=min(ans,sum);
}
if(ans==inf) printf("-1\n");
else printf("%d\n",ans);
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<long long>;
using pii = pair<int, int>;
using psi = pair<string, int>;
ll N;
int f (ll A) {
ll B = N / A;
int ans = 1;
while(B > 9) {
B /= 10;
ans++;
}
return ans;
}
int main() {
cin >> N;
int ans = -1;
for (ll i = floor(sqrt(N)); i > 0; i--) {
if (N % i == 0) {
ans = f(i);
break;
}
}
cout << ans << endl;
}
| 0
| 83,064,684
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
int main(){
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans=b-b/c-b/d+b/lcm(c,d);
ans-=(a-1)-(a-1)/c-(a-1)/d+(a-1)/lcm(c,d);
cout<<ans<<endl;
}
|
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define VV(T) vector<vector< T > >
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
v.assign(a, vector<T>(b, t));
}
template <class F, class T>
void convert(const F &f, T &t){
stringstream ss;
ss << f;
ss >> t;
}
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x)
#define debug(x)
#endif
#define LDcout(x,n) fixed<<setprecision(n)<<x
#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
int dp[15][15][110];
void mainmain(){
int n,s;
dp[0][0][0]=1;
rep(i,15){
rep(j,15){
rep(k,110){
if(dp[i][j][k]){
reep(l,j,10){
dp[i+1][l+1][k+l]+=dp[i][j][k];
}
}
}
}
}
while(cin>>n>>s,n){
int tmp=0;
rep(i,15){
tmp+=dp[n][i][s];
}
cout<<tmp<<endl;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(20);
mainmain();
}
| 0
| 52,353,409
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned char, unsigned char> pcc;
typedef pair<double, double> pdd;
typedef vector<vector<ll>> matrix;
void solve() {
ll n, x;
cin >> n >> x;
cout << 3 * (n - __gcd(n, x)) << "\n";
}
void casesolve() {
int t;
cin >> t;
for(int i = 1; i <= t; i++) {
cout << "Case #" << i << ":" << "\n";
solve();
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
long long int fun(int n,vector<long long int> &a,vector<long long int> &b,vector<long long int> &c,vector<vector<long long int>> &dp,int k){
if(n<0) return 0;
if(dp[n][k]!=-1) return dp[n][k];
int ans=0;
int v[2]={-1};
if(k==0){
ans = a[n];
v[0]=1;
v[1]=2;
}
if(k==1){
ans = b[n];
v[0]=0;
v[1]=2;
}
if(k==2){
ans = c[n];
v[0]=1;
v[1]=0;
}
dp[n][k] = ans+max(fun(n-1,a,b,c,dp,v[0]),fun(n-1,a,b,c,dp,v[1]));
return dp[n][k];
}
int main(){
long long int n,x,k,y;
cin>>n;
vector<long long int> a,b,c;
vector<vector<long long int>> dp(n+1,vector<long long int>(3,-1));
for(int i=0;i<n;i++){
cin>>x>>y>>k;
a.push_back(x);
b.push_back(y);
c.push_back(k);
}
long long int ans = fun(n-1,a,b,c,dp,0);
ans = max(ans,fun(n-1,a,b,c,dp,1));
ans = max(ans,fun(n-1,a,b,c,dp,2));
cout<<ans<<endl;
}
| 0
| 76,793,721
|
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORL(i,a,b) for(LL i=(a);i<(b);++i)
#define REPL(i,n) FORL(i,0,n)
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
const double EPS = 1e-10;
const double PI = acos(-1.0);
template<typename T>
void vprint(vector<T> v) {
for(auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template<typename T>
void vvprint(vector<vector<T>> vv) {
REP(i, SIZE(vv)) {
REP(j, SIZE(vv[i])) {
cerr << vv[i][j] << " ";
}
cerr << endl;
}
}
template<typename T1, typename T2>
void vpprint(vector<pair<T1, T2>> vp) {
REP(i, SIZE(vp)) {
cerr << vp[i].first << ", " << vp[i].second << endl;
}
}
template<typename T1, typename T2>
void mprint(map<T1, T2> m) {
for(auto x : m) cerr << x.first << ", " << x.second << endl;
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k, const Iterator last)
{
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1)
{
if (*--itr1 < *itr2)
{
Iterator j = k;
while (!(*itr1 < *j)) ++j;
iter_swap(itr1,j);
++itr1;
++j;
itr2 = k;
rotate(itr1,j,last);
while (last != j)
{
++j;
++itr2;
}
rotate(k,itr2,last);
return true;
}
}
rotate(first,k,last);
return false;
}
inline double get_time_sec(void){
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count())/1000000000;
}
template<typename T>
T gcd(T a, T b) {
if(a > b) swap(a, b);
if(a == 0) return b;
else return gcd(b%a, a);
}
template<typename T>
T lcm(T a, T b) {
return (a / gcd(a, b)) * b;
}
template<typename T>
map<T, T> prime_list(T n) {
map<T, T> ret;
for(T i = 2; i*i <= n; i++) {
if(n % i == 0) {
ret[i] = 0;
while(n % i == 0) {
n /= i;
ret[i]++;
}
}
}
if(n != 1) ret[n]++;
return ret;
}
#define MOD 1000000007
LL mypow(LL a, LL n) {
if(n == 0) return 1;
if(n == 1) return a % MOD;
if(n % 2 == 1) return (a * mypow(a, n-1)) % MOD;
LL t = mypow(a, n/2);
return (t * t) % MOD;
}
#define FACT_SZ 100010
VLL _fact, _inv;
bool _fact_flg = true;
void _fact_init() {
_fact = VLL(FACT_SZ);
_inv = VLL(FACT_SZ);
_fact[0] = 1;
FOR(i, 1, FACT_SZ) _fact[i] = (_fact[i-1] * i) % MOD;
_inv[FACT_SZ-1] = mypow(_fact[FACT_SZ-1], MOD - 2);
for(int i = FACT_SZ - 2; i >= 0; i--) {
_inv[i] = ((i + 1) * _inv[i + 1]) % MOD;
}
}
LL mycomb(LL n, LL k) {
if(_fact_flg) {
_fact_flg = false;
_fact_init();
}
if(n < k) return 0;
return (((_fact[n] * _inv[k]) % MOD) * _inv[n-k]) % MOD;
}
VLL par, rnk, sz;
int root(int x) {
if(par[x] == x) return x;
else return par[x] = root(par[x]);
}
bool same(int x, int y) {
x = root(x);
y = root(y);
return x == y;
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if(rnk[x] < rnk[y]) {
par[x] = y;
} else {
par[y] = x;
if(rnk[x] == rnk[y]) rnk[x]++;
}
}
#define INF 1e15
int main(void) {
LL n, m;
cin >> n >> m;
VLL p(n);
REP(i, n) {
cin >> p[i];
p[i]--;
}
par = VLL(n);
iota(ALL(par), 0);
rnk = VLL(n, 0);
REP(i, m) {
int x, y;
cin >> x >> y;
x--, y--;
if(!same(x, y)) unite(x, y);
}
LL cnt = 0;
REP(i, n) {
if(same(i, p[i])) cnt++;
}
cout << cnt << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define FOR(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 1000000000000
#define inf 2147483647
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define CST(x) cout<<fixed<<setprecision(x)
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;
}
int gcd(int a, int b) {
if (b==0) return a;
else return gcd(b, a%b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int two(int n){
ll ans=1;
rep(i,n){
ans*=2;
}
return ans;
}
int waru(int n){
int sum=0;
while(n>0){
sum+=n%10;
n=n/10;
}
return sum;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n,k;
vector<int>l(101);
cin>>n>>k;
rep(i,n)cin>>l.at(i);
sort(ALL(l));
reverse(ALL(l));
int sum=0;
for(int i=0;i<k;i++){
sum+=l.at(i);
}
cout<<sum<<endl;
}
| 0
| 25,581,760
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <string>
using namespace std;
int main()
{
stack<char> s;
while (true){
char str[128];
fgets(str, sizeof(str), stdin);
if (str[0] == '.'){
break;
}
while (!s.empty()){
s.pop();
}
bool flag = true;
for (int i = 0; str[i] != '.'; i++){
if (str[i] == '(' || str[i] == '['){
s.push(str[i]);
}
if (str[i] == ')'){
if (s.empty()){
flag = false;
break;
}
else if (s.top() == '('){
s.pop();
}
else if (s.top() == '['){
flag = false;
break;
}
}
if (str[i] == ']'){
if (s.empty()){
flag = false;
break;
}
else if (s.top() == '['){
s.pop();
}
else if (s.top() == '('){
flag = false;
break;
}
}
}
if (flag && s.empty()){
puts("yes");
}
else {
puts("no");
}
}
return (0);
}
|
#include <stdio.h>
#include <vector>
#include <iostream>
#include <queue>
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
struct node{
ll num;
int cnt;
bool border;
};
int main() {
string ns; int k;
cin >> ns;
cin >> k;
vi n;
rep(i, ns.size()) n.push_back(ns[i] - '0');
int keta = n.size();
queue<node> q;
q.push(node{1, 0, 0});
q.push(node{1, 1, 1});
if (n[0] > 1){
q.push(node{n[0] - 1, 1, 0});
}
for (int kn=1;kn<keta;kn++){
queue<node> new_q;
while(!q.empty()){
node v = q.front(); q.pop();
if (v.cnt > k) continue;
if (v.border){
if (n[kn]){
new_q.push(node{v.num, v.cnt+1, 1});
new_q.push(node{v.num, v.cnt, 0});
}else{
new_q.push(node{v.num, v.cnt, 1});
}
if (n[kn] > 1){
new_q.push(node{v.num * (n[kn] - 1), v.cnt+1, 0});
}
}else{
new_q.push(node{v.num, v.cnt, 0});
new_q.push(node{v.num * 9, v.cnt+1, 0});
}
}
q = new_q;
}
ll ans = 0;
while (!q.empty()){
node v = q.front(); q.pop();
if (v.cnt == k) ans += v.num;
}
cout << ans << endl;
return 0;
}
| 0
| 55,960,570
|
#include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin>>N;
map<int,int> m;
int ans = 0;
for(int i = 1; i <= N; i++) {
int t = i;
for(int j = 2; j<=t; j++) {
while(t%j==0){
m[j]++;
if(m[j]==2){
int k = 0;
for(auto x:m){
if(x.first==j)continue;
if(x.second>=24)ans++;
if(x.second>=4)k++;
}
ans += (k*(k-1))/2;
}
if(m[j]==4) {
int k=0,s=0;
for(auto x:m){
if(x.first==j)continue;
if(x.second>=14)ans++;
if(x.second>=4) k++;
if(x.second>=2)s++;
}
ans += k*(s-1);
}
if(m[j]==14){
for(auto x:m){
if(x.first==j)continue;
if(x.second>=4)ans++;
}
}
if(m[j]==24){
for(auto x:m){
if(x.first==j)continue;
if(x.second>=2)ans++;
}
}
if(m[j]==74)ans++;
t/=j;
}
}
}
cout<<ans <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, i, j;
string S;
bool finished = false;
cin >> H >> W;
for (i = 1; i <= H; i++) {
for (j = 1; j <= W; j++) {
cin >> S;
if (S == "snuke") {
cout << (char)(64 + j) << i << endl;
finished = true;
break;
}
}
if (finished) break;
}
}
| 0
| 72,823,800
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 10000000
#define base10_8 100000000
#define base10_9 1000000000
#define MOD 1000000007
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vint vector<int>
#define vll vector<ll>
string ans_Yes = "Yes";
string ans_No = "No";
string ans_yes = "yes";
string ans_no = "no";
vll A;
ll B;
ll C;
ll N;
ll M;
ll K;
ll ltmp;
string stmp;
double dtmp;
ll ans = 1;
ll llmin(ll a,ll b){
if(a>=b) return b;
return a;
}
ll llmax(ll a,ll b){
if(a<=b) return b;
return a;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
rep(ni,N){
cin >> ltmp;
A.push_back(ltmp);
}
sort(A.begin(),A.end());
ll ni = 0;
while(ni<N){
ll Amax = base10_9;
Amax = Amax * base10_9 / ans;
if(A[ni]==0){
ans = 0;
break;
}
if(Amax < A[ni]){
ans = -1;
break;
}
ans *= A[ni];
ni++;
}
cout << ans << endl;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
const int MAXN=1e9;
int main()
{
int n,k,s;
cin>>n>>k>>s;
if(s==MAXN)
{
for(int i=1;i<=k;i++)
printf("%d ",MAXN);
for(int i=k+1;i<=n;i++)
printf("%d ",1);
}
else {
for(int i=1;i<=k;i++)
printf("%d ",s);
for(int i=k+1;i<=n;i++)
printf("%d ",MAXN);
}
}
| 0
| 31,909,644
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
int main() {
int N, M;
cin>>N>>M;
vector<pint> W(N);
REP(i, 0, N){
int a, b;
cin >> a >> b;
W[i] = {a, b};
}
sort(W.begin(), W.end());
priority_queue<int> que;
int count = 0, ans = 0;
REP(i, 1, M+1){
while(W[count].first == i && count < N){
que.push(W[count].second);
count++;
}
int q;
if(!que.empty()){
q = que.top();
que.pop();
}else{
q = 0;
}
ans += q;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
struct edge {
ll to, cost;
};
int n;
vector<vector<edge>> g;
vector<ll> d;
void dijkstra(int s) {
for (int i = 0; i < n; ++i) {
d[i] = LINF;
}
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> que;
d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty()) {
pair<int, int> p = que.top(); que.pop();
int v = p.second;
if (d[v] < p.first) continue;
for (int i = 0; i < g[v].size(); ++i) {
edge e = g[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(make_pair(d[e.to], e.to));
}
}
}
}
int main() {
cin >> n;
g.resize(n);
d.resize(n);
for (int i = 0; i < n - 1; ++i) {
int a, b, c; cin >> a >> b >> c;
--a; --b;
g[a].push_back(edge({b, c}));
g[b].push_back(edge({a, c}));
}
int q, k; cin >> q >> k;
--k;
vector<ll> ans(q, 0);
dijkstra(k);
for (int i = 0; i < q; ++i) {
int x, y; cin >> x >> y;
--x; --y;
ll ans = 0;
ans += d[x] + d[y];
cout << ans << endl;
}
}
| 0
| 70,795,457
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
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;
int main(){
int n;
cin >> n;
vector<int> b(n-1);
for (int i = 0; i < n - 1; ++i) {
cin >> b[i];
}
int res = b[0];
for (int i = 1; i < n-1; ++i) {
res += min(b[i], b[i-1]);
}
res += b[n-2];
cout << res << endl;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <numeric>
#include <bitset>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF (LL)1e15
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
string s;
int x, y;
vector<int> compress;
bitset<16001> xbit, ybit;
signed main(){
cin >> s;
cin >> x >> y;
compress.pb(0);
REP(i, s.size()){
if(s[i] == 'T') compress.pb(0);
else compress.back()++;
}
xbit[8000 + compress.front()] = true;
ybit[8000] = true;
FOR(i, 1, compress.size()){
if(i%2 == 0){
xbit = (xbit << compress[i]) | (xbit >> compress[i]);
}else{
ybit = (ybit << compress[i]) | (ybit >> compress[i]);
}
}
if(xbit[8000 + x] && ybit[8000 + y]) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 37,961,949
|
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define INF 9223372036854777ll
#define pb push_back
using namespace std;
void solve(){
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
vector<ll> dp(k+1);
dp[0]=1;
for(int i=0;i<n;i++){
vector<ll> fa(k+1);
for(int j=k;j>=0;j--){
ll tmp=dp[j];
int l=j+1;
int r=j+min(a[i],k-j);
if(l<=r){
fa[l]+=tmp;
if(fa[l]>=mod)
fa[l]-=mod;
if(r+1<=k)
{fa[r+1]-=tmp;if(fa[r+1]<0)fa[r+1]+=mod;}
}
}
ll pre=0;
for(int i=0;i<=k;i++){
pre+=fa[i];
if(pre>=mod)
pre-=mod;
dp[i]+=pre;
if(dp[i]>=mod)
dp[i]-=mod;
}
}
cout<<dp[k];
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tt=1;
while(tt--){
solve();
}
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main(void)
{
int H, W, i, j;
while (1){
scanf("%d %d", &H, &W);
if (H == 0 && W == 0){
break;
}
for (i = 1; i <= H; i++){
for (j = 1; j <= W; j++){
if (i>1 && i < H){
if (j>1 && j < W){
putchar('.');
}
else {
putchar('#');
}
}
if (i == 1 || i == H){
putchar('#');
}
}
putchar('\n');
}
putchar('\n');
}
return 0;
}
| 0
| 56,449,227
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define sz(x) ((int)(x).size())
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g * b; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int INF = INT_MAX / 2;
const ll inf = LLONG_MAX / 2;
const int mod = 1000000007;
const int MAX_N = 101010;
const long double PI = acos(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2 || k < a - 1) {
out(k + 1);
return 0;
}
ll ans = a;
k -= a - 1;
if (k % 2) {
ans++;
k--;
}
ans += (b - a) * (k / 2);
out(ans);
return 0;
}
|
#include <bits/stdc++.h>
typedef long long lint;
using namespace std;
int n;
vector<lint> a;
bool isValid(lint m) {
lint count = 0;
for (int i = 0; i < n; i++) {
lint b = max(0LL, a[i] + m - (n - 1));
count += (b + n) / (n + 1);
}
return count <= m;
}
bool isValid2(lint m) {
lint count = 0;
for (int i = 0; i < n; i++) {
lint b = max(0LL, a[i] + m - (n - 1));
count += (b + n) / (n + 1);
}
return count == m;
}
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
lint ok = LLONG_MAX / 2, no = -1;
while (abs(ok - no) > 1) {
lint mid = (ok + no) / 2;
if (isValid(mid)) {
ok = mid;
} else {
no = mid;
}
}
for (lint i = max(0LL, ok - 1000000); i < ok + 1000000; i++) {
if (isValid2(i)) {
cout << i << endl;
return 0;
}
}
}
| 0
| 6,909,941
|
#include<stdio.h>
int main(){
int n, k;
scanf("%d %d", &n, &k);
printf("%d", n - k + 1);
}
|
#include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N);
for (int n = 0;n<N;++n) {
cin >> A[n];
}
int num = 1;
int ans = 0;
for (int n = 0; n < N; ++n) {
if (num == A[n]) {
num++;
}
else {
ans++;
}
}
if (1 == num) {
cout << -1<<endl;
}
else {
cout << ans <<endl;
}
return 0;
}
| 0
| 65,604,248
|
#include<bits/stdc++.h>
using namespace std;
int a,b;
string s;
char c;
int main(){
cin>>a>>s>>b;
c=s[b-1];
for(int i=0;i<a;i++)if(s[i]==c)cout<<c;
else cout<<'*';
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, y;
cin >> n >> y;
if (n * 10000 < y || n * 1000 > y) {
cout << -1 << ' ' << -1 << ' ' << -1 << '\n';
return 0;
}
int c = y / 1000;
int b = min((c - n) / 4, c / 5);
c -= b * 5;
int a = min(c + b - n, b / 2);
b -= a * 2;
if (a + b + c == n) {
cout << a << ' ' << b << ' ' << c << '\n';
}
else {
cout << -1 << ' ' << -1 << ' ' << -1 << '\n';
}
return 0;
}
| 0
| 51,949,251
|
#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#define ll long long
int main()
{
int K;
std::cin >> K;
std::string S;
std::cin >> S;
int S_size = S.size();
if(S_size <= K) {
std::cout << S << std::endl;
}
else {
std::cout << S.substr(0,K) << "..." << std::endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, M;
cin>>n>>M;
map<int, int> cnt;
int sum = 0;
cnt[sum]++;
for (int i=1; i<=n; i++) {
int x;
cin>>x;
sum = (sum+x)%M;
cnt[sum]++;
}
long long ans = 0;
for (auto pr: cnt) ans += 1LL*pr.second*(pr.second-1)/2;
cout<<ans<<endl;
}
| 0
| 15,331,234
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
if(a<b)return b;
else return a;
}
ll lmin(ll a,ll b){
if(a<b)return a;
else return b;
}
ll gcd(ll a,ll b){
if(a<b)swap(a,b);
if(b==0)return a;
if(a%b==0)return b;
return gcd(b,a%b);
}
ll Pow(ll n,ll k){
ll ret=1;
ll now=n;
while(k>0){
if(k&1)ret*=now;
now*=now;
k/=2;
}
return ret;
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);
int n;cin>>n;
int a[n];
vector<int> v;
rep(i,0,n){
cin>>a[i];
v.push_back(a[i]);
}
sort(v.begin(),v.end());
unordered_map<int,int> mp;
rep(i,0,v.size()){
mp[v[i]]=i+1;
}
rep(i,0,n)a[i]=mp[a[i]];
int ans=0;
for(int i=0;i<n;i+=2){
if(a[i]%2==0)ans++;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
return f.second > s.second;
}
ll gcd(ll a, ll b){
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
ll nCr(ll n, ll r){
if(r == 0 || r == n){
return 1;
} else if(r == 1){
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r){
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--) ret *= i;
return ret;
}
int main(void){
int n, m, k;
cin >> n >> m >> k;
for(int i = 0; i <= n; i++){
for(int j = 0; j <= m; j++){
if(i * j + (n - i) * (m - j) == k){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 24,788,304
|
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
int main(){
int N,Q;
cin >> N >> Q;
dsu D(N);
for(int i=0;i<Q;i++){
int t,u,v;
cin >> t >> u >> v;
if(t==0){
D.merge(u,v);
}
if(t==1){
if(D.same(u,v)) cout << 1 << endl;
else cout << 0 << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define INFTY 10000000000
typedef long long int ll;
const int MOD=1000000007;
using Graph = vector<vector<int>>;
using ipair = pair<ll,ll>;
bool operator< (const ipair a, const ipair b){return a.first < b.first;};
#define rep(i,n) for (int i = 0; i < (n); ++i)
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(){
int n,m;cin>>n>>m;
vector<vector<pair<ll,int>>> p(100005);
string num[100002];
rep(i,m){
int x;ll y;
cin>>x>>y;
p[x].emplace_back(make_pair(y,i+1));
}
for (int i = 1; i <= n; i++)
{
if(p[i].empty())continue;
sort(p[i].begin(),p[i].end());
rep(j,p[i].size()){
string pn,xn;
pn = to_string(i);
xn = to_string(j+1);
int n0f,n0b;
n0f = 6-pn.length();n0b = 6-xn.length();
rep(k,n0f)num[p[i][j].second] += '0';
num[p[i][j].second] += pn;
rep(k,n0b)num[p[i][j].second] += '0';
num[p[i][j].second] += xn;
}
}
for (int i = 1; i <= m; i++){
cout<<num[i]<<endl;
}
return 0;
}
| 0
| 18,595,117
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int answer = 0;
for(int c = 1; c <= N; c+= 2)
{
int numofdivisors = 0;
for (int X = 1; X <= c; ++X)
{
if(c % X == 0)
{
++numofdivisors;
}
}
if (numofdivisors == 8)
{
answer++;
}
}
cout << answer << endl;
}
|
#include <iostream>
#include<array>
using namespace std;
int main() {
int n, k, sum = 0;
cin >> n >> k;
int p[n];
for(int i = 0; i < n; i++) {
cin >> p[i];
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n-1; j++) {
if (p[j] > p[j+1]) {
swap(p[j], p[j+1]);
}
}
}
for(int i = 0; i < k; i++) {
sum += p[i];
}
cout << sum << endl;
}
| 0
| 69,780,826
|
#include<iostream>
using namespace std;
int main(){
int A,B,C,K;
cin >> A >> B >> C >> K;
int sum = A+B+C;
int count=0;
while(A>0 && K>0){
A--;
K--;
count++;
}
while(B>0 && K>0){
B--;
K--;
}
while(K>0){
K--;
count--;
}
cout << count << endl;
}
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> ab(N), cd(M);
ll x, y;
for (int i = 0; i < N; i++) {
cin >> x >> y;
ab[i] = {x, y};
}
for (int i = 0; i < M; i++) {
cin >> x >> y;
cd[i] = {x, y};
}
for (int i = 0; i < N; i++) {
ll min_l = INF;
int index;
for (int j = 0; j < M; j++) {
ll l = abs(ab[i].first - cd[j].first) + abs(ab[i].second - cd[j].second);
if (l < min_l) {
index = j + 1;
min_l = l;
}
}
cout << index << endl;
}
return 0;
}
| 0
| 57,635,806
|
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
using namespace std;
int LPAR, RPAR, LBRACE, RBRACE;
bool isBalance=true;
vector<char> vec;
void init()
{
LPAR=0, RPAR=0, LBRACE=0, RBRACE=0;
isBalance=true;
vec.clear();
}
void check(char word)
{
if(word == '('){ LPAR++; vec.push_back(word); }
if(word == ')')
{
if(vec.empty()){
isBalance=false;
}else{
char tmp = vec.back();
vec.pop_back();
if(tmp != '('){ isBalance=false; }
RPAR++;
}
}
if(word == '['){ LBRACE++; vec.push_back(word); }
if(word == ']')
{
if(vec.empty()){
isBalance=false;
}else{
char tmp = vec.back();
vec.pop_back();
if(tmp != '['){ isBalance=false; }
RBRACE++;
}
}
}
int main() {
string line;
while(true)
{
init();
getline(cin, line);
if(line == "."){ break; }
rep(i,line.size())
{
check(line[i]);
if(RPAR > LPAR){ isBalance=false; }
if(RBRACE > LBRACE){ isBalance=false; }
if(LPAR && line[i] == ')'){ LPAR--; RPAR--;}
if(LBRACE && line[i] == ']'){ LBRACE--; RBRACE--; }
}
if(!LPAR && !RPAR && !LBRACE && !RBRACE)
{
}else{
isBalance = false;
}
if(isBalance){
cout << "yes" << endl;
}else{
cout << "no" << endl;
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
void solve() {
int n,k,a,b,ans = 0;
cin >> n;
cin >> k;
cin >> a;
cin >> b;
ans += (min(n,k))*a + (max(0, n-k))*b;
cout << ans;
}
int32_t main() {
IOS;
solve();
return 0;
}
| 0
| 38,482,858
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
int main() {
int A,B;cin >> A >> B;
if (A%3 == B%3){
if (A%3 == 0){
cout << "Possible" << endl;
}else{
cout << "Impossible" << endl;
}
}else{
cout << "Possible" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long K,A,B;
long long N=1;
cin>>K>>A>>B;
for(long long X=0;X<K;X++){
if(A+2<B){
if(N<A){
N++;
}
else{
if(X+1<K){
N+=B-A;
X++;
}
else{
N++;
}
}
}
else{
N++;
}
}
cout<<N<<endl;
}
| 0
| 57,191,095
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) (int)x.size()
#define eb emplace_back
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("io\\in.txt", "r", stdin);
freopen("io\\out.txt", "w", stdout);
#endif
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ret = 0;
const int mod = 1000000007;
rep(i, 60) {
int cnt0 = 0, cnt1 = 0;
rep(j, n) if (a[j] >> i & 1) cnt1++; else cnt0++;
ret = (ret + (1ll << i) % mod * cnt0 % mod * cnt1) % mod;
}
cout << ret;
return 0;
}
|
#include <iostream>
#include <vector>
#include <numeric>
using i64 = long long;
class UF {
std::vector<int> par, rank;
public:
UF(int size) : par(size), rank(size) {
std::iota(par.begin(), par.end(), 0);
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
bool same(int x, int y) {
return root(x) == root(y);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return;
if (rank[x] < rank[y]) par[x] = y;
else {
par[y] = x;
if (rank[x] == rank[y]) rank[x]++;
}
}
};
int main() {
int n, q;
std::cin >> n >> q;
UF uft(n + 1);
while (q--) {
int t, u, v;
std::cin >> t >> u >> v;
if (t) std::cout << uft.same(u, v) << '\n';
else uft.unite(u, v);
}
return 0;
}
| 0
| 51,211,279
|
#include <bits/stdc++.h>
#define MAX 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define FastInput ios_base::sync_with_stdio(false), cin.tie(NULL);
#define all(x) x.begin(), x.end()
#define read(x) freopen(x, "r", stdin)
#define write(x) freopen(x, "w", stdout)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define REP(i, a, n) for (int i = a; i <= n; i++)
#define inputArray(a,n) rep(i, 0, n) cin >> a[i];
#define copyArray(a,temp,n) rep(i, 0, n) temp[i]=a[i];
#define printArray(a,n) rep(i, 0, n) cout << a[i] << " "; cout << endl;
#define Cases cout << "Case " << ++Case << ": ";
#define __test int tt; int Case=0; cin >> tt; while(tt--)
#define dbgA2(A, n, m) {cout<<"--> "<<#A<<" = \n";rep(i, 0, n){rep(j, 0, n){cout<<A[i][j]<<" ";}cout<<"\n";}cout<<"\n";}
#define dbgA(A, n) {cout<<" --> "<<#A<<" = (";rep(i, 0, n)cout<<A[i]<<" ";cout<<")\n";}
#define dbg(args...) {string sss(#args);sss+=',';cout<<" --> ";debugger::call(all(sss), args);cout<<"\n";}
ll gcd(ll n, ll m) { return m ? gcd(m, n % m) : n; }
ll lcm(ll n, ll m) { return n / gcd(n, m) * m; }
struct debugger {
typedef string::iterator si;
static void call(si it, si ed) {}
template<typename T, typename ... aT>
static void call(si it, si ed, T a, aT... rest) {
string b;
for(; *it!=','; ++it)
if(*it!=' ')
b+=*it;
cout << b << "=" << a << " ";
call(++it, ed, rest...);
}
};
void solve() {
int n, m;
cin >> n >> m;
int res = (((n * (n - 1)) / 2.0) + ((m * (m - 1)) / 2.0));
cout << res << endl;
}
int main() {
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
ll n,d[101]={},z[100]={};
int main(void){
cin>>n;
for(int i=2;i<=n;i++){
ll a=i,j=2;
while(a!=1){
if(a%j!=0){
j++;
}
else{
a/=j;
d[j]++;
}
}
}
for(int i=2;i<=n;i++){
z[d[i]]++;
}
for(int j=n;j>=2;j--){
z[j]+=z[j+1];
}
ll ans=z[4]*(z[4]-1)*(z[2]-2)/2+z[24]*(z[2]-1)+z[14]*(z[4]-1)+z[74];
cout<<ans<<endl;
}
| 0
| 69,811,261
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
using namespace std;
typedef long long int ll;
typedef long double ld;
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;
typedef pair<ll,ll> pairs;
bool pairCompare(const pair<double,ll>& firstElof, const pair<double,ll>& secondElof){
return firstElof.first < secondElof.first;
}
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N]={0};
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll fib(ll a){
if (fibl[a]!=0)return fibl[a];
if (a==0){
return 0;
}else if (a==1){
return 1;
}
return fibl[a]=fib(a-1)+fib(a-2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i=0; i<=n; ++i) x[i] = true;
x[0] = x[1] = false;
for(int i=2; i<=n; ++i) {
if(x[i]) {
p++;
for(int j=2*i; j<=n; j+=i) x[j] = false;
}
num[i] = p;
}
return p;
}
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
ll keta(ll N){
int tmp{};
while( N > 0 ){
tmp += ( N % 10 );
N /= 10;
}
N = tmp;
return N;
}
int main(){
ll n,h,w,ans=0;
cin >> n >> h >> w;
for (ll i=0;i<n;i++){
ll a,b;
cin >> a >> b;
ans+=min(a/h,b/w);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
#include <sstream>
#include <iomanip>
using lint = long long;
int main()
{
lint n, m;
scanf("%lld", &n);
scanf("%lld", &m);
std::vector<std::vector<std::pair<lint, lint>>> cities(n);
for (int i = 0; i < m; ++i)
{
lint p, y;
scanf("%lld", &p);
scanf("%lld", &y);
cities[p - 1].push_back(std::make_pair(y, i));
}
std::vector<std::string> ans(m);
for (int i = 0; i < n; ++i)
{
std::sort(cities[i].begin(), cities[i].end());
std::stringstream p_ss;
p_ss << std::setw(6) << std::setfill('0') << i + 1;
lint count = 1;
for (auto city = cities[i].begin(); city != cities[i].end(); city++)
{
std::stringstream c_ss;
c_ss << std::setw(6) << std::setfill('0') << count;
ans[city->second] = p_ss.str() + c_ss.str();
count++;
}
}
for (auto cityid : ans)
{
std::cout << cityid << "\n";
}
return 0;
}
| 0
| 91,995,110
|
#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 x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
int x = x2;
int y = y2;
int dx = x2 - x1;
int dy = y2 - y1;
for(int i = 0; i < 2;i++){
swap(dx,dy);
dx = -dx;
x += dx;
y += dy;
cout << x << " " << y << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
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;}
template<class T> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
struct UnionFind {
vector<int> par;
vector <ll> siz;
UnionFind(int N) : par(N),siz(N) {
for(int i = 0; i < N; i++){
par[i] = i;
siz[i] = 1;
}
}
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;
if (siz[rx] < siz[ry]) swap(rx, ry);
siz[rx] += siz[ry];
par[ry] = rx;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
ll size(ll x){
return siz[root(x)];
}
};
signed main()
{
gearup;
ll k; cin >> k;
ll mod_50 = k % 50;
int n = 50;
vl a;
rep(i,50-mod_50)a.push_back(49-mod_50);
rep(i,mod_50)a.push_back(50);
rep(i,50)a[i] += k / 50;
out(n);
rep(i,n)out(a[i]);
}
| 0
| 87,364,883
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define nrep(i,n) for(int i=1;i<=(n);i++)
#define FST first
#define SEC second
using namespace std;
typedef pair <int,int> pxy;
#define WMAX 20
#define HMAX 20
int dd[5]={0,1,0,-1,0};
int W,H;
void print(char map[HMAX][WMAX]){
putchar('\n');
rep(i,H){
rep(j,W){
cout << map[i][j];
}
putchar('\n');
}
}
int dfs(char map[HMAX][WMAX]){
stack <pxy> s;
int n=0;
rep(i,H){
if(n) break;
rep(j,W){
if(map[i][j]=='@'){
s.push(pxy(j,i));
n=1;
break;
}
}
}
while(!s.empty()){
int cx=s.top().FST, cy=s.top().SEC;
s.pop();
if(map[cy][cx]=='.')
n++;
map[cy][cx]='#';
rep(r,4){
int nx=cx+dd[r], ny=cy+dd[r+1];
if(nx<0||W<=nx||ny<0||H<=ny||map[ny][nx]=='#')
continue;
s.push(pxy(nx,ny));
}
}
return n;
}
int main(){
for(;;){
scanf("%d %d",&W,&H);
if(!(W+H)) break;
char map[HMAX][WMAX];
rep(i,H){
string s;
cin >> s;
strcpy(map[i],s.c_str());
}
printf("%d\n",dfs(map));
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int Y,M,D,S;
cin>>Y>>M>>D;
if(Y%3==0){
if(M%2==0){
Y=Y/3-1;
M=M/2-1;
S=196471-Y*590-390-M*40-20-D;
cout<<S<<endl;
}
else{
Y=Y/3-1;
M=M/2;
S=196471-Y*590-390-M*40-D;
cout<<S<<endl;
}
}
else if(Y%3==1){
if(M%2==0){
Y=Y/3;
M=M/2-1;
S=196471-Y*590-M*39-20-D;
cout<<S<<endl;
}
else{
Y=Y/3;
M=M/2;
S=196471-Y*590-M*39-D;
cout<<S<<endl;
}
}
else if(Y%3==2){
if(M%2==0){
Y=Y/3;
M=M/2-1;
S=196471-Y*590-195-M*39-20-D;
cout<<S<<endl;
}
else{
Y=Y/3;
M=M/2;
S=196471-Y*590-195-M*39-D;
cout<<S<<endl;
}
}
}
}
| 0
| 98,050,748
|
#include <bits/stdc++.h>
using namespace std;
bool StringToInt(string s, int &data)
{
data=0;
int sign=1;
for(int i=0;i<s.length();i++){
if(i==0 && s[i]=='-'){
sign=-1;
continue;
}
if('0'<=s[i] && s[i]<='9'){
data*=10;
data+=sign*(s[i]-'0');
}
else return false;
}
return true;
}
int main()
{
string s;
cin >> s;
int ans=1e9;
for(int i=0;i<s.length()-2;i++){
int x;
StringToInt(s.substr(i,3),x);
ans=min(ans,abs(x-753));
}
cout << ans << endl;
}
|
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef unsigned long long llong;
#define MAX 4000
const llong mod = 1000000000 + 7;
int main()
{
int N;
char S[MAX];
llong Rlen = 0, Glen = 0, Blen = 0;
llong ans = 0;
scanf("%d", &N);
scanf("%s", S);
for (int i = 0; i < N; i++)
{
switch (S[i])
{
case 'R':
Rlen++;
break;
case 'G':
Glen++;
break;
case 'B':
Blen++;
break;
}
}
ans = Rlen * Glen * Blen;
for (int i = 0; i < N; i++)
{
for (int j = i; j < N; j++)
{
int k = j + j - i;
if (k < N && S[i] != S[j] && S[j] != S[k] && S[k] != S[i])
ans--;
}
}
printf("%llu\n", ans);
return 0;
}
| 0
| 17,753,366
|
#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 ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100005
void solve(){
char c;
cin>>c;
cout<<(char)(c+1)<<endl;
}
signed main(){
io;
int tests;
tests = 1;
while(tests--){
solve();
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
ll sumA = 0, sumB = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
sumA += a[i];
}
for(int i = 0; i < n; i++) {
cin >> b[i];
sumB += b[i];
}
ll c = sumB - sumA;
for(int i = 0; i < n; i++) {
if(a[i] < b[i]) {
c -= (b[i] - a[i] + 1) / 2;
} else if(a[i] == b[i]) {
continue;
} else {
}
}
if(c >= 0) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
}
| 0
| 39,576,828
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
char A;
for(n=0;n<4;n++){
A=getchar();
cout << A;
}
cout << " ";
for(n=0;n<8;n++){
A=getchar();
cout << A;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int main() {
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
int ans=a.at(0);
for(int i=1;i<n;i++){
ans=gcd(ans,a[i]);
}
cout << ans << endl;
}
| 0
| 73,459,779
|
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
class Solution {
public:
int solve(vector<int>& A, vector<int>& B) {
const long long MOD = 1e9 + 7;
int n = A.size();
int m = B.size();
vector<vector<long long>> dp(n + 1, vector<long long>(m + 1, 0));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (A[i] == B[j]) {
(dp[i + 1][j + 1] += (dp[i][j] + 1)) %= MOD;
}
(dp[i + 1][j + 1] += dp[i + 1][j] + dp[i][j + 1] + MOD - dp[i][j]) %= MOD;
}
}
long long res = dp[n][m];
res += 1;
res %= MOD;
return res;
}
};
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> A(n);
vector<int> B(m);
for (int i = 0; i < n; ++i) {
cin >> A[i];
}
for (int i = 0; i < m; ++i) {
cin >> B[i];
}
Solution sol;
cout << sol.solve(A, B) << "\n";
return 0;
}
|
const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int> > G;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Yes[2] = {"No", "Yes"};
string YES[2] = {"NO", "YES"};
ll inq(ll x, ll y)
{
if (!y) re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2) re l * l % MOD * x % MOD;
re l * l % MOD;
}
ll rev(ll x)
{
return inq(x, MOD - 2);
}
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics()
{
__precomputed_combinatorics = 1;
__fact.resize(FN);
__ufact.resize(FN);
__rev.resize(FN);
__rev[1] = 1;
for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x)
{
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k)
{
if (k < 0 || k > n) return 0;
if (!__precomputed_combinatorics) __precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root)
{
if (x == root[x]) return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz)
{
v = Root(v, root), u = Root(u, root);
if (v == u) return;
if (sz[v] < sz[u])
{
sz[u] += sz[v];
root[v] = u;
}
else
{
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n)
{
return 0 <= x && x < n;
}
void bfs(int v, vi &dist, vector<vi> &graph)
{
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++)
{
for (auto u : graph[q[i]])
{
if (dist[u] == -1)
{
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
int r, s, p;
string t;
cin >> n >> k >> r >> s >> p >> t;
ll ans = 0;
forn(i, k)
{
string g = "";
for (int j = i; j < t.size(); j += k) g += t[j];
vector<vector<int> > dp(g.size(), vector<int>(3, 0));
if (g[0] == 'r') dp[0][2] = p;
if (g[0] == 's') dp[0][0] = r;
if (g[0] == 'p') dp[0][1] = s;
for (int j = 1; j < g.size(); j++)
{
for (int h = 0; h < 3; h++)
{
for (int l = 0; l < 3; l++)
{
if (h == l) continue;
int val = dp[j - 1][l];
if (h == 0 && g[j] == 's') val += r;
if (h == 1 && g[j] == 'p') val += s;
if (h == 2 && g[j] == 'r') val += p;
dp[j][h] = max(dp[j][h], val);
}
}
}
ans += max(max(dp[g.size() - 1][0], dp[g.size() - 1][1]), dp[g.size() - 1][2]);
}
cout << ans;
}
| 0
| 62,657,253
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.