code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 32
101M
|
|---|---|---|---|
#include "bits/stdc++.h"
#define REP(i, n) for(int i = 0; i < int(n); i++)
#define FOR(i,n,m) for(int i = int(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 6;
const ll LLINF = 1e18 + 1;
int main() {
int w, h; cin >> w >> h;
vector<pair<int,int>> pq(w + h);
REP(i, w) {
cin >> pq[i].first;
pq[i].second = 0;
}
REP(i, h) {
cin >> pq[i+w].first;
pq[i + w].second = 1;
}
ll ans = 0;
sort(pq.begin(), pq.end());
ll rest_w = w + 1, rest_h = h + 1;
REP(i, w + h) {
if (pq[i].second == 0) {
ans += rest_h * pq[i].first;
rest_w--;
}
else {
ans += rest_w * pq[i].first;
rest_h--;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
int l[h][w];
rep(i,h) {
rep(j,w) {
if(s[i][j]=='#') l[i][j] = 0;
else if(j==0) l[i][0] = 1;
else l[i][j] = l[i][j-1]+1;
}
}
int r[h][w];
rep(i,h) {
for(int j = w-1; j >= 0; j--) {
if(s[i][j]=='#') r[i][j] = 0;
else if(j==w-1) r[i][j] = 1;
else r[i][j] = r[i][j+1]+1;
}
}
int u[h][w];
rep(j,w) {
rep(i,h) {
if(s[i][j]=='#') u[i][j] = 0;
else if(i==0) u[0][j] = 1;
else u[i][j] = u[i-1][j]+1;
}
}
int d[h][w];
rep(j,w) {
for(int i = h-1; i >= 0; i--) {
if(s[i][j]=='#') d[i][j] = 0;
else if(i==h-1) d[i][j] = 1;
else d[i][j] = d[i+1][j] + 1;
}
}
int ans = 0;
rep(i,h) {
rep(j,w) {
if(s[i][j]=='#') continue;
ans = max(ans,l[i][j]+r[i][j]+u[i][j]+d[i][j]-3);
}
}
cout << ans << endl;
return 0;
}
| 0
| 68,492,976
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int h, w, k;
long long int cnt = 0;
cin >> h >> w >> k;
vector <string> grid(h);
for (auto &i : grid) cin >> i;
for (int i = 0; i < (1 << w); ++i){
for (int j = 0; j < (1 << h); ++j){
long long int black = 0;
for (int row = 0; row < h; ++row){
if ( ((1 << row) & j ) != 0){
for (int col = 0; col < w; ++col){
if ( ((1 << col) & i) != 0){
if (grid[row][col] == '#') ++black;
}
}
}
}
if (black == k) ++cnt;
}
}
cout << cnt << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<vector<string>> a(n);
while (m--) {
int x;
cin >> x; x--;
string s;
cin >> s;
a[x].push_back(s);
}
int wa = 0;
int ac = 0;
for (auto x : a) {
bool counts = false;
int wrong = 0;
for (int i = 0; i < (int)x.size(); i++) {
if (x[i] == "WA") wrong++;
else {
counts = true;
ac++;
break;
}
}
if (counts) wa += wrong;
}
cout << ac << " " << wa << endl;
return 0;
}
| 0
| 11,010,487
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> A(n);
for(int i=0; i<n; ++i) cin>>A[i];
long long current=1000;
for(int i=1; i<n; ++i){
long long stocks=0;
if(A[i-1]<A[i]) stocks = current/A[i-1];
current += (A[i]-A[i-1])*stocks;
}
cout<<current<<"\n";
}
|
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return b; }
return a;
}
ll gcd(ll a, ll b) {
if (b == 0) { return a; }
if (a < b) { return gcd(b, a); }
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
struct edge {
ll ind;
ll fr;
ll to;
ll d;
};
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1,0);
repn(i, N) cin >> A[i];
ll ans = 0;
repn(i, N) {
ans += (A[i - 1] + A[i]) / 2;
if (A[i] > 0) { A[i] = (A[i - 1] + A[i]) % 2; }
}
cout << ans;
system("PAUSE");
}
| 0
| 62,480,026
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
string s;
cin >> s;
int n=s.size();
int right=n-1;
ll ans=0;
for(int i=n-1;i>=0;i--){
if(s[i]=='B'){
ans+=right-i;
right--;
}
}
cout << ans << endl;
return 0;
}
|
#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;
}
vector<vector<ll>> g;
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n, m;
cin >> n >> m;
g.resize(n);
vector<ll> ans(n);
rep(i, m){
ll a,b;
cin >> a >> b;
--a, --b;
g[a].pb(b);
g[b].pb(a);
}
queue<ll> q;
q.push(0);
ans[0] = -1;
while(!q.empty()){
ll now = q.front();
q.pop();
for(auto next : g[now]){
if(ans[next]) continue;
ans[next] = now + 1;
q.push(next);
}
}
print("Yes");
REP(i, 1, n) print(ans[i]);
}
| 0
| 69,238,123
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << A[2] - A[0] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define itn long long
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define rrep(i,n) for(int i=(int)(n);i>=0;--i)
#define debug(x) cout << #x << "=" << (x) << endl;
const ll MOD=1e9+7;
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<typename T> void fail(T v){cout << v << endl;exit(0);}
void solve(){
while(1){
int N;
cin>>N;if(!N)break;
int l=0,r=0,b=1,res=0;
rep(i,N){
string s;
cin>>s;
if(s[0]=='l')l^=1;
else r^=1;
if(l==b&&r==b){res++;b^=1;}
}
cout<<res<<endl;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
solve();
return 0;
}
| 0
| 7,467,823
|
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int N;cin>>N;
int ko = 0;
for(int i = 1;i<=N;i++){
for(int j = 1;j<=N;j++){
if(i*j <N){
ko++;
}
else{
break;
}
}
}
cout<<ko;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, C, K;
int T[1000010];
int main()
{
cin >> N >> C >> K;
for (int i = 0; i < N; i++)
{
scanf("%d", &T[i]);
}
sort(T, T + N);
int cnt = 0;
for (int i = 0; i < N;)
{
int j = 0;
while (i + j < N && T[i+j] - T[i] <= K && j < C)
{
j++;
}
i += j;
cnt++;
}
cout << cnt << endl;
return 0;
}
| 0
| 41,695,971
|
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
signed main()
{
vector<int> a(9);
rep(i, 9) cin >> a[i];
int n;
cin >> n;
vector<int> b(n);
rep(i, n) cin >> b[i];
bool c[9];
rep(i, 9) c[i] = false;
rep(i, n) {
rep(j, 9) {
if (a[j] == b[i]) {
c[j] = true;
}
}
}
rep(j, 3) {
if (c[3 * j + 0] && c[3 * j + 1] && c[3 * j + 2]) {
put("Yes")
return 0;
}
if (c[0 + j] && c[3 + j] && c[6 + j]) {
put("Yes")
return 0;
}
}
if (c[0] && c[4] && c[8]) {
put("Yes");
return 0;
}
if (c[2] && c[4] && c[6]) {
put("Yes");
return 0;
}
put("No");
return 0;
}
|
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int n,i,j,ans=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++){
for(j=i+1;j<n;j++)
ans+=a[i]*a[j];
}
cout<<ans;
}
int main()
{
cool;
int t;
t=1;
while(t--){
solve();
}
return 0;
}
| 0
| 26,336,065
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
static const double pi = 3.141592653589793;
struct UnionFind {
vector<ll> par;
vector<ll> rank;
UnionFind(ll N) : par(N), rank(N, 1LL) {
for(ll i = 0; i < N; i++) par[i] = i;
}
void init(ll N){
par.resize(N);
rank.assign(N, 1LL);
for(ll i = 0; i < N; i++) par[i] = i;
}
ll root(ll x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
if (rx == ry) return;
if (rank[rx] < rank[ry]){
par[rx]=ry;
}else{
par[ry]=rx;
if(rank[rx]==rank[ry])rank[rx]++;
}
}
bool same(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
};
int main(){
ll N, M;
cin>>N>>M;
vector<ll> P(N);
rep(i, N){
cin>>P[i];
P[i]--;
}
vector<ll> X(M), Y(M);
rep(i, M){
cin>>X[i]>>Y[i];
X[i]--; Y[i]--;
}
UnionFind uf(N);
rep(i, M){
uf.unite(X[i], Y[i]);
}
ll Ans=0;
rep(i, N){
if(uf.same(i, P[i]))Ans++;
}
cout<<Ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int main(){
int n;
string s;
cin >> n >> s;
vector<int> s_inverse(2*n);
for(int i=0; i<2*n; i++){
if(s[i] == 'B') s_inverse[i] += 1;
if(i % 2 == 0) s_inverse[i] += 1;
s_inverse[i] %= 2;
}
long long int ans = 1;
long long int left = 0;
for(int i=0; i<2*n; i++){
if(s_inverse[i] == 0) left += 1;
if(s_inverse[i] == 1){
ans *= left;
ans %= MOD;
left -= 1;
if(left < 0){
cout << 0 << endl;
return 0;
}
}
}
if(left != 0){
cout << 0 << endl;
return 0;
}
for(int i=n; i>=1; i--){
ans *= i;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| 0
| 81,703,372
|
#include <iostream>
using namespace std;
int main()
{
int a,b,c,d = 0;
cin >> a >> b >> c;
if(a < b && b < c){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
|
#include <iostream>
#include <cstring>
#include <algorithm>
#include <functional>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <stdlib.h>
#include <deque>
#include <cstdint>
using namespace std;
int main () {
long long int a, b, m;
cin >> a >> b >> m;
long long int sum = 0;
long long int a_cost[a];
long long int b_cost[b];
int min_a = 100000;
int min_b = 100000;
for (int i = 0; i < a; i++){
int tmp;
cin >> tmp;
a_cost[i] = tmp;
if (tmp < min_a){
min_a = tmp;
}
}
for(int i = 0; i < b; i++){
int tmp;
cin >> tmp;
b_cost[i] = tmp;
if (tmp < min_b){
min_b = tmp;
}
}
sum = min_a + min_b;
for (int i = 0; i < m; i++){
int x, y, c;
cin >> x >> y >> c;
if (a_cost[x-1] + b_cost[y-1] - c < sum){
sum = a_cost[x-1] + b_cost[y-1] - c;
}
}
cout << sum;
return 0;
}
| 0
| 91,494,805
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
bool ok = false;
rep(i, B+1) {
if(A*i % B == C) ok = true;
}
cout << (ok ? "YES" : "NO") << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long acc_a[n + 1], acc_b[n + 1];
acc_a[0] = acc_b[0] = 0;
for (int i = 1; i <= n; i++) {
acc_a[i] = acc_a[i - 1] + a[i - 1];
acc_b[i] = acc_b[i - 1] + max(0l, a[i - 1]);
}
long ans = 0;
for (int i = k; i <= n; i++) {
ans = max(ans, acc_b[n] - acc_b[i] + max(0l, acc_a[i] - acc_a[i - k]) + acc_b[i - k] - acc_b[0]);
}
cout << ans << endl;
return 0;
}
| 0
| 67,292,102
|
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
string s; cin >> s;
ll len = s.size();
ll cnt = 0,bl = 0;
for (int i = 0; i < len; i++) {
if (s[i] == 'B')bl++;
if (s[i] == 'W')cnt += bl;
}
cout << cnt << endl;
}
|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
const int INF = INT_MAX / 2;
int main(void) {
int N;
cin >> N;
int ans = 0;
int min_diff = INF;
vector<int> vs = {111, 222, 333, 444, 555, 666, 777, 888, 999};
for (auto v : vs) {
if (v - N >= 0 && v - N < min_diff) {
ans = v;
min_diff = v - N;
}
}
cout << ans << endl;
return 0;
}
| 0
| 10,575,426
|
#include <bits/stdc++.h>
#define bp(x) __builtin_popcountll(x)
#define ll int64_t
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define fw(i, l, r, c) for(int i = l; i <= r; i += c)
#define bw(i, r, l, c) for(int i = r; i >= l; i -= c)
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<ll> vi;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
ll n, k;
ll a[1001];
vi sum;
signed main() {
cin >> n >> k;
fw(i, 0, n - 1, 1){
cin >> a[i];
}
fw(i, 0, n - 1, 1){
ll summ = 0;
fw(j, i, n - 1, 1){
summ += a[j];
sum.pb(summ);
}
}
sum.pb(a[n - 1]);
ll res = 0;
vi num;
bw(i, 50, 0, 1){
fw(j, 0, sum.size() - 1, 1){
ll check = (sum[j] >> i) & 1;
if(check){
num.pb(sum[j]);
}
}
if(num.size() >= k){
sum.clear();
fw(j, 0, num.size() - 1, 1){
sum.pb(num[j]);
}
}
num.clear();
}
ll ans = LLONG_MAX;
for(int i = 0; i < sum.size(); i++) {
ans &= sum[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF 2e9
#define INF_LL 1LL<<60
#define ll long long
#define Ceil(x, n) (((((x))+((n)-1))/n))
#define CeilN(x, n) (((((x))+((n)-1))/n)*n)
#define FloorN(x, n) ((x)-(x)%(n))
#define ALL(x) (x).begin(),(x).end()
typedef pair<ll, ll> P;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
ll suma = 0, sumb = 0;
REP(i, n) {
cin >> a[i];
suma += a[i];
}
REP(i, n) {
cin >> b[i];
sumb += b[i];
}
if(suma < sumb) {
cout << "-1" << endl;
return 0;
}
vector<ll> sa(n);
REP(i, n) sa[i] = a[i] - b[i];
sort(ALL(sa));
int ans = 0;
ll herasu = 0;
REP(i, n) {
if(sa[i] < 0) {
ans++;
herasu += sa[i];
}
}
REP_REV(i, n) {
if(herasu >= 0) break;
ans++;
herasu += sa[i];
}
cout << ans << endl;
return 0;
}
| 0
| 40,877,294
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define rt0 return 0;
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(){
int n, m, x;
cin >> n >> m >> x;
vvi a(n, vi(m));
vi c(n);
rep(i, n){
cin >> c[i];
rep(j, m) cin >> a[i][j];
}
int ans = 12345678;
int all = 1<<n;
rep(mask, all){
vi level(m);
int cost = 0;
rep(i, n){
if((mask>>i)&1){
cost += c[i];
rep(j, m){
level[j] += a[i][j];
}
}
}
bool ok = true;
rep(j, m){
if(level[j] < x) ok = false;
}
if(ok) ans = min(ans, cost);
}
if(ans == 12345678) mes(-1);
else mes(ans);
}
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main()
{
ll N, T;
cin >> N >> T;
vll t(N);
rep(i, 0, N) cin >> t[i];
if (N == 1) {
cout << T << endl;
return 0;
}
ll sm = T * N;
vll diff(N - 1);
rep(i, 0, N-1) {
diff[i] = t[i+1] - t[i];
}
ll tmp = 0;
rep(i, 0, N-1) {
if (diff[i] < T) {
tmp += T - diff[i];
}
}
cout << sm - tmp << endl;
}
| 0
| 52,990,950
|
#include<bits/stdc++.h>
#include <math.h>
#include <map>
#include <unordered_map>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define pb(s) push_back(s)
#define ci(x) cin >>x
#define co(x) cout<<x<<endl
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9;
const ll INF=4e18;
const ll dy[4]={1,0,-1,0};
const ll dx[4]={0,-1,0,1};
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
long long fac(ll a) {
long long ans=1;
while(a>1){
ans*=a;
ans%=1000000007;
a--;
}
return ans;
}
int main() {
ll N;
ll A;
ll B;
cin >>N>>A>>B;
ll x=B-A;
if(x%2==0) {
cout<<"Alice"<<endl;
}
else {
cout<<"Borys"<<endl;
}
}
|
#include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include<set>
#include<queue>
#include <iomanip>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
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 = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h,n, w,m,t; string s;
ll R, C;
ll sy, sx, gy, gx;
char maze[110][110];
ll dis[20][20];
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
ll gcd(ll x, ll y) {
if (x % y == 0) return y;
return gcd(y, x % y);
}
ll lcm(ll a,ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector <ll> >& v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j])%ma;
}
}
}
ll GetDigit(ll num) {
return log10(num) + 1;
}
ll Combination(int n, int r)
{
if (n - r < r) r = n - r;
if (r == 0) return 1;
if (r == 1) return n;
vector<ll> numerator(r);
vector<ll> denominator(r);
for (int k = 0; k < r; k++)
{
numerator[k] = n - r + k + 1;
denominator[k] = k + 1;
}
for (int p = 2; p <= r; p++)
{
int pivot = denominator[p - 1];
if (pivot > 1)
{
int offset = (n - r) % p;
for (int k = p - 1; k < r; k += p)
{
numerator[k - offset] /= pivot;
denominator[k] /= pivot;
}
}
}
ll result = 1;
for (int k = 0; k < r; k++)
{
if (numerator[k] > 1) result *= numerator[k];
result %= ma;
}
return result;
}
ll bfs() {
queue<P> que;
for (int i = 0; i < R; i++) {
for (int j = 0; j < C; j++) dis[i][j] = INF;
}
que.push(P(sy - 1, sx - 1));
dis[sy - 1][sx - 1] = 0;
while (que.size() > 0) {
P p = que.front();
que.pop();
if (p.first == gy - 1 && p.second == gx - 1) break;
for (ll i = 0; i < 4; i++) {
ll ny = p.first + dy[i];
ll nx = p.second + dx[i];
if (0 <= ny && ny < R && 0 <= nx && nx < C && maze[ny][nx] == '.' && dis[ny][nx] == INF) {
que.push(P(ny, nx));
dis[ny][nx] = dis[p.first][p.second] + 1;
}
}
}
return dis[gy - 1][gx - 1];
}
int main() {
cin >> h >> w;
ll a, b;
cin >> a >> b;
vector<ll> str(w);
rep(i, h) {
rep(j, w) {
if ((j < a && i < b) || (j >= a && i >= b)) {
cout << 0;
}
else {
cout << 1;
}
if (j == w - 1) {
cout << endl;
}
}
}
}
| 0
| 26,991,923
|
#include<iostream>
using namespace std;
int main()
{
int i, ans = 0, X[101] = {0}, a[3];
cin >> a[0] >> a[1] >> a[2];
X[a[0]]++;
X[a[1]]++;
X[a[2]]++;
for(i=0;i<101;i++)
{
if(X[i]!=0)
ans++;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using tpl = tuple<char, int>;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
ll N, A, B;
int main(){
cin >> N >> A >> B;
if(A + B - 1 > N){
cout << -1 << endl;
return 0;
}
deque<ll> dq;
for(ll i = 0; i < A; i++)
dq.push_back(i * B + B - 1);
for(ll i = 0; i < B - 1; i++)
dq.push_back(A * B - 2 - i);
vector<ll> seq;
for(ll i = 0; i < A; i++){
for(ll j = B - 1; j >= 0; j--){
ll left = N - (ll)seq.size();
if(left == (ll)dq.size()){
for(ll d : dq){
seq.push_back(d);
}
break;
}
else{
const ll a = i * B + j;
seq.push_back(a);
if(a == dq[0]){
dq.pop_front();
}
}
if((ll)seq.size() == N) break;
}
if((ll)seq.size() == N) break;
}
if((int)seq.size() < N) {
cout<< -1 << endl;
return 0;
}
vector<pll> v;
for(ll i = 0; i < (ll)seq.size(); i++){
v.push_back(make_pair(seq[i], i));
}
sort(v.begin(), v.end());
vector<ll> anss(N);
for(ll i = 0; i < (ll)v.size(); i++){
anss[v[i].second] = i + 1;
}
for(ll a : anss){
cout << a << " ";
}
cout << endl;
return 0;
}
| 0
| 71,239,982
|
#include <iostream>
#include <climits>
using namespace std;
int main(){
int n;
int res[20];
int numres = 0;
while(1){
cin >> n;
if(n==0){
break;
}
int max = INT_MIN;
int min = INT_MAX;
int total = 0;
int read;
for(int i=0; i<n; i++){
cin >> read;
total += read;
if(read < min){
min = read;
}
if(read > max){
max = read;
}
}
res[numres] = (total - max - min)/(n-2);
numres++;
}
for(int i=0; i< numres; i++){
cout << res[i] << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n) for(ll i=n;i>=0;i--)
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout<<(x)<<endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll,vector<ll>,greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define mp make_pair
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define sz(x) (ll)(x).size()
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) { a = b; return true; } return false;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) { a = b; return true; } return false;
}
ll dx[4]={0,1,0,-1};
ll dy[4]={1,0,-1,0};
int main(){
ll n,k;
cin>>n>>k;
ll s=n-k;
if(k==1){
COUT(0);
return 0;
}
COUT(s);
}
| 0
| 21,570,897
|
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
int c, d;
if (a%2 == 0) {
c = a/2 * 25;
d = c+12;
} else {
d = (a+1)/2 * 25;
c = d-12;
d--;
}
int e = b * 10;
int f = (b+1)*10;
bool found = false;
for (int i = c; i <= d; i++) {
if (i >= e && i < f) {
cout << i << endl;
found = true;
break;
}
}
if (!found)
cout << -1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define fro(i, s, e) for (auto i = s; i <= e; ++i)
#define int long long
#define ld long double
#define fr(i, n) for (auto i = 0; i < n; i++)
#define ff first
#define pf pop_front()
#define ss second
#define mp make_pair
#define vi std::vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define setbits(x) __builtin_popcountll(x)
#define zrbits(x) __builtin_ctzll(x)
#define vii std::vector<int, int>
#define tc \
int t; \
cin >> t; \
while (t--)
#define FILE \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define inp(a) \
int a; \
cin >> a;
#define ps(x, y) fixed << setprecision(y) << x
#define mkarr(arr, n, type) type *arr = new type[n];
#define endl "\n"
#define rev(i, e, s) for (auto i = e; i >= s; --i)
const int mod = 1000000007;
#define min_pq priority_queue<int, std::vector<int>, greater<int>>
#define printclock cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\n";
using namespace std;
const int N = 100005;
const int inf = 1000000000000000000;
#define fit(s, x) memset(s, x, sizeof(s));
#define out(x) cout << x << "\n"
#define deb(x) cout << #x << x << "\n"
#define pi 3.14159265358979323846264338327950
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
PBDS;
int power(int a, int b)
{
long long ans = 1;
while (b > 0)
{
if (b & 1LL)
{
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b = (b >> 1LL);
}
return ans;
}
int a[2 * N];
ld p[3005];
int n, k;
string s, t;
int dp[105][100005];
vector<int> graph[N];
int st[4 * N], st2[4 * N];
pii dir[] = {{1, 0}, {0, 1}};
int solve(vector<int> &a, int n, int k)
{
for (int x = 0; x <= k; x++)
{
dp[1][x] = (x > a[1] ? 0 : 1);
}
for (int i = 2; i <= n; i++)
{
for (int j = 0; j <= k; j++)
{
if (j == 0)
dp[i][j] = dp[i - 1][j];
else
dp[i][j] = (mod+dp[i][j - 1] + dp[i - 1][j] - (j - a[i] - 1 >= 0 ? dp[i - 1][j - a[i] - 1] : 0))%mod;
}
}
return dp[n][k];
}
int32_t main()
{
fio;
cin >> n >> k;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++)
{
cin >> v[i];
}
out(solve(v, n, k));
printclock;
return 0;
}
| 0
| 26,559,039
|
using namespace std;
#include <bits/stdc++.h>
int main()
{
int a,b,x;
cin>>a>>b>>x;
if(a<=x){
if(a+b>=x){
std::cout << "YES" << std::endl;
}
else{
std::cout << "NO" << std::endl;
}
}
else{
std::cout << "NO" << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N == 105){
cout << 1 << endl;
}
else if(N < 105){
cout << 0 << endl;
}
else{
int count = 0;
int total = 0;
for(int j = 1; j <= N; j++){
for(int i = 1; i <= N; i++){
if(j % i == 0){
count++;
}
}
if(count == 8){
total++;
}
count = 0;
j++;
}
cout << total << endl;
}
}
| 0
| 65,044,953
|
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
rep(i, X) cin >> A[i];
rep(i, Y) cin >> B[i];
rep(i, Z) cin >> C[i];
vector<ll> AB;
rep(i, X) rep(j, Y) AB.push_back(A[i] + B[j]);
sort(AB.rbegin(), AB.rend());
vector<ll> ABC;
rep(i, min(K, (int)AB.size())) rep(j, Z) ABC.push_back(AB[i] + C[j]);
sort(ABC.rbegin(), ABC.rend());
rep(i, K) cout << ABC[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define ALL(c) (c).begin(), (c).end()
const int MAX_N = 1e5;
const int MOD = 1e9 + 7;
class gf {
public:
int n;
gf() : n(0) {}
gf(int n) : n(n % MOD) {}
gf operator+(gf x) { return gf((n + x.n) % MOD); }
gf operator-(gf x) { return gf((n - x.n + MOD) % MOD); }
gf operator*(gf x) { return gf((1LL * n * x.n) % MOD); }
gf& operator+=(gf x) { return *this = (*this + x); }
gf& operator-=(gf x) { return *this = (*this - x); }
gf& operator*=(gf x) { return *this = (*this * x); }
};
int N;
string S;
int cnt[2 * MAX_N];
ll solve() {
if (S[0] == 'W' || S[2 * N - 1] == 'W') {
return 0;
}
cnt[0] = 1;
for (int i = 1; i < 2 * N; i++) {
cnt[i] = (S[i - 1] == S[i]) ? (1 - cnt[i - 1]) : cnt[i - 1];
}
for (int i = 1; i < 2 * N; i++) {
cnt[i] += cnt[i - 1];
}
if (cnt[2 * N - 1] != N) {
return 0;
}
gf ans = 1;
for (int i = 1; i < 2 * N; i++) {
if (cnt[i - 1] == cnt[i]) {
int p = 2 * cnt[i - 1] - i;
if (p <= 0) {
return 0;
}
ans *= p;
}
}
for (int i = 1; i <= N; i++) {
ans *= i;
}
return ans.n;
}
int main() {
cin >> N;
cin >> S;
cout << solve() << endl;
return 0;
}
| 0
| 191,667
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int cnt[3],k;
cin >> cnt[0] >> cnt[1] >> cnt[2] >> k;
vector<vector<ll>> cake(3);
priority_queue<pair<ll,tuple<int,int,int>>> que;
map<tuple<int,int,int>,bool> mp;
for(int i = 0; i < 3; i++){
for(ll j = 0; j < cnt[i]; j++){
ll a; cin >> a;
cake[i].push_back(a);
}
}
for(int i = 0; i < 3; i++) sort(cake[i].begin(),cake[i].end(),greater<ll>());
que.push({cake[0][0]+cake[1][0]+cake[2][0],make_tuple(0,0,0)});
mp[make_tuple(0,0,0)] = true;
for(int i = 0; i < k; i++){
tuple<int,int,int> now = que.top().second;
ll sum = que.top().first;
que.pop();
vector<int> num(3);
num[0] = get<0>(now);
num[1] = get<1>(now);
num[2] = get<2>(now);
if(num[0] < cnt[0]-1 && !mp[make_tuple(num[0]+1,num[1],num[2])]){
que.push({sum-cake[0][num[0]]+cake[0][num[0]+1],make_tuple(num[0]+1,num[1],num[2])});
mp[make_tuple(num[0]+1,num[1],num[2])] = true;
}
if(num[1] < cnt[1]-1 && !mp[make_tuple(num[0],num[1]+1,num[2])]){
que.push({sum-cake[1][num[1]]+cake[1][num[1]+1],make_tuple(num[0],num[1]+1,num[2])});
mp[make_tuple(num[0],num[1]+1,num[2])] = true;
}
if(num[2] < cnt[2]-1 && !mp[make_tuple(num[0],num[1],num[2]+1)]){
que.push({sum-cake[2][num[2]]+cake[2][num[2]+1],make_tuple(num[0],num[1],num[2]+1)});
mp[make_tuple(num[0],num[1],num[2]+1)] = true;
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template<typename T, typename U> inline
ostream& operator<<(ostream &o, pair<T,U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template<typename T> inline
istream& operator>>(istream &is, vector<T> &vec) {
for(auto &v : vec) { is >> v; }
return is;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<T> &vec) {
for(auto &v : vec) { os << v << ",";}
return os;
}
template<typename T> inline
ostream& operator<<(ostream &os, vector<vector<T> > &mat) {
for(auto &row : mat) { os << row << endl; }
return os;
}
template<typename T> inline
void chmin(T &a, T b) { a = min(a, b); }
template<typename T> inline
void chmax(T &a, T b) { a = max(a, b); }
int main(void)
{
int n;
cin >> n;
map<string, int> mp;
ll ans = 0;
irep(i, n) {
string s;
cin >> s;
sort(s.begin(), s.end());
if(mp[s]) {
ans += mp[s];
}
mp[s]++;
}
cout << ans << endl;
return 0;
}
| 0
| 12,295,376
|
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int> ans;
int main(){
while(1){
int n;
cin >> n;
if(n == 0) break;
bool fd = true;
bool lf = true,rf = true;
int count = 0;
for(int i = 0;i < n;i++){
string f;
cin >> f;
if(f == "lu" || f == "ld") lf = !lf;
else rf = !rf;
if(lf == rf && lf != fd){
fd = !fd;
count++;
}
}
ans.push_back(count);
}
for(int i = 0;i < ans.size();i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; int64_t k;
cin >> n >> k;
vector<pair<int, int>> p(n);
for (auto i = 0; i < n; i++) {
int a, b; cin >> a >> b;
p[i] = {a, b};
}
sort(p.begin(), p.end());
int64_t sum = 0;
for (auto i = 0; i < n; i++) {
sum += p[i].second;
if(sum >= k) {
cout << p[i].first << endl;
return 0;
}
}
return 0;
}
| 0
| 79,515,987
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (char i : n) {
int digit = i - 48;
if (digit == 9)
cout << "1";
else if (digit == 1)
cout << "9";
}
cout << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define Mod(n) n % 1000000007
const int dx[8] = {1, 0, -1, 0, -1, 1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
int main()
{
int N;
cin >> N;
double sum = 0;
double x;
string u;
for(int i = 0;i < N;i++)
{
cin >> x >> u;
if(u == "JPY")
sum += x;
else
sum += (x * 380000);
}
cout << sum << '\n';
}
| 0
| 91,099,639
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int n , k;
int main()
{
_FastIO;
cin >> n;
vector<bool> used(300 , false);
for(int i = 0; i <= 25; i++){
for(int j = 0; j <= 25; j++){
used[i * 4 + j * 7] = true;
}
}
if(used[n]){
cout << "Yes" << endl;
}
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, m;
cin >> a >> b >> m;
vector<int> fridge(a), microwave(b);
int minf = 1e6, minm = 1e6;
for(int i=0; i<a; i++){ cin >> fridge[i]; minf = min(minf, fridge[i]); }
for(int i=0; i<b; i++){ cin >> microwave[i]; minm = min(minm, microwave[i]); }
int ans = minf + minm;
for(int i=0; i<m; i++){
int x, y, c;
cin >> x >> y >> c;
x -= 1;
y -= 1;
ans = min(ans, fridge[x] + microwave[y] - c);
}
cout << ans << endl;
return 0;
}
| 0
| 6,189,326
|
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
ll n,k,s;
cin >> n >> k >> s;
ll INF = pow(10,9);
if(s==INF) INF--;
rep(i,n){
if(i<k) cout<<s<<" ";
else cout<<INF<<" ";
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
#define rep(i, a, n) for(int i=a; i<(n); i++)
int main(){
int n, m; cin>>n>>m;
int sum=0;
vector<int> a(n);
for(int i=0; i<n; i++){
cin>>a[i];
sum+=a[i];
}
sort(a.begin(), a.end(), greater<int>());
if (sum % (4*m) ==0) sum /= 4*m;
else sum = sum / (4*m) +1;
rep(i, 0, m){
if(a[i] < sum){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
}
| 0
| 6,320,029
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int main(){
string s;
cin >> s;
ll cnt[26] = {};
rep(i, s.size())cnt[s[i]-'a']++;
ll ans = s.size()*(s.size()-1)/2 + 1;
rep(i, 26)ans -= cnt[i]*(cnt[i]-1)/2;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long numberOfDivisor(long long n){
long long cnt = 0;
for (long long i=1; i*i <= n; ++i) {
if (n%i==0) {
cnt++;
if (n/i != i) cnt++;
}
}
return cnt;
}
int main() {
int N; cin >> N;
int res = 0;
for (int i=1;i<=N;i+=2) if (numberOfDivisor(i)==8) res++;
cout << res << endl;
return 0;
}
| 0
| 71,007,126
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int a, b, n, m, test;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
cin >> n >> m;
vector<vector<int>> v(n + 1);
bool flag=false;
while (m--) {
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
if(a==1||b==1){
flag=true;
}
}
queue<int> q;
vector<bool> visited(n + 1, false);
vector<int> len(n + 1, INT_MAX);
len[1] = 0;
q.push(1);
while (!q.empty()) {
visited[q.front()] = true;
for (int i :v[q.front()]) {
if (!visited[i]) {
len[i] = q.front();
visited[i] = true;
q.push(i);
}
}
q.pop();
}
for (int i = 2; i <= n; i++) {
if(len[i]==INT_MAX){
cout<<"No";
return 0;
}
}
cout<<"Yes\n";
for (int i = 2; i <= n; i++) {
cout << len[i] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define INF (int)1e9
typedef long long int int64;
void print() {
cout << endl;
}
void print(const char* s, bool endline = true) {
cout << s;
if (endline) print();
}
void print(char s, bool endline = true) {
cout << s;
if (endline) print();
}
void print(string s, bool endline = true) {
cout << s;
if (endline) print();
}
void print(int64 s, bool endline = true) {
cout << s;
if (endline) print();
}
void print(int s, bool endline = true) {
cout << s;
if (endline) print();
}
template <typename T, typename T2>
void print(pair<T, T2>& p, bool endline = true) {
cout << "(";
print(p.first, false);
cout << ", ";
print(p.second, false);
cout << ")";
if (endline) print();
}
template <typename T>
void print(T& t, bool endline = true) {
cout << "[";
for (auto it = t.begin(); it != t.end(); ++it) {
if (it != t.begin()) cout << ", ";
print(*it, false);
}
cout << "]";
if(endline) print();
}
template <typename T>
vector<T> operator+(const vector<T> &a, const vector<T> &b)
{
vector<T> ret;
ret.reserve( a.size() + b.size() );
ret.insert( ret.end(), a.begin(), a.end() );
ret.insert( ret.end(), b.begin(), b.end() );
return ret;
}
template <typename T>
vector<T> &operator+=(vector<T> &a, const vector<T> &b)
{
a.reserve( a.size() + b.size() );
a.insert( a.end(), b.begin(), b.end() );
return a;
}
bool c(const pair<int,int> &a, const pair<int,int> &b)
{
return (a.first + a.second > b.first + b.second);
}
int main() {
string s;
cin >> s;
map<char, int64> m;
for(auto& c : s) {
m[c]++;
}
int64 count = 1LL;
for(char c = 'a'; c <= 'z'; c++) {
for(char c2 = c + 1; c2 <= 'z'; c2++) {
count += m[c] * m[c2];
}
}
cout << count << endl;
return 0;
}
| 0
| 51,417,218
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<int> p(M),y(M);
for(int i=0;i<M;i++){
cin>>p[i]>>y[i];
p[i]--;
}
vector<vector<int>> task(N);
for(int i=0;i<M;i++){
task[p[i]].push_back(y[i]);
}
for(int i=0;i<N;i++){
sort(task[i].begin(),task[i].end());
}
for(int i=0;i<M;i++){
cout<<setfill('0')<<right<<setw(6)<<p[i]+1;
int id=lower_bound(task[p[i]].begin(),task[p[i]].end(),y[i])-task[p[i]].begin();
cout<<setfill('0')<<right<<setw(6)<<id+1;
cout<<endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const ll maxn = 1e6+10;
const ll inf = 1e14;
struct node{
ll x,y;
}r[1100];
bool cmp(node a,node b){
return atan2(a.y,a.x) < atan2(b.y,b.x);
}
int main(){
ll n,x,y;
cin >> n;
for(ll i = 0; i < n; i++){
cin >> r[i].x >> r[i].y;
}
ll ans = 0;
sort(r,r+n,cmp);
for(ll i = 0; i < n; i++){
x = r[i].x ; y = r[i].y;
ans = max(ans,x*x+y*y);
for(ll j = (i+1)%n; j != i; j = (j+1)%n){
x += r[j].x ; y += r[j].y;
ans = max(ans,x*x+y*y);
}
}
double ans1 = sqrt(ans);
printf("%.13lf\n",ans1);
return 0;
}
| 0
| 81,268,949
|
#include<iostream>
using namespace std;
#define N 5
void Swap(int *a,int *b){
int tmp = *a;
*a = *b;
*b = tmp;
}
void BabbleSort(int *a){
for(int i=0;i<N;i++){
for(int j=N-1;j>i;j--){
if(a[j] >= a[j-1]){
Swap(&a[j],&a[j-1]);
}
}
}
}
int main(){
int a[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
BabbleSort(a);
for(int i=0;i<N-1;i++){
printf("%d ",a[i]);
}
printf("%d\n",a[4]);
return 0;
}
|
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <stdio.h>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <vector>
#include <fstream>
#include <list>
#include <iomanip>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ms(s) memset(s, 0, sizeof(s))
const int inf = 0x3f3f3f3f;
struct fPoint
{
float x;
float y;
};
float sign (fPoint p1, fPoint p2, fPoint p3)
{
return (p1.x - p3.x) * (p2.y - p3.y) - (p2.x - p3.x) * (p1.y - p3.y);
}
bool PointInTriangle (fPoint pt, fPoint v1, fPoint v2, fPoint v3)
{
bool b1, b2, b3;
b1 = sign(pt, v1, v2) < 0.0f;
b2 = sign(pt, v2, v3) < 0.0f;
b3 = sign(pt, v3, v1) < 0.0f;
return ((b1 == b2) && (b2 == b3));
}
int main(int argc, char * argv[])
{
#ifdef LOCAL
freopen("/Users/huangjiaming/Documents/Algorithm/oj/data.in", "r", stdin);
#endif
fPoint x1, x2, x3, xp;
while (~scanf("%f %f %f %f %f %f %f %f", &x1.x, &x1.y, &x2.x, &x2.y, &x3.x, &x3.y, &xp.x, &xp.y))
{
if (PointInTriangle(xp, x1, x2, x3))
puts("YES");
else
puts("NO");
}
return 0;
}
| 0
| 67,225,829
|
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i = 0;i < (n); ++i)
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
typedef long long ll;
typedef long double la;
using namespace std;
int main(){
string s;
cin >> s;
string ans = "keyence";
bool flag = false;
rep(i,s.size()){
rep(j,s.size()){
string t = s;
t.erase(i,j);
if(ans == t){
flag = true;
break;
}
}
}
if(flag) cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define f first
#define s second
#define sz(x) (int)x.size()
#define endl "\n"
#define forn(i,n) for(int i=0;i<n;++i)
#define fore(i,l,r) for(int i=int(l);i<=int(r);++i)
#define rep(i,begin,end) for(__typeof(end) i=(begin);i!=(end);i++)
#define fill(a,value) memset(a,value,sizeof(a));
#define gcd(a,b) __gcd((a),(b))
#define watch1(x) cout<<(x)<<endl
#define watch2(x,y) cout<<(x)<<" "<<(y)<<endl
#define watch3(x,y,z) cout<<(x)<<" "<<(y)<<" "<<(z)<<endl
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const int INF = 9e18;
const int mod = 1e9 + 7;
vi num;
int dp[105][5][2],k;
int calc(int pos,int cnt,int f)
{
if(pos==sz(num))
return cnt==k;
if(dp[pos][cnt][f]!=-1)
return dp[pos][cnt][f];
int ans=0,mx;
if(!f)
mx=num[pos];
else
mx=9;
for(int d=0;d<=mx;d++)
{
int nf=f,ncnt=cnt;
if(!f && d<mx)
nf=1;
if(d)
ncnt++;
if(ncnt<=k)
ans+=calc(pos+1,ncnt,nf);
}
return dp[pos][cnt][f]=ans;
}
int solve(string s)
{
for(int i=0;i<sz(s);i++)
{
num.pb(s[i]-'0');
}
fill(dp,-1);
int ans=calc(0,0,0);
return ans;
}
void solve()
{
string s;
cin>>s>>k;
int ans=solve(s);
cout<<ans<<endl;
}
signed main()
{
fastio;
int t;
t=1;
while(t--)
{
solve();
}
return 0;
}
| 0
| 20,660,928
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq priority_queue<int>
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(int)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(int)(key)))
#define tii tuple<int,int,int>
#define Priq priority_queue<int,vi,greater<int>>
#define pb push_back
#define mp make_pair
#define INF (1ll<<60)
signed main(){
int N; cin>>N;
vi A(N);
rep(i,0,N) cin>>A[i];
map<int,int> M;
rep(i,0,N) M[A[i]]++;
vi B;
for(auto p:M) B.pb(p.second);
sort(ALL(B));
int O=B.size();
B.pb(INF);
vi C(O+2);
REP(i,0,O) C[i+1]=C[i]+B[i];
int sum=C[O];
REP(i,1,N){
int left=0,right=N/i;
while(left+1<right){
int mid=(left+right)/2;
int X=disup(B,mid);
int Y=sum-C[X]-(O-X)*mid;
if(mid*i+Y<=N) left=mid;
else right=mid;
}
int ans=left;
int X=disup(B,right);
int Y=sum-C[X]-(O-X)*right;
if(right*i+Y<=N) ans=right;
cout<<ans<<endl;
}
}
|
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
void solve() {
int n;
cin >> n;
vector <int> a(n), b(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
for(int i = 0; i < n; i++) {
cin >> b[i];
}
if(a > b) swap(a, b);
int ans = 0;
do {
if(a == b) break;
ans++;
} while(next_permutation(a.begin(), a.end()));
cout << ans << endl;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int testcase = 1;
for(int i = 0; i < testcase; i++) {
solve();
}
return 0;
}
| 0
| 34,103,439
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main(){
int N;
vector<int> As(200010);
cin >> N;
As.resize(N);
for (int i = 0; i < N; i++) {
cin >> As[i];
}
vector<int> Cs(N);
copy(As.begin(), As.end(), Cs.begin());
sort(Cs.begin(), Cs.end());
for (int A: As) {
if (A == Cs[N-1]) {
cout << Cs[N-2] << '\n';
} else {
cout << Cs[N-1] << '\n';
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
ll n, k, x, y;
cin >> n >> k >> x >> y;
ll ans = 0LL;
if( n > k ) {
ans = x * k + (n - k) * y;
} else {
ans = x * n;
}
cout << ans << endl;
return 0;
}
| 0
| 89,400,327
|
#include <iostream>
#include <iomanip>
#include<math.h>
#include<list>
#include <algorithm>
#include<set>
#include<vector>
#include<math.h>
#include<map>
#include<string>
#include <numeric>
#include <queue>
#include <sstream>
#include <bitset>
#include<stack>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using sll = set<long long>;
template<typename T>
T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T>
map<T, T> getPrimeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i] ++;
n /= i;
}
}
if (n != 1) res[n] = 1;
return res;
}
template<typename T>
bool IsPrimeNumber(T num)
{
if (num <= 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
return false;
}
}
return true;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
#define rep(i,s,e) for(ll i=s;i<e;i++)
#define repeq(i,s,e) for(ll i=s;i<=e;i++)
int main() {
ll H1, H2, M1, M2, K;
std::cin >> H1 >> M1 >> H2 >> M2 >> K;
ll m = (H2 - H1) * 60;
m += M2 - M1;
std::cout << m - K << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
}
int kan_hyaku(int n){
int kurai = 0;
for(int i=0;i<3;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ju(int n){
int kurai = 0;
for(int i=0;i<2;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int kan_ichi(int n){
int kurai = 0;
for(int i=0;i<1;i++){
kurai = n%10;
n /=10;
}
return kurai;
}
int keta(int n){
int wa = 1;
while(n>0){
wa *=10;
n--;
}
return wa;
}
double kan_half(int n){
double wa = 1;
while(n>0){
wa *= 0.5;
n--;
}
return wa;
}
ll facctorialMethod(ll k){
ll sum = 1;
for (ll i = 1; i <= k; ++i)
{
sum = sum%1000000007 * i%1000000007;
}
return sum;
}
bool red[100010] = {};
int main() {
int n,h,w;
cin >> n >> h >> w;
vector<int>a(n),b(n);
rep(i,n) cin >> a.at(i) >> b.at(i);
int count = 0;
rep(i,n){
if(a.at(i) >= h && b.at(i) >= w)count++;
}
cout << count << endl;
}
| 0
| 96,956,224
|
#include <iostream>
using namespace std;
void ask(int left, int right, bool male) {
int mid = (left + right) / 2;
cout << mid << endl;
string s;
cin >> s;
if (s == "Vacant") return;
if (((mid - left) % 2 == 0) == (male == (s == "Male"))) ask(left, mid - 1, male);
else ask(mid + 1, right, s == "Male");
}
int main() {
int N;
cin >> N;
cout << 0 << endl;
string s;
cin >> s;
if (s == "Vacant") return 0;
ask(1, N - 1, s == "Male");
return 0;
}
|
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
bool fA = false;
bool fB = false;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'A') {
fA = true;
}
else if (S[i] == 'B') {
fB = true;
}
}
if (fA && fB) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0
| 62,696,457
|
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int a,b,c;
for(;;){
scanf("%d %d %d",&a,&b,&c);
if(a+b+c==-3){
break;
}else if(a+b>=80){
printf("A\n");
}else if(a+b>=65){
printf("B\n");
}else if(a+b>=50 || (a+b>=30 && c>=50)){
printf("C\n");
}else if(a+b>=30 && a!=-1 && b!=-1){
printf("D\n");
}else{
printf("F\n");
}
}
return 0;
}
|
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
string S; cin >> S;
int cnt[26] = {};
rep(i, N) {
cnt[S[i] - 'a']++;
}
ll ans = 1;
rep(i, 26) {
ans = (ans * (cnt[i] + 1)) % mod;
}
cout << (ans + mod - 1) % mod << endl;
return 0;
}
| 0
| 66,807,710
|
#include <cstdio>
#include <cstdint>
#include <vector>
using namespace std;
uint32_t n;
vector<uint64_t> h;
void solve() {
uint32_t max_cnt = 0;
for (auto i=h.begin();i<h.end();i++) {
uint32_t cnt = 0;
auto iter = i;
while (*iter >= *next(iter) && iter < h.end()-1) {
cnt++;
iter++;
}
max_cnt = max(max_cnt, cnt);
if (iter == h.end()-1) {
break;
}
}
printf("%d\n", max_cnt);
}
int main() {
scanf("%d", &n);
h.resize(n);
for (int i=0;i<n;i++) {
scanf("%lld", &h[i]);
}
solve();
}
|
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <algorithm>
#include <typeinfo>
#define _USE_MATH_DEFINES
#include <cmath>
using namespace std;
int main(){
int n, t_score, h_score;
t_score = 0;
h_score = 0;
cin >> n;
vector<string> taro(n);
vector<string> hana(n);
for(int i=0; i<n; i++){
cin >> taro[i] >> hana[i];
}
for(int i=0; i<n; i++){
string t = taro[i];
string h = hana[i];
transform(t.begin(), t.end(), t.begin(), ::tolower);
transform(h.begin(), h.end(), h.begin(), ::tolower);
int len = max(t.size(), h.size());
if(t==h){
t_score += 1;
h_score += 1;
}else{
for(int j=0; j<len; j++){
if(int(t[j]) < int(h[j])){
h_score += 3;
break;
}else if(int(t[j]) > int(h[j])){
t_score += 3;
break;
}
}
}
}
cout << t_score << " " << h_score << endl;
return 0;
}
| 0
| 34,088,623
|
#include <iostream>
using namespace std;
int main(){
long long int n,ans=1;
cin>>n;
for(int i=n;i>0;i--){
ans=ans*i;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long cnt5(long long n){
long long ret = 0 ;
while(n){
n/=5;
ret+=n;
}
return ret;
}
int main()
{
long long n;
cin >> n;
if(n%2)
cout << 0 << endl;
else{
long long sum = cnt5(n/2);
long long num =1;
cout << sum <<endl;
}
return 0;
}
| 0
| 32,664,035
|
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
using namespace std;
int main () {
int n,k;
vector <int> a;
cin >> n >> k;
for (int i=0;i<n;i++) {
int m;
cin >> m;
a.push_back(m);
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
int sum=0;
for (int i=0;i<k;i++) {
sum+=a[i];
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[3][3];
int is_bingo(){
int i,j;
for(i=0;i<3;i++){
if(A[i][i]!=0)break;
if(i==2)return 1;
}
for(i=0;i<3;i++){
if(A[i][2-i]!=0)break;
if(i==2)return 1;
}
for(i=0;i<3;i++){
for(j=0;j<3;j++){
if(A[i][j]!=0)break;
if(j==2)return 1;
}
}
for(i=0;i<3;i++){
for(j=0;j<3;j++){
if(A[j][i]!=0)break;
if(j==2)return 1;
}
}
return 0;
}
void mark(int B[],int n){
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
for(int k=0;k<3;k++){
if(A[j][k]==B[i])A[j][k]=0;
}
}
}
return;
}
int main(){
int i,j;
for(i=0;i<3;i++){
for(j=0;j<3;j++)scanf("%d",&A[i][j]);
}
int n;
cin>>n;
int B[n];
for(i=0;i<n;i++)scanf("%d",&B[i]);
mark(B,n);
if(is_bingo())printf("Yes\n");
else{printf("No\n");}
}
| 0
| 35,618,672
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s, s2;
ll k;
cin >> s >> k;
int n = s.size();
s2 = s + s;
if (n == 1) {
cout << k / 2 << endl;
return 0;
} else if (all_of(s.begin(), s.end(), [s](char x) { return x == s[0]; })) {
cout << n * k / 2 << endl;
return 0;
}
int cnt = 1;
ll ans = 0, ans2 = 0;
rep(i, n) {
if (s[i] == s[i + 1])
cnt++;
else
ans += cnt / 2, cnt = 1;
}
cnt = 1;
rep(i, n * 2) {
if (s2[i] == s2[i + 1])
cnt++;
else
ans2 += cnt / 2, cnt = 1;
}
ans = ans * k + (ans2 - ans * 2) * (k - 1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
void add(ll &a, ll b)
{
a = (a+b) % MOD;
}
ll mod_pow(ll x, ll n)
{
ll res = 1;
while(n > 0)
{
if(n & 1) res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
int main()
{
ll n, k;
cin >> n >> k;
ll ans = 0;
vector<ll> mem(k+1);
for(ll x = k; x >= 1; x--)
{
ll tmp = mod_pow(k/x, n);
for(ll i = 2*x; i <= k; i += x)
{
add(tmp, -mem[i]);
add(tmp, MOD);
}
mem[x] = tmp;
add(ans, x * tmp % MOD);
add(ans, MOD);
}
cout << ans << endl;
}
| 0
| 28,862,059
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
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(){
while(1){
char hoge[1000];
int i = 0;
while(1){
hoge[i] = getchar();
if(hoge[i]=='\n') continue;
if(hoge[i]=='.') break;
i++;
}
if(hoge[0]=='.') break;
int mini = 0;
int big = 0;
bool now[200] = {};
int b=0;
REP(a,i){
if(hoge[a]=='('){
mini++;
b++;
now[b] = false;
}else if(hoge[a]==')'){
if(now[b] == false) {
mini--;
b--;
}else{
mini = 100;
break;
}
}else if(hoge[a]=='['){
big++;
b++;
now[b] = true;
}else if(hoge[a]==']'){
if(now[b] == true){
big--;
b--;
}else{
big = 100;
break;
}
}
if(mini < 0||big < 0) break;
}
if(mini==0&&big==0) cout << "yes" << endl;
else cout << "no" << endl;
}
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) for(int i=(n)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define OUT(a, x, b) (x<a || b<=x)
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; }
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const int MOD = 1000000007;
const int INF = 1e18;
const double PI = acos(-1);
using namespace std;
struct INIT { INIT(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
}}INIT;
signed main() {
int N, Z, W;
cin >> N >> Z >> W;
vector<int> A(N);
REP(i, N) cin >> A[i];
if(N == 1) cout << abs(W-A[N-1]) << "\n";
else cout << max(abs(W-A[N-1]), abs(A[N-1]-A[N-2])) << "\n";
return 0;
}
| 0
| 20,391,638
|
#include<iostream>
using namespace std;
#include<string>
int main()
{
string str, order, w;
int q, i, j, a, b;
cin >> str;
cin >> q;
for(i = 0; i < q; i++){
cin >> order;
cin >> a >> b;
if(order == "print"){
cout << str.substr(a, b - a + 1) << endl;
}else if(order == "reverse"){
w = str.substr(a, b - a + 1);
for(j = 0; j < b - a + 1; j++){
str[a + j] = w[b - a - j];
}
}else{
cin >> w;
for(j = 0; str[j]; j++);
str = str.substr(0, a) + w + str.substr(b + 1, j - b - 1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define ST_ARR_LEN(array) (sizeof(array)/sizeof(*array))
#define MOD 1000000007
using namespace std;
using ll = long long;
const ll MAX = LLONG_MAX;
const ll MIN = LLONG_MIN;
typedef stack<ll> llStack;
typedef queue<ll> llQueue;
typedef vector<ll> llVector;
typedef list<ll> llList;
typedef struct S{
int a;
int b;
} Object;
int par[100000];
void init(int n){
for(int i=0;i<n;i++){
par[i] = i;
}
}
int root(int x){
if(par[x] == x){
return x;
}else{
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;
par[x] = y;
}
int main(){
ll N, M;
cin >> N >> M;
ll c[N];
for(int i=0;i<N;i++){
cin >> c[i];
}
ll x[M], y[M];
for(int i=0;i<M;i++){
cin >> x[i] >> y[i];
}
init(N);
for(int i=0;i<M;i++){
unite(c[x[i]-1]-1, c[y[i]-1]-1);
}
ll ans = 0;
for(int i=0;i<N;i++){
if(same(i, c[i]-1)){
ans++;
}
}
cout << ans << endl;
}
| 0
| 59,354,265
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1')cout << 9;
else if (s.at(i) == '9')cout << 1;
else cout << s.at(i);
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
ll N,K;
cin>>N>>K;
vector<pair<ll,ll>>A(N);
rep(i,N){
cin>>A[i].first;
cin>>A[i].second;
}
sort(A.begin(),A.end());
rep(i,N){
K-=A[i].second;
if(K<=0){
cout<<A[i].first<<endl;
i+=K;
break;
}
}
}
| 0
| 72,323,663
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef unordered_set<int> si;
typedef pair<int, int> pp;
typedef vector<pp> vpp;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define all(e) (e).begin(), (e).end()
#define pb push_back
template <typename T>
void printV(vector<T> A) {
if (A.empty()) cerr << "EMTPY\n";
else {
cerr << "[";
for (int i = 0; i < A.size() -1 ; ++i) {
cerr << A[i] << ", ";
}
if (A.size()) cerr << A.back() << "]\n";
}
}
template <typename T>
void printVV(vector<vector<T>> A) {
cerr << "[";
for (auto v : A) {
printV<T>(v);
}
cerr << "]";
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&& ...args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
int main(int argc, char **argv) {
ios::sync_with_stdio(false);
cin.tie(0);
ll n ,k; cin >> n >> k;
int cur = ((n-1) * (n-2)) >> 1;
if (k > cur) {
cout << -1 << endl;
return 0;
}
vpp ans;
for (int i = 0; i < n-1; ++i) {
ans.pb({1,i+2});
}
int i = 2, j = 3;
while (cur > k) {
ans.pb({i,j});
if (j == n) i += 1, j = i;
j += 1;
cur -= 1;
}
cout << ans.size() << '\n';
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i].first << ' ' << ans[i].second << '\n';
}
}
|
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss second
#define lli long long int
#define pb push_back
#define pf push_front
#define mkp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<lli,lli>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define INF 1e9
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
#define all(v) v.begin(),v.end()
#define endl "\n"
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
lli maxm(lli a, lli b)
{
return (a >= b ? a : b);
}
lli minm(lli a, lli b)
{
return (a <= b ? a : b);
}
lli power(lli x, lli y, lli p)
{
lli res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
lli nCrmodp(lli n, lli r, lli p)
{
if (r == 0)
return 1;
if (r == 1)
return n;
lli pro = 1, k = n;
while (k > r)
{
pro *= k;
pro %= p;
--k;
}
k = 2;
while (k <= (n - r))
{
pro *= power(k, (p - 2), p);
pro %= p;
++k;
}
return pro;
}
string num_str(lli n, lli k)
{
string str = "";
lli x = n;
while (x != 0)
{
string s = to_string(x % k);
str = s + str;
x /= k;
}
return str;
}
lli first_big(lli n, lli k, lli arr[])
{
lli l = 0;
lli r = n - 1;
lli leftGreater = n;
while (l <= r) {
lli m = l + (r - l) / 2;
if (arr[m] > k) {
leftGreater = m;
r = m - 1;
}
else
l = m + 1;
}
return leftGreater;
}
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
#define MAXN 100005
vector<int>adj[MAXN];
lli arr[MAXN][2];
vector<bool>vis;
lli dfs(int s, int par, bool st)
{
vis[s] = true;
int indx = 0;
if (st == 1)
indx = 1;
if (arr[s][indx] == -1)
{
if (adj[s].size() == 1 && s != 1)
arr[s][indx] = 1;
else
{
lli pro = 1;
if (indx == 1)
for (auto it : adj[s])
{
if (it != par)
pro *= dfs(it, s, false);
pro %= mod;
}
else
for (auto it : adj[s])
{
if (it != par)
pro *= (dfs(it, s, true) + dfs(it, s, false));
pro %= mod;
}
arr[s][indx] = pro;
}
}
return arr[s][indx];
}
int main()
{
c_p_c();
int n, u, v;
cin >> n;
vis.rsz(n + 1, false);
memset(arr, -1, sizeof(arr));
for (int i = 1; i < n; ++i)
{
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
if (n == 1)
cout << "2\n";
else
cout << (dfs(1, 0, true) + dfs(1, 0, false)) % mod << endl;
return 0;
}
| 0
| 53,406,249
|
#include<stdio.h>
int main(){
int n;
scanf("%d" , &n);
if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {
puts("Yes\n");
}
else{
puts("No\n");
}
return 0;
}
|
#include <stdio.h>
#include<math.h>
#include <string.h>
#include <ctype.h>
int main(){
int i,n;
int max,a[100]={0};
while(scanf("%d",&n)!=EOF){
a[n]++;
}
max=0;
for(i=0;i<100;i++){
if(max<a[i]){
max=a[i];
}
}
for(i=0;i<100;i++){
if(a[i]==max){
printf("%d\n",i);
}
}
return 0;
}
| 0
| 84,794,918
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
ll MOD=1000000007;
int main(){
int n; cin>>n;
vector<ll>A(n);
rep(i,n){
cin>>A[i];
if (A[i]==0){
cout << 0;
return 0;
}
}
ll ans = A[0];
for(int i=1; i<n; i++){
if (A[i]<=(1000000000000000000/ans)){
ans *= A[i];
}
else{
ans = -1;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e12
#define mo 1000000007
ll dp[101][100001];
ll a[101];
ll n,k;
ll solve()
{
for(ll j=0;j<=a[1];j++)
{
dp[1][j] = (j<=a[1])?1:0;
}
for(ll i=2;i<=n;i++)
{
for(ll j=0;j<=k;j++)
{
if(j==0)
{
dp[i][j] = dp[i-1][j];
}
else dp[i][j] = (1000000007+dp[i][j-1] + dp[i-1][j] -(((j-1-a[i])>=0)?dp[i-1][j-1-a[i]]:0))%1000000007;
}
}
return dp[n][k];
}
int main()
{
cin>>n>>k;
for(ll p=1;p<=n;p++)
{
cin>>a[p];
}
memset(dp,0,sizeof(dp));
cout<<solve();
}
| 0
| 84,428,002
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >> C;
cout << 9*max(A,max(B,C)) + A + B + C << endl;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }
const int MAX_M = 10;
const int INT_MAX = 1 << 30;
struct Edge{ int u, v, cost; };
int dijkstra(vector<Edge>& edges, int m, int s)
{
vint d(m, INT_MAX);
d[s] = 0;
bool update = true;
while(update)
{
update = false;
rep(i, edges.size())
{
Edge e = edges[i];
if(d[e.u] != INT_MAX && d[e.u] + e.cost < d[e.v])
{
d[e.v] = d[e.u] + e.cost;
update = true;
}
if(d[e.v] != INT_MAX && d[e.v] + e.cost < d[e.u])
{
d[e.u] = d[e.v] + e.cost;
update = true;
}
}
}
return accumulate(ALL(d), 0);
}
int main()
{
int n;
while(cin >> n && n)
{
int cost = INT_MAX, index = 0, m = 0;
vector<Edge> edges(n);
rep(i, n)
{
cin >> edges[i].u >> edges[i].v >> edges[i].cost;
chmax(m, max(edges[i].u, edges[i].v) + 1);
}
rep(i, m)
{
int tmp = dijkstra(edges, m, i);
if(tmp < cost)
{
index = i;
cost = tmp;
}
}
cout << index << " " << cost << endl;
}
}
| 0
| 53,869,536
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d,count=0;
cin >> a >> b >> c >> d;
for(int i=0;i<=100;i++){
if(a<=i&&i<b&&c<=i&&i<d)count++;
}
cout << count << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
#include <iomanip>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);
int main(void) {
string s;
cin >> s;
int n = (int)s.size();
int left = 0, right = n - 1;
int ans = 0;
while( left < right ) {
if( s[left] == s[right] ) {
left++;
right--;
} else if( s[left] == 'x' ) {
left++;
ans++;
} else if( s[right] == 'x' ) {
right--;
ans++;
} else {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
return 0;
}
| 0
| 61,005,181
|
#include <iostream>
#include <queue>
using namespace std;
int D[110]={};
int R[110][110]={};
int n,a,b,k;
void bfs(int src){
queue<int> Q;
Q.push(src);
D[src] = 0;
while (! Q.empty()) {
int cur = Q.front();
Q.pop();
for(int dst=1;dst<n+1;dst++){
if(R[cur][dst]==1 && D[dst]==0){
D[dst] =D[cur]+1;
Q.push(dst);
}
}
}
}
int main() {
cin >> n;
for(int i=0;i<n;i++){
cin>>a;
cin>>k;
for(int j=0;j<k;j++){
cin>>b;
R[a][b]=1;
}
}
bfs(1);
cout <<"1 0"<<endl;
for(int m=2;m<n+1;m++){
if(D[m]==0){
cout <<m<<" "<<-1<<endl;
}else{
cout <<m<<" "<<D[m]<<endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 999999999
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long int ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int const MOD = 1000000007;
int main() {
int a[110];
memset(a, 0, sizeof(a));
int n;
int m_num = 0;
while(cin >> n) {
a[n]++;
m_num = max(m_num, a[n]);
}
rep(i,1,101) {
if(a[i] == m_num) cout << i << endl;
}
return 0;
}
| 0
| 40,879,643
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define dl double
#define PB push_back
#define MP make_pair
#define PPB pop_back
#define FI first
#define SE second
#define IN insert
#define ER erase
#define clean cout.flush()
#define PF push_front
#define PP pop
#define PH push
#define TP top
#define all(x) x.begin(),x.end()
#define REV reverse
#define IOS ios_base::sync_with_stdio(false);
#define inout freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
const ll mod=1e9+7;
const ll lim=1e6+10;
ll ara[lim];
ll b[lim];
ll f[lim];
ll m[100010];
void faster()
{
IOS; cin.tie(NULL); cout.tie(NULL);
}
void Chocolate()
{
ll a,b;
cin>>a>>b;
bool chex=true;
for(int i=0;i<=1000000;i++)
{
ll k=i*(0.08);
ll k1=i*(0.1);
if(k==a && k1==b)
{
chex=true;
cout<<i;
return;
}
}
cout<<-1;
}
int main()
{
faster();
Chocolate();
return 0;
}
|
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7;
void chmod(ll &M){
if(M >= mod) M %= mod;
else if(M < 0){
M += (abs(M)/mod + 1)*mod;
M %= mod;
}
}
ll modpow(ll x, ll n){
if(n==0) return 1;
ll res=modpow(x, n/2);
if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
using namespace std;
int main()
{
int K;
int A, B;
cin >> K >> A >> B;
bool check = false;
for (int i = A; i <= B; i++) {
if (i%K == 0) {
check = true; break;
}
}
if(check) cout << "OK" << endl;
else cout << "NG" << endl;
}
| 0
| 7,710,243
|
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int n;
string s, t;
cin >> n >> s >> t;
rep(i, n) cout << s[i] << t[i];
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ll = long long int;
using vec = vector<ll>;
using P = pair<int,int>;
const int INF = 1e9+7;
int main() {
int n;
cin >> n;
vec a(n+1), l(n+1), u(n+1), b(n+1);
rep (i,n+1) {
cin >> a[i];
}
l[n] = a[n];
u[n] = a[n];
for (int i = n-1; i >= 0; i--) {
l[i] = (l[i+1] + 1) / 2 + a[i];
u[i] = u[i+1] + a[i];
}
if (1 < l[0] || 1 > u[0]) {
cout << -1 << endl;
return 0;
}
ll sum = 1;
b[0] = 1-a[0];
for (int i = 1; i < n+1; i++) {
b[i] = min(b[i-1]*2, u[i]) - a[i];
if (a[i] + b[i] < l[i]) {
cout << -1 << endl;
return 0;
}
sum += a[i] + b[i];
}
cout << sum << endl;
return 0;
}
| 0
| 46,087,470
|
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int h, w;
int i, j;
cin >> h;
cin >> w;
while (h != 0 || w != 0){
for (i = 0; i < h; i++){
if(i+1!=1&&i+1!=h){
for (j = 0; j < w; j++){
if(j+1==1||j+1==w)cout << "#";
else cout << ".";
}
}
if(i+1==1||i+1==h){
for (j = 0; j < w; j++)cout << "#";
}
cout << "\n";
}
cout << "\n";
cin >> h;
cin >> w;
}
return 0;
}
|
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll nCr(int n, int r){
ll num = 1;
for(int i = 1; i <= r; i++){
num = num * (n - i + 1) / i;
}
return num;
}
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) cin >> A[i];
map<int,int> M;
for(int a : A) M[a]++;
ll ans = 0;
for(auto p : M){
ans += nCr(p.se, 2);
}
for(int a : A){
cout << ans - nCr(M[a], 2) + nCr(M[a] -1, 2) << endl;
}
}
| 0
| 75,528,762
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> vec(N);
rep(i,N){
cin >> vec[i];
vec[i] -= (i + 1);
}
sort(all(vec));
ll len_vec = vec.size();
if (len_vec % 2 == 1){
ll b = vec[len_vec / 2];
ll ans = 0;
rep(i,N){
ans += max(vec[i] - b, b - vec[i]);
}
cout << ans << endl;
}
else{
ll a = vec[len_vec / 2];
ll b = vec[(len_vec / 2) - 1];
if ((a + b) % 2 == 0){
ll c = (a + b)/ 2;
ll ans = 0;
rep(i,N){
ans += max(vec[i] - c, c - vec[i]);
}
cout << ans << endl;
}
else{
ll c = (a + b + 1) / 2;
ll d = (a + b - 1) / 2;
ll ans_c = 0;
ll ans_d = 0;
rep(i,N){
ans_c += max(vec[i] - c, c - vec[i]);
ans_d += max(vec[i] - d, d - vec[i]);
}
cout << min(ans_c, ans_d) << endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
string a, b; cin >> a >> b;
int cnt=2*n;
for(int i=0; i<n; i++){
string s1 = a.substr(i);
string s2 = b.substr(0, n-i);
if(s1!=s2) continue;
cnt = 2*i+(n-i);
break;
}
cout << cnt << endl;
}
| 0
| 58,945,800
|
#include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define SUM(x) accumulate(ALL(x), 0LL)
#define LOWER_BOUND(A, key) distance(A.begin(), lower_bound(ALL(A), key))
#define UPPER_BOUND(A, key) distance(A.begin(), upper_bound(ALL(A), key))
using namespace std;
const int MOD = (int)(1e9 + 7);
const int INF = (int)(1e13 + 7);
const double EPS = 1e-14;
const double PI = acos(-1);
int CEIL(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
int mod(int a, int b) { return a >= 0 ? a % b : a - (b * CEIL(a, b)); }
int bpm(int a, int b) {
int res = 1;
for (a %= MOD; b; a = a * a % MOD, b >>= 1)
if (b & 1) res = res * a % MOD;
return res;
}
class AABCARC {
public:
static void solve(istream &cin, ostream &cout) {
int x;
cin >> x;
if (x < 1200)
cout << "ABC" << endl;
else {
cout << "ARC" << endl;
}
}
};
signed main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(15);
AABCARC solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;
typedef priority_queue<ll, vector<ll>, less<ll>> bpqll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define IREP(i, v) for (auto i = (v).begin(); i != (v).end(); ++i)
#define ALL(v) (v).begin(), (v).end()
#define endl "\n"
ll INF = 1e9;
ll MOD = 1000000007;
ll LINF = 1e18;
ld EPS = 1e-9;
ld PI = M_PI;
vll dx = {1, 0, -1, 0, 1, -1, -1, 1};
vll dy = {0, 1, 0, -1, 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;}
void yes(){ cout << "YES" << endl;}
void no(){ cout << "NO" << endl;}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
string s;
cin >> s;
ll k;
cin >> k;
ll i = 0;
while(1){
if(s[i] == '1'){
k--;
if(k == 0){
cout << 1 << endl;
return 0;
}
}
else{
cout << s[i] << endl;
return 0;
}
i++;
}
return 0;
}
| 0
| 38,931,293
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mod=1e9+7;
const int N=1e6+10;
void read(int &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
}
void read(ll &a)
{
a=0;int d=1;char ch;
while(ch=getchar(),ch>'9'||ch<'0') if(ch=='-') d=-1;
a=ch^48;
while(ch=getchar(),ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48);
a*=d;
}
int main()
{
int S,T,V;
read(S),read(T),read(V);
if(T*V>=S) puts("Yes");
else puts("No");
return 0;
}
|
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
#define rep_r(i,s,n)for(ll i=n-1;i>=s;i--)
#define repe_r(i,s,n)for(ll i=s;i<=n;i++)
static const ll MOD = 1e9 + 7;
static const ll MAX_L = 1e9 + 7;
int main() {
ll a, b; cin >> a >> b;
cout << 100 << " " << 100 << endl;
a--; b--;
rep(i, 0, 100) {
if (i < 50) {
rep(j, 0, 100) {
if (i & 1 && j & 1) {
if (b-- > 0)cout << '#';
else cout << '.';
}
else cout << '.';
}
}
else {
rep(j, 0, 100) {
if (i & 1 && j & 1) {
if (a-- > 0)cout << '.';
else cout << '#';
}
else cout << '#';
}
}
cout << endl;
}
return 0;
}
| 0
| 60,431,759
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int s[1000] = {0};
s[0] = a;
for (int i = 1; i < 1000; i++) s[i] += s[i - 1] + a;
rep(i, 1000) {
if (s[i] % b == c) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
#define ll long long
const int N=2e5+5;
int a[N],b[N];
int main(){
int n,k;cin>>n>>k;
for(int i=0;i<n;i++)
cin>>a[i];
while(k--){
int flag=0;
memset(b,0,sizeof(b));
for(int i=0;i<n;i++){
b[max(i-a[i],0)]++;
if(i+a[i]+1<=n-1)
b[i+a[i]+1]--;
}
a[0]=b[0];
for(int i=1;i<n;i++){
b[i]+=b[i-1];
a[i]=b[i];
}
for(int i=1;i<n;i++){
if(a[i]!=n){
flag=1;
break;
}
}
if(flag==0) break;
}
for(int i=0;i<n;i++)
cout<<a[i]<<' ';
return 0;
}
| 0
| 81,350,771
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int mn = 1000;
rep(i,s.size()-2) {
mn = min((int)(abs(stoi(s.substr(i,3))-753)), mn);
}
cout << mn << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define MAXLEN 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int n; scanf("%d", &n);
int C[VMAX + 1];
A = (unsigned short*)malloc(sizeof(short) * n + 1);
B = (unsigned short*)malloc(sizeof(short) * n + 1);
REP(i, VMAX + 1) C[i] = 0;
REP(i, n) {
scanf("%d", &A[i + 1]);
C[A[i + 1]]++;
}
FOR(i, 1, VMAX) C[i] += C[i - 1];
FOR(j, 1, n + 1) {
B[C[A[j]]] = A[j];
C[A[j]]--;
}
FOR(i, 1, n + 1) {
if (i > 1) printf(" ");
printf("%d", B[i]);
}
printf("\n");
}
| 0
| 77,192,202
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
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 vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance( vec.begin(), itr );
if (index != vec.size()) {
return 1;
}
else {
return 0;
}
}
struct edge {
ll to, cost;
};
int main() {
ll N, M; cin >> N >> M;
vector<ll> p(M); vector<string> S(M); REP(i, M) cin >> p[i] >> S[i];
map<int, int> m; ll ac = 0; ll wa = 0;
REP(i, M) {
if(S[i] == "WA" && m[p[i]] != -1) m[p[i]]++;
else if(S[i] == "AC" && m[p[i]] != -1) {
ac++;
wa += m[p[i]];
m[p[i]] = -1;
}
}
cout << ac << " " << wa << endl;
}
|
#include<bits/stdc++.h>
#define mx 1000000007
#define ll long long int
using namespace std;
int n,k;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>> n;
int arr[n+1][4];
for(int i=1;i<=n;++i)
cin>> arr[i][1] >> arr[i][2] >> arr[i][3] ;
int dp[n+1][4]={0};
dp[n][0]=max(arr[n][1],max(arr[n][2],arr[n][3]));
dp[n][1]=max(arr[n][2],arr[n][3]);
dp[n][2]=max(arr[n][1],arr[n][3]);
dp[n][3]=max(arr[n][1],arr[n][2]);
for(int i=n-1;i>0;--i){
dp[i][0]=max(dp[i+1][1]+arr[i][1],max(dp[i+1][2]+arr[i][2],dp[i+1][3]+arr[i][3]));
dp[i][1]=max(dp[i+1][2]+arr[i][2],dp[i+1][3]+arr[i][3]);
dp[i][2]=max(dp[i+1][1]+arr[i][1],dp[i+1][3]+arr[i][3]);
dp[i][3]=max(dp[i+1][1]+arr[i][1],dp[i+1][2]+arr[i][2]);
}
cout<< dp[1][0] ;
return 0;
}
| 0
| 86,435,116
|
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using ll=long long;
int main() {
int N,M; cin>>N>>M;
priority_queue<int> q;
for (int i = 0; i < N; i++){
int A; cin>>A;
q.push(A);
}
for (int i = 0; i < M; i++){
if(q.size()){
int tmp=q.top();
q.pop();
if(tmp/2!=0)q.push(tmp/2);
}else break;
}
ll ans=0;
while(q.size()){
ans+=q.top();
q.pop();
}
cout<<ans<<endl;
}
|
#include <stdio.h>
int main(void){
int i,n,k;
while(scanf("%d%d",&n,&k),n,k){
int max=0,temp=0;
int val[100000]={0};
for(i=0;i<n;i++){
scanf("%d",&val[i]);
temp+=val[i];
if(i>=k)temp-=val[i-k];
if(i>k-1 && temp>max)max=temp;
}
printf("%d\n",max);
}
return 0;
}
| 0
| 45,805,766
|
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define INF (1 << 30) - 1
#define LLINF (1LL << 61) - 1
using namespace std;
const int MOD = 1000000007;
const int MAX = 510000;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;
cin>>x>>y;
if(abs(x-y)<=1){
cout<<"Brown"<<endl;
} else{
cout<<"Alice"<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX=105;
const long long int INF=(1LL<<32);
long long int D[MAX][MAX];
int N;
void floyd(){
for(int k=0;k<N;k++){
for(int i=0;i<N;i++){
if(D[i][k]==INF) continue;
for(int j=0;j<N;j++){
if(D[k][j]==INF) continue;
D[i][j]=min(D[i][j],D[i][k]+D[k][j]);
}
}
}
}
int main(){
int E;cin>>N>>E;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(i==j) D[i][j]=0;
else D[i][j]=INF;
}
}
for(int i=0;i<E;i++){
int s,t,d;
cin>>s>>t>>d;
D[s][t]=d;
}
floyd();
bool ans=true;
for(int i=0;i<N;i++){
if(D[i][i]<0){
cout<<"NEGATIVE CYCLE"<<endl;
ans=false;
break;
}
}
if(ans){
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(j) cout<<" ";
if(D[i][j]==INF) cout<<"INF";
else cout<<D[i][j];
}
cout<<endl;
}
}
}
| 0
| 54,846,380
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int N;
cin >> N;
ll dp[3][100010];
for(int i=0;i<N;i++){
int a,b,c;
cin >>a>>b>>c;
if(i==0){
dp[0][i]=a;
dp[1][i]=b;
dp[2][i]=c;
}
else{
dp[0][i]=max(dp[1][i-1],dp[2][i-1])+a;
dp[1][i]=max(dp[0][i-1],dp[2][i-1])+b;
dp[2][i]=max(dp[0][i-1],dp[1][i-1])+c;
}
}
int ans=max(dp[0][N-1],max(dp[1][N-1],dp[2][N-1]));
cout << ans <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_INF = 2147483647;
const long long LL_INF = 1LL<<60;
const long long MOD = 1000000007;
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
bool check(string &s){
bool flag = true;
REP(i,s.size()/2){
if(s[i] != s[s.size()-1-i]){
flag = false;
break;
}
}
return !flag;
}
int main(void){
string s; cin >> s;
string rmv = "";
REP(i,s.size()) if(s[i]!='x') rmv += s[i];
if(check(rmv)){
cout << -1 << endl;
return 0;
}
int ans = 0;
int l = 0, r = s.size()-1;
while(l < r){
if(s[l]!=s[r]){
if(s[l]=='x') l++;
else r--;
ans++;
}
else{
l++;
r--;
}
}
cout << ans << endl;
return 0;
}
| 0
| 58,353,655
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b,c;
char e,f,g;
cin >>a>>b>>c;
e = a.at(0) - 32;
f = b.at(0) - 32;
g = c.at(0) - 32;
cout << e<< f << g<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
typedef long long ll;
int main(){
int k,n;
cin >> k >> n;
vector<int> a(n);
rep(i, n){
cin >> a.at(i);
}
int maxa = 0;
rep(i, n-1){
int tmp = a.at(i+1) - a.at(i);
if(tmp>maxa) maxa = tmp;
}
if(a.at(0)+k-a.at(n-1) > maxa) maxa = a.at(0)+k-a.at(n-1);
cout << k-maxa << endl;
return 0;
}
| 0
| 79,484,314
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<pii> td(N);
for (int i = 0; i < N; ++i) {
cin >> td[i].first >> td[i].second;
td[i].first--;
}
auto cmp = [&](pii a, pii b) { return a.second == b.second ? a.first < b.first : a.second > b.second; };
sort(td.begin(), td.end(), cmp);
vector<bool> isused(N);
priority_queue<int, vector<int>, greater<int>> maque;
priority_queue<int> que;
ll pt = 0;
for (int i = 0; i < N; ++i) {
if (!isused[td[i].first] && maque.size() < K) {
maque.push(td[i].second);
pt += td[i].second;
isused[td[i].first] = true;
} else
que.push(td[i].second);
}
int cnt = maque.size();
while (cnt < K) {
pt += que.top();
que.pop();
cnt++;
}
cnt = maque.size();
ll ans = pt + (ll)cnt * cnt;
for (int i = cnt - 1; i > 0; --i) {
if (maque.top() < que.top()) {
pt += que.top();
que.pop();
pt -= maque.top();
que.push(maque.top());
maque.pop();
}
ans = max(ans, pt + (ll)i * i);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(int i=0;i<(int)n;++i)
#define rep2(i,n) for(int i=0;i<(int)n;++i)
#define rep3(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define rep4(i,a,b,c) for(int i=(int)a;i<(int)b;i+=(int)c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n) for(int i=n-1;i>=0;i--)
#define rrep3(i,a,b) for(int i=a-1;i>=b;i--)
#define rrep4(i,a,b,c) for(int i=a-1;i>=b;i-=c)
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define mp make_pair
#define debug(x) cerr << #x << ": " << x << "\n"
#define doset(x) cout << fixed << setprecision(x)
struct myset{myset(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}};
using ll = long long;
using ld = long double;
using dou = double;
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const dou pi = 3.14159265358;
const ll mod1 = 1000000007LL;
const ll mod2 = 998244353LL;
typedef pair<ll,ll> P;
ostream &operator<<(ostream &os, const P q){os << q.first << "," << q.second;return os;}
template<class T, class U> inline bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T, class U> inline bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }
template<class T, class U> inline bool change(T& a,U& b){if(a > b){swap(a,b);return 1;}return 0;}
ll modpow(ll n,ll m,ll MOD){
if(m == 0)return 1;
if(m < 0)return -1;
ll res = 1;
while(m){
if(m & 1)res = (res * n) % MOD;
m >>= 1;
n *= n;
n %= MOD;
}
return res;
}
ll mypow(ll n,ll m){
if(m == 0)return 1;
if(m < 0)return -1;
ll res = 1;
while(m){
if(m & 1)res = (res * n);
m >>= 1;
n *= n;
}
return res;
}
template<class T>
T gcd(T a,T b){
a = abs(a);b = abs(b);
if(a == 0)return b;
else if(b == 0)return a;
if(a < b)swap(a,b);
if(a % b == 0)return b;
else return gcd(b,a%b);
}
template<class T>
T lcm(T a,T b){
return a / gcd(a,b) * b;
}
template<class T>
inline bool isp(T n){
bool res = true;
if(n == 1)return false;
else{
for(ll i = 2;i * i <= n;i++){
if(n % i == 0){
res = false;
break;
}
}
return res;
}
}
const ll cmax = 1000000;
vector<ll> fac(cmax),finv(cmax),inv(cmax);
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < cmax; i++){
fac[i] = fac[i - 1] * i % mod1;
inv[i] = mod1 - inv[mod1%i] * (mod1 / i) % mod1;
finv[i] = finv[i - 1] * inv[i] % mod1;
}
}
ll nCk(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod1) % mod1;
}
template<class T = int>
T in(){T x;cin >> x;return x;}
inline bool Yes(bool b){cout << (b ? "Yes\n":"No\n");return b;}
inline bool YES(bool b){cout << (b ? "YES\n":"NO\n");return b;}
int main(){
myset m;
int A,B;
cin >> A >> B;
vector<vector<char>> ans(100,vector<char>(100));
rep(i,100){
rep(j,100){
if(i < 50)ans[i][j] = '#';
else ans[i][j] = '.';
}
}
int cnt = 1;
bool go = 0;
for(int i = 0;i < 50;i += 2){
for(int j = 0;j < 100;j += 2){
if(cnt == A){
go = 1;
break;
}
ans[i][j] = '.';
cnt++;
}
if(go)break;
}
cnt = 1;
go = 0;
for(int i = 51;i < 100;i += 2){
for(int j = 0;j < 100;j += 2){
if(cnt == B){
go = 1;
break;
}
ans[i][j] = '#';
cnt++;
}
if(go)break;
}
cout << "100 100\n";
rep(i,100){
rep(j,100){
cout << ans[i][j];
if(j == 99)cout << "\n";
}
}
}
| 0
| 48,997,891
|
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
#define reverse(v) reverse(v.begin(),v.end())
typedef long long ll;
typedef long double la;
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int k;
cin >> k;
rep(i,0,k){
if(a >= b){
b *= 2;
continue;
}else{
c *= 2;
continue;
}
}
if(a < b && b < c){
cout << "Yes" << endl;
return 0;
}else{
cout << "No" << endl;
return 0;
}
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
string s; cin >> s;
sort(all(s));
if(s == "abc") cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 80,988,554
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__);
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__);
void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
cin >> t;
in(u...);
}
void out() {
cout << endl;
}
template <typename T, class... U>
void out(const T& t, const U&... u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
#define rep(i, n) for (long long i = 0; i < n; i++)
void solve();
#ifndef ONLINE_JUDGE
#include "./lib.hpp"
#endif
void solve() {
ini(A);
inc(op);
ini(B);
if (op == '+')
out(A + B);
else
out(A - B);
}
|
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
vector<pair<long long,long long> >v;
vector<long long>vx,vy;
int main()
{
long long c,d,e,l,g,n,k,i,j,t,p,q,x,y,x1,y1,x2,y2;
long long f=4000000000000000005,a,b,m;
cin>>n>>k;
for(i=0; i<n; i++)
{
cin>>c>>d;
v.push_back({c,d});
vx.push_back(c);
vy.push_back(d);
}
if(k==1)
{
cout<<0<<'\n';
return 0;
}
sort(vx.begin(),vx.end());
sort(vy.begin(),vy.end());
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
for(p=0; p<n; p++)
{
for(q=p+1; q<n; q++)
{
x1=vx[i];
x2=vx[j];
y1=vy[p];
y2=vy[q];
a=x2-x1;
b=y2-y1;
m=a*b;
g=0;
for(l=0; l<n; l++)
{
if(v[l].first>=x1&&v[l].first<=x2&&v[l].second>=y1&&v[l].second<=y2)
g++;
}
if(g>=k)
{
f=min(m,f);
}
}
}
}
}
cout<<f<<'\n';
return 0;
}
| 0
| 65,396,150
|
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <iomanip>
#include <fstream>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;
#define rep(i,n) for(int (i) = 0;(i) < (n);(i)++)
#define clr(a) memset((a), 0 ,sizeof(a))
#define mclr(a) memset((a), -1 ,sizeof(a))
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (sizeof(a))
#define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)
bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 1000000007;
const int INF = 2147483647;
int main()
{
int n;
cin >> n;
rep(_, n){
string s[2];
cin >> s[0] >> s[1];
int m = 0, c = 0, x = 0, i = 0;
rep(j, 2){
int t = 1;
rep(q, s[j].size()){
if (s[j][q] == 'm'){
m += t; t = 1;
}else
if (s[j][q] == 'c'){
c += t; t = 1;
}else
if (s[j][q] == 'x'){
x += t; t = 1;
}else
if (s[j][q] == 'i'){
i += t; t = 1;
}else{
t = s[j][q] - '0';
}
}
}
while (c >= 10 || x >= 10 || i >= 10){
m += c / 10; c -= c / 10 * 10;
c += x / 10; x -= x / 10 * 10;
x += i / 10; i -= i / 10 * 10;
}
stringstream ans;
if (m > 1){ ans << m; }
if (m){ ans << 'm'; }
if (c > 1){ ans << c; }
if (c){ ans << 'c'; }
if (x > 1){ ans << x; }
if (x){ ans << 'x'; }
if (i > 1){ ans << i; }
if (i){ ans << 'i'; }
cout << ans.str() << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
string s,t;cin >> s >> t;
vector<vector<int>> a(26),b(26);
for(int i = 0; i < s.size(); i++) {
a[(int)s[i]-97].push_back(i);
}
for(int i = 0; i < s.size(); i++) {
b[(int)t[i]-97].push_back(i);
}
bool ans=true;
for(int i = 0; i < 26; i++) {
if(b[i].size()==0) continue;
bool y=false;
for(int j = 0; j < 26; j++) {
if(b[i]==a[j]) y=true;
}
if(!y) ans=false;
}
if(ans) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 76,549,849
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,H,W,A,B,x=0;cin>>N>>H>>W;
for(int i=0;i<N;i++){
cin>>A>>B;
if(H<=A&&W<=B)x++;
}
cout<<x<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
deque<int>deq;
for(int i=0; i<n; i++){
if(i%2==0) deq.push_front(arr[i]);
else deq.push_back(arr[i]);
}
if(n%2==0){
while(deq.size()){
cout<<deq.back()<<" ";
deq.pop_back();
}
}
else{
while(deq.size()){
cout<<deq.front()<<" ";
deq.pop_front();
}
}
}
| 0
| 36,692,439
|
#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(){
ll n,r;cin >>n>>r;
ll ans;
ans=n>10?r:r+100*(10-n);
cout <<ans <<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using vc = vector<char>;
using pll = pair<ll, ll>;
template<class T> void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T> void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U> bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U> bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool even(T n) { return ! (n & 1); }
template<class T> bool odd(T n) { return n & 1; }
template<class T> ll rup(T a, T b) { return a % b ? a / b + 1 : a / b; }
template<class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
ll intpow(ll a, ll n, ll _mod=numeric_limits<ll>::max()) { ll p=1; while (n) { if (n&1) p=p*a%_mod; a=a*a%_mod; n>>=1; } return p; }
ll modc(ll a, char op, ll b, ll _mod=mod)
{
a %= _mod; b %= _mod; ll res = 1;
switch (op) {
case '+': res = (a + b) % _mod; break;
case '-': res = (a - b) % _mod; break;
case '*': res = a * b % _mod; break;
case '/': res = modc(a, '*', modc(b, '^', _mod-2, _mod), _mod); break;
case '^': res = intpow(a, b, _mod); break;
case 'P': rep(i, a-b+1, a+1) res = modc(res, '*', i, _mod); break;
case 'C': res = modc(modc(a, 'P', b, _mod), '/', modc(b, 'P', b, _mod)); break;
}
if (res < 0) { res += _mod; } return res;
}
int main()
{
ll A, B, K;
cin >> A >> B >> K;
rep(i, 0, K) {
if (odd(A)) {
--A;
}
B += A/2;
A /= 2;
++i;
if (i >= K) break;
if (odd(B)) {
--B;
}
A += B/2;
B /= 2;
}
cout << A << ' ' << B << endl;
}
| 0
| 84,674,439
|
#include<bits/stdc++.h>
#define N 100005
using namespace std;
int n,L,T;
int pos[N],v[N];
int main(){
scanf("%d%d%d",&n,&L,&T);
for(int i=1;i<=n;i++) scanf("%d%d",&pos[i],&v[i]),v[i]=v[i]==1? 1:-1;
vector<int> fin;
for(int i=1;i<=n;i++)
fin.push_back(((pos[i]+v[i]*T)%L+L)%L);
int pos1=fin[0];
sort(fin.begin(),fin.end());
long long tot=0;
for(int i=1;i<=n;i++)
if(v[i]!=v[1])
tot+=(2*1LL*T+(v[1]==1? (L-pos[i]+pos[1]):(pos[i]-pos[1])) )/L;
tot=((v[1]*tot)%n+n)%n;
int id1=0;
for(int i=0;i<n;i++)
if(fin[i]==pos1){
id1=i;
if(v[1]==-1) break;
}
id1=((id1-tot)%n+n)%n;
for(int i=id1;i<n;i++)
printf("%d\n",fin[i]);
for(int i=0;i<id1;i++)
printf("%d\n",fin[i]);
return 0;
}
|
#include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b) for(long long int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vlld vector<lld>
#define vi vector<int>
#define vch vector<char>
#define sll set<ll>
#define sch set<ch>
#define vpll vector< pair<ll,ll> >
#define vpii vector< pair<int,int> >
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mll map<ll, ll>
#define mcll map<char,ll>
#define sz(container) ll((container).size())
#define fill(a,b) memset(a, b, sizeof(a))
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
lld pi=3.1415926535897932;
const ll MOD=1e9+7;
const ll dx[4]={-1, 0, 1, 0} , dy[4]={0, 1, 0, -1};
const ll dxx[8]={-1, -1, 0, 1, 1, 1, 0, -1} , dyy[8]={0, 1, 1, 1, 0, -1, -1, -1};
ll lcm(ll a, ll b)
{
ll g=__gcd(a, b);
return a/g*b;
}
ll binpow(ll a, ll b,ll m)
{
a %= m;
ll res = 1;
while (b > 0)
{
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll r,s,p;
ll rps(char ch)
{
if(ch=='r') return p;
else if(ch=='s') return r;
else return s;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast_io;
ll T=1;
For(i,1,T)
{
ll n,k;cin>>n>>k;
cin>>r>>s>>p;
string temp;cin>>temp;
string t;t+='$';t+=temp;
ll ans=0;
For(j,1,n)
{
ans+=rps(t[j]);
}
For(j,k+1,n)
{
if(t[j]==t[j-k]) ans-=rps(t[j]),t[j]='$';
}
cout<<ans;
}
}
| 0
| 2,013,133
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
string s;
cin>>n>>s;
int cur=0;
int wor=0;
rep(i,0,n){
if(s[i]=='(') cur++;
else cur--;
wor=min(cur,wor);
}
rep(i,0,-wor){
cout<<'(';
}
cout<<s;
rep(i,0,cur-wor){
cout<<')';
}
cout<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
int count =0;
for (int i = 0; i < W; i++) {
bool flag = true;
for (int j = 0; j < H; j++) {
if (data.at(j).at(i-count) != '.') {
flag = false;
break;
}
}
if (flag == true) {
for (int k = 0; k < H; k++) {
for (int l = i-count; l < W-1; l++){
data.at(k).at(l) = data.at(k).at(l+1);
}
}
count++;
}
}
for (int i = 0; i < H; i++) {
bool flag = true;
for (int j = 0; j < W; j++) {
if (data.at(i).at(j) != '.') {
flag = false;
break;
}
}
if (flag == false) {
for (int j = 0; j < W - count; j++) {
cout << data.at(i).at(j);
}
cout << endl;
}
}
}
| 0
| 84,709,982
|
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tl3;
const int BIG_NUM = 1e9;
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
const int MAX = 1e5+5;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
queue<pii> q;
int m = a[0];
int p = a[n - 1];
for (int i = 1; i < n-1; i++) {
if (a[i] < 0) {
q.push(make_pair(p, a[i]));
p -= a[i];
}
else {
q.push(make_pair(m, a[i]));
m -= a[i];
}
}
q.push(make_pair(p, m));
cout << p - m << endl;
while (!q.empty()) {
cout << q.front().first << " " << q.front().second << endl;
q.pop();
}
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n;
string s[maxn];
int t[maxn];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n;
for (int i=0; i<n; i++) {
cin>>s[i]>>t[i];
}
string x;
cin>>x;
int tot = 0;
bool flag = false;
for (int i=0; i<n; i++) {
if (flag) {
tot += t[i];
continue;
}
if (x==s[i]) {
flag=true;
}
}
out(tot);
return 0;
}
| 0
| 86,727,372
|
#include<bits/stdc++.h>
#define int long long
#define for1(i, n) for(int i = 1; i <= (n);i++)
using namespace std;
int k, a[123567], l = 2, r = 2;
signed main() {
cin >> k; for1(i, k)cin >> a[i];
for (int i = k; i >= 1; i--) {
if (l % a[i] != 0)l += a[i] - l % a[i];
r -= r % a[i];
if (l > r) {
cout << "-1\n";
return 0;
}
r += a[i] - 1;
}
cout << l << ' ' << r << endl;
}
|
#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 gcd(int a, int b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int gcds(vector<int> as) {
int ans = as[0];
for (int i = 1; i < (int)as.size(); i++) {
ans = gcd(ans, as[i]);
}
return ans;
}
const int A = 1000005;
int main() {
int n;
cin >> n;
vector<int> as(n);
vector<int> cnts(A);
rep(i, n) {
cin >> as[i];
cnts[as[i]]++;
}
bool isPair = true;
for (int i = 2; i < A; i++) {
int cnt = 0;
for (int j = i; j < A; j += i) {
cnt += cnts[j];
}
if (1 < cnt) {
isPair = false;
}
}
if (isPair) {
cout << "pairwise coprime" << endl;
return 0;
}
int g = gcds(as);
if (g == 1) {
cout << "setwise coprime" << endl;
return 0;
}
cout << "not coprime" << endl;
return 0;
}
| 0
| 68,521,755
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<string, int> s;
for (int i = 0; i < n; i ++) {
string tmp; cin >> tmp;
if (s.count(tmp) == 0) {
s[tmp] = 1;
} else {
s[tmp] ++;
}
}
int m; cin >> m;
for (int i = 0; i < m; i ++) {
string tmp; cin >> tmp;
if (s.count(tmp) == 0) {
s[tmp] = -1;
} else {
s[tmp] --;
}
}
int max = -101;
for (map<string, int>::iterator itr = s.begin(); itr != s.end(); ++itr) {
if(itr->second > max) {
max = itr->second;
}
}
if (max < 1) {
cout << 0 << endl;
} else {
cout << max << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
string s;cin>>s;
int mn = 0;
int mx = s.size()-1;
int ans = 0;
while(mn < mx){
if(s[mn] == s[mx]){
mn++;mx--;
}else if(s[mn] == 'x'){
mn++;
ans++;
}else if(s[mx] == 'x'){
mx--;
ans++;
}else{
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
}
| 0
| 95,393,804
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int,int>
#define ppl pair<ll,ll>
#define vpi vector<ppi>
#define vpl vector<ppl>
#define all(x) x.begin(),x.end()
#define ii int,int
#define ff first
#define ss second
#define forn(i,a,b) for(int i=a;i<b;i++)
#define forr(i,a,b) for(int i=a;i>=b;i--)
#define forv(i,m) for(auto i : m)
#define p2d(v) for(auto a:v){for(auto b:a)cout<<b<<" ";cout<<endl;}
#define p1d(v) for(auto a:v)cout<<a<<" ";cout<<endl;
#define ppd(v) for(auto a:v)cout<<a.ff<<" "<<a.ss<<endl;
#define imx INT_MAX
#define imn INT_MIN
#define inf 9000000000000000000
#define minf -inf
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define sze size()
#define rvs reverse
#define itr iterator
#define pre cout<<fixed<<setprecision(10);
#define umap unordered_map
#define uset unordered_set
#define pi 3.141592653589793
#define MAXN 100005
#define test1(x) cout << #x " = " << x << endl;
#define test2(x,y) cout << #x " = " << x << " " << #y " = " << y << endl;
#define test3(x,y,z) cout << #x " = " << x << " " << #y " = " << y << " " << #z " = " << z << endl;
#define test4(w,x,y,z) cout << #w " = " << w << " " << #x " = " << x << " " << #y " = " << y << " " << #z " = " << z << endl;
const ll infinity = 9e18;
#define oset tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define MODM(a,b,md) ((a%md)*(b%md))%md
#define MODA(a,b,md) ((a%md)+(b%md))%md
#define ull unsigned long long int
bool compare(int a,int b) {return a > b;}
bool compare1(ppi a,ppi b) {return a.ff > b.ff;}
bool compare2(ppi a,ppi b) {return a.ss < b.ss;}
ll Npower(ll a,ll b) {ll product = 1; while(b){if(b&1){product = product*a;}a = a*a;b = b>>1;} return product;}
ll power(ll a,ll b,ll md) {ll product = 1; while(b){if(b&1){product = MODM(product,a,md);}a = MODM(a,a,md);b = b>>1;} return product%md;}
bool isprime(ll n){if(n < 2) return 0; ll i = 2; while(i*i <= n){if(n%i == 0) return 0; i++;} return 1;}
ll GCD(ll a,ll b) {return b==0 ? a:GCD(b,a%b);}
ll LCM(ll a,ll b) {return (a/GCD(a,b))*b; }
int main()
{
fast
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n,p;
cin>>n>>p;
string s;
cin>>s;
ll total = 0;
if(p == 2 || p == 5)
{
forn(i,0,n)
{
if((s[i]-'0')%p==0)
{
total += (i+1);
}
}
cout<<total;
return 0;
}
map<ll,ll> m;
m[0] = 1;
ll rem = 0;
forr(i,n-1,0)
{
rem = (rem + power(10,n-1-i,p)*(s[i]-'0'))%p;
total += m[rem];
m[rem]++;
}
cout<<total;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#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 show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> lP;
ll gcd(int x, int y){ return y?gcd(y, x%y):x;}
ll lcm(ll x, ll y){ return (x*y)/gcd(x,y);}
bool cmp(const lP &a, const lP &b){
return (a.first+a.second)>(b.first+b.second);
}
int main()
{
int n;
cin >> n;
vector<lP> ab;
vector<ll> food;
rep(i, n){
ll tmp1, tmp2;
cin >> tmp1 >> tmp2;
ab.push_back({tmp1, tmp2});
}
sort(ab.begin(), ab.end(), cmp);
ll taka = 0;
ll aok = 0;
rep(i, n){
if ((i%2)==0){
taka+=ab[i].first;
}else{
aok+=ab[i].second;
}
}
printf("%lld\n", taka-aok);
}
| 0
| 24,602,659
|
#include <bits/stdc++.h>
#include <algorithm>
#include <string>
#include <list>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string S;
bool flag = true;
cin >> S;
if (S[0] != 'Y') flag = false;
if (S[1] != 'A') flag = false;
if (S[2] != 'K') flag = false;
if (S[3] != 'I') flag = false;
cout << (flag ? "Yes" : "No") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<endl;
#define LOG2(x,y) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<endl;
#define LOG3(x,y,z) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
#define LOG4(w,x,y,z) if(DEBUG)cout<<TO_STRING(w)<<"="<<w<<" "<<TO_STRING(x)<<"="<<x<<" "<<TO_STRING(y)<<"="<<y<<" "<<TO_STRING(z)<<"="<<z<<endl;
template<class T>bool chmax(T & a, const T & b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
void func(long long N, long long K){
lli d = N-2;
if((d+1)*d/2 < K){
cout<<-1<<endl;
return;
}
vector<pair<lli,lli>> ans;
lli cnt=0;
REP(i,0,N-1){
ans.push_back({i,N-1});
REP(j,i+1,N-1){
if(cnt<K){
cnt++;
continue;
}
ans.push_back({i,j});
}
}
cout<<ans.size()<<endl;
REP(i,0,ans.size()){
cout<<ans[i].first+1<<" "<<ans[i].second+1<<endl;
}
}
int main(){
long long N;
scanf("%lld",&N);
long long K;
scanf("%lld",&K);
func(N, K);
return 0;
}
| 0
| 49,404,093
|
#include <iostream>
using namespace std;
int main() {
string s;
getline(cin, s);
for (string::iterator it = s.begin(); it != s.end(); it++) {
char c = (char)*it;
if (isalpha(c))
if (isupper(c))
*it = tolower(c);
else
*it = toupper(c);
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll H, N;
cin >> H >> N;
vector<ll> dp(H + 1, numeric_limits<ll>::max());
vector<pair<ll, ll>> A(N);
rep(i, N) cin >> A[i].first >> A[i].second;
dp[0] = 0;
for(ll i = 0;i < H;i++) {
if(dp[i] == numeric_limits<ll>::max()) continue;
iter(j, A) {
ll index = min(H, i + j.first);
dp[index] = min(dp[i] + j.second, dp[index]);
}
}
cout << dp.back() << endl;
return 0;
}
| 0
| 18,557,271
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
const char nl = '\n';
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k; cin >> n >> k;
int a[n];
F0R(i, n) {
cin >> a[i];
}
cout << ceil((double)(n - 1) / (k - 1)) << nl;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};
int main(void) {
ll a, b;
cin >> a >> b;
ll ans = 0;
if(a%2==0 && b%2!=0){
ll c = (b-a+1)/2;
if(c%2!=0) ans = 1;
}
else if(a%2==0 && b%2==0){
ll c = (b-a)/2;
if(c%2==0) ans = b;
else if(c%2!=0) ans = b+1;
}
else if(a%2!=0 && b%2!=0){
ll c = (b-a)/2;
if(c%2==0) ans = a;
else if(c%2!=0) ans = a-1;
}
else if(a%2!=0 && b%2==0){
ll c = (b-a-1)/2;
ll d = a^b;
if(c%2!=0 && d%2==0) ans = d+1;
if(c%2==0 && d%2==0) ans = d;
if(c%2!=0 && d%2!=0) ans = d-1;
if(c%2==0 && d%2!=0) ans = d;
}
cout << ans << endl;
return 0;
}
| 0
| 77,807,433
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(v) push_back(v)
typedef complex<double> P;
const double L = 100.0;
const double PI = 3.14159265358979323846;
vector <P> ans;
int N;
void rec(P lp, P rp, int n) {
if (n == 0) {
ans.pb(lp);
return;
}
P s, t, u, a;
s = lp + (rp - lp) / 3.;
t = lp + (rp - lp) * 2. / 3.;
a = polar(abs(rp-lp)/3, arg(rp-lp) + PI/3.);
u = s + a;
rec(lp, s, n-1);
rec(s, u, n-1);
rec(u, t, n-1);
rec(t, rp, n-1);
}
void solve(void){
cin >> N;
P p1(0., 0.);
P p2(L, 0.);
rec(p1, p2, N);
ans.pb(p2);
for (auto p : ans) {
printf("%.6lf %.6lf\n", p.real(), p.imag());
}
}
int main(void){
solve();
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);
static const int INF = 1e9+7;
int main(){
int H, W;
cin >> H >> W;
vector<string> field(H);
REP(h,H){
string s;
cin >> s;
field[h] = s;
}
vector<bool> tate(H, false);
vector<bool> yoko(W, false);
REP(h,H){
bool ok = false;
REP(w,W){
if(field[h][w] == '#'){
ok = true;
break;
}
}
tate[h] = ok;
}
REP(w,W){
bool ok = false;
REP(h,H){
if(field[h][w] == '#'){
ok = true;
break;
}
}
yoko[w] = ok;
}
REP(h,H){
bool ok = false;
REP(w,W){
if(tate[h] && yoko[w]){
cout << field[h][w];
ok = true;
}
}
if(ok) cout << endl;
}
return 0;
}
| 0
| 22,582,608
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << 8 - (x-400)/200 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
int n, m;
cin >> n >> m;
vector<pair<ll, ll> > a, b;
for(int i=0; i<n; ++i){
int x, y;
cin >> x >> y;
a.push_back({x, y});
}
for(int i=0; i<m; ++i){
int x, y;
cin >> x >> y;
b.push_back({x, y});
}
for(ll i=0; i<n; ++i){
pair<ll, ll> ans = {INT_MAX, 0};
for(ll j=0; j<m; ++j){
ans = min(ans, {abs(a[i].first-b[j].first) + abs(a[i].second-b[j].second), j});
}
cout << ans.second+1 << endl;
}
}
| 0
| 97,201,452
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define trav(a, x) for (auto& a : x)
using ull = uint64_t;
using ll = int64_t;
using PII = pair<int, int>;
using VI = vector<int>;
#define INF (1ll<<60)
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A> string to_string(A v) {
bool first = true; string res = "{";
for (const auto &x : v) { if (!first) { res += ", "; } first = false; res += to_string(x); }
res += "}"; return res; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H); debug_out(T...); }
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int N;
cin >> N;
VI V(N);
REP(i, N) cin >> V[i];
int idx = 0, b = 0;
ll ans = 0;
REP(i, N) {
while (V[i] & b) {
b ^= V[idx];
idx++;
}
b ^= V[i];
ans += i - idx + 1;
}
cout << ans << endl;
}
|
#include <stack>
#include <cstdio>
using namespace std;
int main(){
int s;
stack<int> stk;
while(~scanf("%d",&s)){
if(s){
stk.push(s);
} else {
printf("%d\n",stk.top());
stk.pop();
}
}
}
| 0
| 82,267,249
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll H,N;cin >> H >> N;
vector<ll> A(N);
vector<ll> B(N);
ll Amax = 0;
for(int i=0;i<N;i++){
cin >> A[i] >> B[i];
Amax = max(Amax,A[i]);
}
ll Ha = H + Amax + 1;
vector<vector<ll>> DP(N+1,vector<ll>(Ha,-1));
DP[0][0] = 0;
for(int i=1;i<=N;i++){
for(int j=0;j<Ha;j++){
DP[i][j] = DP[i-1][j];
if(A[i-1]<=j){
if(DP[i-1][j-A[i-1]]>=0){
if(DP[i][j]>=0){
DP[i][j] = min(DP[i][j],DP[i-1][j-A[i-1]]+B[i-1]);
}else{
DP[i][j] = DP[i-1][j-A[i-1]]+B[i-1];
}
}
if(DP[i][j-A[i-1]]>=0){
if(DP[i][j]>=0){
DP[i][j] = min(DP[i][j],DP[i][j-A[i-1]]+B[i-1]);
}else{
DP[i][j] = DP[i][j-A[i-1]]+B[i-1];
}
}
}
}
}
ll ans = -1;
for(int j=H;j<Ha;j++){
if(DP[N][j]>=0){
if(ans == -1){
ans = DP[N][j];
}else{
ans = min(ans,DP[N][j]);
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
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 ll INF = 1e9+10;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
string s; cin>>s;
ll n=s.size();
char now=s[0];
ll ans=0;
rep(i,n){
if(now!=s[i]){
ans++;
now=s[i];
}
}
cout<<ans<<endl;
}
| 0
| 30,869,290
|
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<int, lint> pil;
typedef pair<lint, int> pli;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
if(b < 0) a *= -1, b *= -1;
return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
if(b < 0) a *= -1, b *= -1;
return a>0 ? (a-1)/b+1 : a/b;
}
constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;
int main(){
string s;
cin >> s;
int n = s.size();
int X[n+1];
X[0] = 0;
rep(i, n) X[i+1] = X[i] ^ (1 << (s[i]-'a'));
int dp[n+1];
fill(dp, dp+n+1, MAX);
dp[0] = 0;
map<int, int> mp;
mp[0] = 0;
For(i, 1, n+1){
if(mp.find(X[i]) != mp.end()) dp[i] = mp[X[i]] + 1;
rep(j, 26){
int t = X[i] ^ 1<<j;
if(mp.find(t) != mp.end()) chmin(dp[i], mp[t] + 1);
}
if(mp.find(X[i]) == mp.end()) mp[X[i]] = dp[i];
else chmin(mp[X[i]], dp[i]);
}
printf("%d\n", dp[n]);
}
|
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,L,R;
string S, T;
const ll MOD = (1e+9) + 7;
const ll INF = 1LL << 60;
typedef pair<ll,ll> P;
typedef vector<P> vp;
typedef vector<vp> matP;
int main() {
cin>>N;
vec a(N);
rep(i,N) cin>>a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
ll last = a[0], count = 1;
S = "Possible";
reps(i,1,N){
if(count < 2 && last != a[i]) S = "Impossible";
if(abs(last - a[i]) > 1) S = "Impossible";
if(last != a[i]){
last = a[i];
count = 1;
}else{
++count;
}
}
if(a[0]%2){
if(last != (a[0]+1)/2 || count != 2) S = "Impossible";
}else{
if(last != a[0]/2 || count != 1) S = "Impossible";
}
cout<<S<<endl;
}
| 0
| 39,452,839
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> l(n);
vector<int> r(n);
for(int i=0;i<n;i++)
cin>>l.at(i)>>r.at(i);
int c=0;
for(int x=1;x<=100000;x++){
for(int i=0;i<n;i++){
if(l.at(i)<=x&&x<=r.at(i)){
c++;
break;
}
}
}
cout<<c<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast ios_base::sync_with_stdio(0);cin.tie(0)
#define X first
#define Y second
#define mx1 10
#define mx2 110
#define mx3 1010
#define mx4 10010
#define mx5 100010
#define mx6 1000010
typedef vector<LL> Vl;
typedef vector<DD> Vd;
typedef vector<bool> Vb;
typedef vector<Vl> VVl;
typedef pair<LL, LL> Pll;
typedef pair<DD, DD> Pdd;
typedef vector<Pll> Vpl;
typedef vector<Pdd> Vpd;
typedef queue<LL> Ql;
typedef stack<LL> Sl;
typedef deque<LL> Dl;
LL _set(LL N, LL pos) {return N = N | (1 << pos);}
LL _reset(LL N, LL pos) {return N = N & ~(1 << pos);}
bool _check(LL N, LL pos) {return (bool)(N & (1 << pos));}
bool _upper(char a) {return a >= 'A' && a <= 'Z';}
bool _lower(char a) {return a >= 'a' && a <= 'z';}
bool _digit(char a) {return a >= '0' && a <= '9';}
LL dx[] = {1, -1, 0, 0, -1, -1, 1, 1};
LL dy[] = {0, 0, 1, -1, -1, 1, -1, 1};
int main()
{
int a, b, k;
cin >> a >> b >> k;
for(int i = 1; i <= k; i++){
if(i % 2)
b += a / 2, a /= 2;
else
a += b / 2, b /= 2;
}
cout << a << ' ' << b << '\n';
return 0;
}
| 0
| 6,758,990
|
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#define rep(i,n) for (int i=0; i < (n); ++i)
using namespace std;
using ll = long long ;
const int INF = 1001001001;
int main() {
int a,b,c ;
cin >> a >> b >> c ;
if(a<b) swap(a,b) ;
if(a<c) swap(a,c) ;
int ans = (a-b)/2 + (a-c)/2 ;
int m = a ;
int m_1 = a + 1 ;
if(3*m%2==(a+b+c)%2)
cout << (3*m-a-b-c)/2 << endl ;
else
cout << (3*(m+1)-a-b-c)/2 << endl ;
return 0 ;
}
|
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {return b ? gcd(b, a%b) : a;}
vector<pair<ll,int>> factorize(ll n) {
vector<pair<ll,int>> res;
for (ll i = 2; i*i <= n; i++) {
if (n%i) continue;
res.emplace_back(i, 0);
while (n%i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1) res.emplace_back(n, 1);
return res;
}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
ll ceil(ll a, ll b) {return (a+b-1)/b;}
const ll INF = LONG_MAX;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(int argc, char* argv[])
{
#ifdef LOCAL
std::ifstream in("in.txt");
std::cin.rdbuf(in.rdbuf());
#endif
char a, b;
cin >> a >> b;
if(a<b) cout << '<';
else if(a==b) cout << '=';
else cout << '>';
return 0;
}
| 0
| 29,844,377
|
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace std;
int main()
{
int n;
string str;
cin >> n >> str;
int ans = 1;
for (int i = 0; i < n - 1; i++)
{
if (str[i] != str[i + 1])
ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
#define rep(i,l,r) for (int i=l,i##end=r;i<=i##end;++i)
#define per(i,r,l) for (int i=r,i##end=l;i>=i##end;--i)
#define rep0(i,r) for (int i=0,i##end=r;i<i##end;++i)
#define pr pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pb push_back
using namespace std;
const int N=1e6+6;
int a[N]; ll s[N];
int main(){
int n,m,v,p; scanf("%d%d%d%d",&n,&m,&v,&p);
rep(i,1,n) scanf("%d",&a[i]);
sort(a+1,a+1+n),reverse(a+1,a+1+n);
rep(i,1,n) s[i]=s[i-1]+a[i];
int ans=p;
rep(i,p+1,n){
int v0=v-(p-1)-(n-i+1);
if (a[p]>a[i]+m) break;
else if (v0<0) ++ans;
else if ((ll)(m+a[i])*(i-p)-(s[i-1]-s[p-1])>=(ll)v0*m) ++ans;
}
cout<<ans<<endl;
return 0;
}
| 0
| 10,636,832
|
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, a, b;
cin >> n >> a >> b;
if (a > b) {
cout << 0;
return 0;
}
if (a == b) {
cout << 1;
return 0;
}
if (n == 1) {
cout << 0;
} else if (n == 2) {
cout << 1;
} else {
cout << 1LL * (n - 2) * (b - a) + 1;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,k;
int count_bk=0,ans=0;
cin >> h >> w >> k;
vector<vector<char>>c(h+1,vector<char>(w+1));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> c.at(i).at(j);
if(c.at(i).at(j) == '#'){
count_bk++;
}
}
}
for(int i=0;i<(1<<h);i++){
for(int j=0;j<(1<<w);j++){
int temp=count_bk;
for(int x=0;x<h;x++){
for(int y=0;y<w;y++){
if(i&(1<<x) || j&(1<<y)){
if(c.at(x).at(y)=='#'){
temp--;
}
}
}
}
if(temp == k){
ans++;
}
}
}
cout << ans << endl;
}
| 0
| 85,475,610
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
string in;
char list[9][6]={
{'.',',','!','?',' ','/'},
{'a','b','c','/','/','/'},
{'d','e','f','/','/','/'},
{'g','h','i','/','/','/'},
{'j','k','l','/','/','/'},
{'m','n','o','/','/','/'},
{'p','q','r','s','/','/'},
{'t','u','v','/','/','/'},
{'w','x','y','z','/','/'}
};
int x=-1,y=-1;
cin >>N;
for(int i=0 ; i < N ; i++){
cin >>in;
for(int j=0 ; j < (int)in.size() ; j++){
char in_one=in[j];
int num=atoi(&in_one);
if(num == 0){
if(y != -1)cout <<list[y][x];
y=-1;
x=-1;
}else{
x++;
if(list[y][x] == '/')x=0;
y=num-1;
}
}
cout <<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define INF 1e9
#define DEBUG(x) cout<<"debug: "<<x<<endl
int n, m;
vector<int> graph[100010];
int main() {
cin >> n >> m;
vector<int> h(n);
rep(i, 0, n) cin >> h[i];
rep(i, 0, m){
int a, b; cin >> a >> b;
a--;b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
int ans = 0;
rep(i, 0, n){
int nh = h[i];
int maxh = 0;
for(auto x : graph[i]){
maxh = max(maxh, h[x]);
}
if(nh > maxh) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 77,079,438
|
#include<stdio.h>
int main()
{
int N,A;
scanf("%d %d",&N,&A);
N=N * N;
A=N-A;
printf("%d",A);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define eb emplace_back
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll unsigned long long int
#define test int t;cin>>t; while(t--)
#define um unordered_map
#define en '\n'
#define us unordered_set
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<char, char> pcc;
typedef vector<pii> vii;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define INF (1e18+5)
#define inf (1e9+5)
#define mod 1000000007
vi adj[123456];
bool vis[123456];
int parent[123456];
void dfs(int u, int p)
{
vis[u] = true;
for (int x : adj[u])
{
if (!vis[x])
{
dfs(x, u);
}
}
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if (fopen("input.txt", "r"))
{
freopen ("input.txt" , "r" , stdin);
freopen ("output.txt" , "w" , stdout);
}
#endif
int n, m;
cin >> n >> m;
zip(i, 0, m)
{
int a, b;
cin >> a >> b;
adj[a].pb(b);
adj[b].pb(a);
}
queue<int>q;
q.push(1);
while (!q.empty())
{
int node = q.front();
q.pop();
for (auto it : adj[node])
{
if (!vis[it])
{
vis[it] = true;
parent[it] = node;
q.push(it);
}
}
}
cout << "Yes" << en;
rep(i, 2, n)
{
cout << parent[i] << en;
}
return 0;
}
| 0
| 37,298,704
|
#include <iostream>
using namespace std;
int main(){
char k;
cin >> k;
if(islower(k)){
cout << "a" << endl;
}
else{
cout << "A" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 1; i < (n); ++i )
typedef std::pair<int,int> pint;
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N;
string str; cin >> str;
string ans;
char tmp;
tmp = str[0];
ans[0] = tmp;
rep (i,str.length()){
if (str[i] == tmp){
continue;
}
else{
tmp = str[i];
ans += tmp;
}
}
cout << ans.length() + 1 << endl;
return 0;
}
| 0
| 47,876,501
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
ll MOD = 1000000007;
ll INF = 200000000000000000;
double EPS = 1e-12;
double PI = 3.141592653589793238;
template<typename T>
void remove(std::vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}
using Graph = vector<vector<ll>>;
int main(){
ll A,B,C;
cin >> A >> B >> C;
if(A != B || B != C || A != C){
cout << "No" << endl;
}else{
cout << "Yes" << endl;
}
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
ll fac[MAX], finv[MAX], inv[MAX];
void nCrprep() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCr(ll n, ll r){
if (n < r) return 0;
if (n < 0 || r < 0) return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
ll nCrcheep(ll n,ll r){
if(r == 0) return 1;
else if(r == 1) return n;
else return nCrcheep(n-1,r-1)*n/r;
}
vector<pair<ll,ll>> prime_factorize(ll n){
vector<pair<ll,ll>> res;
for(ll i=2; i*i <= n; i++){
if(n % i != 0) continue;
ll ex = 0;
while(n % i == 0){
ex++;
n /= i;
}
res.push_back({i,ex});
}
if(n != 1) res.push_back({n,1});
return res;
}
int main(){
ll n,a,b; cin >> n >> a >> b;
vl num(3);
rep(i,n){
ll x; cin >> x;
if(x <= a) num[0]++;
else if(b+1 <= x) num[2]++;
else num[1]++;
}
cout << min({num[0],num[1],num[2]}) << endl;
}
| 0
| 89,942,846
|
#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
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
#include <boost/rational.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using boost::rational;
using boost::multiprecision::cpp_int;
const double PI = acos(-1);
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;};
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;
}
const int MAX = 15001000;
bool IsPrime[MAX];
int MinFactor[MAX];
vector<int> preprocess(int n = MAX) {
vector<int> res;
for (int i = 0; i < n; ++i) IsPrime[i] = true, MinFactor[i] = -1;
IsPrime[0] = false; IsPrime[1] = false;
MinFactor[0] = 0; MinFactor[1] = 1;
for (int i = 2; i < n; ++i) {
if (IsPrime[i]) {
MinFactor[i] = i;
res.push_back(i);
for (int j = i*2; j < n; j += i) {
IsPrime[j] = false;
if (MinFactor[j] == -1) MinFactor[j] = i;
}
}
}
return res;
}
vector<pair<int,int> > prime_factor(int n) {
vector<pair<int,int> > res;
while (n != 1) {
int prime = MinFactor[n];
int exp = 0;
while (MinFactor[n] == prime) {
++exp;
n /= prime;
}
res.push_back(make_pair(prime, exp));
}
return res;
}
template<typename T>
T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>
T ngcd(vector<T> a){
T res;
res = a[0];
for(int i = 1; i < a.size() && res != 1; i++) {
res = gcd(a[i], res);
}
return res;
}
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
map<ll, ll> mp;
ll check = ngcd(a);
preprocess();
bool flag = true;
rep(i, n){
auto p = prime_factor(a[i]);
for(auto a : p){
if(mp[a.fs]){
flag = false;
break;
}
mp[a.fs]++;
}
}
if(flag) print("pairwise coprime");
else if(check == 1) print("setwise coprime");
else print("not coprime");
}
|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define MAXN 300003
#define MOD 1000000007
#define oo (1<<20)
#define mid ((a+b)/2)
#define pb push_back
#define sz size()
#define fastCpp() ios_base::sync_with_stdio( false ), cin.tie( NULL ), cout.tie( NULL )
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector <int> vi;
struct Data{
int n1, n2;
Data(int n1 = 0, int n2 = 0):n1(n1),n2(n2){}
}dp[MAXN];
int N, M, ans;
int main(){
#ifndef ONLINE_JUDGE
#endif
fastCpp();
scanf( "%d", &N );
M = (1<<N);
for ( int i = 0; i < M; ++i )
scanf( "%d", &dp[i].n1 );
for ( int i = N-1; i >= 0; --i ){
for ( int j = M-1, nxt; j > 0; --j ){
nxt = j-(j&(1<<i));
if ( nxt < j ){
if ( dp[nxt].n1 > dp[j].n1 )
dp[j].n2 = dp[j].n1, dp[j].n1 = dp[nxt].n1;
else
dp[j].n2 = max( dp[j].n2, dp[nxt].n1 );
}
}
}
for ( int i = 1, ans = 0; i < M; ++i ){
ans = max( ans, dp[i].n1+dp[i].n2 );
printf( "%d\n", ans );
}
return 0;
}
| 0
| 47,217,338
|
#include <iostream>
using namespace std;
int main (void) {
char a, b;
cin >> a >> b;
if (a == b) {
cout << 'H' << endl;
}else{
cout << 'D' << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int x, n;
cin >> x >> n;
set<long> p;
for (long i = 0; i < n; i++) {
long tmp;
cin >> tmp;
p.insert(tmp);
}
long i = 0;
while (true) {
if (p.count(x - i) == 0) {
cout << x - i << endl;
return 0;
}
if (p.count(x + i) == 0) {
cout << x + i << endl;
return 0;
}
i++;
}
}
| 0
| 78,480,189
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
int n;
cin >> n;
int il(0), ir(n);
string l, r, curr;
cout << 0 << endl;
cin >> curr;
r = l = curr;
if (l == "Vacant")
return 0;
for (int i = 0; i < 20; ++i) {
int mid = (il + ir) / 2;
cout << mid << endl;
cin >> curr;
if (curr == "Vacant")
return 0;
if ((curr != l && (mid - il) % 2 == 0) || (curr == l && (mid - il) % 2 == 1)) {
ir = mid;
r = curr;
} else if ((curr != r && (ir - mid) % 2 == 0) || (curr == r && (ir - mid) % 2 == 1)) {
il = mid;
l = curr;
}
}
return 0;
}
|
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ff first
#define ss second
#define eps 1e-10
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a*b)/gcd(a,b))
void solve();
char a[10][10];
char b[10][10];
int n,m,k;
void copy()
{
int i,j;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
b[i][j]=a[i][j];
}
}
}
bool check()
{
int black=0,i,j;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(b[i][j]=='#')
{
black++;
}
}
}
return (black==k);
}
void color(int i,int j)
{
for(int x=0;x<n;x++)
{
if(i&(1<<x))
{
for(int y=0;y<m;y++)
{
b[x][y]='R';
}
}
}
for(int x=0;x<m;x++)
{
if(j&(1<<x))
{
for(int y=0;y<n;y++)
{
b[y][x]='R';
}
}
}
}
int32_t main()
{
#ifdef DEBUG
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fast
int t = 1;
while(t--)
solve();
return 0;
}
void solve()
{
int i,j;
cin>>n>>m>>k;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cin>>a[i][j];
}
}
int cnt=0;
for(i=0;i<(1LL<<n);i++)
{
for(j=0;j<(1LL<<m);j++)
{
copy();
color(i,j);
if(check())
{
d(i,j);
cnt++;
}
}
}
cout<<cnt<<endl;
}
| 0
| 58,442,919
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e6;
int d[MAXN+1];
bool prime[MAXN+1];
int n;
void sieve(){
memset(prime,true,sizeof(prime));
for(int p=2; p*p<=MAXN; p++){
if(prime[p]){
for(int i=p*p; i<=MAXN; i+=p){
prime[i] = false;
d[i] = p;
}
}
}
d[1]=1;
for(int i=2; i<=MAXN; i++) if(prime[i]) d[i] = i;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
int a[n]; for(int i=0; i<n; i++) cin >> a[i];
int b[n]; for(int i=0; i<n; i++) b[i] = a[i];
sieve();
bool pairwise = true;
map<int,int> m;
for(int i=0; i<n; i++){
set<int> s;
while(a[i]>1){
s.insert(d[a[i]]);
a[i]/=d[a[i]];
}
for(auto& a : s){
m[a]++;
if(m[a]>1){
pairwise = false;
break;
}
}
if(!pairwise) break;
}
if(pairwise) cout << "pairwise coprime" << endl;
else{
int curr = gcd(b[0],b[1]);
for(int i=2; i<n; i++){
curr = gcd(curr,b[i]);
}
if(curr==1) cout << "setwise coprime" << endl;
else cout << "not coprime" << endl;
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define INF 1e9
#define pb push_back
#define mp make_pair
#define loop(a,n) for(long long i=a;i<n;i++)
#define vil vector<long long int>
#define vi vector<int>
#define sz(v) v.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
using namespace std;
ll gcd(ll a, ll b) {
if (a == 0)return b;
return gcd(b % a, a);
}
bool isperfect(ll n) {
ll y = sqrt(n);
if (n % y == 0 && y * y == n)return true;
return false;
}
bool comp(pair<int,int> a, pair<int,int> b) {
if(a.first == b.first) return a.second>b.second;
return a.first < b.first;
}
ll powi(ll a, ll b) {
ll ans = 1;
while (b > 0) {
if (b & 1)ans = (ans * a);
b = b >> 1;
a = (a * a);
}
return ans;
}
bool isprime(ll n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)return false;
}
return true;
}
bool prime[10000000];
void seive() {
prime[1] = true;
for (int i = 2; i * i < 10000000; i++) {
if (prime[i])continue;
for (int j = i * i; j < 10000000; j += i) {
prime[j] = true;
}
}
}
#define mod 1000000007
ll fun(ll n,ll k){
ll res;
res=((n-k+1)%mod)*(k%mod);
res=(res+1)%mod;
return res;
}
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n,k;
ll ans=0;
cin>>n>>k;
for(int i=k;i<=n+1;i++){
ans=(ans+fun(n,i))%mod;
}
cout<<ans;
}
| 0
| 10,736,607
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> V;
#define rep(cnt,e) for(ll cnt=0;cnt<e;cnt++ )
typedef pair<ll,ll> P;
const ll mod = 1e9+7;
const ll INF = INT64_MAX;
ll i,j,k;
int main(){
ll x;
cin>>x;
if(x<1200)cout<<"ABC"<<endl;
else cout<<"ARC"<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
const int N = 1e5;
int fact[N + 69], ifact[N + 69], pos[N + 69];
int n;
pair<int, int> lol;
int C(int x, int y) {
if(x < 0 || y < 0 || x < y)
return 0;
int ret = 1;
ret = (1LL * ret * fact[x]) % MOD;
ret = (1LL * ret * ifact[y]) % MOD;
ret = (1LL * ret * ifact[x - y]) % MOD;
return ret;
}
int calc(int x) {
int ret = 0, q = lol.first, p = lol.second;
ret = (1LL * ret + C(n - 1, x)) % MOD;
cerr << ret << '\n';
ret = (1LL * ret + 2LL * C(n - 1, x - 1)) % MOD;
cerr << ret << '\n';
ret = (1LL * ret - C(n - q + p, x - 1)) % MOD;
cerr << ret << '\n';
ret = (1LL * ret + C(n - 1, x - 2)) % MOD;
if(ret < 0)
ret += MOD;
cerr << ret << '\n';
return ret;
}
int modpow(int a, int b) {
int ret = 1;
while(b) {
if(b & 1) ret = (1LL * ret * a) % MOD;
a = (1LL * a * a) % MOD;
b >>= 1;
}
return ret;
}
int inv(int a) {
return modpow(a, MOD - 2);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
fact[0] = 1;
for(int i = 1; i <= N; i++) {
fact[i] = (1LL * i * fact[i - 1]) % MOD;
}
ifact[N] = inv(fact[N]);
for(int i = N - 1; i >= 0; i--) {
ifact[i] = (1LL * (i + 1) * ifact[i + 1]) % MOD;
}
cin >> n;
for(int i = 1; i <= n + 1; i++) {
int x;
cin >> x;
if(!pos[x])
pos[x] = i;
else
lol = make_pair(i, pos[x]);
}
for(int i = 1; i <= n + 1; i++) {
cout << calc(i) << '\n';
}
return 0;
}
| 0
| 64,496,298
|
#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);
static const int INF = 1e9+7;
int main(){
int a, b;
char op;
cin >> a >> op >> b;
if(op == '+') cout << a+b << endl;
else cout << a-b << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define lop(i,n) for(ll i=0;i<n;i++)
#define lop1(i,n) for(ll i=1;i<=n;i++)
#define lopr(i,n) for(ll i=n-1;i>=0;i--)
#define ll long long int
#define pb push_back
#define all(v) v.begin(),v.end()
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '\n'
#define F first
#define S second
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define pii pair<int,int>
#define pll pair<ll,ll>
#define LCM(a,b) (a*b)/__gcd(a,b)
#define mii map<int,int>
#define mll map<ll,ll>
#define ub upper_bound
#define lb lower_bound
#define sz(x) (ll)x.size()
#define ld long double
#define pcnt(x) __builtin_popcountll(x)
const long long I1=1e9;
const long long I2=1e18;
const int32_t M1=1e9+7;
const int32_t M2=998244353;
template<typename T,typename T1>T maxn(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T minn(T &a,T1 b){if(b<a)a=b;return a;}
ll dp[105][100005];
void add(ll &a,ll b)
{
(a+=b)%=M1;
}
void solve()
{
ll n,k;
cin>>n>>k;
lop1(i,k+1) dp[0][i]=1;
lop1(i,n)
{
ll val;
cin>>val;
lop(used,k+1){
add(dp[i][used+1],dp[i-1][used+1]-dp[i-1][used-min(used,val)]+dp[i][used]);
}
}
cout<<(dp[n][k+1]-dp[n][k]+M1)%M1<<endl;
}
signed main()
{
IOS;
#ifdef MODULO
initialize();
#endif
#ifdef SIEVE
sieve();
#endif
int testcase=1;
while(testcase--) solve();
return 0;
}
| 0
| 61,970,496
|
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector
#define pb push_back
#define ff first
#define ss second
using namespace std;
int main()
{
ll n,m,i,a=0,b=0,k,t,j;
cin>>a>>b;
if(a+b==3) cout<<"3";
else if(a+b==4) cout<<"2";
else cout<<"1";
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e) cerr<<#a<<": "<<a<<" | "<<#b<< ": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl
#define cases int testcases;cin>>testcases; while(testcases--)
const int N = 200005;
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
int d,t,s;
cin>>d>>t>>s;
if(s*t>=d)
cout<<"Yes \n";
else
cout<<"No \n";
return 0;
}
| 0
| 93,502,798
|
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
map<char, int> a;
for(int i = 0; i < s.size(); i++){
a[s[i]]++;
if(a[s[i]] > 1){
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long fact(int n);
int main ()
{
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
}
long long fact(int n)
{
if(n == 1) return 1;
else if(n == 0) return 0;
return (n * fact(n - 1));
}
| 0
| 61,908,713
|
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
const int INF = 1<<30;
int main(){
int n, k;cin>>n>>k;
vector<P> sushi(n);
rep(i, n){
int t, d;cin>>t>>d;
sushi[i]=P(d, --t);
}
sort(sushi.begin(), sushi.end(), greater<P>());
vector<bool> include(n, false);
vector<int> selected;
ll kind=0LL;
ll sum=0LL;
rep(i, k){
P p=sushi[i];
if(!include[p.second]){
include[p.second]=true;
kind++;
}else{
selected.push_back(p.first);
}
sum += p.first;
}
sort(selected.begin(), selected.end(), greater<int>());
ll ans=sum+kind*kind;
ll id=(ll)kind;
while(!selected.empty() && id<n){
if(include[sushi[id].second]){id++;continue;}
include[sushi[id].second] = true;
sum -= selected.back();selected.pop_back();
sum += sushi[id].first;
id++;kind++;
ans = max(ans, sum+kind*kind);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int> > v(n+1, vector<int>(n+1, 0));
int a, b;
rep(i, m){
cin >> a >> b;
v[a][b] = 1;
}
vector<int> p(n);
rep(i, n) p[i] = i + 1;
int ans = 0;
do {
bool f = true;
rep(i, n-1){
if (v[p[i]][p[i+1]] == 0 &&
v[p[i+1]][p[i]] == 0){
f = false;
break;
}
}
if (f == true) ans++;
} while (next_permutation(p.begin()+1, p.end()));
cout << ans << endl;
return 0;
}
| 0
| 66,559,870
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int n;
int coins[] = {500, 100, 50, 10, 5};
while (cin >> n, n) {
int ans = 0;
int m = 1000 - n;
rep(i, 5) {
ans += m / coins[i];
m %= coins[i];
}
ans += m;
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
typedef long long ll;
ll n, k;
ll a[200005];
ll b[200005];
map<ll, ll> ma;
ll ans;
int main()
{
scanf("%lld%lld", &n, &k);
ma[0]++;
for(ll i = 1; i <= n; i++)
{
scanf("%lld", &a[i]);
a[i]--;
b[i] = b[i - 1] + a[i];
ma[b[i] % k]++;
if(i >= k) ma[b[i - k] % k]--;
ans += ma[b[i] % k] - 1;
}
printf("%lld\n", ans);
return 0;
}
| 0
| 28,445,636
|
#include <algorithm>
#include <assert.h>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define fre freopen("0.in", "r", stdin), freopen("0.out", "w", stdout)
#define abs(x) ((x) > 0 ? (x) : -(x))
#define MOD 1000000007
#define LL signed long long int
#define ps(x) push_back(x)
#define scan(x) scanf("%d", &x)
#define print(x) printf("%d\n", x)
#define scanll(x) scanf("%lld", &x)
#define printll(x) printf("%lld\n", x)
#define boost ios_base::sync_with_stdio(0)
int main() {
int N;
string S;
cin >> N >> S;
int R = 0;
LL ans = 1;
for (int i = 2 * N - 1; i >= 0; i--) {
char deb = 'R';
if (S[i] == 'B') {
if (R % 2 == 1) {
deb = 'L';
ans *= R;
R--;
} else {
R++;
}
} else {
if (R % 2 == 1) {
++R;
} else {
deb = 'L';
ans *= R;
--R;
}
}
if (R < 0) {
cout << 0;
return 0;
}
ans %= MOD;
}
if (R != 0) {
cout << 0;
return 0;
}
for (int i = 1; i <= N; ++i) {
ans = ans * i % MOD;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
string s;cin>>s;
for(int i=0;i<s.size();i++) {
if(s[i]=='B') {
if(i>0) {
s.erase(i-1, 2);
i-=2;
} else {
s.erase(i, 1);
i--;
}
}
}
cout<<s<<"\n";
}
| 0
| 55,940,273
|
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<char>> A(N, vector<char>(N)), B(M, vector<char>(M));
rep(i, N) rep(j, N) cin >> A[i][j];
rep(i, M) rep(j, M) cin >> B[i][j];
for (int i = 0; i + M <= N; ++i) for (int j = 0; j + M <= N; ++j) {
bool judge = true;
rep(k, M) rep(l, M) {
if (A[i + k][j + l] != B[k][l]) judge = false;
}
if (judge) {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
string S;
cin >> S;
bool a = false;
bool b = false;
bool c = false;
rep(i, S.size()) {
switch(S[i]) {
case 'a':
a = true;
break;
case 'b':
b = true;
break;
case 'c':
c = true;
break;
}
}
if (a && b && c) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0
| 61,344,121
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.