code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, p;
while(cin >> n >> m >> p, n) {
vector<int> v(n);
int sum = 0;
for(int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i]*100;
}
if(v[m-1] == 0) cout << 0 << endl;
else {
int ans = (sum - sum*((d... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
int M = 998244353;
int N;
cin >> N;
long long D[N];
map<int, int> m;
for (int i = 0; i < N; i++) {
cin >> D[i];
m[D[i]]++;
}
long long res = 0;
if (m[0] != 1) {
... | 0 | 69,187,073 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef long long ll;
typedef long double ld;
int check(string s, string t)
{
rep(i, t.size())
{
if (s[i] == '?')
s[i] = t[i];
}
if (t == s)
return 1;
ret... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; ++i)
#define rep(i, n) repl(i, 0, n)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>... | 0 | 8,390,406 |
#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) ((in... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H, vector<char>(W));
rep(i, ... | 0 | 75,491,537 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k,s;cin>>k>>s;
int ans=0;
for(int x=0;x<=k;x++) {
for(int y=0;y<=k;y++) {
int z = s-x-y;
ans += (0<=z && z<=k);
}
}
cout<<ans<<"\n";
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
templ... | 0 | 31,159,694 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n; cin>>n;
string ans;
if(n==22) ans="Christmas Eve Eve Eve";
else if(n==23) ans="Christmas Eve Eve";
else if(n==24) ans="Christmas Eve";
else if(n==25) ans="Christmas";
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
string t[30][30];
int main() {
int h, w;
cin >> h >> w;
char a1 = 'A';
int a2=0;
rep(i, h) rep(j, w) {
cin >> t[i][j];
if (t[i][j] == "snuke") {
a1 +=... | 0 | 19,458,192 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
long long int ans = 0;
ll tmp;
ll n, d, a;
cin >> n >> d >> a;
priority_queue<pair <ll, ll > > mons... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
vector<P> graph[100010];
vector<ll> dist;
bool dfs(int x, int d){
dist[x] = d;
for(auto p:graph[x]){
if(dist[p.first] ... | 0 | 29,826,277 |
#include <iostream>
#include <unordered_map>
using namespace std;
typedef long long int LLI;
int main()
{
int n;
cin >> n;
LLI tmp, ans = 0;
unordered_map <LLI, LLI> arr;
for(int i = 0; i < n; i++)
{
cin >> tmp;
arr[tmp]++;
}
for(auto x: arr)
{
if( x.first <= ... | #include <iostream>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
#define int long long
class AApplePie {
public:
void solve(std::istream &in, std::ostream &out) {
int a, p;
in >> a >> p;
p += a * 3;
int ans = 0;
while (p >= 2) {
ans++;
p -= 2;
... | 0 | 94,517,507 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> entered_cars;
int number;
while (cin >> number)
{
if(number == 0)
{
int& x = entered_cars.back();
cout << x << endl;
entered_cars.pop_back();
... | 0 | 37,143,441 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n, score_taro=0, score_hanako=0;
cin >> n;
string card_taro, card_hanako;
for(int i = 0; i != n; ++i){
cin >> card_taro >> card_hanako;
if (card_taro > card_hanako){
score_taro += 3;
}else if (... | 0 | 41,360,622 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S, T, ans = "";
cin >> N >> S >> T;
for (int i = 0; i < N; i++) ans = ans + S[i] + T[i];
cout << ans << endl;;
} | #include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (long long int i = 1, i##_len = (n); i <= i##_len; ++... | 0 | 57,866,847 |
#include <stdio.h>
int main()
{
int a,b,c,d,n;
int i,j,k,l;
int ans=0;
while(scanf("%d",&n) != EOF){
for(i=0;i<10;i++){
for(j=0;j<10;j++){
for(k=0;k<10;k++){
for(l=0;l<10;l++){
if(i+j+k+l == n)
ans++;
}
}
}
}
printf("%d\n",ans);
ans = 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
... | 0 | 73,878,051 |
#include<bits/stdc++.h>
using namespace std;
map<long long int,long long int> mp;
int main(){
int n;
long long int m;
cin >> n >> m;
long long int a[n];
long long int sum =0;
for(int i=0;i<n;i++){
cin >> a[i];
sum += a[i];
sum %= m;
mp[sum]++;
}
long long ... | #include<cstring>
#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<complex>
#include<sstream>
#include<climits>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X)... | 0 | 76,008,905 |
#include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define ld long double
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll MOD = 998244353;
const double PI = 3.141592653589793238463;
const int MAXN = 200005;
int n,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define ... | 0 | 5,586,348 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll q, h, s, d, n;
cin >> q >> h >> s >> d;
cin >> n;
ll sa = min(q * 4, min(h * 2, s));
ll da = min(d, sa * 2);
if (n % 2 == 0) cout << da * (n / 2) << endl;
else cout << sa + da * (n / 2) << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
int main(void){
int n, student[1000]={}, diff, tmp_diff;
while(1){
cin >> n;
if(n==0) break;
diff=1000000;
for(int i=0;i<n; i++){
cin >> student[i];
}
for(int i=0; i<n-1; i++){
for(... | 0 | 83,371,194 |
#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>;
vector<ll> divisor(ll n) {
vector<ll> f(n+1);
for (ll i = 2; i <= n; i++) f[i] = 2*i;
f[1] = 1;
for (ll i = 2; i <= (n+1)/2; i++) {
for (ll j = i * 2; j <= n; j += i) {... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 99,331,675 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll w,h,x,y;
cin>>w>>h>>x>>y;
cout<<h*w/2.0<<" ";
if(x*2==w && y*2==h) cout<<1;
else cout<<0;
} | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define rep(i,n) for(ll i=0;i<n;i++)
#define repr(i,n) for(ll ... | 0 | 13,152,022 |
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a;cin >> a;
int b;cin >> b;
int k;cin >> k;
int cnt = 0;
int ans = 0;
for(int i = min(a,b); i > 0; i--){
if(a%i == 0 && b%i == 0){
cnt++;
if(cnt == k){
ans = i;
break;
}... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define AL... | 0 | 67,100,511 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n);... | #include<iostream>
#include<string>
#include<cctype>
using namespace std;
int main(){
string a,b;
getline(cin, a);
for(int i=0;i<a.size();i++){
if(islower(a[i])){
b += toupper(a[i]);
}
else if(isupper(a[i])){
b += tolower(a[i]);
}
else{
... | 0 | 51,652,795 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int y,m,d;
char c;
cin>>y>>c>>m>>c>>d;
if(m<=4) cout<<"Heisei";
else cout<<"TBD";
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | 0 | 39,433,733 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | 0 | 45,967,747 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
long long c = N;
int cnt = 0;
while(true){
if(N / 10 == 0) {
cnt += N % 10;
break;
}
cnt += N % 10;
N /= 10;
}
if(c % cnt == 0) puts("Yes");
else puts(... | # 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>
constexpr int MOD = 1000000007;
constexpr int INF = 2000000000;
using nam... | 0 | 63,183,277 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<pair<int, int>> r(n), b(n);
for(int i = 0; i < n; i++) cin >> r.at(i).first >> r.at(i).second;
for(int i = 0; i < n; i++) cin >> b.at(i).first >> b.at(i).second;
vector<bool> r_use... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 70,380,059 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=15000007;
const ll MAX=918... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m; cin >> n >> m;
vector<int> cnt(n);
while(m--) {
int a,b; cin >> a >> b;
++cnt[a-1],++cnt[b-1];
}
bool flag=true;
for(int i=0;i<n;++i)
if(cnt[i]&1) flag=false;
cout << (flag?"YES":"NO") << endl;
return 0;
} | 0 | 92,041,706 |
#include<iostream>
using namespace std;
int main(){
int W,H,x,y,r;
cin >> W >> H >> x >> y >> r;
if ((W < r + x) || (0 > x - r)){
cout << "No" << endl;
}
else if ((H < r + y) || (0 > y - r)){
cout << "No" << endl;
}
else{
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | 0 | 15,756,213 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string S;
vector<vector<int>> color;
void hantei(int i){
if(S[i]=='R'){
color[0][i]++;
}
else if(S[i]=='G'){
color[1][i]++;
}
else if(S[i]=='B'){
color[2][i]++;
}
}
int main(){
int N;
cin >> N >> S;
vector<vector<int>> c(3... | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (in... | 0 | 33,773,029 |
#include<iostream>
using namespace std;
int main(){
int n, i=1;
long long max = -1000000, min = 1000000, sum = 0, d;
cin >> n;
while (i <= n){
i++;
cin >> d;
min = (d < min)?d:min;
max = (d > max)?d:max;
sum = sum + d;
}
cout << min << " "... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | 0 | 76,431,579 |
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, m, n) for(ll i = m; i > n; i--)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x... | 0 | 33,187,390 |
#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, M;
cin >> N >> M;
int ans=0;
ans=N*(N-1)/2+M*(M-1)/2;
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
#define vll vector<ll>
#define vi vector<int>
#define vpll vector<pair<ll,ll>>
#define pii pair<int,int>
#define REP(i,a) for(int (i)=0; (i)<(a); (i)++)
#define RREP(i,a) for(int (i)=a-1; (i)>=(0); (i)--)
#define REP2(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define MOD 1000000007
#define ALL(v) ... | 0 | 13,462,305 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int max = 2;
while(max <= n) {
max *= 2;
};
cout << max / 2 << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
struct Dice{
Dice(vector<int>& dice) : dice_(dice) {
east_.push_back(4); east_.push_back(2);
east_.push_back(1); east_.push_back(6);
east_.push_back(5); east_.push_back(3);
north_.push_back(2); north_.push_back(6);
north_.push_... | 0 | 7,396,453 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
bool revp2(const pair<ll,ll>&a,const pair<ll,ll>&b){return a.first>b.first;}
bool revp3(const pair<ll,ll>&a,const pair<ll,ll>&b){if(a.first==b.first)return a.second<b.second;
return a.first>b.first;}
int main()
{
ll n,s=0;
cin>>n;
ll d,x;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int cnt;
cin>>cnt;
while(cnt--){
string a,b;
cin>>a>>b;
int dp[1000][1000]={};
for(int i=0;i<b.size();i++){
int nm=0;
for(int j=0;j<a.size();j++){
if(a[j]==b[i])dp[i][j]=nm+1;
if(i){
dp[i][j]=max(dp[i][j],dp[i-1][j]);
nm=... | 0 | 98,277,585 |
#include <bits/stdc++.h>
#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 MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;
int n, a[1005], b[1005];
int main()
{
scanf("%d", &n);
rep(i, n) s... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 0 | 24,721,347 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int K, A, B;
cin >> K >> A >> B;
bool ok = false;
for (int i = A; i <= B; i++) {
if (i % K == 0) {
ok = true;
break;
}
}
if (ok) cout << "OK" << endl;
else cout << "NG" << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <functional>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
typedef lo... | 0 | 49,155,505 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n, a = 0, b = 0;
string buffier;
cin >> buffier;
for(int i = 0;i < buffier.size();i++){
a = a * 10 + buffier[i] - '0';
b += buffier[i] - '0';
}
if(a % b == 0){
cout << "Yes";
}else{
cout << "No... | #include <bits/stdc++.h>
#define ub(b,val) upper_bound(b+1,b+n+1,val)-b
#define ll long long
using namespace std;
const int N = 1e5 + 123, MAXN = 1e9;
ll n, m, v, p;
ll a[N], b[N], ans, c[N];
bool check (int in) {
ll k = 0, id = (n - p + 1);
if (b[in] + m < b[id])return 0;
k += (p - 1) * 1ll * m + (in - 1) ... | 0 | 14,075,500 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
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;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
int n, res;
int dp[N], a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (i > 0 && a[i] <= a[i - 1]) {
dp[i] = dp[i... | 0 | 68,554,993 |
#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 10000000
using namespace std;
bool check(char x){
for(int i=48; i<=57; i++){
if(x == i) return true;
}
return false;
}
int main(){
int n;
cin >> n;
rep(i,n){
string a,b;
cin >> a >> b;
int... | 0 | 79,739,649 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, fh = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
fh = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using v... | 0 | 76,011,744 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
int K;
cin >>a>>b>>c>>K;
int cnt=0;
while (a>=b){
b*=2;
cnt++;
}
while (b>=c){
c*=2;
cnt++;
}
if (cnt<=K){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
... | #include <iostream>
#include <bitset>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int min = 10000000;
for (int tmp = 0; tmp < (1 << N); tmp++) {
int D = 1;
bitset<10> s(tmp);
for (int i = 0; i < N; i++) {
if (s.test(i)) {
D = D * 2;
... | 0 | 65,012,907 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define txti freopen("input.txt", "r", stdin);
#de... | 0 | 92,278,766 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | #include <bits/stdc++.h>
#define rep(i, e, n) for (int i = e; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const ll inf=1000000000007;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> val(1000001,0);
rep(i,0,n) cin >> a[i];
rep(i,0,n) {
int vali=a[i];
f... | 0 | 60,919,083 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N; cin >> N;
if(N%2 == 1){
cout << 0 << endl;
return 0;
}
string s = to_string(N);
int ss = s.size();
ll ans = 0;
ll no... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define pb(x) push_back(x)
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vs vector... | 0 | 57,714,734 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define fi first
#defin... | #include<bits/stdc++.h>
using namespace std;
const int mxn=1e6;
vector <int> adj[mxn];
int visited[mxn];
long long dist[mxn];
queue <int> q;
void bfs(int start)
{
q.push(start);
visited[start]=1;
dist[start]=0;
while(!q.empty())
{
int u=q.front();
q.pop();
for(int i=0;i<adj[u... | 0 | 75,939,967 |
#include<bits/stdc++.h>
using namespace std;
int N,c;
string S;
int main(){
cin>>N>>S;
for(char i='0';i<='9';i++){
auto it_i = S.find(i);
if(it_i==string::npos)continue;
for(char j='0'; j<='9'; j++){
auto it_j=S.find(j,it_i+1);
if(it_j==string::npos)continue;
for(char k='0';k<='9';k++)... | #include <cmath>
#include <cstdio>
#include <vector>
#include <list>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <stack>
#include <fstream>
#include <queue>
#include <iomanip>
#include <iterator>
#include <map>
#include <unordered_map>
#include <set>
#include <assert.h>
#include <numeric>
#defi... | 0 | 90,461,405 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n, k, count = 0;
cin >> n >> k;
vector<int> vec(n);
for(int i = 0 ; i < k ; i ++){
int d;
cin >> d;
for(int j = 0; j < d; j ++){
int x;
cin >> x;
vec.at(x-1) = 1;
}
}
for(int i =0;i < n;i++){
if(ve... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define speed() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)(x).size()
#define _USE_MATH_DEFINES
using namespace std;
typedef long lon... | 0 | 99,596,053 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, a, b) for (int i = a; i >= b; i--)
#define ll long long
#define mset(s, _) memset(s, _, sizeof s)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> H;
rep(i, 1... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != ... | 0 | 65,584,180 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){i... | 0 | 48,537,557 |
#include <iostream>
#include <string>
#include <vector>
#include <cstdio>
using namespace std;
bool judge(string s, string p)
{
int size_s = s.size();
int size_p = p.size();
for(int i = 0; i < size_s; i++){
for(int j = 0; j < size_p; j++){
if(s[i + j] != p[j]){
break;
}
if(j + 1 == size_p){
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,f,n) for(int i=f; i<(n); i++)
int main()
{
ll ans = 0, n;
string s;
cin >> n;
cin >> s;
REP(i,0,10){
int f1 = s.find_first_of(i+'0');
if(f1 != -1){
string s2 = s.substr(f1+1);
REP(i2,0,10){
int f2 = s... | 0 | 5,274,764 |
#include <bits/stdc++.h>
using namespace std;
#define PI 2*acos(0.0)
#define pf printf
#define sf scan
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef std::vector<int> vi;
typedef vector<long long> vll ;
typedef pair<int, ... | #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>;
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; } re... | 0 | 58,439,352 |
#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(){
long long int n;
cin>>n;
vector<long long int> city(n+1);
rep(i,n+1){
cin>>city[i];
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,m;
cin >> n >> m;
vector<ll> a(n),b(n),c(m),d(m);
rep(i,n){
cin >> a.at(i) >> b.at(i);
}
rep(i,m){
cin >> c.at(i) >> d.at(i);
}
rep(i,n){
ll sum=1e9+7,ans;... | 0 | 45,514,278 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int> >
#define ... | 0 | 60,623,845 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n,L;
cin >> n >> L;
vector<int> v(n);
rep(i,n)cin >> v[i];
int k ... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int N,n,a[500000],id[500000][2],ans=0;
inline bool cmp(int x,int y){
return a[x]<a[y];
}
int main(){
scanf("%d",&N);
n=1<<N;
for(int i=0;i<n;i++) scanf("%d",&a[i]);
a[n]=0;
id[0][0]=0,id[0][1]=n;
for (int i=1;i<n;i+... | 0 | 21,761,198 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #include <bits/stdc++.h>
#define pragma
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define aisort sort(a,a+n)
#define adsort sort(a,a+n,greater<ll>())
#define PI 2 * acos(0)
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<ll> vi;
type... | 0 | 26,753,262 |
#include <cstdio>
int main(){
int a,b;
while(true){
scanf("%d %d",&a,&b);
if(a==0) break;
for(int i=0;i<a;i++){
for(int j=0;j<b;j++){
if((i!=0)&&(j!=0)&&(i!=a-1)&&(j!=b-1))printf(".");
else printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
#define rep(i,z) for(int i = 0; i<(int)(z); i++)
#define rep1(i,z) for(int i = 1; i<=(int)(z); i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
using pear = pair<int,int>;
int main(){
int n, m, x; cin>>n >>m >>x;
int c[n], a[n][m];
ll ans=0;
... | 0 | 45,197,154 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void)
{
string s;
cin >> s;
if (stoi(s) < 111)
cout << "111" << endl;
else if (s[0] == s[1] && s[1] == s[2])
cout << s << endl;
el... | #include <bits/stdc++.h>
#define INF 1e18
#define Rep(i, a, n) for (ll i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define MAX 1000000
#define ll long long
#define P pair<int,int>
#define cout_set(n) cout << setprecision(10) << (n) << endl;
const double PI=3.141592653589... | 0 | 58,910,769 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
ii ma[19][1 << 18];
void Update(ii& a, int x) {
if (x > a.first) {
a.second = a.f... | #include <iostream>
#include<vector>
using namespace std;
int main(void){
int n,m,x;
cin >> n >> m >> x;
vector<vector<int>> a(n,vector<int>(m));
vector<int> c(n);
for(int i = 0;i < n;i++){
cin >> c[i];
for(int j = 0;j < m;j++){
cin >> a[i][j];
}
}
... | 0 | 9,566,836 |
#include <bits/stdc++.h>
using namespace std;
int A, B, luas;
int main () {
cin >> A >> B;
luas = (A-1)*(B-1);
cout << luas << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <climits>
int main(){
long N;
std::cin >> N;
long h[100];
for(long i=0; i<N; i++){
std::cin >> h[i];
}
long count=0;
while(1){
long l=0;
... | 0 | 60,492,565 |
#include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int a,b,c; cin>>a>>b>>c;
if (a==b&&b==c&&c==a) cout<<"Yes";
else cout<<"No";
return 0;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include ... | 0 | 36,986,540 |
# 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>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <assert.h>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
void vector_dump(std::vector<vector<bool> > vec) {
std::cout << "[ ";
for (auto j:vec) {
std::cout << "[ ";
for (auto i:j) {
std... | 0 | 58,135,141 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int h;
int max = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> h;
if (max <= h) {
cnt++;
max = h;
}
}
cout << cnt << endl;
return 0;
} | 0 | 70,172,890 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h[i];
int cnt = 1;
int temp = h[0];
for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
string s; cin >> s;
int n = s.size();
for(int i = n-2; i > 0; i... | 0 | 82,655,524 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
__int128 mul = 1;
bool isz = false;
bool isb = false;
for (int i = 0; i < n; ++i) {
int64_t a;
scanf("%lld", &a);
__int128 aa = a;
mul = mul * aa;
if (a == 0) {
isz = true;
break;
}
if (mul > 10000000000000... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int N, K;
ll height[305];
ll dp[305][305];
ll INF = 0x3f3f3f3f3f3f3f3f;
int main() {
cin >> N >> K;
for (int i=1; i<=N; i++){
scanf("%lld", &height[i]);
}
memset(dp, INF, sizeof(dp));
for (int i=1; i<=N;... | 0 | 39,521,112 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, x[100004], y[100004];
const int mod = 1000000007;
long long mul(long long a, long long b){
long long ret = a * b;
return ret% mod;
}
long long sum(long long a, long long b){
return (a+b)%mod;
}
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NUL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl1;
int main()
{ ll i, k, n, kn, val, tmp, suma, maxa;
cin>>n>>kn;
vl1 veka(n+1), dp(n+1);
for(i=1;i<=n;i++) cin>>veka[i];
dp[1]=0;
for(i=2;i<=n;i++)
{ if(kn<i) maxa=kn; else maxa=i-1;
suma=LLONG_MAX;
for(k... | 0 | 6,295,689 |
#include <bits/stdc++.h>
#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 rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<char> S(N);
for(int i=0; i<N; i++) cin >> S.at(i);
int Rcnt = 0, Gcnt = 0, Bcnt= 0;
for(int i=0; i<N; i++){
if(S.at(i) == 'R') Rcnt++;
else if(S.at(i) == 'G') Gcnt++;
else Bcnt++;
}
... | 0 | 38,417,255 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
const int MAX_N = 999999;
int prime[MAX_N];
bool is_prime[MAX_N + 1];
int sieve(int n)
{
int p = 0;
for (int i = 0; i <= n; i++)
is_prime[i] = true;
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= n; i++)
{
if (is_prime[i])
{
... | #include <stdio.h>
int main(void)
{
int H,W;
while(H!=0 || W!=0){
scanf("%d",&H);
scanf("%d",&W);
if(H!=0 || W!=0){
for(int a = 0;a < H;a++){
for(int b = 0;b < W;b++){
if(a == 0 || a == H-1){
printf("#");
... | 0 | 58,547,286 |
#include <bits/stdc++.h>
using namespace std;
int comp(const int &a,const int &b)
{
return a>b;
}
int main()
{
int n;
long long sum=0;
cin>>n;
vector<int>a(n);
vector<int>b(n);
vector<int>c;
int count=0;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
for(int i=0;i<n;i++)
{
if(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<... | 0 | 26,517,772 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long i... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 97,758,793 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
int tmp;
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
REP(i, n) cin >> a[i];
REP(i, ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
using namespace std;
int main(){
string str;
string tmp;
while(getline(cin, str) && str != "."){
int p = 0, q = 0;
bool flag = 1;
tmp = "";
for(int i = 0 ; i < str.size() ; i++){
if(str[i] == '[' || str[i] == '(' || st... | 0 | 54,012,057 |
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << setprecision(10) << sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
ll t[100005],x[100005],y[100005];
int main(void){
cin>>n;
t[0]=0; x[0]=0; y[0]=0;
for(int i=1;i<=n;i++){
cin>>t[i]>>x[i]>>y[i];
if(t[i]-t[i-1]<(abs(x[i]-x[i-1])+abs(y[i]-y[i-1]))||(x[i]+y[i])%2!=... | 0 | 31,404,690 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int sum = a + b;
if (sum >= c) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,k;
int num[100005];
while(cin >> n >> k && n && k){
for(int i=0;i<n;i++) cin >> num[i];
int ans = 0;
for(int i=0;i<k;i++) ans += num[i];
int sum = ans;
for(int i=1;i<n-k+1;i++){
sum -= num[i-1];
sum += num[i+k-1];
ans = ... | 0 | 94,132,556 |
#include<bits/stdc++.h>
using namespace std;
int dfs(vector<vector<int>> &books,int c,int idx,vector<int> tmp){
int i;
for(i=0;i<tmp.size();i++){
if(tmp[i]<c){
break;
}
}
if(i==tmp.size()) return 0;
if(idx == books.size()) return INT_MAX;
int a = dfs(books... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 1; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n; cin >> n;
vector<int> vec(n);
for(int i = 0; i < n; i++){
cin >> vec.at(i);
}
int max = vec.at(0);
vector<int> c_vec;
int c... | 0 | 65,248,154 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | #include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define rapgame ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define eb emplace_back
#define vi vector <int>
#define vlli vector <lli>
#define vulli vector <ulli>
#define vchar v... | 0 | 100,272,478 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,c;
int minn;
int *b;
while(true){
cin >> n;
if(n == 0) break;
b = new int[n];
for(int i=0;i<n;++i){
cin >>b[i];
}
minn = abs(b[0] - b[1]);
for(int i=0;i<n-1;++i){
for(int k=i+1;k<n;++k){
minn = min(minn,ab... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
double ans=0;
const double eps=1e-5;
double func(double t,double v,double t2,double time){
if(t2<=time && t2+t>=time){
return v;
}
else if(t2>time){
... | 0 | 88,016,498 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;cin>>N>>M;
vector<vector<char>>A(N,vector<char>(N));
vector<vector<char>>B(M,vector<char>(M));
for(int i=0;i<N;i++){
string S;cin>>S;
for(int j=0;j<N;j++)A[i][j]=S.at(j);
}
for(int i=0;i<M;i++){
string S;cin>>S;
for(int j=0;j<... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
set<int> st;
rep(i, n) {
int a;
cin >> a;
st.insert(a);
}
int ans = st.size();
if ((n - ans) % 2 == 1)
... | 0 | 29,253,367 |
#include <iostream>
#include <vector>
#include <unordered_map>
using TourId = long long;
int main() {
int N, M;
std::cin >> N >> M;
std::vector<long long> H(N);
for (auto&& e : H) {
std::cin >> e;
}
std::unordered_map<TourId, std::vector<TourId>> adjs;
for (long long i=0; i<N; i++) {... | #include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int N; cin >> N;
cout << 0 << endl;
string pres,s;
int l,r,prei;
l = N-1; r=0;
cin >> pres;
if(pres == "Vacant") return 0;
else cout << N-1 << endl;
cin >> s;
if(s == "Vacant")... | 0 | 79,469,364 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
struct card {
char suit;
char value;
};
void print_vec(vector<card> &vec, int n) {
for (int i = 0; i < n; i++) {
cout << vec[i].suit << vec[i].value;
if (i < n - 1) cout << " ";
}
cout << endl;
}
int main... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<ll> sum(n+1);
vector<ll> posi(n+1);
posi[0] = 0;
sum[0] = 0;
for(int i = 1; i <= n; i++)
{
sum[i] = sum... | 0 | 33,446,264 |
#include <bits/stdc++.h>
using namespace std;
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<type... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
ll N, M;
cin >> N >> M;
vector<pair<ll, ll> >AB(N);
rep(i, N) {
cin >> AB[i].first >> AB[i].second;
}
sort(AB.rbegin(), AB.rend());
priority_queue<ll> Q;
... | 0 | 57,475,129 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string str;
string out = "";
cin >> str;
for(int i=0; str[i] != '\0'; i++){
switch (str[i])
{
case '0':
out.push_back(str[i]);
break;
case '1':
out.push_back(str[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define lim 2010
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll dp[lim][lim];
ll s[lim], t[lim];
ll n, m;
cin>>n>>m;
for(int i=1; i<=n; i++){
cin>>s[i];
}
for(int i=1; i<=m; i++){
cin>>t[i];
}
me... | 0 | 25,193,480 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int count = 0;
for (int i = A; i <=B; i++) {
int a = i/10000;
int e = i%10;
int b = i/1000-i/10000*10;
int d = i/10-i/100*10;
if((a == e) && (b == d)){
count ++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int main(){
int h,w,a,b;
cin>>h>>w>>a>>b;
int ans[1010][1010];
rep(i,h){
rep(j,w){
if(i<b){
if(j<a) cout<<0;
else cout<<1;
}else{
... | 0 | 90,453,420 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include<bits/stdc++.h>
#define fo(i, x, y) for(int i = x, B = y; i <= B; i ++)
#define ff(i, x, y) for(int i = x, B = y; i < B; i ++)
#define fd(i, x, y) for(int i = x, B = y; i >= B; i --)
#define ll long long
#define pp printf
#define hh pp("\n")
using namespace std;
const int N = 2e5 + 5;
int n, a[N];
struct P {
... | 0 | 14,063,933 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, n) for(int i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
using vi = vector<int>;
using vs = vector<string>;
const int MOD = 1e9+7;
int main() {
string A,B,C;
cin >> A >> B >>C;
if(A.at(A.size()-1) == B.at(0) &... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MOD 1000000007
#define ll long long int
#define pair <ll, ll> pi
#define vector <ll> vi
#define F first
#define S second
#define PB push_back
#define MP make_pa... | 0 | 66,061,933 |
#include"bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
const long long mod = 1000000007;
const long long inf = 11451419198109311;
const long double pi = 3.1415926535897932384626433;
typedef pair<int, int> P;
typedef pair<int, P> PP;
struct edge { int to, cost; };
int a[... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <deque>
#include <numeric>
#include <utility>
#include <bitset>
#define sign(a) ((a>0)-(a<0))
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define LL long long
#define INF (LL)(1LL<<60)
#define all(a) a.begin(), a.end()
#define gr greater<L... | 0 | 90,548,429 |
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a); i<(b); ++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#de... | #include <iostream>
using namespace std;
int w,h;
int tx[4] = {0,-1,0,1};
int ty[4] = {-1,0,1,0};
char map[21][21];
int slv(int x,int y){
map[y][x]='#';
int ans=0;
for(int i=0;i<4;++i)
if( x+tx[i]!=-1 && y+ty[i]!=-1 && x+tx[i]!=w && y+ty[i]!=h)
if( map[y+ty[i]][x+tx[i]] == '.' )
... | 0 | 85,332,936 |
#include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define END(x) cout << x << endl; exit(0);
#define YN(x) x ? cout << "YES" << endl : cout << "... | #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 = 1000000000LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 29,476,840 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
i... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 36,119,425 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define endl "\n"
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s;
cin >> s;
sort(s.begin(), s.end());
if(s.at(0) == s.at(1)... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 90,071,411 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, s1 = 0, s2 = 0, diff = 10007, dif;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 1; i < n; i++)
{
s1 = s2 = 0;
for (int j = 0; j < i; j++)
{
s1 = s1 + a[j];
}
for (int k = i; k ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll ta[2000][2000],yo[2000][2000];
int main() {
ll h,w;
cin>>h>>w;
char ch[2001][2001];
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
char now;
cin>>now;
ch[i][j]=now;
}
}
for(ll i=0;i<h;i++){
... | 0 | 28,516,710 |
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) pus... | #include<stdio.h>
int main(){
int W,H,x,y,r;
scanf("%d %d %d %d %d",&W,&H,&x,&y,&r);
if(x-r<0){
printf("No\n");
}
else if(y-r<0){
printf("No\n");
}
else if(x+r>W){
printf("No\n");
}
else if(y+r>H){
printf("No\n");
}
else{
printf("Yes\n"... | 0 | 18,242,631 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
int days[11] = {0, 20, 19, 20, 19, 20, 19, 20, 19, 20, 19};
void solve()
{
int y, m, d;
cin >> y >> m >> d;
int ans = 0;
if (d != 1)
{
if ((y % 3) == 0)
{
ans += 20 - d + 1;
}
else
{
ans += days[m] - d + 1;
}
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
using Graph = vector<vector<int>>;
int ctoi(char c) {
if( c >= '0' && c <= '9' ) return c-'0';
else return -1;
}
signed main() {
int N, P;
cin >> N >> P;
string S;
cin >> S;
reverse(S.begin(), S.end());
if( P... | 0 | 35,806,726 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vpii = vector<pair<int, int>>;
int main()
{
string s;
cin >> s;
ll k=s.size();
ll cnt_0 = 0,cnt_1 = 0;
for (int i = ... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 0 | 64,134,040 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#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 tr... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long k;
cin>>k;
vector<long long>v(50ll,49ll+k/50ll);
long long m=k%50ll;
long long mo=0;
for(int i=0;i<m;i++){
v[i]+=50ll-mo-m+1ll;
mo++;
}
for(int i=m;i<50;i++){
v[i]+=-m;
}
cout<<50<<'\n';
... | 0 | 74,102,337 |
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <queue>
#include <string>
#include <stack>
#include <utility>
#include <queue>
#include <cmath>
#define mp make_pair
#define pii pair<int,int>
#define ff first
#define ss second
#define ll long... | 0 | 30,970,013 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int a, b, c;
cin >> a >> b... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;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; }
lli n, x;
int main(void){
cin >> n... | 0 | 31,582,699 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> num(3);
for(int i=0; i<3; i++){
cin >> num.at(i);
}
sort(num.begin(),num.end());
int ans=0;
if((num.at(2)-num.at(0))%2 && (num.at(2)-num.at(1))%2){
ans+=num.at(2)-num.at(1)+(num.at(1)-num.at(0))/2;
}
el... | #include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;
int N;
ll C, K;
ll arr[100005];
int solve(int count) {
sort(arr, arr+N);
int start = arr[0];
int bus = 1;
for(int i=1; i<N; i++) {
if(arr[i] <= (start + K) && bus < C) {
bus++;
... | 0 | 83,366,872 |
#include <iostream>
#include <string>
using namespace std;
string str;
string meirei;
int n;
void pri(int a, int b)
{
while (a <= b)
{
cout << str[a];
a++;
}
cout << endl;
}
void rep(int a, int b, string s)
{
str.replace(a , (b - a + 1), s);
}
void rev(int a, int b)
{
string han;
int aa = a, bb = b;
while ... | #include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <typename T>
using V = vec... | 0 | 23,728,850 |
#include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
using namespace std;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#de... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static const int MAX = 10000;
int solve_coin_changing1(vector<int> coins, int target) {
vector<vector<int>> com = {{0}};
com.push_back(coins);
bool data[50000] = {false};
for (int n = 2; n <= 10000; n++) {
vect... | 0 | 94,421,818 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<string,int> m;
for(int i=0;i<n;i++){
string s;
cin>>s;
sort(s.begin(),s.end());
m[s]+=1;
}
long long int ans=0;
for(auto a:m){
long long int hoge=a.second;
if(hoge==1)continue;
ans+=(hoge*hoge-hoge)/2;
... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long x,long y){
if(y==0)return x;
return gcd(y,x%y);
}
long long lcm(long x,long y){
return x*y/gcd(x,y);
}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main()
{
int N,C,K,T[100010]={},ans=0,pcnt=0,et=0;... | 0 | 42,582,004 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
using Graph = vector<vector<ll>>;
#define rep(i, n) for(ll i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int N, K;
vector<int> d;
vector<vector<int>> A;
void input() {
cin >> N >> K;
d.resize(K);
A.resize(K, vector<int>());
for(int i = 0; i < K; i++) {
cin >> d[i];
A[i].resize(d[i]);
for(int j = 0; j < d[i]; j++) {
cin >> A[i... | 0 | 52,288,412 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i < (int)n; i++)
ll inf = 1e9+7;
ll gcd(ll a, ll b){
return (b != 0) ? gcd(b, a%b) : a;
}
ll lcm(ll a, ll b){
return (a/gcd(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
ll n, a, b;
cin >> n >> a >> b;
if (a >= n) cout << n << endl;
else {
if (a + b >= n) {
cout << a << endl;
}
else {
ll ans = 0;
ans +... | 0 | 17,454,086 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define doub... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | 0 | 93,256,814 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
ll ans=0;
bool end=false;
while(!end){
end=true;
ll cnt=0;
for(int i=0... | #include <bits/stdc++.h>
using namespace std;
int nth_bit(int64_t num, int n){
return (num >> n) & 1;
}
int64_t msb(int64_t v){
v = v | (v >> 1);
v = v | (v >> 2);
v = v | (v >> 4);
v = v | (v >> 8);
v = v | (v >> 16);
v = v | (v >> 32);
return v ^ (v >> 1);
}
int main(){
int N;
cin >> N;
... | 0 | 29,985,595 |
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<set>
#include <valarray>
#include<stack>
#include<sstream>
using namespace std;
void Solution()
{
int n, m;
while (cin>>n>>m)
{... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 2e5 + 77 , M = 1e9+7;
int A[N] , C[N];
string s;
int32_t main(){
fast;
int n , k ; cin >> n >> k ;
for(int i = 0 ; i < n ; ++i) cin >> A[... | 0 | 75,451,617 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.