code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <iostream>
#include <vector>
#include <algorithm>
#include <list>
#include <iomanip>
#include <string>
#include <cctype>
#include <cstdio>
#include <cmath>
using namespace std;
int main(){
using ll=long long;
ll A,B,K;
cin>>A>>B>>K;
if(A>=K)
cout<<A-K<<" "<<B<<endl;
else if(B-K+A<0)
cout<<"0"<<" "<<"0"<<endl;
else
cout<<"0"<<" "<<B-K+A<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
typedef pair<int, int> P;
int main() {
int n;
cin>>n;
vector<int> v(n);
rep(i,n){
cin>>v[i];
}
vector<P> ki(100001);
vector<P> gu(100001);
rep(i,100001){
ki[i].second=i;
gu[i].second=i;
}
int ki_co=0;
int gu_co=0;
for(int i=0; i<n; i+=2){
ki[v[i]].first-=1;
ki_co++;
}
for(int i=1; i<n; i+=2){
gu[v[i]].first-=1;
gu_co++;
}
sort(ki.begin(),ki.end());
sort(gu.begin(),gu.end());
if(ki[0].first==gu[0].first && ki[0].second==gu[0].second){
if(ki[1].first<=gu[1].first){
cout<<ki_co+ki[1].first+gu_co+gu[0].first<<endl;
}
else{
cout<<ki_co+ki[0].first+gu_co+gu[1].first<<endl;
}
}
else{
cout<<ki_co+ki[0].first+gu_co+gu[0].first<<endl;
}
}
| 0
| 45,261,328
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) a.begin(), a.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
typedef long long ll;
int main(){
int W, H;
cin >> W >> H;
vector<pair<ll, int>> vec(W + H);
rep(i, W){
cin >> vec[i].first;
vec[i].second = 1;
}
rep(i, H){
cin >> vec[i + W].first;
vec[i + W].second = -1;
}
sort(all(vec));
ll vert = H + 1, side = W + 1;
ll ans = 0;
rep(i, W + H){
if(vec[i].second == 1){
ans += vec[i].first * vert;
side--;
} else {
ans += vec[i].first * side;
vert--;
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
int x[n];
int max_x=0;
rep(i, n){
cin >> x[i];
max_x=max(max_x, x[i]);
}
ll ans=1e9;
rep(i, max_x){
ll sum=0;
rep(j, n){
sum+=pow(x[j]-(i+1), 2);
}
ans=min(ans, sum);
}
cout<<ans<<endl;
return 0;
}
| 0
| 97,124,630
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
ll a;
string b;
cin >> a >> b;
ll b_sub = (b[0] - '0') * 100 + (b[2] - '0') * 10 + (b[3] - '0');
cout << a * b_sub / 100 << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<char>());
bool ans = false;
if (s < t)
ans = true;
if (ans)
cout << "Yes" << '\n';
else
cout << "No" << '\n';
return 0;
}
| 0
| 25,983,924
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
if(n%2==1){
cout << "0" << "\n";
return 0;
}
ll cnt=0;
ll div=10;
while(div<=n) {
ll tmp=n/div;
cnt+=tmp;
div*=5;
}
cout << cnt << "\n";
return 0;
}
| 0
| 23,738,227
|
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
}
void ran() {
srand(chrono::steady_clock::now().time_since_epoch().count());
}
long long get_rand() {
long long a = rand();
long long b = rand();
return a * (RAND_MAX + 1ll) + b;
}
void usaco() {
freopen("problem.in", "r", stdin);
freopen("problem.out", "w", stdout);
}
const int MXN = 100005;
vector<int> adj[MXN];
int dist[MXN];
int par[MXN];
signed main() {
ran(); fast();
int n, m;
cin >> n >> m;
for (int i=0; i<m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for (int i=0; i<MXN; i++) dist[i] = INT_MAX;
queue<pair<int, int>> proc;
proc.push({1, 0});
while (!proc.empty()) {
auto x = proc.front(); proc.pop();
int no = x.first, di = x.second;
if (dist[no] < di) continue;
dist[no] = di;
for (auto x: adj[no]) {
int ot = x;
if (dist[ot] > di + 1) {
dist[ot] = di + 1;
par[ot] = no;
proc.push({ot, di+1});
}
}
}
for (int i=1; i<=n; i++) {
if (dist[i] == INT_MAX) {
cout << "No" << endl;
exit(0);
}
}
cout << "Yes" << endl;
for (int i=2; i<=n; i++) {
cout << par[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> lis;
vector<int> v;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v.push_back(a);
}
for (auto a: v) {
auto it = lower_bound(lis.begin(), lis.end(), a);
if (it != lis.end()) {
*it = a;
} else {
lis.push_back(a);
}
}
cout << lis.size() << endl;
}
| 0
| 60,058,368
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long N, X, M;
cin >> N >> X >> M;
long long ans = 0;
if( X == 0 ) {
cout << ans << endl;
return 0;
}
if( X == 1 ) {
ans = N;
cout << ans << endl;
return 0;
}
long long A = X;
long long a = -1;
long long b = -1;
long long sta;
long long suma = X;
long long sumb;
set<long long> st;
for( long long i = 1; i <= N; i++ ) {
ans += A;
A = A * A % M;
if( a < 0 ) {
if( st.count( A ) ) {
a = i;
sta = A;
sumb = A;
}
else suma += A;
st.insert( A );
}
else if( b < 0 ) {
if( A == sta ) {
b = i;
break;
}
else sumb += A;
}
}
if( a < 0 || b < 0 ) {
cout << ans << endl;
return 0;
}
long long n = N - a;
long long c = b - a;
long long d = n / c;
n = a + c * d + 1;
ans = suma + sumb * d;
A = sta;
for( long long i = n; i <= N; i++ ) {
ans += A;
A = A * A % M;
}
cout << ans << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
for(int i=1;i<=3;i++){
if(i!=a && i!=b){
cout<<i;
return 0;
}
}
return 0;
}
| 0
| 47,223,106
|
#include <iostream>
#include <vector>
#include <deque>
#include <cmath>
#include <map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include "iomanip"
using namespace std;
#include <cstdio>
#include <cstring>
int main() {
int n, m, count = 0, res = 0;
cin >> n >> m;
for (int i = 1; i <= n ; ++i) {
count++;
if (count == m){
res++;
count = 0;
i -= (m - 1);
}
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=k ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i,j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(),_a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#ifdef tmd
#define TIME(i) Timer i(#i)
#define debug(...) do{\
fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
_do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
_s<<"{";
for(It _it=_ita;_it!=_itb;_it++)
{
_s<<(_it==_ita?"":",")<<*_it;
}
_s<<"}";
return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,deque<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif
class Timer {
private:
string scope_name;
chrono::high_resolution_clock::time_point start_time;
public:
Timer (string name) : scope_name(name) {
start_time = chrono::high_resolution_clock::now();
}
~Timer () {
auto stop_time = chrono::high_resolution_clock::now();
auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
double mlength = double(length) * 0.001;
debug(scope_name, mlength);
}
};
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int iNF = 0x3f3f3f3f;
const ll MAXN = 100005;
const ll MAXLG = __lg(MAXN) + 3;
int n, x[MAXN], l, q, nxt[MAXLG][MAXN];
int main()
{
TIME(main);
IOS();
cin >> n;
REP (i, n) {
cin >> x[i];
}
cin >> l >> q;
int rgt = 0;
REP (i, n) {
while (rgt < n-1 && x[rgt+1] - x[i] <= l) {
rgt++;
}
nxt[0][i] = rgt;
}
REP1 (i, MAXLG - 1) {
REP (j, n) {
nxt[i][j] = nxt[i-1][nxt[i-1][j]];
}
}
while (q--) {
int a, b;
cin >> a >> b;
if (a > b) {
swap(a, b);
}
a--, b--;
int ans = 0;
RREP (i, MAXLG - 1) {
if (nxt[i][a] < b) {
ans += 1<<i;
a = nxt[i][a];
}
}
cout << ans + 1 << endl;
}
return 0;
}
| 0
| 52,251,682
|
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
#define INF 1 << 30
int f[4][5];
int main() {
ll S;
ll a, b, c, d;
cin >> S;
if (S == 1e18) {
a = d = 1e9;
b = c = 0;
}
else {
a = d = (ll)sqrt(S) + 1;
b = a * d - S, c = 1;
}
printf("0 0 %lld %lld %lld %lld\n", a, b, c, d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long inf = 1e18;
int n, r;
long a[300];
long b[300];
long dp[300][300][300];
long dq[300][300][300];
long dr[300][300][300];
void modify(int i) {
for (int j = 0; j < n; ++j) {
long q = inf;
for (int k = n - 1; k >= 0; --k) {
q = min(q, dp[i][j][k]);
dq[i][j][k] = q;
}
long r = inf;
for (int k = 0; k < n; ++k) {
dr[i][j][k] = r;
r = min(r, dp[i][j][k] - b[k]);
}
}
}
int main() {
cin >> n >> r;
if (n == r) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < n; ++i) b[i] = a[i];
sort(b, b + n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= r; ++j) {
for (int k = 0; k < n; ++k) {
dp[i][j][k] = inf;
if (i == 0 && j == (b[k] != a[0])) {
dp[i][j][k] = b[k];
}
}
}
}
modify(0);
for (int i = 1; i < n; ++i) {
for (int j = 0; j <= r; ++j) {
for (int k = 0; k < n; ++k) {
int pj = b[k] == a[i] ? j : j - 1;
if (pj < 0) continue;
dp[i][j][k] =
min(dp[i][j][k],
min(dq[i - 1][pj][k], b[k] + dr[i - 1][pj][k]));
}
}
modify(i);
}
long mn = inf;
for (int j = 0; j <= r; ++j) {
for (int k = 0; k < n; ++k) {
mn = min(mn, dp[n - 1][j][k]);
}
}
cout << mn << endl;
}
| 0
| 39,072,632
|
#include <iostream>
#include <map>
#include <vector>
#define int long long
typedef long long ll;
using namespace std;
ll N, A, B, C, Len[8], minmp=10000000000;
void dfs(ll id, ll v[8]){
if(id==N-1) {
ll abc[4]={0}, abclen[4]={0};
for(int i=0;i<=id;i++) {
abc[v[i]]++;
abclen[v[i]] += Len[i];
}
if(abc[1]*abc[2]*abc[3]==0) return;
ll mp = (abc[1]+abc[2]+abc[3]-3)*10;
mp += abs(A-abclen[1]) + abs(B-abclen[2]) + abs(C-abclen[3]);
minmp = min(mp, minmp);
return;
}
v[id+1] = 0;
dfs(id+1, v);
v[id+1] = 1;
dfs(id+1, v);
v[id+1] = 2;
dfs(id+1, v);
v[id+1] = 3;
dfs(id+1, v);
}
signed main(){
cin >> N >> A >> B >> C;
for(int i=0;i<N;i++) cin >> Len[i];
ll vinit[8]={0};
dfs(-1, vinit);
cout << minmp << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<62;
const LL INF=1<<17;
int main(){
int N;cin >> N;
if(N==1){
puts("Yes");
puts("2");
cout << "1 1" << endl;
cout << "1 1" << endl;
return 0;
}
LL s=0;
for(LL i=1;i<=N;i++){
if(i*(i-1)==2*N){
s=i;
break;
}
}
if(s==0){
puts("No");
return 0;
}
int ans[s][s-1];
int a=1;
for (int i = 0; i < s; i++) {
for (int j = i; j < s-1; j++) {
ans[i][j]=a++;
}
a-=s-i-2;
for (int j = i+1; j < s-1; j++) {
ans[j][i]=a++;
}
}
for (int i = 0; i < s-1; i++) {
ans[s-1][i]=ans[i][i];
}
puts("Yes");
cout << s << endl;
for (int i = 0; i < s; i++) {
cout << s-1 << " ";
for (int j = 0; j < s-1; j++) {
cout << ans[i][j] << (j==s-2?"\n":" ");
}
}
return 0;
}
| 0
| 45,897,150
|
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
while(cin >> n,n!=0){
int max;
int min=1005;
int sum = 0;
max = 0;
int x;
for(int i = 0;i < n;i = i+1){
cin >> x;
sum = sum + x;
if(x > max){
max = x;}
if(x<min)
min = x;
}
cout << (sum-min-max)/(n-2)<< endl;}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
set<int> se;
for(int i = 0; i < n; i += 2){
se.insert(a.at(i));
}
sort(ALL(a));
int ans = 0;
for(int i = 0; i < n; i += 2){
if(se.find(a.at(i)) == se.end()) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 83,834,824
|
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll>P;
#define INF 10e16
#define MOD 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define fi first
#define se second
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define PI acos(-1.0)
long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
ll cmp(pair<ll,string>a,pair<ll,string> b){
if(a.fi!=b.fi)
return a.fi<b.fi;
else
return a.se<b.se;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll m,n=0,s=0;
cin>>m;
for(ll i=0;i<m;i++){
ll d,c;
cin>>d>>c;
n+=c;
s+=d*c;
}
ll ans=n-1+(s-1)/9;
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll m = 0;
cin >> m;
vector<ll> v(1e6 + 5, 0);
ll n = m;
while(n % 2 == 0) {
n = n/2;
v[2]++;
}
for(int i = 3; i < sqrt(m); i+= 2) {
while(n % i == 0) {
n = n /i;
v[i]++;
}
}
ll ans = 0;
for(int i = 0; i < v.size(); i++) {
if(v[i] != 0) {
int temp = 1;
while(v[i] - temp >= 0) {
v[i] -= temp;
temp++;
ans++;
}
}
}
if(n > 2) ans++;
cout << ans << endl;
return 0;
}
| 0
| 80,743,352
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, z, x, y;
cin >> n;
z = n/15;
x = n*800;
y = z*200;
cout << x - y << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#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 N, M, K;
cin >> N >> M >> K;
repi(i, N) {
repi(j, M) {
ll temp = i * (M - j) + j * (N - i);
if(temp == K) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
}
| 0
| 84,241,055
|
#include<iostream>
using namespace std;
#define loop(i,a,b) for(int i = a ; i< b ; i ++)
int main(void){
int d;
while(cin>>d){
long long int sum =0;
loop(i,1,600/d)
sum+=i*i*d*d*d;
cout<<sum<<endl;
}
return 0;
}
|
#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++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int a,b,c; cin>>a>>b>>c;
if (a+b>=c){
cout<<"Yes\n";
}else{
cout<<"No\n";
}
return 0;
}
| 0
| 49,730,754
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a, ans;
cin >> a;
ans = (1 + a) * a / 2;
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <list>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
#define ll long long
using namespace std;
const int MAX = 10000;
enum Color {
WHITE = 0,
GRAY = 1,
BLACK = 2,
};
vector<int> adj[MAX + 10];
Color color[MAX + 10];
int indeg[MAX + 10] = {};
list<int> out;
void bfs(int s) {
queue<int> Q;
Q.push(s);
color[s] = GRAY;
while (!Q.empty()) {
int u = Q.front(); Q.pop();
out.push_back(u);
rep(i, adj[u].size()) {
int v = adj[u][i];
--indeg[v];
if (indeg[v] == 0 && color[v] == WHITE) {
color[v] = GRAY;
Q.push(v);
}
}
}
}
void topologicalSort(int V) {
rep(i, V) color[i] = WHITE;
rep(u, V) {
if (indeg[u] == 0 && color[u] == WHITE) bfs(u);
}
}
int main() {
int V, E;
cin >> V >> E;
rep(i, E) {
int s, t;
cin >> s >> t;
adj[s].push_back(t);
++indeg[t];
}
topologicalSort(V);
for (auto i : out) cout << i << endl;
return 0;
}
| 0
| 31,077,465
|
#include <iostream>
#include <stack>
using namespace std;
int main() {
char c;
stack<char> S;
int ans{};
while(cin >> c) {
if (S.empty() || S.top() == c) S.push(c);
else {
ans += 2;
S.pop();
}
}
cout << ans << endl;
}
|
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#include<set>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl=1e+18+1;
int INF=1e+9+1;
int main(){
ll N;
ll A[100001],sum=0;
scan(N);
rep(i,N){
scan(A[i]);
sum+=A[i];
}
ll kaisu;
if(sum%(N*(N+1)/2)!=0){
prin("NO"); return 0;
}
else{
kaisu=sum/(N*(N+1)/2);
}
int flag=1;
ll dansanum=0;
rep(i,N){
if((kaisu-(A[(i+1)%N]-A[i]))>=0&&(kaisu-(A[(i+1)%N]-A[i]))%N==0){
dansanum+=(kaisu-(A[(i+1)%N]-A[i]))/N;
}
else{
flag=0;
break;
}
}
if(flag&&dansanum==kaisu){
prin("YES");
}
else prin("NO");
return 0;
}
| 0
| 2,718,415
|
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int N = 300000, M = 300000, K = 300000;
int xx[K], yy[K];
int kkx[1 + N], kky[1 + M];
map<pair<int, int>, bool> mp;
int qux[N], quy[N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n, m, k; cin >> n >> m >> k;
for (int h = 0; h < k; h++)
cin >> xx[h] >> yy[h];
for (int h = 0; h < k; h++) {
kkx[xx[h]]++, kky[yy[h]]++;
mp[make_pair(xx[h], yy[h])] = true;
}
int kx = 0;
for (int x = 1; x <= n; x++)
kx = max(kx, kkx[x]);
int ky = 0;
for (int y = 1; y <= m; y++)
ky = max(ky, kky[y]);
int cntx = 0;
for (int x = 1; x <= n; x++)
if (kkx[x] == kx)
qux[cntx++] = x;
int cnty = 0;
for (int y = 1; y <= m; y++)
if (kky[y] == ky)
quy[cnty++] = y;
for (int hx = 0; hx < cntx; hx++)
for (int hy = 0; hy < cnty; hy++)
if (!mp[make_pair(qux[hx], quy[hy])]) {
cout << kx + ky << '\n';
return 0;
}
cout << kx + ky - 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
int main (){
int k,n;
cin >> k >> n;
vector<int> a(n);
rep(i,n){
cin >> a[i];
}
int ans =a[n-1]-a[0];
for(int i =0;i+1<n;i++){
ans = min(ans,k-(a[i+1]-a[i]));
}
cout << ans << endl;
return 0;
}
| 0
| 45,887,708
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int d, t, s;
cin >> d >> t >> s;
if (s * t >= d) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> A(3, vector<int>(3));
bool c = false;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> A.at(i).at(j);
}
}
int N;
cin >> N;
for (int h = 0; h < N; h++) {
int b;
cin >> b;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (A.at(i).at(j) == b) {A.at(i).at(j) = 0;}
}
}
}
for (int i = 0; i < 3; i++) {
if (A.at(0).at(i) == 0 && A.at(1).at(i) == 0 && A.at(2).at(i) == 0) {c = true;}
}
for (int i = 0; i < 3; i++) {
if (A.at(i).at(0) == 0 && A.at(i).at(1) == 0 && A.at(i).at(2) == 0) {c = true;}
}
if (A.at(0).at(0) == 0 && A.at(1).at(1) == 0 && A.at(2).at(2) == 0) {c = true;}
else if (A.at(0).at(2) == 0 && A.at(1).at(1) == 0 && A.at(2).at(0) == 0) {c = true;}
if (c) {cout << "Yes" << endl;}
else {cout << "No" << endl;}
}
| 0
| 49,360,586
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <vector>
#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 ll long long
#define ld long double
#define pb push_back
#define pp pop_back()
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define mii map<pii,ll>
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),a.rend()
#define F first
#define S second
#define sz(x) (ll)x.size()
#define endl '\n'
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repj(j,a,b) for(ll j=a;j<b;j++)
#define lexistr(x,y) lexicographical_compare(x.begin(),x.end(),y.begin(),y.end())
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define PI 3.141592653589793238462643
const ll hell=1000000007;
const ll mod=1000000007;
ll solve()
{
ll n; cin>>n;
ll a[n];
rep(i,0,n) cin>>a[i];
ll dp[n];
dp[0]=0;
dp[1]=abs(a[0]-a[1]);
for(ll i=2;i<n;i++)
{
dp[i]=min(dp[i-1]+abs(a[i]-a[i-1]),dp[i-2]+abs(a[i]-a[i-2]));
}
cout<<dp[n-1];
return 0;
}
signed main(){
IOS
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t=1;
while(t--) {
solve();
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
bool odd(string sl, string sr, int l, int r){
if(sr==sl) return (r-l)%2 == 1;
else return (r-l)%2 == 0;
}
void solve(int n){
string vac = "Vacant";
string sl, sr, str;
int l=0, r=n/2;
cout << l << endl;
cin >> sl;
if(sl==vac) return;
cout << r << endl;
cin >> sr;
if(sr==vac) return;
if(!odd(sl, sr, l, r)){
swap(sl, sr); l = r; r=n;
}
while(1<r-l){
int mid = (l+r)/2;
cout << mid << endl;
cin >> str;
if(str==vac) return;
if(odd(sl, str, l, mid)){
sr = str; r=mid;
}else{
sl = str; l = mid;
}
}
}
int main(){
int n;
while(cin >> n) solve(n);
}
| 0
| 19,483,845
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define pb push_back
#define fst first
#define snd second
using namespace __gnu_pbds;
using ordered_set =
tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>;
typedef long long ll;typedef pair<int, int> pii;
typedef vector<int> vi;typedef long double ld;
template<class T>
using min_heap = priority_queue<T,vector<T>,greater<T>>;
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
template<class T> void re(T& x) { cin >> x; }
template<typename T>
void remdup(vector<T>& v) {
sort(all(v)); v.erase(unique(all(v)), v.end());
}
template<typename T> void re(vector<T> &v) {trav(i,v) cin >> i;}
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
#ifdef np
#include "/home/o_o/MyCodes/pr.h"
#else
#define trace(...)
#endif
#define MOD 1000000007
void solve(){
string s , t ;
re(s,t);
int cnt = 0 ;
rep(i,0,sz(s)) cnt+=(s[i]!=t[i]);
cout << cnt << endl;
}
signed main() {
unsyncIO();
int tt =1 ;
rep(i,0,tt) solve();
#ifdef np
cout <<endl<<endl<< "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;int flag=0;
cin>>s;
int a[26]={0};
for(int i=0;i<s.length();i++){
int k=(int)s[i];
a[k-97]++;
}
for(int i=0;i<26;i++){
if(a[i]==0){
cout<<(char)(i+97);
flag = 1;
break;
}
}
if(flag==0){
cout<<"None";
}
}
| 0
| 47,070,281
|
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deque>
using namespace std;
#define mod 1000000007
int main()
{
long long int n, k;
cin >> n >> k;
long long int a[100001], b[100001];
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
long long int maxketa = 30;
while(k < (long long int)(1 << maxketa)){
maxketa--;
}
long long int nownum = (long long int)(1 << (maxketa + 1)) - 1;
long long int ans = 0;
for(int i = 0; i < n; i++){
if((k | a[i]) == k) ans += b[i];
}
for(int i = maxketa; i >= 0; i--){
nownum -= (long long int)(1 << i);
if((k & (long long int)(1 << i)) == 0 && i > 0) continue;
long long int result = 0;
for(int j = 0; j < n; j++){
if((a[j] | nownum) == nownum) result += b[j];
}
ans = max(ans, result);
nownum += (long long int)(1 << i);
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long int
#define ull unsigned long long int
#define inp(n) ll n; cin >> n
#define inpc(c) char c; cin >> c
#define inps(s) string s; cin >> s
#define print(x) cout << x << " "
#define nl cout << '\n'
#define pyes cout << "YES"
#define pno cout << "NO"
#define fr(i,a,b) for(ll i=a; i<b; ++i)
#define frrev(i,b,a) for(ll i=b; i<=a; --i)
#define strrev(s) reverse(s.begin(), s.end())
#define pb(x) push_back(x)
#define vin(A, n) vector<ll> A; fr(i,0,n){ ll x; cin >> x; A.pb(x); }
#define vinc(A, n) vector<char> A; fr(i,0,n){ char x; cin >> x; A.pb(x); }
#define vpairin(A, n, t1, t2) vector<pair<t1,t2> > A; fr(i,0,n) {t1 x; t2 y; cin >> x >> y; A.pb(make_pair(x,y));}
#define srt(A) sort(A.begin(), A.end())
#define vout(A, n) fr(i,0,n){ print(A[i]); }
#define vpairout(A, n) fr(i,0,n){ print(A[i].first); print(A[i].second); nl; }
using namespace std;
void solve()
{
ll n, k;
cin >>n>>k;
vector <int>num(n+1,0);
for (int i = 1; i< n+1; i++)
{
int temp;
cin >> temp;
num[temp]++;
}
vector <int>a;
for (int i = 0; i < n+1; ++i)
{
if (num[i] != 0)
{
a.push_back(num[i]);
}
}
int exnum = 0;
sort(a.begin(),a.end());
if ( k < a.size())
{
int g = a.size() - k;
for (int i = 0; i < g; ++i)
{
exnum += a[i];
}
cout << exnum;
}
else
cout << "0";
}
int main()
{
fastio();
solve();
return 0;
}
| 0
| 36,698,899
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
const int mod = 1e9+7;
const int MAXN = 1e5+5;
const int N = 1e5+5;
int fac[N];
int spf[MAXN];
void pre(int p) {
fac[0] = 1;
for(int i=1; i<N; i++) {
fac[i] = (fac[i-1] * i) % p;
}
}
void sieve()
{
spf[1] = 1;
for (int i=2; i<MAXN; i++) spf[i] = i;
for (int i=4; i<MAXN; i+=2) spf[i] = 2;
for (int i=3; i*i<MAXN; i++)
{
if (spf[i] == i)
{
for (int j=i*i; j<MAXN; j+=i) if (spf[j]==j) spf[j] = i;
}
}
}
vector<int> getFactorization(int x)
{
vector<int> ret;
while (x != 1)
{
ret.push_back(spf[x]);
x = x / spf[x];
}
return ret;
}
unsigned long long power(unsigned long long x,
int y, int p)
{
unsigned long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
unsigned long long modInverse(unsigned long long n, int p)
{
return power(n, p - 2, p);
}
unsigned long long nCr(unsigned long long n,
int r, int p)
{
if (r == 0) return 1;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p;
}
void solve(int TC) {
string s; cin >> s;
vector<int> cnt(26, 0);
for(char c : s) {
cnt[c - 'a']++;
}
for(int i=0; i<26; i++) if(cnt[i] == 0) {
cout << char('a' + i);
return;
}
cout << "None";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(12);
int T = 1;
for(int i=1; i<=T; i++) {
solve(i);
}
return 0;
}
|
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
string s, t;
cin >> n >> s >> t;
ll tot = s.size() + t.size();
if (n >= tot) {
cout << n << endl;
return 0;
}
ll m = min(s.size(), t.size());
ll cnt = 0;
repLRE(i, 1, m) {
bool ok = true;
rep(j, i) {
if (s[n - i + j] != t[j]) {
ok = false;
break;
}
}
if (ok) cnt = i;
}
ll ans = max(tot - cnt, n);
cout << ans << endl;
return 0;
}
| 0
| 48,976,255
|
#include<iostream>
using namespace std;
int main() {
int n;
int y, m, d;
cin >> n;
for (; n>0; n--) {
int day = 0;
cin >> y >> m >> d;
if (y%3 == 0 || m%2 != 0) {
day += 20-d;
}
else {
day += 19-d;
}
day++;
for (m++; m<11; m++) {
if (y%3 != 0 && m%2 == 0) {
day += 19;
}
else {
day += 20;
}
}
for (y++; y<1000; y++) {
if (y%3 == 0) {
day += 200;
}
else {
day += 195;
}
}
cout << day << endl;
}
return 0;
}
|
#include<cstdio>
#include<cmath>
double Area(int a,int b,int C){
return a*b*sin(C*M_PI/180)/2.0;
}
double ThCos(int a,int b,int C){
return sqrt(a*a+b*b-2*a*b*cos(C*M_PI/180));
}
double Height(int b,int C){
return b*sin(C*M_PI/180);
}
int main(){
int a,b,C;
scanf("%d%d%d",&a,&b,&C);
printf("%lf\n%lf\n%lf\n",Area(a,b,C),a+b+ThCos(a,b,C),Height(b,C));
return 0;
}
| 0
| 54,108,830
|
#include<bits/stdc++.h>
#define REP(i, n) for(int i=0; i<n; i++)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
sort(A, A+N);
string ans = "YES";
for (int i = 1; i < N; i++)
{
if(A[i-1]==A[i]) ans = "NO";
}
cout << ans << 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 main() {
int n;
scanf("%d", &n);
int l = 0, r = n - 1, m;
string sl, sr, sm;
printf("%d\n", l);
fflush(stdout);
cin >> sl;
printf("%d\n", r);
fflush(stdout);
cin >> sr;
if (sl == "Vacant" || sr == "Vacant") return 0;
while (l < r) {
m = l + (r - l) / 2;
printf("%d\n", m);
fflush(stdout);
cin >> sm;
if (sm == "Vacant") return 0;
if (((m - l) % 2 == 1 && sl != sm) || ((m - l) % 2 == 0 && sl == sm)) {
l = m;
sl = sm;
} else {
r = m;
sr = sm;
}
}
return 0;
}
| 0
| 81,118,988
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n+1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
typedef pair<int,int> P;
int main(){
int n,d,a;
cin >> n >> d >> a;
d= d*2;
vector<P> T(n);
queue<pair<ll,ll>> q;
rep(i,n){
cin >> T[i].first >> T[i].second;
}
sort(T.begin(),T.end());
ll ans=0;
ll tot =0;
rep(i,n){
ll x = T[i].first;
ll h = T[i].second;
while(!q.empty()&& q.front().first<x){
tot -= q.front().second;
q.pop();
}
h-= tot;
if(h>0){
ll num = (h+a-1)/a;
ans += num;
ll damage = num * a;
tot += damage;
q.emplace(x+d, damage);
}
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
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
#define PI 3.14159265358979
#define int long long
double inner_product1(double x1, double y1, double x2, double y2) {
return (x1 * x2 + y1 * y2);
}
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
int x[110], y[110];
rep(i, N) cin >> x[i] >> y[i];
double ans = 0.0;
rep(i, 200000) {
int X = 0, Y = 0;
rep(j, N) {
double theta = PI/(i/100000.0);
double xx = cos(theta);
double yy = sin(theta);
if (inner_product1(xx, yy, x[j], y[j]) >= 0) {
X += x[j];
Y += y[j];
}
}
ans = max(ans, sqrt(X * X + Y * Y));
}
cout << fixed << setprecision(12) << ans << endl;
return 0;
}
| 0
| 41,739,329
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int main() {
ll n, k; cin >> n >> k;
ll res = 0;
for (ll i = k; i <= n + 1; i++) {
ll mini = (i - 1) * i / 2;
ll maxi = (2 * n - i + 1) * i / 2;
res += (maxi - mini + 1);
res %= MOD;
}
cout << res << '\n';
return 0;
}
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <queue>
#include <complex>
#define INF 100000000
#define EPS 1e-9
using namespace std;
typedef long long ll;
#define MAX_N 31
#define MAX_M 501
int N;
string alpha[10];
vector<string> ans_list;
int main(){
cin >> N;
alpha[1] = ".,!? ";
alpha[2] = "abc";
alpha[3] = "def";
alpha[4] = "ghi";
alpha[5] = "jkl";
alpha[6] = "mno";
alpha[7] = "pqrs";
alpha[8] = "tuv";
alpha[9] = "wxyz";
while(N > 0){
N--;
string str, ans;
cin >> str;
for(int i = 0; i < str.length(); i++){
if(str[i] == '0')
continue;
int num = 0;
for(int e = i+1; e < str.length(); e++){
if(str[i] != str[e]){
num = e - i;
break;
}
}
ans += alpha[str[i] - '0'][(num-1) % alpha[str[i] - '0'].length()];
i += num;
}
ans_list.push_back(ans);
}
for(int i = 0; i < ans_list.size(); i++){
cout << ans_list[i] << endl;
}
return 0;
}
| 0
| 94,661,303
|
#include <bits/stdc++.h>
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 all(x) (x).begin(),(x).end()
typedef long long lint;
typedef vector<long long> vlint;
typedef vector<string> vstr;
typedef vector<char> vchar;
typedef vector<vector<long long>> vlint2;
int main() {
int r; cin >> r;
cout << r * r << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N; cin >> N;
vector<vector<pair<ll,ll>>> G(N+1);
rep(i, 0, N-1){
ll v, u, w;
cin >> v >> u >> w;
G[u].push_back({v, w});
G[v].push_back({u, w});
}
ll Q, K;
cin >> Q >> K;
ll srt = K;
vector<ll> d(N+1, 1e18);
{
priority_queue<pair<ll,ll>, vector<pair<ll,ll>>, greater<pair<ll,ll>>> que;
que.push({0, srt});
d[srt] = 0;
while(!que.empty()){
auto q = que.top();
que.pop();
if(q.first > d[q.second]) continue;
for(auto g : G[q.second]){
if(d[g.first] <= q.first + g.second) continue;
d[g.first] = q.first + g.second;
que.push({d[g.first], g.first});
}
}
}
rep(q, 0, Q){
ll x, y;
cin >> x >> y;
cout << d[x] + d[y] << endl;
}
return 0;
}
| 0
| 91,803,899
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n, 0)
#define RNREP(i, n) RFOR(i, n, 1)
#define test(x) cout << #x << " = " << x << endl
#define Yes(c) cout << ((c) ? "Yes" : "No") << endl;
#define YES(c) cout << ((c) ? "YES" : "NO") << endl;
#define yes(c) cout << ((c) ? "yes" : "no") << endl;
#define possible(c) cout << ((c) ? "possible" : "impossible") << endl;
#define POSSIBLE(c) cout << ((c) ? "POSSIBLE" : "INPOSSIBLE") << endl;
int main() {
int n,h,H = 0,count = 0;
cin >> n;
for ( int i = 0; i < n; i++){
cin >> h;
if ( h >= H ){
count++;
H = h;
}
}
cout << count << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
int h,w,a,b;
cin>>h>>w>>a>>b;
vector<vector<int>> ans(h,vector<int>(w,0));
rep(i,b){
rep(j,a){
ans[i][j]=1;
}
}
for(int i=b;i<h;i++){
for(int j=a;j<w;j++){
ans[i][j]=1;
}
}
rep(i,h){
rep(j,w) cout<<ans[i][j];
cout<<endl;
}
}
| 0
| 81,995,786
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = 4 * MAX5;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
const int N = 1e4;
ll vis[N]; vll adj[N];
ll t = 1;
ll n, m, s, cnt = 1, sum, u, v;
void MAIN() {
ld w,h,x,y;
cin >> w >> h >> x >> y;
cout<<(w*h)/2<<" ";
if(x == w/2 && y == h/2) cout<<1;
else cout<<0;
}
int main() {
fastio; randomINT;
while (t--) {
MAIN();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long modpow(long long a, long long b){
long long ans = 1;
while (b > 0){
if (b % 2 == 1){
ans *= a;
ans %= MOD;
}
a *= a;
a %= MOD;
b /= 2;
}
return ans;
}
long long modinv(long long a){
return modpow(a, MOD - 2);
}
vector<long long> mf;
long long modfact(int n){
if (mf.size() > n){
return mf[n];
} else {
if (mf.empty()){
mf.push_back(1);
}
for (int i = mf.size(); i <= n; i++){
long long next = mf.back() * i % MOD;
mf.push_back(next);
}
return mf[n];
}
}
long long modbinom(int n, int k){
if (k < 0 || k > n){
return 0;
} else {
return modfact(n) * modinv(modfact(k)) % MOD * modinv(modfact(n - k)) % MOD;
}
}
int main(){
int N;
cin >> N;
vector<int> a(N + 1);
for (int i = 0; i <= N; i++){
cin >> a[i];
a[i]--;
}
vector<int> cnt(N, 0);
for (int i = 0; i <= N; i++){
cnt[a[i]]++;
}
int d;
for (int i = 0; i < N; i++){
if (cnt[i] == 2){
d = i;
}
}
int pos = -1;
int sum = 0;
for (int i = 0; i <= N; i++){
if (a[i] == d){
if (pos == -1){
pos = i;
} else {
sum = pos + (N - i);
}
}
}
for (int i = 1; i <= N + 1; i++){
long long ans = 0;
ans += modbinom(N - 1, i);
ans += modbinom(sum, i - 1);
ans += (modbinom(N - 1, i - 1) - modbinom(sum, i - 1)) * 2;
ans += modbinom(N - 1, i - 2);
ans += MOD;
cout << ans % MOD << endl;
}
}
| 0
| 87,543,671
|
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#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 VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a) (a).begin(),(a).end()
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define pb push_back
#define sz size()
using namespace std;
using ll = long long int;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
using Vl = vector<ll>;
const int MOD = 1e9 + 7;
const ll ZER = 0;
ll gcd(ll a, ll b){
if(a % b == 0)return b;
else return gcd(b, a % b);
}
int main(){
string s;
cin >> s;
ll res = 0, cnt = 0;
vector<ll> a(s.sz + 1, 0);
rep(i, s.sz){
if(s[i] == '<'){
a[i] = cnt;
cnt++;
}
else {
a[i] = cnt;
cnt = 0;
}
}
a[s.sz] = cnt;
cnt = 0;
reverse(ALL(s));
reverse(ALL(a));
bool f = false;
rep(i, s.sz){
if(s[i] == '>'){
if(!f)cnt = 0;
f = true;
a[i] = cnt;
cnt++;
}
else {
a[i] = max(a[i], cnt);
f = false;
cnt = 0;
}
}
a[s.sz] = cnt;
reverse(ALL(a));
rep(i, s.sz + 1)res += a[i];
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define sz(x) ((int)(x).size())
typedef long long ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<typename T> void view(T e){std::cout << e << std::endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
const int inf = 1 << 30;
const ll INF = 1LL << 60;
int main(){
int n, m;
cin >> n >> m;
vector<vector<P>> g(n);
rep(i,m){
int a, b;
cin >> a >> b;
a--; b--;
g[a].emplace_back(1, b);
g[b].emplace_back(1, a);
}
priority_queue<P, VP, greater<P>> pq;
VI dist(n, inf), visited(n, -1);
pq.push(P(0, 0));
dist[0] = 0;
while(!pq.empty()){
P p = pq.top(); pq.pop();
int u = p.second;
if (dist[u] < p.first) continue;
visited[u] = 1;
for(P pp: g[u]){
int v = pp.second, dis = pp.first;
if (visited[v] == 1) continue;
if (chmin(dist[v], dist[u] + dis)){
pq.push(P(dist[v], v));
}
}
}
if (dist[n-1] == 2) {
view("POSSIBLE");
}else{
view("IMPOSSIBLE");
}
return 0;
}
| 0
| 36,573,921
|
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vb> vvb;
typedef vector<vpii> vvpii;
const int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
const int MOD = 1000000007;
const double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
bool odd(const int &n) { return n & 1; }
bool even(const int &n) { return !odd(n); }
void solve();
main { solve(); return 0; }
typedef pair<pii, int> ppi;
int di[] = {1, 0, -1, 0}, dj[] = {0, 1, 0, -1};
void solve() {
int h, w, n;
cin >> h >> w >> n;
vs s(h);
vpii v(n + 1);
rep(i, h) {
cin >> s[i];
rep(j, w) {
if (s[i][j] == 'S') v[0] = mp(i, j);
if ('1' <= s[i][j] && s[i][j] <= '9') v[s[i][j] - '0'] = mp(i, j);
}
}
int c = 0;
auto bfs = [&](vs s, pii f, pii t) {
queue<ppi> q;
q.push(mp(f, 0));
while (q.size()) {
int i = q.front().fi.fi, j = q.front().fi.se, d = q.front().se;
q.pop();
if (i < 0 || j < 0 || i >= h || j >= w || s[i][j] == 'X') continue;
if (i == t.fi && j == t.se) return d;
s[i][j] = 'X';
d++;
rep(k, 4) q.push(mp(mp(i + di[k], j + dj[k]), d));
}
};
loop(i, 1, v.size()) c += bfs(s, v[i - 1], v[i]);
cout << c << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
int main() {
int K;
cin >> K;
vector<int> vec(K);
for(int i = 0;i < K;i++) {
cin >> vec.at(i);
}
reverse(vec.begin(),vec.end());
ll Min = 2;
ll Max = 2;
bool ret = true;
if(vec.at(0) != 2) {
ret = false;
}
for(int i = 0;i < K;i++) {
if(Max / vec.at(i) - (Min - 1) / vec.at(i) == 0) {
ret = false;
break;
}
else {
Min = (Min + vec.at(i) - 1) / vec.at(i) * vec.at(i);
Max = Max / vec.at(i) * vec.at(i) + vec.at(i) - 1;
}
}
if(ret == false) {
cout << -1 << endl;
}
else {
cout << Min << " " << Max << endl;
}
}
| 0
| 68,745,238
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, c, k;
cin >> n >> c >> k;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a + n);
int i = 0, bus = 0;
while (i < n)
{
int ptr = i + 1;
while (ptr < (i + c) && ptr < n)
{
if (a[ptr] > (a[i] + k))
break;
ptr++;
}
bus++;
i = ptr;
}
cout << bus << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,P;cin>>N>>P;
string s;cin>>s;
if(P==2){
int64_t ans=0;
for(int64_t i=N-1;0<=i;i--){
int64_t b=s.at(i)-'0';
if(b%2==0)ans+=i+1;
}
cout<<ans<<endl;
}else if(P==5){
int64_t ans=0;
for(int64_t i=N-1;0<=i;i--){
int64_t b=s.at(i)-'0';
if(b==0 || b==5)ans+=i+1;
}cout<<ans<<endl;
}else{
map<int64_t,int64_t>M;M[0]=1;
int64_t a=1; int64_t c=0;
for(int64_t i=N-1;0<=i;i--){
int64_t b=s.at(i)-'0';
c+=b*a;c%=P;
if(!M.count(c))M[c]=1;
else
M[c]++;
a=(a*10)%P;
}int64_t ans=0;
for(auto p:M){
int64_t v=p.second;
ans+=(v*(v-1))/2;
}cout<<ans<<endl;
}
return 0;
}
| 0
| 93,887,767
|
#include <iostream>
using namespace std;
int main() {
int n,b,f,r,v,college[4][3][10]={0};
cin>>n;
for(int m=0;m<n;m++){
cin>>b>>f>>r>>v;
college[b-1][f-1][r-1]+=v;
if(college[b-1][f-1][r-1]>9)college[b-1][f-1][r-1]=9;
if(college[b-1][f-1][r-1]<0)college[b-1][f-1][r-1]=0;
}
for(int i=0;i<4;i++){
if(i!=0){
for(int l=0;l<20;l++)cout<<"#";
cout<<endl;
}
for (int j = 0; j <3 ; j++) {
for (int k=0;k<10;k++){
if(college[i][j][k]!=0)cout<<" "<<college[i][j][k];
else{cout<<" "<<0;}
}
cout<<endl;
}
}
return 0;
}
|
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <math.h>
#include <tuple>
#include <map>
using namespace std;
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
if ((n - 1) / b <= a - 1 && a - 1 <= n - b) {
if (a == 1) {
for (int i = n; i > 0; i--) {
if (i != n) cout << " ";
cout << i;
}
cout << endl;
return 0;
}
int ans[300030], idx = 0, front = 1;
int k = (n - b) / (a - 1), l = (n - b) % (a - 1);
for (int i = 0; i < a - 1; i++) {
int end;
if (l > 0) {
end = front + k;
l--;
}
else end = front + k - 1;
for (int j = end; j >= front; j--) {
ans[idx] = j;
idx++;
}
front = end + 1;
}
front = n;
while (idx < n) {
ans[idx] = front;
idx++;
front--;
}
for (int i = 0; i < n; i++) {
if (i != 0) cout << " ";
cout << ans[i];
}
cout << endl;
}
else cout << -1 << endl;
}
| 0
| 59,623,641
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
using namespace std;
ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,e,n,k,maxi=0,f=0,mini=INF,sum=0,q;
string str,stra,straa;
ll x,y,w,z;
char ca,cb,cc;
cin>>a>>b;
cout<<(a-1)*(b-1)<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int>v(n);
for(int i=0;i<n;i++) cin >> v[i];
int ans = 0;
int suma = 0;
vector<int>veca;
for(int a=0;a<=min(n ,k);a++){
vector<int>vecb;
if(a > 0){
veca.push_back(v[a-1]);
suma += v[a-1];
}
int sumb = 0;
for(int b=0;a+b<=min(n,k);b++){
if(b > 0){
vecb.push_back(v[n-b]);
sumb += v[n-b];
}
if(veca.size() > 0){
sort(veca.begin() ,veca.end());
}if(vecb.size() > 0){
sort(vecb.begin() ,vecb.end());
}
int tmp = 0;
int isum = suma + sumb;
for(int i=0; tmp < k-(a+b) ;i++){
if(i >= veca.size() && i >= vecb.size()) break;
if(i >= veca.size()){
if(vecb[i] < 0) {
isum -= vecb[i];
tmp++;
}continue;
}if(i >= vecb.size()){
if(veca[i] < 0) {
isum -= veca[i];
tmp++;
}continue;
}
if(veca[i] >= 0 && vecb[i] >= 0) break;
if(tmp == k-(a+b)-1){
if(veca[i] < 0 && vecb[i] < 0){
isum -= min(veca[i] ,vecb[i]);
break;
}
}
if(veca[i] < 0) {
isum -= veca[i];
tmp++;
}if(vecb[i] < 0) {
isum -= vecb[i];
tmp++;
}
}
ans = max(ans ,isum);
}
}
cout << ans << endl;
}
| 0
| 71,681,964
|
#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>;
using VVI = vector<vector<int>>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
ll mini = 1'000'000'000'000'000;
for (int tmp = 0; tmp < (1 << n); tmp++)
{
bitset<15> bs(tmp);
if (bs.count() < k || !bs.test(0))
{
continue;
}
ll top = a[0];
ll cnt = 0;
for (int i = 1; i < n; i++)
{
if (bs.test(i) && a[i] <= top)
{
cnt += (top - a[i] + 1);
++top;
}
else
{
top = max(a[i], top);
}
}
mini = min(mini, cnt);
}
cout << mini << endl;
return 0;
}
template <typename T>
void print(T const &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
|
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
const int N = 1000000;
const int mod = 1000000007;
const int INF = 1 << 30;
#define rep(i,n) for(ll i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
ll ppow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if ((n & 1) == 1)ans = ans * x;
x = x * x;
n >>= 1;
x %= mod;
ans %= mod;
}
return ans;
}
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
ll sz, fact[N], inv[N];
void setinv() {
fact[0] = 1; inv[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = (fact[i - 1] * i) % mod;
inv[i] = ppow(fact[i], (ll)mod - 2) % mod;
}
}
ll conv(ll r) {
return fact[sz] * inv[r] % mod * inv[sz - r] % mod;
}
int d[1000][1000];
void reset() {
rep(i, 1000)rep(j, 1000)d[i][j] = INF;
}
int main() {
int h, w, n;
pp s, g, pos[10];
cin >> h >> w >> n;
char m[1010][1010];
rep(i, h)rep(j, w) {
cin >> m[i][j];
if (m[i][j] == 'S')pos[0] = pp{ i,j };
if (m[i][j] == char('0' + n - 1))g = pp{ i,j };
if (m[i][j] >= '0'&&m[i][j] <= '9')pos[m[i][j] - '0'] = pp{ i,j };
}
int ans = 0;
rep(i, n) {
reset();
queue<pp>q; q.push(pos[i]);
d[pos[i].fi][pos[i].se] = 0;
while (!q.empty()) {
pp p = q.front(); q.pop();
if (p == pos[i + 1]) { ans += d[p.fi][p.se]; break; }
if (p.fi > 0 && m[p.fi - 1][p.se] != 'X'&&d[p.fi - 1][p.se] == INF) { q.push(pp{ p.fi - 1,p.se }); d[p.fi - 1][p.se] = d[p.fi][p.se] + 1; }
if (p.fi < h - 1 && m[p.fi + 1][p.se] != 'X'&&d[p.fi + 1][p.se] == INF) { q.push(pp{ p.fi + 1,p.se }); d[p.fi + 1][p.se] = d[p.fi][p.se] + 1; }
if (p.se > 0 && m[p.fi][p.se - 1] != 'X'&&d[p.fi][p.se - 1] == INF) { q.push(pp{ p.fi,p.se - 1 }); d[p.fi][p.se - 1] = d[p.fi][p.se] + 1; }
if (p.se < w - 1 && m[p.fi][p.se+1] != 'X'&&d[p.fi][p.se+1] == INF) { q.push(pp{ p.fi,p.se+1 }); d[p.fi][p.se+1] = d[p.fi][p.se] + 1; }
}
}
cout << ans << endl;
}
| 0
| 53,397,230
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
const int INF = 0x3f3f3f3f;
int A[2000005], B[2000005], C[10005];
int main(){
int n, temp = 0;
cin >> n;
for(int i = 1; i <= n; i++) scanf("%d", A + i);
for(int i = 1; i <= n; i++) C[A[i]]++;
for(int i = 0; i < 10000; i++){
temp += C[i];
C[i] = temp;
}
for(int i = n; i > 0; i--){
B[C[A[i]]] = A[i];
C[A[i]]--;
}
for(int i = 1; i <= n; i++){
if(i > 1)
printf(" ");
printf("%d", B[i]);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main(){
double a,b,x;
cin>>a>>b>>x;
double s=x/a;
double rad;
if(s>=a*b/2){
double h=(a*b-s)*2/a;
rad=atan2(h,a);
}
else{
double w=s*2/b;
rad=atan2(b,w);
}
double PI=acos(-1);
double deg=rad/(2*PI)*360;
cout<<fixed<<setprecision(10)<<deg<<endl;
return 0;
}
| 0
| 13,083,110
|
#include<iostream>
#include<string>
using namespace std;
int main(){
string card;
int m,h;
while(1){
cin>>card;
if(card=="-")break;
cin>>m;
for(int i=0;i<m;i++){
cin>>h;
for(int j=0;j<h;j++){
card += card[0];
card.erase(0,1);
}
}
cout<<card<<endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#define ll long long
#define rep(i, a, b) for(int i = a; i < b; i++)
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int mx = 0;
vector<vector<int>> v(h+2, vector<int>(w+2, -2));
queue<pair<int,int>> q;
rep(i, 1, h+1) {
rep(j, 1, w+1) {
char c;
cin >> c;
if(c == '#') {
v[i][j] = 0;
q.push(make_pair(i, j));
} else v[i][j] = -1;
}
}
while(!q.empty()) {
pair<int, int> f = q.front();
q.pop();
int x = f.first, y = f.second;
if(v[x+1][y] == -1) {
v[x+1][y] = v[x][y] + 1;
q.push(make_pair(x+1, y));
if(v[x+1][y] > mx) mx = v[x+1][y];
}
if(v[x-1][y] == -1) {
v[x-1][y] = v[x][y] + 1;
q.push(make_pair(x-1, y));
if(v[x-1][y] > mx) mx = v[x-1][y];
}
if(v[x][y+1] == -1) {
v[x][y+1] = v[x][y] + 1;
q.push(make_pair(x, y+1));
if(v[x][y+1] > mx) mx = v[x][y+1];
}
if(v[x][y-1] == -1) {
v[x][y-1] = v[x][y] + 1;
q.push(make_pair(x, y-1));
if(v[x][y-1] > mx) mx = v[x][y-1];
}
}
cout << mx << "\n";
}
| 0
| 55,274,661
|
#include <cstdio>
int N, E, head[100001], next[199999], to[199999], f[100001], fa[100001], q[100001];
int main()
{
scanf("%d", &N);
for (int i = 1, u, v; i < N; i++)
{
scanf("%d%d", &u, &v);
next[++E] = head[u], to[E] = v, head[u] = E;
next[++E] = head[v], to[E] = u, head[v] = E;
}
int H = 0, T = 1, u;
q[1] = 1;
while (H < T)
for (int e = head[u = q[++H]]; e; e = next[e])
if (to[e] != fa[u])
fa[q[++T] = to[e]] = u;
for (int i = N; i > 1; i--)
f[fa[q[i]]] ^= ++f[q[i]];
puts(f[1] ? "Alice" : "Bob");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<class e, class t, int N>
std::basic_istream<e,t>& operator>>(std::basic_istream<e,t>& in, const e(&literal)[N]) {
std::array<e, N-1> buffer;
in >> buffer[0];
if (N>2)
in.read(&buffer[1], N-2);
if (strncmp(&buffer[0], literal, N-1))
in.setstate(in.rdstate() | std::ios::badbit);
return in;
}
template<class e, class t>
std::basic_istream<e,t>& operator>>(std::basic_istream<e,t>& in, const e& literal) {
e buffer;
in >> buffer;
if (buffer != literal)
in.setstate(in.rdstate() | std::ios::badbit);
return in;
}
template<class e, class t, int N>
std::basic_istream<e,t>& operator>>(std::basic_istream<e,t>& in, e(&carray)[N]) {
return std::operator>>(in, carray);
}
template<class t>
istream & operator>>(istream& in,vector<t> &v) {
for(int i = 0; i < v.size();i++)in>>v[i];
return in;
}
template<class t1,class t2>
istream & operator>>(istream& in,pair<t1,t2> &v) {
cin>>v.first>>v.second;
return in;
}
template<class t>
ostream & operator<<(ostream & out, vector<t> & a){
for(auto x : a){
out << x <<" ";
}
return out;
}
template<class t>
ostream & operator<<(ostream & out, set<t> & a){
for(auto x : a){
out << x <<" ";
}
return out;
}
template<class t1, class t2>
ostream & operator<<(ostream & out, map<t1,t2> & a){
for(auto x : a){
out << x.first << " = " << x.second << endl;
}
return out;
}
template<class t1,class t2>
ostream & operator<<(ostream & out,const pair<t1,t2> & a){
out << a.first<<" "<<a.second;
return out;
}
template<class t1,class t2>
pair<t1,t2> operator+(const pair<t2,t1>& a,const pair<t1,t2> & b){
return {a.first + b.first, a.second + b.second};
}
template<class t1,class t2>
pair<t1,t2> operator-(const pair<t2,t1>& a,const pair<t1,t2> & b){
return {a.first - b.first, a.second - b.second};
}
#ifdef PRAGMA
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#ifdef LUCARIO
#define deb(...) fprintf(stderr,__VA_ARGS__)
#define deb1(x) cerr << #x << " = " << x << endl;
#define FIN 0
#else
#define deb(...) 0
#define deb1(x) 0
#define FIN ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
typedef pair<long long,long long> pll;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
#define ll long long
#define ld long double
#define int long long
#define pb push_back
#define bs binary_search
#define up upper_bound
#define lb lower_bound
#define f first
#define s second
#define fst first
#define snd second
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define mp make_pair
#define endl "\n"
#define fore(i,a,b) for(ll i = a; i < (ll)b; i++)
#define rfore(i, a, b) for(ll i = b - 1; i >= (ll)a; i--)
#define bin(aaa,bbb) fore(_,0,bbb)cout<<((aaa & (1<<_)) != 0);cout<<endl;
#define mm(a,b) memset(a , b , sizeof a)
#define trans(a,b) transform(a.begin(),a.end(),a.begin(),b)
#define bpop(n) __builtin_popcount(n)
#define np(a) next_permutation(a.begin(), a.end())
#define ALL(a) a.begin(),a.end()
#define SZ(n) ((ll) (n).size())
#define sfind(s,t) (s.find(t) != string::npos)
#define infll (ll)(1e16+3)
#define infi (ll)(1e9+4)
#define pi acos(-1)
#define mod (ll)(1e9+7)
#define eps 1e-7
#define YES "YES"
#define NO "NO"
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b,a%b); }
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
ll fpow(ll b, ll e, ll m = mod){int r=1;while(e){if(e&1)r=(r*b)%m;e/=2;b=(b*b)%m;}return r;}
vector<pll> a;
map<pair<int,pll>,int> dp;
int n;
int32_t main(int32_t argc, char const *argv[]){
FIN;
cin>>n;a.resize(n);
cin>>a;
int res=0;
fore(j,0,100000){
random_shuffle(ALL(a));
int x=0,y=0;
for(auto z : a){
if( (x+z.f)*(x+z.f)+ ((y+z.s)*(y+z.s)) > x*x+y*y ){
x+=z.f;
y+=z.s;
}
}
res=max(res,x*x+y*y);
}
cout<<fixed<<setprecision(20)<<sqrt(res)<<endl;
return 0;
}
| 0
| 70,474,888
|
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
string s,t;
ll ans=0;
cin >> s >> t;
for(ll i=0;i<s.length();i++){
if(s[i]!=t[i]){
ans++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
struct SegTree {
vector<int> vseg;
int n;
#define CL(v) ((v) << 1)
#define CR(v) ((v) << 1 | 1)
SegTree(vector<int> a){
this->n = a.size();
vseg.resize(n << 2);
build(a, 1, 0, n - 1);
}
void build(vector<int>& a, int v, int tl, int tr){
if(tl == tr)
vseg[v] = a[tl];
else{
int tm = tl + tr >> 1;
build(a, CL(v), tl, tm);
build(a, CR(v), tm + 1, tr);
vseg[v] = max(vseg[CL(v)], vseg[CR(v)]);
}
}
int getMax() {
return vseg[1];
}
void update(int pos, int diff){
update(1, 0, n - 1, pos, diff);
}
void update(int v, int tl, int tr, int pos, int diff) {
if(tl == tr){
vseg[v] += diff;
}else{
int tm = tl + tr >> 1;
if (pos <= tm)
update(CL(v), tl, tm, pos, diff);
else
update(CR(v), tm + 1, tr, pos, diff);
vseg[v] = max(vseg[CL(v)], vseg[CR(v)]);
}
}
};
int main(){
cin.sync_with_stdio(0);
cin.tie(0);
int n, x, t, h, w, m;
cin >> h >> w >> m;
vector<ii> v(m);
vector<vector<int>> line(h);
vector<int> col(w, 0);
for(int i = 0; i < m; i++){
cin >> v[i].first >> v[i].second;
v[i].first --; v[i].second--;
line[v[i].first].push_back(v[i].second);
col[v[i].second]++;
}
SegTree seg(col);
int ans = 0;
for(int i = 0; i < h; i++){
for(int e: line[i])
seg.update(e, - 1);
ans = max<int>(ans, line[i].size() + seg.getMax());
for(int e: line[i])
seg.update(e, 1);
}
cout << ans << endl;
}
| 0
| 85,005,883
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
for ( int i = 0; i < n; i++ ) {
int a,b,c; cin >> a >> b >> c;
bool flag = 0;
if ( a + b > c && b + c > a && c + a > b ) {
if ( a * a == b * b + c * c ||
b * b == c * c + a * a ||
c * c == a * a + b * b ) flag = 1;
}
if ( flag ) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[40005][205]={0};
ll max_v[40005]={0};
ll ts[205]={0};
const ll inf=174417441744;
int main(){
ll n;
cin>>n;
ll all_time=0;
for(int i=0;i<n;i++) cin>>ts[i];
for(int i=0;i<n;i++){
ll v,t=ts[i];
cin>>v;
v*=2;
for(int j=all_time+1;j<=all_time+t*2;j++) max_v[j]=v;
all_time+=t*2;
}
for(int i=0;i<=all_time;i++){
for(int j=0;j<205;j++) dp[i][j]=-inf;
}
dp[0][0]=0;
for(int i=0;i<all_time;i++){
for(int j=0;j<=max_v[i+1];j++){
if(j>0) dp[i+1][j-1]=max(dp[i+1][j-1],dp[i][j]+j+j-1);
dp[i+1][j]=max(dp[i+1][j],dp[i][j]+2*j);
if(j+1<=max_v[i+1]) dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+j+j+1);
}
}
cout<<fixed;
cout<<setprecision(5)<<(double)dp[all_time][0]/8<<endl;
}
| 0
| 40,959,056
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pi pair<ll,ll>
#define pii pair<ll,pi>
#define pb push_back
#define mk make_pair
const int n = 2 * 1e3 + 7;
const int m = 2 * 1e3 + 7;
int down[n][m], up[n][m], lef[n][m], righ[n][m];
char a[n][m];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h, w;
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (a[i][j] == '.') {
if (j == 0)
lef[i][j] = 1;
else
lef[i][j] = lef[i][j - 1] + 1;
}
}
}
for (int i = 0; i < h; i++) {
for (int j = w - 1; j >= 0; j--) {
if (a[i][j] == '.') {
if (j == w - 1)
righ[i][j] = 1;
else
righ[i][j] = righ[i][j + 1] + 1;
}
}
}
for (int j = 0; j < w; j++) {
for (int i = 0; i < h; i++) {
if (a[i][j] == '.') {
if (i == 0)
down[i][j] = 1;
else
down[i][j] = down[i - 1][j] + 1;
}
}
}
for (int j = w - 1; j >= 0; j--) {
for (int i = h - 1; i >= 0; i--) {
if (a[i][j] == '.') {
if (i == h - 1)
up[i][j] = 1;
else
up[i][j] = up[i + 1][j ] + 1;
}
}
}
int nax = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (a[i][j] == '.') {
nax = max(nax, down[i][j] + up[i][j] + lef[i][j] + righ[i][j] - 3);
}
}
}
cout << nax << endl;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX_N = 1005;
int c[MAX_N][MAX_N];
int main()
{
string X,Y;
cin >> X;
cin >> Y;
for(int i=0;i<=X.length();i++){
c[i][0] = i;
}
for(int j=0;j<=Y.length();j++){
c[0][j] = j;
}
for(int i=1;i<=X.length();i++){
for(int j=1;j<=Y.length();j++){
int p,q,r;
if(X[i-1] == Y[j-1]){
p = c[i-1][j-1];
}else{
p = c[i-1][j-1] + 1;
}
q = c[i][j-1] + 1;
r = c[i-1][j] + 1;
c[i][j] = min(min(p,q),r);
}
}
cout << c[X.length()][Y.length()] << "\n";
}
| 0
| 35,141,540
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int arr[100001],n;
cin>>n;
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
cout<<arr[n/2]-arr[n/2-1]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int n;
cin >> n;
deque<ll> a(n + 1), b(n);
rep(i, n + 1)
{
cin >> a[i];
}
rep(i, n)
{
cin >> b[i];
}
ll ans = 0;
rep(i, n)
{
if (b[i] >= a[i])
{
ans += a[i];
b[i] -= a[i];
a[i] = 0;
}
else
{
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1])
{
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
else
{
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
cout << ans << endl;
return 0;
}
| 0
| 55,218,209
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void chmax(int& a, int b) {
if (a == -1) a = b;
if (a > b) a = b;
}
int main () {
int nin[10];
int six[10];
nin[0] = 0;
nin[1] = 9;
six[0] = 0;
six[1] = 6;
for (int i = 2; i < 8; i ++) {
nin[i] = nin[i - 1] * 9;
}
for (int i = 2; i < 10; i ++) {
six[i] = six[i - 1] * 6;
}
int num_with[1000000];
ll I_ma = 1000000;
for (int i = 0; i < 1000000; i ++) num_with[i] = -1;
ll with[18];
for (int i = 0; i < 6; i ++) {
with[i] = nin[i + 1];
}
for (int i = 6; i < 13; i ++) {
with[i] = six[i - 5];
}
num_with[0] = 0;
for (int i = 0; i < 1000000; i ++) {
if (num_with[i] != -1) {
for (int j = 0; j < 13; j ++) {
if (i + with[j] < I_ma) {
chmax(num_with[i + with[j]], num_with[i] + 1);
}
}
}
}
int N;
cin >> N;
int count = 0;
while (num_with[N] == -1) {
N --;
count ++;
}
cout << num_with[N] + count << endl;
}
|
#include<stdio.h>
#include<string.h>
typedef long long ll;
typedef unsigned long long ull;
int main(){
char a[15];
char b[15];
char c[15];
scanf("%s %s %s",a,b,c);
int ada = 0;
if(a[strlen(a)-1]==b[0]&&b[strlen(b)-1]==c[0])
ada=1;
if(ada==1)
printf("YES\n");
else
printf("NO\n");
}
| 0
| 11,595,677
|
#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;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <array>
#include <list>
#include <forward_list>
#include <complex>
#include <ratio>
#include <cassert>
#include <numeric>
#include <random>
#include <iterator>
#include <chrono>
#include <cstring>
using namespace std;
using i64 = int64_t;
using ll = long long;
using ld = long double;
template <typename T>
using vec = vector<T>;
template <typename T>
using mat = vec<vec<T>>;
template <typename T>
using dic = unordered_map<string, T>;
template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
using pii = pair<int, int>;
using ppi = pair<pii, int>;
using pip = pair<int, pii>;
using ppp = pair<pii, pii>;
using vi = vec<int>;
using mi = mat<int>;
using vp = vec<pii>;
constexpr int IINF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr long long MOD = 1e9 + 7;
#define _overload(_1, _2, _3, name, ...) name
#define _rep1(i, a, b) for (int i = (a), _##i = (b); i < _##i; ++i)
#define _rep2(i, n) _rep1(i, 0, n)
#define _rep3(n) _rep2(i, n)
#define rep(...) _overload(__VA_ARGS__, _rep1, _rep2, _rep3)(__VA_ARGS__)
#define _rrep1(i, a, b) for (int i = (b)-1, _##i = (a); i >= _##i; --i)
#define _rrep2(i, n) _rrep1(i, 0, n)
#define _rrep3(n) _rrep2(i, n)
#define rrep(...) _overload(__VA_ARGS__, _rrep1, _rrep2, _rrep3)(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define each2(i, a) for (const auto &i : a)
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define np next_permutation
#define pp prev_permutation
#define mp make_pair
#define mt make_tuple
#define ft first
#define sd second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)(a).size()
#define rev(a) reverse(all(a))
#define rs(a, l) (a).resize(l)
#define upper(s) transform(all(s), (s).begin(), topper)
#define lower(s) transform(all(s), (s).begin(), tolower)
#define sum(a) accumulate(all(a), 0)
#define elif else if
#define unless(a) if (!(a))
#define qt(a) #a
#define endl '\n'
#define dec(n) fixed << setprecision(n)
#define zfl(n) setfill(‘0’) << setw(n)
template <typename T = int, T l = 0, T r = (T)MOD>
auto rnd = bind(uniform_int_distribution<T>(l, r), mt19937(chrono::steady_clock::now().time_since_epoch().count()));
template <typename T>
inline constexpr T gcd(T a, T b)
{
if (a == 0 || b == 0)
return 0;
while (b)
{
a = a % b;
swap(a, b);
}
return a;
}
template <typename T>
inline constexpr T extgcd2(T a, T b, T &x, T &y)
{
x = 1;
y = 0;
while (b)
{
T t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return a;
}
template <typename T>
inline constexpr T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T>
inline constexpr bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
inline constexpr bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return true;
}
return false;
}
template <typename A, typename B>
istream &operator>>(istream &is, pair<A, B> &p)
{
is >> p.first;
is >> p.second;
return is;
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p)
{
os << p.first << " " << p.second;
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
for (auto &&x : v)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
for (int i = 0; i < (int)v.size(); ++i)
cout << v[i] << (i + 1 != (int)v.size() ? " " : "");
return os;
}
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg>
void __f(const char *name, const Arg &arg)
{
cerr << name << " : " << arg << endl;
}
template <typename Arg, typename... Args>
void __f(const char *names, const Arg &arg, const Args &... args)
{
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg << " | ";
__f(comma + 1, args...);
}
inline auto yes(const bool &c) { return c ? "yes" : "no"; }
inline auto Yes(const bool &c) { return c ? "Yes" : "No"; }
inline auto YES(const bool &c) { return c ? "YES" : "NO"; }
inline auto Possible(const bool &c) { return c ? "Possible" : "Impossible"; }
inline auto POSSIBLE(const bool &c) { return c ? "POSSIBLE" : "IMPOSSIBLE"; }
constexpr int lim = 100007;
vec<string> S;
int t[2000][2000];
int h, w;
signed main()
{
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
cin >> h >> w;
S.resize(h);
rep(h) cin >> S.at(i);
int c = 0;
rep(i, h)
{
c = 0;
rep(j, w)
{
if (S.at(i).at(j) == '.')
{
t[i][j] += c;
c += 1;
}
else
{
c = 0;
}
}
}
rep(i, h)
{
c = 0;
{
rrep(j, w)
{
if (S.at(i).at(j) == '.')
{
c += 1;
t[i][j] += c;
}
else
{
c = 0;
}
}
}
}
rep(j, w)
{
c = 0;
rep(i, h)
{
if (S.at(i).at(j) == '.')
{
t[i][j] += c;
c += 1;
}
else
{
c = 0;
}
}
}
rep(j, w)
{
c = 0;
{
rrep(i, h)
{
if (S.at(i).at(j) == '.')
{
c += 1;
t[i][j] += c;
}
else
{
c = 0;
}
}
}
}
int ans = 0;
rep(i, h) rep(j, w) ans = max(ans, t[i][j]);
cout << ans - 1 << endl;
return 0;
}
| 0
| 34,772,804
|
#include<bits/stdc++.h>
#define rep(i,n) for (int i =0; i <(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int H,W;
cin >> H >> W;
char board[52][52];
for(int i = 1; i <= H; i++){
for(int j = 1; j <= W; j++)cin >> board[i][j];
}
for(int i = 1; i<= H; i++){
for(int j = 1; j <= W; j++){
if(board[i][j] == '#'){
if(board[i-1][j] != '#' && board[i][j-1] != '#' && board[i][j+1] != '#' && board[i+1][j]!= '#' ){
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
struct edge {
ll to, cost;
};
using Graph = vector<vector<int>>;
using _Graph = vector<vector<edge>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
vector<bool> seen;
vector<int> colors;
int H, W, N;
int sx, sy, gx, gy;
vector<vector<char>> field;
vector<vector<int>> dist;
deque<pair<int, int>> que;
typedef vector<vector<int> > Matrix;
const ll INF = 1e18;
int main() {
ll n;
cin >> n;
map<ll, ll> v1, v2;
REP(i, n){
if(i%2==0){
ll v;
cin >> v;
v1[v]++;
}
else {
ll v;
cin >> v;
v2[v]++;
}
}
vector<pair<ll, ll>> v1_, v2_;
for(auto itr = v2.begin(); itr != v2.end(); ++itr) {
v2_.push_back({itr->second, itr->first});
}
for(auto itr = v1.begin(); itr != v1.end(); ++itr) {
v1_.push_back({itr->second, itr->first});
}
sort(v1_.begin(), v1_.end(), greater<pair<ll, ll>>());
sort(v2_.begin(), v2_.end(), greater<pair<ll, ll>>());
ll ans;
if(v1_[0].second == v2_[0].second){
if(v1_.size()==1 && v2_.size()==1){
ans = n/2;
}else{
ll ans1 = (n/2 - v1_[0].first) + (n/2 - v2_[1].first);
ll ans2 = (n/2 - v2_[0].first) + (n/2 - v1_[1].first);
ans = min(ans1,ans2);
}
}else{
ans = (n/2 - v1_[0].first) + (n/2 - v2_[0].first);
}
cout << ans << endl;
}
| 0
| 83,044,239
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int mx = n*(n-1)/2;
mx -= n-1;
if(mx < k){
cout << -1 << endl;
return 0;
}
vector<pair<int, int>> ans;
rep(i, n-1){
ans.push_back({1, i+2});
}
int co = 0;
rep2(i, 2, n+1){
rep2(j, i+1, n+1){
if(co == mx-k) goto SKIP;
ans.push_back({i, j});
co++;
}
}
SKIP:
cout << ans.size() << endl;
rep(i, ans.size()){
cout << ans.at(i).first << " " << ans.at(i).second << endl;
}
return 0;
}
|
#include<iostream>
#include <cstddef>
#include<set>
#include<stack>
#include <deque>
#include<queue>
#include<utility>
#include<vector>
#include<map>
#include<cmath>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include<algorithm>
#define ll long long
#define ull unsigned long long
#define sl(a) scanf("%lld",&a)
#define si(a) scanf("%d",&a)
#define mem(n,m) memset(n,m,sizeof(n))
#define PI acos(-1)
#define pb push_back
#define pf push_front
#define vll vector<ll>
#define pll pair<ll,ll>
#define mp make_pair
#define vpll vector< pair <ll,ll> >
#define vplpll vector<pair<ll,pair<ll,ll> > >
#define mp make_pair
#define all(v) v.begin(),v.end()
#define S(X) ( (X) * (X) )
#define forab(i, a, b) for(i = a; i <= b; i++)
#define forn(i, n) for(i = 0; i < n; i++)
#define print(a,b) printf("Case %lld: %lld\n",a,b)
using namespace std;
ll powd(ll a,ll b){if(b==1){return a;}if(b%2==1){return powd(a,b-1)*a;}else{ll x=powd(a,b/2); return x*x;}}
ll powm(ll a,ll b,ll m){if(b==0){return 1;}if(b==1){return a%m;}if(b%2==1){return ((powm(a,b-1,m)%m)*(a%m))%m;}else{ll x=powm(a,b/2,m); return ((x%m)*(x%m))%m;}}
ll gcd(ll a,ll b){if(a==0){return b;}return gcd(b,a%b);}
int main()
{
ll a,b,c;
sl(a);
sl(b);
sl(c);
ll k;
sl(k);
while(k>0&&b<=a)
{
b*=2;
k--;
}
while(k>0&&c<=b)
{
c*=2;
k--;
}
if(a>=b||b>=c)
{
cout<<"No"<<endl;
}
else
{
cout<<"Yes"<<endl;
}
return 0;
}
| 0
| 5,207,805
|
#include <iostream>
#include <string>
#include<algorithm>
using namespace std;
int main() {
string a, b;
string c="No";
cin >> a >> b ;
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
if(a<b)
c="Yes";
cout << c << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
long long n,ans = 0;
long long a[200005],b[200005];
int main(){
cin >> n;
for(int i = 1;i <= n;i ++)
cin >> a[i], b[i] = a[i];
sort(b + 1,b + 1 + n);
for(int i = 1; i <= n; ++i)
a[i] = lower_bound(b + 1,b + 1 + n,a[i]) - b;
for(int i = 1; i <= n; ++i)
if((a[i] & 1) ^ (i & 1)) ans++;
cout << (ans >> 1) << endl;
return 0;
}
| 0
| 2,809,028
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<int, int> mp;
for(int i = 0; i < n; i++){
int a; cin >> a;
mp[a]++;
}
int ans = 0;
for(auto p: mp){
int k = p.first;
int tmp = p.second;
if(k < tmp) ans += tmp-k;
else if(k > tmp) ans += tmp;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define speed ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
speed;
ll h,w,k; cin>>h>>w>>k;
vector<vector<char>> a(h,vector<char>(w));
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
cin>>a[i][j];
}
}
ll ans=0;
for(ll i=0;i<(1<<h);i++){
for(ll j=0;j<(1<<w);j++){
ll black=0;
for(ll p=0;p<h;p++){
if(i&(1<<p)) continue;
else{
for(ll l=0;l<w;l++){
if(j&(1<<l)) continue;
if(a[p][l]=='#') black++;
}
}
}
if(black==k) ans++;
}
}
cout<<ans<<'\n';
return 0;
}
| 0
| 81,646,328
|
#include <iostream>
#include <string>
#include <sstream>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <bitset>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
int N,M,num1,num2;
bool data[101][101]={};
cin>>N;
for(int i=0;i<N;i++){
cin>>num1;
cin>>M;
for(int j=0;j<M;j++){
cin>>num2;
data[num1][num2]=true;
}
}
for(int i=1;i<=N;i++){
cout<<data[i][1];
for(int j=2;j<=N;j++){
cout<<' '<<data[i][j];
}
cout<<endl;
}
}
|
#include <iostream>
#include <map>
#include <string>
using namespace std;
map<string, int> cnt;
string ans[2];
int num_max;
int main() {
string str;
while (cin >> str) {
cnt[str]++;
}
for (auto e : cnt) {
if (num_max < e.second) {
ans[0] = e.first;
num_max = e.second;
}
if (ans[1].size() < e.first.size()) {
ans[1] = e.first;
}
}
cout << ans[0] << " " << ans[1] << endl;
}
| 0
| 33,725,583
|
#include <bits/stdc++.h>
#define f(i, a, b) for(int i = a; i < (b); ++i)
#define rep(i,n) f(i, 0, n)
using namespace std;
using ll = long long;
int main(void){
int n;
string s, t;
cin >> n >> s >> t;
string ans;
rep(i,n){
ans+=s[i];
ans+=t[i];
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <stack>
#include <algorithm>
using namespace std;
int main()
{
string s;
while( getline( cin, s ) ) {
if ( s == "." )
break;
bool b = true;
stack<char> t;
t.push( '\0' );
for( auto c : string( s.cbegin(), s.cbegin() + s.find_last_of( '.' ) ) ) {
b = [&]() mutable -> bool {
if ( c == '(' || c == '[' )
t.push( c );
else if ( c == ')' )
if ( t.top() == '(' )
t.pop();
else
return false;
else if ( c == ']' )
if ( t.top() == '[' )
t.pop();
else
return false;
return true;
}();
if ( !b )
break;
}
cout << ( b && t.size() == 1 ? "yes" : "no" ) << endl;
}
}
| 0
| 36,898,284
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string a; cin >> a;
vector<int64_t> c(26, 0); for (char i : a) c[i - 'a']++;
int64_t ans = (int64_t)a.size() * ((int64_t)a.size() - 1) / 2 + 1;
for (auto i = 0; i < 26; i++) ans -= c[i] * (c[i] - 1) / 2;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
ll N, K;
cin >> N >> K;
vec<ll> P(N);
rep(i, N) cin >> P[i], --P[i];
vec<ll> C(N);
rep(i, N) cin >> C[i];
ll ans = -1e18;
rep(i, N) {
vec<ll> cycle;
ll now = i;
ll sm = 0;
while (true) {
sm += C[now];
cycle.push_back(sm);
now = P[now];
if (now == i) break;
}
ll tmp = -1e18;
ll sz = cycle.size();
rep(j, sz) {
if(K<j+1) break;
ll roop = (K - j - 1) / sz;
if (sm > 0) {
tmp = sm * roop + cycle[j];
} else {
tmp = cycle[j];
}
ans = max(ans, tmp);
}
}
cout << ans << endl;
}
| 0
| 24,699,459
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,w=0,n,i,c=0;
cin>>a>>b;
if(b==1 && a!=1) std::cout << "Bob" << '\n';
else if(a==1 && b!=1) std::cout << "Alice" << '\n';
else if(a>b) std::cout << "Alice" << '\n';
else if(a<b) std::cout << "Bob" << '\n';
else if(a==b) std::cout << "Draw" << '\n';
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
int X, Y, A, B, C;
priority_queue<int, vector<int>, greater<int>> pq;
vector<int> a, b, c;
int ans;
int max_ans = 0;
void update(int x)
{
if(pq.size() != Y)
{
ans += x;
pq.push(x);
}
else
{
int v = pq.top();
pq.pop();
ans -= v;
x = max(x, v);
pq.push(x);
ans += x;
}
}
signed main()
{
cin >> X >> Y >> A >> B >> C;
int v;
rep(i, A)
{
cin >> v;
a.push_back(v);
}
rep(i, B)
{
cin >> v;
b.push_back(v);
}
rep(i, C)
{
cin >> v;
c.push_back(v);
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
sort(c.rbegin(), c.rend());
int aa = max(X - C, 0ll), cc = min(X, C);
rep(i, B)update(b[i]);
rep(i, C)
{
if(i < cc)ans += c[i];
else update(c[i]);
}
max_ans = ans;
rep(i, min(X, A))
{
if(i < aa)ans += a[i];
else
{
ans += a[i];
ans -= c[cc - 1 - (i - aa)];
update(c[cc - 1 - (i - aa)]);
}
max_ans = max(ans, max_ans);
}
cout << max_ans << endl;
return 0;
}
| 0
| 21,221,470
|
#include <iostream>
int main(){
int A, B, C;
std::cin >> A >> B >> C;
int i=1;
while(1){
if (A*i % B == C){
std::cout << "YES" << std::endl;
break;
}
if (A*i % B == 0){
std::cout << "NO" << std::endl;
break;
}
i++;
}
}
|
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << endl;}
#define bug4( x , y , z , w) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << endl;}
#define bug5( x , y , z , w ,p) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << " " << (#p) <<"="<< p << endl;}
#define bug6( x , y , z , w ,p , q) {cerr << (#x) <<"="<<(x) << " " << (#y) <<"="<< (y) << " " << (#z) <<"="<< (z) << " " << (#w) <<"="<< w << " " << (#p) <<"="<< p << " " << (#q) <<"="<< q << endl;}
#define bugn( x , n ) {cerr << (#x) <<":";for(int i=0;i<n;i++)cerr << x[i] <<" "; cerr << endl;}
#define bugnm( x , n , m ) {cerr << (#x)<<endl;for(int i=0;i<n;i++){cerr << "Row #" << i<< ":";for(int j=0;j<m;j++)cerr << x[i][j] << " ";cerr << endl;}}
typedef long long ll;
typedef long double ld;
using namespace std;
const int maxn = 100;
const int dx[2]={+1,+0};
const int dy[2]={+0,+1};
struct box{
int x,y,z;
};
bool vis[maxn][maxn][maxn];
int32_t main(){
IOS
memset(vis,0,sizeof(vis));
int n,m;cin>>n>>m;
vector<string>s(n);
for(int i=0;i<n;i++){
cin>>s[i];
}
queue<box>q;
if( s[0][0] == '.' ){
vis[0][0][0]=1;
q.push({0,0,0});
}else{
vis[0][0][1]=1;
q.push({0,0,1});
}
while( q.size() ){
int x = q.front().x ;
int y = q.front().y ;
int z = q.front().z ;
q.pop();
for(int k=0;k<2;k++){
int x1 = x + dx[k];
int y1 = y + dy[k];
if( x1 < n && y1 < m ){
int z1 = s[x][y] == '#' ? z : s[x1][y1] == '.' ? z : z +1;
if( z1 < maxn && !vis[x1][y1][z1] ){
vis[x1][y1][z1]=1;
q.push({x1,y1,z1});
}
}
}
}
for(int i=0;i<maxn;i++){
if( vis[n-1][m-1][i] ){
cout << i << endl;
return 0;
}
}
}
| 0
| 21,497,981
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool lamp_check(bitset<10> s,int n,int m,vector<vector<int>> &array,vector<int> &p){
for(int i=0;i<m;i++){
int count = 0;
for(int j=0;j<(int)array.at(i).size();j++){
int num = array.at(i).at(j);
if(s.test(num)){
count++;
}
}
if(count % 2 != p.at(i)) return false;
}
return true;
}
int main(){
int n,m;
cin >> n >> m;
vector<vector<int>> switch_array(m);
vector<int> p(m);
for(int i=0;i<m;i++){
int k;
cin >> k;
for(int j=0;j<k;j++){
int l;
cin >> l;
switch_array.at(i).push_back(l-1);
}
}
for(int i=0;i<m;i++) cin >> p.at(i);
int c = 0;
for(int tmp=0; tmp < (1 << n); tmp++){
bitset<10> s(tmp);
if(lamp_check(s,n,m,switch_array,p)){
c++;
}
}
cout << c << endl;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int main() {
int n;
cin >> n;
vector<ll>a(n);
rep(i,n) cin >> a[i];
vector<ll>d(n+1);
map<ll,ll>mp;
mp[0] = 1;
ll ans = 0;
rep(i,n) {
d[i+1] = d[i] + a[i];
ans += mp[d[i+1]];
mp[d[i+1]]++;
}
cout << ans << endl;
}
| 0
| 39,910,535
|
#include <iostream>
int main () {
int w,h,n,x,y,a;
int finalX1, finalX2, finalY1, finalY2;
int finalX, finalY;
std::cin >> w >> h >> n;
finalX1 = finalX2 = finalY1 = finalY2 = 0;
for(int i=0; i < n; i++) {
std::cin >> x >> y >> a;
if(a == 1) {
if(x > finalX1) {
finalX1 = x;
}
} else if (a == 2 ) {
if(w-x > finalX2) {
finalX2 = w-x;
}
} else if (a == 3) {
if(y > finalY1) {
finalY1 = y;
}
} else {
if(h-y > finalY2) {
finalY2 = h-y;
}
}
}
finalX = w - (finalX1 + finalX2);
finalY = h - (finalY1 + finalY2);
if (finalX <=0 || finalY <= 0) {
std::cout << 0 << std::endl;
} else {
std::cout << finalX * finalY << std::endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
}
deque<int> b;
rep(i, n) {
if (i % 2 == n % 2) {
b.push_back(a[i]);
} else {
b.push_front(a[i]);
}
}
rep(i, n) {
printf("%d ", b[i]);
}
printf("\n");
}
| 0
| 18,281,157
|
#include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if((a*b)%2)
cout<<"Odd"<<endl;
else
cout<<"Even"<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(),a.end()),a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int,vector<int>,greater<int>>
#define PriP priority_queue<P<int,int>,vector<P<int,int>>,greater<P<int,int>>>
#define all(a) (a).begin(),(a).end()
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
signed main(){
string s;
cin >> s;
if(s == "keyence"){
cout << "YES" << endl;
return 0;
}
int n = s.size();
for(int i = 0; i < n; i++){
for(int j = i; j < n; j++){
string t ="";
for(int k = 0; k < n; k++){
if(k >= i && k <= j)
continue;
t.push_back(s[k]);
}
if(t == "keyence"){
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
return 0;
}
| 0
| 3,356,156
|
#include <iostream>
#include <cmath>
#define EPS 1.0e-5
using namespace std;
int main() {
double x1,y1,x2,y2,x3,y3,xp,yp;
double a[2],b[2];
double A,B;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp) {
a[0] = x2 - x1;
a[1] = y2- y1;
b[0] = x3 - x1;
b[1] = y3 - y1;
if(fabs(a[0]*b[0]+a[1]*b[1]) != 1) {
A = ( b[1] * (xp-x1) - b[0] * (yp-y1)) / (a[0] * b[1] - b[0] * a[1]);
B = (a[1] * (xp-x1) - (yp-y1) * a[0]) / (a[1] * b[0] - b[1] * a[0]);
if ((A+B < 1) && (A > 0) && (B > 0)) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
else
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#include<algorithm>
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
vector<ll>ch;
for(ll i=0;i<n;i++){
ch.push_back(i+1);
}
ll a,b;
vector<ll>A,B;
for(ll i=0;i<n;i++){
ll x;
cin>>x;
A.push_back(x);
}
for(ll i=0;i<n;i++){
ll x;
cin>>x;
B.push_back(x);
}
ll now=0;
do{
if(ch==A){
a=now;
}
if(ch==B){
b=now;
}
now++;
}while(next_permutation(ch.begin(),ch.end()));
cout << abs(a-b);
return 0;
}
| 0
| 15,828,847
|
#include<iostream>
using namespace std;
int main()
{
while (1)
{
int n, s;
int ans = 0;
cin >> n >> s;
if (n == 0 && s == 0)break;
int comb = (1 << n) - 1;
while (comb < (1 << 10))
{
int sum = 0;
for (int i = 0; i < 10; i++)
{
if ((comb >> i) & 1)sum += i;
}
if (sum == s)ans++;
int x = comb&-comb, y = comb + x;
comb = ((comb&~y) / x >> 1) | y;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
int n;
cin >> n;
vector<string> vs;
char ch;
bool ok=true;
rp(i,n){
string w;
cin >> w;
vs.push_back(w);
if(i>=1&&ch!=w[0]){
ok=false;
}
reverse(all(w));
ch=w[0];
}
sort(all(vs));
rp(i,n-1){
if(vs[i]==vs[i+1]) ok=false;
}
Yes(ok);
return 0;
}
| 0
| 37,573,811
|
#include <iostream>
using namespace std;
int main(void)
{
int k, a, b; cin >> k >> a >> b;
bool flag = 0;
int tmp = k;
while (tmp <= b)
{
if (tmp >= a && tmp <= b)
{
flag = true;
break;
}
tmp += k;
}
if (flag) cout << "OK" << endl;
else cout << "NG" << endl;
}
|
#include <bits/stdc++.h>
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 REP(i, x, n) for(int i = x; i < n; i++)
int main(){
int h,w; cin >> h >> w;
string s;
rep(i, h){
rep(j, w){
cin >> s;
if(s == "snuke"){
cout << (char)(j + 'A') << i+1 << endl;
return 0;
}
}
}
}
| 0
| 61,936,130
|
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b.at(i);
vector<int> a(n);
a.at(0) = b.at(0);
rep(i, n - 1) {
if (a.at(i) > b.at(i)) a.at(i) = b.at(i);
for (int j = a.at(i); j <= b.at(i); j++) {
a.at(i + 1) = j;
}
}
ll ans = 0;
rep(i, n) {
ans += a.at(i);
}
cout << ans << endl;
return 0;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
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 ll mod=1e9+7;
int main(){
ll n;
cin >> n;
ll t=0;
ll x=0,y=0;
bool ok=true;
rep(i,n){
ll cur,nx,ny;
cin >> cur >> nx >> ny;
ll d=abs(x-nx)+abs(y-ny);
ll dt=cur-t;
if(d<=dt && (dt-d)%2==0){
t=cur;
x=nx;
y=ny;
}
else{
ok=false;
break;
}
}
if(ok) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0
| 10,536,451
|
#include "iostream"
#include "string"
#include "algorithm"
using namespace std;
int main(int argc, char const *argv[])
{
string str;
int q=0;
string sub1,sub4,rev;
int sub2,sub3;
cin >> str;
cin >> q;
for (int i = 0; i < q; ++i)
{
cin >> sub1;
if (sub1 == "print")
{
cin >> sub2 >> sub3;
cout << str.substr(sub2, sub3-sub2+1) << endl;
}
else if (sub1 == "reverse")
{
cin >> sub2 >> sub3;
rev = str.substr(sub2, sub3-sub2+1);
reverse(rev.begin(), rev.end());
str = str.replace(sub2, rev.size(), rev);
}
else if (sub1 == "replace")
{
cin >> sub2 >> sub3 >> sub4;
str = str.replace(sub2, sub3 - sub2 +1, sub4);
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
int rec(int h,int m,int s){
return h*3600+m*60+s;
}
int cnt[60*60*24+1];
int main(){
int n;
while(cin>>n&&n){
memset(cnt,0,sizeof(cnt));
int h1,m1,s1,h2,m2,s2;
REP(i,n){
scanf("%d:%d:%d %d:%d:%d",&h1,&m1,&s1,&h2,&m2,&s2);
cnt[rec(h1,m1,s1)]++;
cnt[rec(h2,m2,s2)]--;
}
int ans=0;
REP(i,60*60*24+1){
if(i==0)continue;
cnt[i]+=cnt[i-1];
ans=max(cnt[i],ans);
}
cout<<ans<<endl;
}
}
| 0
| 83,725,358
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(void){
int n;
while(cin >> n, n){
vector<string> a(n);
int cnt=0;
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i+1<n;i++)
cnt += a[i][1]==a[i+1][1];
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;string s;
cin >> n >> s;
int x=0;
int d=0,a;
for(int i = 0; i < n; i++) {
if(s[i]=='(') d++;
else d--;
x=min(x,d);
}
for(int i = 0; i < -x; i++) {
cout << '(';
}
cout << s;
for(int i = 0; i < d-x; i++) {
cout << ')';
}
cout << endl;
return 0;
}
| 0
| 72,878,387
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = MAX7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1000000007;
ll T = 1;
ll n, q, x, K;
string s, t;
void MAIN() {
cin>>n;
ll a,b;
cin>>a>>b;
vll p(n);
vll cnt(3,0);
for(ll i=0;i<n;i++) {
cin>>p[i];
if(p[i] <= a) cnt[0]++;
else if(p[i] > b) cnt[2]++;
else cnt[1]++;
}
cout<<min({cnt[0],cnt[1],cnt[2]});
}
int main() {
fastio; randomINT;
while (T--) {
MAIN();
}
return 0;
}
|
#include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; }
const int N = 50;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll k;
cin >> k;
cout << N << endl;
for(int i = 0; i < N; i++) {
if(i < N - 1 - (k - 1) % N) {
cout << (k - 1) / N + i << " ";
} else if(i == N - 1) {
cout << (k - 1) / N + N << " ";
} else {
cout << (k - 1) / N + N - 1 << " ";
}
}
cout << endl;
return 0;
}
| 0
| 54,450,810
|
#include <iostream>
using namespace std;
int main()
{
int n;
int *a;
long int total_a = 0;
long int e = 1;
long int ans = 0;
cin >> n;
a = (int*)malloc(( n + 1 ) * sizeof( int ));
if ( NULL == a ) { return -1; }
for ( int i = 0 ; i <= n ; ++i ) { cin >> a[i]; total_a += a[i]; }
for ( int i = 0 ; i <= n ; ++ i ) {
ans += e;
if ( e < a[i] ) { cout << -1 << endl; return 0; }
e = 2 * ( e - a[i] );
total_a -= a[i];
e = min( e, total_a );
}
cout << ans << endl;
}
|
#include<iostream>
using namespace std;
int main() {
int a;
int b;
while (1) {
cin >> a >> b;
if (a == 0) {
if (b == 0) break;
}
if (a<=b) {
cout << a << " " << b << endl;
} else {
cout << b << " " << a << endl;
}
}
return 0;
}
| 0
| 45,619,011
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
vector<int>vec(N);
vector<int>vec2(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
vec2.at(i)=vec.at(i);
}
sort(vec2.begin(),vec2.end());
reverse(vec2.begin(),vec2.end());
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(vec.at(i)==vec2.at(j)){
if(vec2.at(j)==vec2.at(j+1)){
cout <<vec2.at(j)<<endl;
break;
}
}
if(vec.at(i)!=vec2.at(j)){
cout <<vec2.at(j)<<endl;
break;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N; string s, a, b, A, B;
void change(int i){
int j=(N+i-1)%N, k=(i+1)%N;
A[i]=(A[i]=='S')?'W':'S'; a[i]=(a[i]=='o')?'x':'o';
a[j]=(a[j]=='o')?'x':'o'; a[k]=(a[k]=='o')?'x':'o';
B[i]=(B[i]=='S')?'W':'S'; b[i]=(b[i]=='o')?'x':'o';
b[j]=(b[j]=='o')?'x':'o'; b[k]=(b[k]=='o')?'x':'o';
}
void flipA(int c){ for(int i=c+2; i<c+N; i+=3){change(i%N);} }
void flipB(int c){ for(int i=c+1; i<c+N; i+=3){change(i%N);} }
int main(){
cin >> N >> s;
a=string(N,'o'); b=string(N,'x');
A=string(N,'S'); B=string(N,'W');
for(int i=0; i<N-2; i++){ if(a[i]!=s[i]){change(i+1);} }
if(a[N-2]==s[N-2]&&a[N-1]==s[N-1]){ cout << A << "\n"; }
else if(N%3==0){ cout << -1 << "\n"; }
else if(N%3==1){
if(a[N-2]==s[N-2]){ flipA(N-1); cout << B << "\n"; }
else if(a[N-1]==s[N-1]){ flipA(N-2); cout << B << "\n"; }
else{ flipA(N-2); flipA(N-1); cout << A << "\n"; }
}
else{
if(a[N-2]==s[N-2]){ flipB(N-1); cout << B << "\n"; }
else if(a[N-1]==s[N-1]){ flipB(N-2); cout << B << "\n"; }
else{ flipB(N-2); flipB(N-1); cout << A << "\n"; }
}
}
| 0
| 13,018,524
|
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
int n;
string cmd, dna;
set<long long int> dictionary;
cin>>n;
for(int i=0;i<n;i++){
cin>>cmd>>dna;
long long int x = 0;
if(cmd == "insert"){
for(int j=0;j<dna.length();j++){
if(dna[j] == 'A')
x += 1 * pow((double)10, (double)(j+1));
else if(dna[j] == 'C')
x += 2 * pow((double)10, (double)(j+1));
else if(dna[j] == 'G')
x += 3 * pow((double)10, (double)(j+1));
else if(dna[j] == 'T')
x += 4 * pow((double)10, (double)(j+1));
}
dictionary.insert(x);
}else if(cmd == "find"){
for(int j=0;j<dna.length();j++){
if(dna[j] == 'A')
x += 1 * pow((double)10, (double)(j+1));
else if(dna[j] == 'C')
x += 2 * pow((double)10, (double)(j+1));
else if(dna[j] == 'G')
x += 3 * pow((double)10, (double)(j+1));
else if(dna[j] == 'T')
x += 4 * pow((double)10, (double)(j+1));
}
if(dictionary.find(x) == dictionary.end())
cout<<"no"<<endl;
else
cout<<"yes"<<endl;
}
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<iomanip>
#include<map>
#include<cstring>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
int main(){
int N, M;cin >> N >> M;
int G[N][N];
rep(i, N)
rep(j, N)
if(i == j)
G[i][j] = 0;
else
G[i][j] = INF;
int a[M], b[M], c[M];
rep(i, M){
cin >> a[i] >> b[i] >> c[i];
--a[i];--b[i];
G[a[i]][b[i]] = G[b[i]][a[i]] = c[i];
}
for(int k = 0;k < N;++k){
for(int i = 0;i < N;++i){
for(int j = 0;j < N;++j){
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
}
}
}
int ans = 0;
for(int i = 0;i < M; ++i){
bool flg = false;
for(int j = 0; j < N; ++j){
if(G[j][a[i]] + c[i] == G[j][b[i]])flg = true;
}
if(!flg)ans++;
}
cout << ans;
}
| 0
| 33,570,204
|
#include <bits/stdc++.h>
#define N 100005
using namespace std ;
inline int read ()
{
char c = getchar () ; int x = 0 , f = 1 ;
while (c < '0' || c > '9') { if (c == '-') f = -1 ; c = getchar () ; }
while (c >= '0' && c <= '9'){ x = x * 10 + c - '0' ; c = getchar () ; }
return x * f ;
}
int n , a[N] , l , q , f[N][33] , ans ;
int main ()
{
n = read () ;
for (int i = 1 ; i <= n ; i ++) a[i] = read () ;
l = read () ; q = read () ;
for (int i = 1 ; i <= n ; i ++)
{
f[i][0] = upper_bound (a + 1 , a + n + 1 , a[i] + l) - a - 1 ;
}
for (int j = 1 ; j <= 30 ; j ++)
for (int i = 1 ; i <= n ; i ++)
f[i][j] = f[f[i][j - 1]][j - 1] ;
while (q --> 0)
{
int x = read () , y = read () ;
if (x > y) swap (x , y) ;
int tmp = x ;
for (int i = 30 ; i >= 0 ; i --)
{
if (f[tmp][i] < y)
{
ans += (1 << i) ;
tmp = f[tmp][i] ;
}
}
cout << ans + 1 << "\n" ;
ans = 0 ;
}
}
|
#include <iostream>
#include <vector>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <numeric>
#include <iterator>
using namespace std;
namespace {
}
int main()
{
set<int> paint;
for (int i = 0; i < 3; ++i){
int ptmp;
cin >> ptmp;
paint.insert(ptmp);
}
cout << paint.size() << endl;
return 0;
}
| 0
| 3,902,147
|
#include<bits/stdc++.h>
#define ll long long
#define db double
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define A first
#define B second
#define lowbit(p) (p&(-p))
using namespace std;
void read(int &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=getchar())x=(x<<1)+(x<<3)+(c^48);
x*=p;
}
void read(ll &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=getchar())x=(x<<1)+(x<<3)+(c^48);
x*=p;
}
void Min(int &x,int y){
if (x>y)x=y;
}
void Min(ll &x,ll y){
if (x>y)x=y;
}
void Max(int &x,int y){
if (x<y)x=y;
}
void Max(ll &x,ll y){
if (x<y)x=y;
}
map<int,int>f;
struct node{
priority_queue<int>q;
void clear(){
for (;!q.empty();)q.pop();
}
void push(int x){
q.push(x);
}
void upd(int x){
for (;!q.empty();){
int t=q.top();
if (t>x){
f[t]=0;
q.pop();
}
else return ;
}
}
}q;
#define M 200005
int a[M],n;
bool chk(int l){
q.clear();
f.clear();
q.push(1);
if (a[1]!=1){
q.push(a[1]);
}
int i,x;
for (i=2;i<=n;i++){
if (a[i]>a[i-1]){
q.push(a[i]);
}
else if (a[i]==a[i-1]){
x=a[i];
f[x]++;
for (;f[x]==l;){
if (x==1)return 0;
f[x]=0;
f[x-1]++;
x--;
q.push(x);
}
}
else{
x=a[i];
q.upd(x);
q.push(x);
f[x]++;
for (;f[x]==l;){
if (x==1)return 0;
f[x]=0;
f[x-1]++;
x--;
q.push(x);
}
}
}
return 1;
}
int main(){
read(n);
int i,l,r,mid,res=0;
for (i=1;i<=n;i++){
read(a[i]);
}
int fl=1;
for (i=2;i<=n;i++)if (a[i-1]>=a[i])fl=0;
if (fl){
printf("1\n");
return 0;
}
l=2; r=n;
for (;l<=r;){
mid=(l+r)>>1;
if (chk(mid)){
r=mid-1;
res=mid;
}
else{
l=mid+1;
}
}
printf("%d\n",res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
map<char, bool> M;
for (auto o : s)
{
if(M[o])
{
cout << "no" << endl;
return 0;
}
M[o] = 1;
}
cout << "yes" << endl;
return 0;
}
| 0
| 66,433,052
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll x,a;
cin>>x>>a;
if(x<a){
cout << 0;
}
else{
cout << 10;
}
return 0;
}
|
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popcount __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
#define printpii(a) cout << a.ft << " " << a.sd << endl;
#define printpiii(a) cout << a.ft << " " << a.sd.ft << " " << a.sd.sd << endl;
#define print(a, n) rep(i, n) cout << a[i] << " "; cout << endl;
#define printv(v) for(auto x: v)cout << x << " "; cout << endl;
#define printm(a, n, m) rep(i, n) { rep(j, m) cout << a[i][j] << "\t"; cout << endl;}
ll dx[4] = {0, 0, 1, -1};
ll dy[4] = {1, -1, 0, 0};
void fast(){ios_base::sync_with_stdio(false);cin.tie(0);cout << setprecision(12) << fixed;}
void solve(){
ll a, b, c, d, x;
cin >> a >> b >> c >> d >> x;
x *= 100;
ll ans = 0;
if(x >= 200){
ll k = x / 200;
ans += min({k*d, k*2*c, k*4*b, k*8*a});
x %= 200;
}
if(x >= 100){
ll k = x / 100;
ans += min({k*c, k*2*b, k*4*a});
x %= 100;
}
if(x >= 50){
ll k = x / 50;
ans += min({k*b, k*2*a});
x %= 50;
}
ans += x*a;
cout << ans;
}
main(){
fast();
ll t = 1;
while(t--){
solve();
}
}
| 0
| 69,635,175
|
#include <iostream>
using namespace std;
int main()
{
int value = 0;
int count = 0;
do
{
if (count > 0)
cout << "Case " << count << ": " << value << endl;
++count;
cin >> value;
} while(value != 0);
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
#define rep(i,n) for(int i=0; i<n; i++)
#define repm(i,s,n) for(int i=s; i<n; i++)
const int INF = 1 << 30;
const ll INF_L = 1LL << 60;
const int MOD = 998244353;
int ctoi(char c){
if(isdigit(c)) return c - '0';
else if(islower(c)) return c - 'a';
else if(isupper(c)) return c - 'A';
else return -1;
}
char itocd(int i){char c = i+'0'; if(isdigit(c)) return c; else return 0x00;}
char itocl(int i){char c = i+'a'; if(islower(c)) return c; else return 0x00;}
char itocu(int i){char c = i+'A'; if(isupper(c)) return c; else return 0x00;}
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; }
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void Dijkstra(){}
void BellmanFord(){}
void WarshallFloyd(){}
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 * B / gcd(A, B);}
ll divtimes(ll N, ll D) {ll res = 0; while(N%D == 0) {N/=D; res++;} return res;}
ll powMod(ll B, ll P) {
if(P == 0) return 1;
if(P%2 == 0){ll t = powMod(B, P/2); return t*t % MOD;}
return B * powMod(B, P-1) % MOD;
}
const int FAC_INIT_SIZE = 3e3+9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i=2; i < FAC_INIT_SIZE; 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 factMod(ll N){return fac[N] % MOD;}
ll factInvMod(ll N){return finv[N] % MOD;}
ll permMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else return factMod(N) * factInvMod(N-K) % MOD;
}
ll combMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else if (N < FAC_INIT_SIZE){ return factMod(N) * (factInvMod(K) * factInvMod(N-K) % MOD) % MOD;}
else {
ll ans = 1; ll Ks = K < N-K ? K : N-K;
for (ll i=N; i > N-Ks; i--) {ans *= i; ans %= MOD;}
return ans * factInvMod(Ks) % MOD;
}
}
vector<bool> isprime;
void sieveInit(int s){
isprime.resize(s);
isprime[0] = isprime[1] = false;
isprime[2] = true;
for(int i=3; i<s; i++) isprime[i] = i%2 != 0;
for(int i=3; i<sqrt(s)+1; i+=2){
if(isprime[i]) {int m = 3*i; while(m < s){isprime[m] = false; m += 2*i;}}
else continue;
}
}
struct primeFactor{
ll number;
map<ll, int> exponent;
};
primeFactor primeFactorInit(ll number){
primeFactor pf;
pf.number = number;
for(int i=2; i<sqrt(pf.number)+1; i++){
while(number%i == 0) {pf.exponent[i]++; number /= i;}
if(number == 1) break;
}
if(number != 1) pf.exponent[number]++;
return pf;
}
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int N, M; cin >> N >> M;
vector<set<int>> setv(N);
rep(i, M) {
int A, B; cin >> A >> B; A--; B--;
setv[A].insert(B);
setv[B].insert(A);
}
queue<int> queue;
queue.push(0);
vector<int> res(N, -1);
while(!queue.empty()){
int v = queue.front();
for(auto a : setv[v]){
if(res[a] == -1) {queue.push(a); res[a] = v+1;}
}
queue.pop();
}
cout << "Yes" << endl;
repm(i, 1, N) cout << res[i] << endl;
}
| 0
| 29,095,745
|
#include <iostream>
#define rep(i,a) for(i = 0; i < a; i++)
using namespace std;
class Card {
public:
string suit;
int value;
void InputCard(string T);
};
void Card::InputCard(string T) {
suit = T[0];
value = T[1] - '0';
}
void print(Card card[],int n) {
int i;
rep(i,n){
if(i > 0){
cout << " ";
}
cout << card[i].suit << card[i].value;
}
cout << endl;
}
void bubblesort(Card card[],int n) {
int i;
rep(i,n) {
for(int j = n-1; j > i; j--) {
if(card[j].value < card[j-1].value) {
swap(card[j],card[j-1]);
}
}
}
}
void selectionsort(Card card[],int n) {
int i;
rep(i,n) {
int minj = i;
for(int j = i; j < n; j++) {
if(card[j].value < card[minj].value) {
minj = j;
}
}
swap(card[i],card[minj]);
}
}
bool isStable(Card card1[], Card card2[], int n) {
int i;
rep(i,n) {
if(card1[i].suit != card2[i].suit) {
return false;
}
}
return true;
}
int main(void) {
int i,n;
string T;
cin >> n;
Card *Card1 = new Card[n];
Card *Card2 = new Card[n];
rep(i,n) {
cin >> T;
Card1[i].InputCard(T);
Card2[i].InputCard(T);
}
bubblesort(Card1,n);
selectionsort(Card2,n);
print(Card1,n);
cout << "Stable" << endl;
print(Card2,n);
if(isStable(Card1,Card2,n)) {
cout << "Stable" << endl;
} else {
cout << "Not stable" << endl;
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
char a[1001][1001];
int v[1001][1001],n,h,w,sx,sy,ans;
int dir[4][2]={-1,0,1,0,0,1,0,-1};
char b[1001];
int s[1001][1001];
struct st
{
int x,y;
}st1,st2,fl,pp;
int check(st kk)
{
if(kk.x>=0&&kk.x<h&&kk.y>=0&&kk.y<w)
return 1;
else
return 0;
}
int bfs(char c)
{
queue<st>qq;
qq.push(pp);
memset(v,0,sizeof(v));
memset(s,0,sizeof(s));
while(!qq.empty())
{
st1=qq.front();
qq.pop();
if(a[st1.x][st1.y]==c)
{
pp=st1;
break;
}
for(int i=0;i<4;i++)
{
st2.x=st1.x+dir[i][0];
st2.y=st1.y+dir[i][1];
if(check(st2)&&v[st2.x][st2.y]==0&&a[st2.x][st2.y]!='X')
{
v[st2.x][st2.y]=1;
s[st2.x][st2.y]=s[st1.x][st1.y]+1;
qq.push(st2);
}
}
}
return s[pp.x][pp.y];
}
int main()
{
int i,j,k,m,l;
while(~scanf("%d %d %d",&h,&w,&n))
{
getchar();
memset(v,0,sizeof(v));
memset(s,0,sizeof(s));
for(i=0;i<h;i++)
{
scanf("%s",&a[i]);
}
for(i=0;i<n;i++)
{
b[i]=i+1+'0';
}
for(i=0;i<h;i++)
{
for(j=0;j<w;j++)
{
if(a[i][j]=='S')
{
pp.x=i;
pp.y=j;
}
}
}
int sum=0;
for(i=0;i<n;i++)
{
sum+=bfs(b[i]);
}
printf("%d\n",sum);
}
return 0;
}
| 0
| 23,963,596
|
#include<stdio.h>
main(){float n,m,d;scanf("%f%f%f",&n,&m,&d);printf("%f",(d?2:1)*(n-d)*(m-1)/n/n);}
|
#include <bits/stdc++.h>
#include <vector>
#include <cstdlib>
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 = 1LL << 60;
const int MAX = 100000;
long long a[MAX],b[MAX],c[MAX], dp_a[MAX], dp_b[MAX], dp_c[MAX];
void solve() {
int N;
int lastE;
long long value=-INF;
cin >> N ;
for(int i=0;i<N;i++){
cin >> a[i] >> b[i] >> c[i];
}
for(int i=0;i<MAX;i++){
dp_a[i] = -INF;
dp_b[i] = -INF;
dp_c[i] = -INF;
}
dp_a[0] = a[0];
dp_b[0] = b[0];
dp_c[0] = c[0];
for(int i=0; i<N;i++){
chmax(dp_b[i+1], dp_a[i]+b[i+1]);
chmax(dp_c[i+1], dp_a[i]+c[i+1]);
chmax(dp_a[i+1], dp_b[i]+a[i+1]);
chmax(dp_c[i+1], dp_b[i]+c[i+1]);
chmax(dp_b[i+1], dp_c[i]+b[i+1]);
chmax(dp_a[i+1], dp_c[i]+a[i+1]);
}
cout << max({dp_a[N-1],dp_b[N-1],dp_c[N-1]}) <<endl;
return;
}
int main() {
solve();
return 0;
}
| 0
| 81,384,932
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
static const int MAX = 100;
int N;
int ADJ[MAX][MAX];
int depth[MAX];
enum STATUS { ACTIVE = 0, MARKED, VISITED, };
int status[MAX] = {ACTIVE};
void visit(int id) {
status[id] = VISITED;
}
void mark(int id) {
status[id] = MARKED;
}
void bfs(int id) {
queue<int> q;
q.push(id);
depth[id] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
visit(u);
for (int i = 0; i < N; i++) {
if (ADJ[u][i] && status[i] == ACTIVE) {
q.push(i);
mark(i);
depth[i] = depth[u] + 1;
}
}
}
}
int main() {
cin >> N;
int id, nn, x;
for (int i = 0; i < N; i++) {
cin >> id >> nn;
id--;
for (int j = 0; j < nn; j++) {
cin >> x;
x--;
ADJ[id][x] = 1;
}
}
for (int i = 0; i < N; i++)
depth[i] = -1;
bfs(0);
for (int i = 0; i < N; i++)
cout << i+1 << " " << depth[i] << endl;
}
|
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N) ;
for(int i=0;i<N;i++){
cin >> A.at(i) ;
}
int diff ;
int max_diff=0;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if((A.at(i)) > (A.at(j))){
diff = (A.at(i)) - (A.at(j));
if(diff > max_diff){max_diff = diff ;}
}
else{
diff = (A.at(j)) - (A.at(i));
if(diff > max_diff){max_diff = diff ;}
}
}
}
cout << max_diff << endl;
}
| 0
| 15,515,359
|
#include <bits/stdc++.h>
using namespace std;
long aps(long a, long d, long n) {
return n * (2 * a + (n - 1) * d) / 2;
}
int main() {
long N, K, MOD = 1e9+7;
cin >> N >> K;
long ans = 0;
for (long k = K; k <= N + 1; k++) {
long mi = aps(0, 1, k);
long mx = aps(N - k + 1, 1, k);
ans += mx - mi + 1;
ans %= MOD;
}
cout << ans << "\n";
}
|
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
string s;
cin >> s;
ll ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if ((s[i] == 'B' && s[i + 1] == 'W') || (s[i] == 'W' && s[i + 1] == 'B')) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 25,274,728
|
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hell;
}}
ll gcd(ll x,ll y)
{
if(y==0)
return x;
else
return gcd(y,x%y);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
ll a,b;
cin>>a>>b;
if(a*500>=b)
cout<<"Yes";
else
cout<<"No";}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main()
{
ll N, K; cin >> N >> K;
ll ans = 1;
for (int i = 0; i < N; ++i) {
ll tmp1 = ans * 2;
ll tmp2 = ans + K;
if (tmp1 < tmp2) ans = tmp1;
else ans = tmp2;
}
cout << ans << endl;
}
| 0
| 85,686,761
|
#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; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
#define fs first
#define sc second
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>;
int main(void)
{
cout.tie(0);
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll a,b,m;
cin >> a >> b >> m;
vector<ll> A(a);
vector<ll> B(b);
cins(all(A));
cins(all(B));
ll ma = *min_element(all(A));
ll mb = *min_element(all(B));
ll ans = ma + mb;
rep(i, m){
ll x,y,c;
cin >> x >> y >> c;
--x, --y;
chmin(ans, A[x] + B[y] - c);
}
print(ans);
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
ll ans = -1e12;
vector<ll> x(N);
vector<ll> y(N);
vector<ll> z(N);
rep(i, N) cin >> x[i] >> y[i] >> z[i];
rep(b, 8) {
vector<ll> anss(N, 0);
rep(i, N) {
ll sm = 0;
sm += (b & (1 << 0)) ? x[i] : -x[i];
sm += (b & (1 << 1)) ? y[i] : -y[i];
sm += (b & (1 << 2)) ? z[i] : -z[i];
anss[i] = sm;
}
sort(all(anss), greater<ll>());
ll tmp = 0;
rep(m, M) tmp += anss[m];
ans = max(ans, tmp);
}
cout << ans << endl;
}
| 0
| 98,513,676
|
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60;
const ll mod=1e9+7 ;
int main(){
ll n,x;
cin >> n >> x;
ll ans=n;
n-=x;
while(x){
ans+=2*x*(n/x);
if(n%x==0)ans-=2*x;
ll temp=n%x;
n=x;
x=temp;
}
ans+=n;
cout << ans << endl;
return 0;}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
char str[256];
char f[4]={'m','c','x','i'};
int n;
for(scanf("%d\n",&n);n--;){
int c;
int ans[2]={0,0};
for(int i=0;i<2;i++){
int tmp=0;
while((c=getchar())!=' '&&c!='\n'){
if(isdigit(c)){
tmp*=10;
tmp+=c-'0';
}else{
if(tmp==0) tmp=1;
switch(c){
case 'm':
tmp*=1000;
break;
case 'c':
tmp*=100;
break;
case 'x':
tmp*=10;
break;
case 'i':
break;
}
ans[i]+=tmp;
tmp=0;
}
}
}
int a=ans[0]+ans[1];
int s[4];
for(int i=0;i<4;i++){
s[i]=a%10;
a/=10;
}
for(int i=0;i<4;i++){
if(s[3-i]!=0){
if(s[3-i]==1)
printf("%c",f[i]);
else
printf("%d%c",s[3-i],f[i]);
}
}
puts("");
}
return 0;
}
| 0
| 24,716,571
|
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int n;
cin>>n;
vector<int> vec(n);
rep(i,n){
cin>>vec[i];
}
sort(all(vec));
cout<<vec[n/2]-vec[n/2-1]<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define put(a) cout<<a<<"\n"
#define all(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define oorret 0
#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a=b;return 1;}return 0;}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a=b;return 1;}return 0;}
int main(){
int n,m;
cin >> n >> m;
vector<int> l(m),r(m),d(m);
REP(i,m){
cin >> l[i] >> r[i] >> d[i];
l[i]--;
r[i]--;
}
vector<vector<P>> e(n);
REP(i,m){
e[l[i]].push_back(P(r[i],d[i]));
e[r[i]].push_back(P(l[i],-d[i]));
}
queue<int> q;
vector<int> dd(n,INT_MAX/2);
vector<int> visited(n,false);
if(m==0){
put("Yes");
return 0;
}
REP(i,m){
if(!visited[l[i]]){
q.push(l[i]);
dd[l[i]] = 0;
while(!q.empty()){
int p = q.front();
q.pop();
REP(i,e[p].size()){
int now = e[p][i].first;
if(!visited[now]){
dd[now] = dd[p]+e[p][i].second;
visited[now] = true;
q.push(now);
}else{
if(dd[now]!=dd[p]+e[p][i].second){
put("No");
return 0;
}
}
}
}
}
}
put("Yes");
return 0;
}
| 0
| 14,401,573
|
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
int N, K;
cin >> N >> K;
vector<ll> a(N);
for (auto i = 0; i < N; ++i)
{
cin >> a[i];
}
auto ans = LLONG_MAX;
for (auto i = 0; i < (1 << (N - 1)); ++i)
{
auto next = a[0] + 1;
auto sum = 0ll;
auto num = 1;
for (auto j = 0; j < N - 1; ++j)
{
if (a[j + 1] < next)
{
auto bit = 1 << j;
if ((i & bit) != 0)
{
sum += next - a[j + 1];
++num;
++next;
}
}
else
{
++num;
next = a[j + 1] + 1;
}
}
if (num >= K)
{
ans = min(ans, sum);
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF=1e18;
const int MOD=1e9+7;
int n;
int piyo(int x,int k){
return (x+k)%n;
}
signed main(){
cin>>n;
char s[n][n];
REP(i,n)REP(j,n)cin>>s[i][j];
int ans=0;
REP(k,n){
bool ok=true;
REP(i,n)REP(j,n){
if(s[piyo(i,k)][j]!=s[piyo(j,k)][i]){
ok=false;
break;
}
}
if(ok)ans++;
}
cout<<ans*n<<endl;
}
| 0
| 73,042,399
|
#include <bits/stdc++.h>
#include <cstring>
#include <ctype.h>
#include<stdlib.h>
#define flin freopen("input.txt", "r", stdin);
#define flout freopen("output.txt", "w", stdout);
#define ll long long
#define ull unsigned long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define nl '\n'
#define nll '\0'
#define pb push_back
#define bdyptb return 0;
#define sorted(x) sort(x.begin(), x.end())
#define reversed(x) reverse(x.begin(), x.end())
#define all(x) x.begin(), x.end()
#define mset(a, b) memset(a, b, sizeof(a));
#define testcase ll t,tt; cin>>tt; for(t=1;t<=tt;t++)
#define pi acos(-1.00)
#define mx 1000007
using namespace std;
int main()
{
fastio;
ll n,a,b;
cin>>n>>a>>b;
int x=abs(a-b)-1;
if(x&1)cout<<"Alice"<<nl;
else cout<<"Borys"<<nl;
bdyptb;
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
int a, b, c; cin >> a >> b >> c;
bool fg = true;
if(a%b== 0 && c != 0) fg = false;
else{
if(c%__gcd(a,b)!=0)fg = false;
}
if(fg) cout << "YES" << ln;
else cout << "NO" << ln;
}
| 0
| 76,859,696
|
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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 = 1e18;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<ll>> a(n, vector<ll>(3));
rep(i,n) cin >> a[i][0] >> a[i][1] >> a[i][2];
ll ans = 0;
rep(S,(1<<3)){
vector<ll> v;
rep(i,n){
ll b = 0;
rep(j,3){
if(S>>j & 1) b += a[i][j];
else b -= a[i][j];
}
v.push_back(b);
}
sort(v.rbegin(), v.rend());
ll cmp = 0;
rep(i,m) cmp += v[i];
chmax(ans, cmp);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#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 lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long long i = (long long)(a); i <= (long long)(n); i++)
#define irrep(i,n) for(int i = (int)(n); i > -1; i--)
#define irrep2(i,a,n) for(int i = (int)(n); i >= (int)(a); i--)
typedef long long ll;
typedef std::vector<char> v_char;
typedef std::vector<std::vector<char> > v2_char;
typedef std::vector<double> v_double;
typedef std::vector<std::vector<double> > v2_double;
typedef std::vector<int> v_int;
typedef std::vector<std::vector<int> > v2_int;
typedef std::vector<ll> v_ll;
typedef std::vector<std::vector<ll> > v2_ll;
typedef std::vector<std::string> v_string;
typedef std::vector<std::vector<std::string> > v2_string;
typedef std::vector<bool> v_bool;
typedef std::vector<std::vector<bool> > v2_bool;
typedef std::pair<ll, ll> pll;
typedef std::pair<int, int> pii;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(void)
{
int h, w;
cin >> h >> w;
v2_char s(h+1, v_char(w+1));
irep2(i, 1, h) {
irep2(j, 1, w) {
cin >> s[i][j];
}
}
irep2(i, 1, 2*h) {
irep2(j, 1, w) {
cout << s[(i+1)/2][j];
} cout << endl;
}
return 0;
}
| 0
| 31,055,918
|
#include <bits
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
typedef long long ll;
int main(){
int h,w;
cin>>h>>w;
string s[h];
for(int i=0;i<h;i++){
cin>>s[i];
}
for(int i=0;i<h;i++){
cout<<s[i]<<endl;
cout<<s[i]<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char* argv[]) {
string s;
cin >> s;
long long K;
cin >> K;
s += s + s;
long long base = 0;
bool changed[s.size()];
changed[0] = false;
for (int i = 1; i < s.size() / 3; ++i) {
if (s[i] == s[i - 1] && !changed[i - 1]) {
++base;
changed[i] = true;
} else
changed[i] = false;
}
long long sec = 0;
for (int i = s.size() / 3; i < 2 * s.size() / 3; ++i) {
if (s[i] == s[i - 1] && !changed[i - 1]) {
++sec;
changed[i] = true;
} else
changed[i] = false;
}
long long thi = 0;
for (int i = 2 * s.size() / 3; i < s.size(); ++i) {
if (s[i] == s[i - 1] && !changed[i - 1]) {
++thi;
changed[i] = true;
} else
changed[i] = false;
}
long long ret = base;
if (K - 1 > 0) {
if ((K - 1) % 2 == 0)
ret += (sec + thi) * (K - 1) / 2;
else
ret += (sec + thi) * (K - 2) / 2 + sec;
}
cout << ret << endl;
return 0;
}
| 0
| 38,666,653
|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) v.begin(), v.end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define LB(a,x) lb(all(a), x) - a.begin()
#define UB(a,x) ub(all(a), x) - a.begin()
#define MOD 1000000007
#define itn int
#define enld endl
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
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<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
int main(){
int N,A,B; cin >>N >> A >> B;
int P[105];
rep(i,N) cin >> P[i];
int cnt1 = 0;
int cnt2 = 0;
int cnt3 = 0;
rep(i,N){
if(P[i] <= A) cnt1++;
else if(A < P[i] && P[i] <= B) cnt2++;
else cnt3++;
}
cout << min(cnt1,min(cnt2,cnt3)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin>>n;
string s,t;
cin >> s>>t;
int co=0;
int ans=0;
rep(i,n){
int co=0;
rep(j,n-i){
if(t.at(j)==s.at(j+i)){
co++;
}
else{
ans=max(ans,co);
co=0;
}
}
ans=max(ans,co);
}
cout<<n*2-ans<<endl;
}
| 0
| 80,660,665
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int r, g, b, n;
cin >> r >> g >> b >> n;
int result = 0;
for (int i = 0; i <= n / r; i++) {
for (int j = 0; j <= (n - r * i) / g; j++) {
if ((n - r * i - g * j) % b == 0) result++;
}
}
std::cout << result << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
signed main()
{
SPEED;
int n;
cin>>n;
int a[n],b[n],c[n],dp1[n]={0},dp2[n]={0},dp3[n]={0};
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i]>>c[i];
}
dp1[0]=a[0];
dp2[0]=b[0];
dp3[0]=c[0];
for(int i=1;i<n;i++)
{
dp1[i]=max(dp2[i-1],dp3[i-1])+a[i];
dp2[i]=max(dp1[i-1],dp3[i-1])+b[i];
dp3[i]=max(dp2[i-1],dp1[i-1])+c[i];
}
cout<<max({dp1[n-1],dp2[n-1],dp3[n-1]});
}
| 0
| 66,717,079
|
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
const int N=1e5+5;
vector<int>ve[N];
priority_queue<int>qe;
int main()
{
int n,m;
cin>>n>>m;
int a,b;
for(int i=0;i<n;i++)
{
cin>>a>>b;
if(m-a+1<1)continue;
ve[m-a+1].push_back(b);
}
int anx=0;
for(int i=m;i>=1;i--){
for(int j=0;j<ve[i].size();j++){
qe.push(ve[i][j]);
}
if(!qe.empty()){
anx+=qe.top();qe.pop();
}
}
cout<<anx<<"\n";
}
|
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
int N, M; cin >> N >> M;
vector<vector<ll>> dist(N,vector<ll>(N,INF));
rep(i,N) dist[i][i] = 0;
vector<ll> a(M), b(M), c(M);
rep(i,M){
cin >> a[i] >> b[i] >> c[i];
a[i]--;
b[i]--;
dist[a[i]][b[i]] = c[i];
dist[b[i]][a[i]] = c[i];
}
rep(k,N){
rep(i,N){
rep(j,N){
dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j]);
}
}
}
int ans = 0;
rep(i,M){
if (c[i] > dist[a[i]][b[i]]) ans++;
}
cout << ans << endl;
}
| 0
| 35,185,131
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,x,y,a,b;
cin >> n >> m >> x >> y;
int MXx = -101,MNy = 101;
for ( int i = 0; i < n; i++){
cin >> a;
MXx = max(MXx,a);
}
for ( int i = 0; i < m; i++){
cin >> b;
MNy = min(MNy,b);
}
for ( int i = x + 1; i <= y; i++){
if ( MXx < i && i <= MNy ){
cout << "No War" << endl;
return 0;
}
}
cout << "War" << endl;
return 0;
}
|
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;
using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
#define DEBUG_VLL(vec) REP(sz, vec.size()) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');
const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;
ll n;
vll p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
p.resize(n);
vll pidx(n + 1);
for (ll i = 0; i < n; i++) {
cin >> p[i];
pidx[p[i]] = i;
}
ll ans = 0;
multiset<ll> iset;
iset.insert(n); iset.insert(n); iset.insert(-1); iset.insert(-1);
for (ll i = n; i >= 1; i--) {
ll pi = pidx[i];
auto it = iset.lower_bound(pi);
ll r1max = *it;
it++;
ll r2max = *it;
it--, it--;
ll l1max = *it;
it--;
ll l2max = *it;
ll cnt = (l1max - l2max) * (r1max - pi) + (r2max - r1max) * (pi - l1max);
ans += i * cnt;
iset.insert(pi);
}
cout << ans << '\n';
return 0;
}
| 0
| 55,122,748
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rev(x) greater<x>()
#define MOD 1000000007
#define INF 1000000000
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
LL modpower(LL n, LL m, LL mod)
{
if (m == 0) {
return 1;
} else if (m % 2 == 0) {
LL p = modpower(n, m/2, mod);
return p*p % mod;
} else {
return n*modpower(n, m-1, mod) % mod;
}
}
LL modinv(LL n, LL mod)
{
return modpower(n, mod-2, mod);
}
LL modcombination(LL n, LL r, LL mod)
{
LL ret = 1;
for (int i = 0; i < r; i++) {
ret *= (n-i);
ret %= mod;
ret *= modinv(i+1, mod);
ret % mod;
}
return ret % mod;
}
int gcd(int k, int l)
{
if (l > 0) return gcd(l, k%l);
else return k;
}
struct UnionFind
{
vector<int> par;
UnionFind(int n) : par(n) {
for (int i = 0; i < n; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main()
{
long n, m;
cin >> n >> m;
long ans = 0;
if (n*m == 1) {
ans = 1;
} else if (n == 1 || m == 1) {
ans = n*m - 2;
} else {
ans = (n - 2)*(m - 2);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int num;
int len;
cin >> num >> len;
string words[num];
for (int i = 0; i < num; i++)
{
cin >> words[i];
}
for (int i = 0; i < num - 1; i++)
{
for (int j = num - 1; j > i; j--)
{
string temp;
if (0 < words[j - 1].compare(words[j]))
{
temp = words[j - 1];
words[j - 1] = words[j];
words[j] = temp;
}
}
}
for (int i = 0; i < num; i++)
{
cout << words[i];
}
cout << endl;
return 0;
}
| 0
| 86,961,936
|
#include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
int ans = -1;
for(int i = 1 ; i <= 1000 ; i++){
if(int(i * 0.08) == a && int(i * 0.1) == b){
ans = i;
break;
}
}
cout << ans;
}
|
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pid = pair<int, ld>;
using Pis = pair<int, string>;
#define rep(i,n) for(int i=0; i<n; i++)
#define repm(i,s,n) for(int i=s; i<n; i++)
#define setprc(d) setprecision(d)
const int INF = 1 << 30;
const ll INF_L = 1LL << 60;
const int MOD = 1e9+7;
int ctoi(char c){
if(isdigit(c)) return c - '0';
else if(islower(c)) return c - 'a';
else if(isupper(c)) return c - 'A';
else return -1;
}
char itocd(int i){char c = i+'0'; if(isdigit(c)) return c; else return 0x00;}
char itocl(int i){char c = i+'a'; if(islower(c)) return c; else return 0x00;}
char itocu(int i){char c = i+'A'; if(isupper(c)) return c; else return 0x00;}
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; }
vector<vector<int>> adjMat;
vector<set<Pii>> adjList;
void Dijkstra(){}
void BellmanFord(){}
void WarshallFloyd(){}
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 * B / gcd(A, B);}
ll divtimes(ll N, ll D) {ll res = 0; while(N%D == 0) {N/=D; res++;} return res;}
ll powMod(ll B, ll P) {
if(P == 0) return 1;
if(P%2 == 0){ll t = powMod(B, P/2); return t*t % MOD;}
return B * powMod(B, P-1) % MOD;
}
const int FAC_INIT_SIZE = 1e6+9;
vector<ll> fac, finv, inv;
void factModInit() {
fac.resize(FAC_INIT_SIZE);
finv.resize(FAC_INIT_SIZE);
inv.resize(FAC_INIT_SIZE);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i=2; i < FAC_INIT_SIZE; 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 factMod(ll N){return fac[N] % MOD;}
ll factInvMod(ll N){return finv[N] % MOD;}
ll permMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else return factMod(N) * factInvMod(N-K) % MOD;
}
ll combMod(ll N, ll K){
if (N < 0 || K < 0 || N < K) return 0;
else if (N < FAC_INIT_SIZE){ return factMod(N) * (factInvMod(K) * factInvMod(N-K) % MOD) % MOD;}
else {
ll ans = 1; ll Ks = K < N-K ? K : N-K;
for (ll i=N; i > N-Ks; i--) {ans *= i; ans %= MOD;}
return ans * factInvMod(Ks) % MOD;
}
}
vector<bool> isprime;
void sieveInit(int size){
int sb = size + 9;
isprime.resize(sb);
isprime[0] = isprime[1] = false;
isprime[2] = true;
for(int i=2; i<sb; i++) {
if(i%2 == 0) isprime[i] = false;
else isprime[i] = true;
}
for(int i=3; i*i<=sb; i+=2){
if(isprime[i]){
int m = 3*i;
while(m < sb){isprime[m] = false; m += 2*i;}
} else {
continue;
}
}
}
int main() {
std::ifstream in("input.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
int N, M; cin >> N >> M;
vector<Pll> AB(N); rep(i, N) {ll A, B; cin >> A >> B; AB[i] = make_pair(A, B);}
sort(AB.begin(), AB.end());
ll res = 0;
int cnt = 0;
while(M > 0){
res += AB[cnt].first * min((ll)M, AB[cnt].second);
M -= min((ll)M, AB[cnt].second);
cnt++;
}
cout << res << endl;
}
| 0
| 79,931,757
|
#include<iostream>
int main(){
int K,X;
std::cin >> K >> X;
if (K*500 >= X) std::cout << "Yes\n";
else std::cout << "No\n";
}
|
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define rrepSE(i,s,e) for (int i = (s); i > (e); i--)
#define ssort(v) sort(v.begin(), v.end())
#define gsort(v) sort(v.rbegin(), v.rend())
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
#define DEBUG_PRINT(var) std::cout << #var << " = " << var << "\n";
int main()
{
int n;
cin >> n;
vector<int> a(n), ans(n);
rep(i,n) {
cin >> a[i];
ans[a[i]-1] = i+1;
}
rep(i,n)
cout << ans[i] << " ";
cout << "\n";
return 0;
}
| 0
| 63,222,038
|
#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 H, W, A, B;
cin >> H >> W >> A >> B;
rep(i, 0, H) {
if (i < B) {
cout << string(A, '1') << string(W - A, '0') << endl;
}
else {
cout << string(A, '0') << string(W - A, '1') << endl;
}
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
struct Node {
int key;
Node* prev;
Node* next;
};
Node* nil;
void Init() {
nil = (Node*)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void PrintList() {
Node* cur = nil->next;
int isf = 0;
while (1) {
if (cur == nil) break;
if (isf++ > 0) printf(" ");
printf("%d", cur->key);
cur = cur->next;
}
printf("\n");
}
void Insert(int key) {
Node* x = (Node*)malloc(sizeof(Node));
x->key = key;
x->next = nil->next;
nil->next->prev = x;
nil->next = x;
x->prev = nil;
}
Node* SearchNode(int key) {
Node* cur = nil->next;
while (cur != nil && cur->key != key) {
cur = cur->next;
}
return cur;
}
void DeleteNode(Node* n) {
if (n == nil) return;
n->prev->next = n->next;
n->next->prev = n->prev;
free(n);
}
void Delete(int key) {
DeleteNode(SearchNode(key));
}
void DeleteFirst() {
DeleteNode(nil->next);
}
void DeleteLast() {
DeleteNode(nil->prev);
}
int main() {
int n;
scanf("%d", &n);
char cmd[16];
int key;
Init();
for (int i = 0; i < n; i++) {
scanf("%s", cmd);
if (strcmp(cmd, "insert") == 0) {
scanf("%d", &key);
Insert(key);
} else if (strcmp(cmd, "delete") == 0) {
scanf("%d", &key);
Delete(key);
} else if (strcmp(cmd, "deleteFirst") == 0) {
DeleteFirst();
} else if (strcmp(cmd, "deleteLast") == 0) {
DeleteLast();
}
}
PrintList();
return 0;
}
| 0
| 51,552,541
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 10001;
vector<int> par(N);
vector<int> ran(N);
int find(int a){
if(par[a] == a)
return a;
else{
par[a] = find(par[a]);
return par[a];
}
}
void merge(int a, int b){
if(ran[find(a)] < ran[find(b)]){
par[find(a)] = find(b);
}
else if(ran[find(b)] < ran[find(a)]){
par[find(b)] = find(a);
}
else{
par[find(b)] = find(a);
ran[find(a)] += 1;
}
}
int main(){
int n, q;
cin >> n >> q;
for(int i = 0; i < n; i++){
par[i] = i;
ran[i] = 0;
}
for(int i = 0; i < q; i++){
int c, x, y;
cin >> c >> x >> y;
if(c == 0){
merge(x, y);
}
else{
if(find(x) == find(y))
cout << 1 <<endl;
else
cout << 0 <<endl;
}
}
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl p(n);
rep(i, n) {
cin >> p[i];
p[i]--;
}
vl b(n);
b[n-1] = 1;
for(ll i = n-2; i >= 0; i--) {
b[i] = 3*(n-1-i)*10000;
}
vl c(n);
ll ma = 1e9;
for(ll i = n-1; i >= 0; i--) {
c[p[i]] = ma;
ma--;
}
vl a(n);
rep(i, n) {
a[i] = c[i] - b[i];
}
rep(i, n) {
cout << a[i];
if(i < n-1) {
cout << " ";
}
}
cout << "\n";
rep(i, n) {
cout << b[i];
if(i < n-1) {
cout << " ";
}
}
cout << "\n";
re0;
}
| 0
| 38,957,114
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000001;
constexpr ll INF= 9 * 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
struct edge{
ll to,cost;
};
typedef pair<int,int> P;
int V;
vector<edge> G[100010];
ll d[100010];
int previ[100010];
void dijkstra(int s) {
priority_queue<P,vector<P>,greater<P>> que;
fill(d,d + V,INF);
fill(previ,previ + V,-1);
d[s] = 0;
que.push(P(0,s));
while(!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if(d[v] < p.first) {
continue;
}
for(int i = 0;i < G[v].size();i++) {
edge e = G[v][i];
if(d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
previ[e.to] = v;
que.push(P(d[e.to],e.to));
}
}
}
}
vector<int> get_path(int t) {
vector<int> path;
while(t != -1) {
path.push_back(t);
t = previ[t];
}
reverse(path.begin(),path.end());
return path;
}
int main() {
cin >> V;
for(int i = 0;i < V - 1;i++) {
ll A,B,C;
cin >> A >> B >> C;
G[A - 1].push_back(edge{B - 1,C});
G[B - 1].push_back(edge{A - 1,C});
}
int Q,K;
cin >> Q >> K;
K--;
dijkstra(K);
for(int i = 0;i < Q;i++) {
int A,B;
cin >> A >> B;
A--;
B--;
cout << d[A] + d[B] << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
int kyu[] = {2000, 1800, 1600, 1400, 1200, 1000, 800, 600, 400};
for (int i = 0; i < 9; i++) {
if (X >= kyu[i]) {
cout << i << endl;
break;
}
}
return 0;
}
| 0
| 96,025,453
|
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a, b) + min(c, d) << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#define MOD 1000000007
using namespace std;
typedef long long ll;
signed main(){
ll n,m,xsum=0,ysum=0,ans=0;
cin >> n >> m;
ll tx[n],ty[m],x[n],y[m];
for(ll i=0;i<n;i++){
cin >> tx[i];
}
for(ll i=0;i<m;i++){
cin >> ty[i];
}
sort(tx,tx+n);
sort(ty,ty+m);
n--; m--;
for(ll i=0;i<n;i++){
x[i]=tx[i+1]-tx[i];
x[i]%=MOD;
}
for(ll i=0;i<m;i++){
y[i]=ty[i+1]-ty[i];
y[i]%=MOD;
}
for(ll i=0;i<n;i++){
if(i==0||i==n-1){
xsum+=x[i]*n;
}else{
xsum+=((((i+1)*(n-i))%MOD)*x[i])%MOD;
}
xsum%=MOD;
}
for(ll i=0;i<m;i++){
if(i==0||i==m-1){
ysum+=y[i]*m;
}else{
ysum+=((((i+1)*(m-i))%MOD)*y[i])%MOD;
}
ysum%=MOD;
}
ans = xsum*ysum;
ans%=MOD;
cout << ans<<endl;
}
| 0
| 97,213,130
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(ll N, vector<ll> A, vector<ll> B)
{
ll ans = 0;
ll need = 0;
vector<ll> beyond;
for(int i=0;i<A.size();++i)
{
if(A[i] < B[i])
{
ans++;
need += B[i] - A[i];
}else
{
if(A[i] > B[i])
{
beyond.push_back(A[i]-B[i]);
}
}
}
sort(beyond.begin(),beyond.end(),greater<int>());
for(int i=0;i<beyond.size() && need > 0;++i)
{
need-=beyond[i];
ans ++;
if(need < 0)
{
break;
}
}
if(need > 0)
cout<<-1<<endl;
else
cout<<ans<<endl;
}
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
for(int i = 0 ; i < N ; i++)
{
cin >> A[i];
}
vector<ll> B(N);
for(int i = 0 ; i < N ; i++)
{
cin >> B[i];
}
solve(N, move(A), move(B));
return 0;
}
|
#include<iostream>
#include<stdio.h>
using namespace std;
int parent(int i) {
return i / 2;
}
int left(int i) {
return 2 * i;
}
int right(int i) {
return 2 * i + 1;
}
int main() {
int n, A[100001];;
cin >> n;
for (int j = 1; j <= n; j++) scanf("%d", &A[j]);
for (int j = 1; j <= n; j++) {
printf("node %d: key = %d, ", j , A[j]);
if (parent(j) >= 1) printf("parent key = %d, ", A[parent(j)]);
if (left(j) <= n) printf("left key = %d, ", A[left(j)]);
if (right(j) <= n) printf("right key = %d, ", A[right(j)]);
printf("\n");
}
return 0;
}
| 0
| 81,092,949
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string S,C;
cin >> S >> C;
if(S[2] != C[0]){
cout << "NO" << '\n';
}else if(S[1] != C[1]){
cout << "NO" << '\n';
}else if(S[0] != C[2]){
cout << "NO" << '\n';
}else{
cout << "YES" << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define FORD(i, a, b) for(ll i=a-1; (ll)(b)<=i; i--)
#define ALL(x) x.begin(), x.end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
vector<vector<ll>> v;
vector<ll> cost;
int main(){
ll w, h, n; cin >> w >> h >> n;
ll l=0, r=w, t=h, b=0, res=0;
rep(i, n){
ll x, y, op; cin >> x >> y >> op;
if(op==1) l = max(x, l);
else if(op==3) b = max(y, b);
else if(op==2) r = min(x, r);
else t = min(y, t);
}
if(l<r && b<t) res = (r-l)*(t-b);
cout << res << endl;
}
| 0
| 96,093,250
|
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;
bool isPrime(ll n)
{
if(n==1||n==2||n==3||n==5||n==7)
return 1;
else
{
ll i,j,k,l,m;
for(i=2;i<=sqrt(n);i++)
{
if(n%i==0)
return 0;
}
return 1;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
ll arr[3];
cin>>arr[0]>>arr[1]>>arr[2];
sort(arr,arr+3);
cout<<arr[0]+arr[1];
return 0;
}
|
#include<cstdio>
#include<cstring>
using namespace std;
char s[102];
int a[101];
int main(){
scanf("%s",s+1);
int n=strlen(s+1),k;
scanf("%d",&k);
for(int i=1,o=1;i<=n;i++){
if(s[i]!=s[i+1]){
a[++a[0]]=i-o+1;
o=i+1;
}
}
long long ans=0;
if(s[1]==s[n]){
if(a[0]==1)ans=1ll*n*k/2;
else{
for(int i=2;i<a[0];i++)
ans+=1ll*a[i]/2*k;
ans+=a[1]/2+a[a[0]]/2;
ans+=1ll*(a[1]+a[a[0]])/2*(k-1);
}
}
else for(int i=1;i<=a[0];i++)
ans+=1ll*a[i]/2*k;
printf("%lld\n",ans);
}
| 0
| 89,780,339
|
#pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_string
#define all(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vs vector <string>
#define vvs vector <vector<string>>
#define pq priority_queue<int>
using ll = long long;
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
const int INF = 2000000000;
constexpr ll mod = 1e9 + 7;
constexpr long double pi = 3.141592653589793238462643383279;
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
bool isprime(ll a)
{
if (a < 2) return false;
else if (a == 2) return true;
else if (a % 2 == 0) return false;
double m = sqrt(a);
for (int i = 3; i <= m; i += 2)
{
if (a % i == 0)
{
return false;
}
}
return true;
}
ll ketasum(ll n) {
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
ll kind(vi SYURUI) {
int size = SYURUI.size();
sort(all(SYURUI));
int cnt = 1;
rep(i, size-1) {
if (SYURUI[i] != SYURUI[i + 1])cnt++;
}
return cnt;
}
#pragma endregion
signed main() {
int A, B, C, D; cin >> A >> B >> C >> D;
vi N = { A,B,C,D };
int a=0, b=0, c=0, d=0;
rep(i, 4) {
if (N[i] == 1)a++;
else if (N[i] == 9)b++;
else if (N[i] == 7)c++;
else if (N[i] == 4)d++;
}
if (a == 1 && b == 1 && c == 1 && d == 1)puts("YES");
else puts("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int64_t,int> p[100005];
map<int,int> c;
map<int,int> w;
int main(){
int n,k;
cin >> n >> k;
int t;
int64_t d;
int64_t whole=0;
for(int i=0;i<n;i++){
cin >> t >> d;
p[i]=make_pair(d,t);
if(w[t]==0)whole++;
w[t]++;
}
sort(p,p+n);
int64_t ans=0;
int64_t var=0;
for(int i=0;i<k;i++){
ans+=p[n-1-i].first;
c[p[n-1-i].second]++;
if(c[p[n-1-i].second]==1)var++;
}
ans+=var*var;
int loop=min(k-var,whole-var);
if(loop==0)cout << ans <<endl;
else{
vector<int64_t> L;
vector<int64_t> S;
int j=0;
for(int i=0;i<k;i++){
if(c[p[n-k+i].second]>1){
L.push_back(p[n-k+i].first);
c[p[n-k+i].second]--;
j++;
}
if(j==loop)break;
}
loop=min(j,loop);
j=0;
for(int i=0;i<n-k;i++){
if(c[p[n-k-1-i].second]==0){
S.push_back(p[n-k-1-i].first);
c[p[n-k-1-i].second]++;
j++;
}
if(j==loop)break;
}
loop=min(j,loop);
int64_t neo=ans;
int64_t tmp=0;
for(int i=1;i<loop+1;i++){
tmp+=(S.at(i-1)-L.at(i-1));
neo=max(neo,ans+tmp+2*var*i+i*i);
}
cout << neo << endl;
}
}
| 0
| 31,791,802
|
#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) x.begin(),x.end()
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int x,a;
cin >> x >> a;
if (x < a) cout << 0 << endl;
else cout << 10 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
#define rep(i, a, b) for(int i = int(a); i <= int(b); i++)
#define N 5005
int P[N], C[N];
int main() {
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> P[i];
for(int i = 1; i <= n; i++) cin >> C[i];
ll Ans = -INF;
rep(i, 1, n) {
int p = i;
ll cnt = 0, len = 0, allsum = 0, sum = 0;
while(1) {
++len;allsum += C[p];p = P[p];
if(p == i)break;
}
cnt = 0, sum = 0;
while(1) {
++cnt;sum += C[p];
if(cnt > k)break;
ll num = (k - cnt) / len;
ll scr = sum + max(0LL, allsum) * num;
Ans = max(Ans, scr);
p = P[p];if(p == i)break;
}
}
cout << Ans << endl;
return 0;
}
| 0
| 81,462,562
|
#include <bits/stdc++.h>
#warning !!!check the size of arrayss!!!
#define INF 100000000000000005
#define inf 1000000000
#define MOD 1000000007
#define newMOD 998244353
#define MAX 300006
#define pi 3.1415926535897932384626433832795
#define ld long double
#define ll long long
#define int long long
#define P(gg) for(auto rax:gg){cout<<rax<<" ";}cout<<endl;
#define Need_for_speed(activated) ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define satisfy ll t; cin>> t; while(t--)
#define inp(n) int n;cin >> n
#define mp make_pair
#define pb push_back
#define endl "\n"
#define x first
#define y second
#define fore(i,a,b) for(ll i=a;i<b;i++)
#define forci(i,n) for(ll i=0;i<n;i++)
#define vi vector<ll>
#define Endl endl
#define lb lower_bound
#define ub upper_bound
#define pii pair<ll,ll>
#define input freopen("input.txt", "r", stdin),freopen("output.txt", "w", stdout)
#define time cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
using namespace std;
ll gcd(ll a, ll b){if (b == 0)return a;return gcd(b, a % b);}
int power(int x, unsigned int y, unsigned int m){ if (y == 0) return 1;int p = power(x, y/2, m) % m; p = (p * p) % m;return (y%2 == 0)? p : (x * p) % m;}
ll modInverse(int a, int m){{ return power(a, m-2, m);}}
const int maxn = 500003;
void solve()
{
ll n,m;cin>>n>>m;multiset<ll>ms;
ll a[n];for(ll i=0;i<n;i++)cin>>a[i],ms.insert(a[i]);
ll ans = 0;
while(m--)
{
ll x = *ms.rbegin();
auto it = ms.end();it--;
ms.erase(it);
ms.insert(x/2);
}
for(auto it:ms)ans+=it;
cout<<ans<<endl;
}
signed main()
{
Need_for_speed(activated);
solve();
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int inf=0x3f3f3f3f;
int map[15][15];
void floyd(int n)
{
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
{
for(int k=0;k<n;++k)
{
map[j][k]=min(map[j][k],map[j][i]+map[i][k]);
}
}
}
}
void init(int n)
{
for(int i=0;i<n;++i)
{
for(int j=0;j<i;++j)
{
map[i][j]=map[j][i]=inf;
}
map[i][i]=0;
}
}
int main()
{
int n;
while(scanf("%d",&n),n)
{
init(15);int m=0;
for(int i=0;i<n;++i)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
map[a][b]=map[b][a]=min(map[a][b],c);
m=max(max(m,a),b);
}
floyd(m+1);
int ans=inf,res=0;
for(int i=0;i<=m;++i)
{
int p=0;
for(int j=0;j<=m;++j)
{
if(map[i][j]!=inf)
{
p+=map[i][j];
}
}
if(p<ans)
{
ans=p;res=i;
}
}
printf("%d %d\n",res,ans);
}
return 0;
}
| 0
| 76,646,487
|
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(2);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";newl;
#define all(x) (x).begin(),(x).end()
#define mset(x,val) memset(x,val,sizeof(x))
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr<<"
#define deb1(x) cerr<<#x<<" = "<<x<<'\n';
#define deb2(x,y) cerr<<'['<<#x<<','<<#y<<"] = "<<'['<<x<<','<<y<<']'<<'\n';
#define deb3(x,y,z) cerr<<'['<<#x<<','<<#y<<','<<#z<<"] = "<<'['<<x<<','<<y<<','<<z<<']'<<'\n';
#define N 1000000007
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll , ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = 2 * 1e18;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
vll adj[MAX5];
ll T = 1;
ll n, x, y, q, m, k;
string s, t, d;
ll sum = 0;
ll cou = 0;
void MAIN() {
cin >> n >> k;
vpll a;
for(ll i=0;i<n;i++) {
cin >> x >> y;
a.pb({x,y});
}
sort(all(a));
if(a[0].s >= k) {
cout<<a[0].f;
return;
}
for(ll i=1;i<=n;i++) {
a[i].s += a[i-1].s;
if(a[i].s >= k) {
cout<<a[i].f;
return;
}
}
}
int main() {
fastio; randomINT;
while (T--) {
MAIN();
}
return 0;
}
|
#include <bits/stdc++.h>
typedef long long lint;
using namespace std;
int n;
vector<lint> a;
bool isValid(lint m) {
lint count = 0;
for (int i = 0; i < n; i++) {
lint b = max(0LL, a[i] + m - (n - 1));
count += (b + n) / (n + 1);
}
return count <= m;
}
bool isValid2(lint m) {
lint count = 0;
for (int i = 0; i < n; i++) {
lint b = max(0LL, a[i] + m - (n - 1));
count += (b + n) / (n + 1);
}
return count == m;
}
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
lint ok = LLONG_MAX / 2, no = -1;
while (abs(ok - no) > 1) {
lint mid = (ok + no) / 2;
if (isValid(mid)) {
ok = mid;
} else {
no = mid;
}
}
for (lint i = max(0LL, ok - 1000000); i < ok + 1000000; i++) {
if (isValid2(i)) {
cout << i << endl;
return 0;
}
}
}
| 0
| 25,708,578
|
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll m, k;
int main()
{
cin>>m>>k;
if((1 << m) <= k || m == 1 && k == 1)
{
printf("-1\n");
return 0;
}
if(m == 1 && k == 0)
{
printf("0 0 1 1\n");
return 0;
}
for(ll i = 0; i < (1 << m); i++)
{
if(i == k) continue;
printf("%lld ", i);
}
printf("%lld ", k);
for(ll i = (1 << m) - 1; i >= 0; i--)
{
if(i == k) continue;
printf("%lld ", i);
}
printf("%lld", k);
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace std;
bool prime_(int n){
if(n==1){
return false;
}else if(n==2){
return true;
}else{
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
return false;
}
}
return true;
}
}
long long gcd_(long long a, long long b){
if(a<b){
swap(a,b);
}
if(a%b==0){
return b;
}else{
return gcd_(b,a%b);
}
}
long long lcm_(long long x, long long y){
return (x/gcd_(x,y))*y;
}
int main(){
int n;
cin>>n;
int a[n];
REP(i,n){
cin>>a[i];
}
int ans = 0;
int temp = 0;
int now;
REP(i,n){
if(i==0){
now = a[i];
temp = 1;
continue;
}
if(now == a[i]){
temp++;
now = a[i];
if(i == n-1){
ans += temp/2;
}
}else{
ans += temp/2;
temp = 1;
now = a[i];
if(i == n-1){
ans += temp/2;
}
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 2,855,933
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.