code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <cstdio>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n) != EOF) {
int cnt=0;
for(int a=0;a<10;++a) {
if(n-a>27) continue;
for(int b=0;b<10;++b) {
if(n-a-b>18) continue;
for(int c=0;c<10;++c) {
if(n-a-b-c>9) continue;
for(int d=0;d<10;++d) {
if(n == (a+b+c+d)) ... | #include<iostream>
using namespace std;
#define L long long int
int main(){
int n,ans;
while(cin>>n){
ans=0;
int a,b,c,d;
for(a=9;a>=0;a--)for(b=9;b>=0;b--)for(c=9;c>=0;c--)for(d=9;d>=0;d--){
if(a+b+c+d==n){ans++;
}else if(a+b+c+d<n){break;
}
}
cout<<ans<<endl;
}
return 0;
} | 1 | 68,022,626 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
int ans = 0;
for (int i = n - k; i < n; ++i){
ans += v[i];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; ++i) {
int x; cin >> x;
if (pq.size() < k) pq.push(x);
else if (pq.size() >= ... | 1 | 29,675,633 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,P>
#define T tuple<int,int,int>
using namespace std;
int main(){
int n,x; cin... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n,x;
cin>>n>>x;
vector<int64_t> a(n+1);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
a.at(n)=x;
sort(a.begin(),a.end());
int64_t gcd_wk;
if(n==1){
gcd_wk=a.at(1)-a.at(0);
}
else{
gcd_wk=gcd(a.at(1)-a.at(0),a.at(2)-a.at(1));
... | 1 | 69,688,443 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define sz(a) (int)a.size()
#define int long long
using namespace std;
int a[200010];
int sl[200010];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i= 0; i < n; i++) {
cin >> ... | 1 | 52,979,901 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (int)1.01e9;
const int N = 1 << 19;
const int MOD = (int)1e9 + 7;
int main() {
#ifdef HOME
freopen("in", "r", stdin);
#endif
int n, m, d;
while (cin >> n >> m >> d) {
string Z = "RGYB";
vector<vector<char> > ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int H, W, d;
cin >> H >> W >> d;
string color = "RGBY";
for (int x = 0; x < H; ++x) {
for (int y = 0; y < W; ++y) {
int u = x + y, v = x - y + 100000 * d;
int kind = 0;
kind += (u % (d * 2... | 1 | 4,237,894 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int w,h,n;
cin>>w>>h>>n;
int minx=0,maxx=w,miny=0,maxy=h;
for(int i=0;i<n;i++)
{
int x,y,a;
cin>>x>>y>>a;
if(a==1)
{
minx=max... | #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; } re... | 1 | 80,878,276 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
const int MAX_N = 10000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long H,W;
cin >> H >> W;
long long ans = 0;
long long sq = H*W;
if (W == 1 || H ==1){
ans = 1;
}
else{
if(sq%2LL ==0){
ans = H*W/2;
}
else{
ans = (H*W/2)+1;
}
}
cout << ans << endl;
} | 1 | 22,813,559 |
#include<iostream>
#include<vector>
#include<queue>
struct node {
std::vector<int> child;
int distance;
};
int main() {
int node_num;
std::cin >> node_num;
std::vector<node> n(node_num);
for (int i = 0; i < node_num; i++) {
int num, to, node_val;
std::cin >> node_val >> num;
for (int j = 0; j < num; j++) {
... | #include <cstdio>
#include <queue>
using namespace std;
#define MAX_N 100
int g[MAX_N+1][MAX_N+1];
int d[MAX_N+1];
bool visited[MAX_N+1];
queue<int> que;
int n;
int t = 1;
void bfs(int id) {
visited[id]=true;
que.push(id);
queue<int> next_que;
while(!que.empty()) {
int v = que.front(); que.pop();
for(in... | 1 | 37,782,992 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; long long k;
cin >> n >> k;
puts(n*500 >= k ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int k, x;
cin >> k >> x;
cout << (k * 500 < x ? "No" : "Yes");
}
int main()
{
fastio;... | 1 | 85,055,579 |
#include <iostream>
using namespace std;
int main()
{
int input_01[255];
int input_02[255];
int input_id = 0;
while(1) {
cin >> input_01[input_id] >> input_02[input_id];
if(input_01[input_id] == 0 && input_02[input_id] == 0) break;
input_id++;
}
int draw_id = 0;
while... | #include <stdio.h>
int main(void) {
int H[100000], W[100000];
int i, j, k, n = 0;
do {
scanf("%d %d", &H[n], &W[n]);
n++;
} while (!(H[n - 1] == 0 && W[n - 1] == 0));
for (j = 0; j < H[0]; j++) {
for (k = 0; k < W[0]; k++) {
printf("#");
}
puts("");
}
for (i = 1; i < n; i++) {
... | 1 | 76,951,266 |
#include <bits/stdc++.h>
using namespace std;
long long x, y;
signed main () {
scanf("%lld %lld", &x, &y);
if (abs(x - y) > 1)
printf("Alice\n");
else
printf("Brown\n");
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong x, y;
int main() {
cin >> x ... | 1 | 81,671,455 |
#include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define sz size()... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int n,m;
cin >> n >> m;
vector<int> l(m);
vector<int> r(m);
rep(i,m) cin >> l.at(i) >> r.at(i);
int l_max = 0;
... | 1 | 87,478,500 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main()
{
int n;cin>>n;
vector<int> a(n);
for (int i = 0; i < n; i++)
{
... | 1 | 47,690,404 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long time = 0, N, last = 0, T, t;
for (cin >> N >> T; N; N--) {
cin >> t;
time += T-max(0ll,last-t);
last = t+T;
}
cout << time;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll N, T;
cin >> N >> T;
vector<int> t(N);
rep(i,N) cin >> t.at(i);
sort(t.begin(), t.end());
ll Tend = 0;
ll ans = 0;
rep(i,N) {
... | 1 | 37,477,998 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define endl '\n'
#define first F
#define second S
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int x, y; cin>>x>>y;
bool flag = true;
for(int i=0; i<=x && flag; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 1 | 46,700,765 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
ll a,b,k;
cin >> a >> b >> k;
for(int i=0;i<k;i++){
if(i%2==0){
b+=a/2;
a/=2;
}else{
a+=b/2;
b/=2;
}
}
cout << a<<" "<<b<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define debug(var) do{std::cout << #var << " : "; view(var);}while(0)
using namespace std;
typedef long long ll;
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
tem... | 1 | 84,573,082 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
int main()
{
int a , b , c;
cin >> a >> b >> c;
if(c >= a && c <= b){
cout... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=200010;
const ll mod... | 1 | 41,046,409 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include<bits/stdc++.h>
#define Imposter ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll... | 1 | 42,773,960 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 1 | 11,569,070 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | #include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
#include<functional>
#define int long long
#... | 1 | 41,855,197 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#includ... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | 1 | 29,591,281 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 1 | 87,393,858 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | 1 | 43,821,766 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
#define INF 1020304050
int main()
{
int n;cin>>n;
vector<int> r(n);
vector<int> c(n);
int i,j,k;
rep(i,n)cin>>r[i]>>c[i];
vector<vector<int>> dp(n,vector<int>(n,INF));
rep(... | #include <iostream>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, s, n) for(int i = s; i < n; i++)
using namespace std;
vector<int> r(100), c(100);
vector<vector<int>> dp(100, vector<int>(100, -1));
int rec(int left, int right){
if (right - left == 0) return 0;
if (right - left == 1... | 1 | 59,316,295 |
#include<stdio.h>
#include<string.h>
int main() {
int n,k;
scanf("%d%d", &n, &k);
char buffer[101];
char str[100][101];
for(int i=0; i<n; i++){
scanf("%s", &str[i]);
}
for(int i=0; i<n-1; i++){
for(int j=n-1; i<j; j--){
if(strcmp(str[j-1], str[j])>0){
strcpy(buffer, str[j]);
... | #include <bits/stdc++.h>
#define X first
#define Y second
#define MP make_pair
using namespace std;
typedef long long ll;
const int N = 1e5 + 12;
const ll mod = 1e9 + 7;
int n, m;
string s[N];
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 1;i <= n;i++)
cin >> s[i];
s... | 1 | 23,239,583 |
#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... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {... | 1 | 73,318,061 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef unsigned long long ull;
int main(){
int n,k; cin>>n>>k;
vector<ll> h(n);
rep(i,n) cin>>h.at(i);
ll ans=0;
sort(h.begin(), h.end());
rep(i,n-k){
ans+=h.at(i);
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 1 | 8,792,175 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long X, Y;
cin >> X >> Y;
long long cnt = 1LL;
while (X <= Y)
{
X *= 2LL;
if (X > Y)
break;
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x, y; cin >> x >> y;
int cnt = 1;
while(true) {
x *= 2;
if (x <= y) cnt ++;
else break;
}
cout << cnt << endl;
} | 1 | 7,187,822 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... | #include <stdio.h>
int main() {
int mat[3][3];
for(int i = 0; i < 3; i++) {
for(int j = 0; j < 3; j++) {
scanf("%d", &mat[i][j]);
}
}
int c[3][3] = {};
int a;
scanf("%d", &a);
int b;
for(int i = 0; i < a; i++) {
scanf("%d", &b);
for(int j = 0; j < 3; j++) {
for(int k = 0; k < 3; k++) {
if(b ==... | 1 | 1,907,330 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
string S; cin >> S;
int N = S.size();
int w = 0;
int ans = 0;
rep(i, N) {
if(S[i] == 'W') {
ans += i-w;
... | 1 | 11,128,278 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | 1 | 2,082,444 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
#define rep(i, n) for(_LL i = 0; i < (_LL)(n); i++)
int modl(_LL a, _LL k)
{
a %= k;
if( a < 0 ) a += k * ( 1 - (a + 1) / k );
return a;
}
int modadd(_LL a, _LL b, _LL k)
{
return modl(a + b, k);
}
int modminus(_LL a... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
#include <unordered_map>
#include <iterator>
#include <string>
#include <limits>
using namespace std;
using i64 = int64_t;
using P = pair<i64, i64>;
i64 mod = 99... | 1 | 9,094,905 |
#include <stdio.h>
int n;
int r[100], c[100];
int dp[101][101];
int main(void)
{
int i, j, w, m;
for (i = 0; i < 101; i++){
for (j = 0; j < 101; j++){
dp[i][j] = 1 << 28;
}
}
for (i = 0; i < 100; i++){
dp[i][i + 1] = 0;
}
scanf("%d", &n);
for (i = 0; i < n; i++){
scanf("%d %d", &r[i], &c[i]);
}
for ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define INF 1e9
int main(void){
int n;
cin >> n;
int unwanted;
vector<int> c(n + 1);
cin >> c[0] >> c[1];
for(int i = 2; i <= n; i++){ cin >> unwanted >> c[i]; }
vector<vector<int> > dp(n, vector<int>(n + 1, INF));
for(int i... | 1 | 25,346,241 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,a_sum=0;
cin >> n >> m;
vector <int> a(m);
for(int i=0; i<m; i++){
cin >> a.at(i);
a_sum += a.at(i);
}
if(a_sum > n) cout << -1 << endl;
else if(a_sum <= n) cout << n - a_sum << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, m, a, b = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a;
b = b + a;
}
if (n < b) {
cout << "-1\n";
}
else {
cout << n - b << "\n";
}
return 0;
} | 1 | 70,671,671 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a,b;
cin>>a>>b;
cout<<a+b/2<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
const int mod = 1000000007;
ll pow(ll base, ll order) {
ll ans = 1;
rep(i,order - 1) ans *= base;
return ans;
}
int gcd(int a, int b) {
if (a < b) {
int c = a;
a = b;
... | 1 | 8,127,124 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1... | 1 | 84,491,449 |
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a > b) cout << "a > b";
if(a == b) cout << "a == b";
if(a < b) cout << "a < b";
cout << endl;
} | #include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
int main(){
int a,b;
cin>>a>>b;
if(a<b)puts("a < b");
if(a>b)puts("a > b");
if(a==b)puts("a == b");
} | 1 | 59,161,383 |
#include<iostream>
using namespace std;
typedef long long ll;
ll K;
int main() {
cin >> K;
if (K <= 50) {
cout << 50 << endl;
for (int i = 0; i < 50; i++) {
if (i + K >= 50)cout << i + 1 << " ";
else cout << 0 << " ";
}
cout << endl;
}
else {
cout << 50 << endl;
ll syou = K / 50LL;
ll amari = K ... | #include <iostream>
#include<iomanip>
#include <set>
#include <vector>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <stack>
using namespace std;
const int NN=5e6+10;
long long n;
long long a[100][100];
int main()
{
scanf("%lld"... | 1 | 70,522,379 |
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll X, ll t) {
cout << max(0ll, X-t) << endl;
}
int main() {
ll X;
cin >> X;
ll t;
cin >> ... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll X, t;
cin >> X >> t;
cout << max(0ll, X - t) << endl;
} | 1 | 70,568,319 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const ... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 1 | 4,587,293 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | #include <bits/stdc++.h>
#define ll long long
int main() {
std::ios::sync_with_stdio(false);
using namespace std;
ll n;
cin >> n;
vector<int> A(n + 2);
A[0] = n + 1;
A[n + 1] = n + 2;
for(int i = 1; i < n + 1; i++)
cin >> A[i];
vector<int> next(n + 2),
nnext(n... | 1 | 14,898,562 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/range/adaptor/reversed.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long int ll;
#define PI (acos(-1))
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define dump(x)... | 1 | 163,530 |
#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)... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <iomanip>
using namespace std;
#define SORT(v... | 1 | 91,019,447 |
#include <bits/stdc++.h>
#define rep2(i,m,n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x){
return x * x;
}
signed main (){
string s;
cin >> s;
fo... | #include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<set>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define Lrep(i,a,n) for(int i = (... | 1 | 6,875,706 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(){
char dic[100000][2]={};
char m[100000]={};
int i=0,ii=0,j=0;
int foo=1;
int n,mn;
unsigned char tem,memo;
while(ii<5){
cin>>n;
if(n==0)break;
for(i=0;i<n;i++){
for(j=0;j<2;j++){
cin>>dic[i][j];
... | #include<iostream>
using namespace std;
main(){
int i,j;
int n,m;
cin>>n;
while(n!=0){
char t[n][2];
for(i=0;i<n;i++)
cin>>t[i][0]>>t[i][1];
cin>>m;
char ans[m+1];
for(i=0;i<m;i++){
cin>>ans[i];
for(j=0;j<n;j++){
if(t[j][0]==ans[i]){
ans[i]=t[j][1];
break;
}
}... | 1 | 63,906,079 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define INF 1e8
typedef long long int ll;
const double PI = acos(-1);
using Graph = vector<vector<int>>;
bool isKaibun(string s)
{
string r = s;
reverse(r.begin(), r.end());
int len = s.length... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string tmp;
string a = s.substr(0,(s.size()-1)/2);
string b = s.substr((s.size()+3)/2-1,s.size()-(s.size()+3)/2+1);
int ans = 1;
tmp = a;
reverse(a.begin(), a.end());
if(tmp != a){
ans = 0;
}
tmp = b;
reverse(b.begi... | 1 | 14,408,188 |
#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(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 1 | 55,354,934 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespa... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | 1 | 74,685,020 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long doubl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int &x: a) cin >> x;
int cur = a[0];
ll ans = 0;
for (int i = 1; i < n; i++)
if (a[i] < cur) ans += (ll)(cur -... | 1 | 24,308,247 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#define ll long long
using namespace std;
template <class T>
inline void rd(T &x)
{
x=0; char c=getchar(); int f=1;
while(!isdigit(c)){if(c=='-')f=-1; c=getchar();}
while(isdigit(c)) x=x*10-'0'+c,c=getchar(); x*=f;
}
const int N=2e5+10,mod... | 1 | 38,624,558 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int N;
vector<int> R, C;
vector<vector<int> > dp;
int dfs(int l, int r) {
if ( r == l ) return 0;
if ( dp[l][r] ) return dp[l][r];
int ret = INF;
for ( int i = l; i < r; i++ ) {
ret = min(ret, dfs(l, i)+dfs(i+1, r)+R[l]*C[i]*C[r]);
}
ret... | #include<bits/stdc++.h>
#include<algorithm>
#include <cstdlib>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int MAXN = 1e5+10;
int p[205],f[105][105];
int main(void)
{
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i = 1; i <= n; ++i)
cin>>p[i-1]>>p[i];
memset(f,INF,sizeof f);
f... | 1 | 36,890,488 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N ;
cin >> N;
vector<string> w(N);
for(int i= 0; i<N; i++){
cin >> w.at(i);
}
for(int i = 0; i<N-1; i++){
for(int j= i+1; j<N; j++){
if(w.at(i) == w.at(j)){
cout << "No" << endl;
return 0;
}
}
}
for(int ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
map<string,int>mp{};
char b;
string w_i;
cin >> w_i;
mp[w_i] = 1;
b = w_i[w_i.size()-1];
for(int i=1;i<N;i++){
cin >> w_i;
if(w_i[0] == b && mp.count(w_i) == 0){
mp[w_i] = 1;
... | 1 | 15,389,925 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repeq(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define rep1eq(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
usi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
int A,B,C;
char a,b;
cin>>A>>a>>B>>b>>C;
if(A<2019)
cout<<"Heisei"<<endl;
else if(A==2019&&B<4)
cout<<"Heisei"<<endl;
else if(A==2019&&B==4&&C<=30)
cout<<"Heisei"<<endl;
els... | 1 | 41,552,685 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s; cin >> s;
int n = s.size();
if(s == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1 << endl;
return 0;
}
if(n != 26) {
for(char a = 'a'; a <= 'z'; a++) {
if(count(s.begin(), s.end(), a) == 0) {
cout << s << a << endl;... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=200010;
const ll mod... | 1 | 74,880,904 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int gcd(int a, int b)
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main()
{
int N... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
... | 1 | 405,266 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iomanip>
#include<sstream>
#include<map>
#include<set>
#include<cmath>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
const int p = 26;
vector<vector<int>> num(n, vector<int>(p, 0));
for (int i = 0; i < n; i++) {
string s; cin >> s;
for (int j = 0; j < s.size(); j++) {
num[i][s[j] - 'a']++;
}
}
vector<int> ans(p, 1000);
st... | 1 | 49,378,429 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin>> H >>W;
vector<vector<char>> a(H, vector<char>(W));
vector<bool> row(H, false);
vector<bool> col(W, false);
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>>a[i][j];
if(a[i][j]=='#'){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w; cin>>h>>w;
int r[h]={0},c[w]={0};
char a[h][w];
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin>>a[i][j];
if(a[i][j]=='#') r[i]++,c[j]++;
}
}
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
if(r[i]&&c[j]) c... | 1 | 79,189,064 |
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c,d;
cin >> a >> b >> c >> d;
vector<int> vec(101);
for(int i=a;i<=b;i++) vec.at(i)++;
for(int i=c;i<=d;i++) vec.at(i)++;
int minute = 0;
for(int i=0;i<=100;i++){
if(vec.at(i)==2) minute++;
}
cout << max(0,m... | 1 | 67,104,551 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char s[110],t[110];
int main(){
scanf("%s%s",s+1,t+1);
bool mk=true;
for(int i=1;i<=strlen(s+1);++i)if(s[i]!=t[i]){
mk=false;
break;
}
cout<<(mk ? "Yes" : "No")<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
int c=0;
for(int i=0; i<b.size()-1; i++)
{
if(a[i]!=b[i])
c++;
}
if(c==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 1 | 13,420,140 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,A,B;
cin>>n>>A>>B;
int ans=B-A-1;
if(ans%2==0)
cout<<"Borys";
else
cout<<"Alice";
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
int n,a,b;
cin >> n >> a >> b;
if((b-a) % 2 == 0)
cout << "Alice" << endl;
else
cout << "Borys" << endl;
} | 1 | 61,994,130 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, x;
cin >> a >> b >> x;
string ans;
if (a <= x && x <= a + b) {
ans = "YES";
} else {
ans = "NO";
}
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | 1 | 3,449,601 |
#include<stdio.h>
int main()
{
char arr[20];
scanf("%s",&arr);
arr[5]=' ';
arr[13]=' ';
printf("%s",arr);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main() {
string s;
cin >>s;
s[5] = ' ';
s[13] =' ';
cout << s<< endl;
} | 1 | 30,550,043 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string s; getline(cin,s);
string word;
map<string,int> dic;
for(int i=0;i<s.size();i++){
if(s[i]!=' '){
word+=s[i];
}
else{
dic[word]++;
word="";
}
}
dic[word]++;
int num=0;
for(auto it:dic) num=max(num,it.sec... | #include <iostream>
#include <string>
#include <map>
int main()
{
std::map<std::string, int> m;
std::string s, max_len_str = "";
int max_freq = 0;
while (std::cin >> s) {
if (max_len_str.size() < s.size()) max_len_str = s;
++m[s];
if (max_freq < m[s]) max_freq = m[s];
}
f... | 1 | 30,542,852 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;string s;cin >> n >> s;int left_count = 0,ans = 0;
for (int i = 0; i < n; i++) {
char x = s[i];
if (x == '(')left_count++;
else {
if (left_count >= 1)left_count--;
else ans++;
}
}
for (int i = 0; i < ans; i++)cout << "(";
cout << s;
fo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).... | 1 | 30,567,531 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int N,K; cin >>N >>K;
vector<int> A(N);
rep(i,0,N) {
cin >>A[i];
}
vector<int> c(N+1);
rep(i,0,N) {
c[A[i]]++;
}
so... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <climits>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> arr(n);
vector<int> sss(200001);
for (int i = 0; i < n; i++) ... | 1 | 42,331,204 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int N; cin >> N;
int p = 0, ans = 0;
while (N--)
{int h; cin >> h;
if (p < h) ans += h - p;
p = h;}
cout << ans << endl;} | #include <bits/stdc++.h>
using namespace std;
int N;
int h[110];
int main()
{
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> h[i];
}
int cnt = 0;
while (true)
{
int i = 0;
while (i < N && h[i] == 0)
{
if (i == N - 1 && h[i] == 0)
{
... | 1 | 67,803,422 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main(){
ll n , m ; cin >> n >> m;
vector<bool> chk(n,... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n,m,a,b;
ci... | 1 | 34,504,640 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <set>
#include <map>
#define INF 100000
using namespace std;
int main(){
vector<int> yama;
for (int i=0; i<10; i++) {
int hi;... | #define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
using namespace std;
void function()
{
}
int main(){
int max1 = 0;
int max2 = 0;
int max3 = 0;
for (int i... | 1 | 68,012,148 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<int> A(N);
map<int,int> map;
for (int i =0; i<N; i++) {
int a; cin >> a; A.at(i) = a;
map[a] = i;
}
for (auto p : map) {
int x = p.second + 1;
cout << x << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 1 | 32,918,093 |
#include <iostream>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
string s;cin >> s;
int len = s.length();
int mi = 1000;
rep(i,len-2){
int a = s[i]-'0';int b = s[i+1]-'0';
int c = s[i+2]-'0';
int tmp = a*100+b*10+c;
mi = min(abs(753-tmp), mi);
}
c... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int to_int(char ch) {
return (int)(ch - '0');
}
int main() {
fastIO;
string s;
cin >> s;
int... | 1 | 66,895,300 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <functional>
using namespace std;
using ll = long long;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, pair<ll, ll>> PP;
const ll MOD = 1e9 + 7;
const ll INF = 1 << 30;
const ll... | #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 ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typen... | 1 | 78,805,373 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
using Graph = V<V<int>>;
Graph g;
V<bool> seen;
int n, m;
int ans = 0, cnt = 0;
void dfs(int v) {
seen[v] = true;
cnt++;
if(c... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | 1 | 78,039,153 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n=(int)(s.length());
int res=0;
if(n<=3){
cout << "No";
}else if(s[0]=='Y' && s[1]=='A' && s[2]=='K' && s[3]=='I'){
cout << "Yes";
}else{
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
string S; cin >> S;
int N = S.size();
if(N < 4) {
cout << "No" << '\n';
return 0;
}
cout << (S.substr(0, 4) == "YAKI" ? "Yes" : "No") << '\n';
return 0;
} | 1 | 64,224,142 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &... | #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... | 1 | 18,204,519 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#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,... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int N,K;
cin >> N >> K;
string s;
cin >> s;
vector<int> num;
num.push_back(0);
num.push_back(0);
for(int i=0; i<s.size()-1; i++){
if(s[i] != s[i+1]){
... | 1 | 37,079,820 |
#include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const ll oo = 1e11 + 7;
const int mod = 1e9 + 7, maxn = (3 * 1e5) + 10;
const long double PI = acos(-1);
long double fexp(long double a, int b){
long dou... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=998244353;
int main(void){
int n,k;
cin>>n>>k;
int a=1;
while((1<<a)<k) a++;
int ans=0;
double q=n*(1<<a);
int temp=1;
int b=0;
wh... | 1 | 8,020,126 |
#include <cstdio>
using namespace std;
int in(){ int x; scanf("%d", &x); return x; }
int main(){
int n;
for(int i = 1;; i++){
n = in();
if(n == 0) break;
printf("Case %d: %d\n", i, n);
}
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
int N[65535];
int i = 0;
while(1){
scanf("%d", &N[i]);
if(N[i] == 0) break;
i++;
}
for (int j = 0; j < i; j++){
cout << "Case " << j+1 << ": " << N[j] << "\n";
}
return... | 1 | 6,846,474 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair... | 1 | 73,731,588 |
#include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
ll Power(ll a,int b)
{
ll res=1LL;
while (b>0LL)
{
if (b%2LL==1LL)
res=res*a;
a=a*a;
b=b/2LL;
}
return res;
}
int main()
{
ll n;
scanf(... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
if (n % 2 == 1) {
cout << 0 << endl;
return EXIT_SUCCESS;
}
ll ans = 0;
ll b = 10;
while (b <= 2e18) {
ans += n / b;
b *= 5;
}
cout << ans << endl;
} | 1 | 30,048,413 |
#include<bits/stdc++.h>
#define mod 1000000007
#define int long long int
#define phi 1.6180339
#define rep(i,n) for(auto i=0;i<(n);i++)
#define endl "\n"
#define For(i,a,b) for(auto i=(a);i<(b);i++)
#define op1 cin.tie(NULL)
#define op2 cout.tie(NULL)
#define op3 std::ios_base::sync_with_stdio(false)
#define MAXX 10000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, sum = 0;
cin >> A >> B;
for (int num = A; num < B+1; num++){
int reverse = 0;
int a = num;
for (int i = 0; i < 5; i++){
int remaind = 0;
remaind = a % 10;
reverse = reverse * 10 +... | 1 | 76,362,918 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define frep(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, n) frep(i, 0, (n))
#define rrep(i, n) for(int i = (n - 1); i >= 0; i--)
#define all(i, x) for(typeof(x.begin()) i = x.begin(); i != x.end(); i++)
#define pb p... | #include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1000005
using namespace std;
int n, k = -1, m;
vector < int > g[N];
int main() {
scanf("%d",&n);
n += n;
for(int i = 1; i <= n; i++)
if(1ll*i*(i + 1) == n){
k = i + 1;
break;
}
if(k == -1){
pu... | 1 | 27,936,152 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main(void){
int n, k, ans=0;
cin >> n >> k;
vector<int> p(n);
rep(i,n) cin >> p[i];
sort(p.begin(),p.end());
rep(i,k) ans += p[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
const int MAX_N = 1005;
int N, K;
int as[MAX_N];
int main() {
scanf("%d %d", &N, &K);
for (int i = 0; i < N; ++i)
scanf("%d", as + i);
std::sort(as, as+N);
int ans = 0;
for (int i = 0; i < K; ++i)
ans += as[i];
printf("%d\n", ans);
} | 1 | 28,886,290 |
#include <iostream>
#include <set>
#include <map>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <climits>
#include <math.h>
#include <cassert>
#include <unordered_map>
#include <chrono>
#include <random>
#include ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200010;
int n, k;
ll s[N];
map<ll,ll>S;
int main() {
cin >> n >> k;
for(int i = 1, x; i <= n; ++i) {
cin >> x;
s[i] = s[i - 1] + x;
}
S[0] = 1;
ll ans = 0;
int l = 0;
for(int i = 1; i <= n; ++i) {
if(i >= k) {S[(s[l] - l + k)... | 1 | 91,405,336 |
#include <stdio.h>
int main()
{
char S[7];
scanf ("%s", &S);
((S[2] == S[3]) && (S[4] == S[5])) ? puts ("Yes") : puts ("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin>>S;
if(S.length()==6){
if(S[2]==S[3]&&S[4]==S[5]){
cout<<"Yes";
}
else{
cout<<"No";
}
}
} | 1 | 39,732,244 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int hist[N] = {0};
int A;
for (int i = 0; i < N; i++) {
cin >> A;
hist[A - 1]++;
}
sort(hist, hist + N);
int l = 0;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,k;
cin >> n >> k;
vector<int>a(n);
rep(i,n)cin >> a.at(i);
vector<int>b(200010);
int count = 0;
rep(i,n) b.at(a.at(i))++;
rep(i,200010) if(b.at(i)>=1) count++;
re... | 1 | 66,528,385 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int b[26... | 1 | 17,147,433 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin,(x).end()
int main(){
vector<int> a(3);
rep(i,3){cin >> a[i];}
sort(a.begin(),a.end());
int kind = 1;
for(int i = 1; i < 3; i++){
if(a[i] !=... | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a... | 1 | 26,022,764 |
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cmath>
using namespace std;
struct point
{
double x, y;
}pos[105];
bool cmp(point a, point b)
{
if (atan2(a.y, a.x) != atan2(b.y, b.x))
return atan2(a.y, a.x) < atan2(b.y, b.x);
else return a.x < b.x;
}
int main()
{
int n;
cin >> n;
for (int i = ... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define eps 1e-8
const int maxn=2e5+10;
int sgn(double k) {return k<-eps?-1:(k<eps?0:1);}
struct point{
double x,y,theta;
point(double a=0,double b=0,double c=0) {x=a,y=b,theta=c;}
friend bool operator<(const point &a,const point &b) {
... | 1 | 90,301,552 |
#include<iostream>
using namespace std;
int main(){
char a,b; cin >> a >> b;
if(a == 'H') cout << b << endl;
else cout << (b=='H'?'D':'H') << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
char a, b; cin >> a >> b;
if(a == b) cout << "H" << '\n';
else cout << "D" << '\n';
return 0;
} | 1 | 50,390,732 |
#include<bits/stdc++.h>
using namespace std;
int n,f[100010],p;
vector<int> a[100010];
inline void dfs(int i,int j)
{
int k;
for(k=0;k<a[i].size();k++)
if(a[i][k]!=j)
{
dfs(a[i][k],i);
if(!f[a[i][k]])
if(!f[i])
f[i]=1;
else
p=1;
}
}
int main()
{
int i,j,k;
scanf("%d",&n);
fo... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define SC(t,x) static_cast<t>(x)
#define AR(t) vector < t >
#define PII pair < int, int >
#define PLL pair < LL, LL >
#define PIL pair < int, LL >
#define PLI pair < LL, int >
#define MP make_pair
#define PB push_back
#define PF ... | 1 | 15,363,482 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout<<setprecision(32);
ll n, a, b;
cin>>n>>a>>b;
if(a > b){
cout<<0;
}else if(a == b){
cout<<1;
}else if(n == 1){
cout<<0;
}... | #include<iostream>
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
using namespace std;
int main()
{
fastio;
long long n,a,b,i;
cin>>n>>a>>b;
if(a>b)
{
cout<<0;
}
else if(n==1 && a!=b)
{
cout<<0;
... | 1 | 63,911,927 |
#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;
typedef complex<double> point;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldob;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
ty... | #include<bits/stdc++.h>
using namespace std;
int main(){
int K;
cin >> K;
queue<int64_t> lunlun;
for(int i=1; i<10; i++) lunlun.push(i);
int64_t t;
for(int i=0; i<(K-1); i++){
t = lunlun.front();
lunlun.pop();
if(t%10 != 0) lunlun.push(t * 10 + (t % 10 - 1));
lunl... | 1 | 6,669,982 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD = 1000000007;
ll cnt =0,ans=0;
const int MAX = 510000;
int main (){
string s;
cin >> s ;
ll n = s.size();
for(int i=0;i<n;i++){
ll a = s.at(i)-48;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int N = n.size();
int sum = 0;
for(int i = 0; i < N; i++){
int num = (int)n.at(i) - 48;
sum += num;
}
if(sum % 9 == 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 61,601,735 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define fix(n) cout<<fixed<<setprecision(n)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
using namespace std;
typedef long long ll;
const ll mod=1000000007;
double pi=3.1415926535;
int main(){
int q,w,e;
cin>>q>>w>>e;
if(q==w && ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define sort(a) sort(a.begin(), a.end())
#define reverse(s) reverse(s.begin(), s.end())
#define p(s) cout << (s) << endl
typedef long long ll;
using namespace std;
templa... | 1 | 77,221,669 |
#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,ans;
cin >> n;
rep(i,7) {
if(n >= pow(2,i)) ans = pow(2,i);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
int ni=1;
for(int i=0;i<8;i++){
if(n < ni){
cout << ni/2 << endl;
break;
}else if(n == ni){
cout << ni << endl;
break;
}else{
ni = ni * 2;
}
}
} | 1 | 1,664,553 |
#include <iostream>
using namespace std;
int main() {
int m[100][100]={};
int n,k,v,d;cin>>n;
for(int i=0;i<n;i++)
{
cin>>d>>k;d--;
for(int j=0;j<k;j++)
{
cin>>v;
m[d][--v]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
{
if(j)cout<<" ";cout<<m[i][j];
}cout<<endl;
}
return 0;
} | #include <iostream>
#include <sstream>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
bool ans[101][101];
int main(){
int n,u,k,v;
cin>>n;
for(int j=0;j<n;j++){
cin>>u>>k;
for(int i=0;i<k;i++){
cin>>v;
ans[u][v]=1;
}
}
... | 1 | 91,646,418 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N;
cin >> N;
int a[N+1];
rep(i,N) cin >> a[i+1];
int ans = 0;
int now = 1;
while (ans<N) {
ans++;
now = a[now];
if (now == 2) {
cout << ans << endl;
return 0;
}
}
cou... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=1,now;
cin >> n;
vector<int> buttons(n);
for(int i=0;i<n;i++){
cin >> buttons.at(i);
}
now=buttons.at(0);
while(now!=2){
now=buttons.at(now-1);
cnt++;
if(cnt>n){cnt=-1;break;}
}
cout << cnt << endl;
} | 1 | 51,657,386 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i... | #include<bits/stdc++.h>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
vector<int> x;
void init(){
x.clear();
}
bool input(){
int n;
cin>>n;
if(n==0)return false;
rep(i,n){
int a;
cin>>a;
x.push_back(a);
}
return true;
}
int solve(){
sort(x.be... | 1 | 54,708,997 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
typedef long long ll;
using namespace std;
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define rep(i, n) for(int i=0; i<(n); ++i)
namespace Sum
{
int exec(int N, int K)
{
vector<int> sum(N + 1, 0);
rep(i, N) {
int s; cin >> s;
sum... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#defi... | 1 | 10,634,725 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int N, i;
cin >> N >> i;
cout << N - i + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cout << fixed << setprecisi... | 1 | 28,451,864 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.