code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 9,366,210 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s;
cin >> s;
set<char> d;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 70,506,906 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T>
using Grid = vector<vector<T>>;
ll gcd(ll a, ll b) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int h[100];
cin >> n;
for (int i = 0; i < n; i++) cin >> h[i];
int ans = 0;
while (true) {
if (*max_element(h, h + n) == 0) break;
int i = 0;
while (i < n) {
if (h[i] == 0) i++;
else... | 0 | 62,716,124 |
#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,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
#define Graph vector<vector<int>>
int main() {
int N, D, X; cin >> N >> D >> X;
vector<int> A(... | 0 | 80,439,380 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S;
rep(i,0,M-1) {
int k;
cin >> k;
vector<int> s(k);
rep(j,0,k-1) {
cin >> s[j];
--s[j];
}
sort(s.begin(), s.end());
S.push_b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
#define gc getchar()
template <typename T>
inline void read(T& x) {
x = 0; bool f = 1; char ch;
... | 0 | 97,884,612 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k;cin>>k;
int a,b;cin>>a>>b;
int x=0;
for(int i=a;i<=b;i++)if(i%k==0)x=1;
if(x==0)cout<<"NG"<<endl;
else cout<<"OK"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int>... | 0 | 172,199 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int inf=100100100;
int main() {
int h,n;
cin >> h >> n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++){
cin >> a.at(i) >> b.at(i);
}
vector<int> dp(h+1,inf);
dp.at(0) = 0;
for(int i=0;i<n;i++){
for(int j=0;j<=h;j++){
int tmp ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (sca... | 0 | 21,602,250 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> x(3); cin >> x[0] >> x[1] >> x[2];
sort(x.begin(), x.end());
cout << x[2] * 10 + x[1] + x[0] << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define FF(i,a,b) for(int i=a;i<b;i++)
#define BF(i,a,b) for(int i=a;i>=b;i--)
#define vi vector<int>
#define MAP map<int,int>
#define pb push_back
#define MP ... | 0 | 89,352,591 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
if(r<1200) cout << "ABC" << endl;
if(r>=1200 && r<2800) cout << "ARC" << endl;
if(r>=2800) cout << "AGC" << endl;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A + B > C + D) {
printf("Left\n");
} else if (A + B < C + D) {
printf("Right\n");
} else {
printf("Balanced\n");
}
} | 0 | 95,090,891 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
if (M == 1){
cout << 1 << ' ' << 2 << endl;
return 0;
}
if (N % 2 == 1){
for (int i = 0; i < M; i++) {
cout << i+1 << ' ' << M*2 - i << endl;
}
}
else {
for (int i = 0; i < (M+1)/2; i++) {
co... | #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;
const ll INF = 1e12;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
ll ans = 0;
int befo... | 0 | 73,448,276 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int g[b][a+1],v;
for(int i=0;i<b;i++){
cin >> v;
for(int j=0;j<a+1;j++){
if(i==0){
g[i][j]=j/v;
}
else{
if(j-v<0)g[i][j]=g[i-1][j];
else g[i][j]=min(g[i-1][j],g[i][j-v]+1);
}
}
... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<string> A(N), B(M);
rep(i, N) cin >> A.at(i);
rep(i, M) cin >> B.at(i);
bool exis... | 0 | 85,770,676 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define NMAX 2010
const ll mod = 1000000000 + 7;
ll n, m;
ll dp[NMAX][NMAX];
ll s[NMAX], t[NMAX];
void init() {
rep(i, 0, NMAX) {
rep(j, 0, NMAX) dp[i][j] = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define endl '\n'
#define all(a, n) for (int i = 0; i < n; i++) cout << a[i] << " "; cout << endl;
#define IOS ios_base::sync_with_stdio(... | 0 | 62,695,792 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
ll INF = 1000000009;
int main()
{
ll h,w;
cin >> h >> w;
if (h % 3 == 0 || w % 3 == 0)
{
cout << 0 << "\n";
}
else
{
ll ans = INF * INF;
for (ll i = 1; i < h; i++)
{
ll x... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 53,341,484 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<l... | 0 | 14,370,703 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while(1) {
string s = to_string(n);
if (s[0]==s[1] && s[1]==s[2]) {
cout << n << endl;
return 0;
}
n++;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cc... | 0 | 49,076,870 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, k; cin >> n >> k;
int ans = 0;
for(int i = 0; i < n; i++){
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define all(x) (x).begi... | 0 | 45,736,977 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
vector<l_l> calc(vector<ll> list) {
mll m;
for... | 0 | 65,729,238 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(char b) { return "'" + string(1, b) + "'"; }
template <typename A, type... | #include<bits/stdc++.h>
using namespace std;
int x,y,a,b,c;
int main(){
cin>>x>>y>>a>>b>>c;
priority_queue<int,vector<int>,greater<int> >pq_a;
priority_queue<int,vector<int>,greater<int> >pq_b;
priority_queue<int,vector<int>,less<int> >pq_c;
while(a--){
int a;
cin>>a;
pq_a.push(a);
}
while(b--){
int a;
... | 0 | 45,910,284 |
#include <iostream>
using namespace std;
int main() {
int length;
cin >> length;
long sum=0;
int max, min;
for(int i=0; i<length; i++){
int num;
cin >> num;
sum+=num;
if(i==0){max=num; min=num;}
else{
if(num>max){max=num;}
if(num<min){min=num;}
}
}
cout << min << " " << max << " " << sum << endl;... | #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>
#include <bitset>
#include <cctype>
#in... | 0 | 37,752,968 |
#include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#define ll long long int
#define MOD 1000000007LL
using namespace std;
int main() {
int n;
cin>>n;
int sum=0;
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll N,L;
ll A[100000];
int main(){
cin >> N >> L;
for(int i=0;i<N;i++) cin >> A[i];
ll ind = -1;
for(int i=0;i<N-1;i++){
if(A[i] + A[i+1] >= L) ind = i+1;
}
if(ind < 0){
cout << "Impossible"... | 0 | 87,890,983 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
double m = (double)(a[n-1]+1)/2;
double d = a[n-1];
int res;
for (int i = 0; i < n-1; i++) {
if (ab... | #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--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll t[10... | 0 | 13,777,520 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==b){
cout << "a == b\n";
}else if(a<b){
cout << "a < b\n";
}else{
cout << "a > b\n";
}
return 0;
} | #include <iostream>
#include <queue>
using namespace std;
struct locate{
int x;
int y;
};
char graph[20][20];
int cou = 0;
int H,W;
void bfs(locate z){
queue<locate> Q;
locate u;
locate v;
Q.push(z);
while(!Q.empty()){
u = Q.front();Q.pop();
if(u.y < H - 1){
if(graph[u.y + 1][u.x] == '.' && ... | 0 | 17,384,349 |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i... | #include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#include <iomanip>
#include<set>
#include <numeric>
#pragma region Macros
#define int long long
#define double long double
constexpr int MOD = 1000000007;
constexpr double PI = 3.1415926535897932... | 0 | 88,689,185 |
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
#define dbg(x1) cout<<#x1<<" = "<<(x1)<<endl
#define dbg2(x1,x... | #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
while (!(H == 0 && W == 0)) {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cout << "#";
}
cout << endl;
}
cout << endl;
cin >> H >> W;
}
return 0;
} | 0 | 65,943,535 |
#include<iostream>
using namespace std;
int main()
{
char S[100],T[100];
cin>>S>>T;
cout<<T<<S<<endl;
return 0;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 8,056,016 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
int n;
double x;
string u;
cin >> n;
double ans = 0;
for(int i ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | 0 | 24,655,048 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
#define MAX 100005
#define NIL -1
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<char>>;
using P =pair<int,int>;
template<class T> ... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 95,911,863 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
int n;
cin>>n;
vector<int> d(n);
rep(i,n){
cin>>d[i];
}
long ans=0;
rep(i,n){
for(int k=i+1;k<n;k++){
ans=ans+(d[i]*d[k]);
}
}
cout<<ans<<endl;
... | 0 | 66,598,875 |
#include<bits/stdc++.h>
using namespace std;
#define MAX 35000
#define MOD 1000000007
#define PI 3.14159265359
#define makefast__ ios_base::sync_with_stdio(false);
using ll=long long int ;
using dl =double;
const int N = 2e5 + 10;
ll aarray[300000+10];
ll magic[101][101];
vector<ll>primes;
bool prime[1000001];
ll chk... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, nmin, nmax;
while( cin >> m >> nmin >> nmax, m || nmin || nmax ) {
vector<int>P( m );
for( size_t i = 0; i < m; i++ ) {
cin >> P[i];
}
int ans = 0;
... | 0 | 26,838,215 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <iostream>
using namespace std;
int main() {
long long k;
cin >> k;
long long a[50];
for (int i = 0; i < k % 50; i++) {
a[i] = k / 50 + 100 - k % 50;
}
for (int i = k % 50; i < 50; i++) {
a[i] = k / 50 + 49 - k % 50;
}
cout << 50 << '\n';
for (auto i : a) {
... | 0 | 69,677,265 |
#include<iostream>
int main(){
std::string s; std::cin >> s;
int diff=1e4;
for(int i=0; i<s.size()-2; ++i){
int num=std::stoi(s.substr(i,3));
num = std::abs(num-753);
diff = std::min(diff,num);
}
std::cout << diff << std::endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 65,352,669 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (long long i=0; i < (n); ++i)
#define rep2(i,n,m) for(long long i=n;i<=m;i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b)... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
vector<int> a(3);
for (int i = 0; i < 3; i++)
cin >> a.at(i);
if (a.at(0) != a.at(1))
cout << (a.at(0) == a.at(2) ? a.at(1) : a.at(0)) << endl;
else
cout << a.at(2) << endl;
} | 0 | 39,017,117 |
#include <iostream>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int a[5000], ans = -100001;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++){
int sum = 0;
for(int j = i; j < n; j++){
sum += a[j];
ans = max(ans, sum);
}
}
cout << ans << endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int n; cin >> n;
vector<int>b(n-1);
vector <int>a(n);
for(int i = 0; i < n-1; i++) cin >> b[i];
a[0] = b[0];
a[1] = b[0];
for(int i = 1; i < n-1; i++){
... | 0 | 16,175,796 |
#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>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
template <class T>
using Grid = vector<vector<T>>;
int main() {
ll N, K... | 0 | 40,854,907 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main() {
int x, y;
int F[50];
F[0] = F[1] = 1;
for ( int i = 2; i < 50; i++ ) F[i] = F[i-1] + F[i-2];
cin >> x;
cout << F[x] << endl;
return 0;
} | #include<cstdio>
using namespace std;
int main(void){
int heaps[250]={0};
int heap_size=0;
scanf("%d",&heap_size);
int i=0;
for(i=0;i<heap_size;i++){
scanf("%d",&(heaps[i]));
}
for(i=0;i<heap_size;i++){
printf("node\x0020%d:\x0020",i+1);
printf("key\x0020=\x0020%d,\x0020",heaps[i]);
if(i!=... | 0 | 5,673,650 |
#include<stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
if((a*b)%2==0)printf("Even\n");
else
printf("Odd\n");
} | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = 1e9;
const LL L... | 0 | 22,627,120 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<climits>
using namespace std;
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) for((... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n+1), b(n+1, 0);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
ll c;
for (ll i = n; i >= 1; i--) {
c = min(b[i],... | 0 | 27,555,546 |
#include <bits/stdc++.h>
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) {... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define ll ... | 0 | 90,677,581 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; string s; cin >> n >> s;
ll r_cnt = 0;
ll g_cnt = 0;
ll b_cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'R') r_cnt++;
if (s[i] == 'G') g_cnt++;
if (s[i] == 'B') b_cnt++;
}
ll tmp = 0;
for (int i = 0; i < n - 1; i+... | 0 | 92,458,641 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
void Input(int*,int*);
int Calc(int*,int*);
void Output(int*,int*,int*);
int main(int argc,char* argv[]){
int n,count=0;
int arr[100];
Input(&n,arr);
count=Calc(&n,arr);
Output(&n,&count,arr);
return 0;
}
void Input(int *pn,int *ar... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int>pii;
const int mod = 1e9+7;
long double PI = acosl(-1);
const ll infl = 3e18+100;
const int inf = 1e8+100;
const int nmax = 1e5+5;
const int MAXLG = log2(nmax)+1;
int main(){
ios::sync_with_stdio(false); ... | 0 | 68,172,535 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include<bits/stdc++.h>
using namespace std ;
typedef pair<int,int> pii ;
int a = 0 ;
int b = 0 ;
int n = 0 ;
int dp[16][16] = {1} ;
vector<pii> construct ;
int inf = pow(10,9) ;
int solve()
{
for ( int i = 0 ; i < 16 ; i++ )
{
for ( int j = 0 ; j < 16 ; j++ )
{
dp[i][j] = 0 ;
}
}
for ( int i ... | 0 | 97,117,361 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll x,y;
cin>>x>>y;
int ans=0;
if(x%y==0){
ans=-1;
}
ll n=1000000000000000000;
for(ll i=x;i<n;i+=x){
if(i%y==0){
;
}
else{
ans=i;
break;
}
if(ans){
break;
}
}
if(ans){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int q,h,s,d;
long long n;
cin >> q >> h >> s >> d >> n;
n=n*4;
map<int,int> price;
price[q*8]=1;
price[h*4]=2;
price[s*2]=4;
price[d]=8;
long long ans = 0;
for(auto p:price){
int cost = p.first;
int volu... | 0 | 4,866,833 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define F first
#define S second
#define Tsetso ios_base::sync_with_stdio(0) ; cin.tie(0) ;
using namespace std;
const ll N = 2e5+10, inf = 1e3+5, mod = 1e9+7, NN = 1e5+10;
int a;
int main()
{
Tsetso ;
int n, k ;
cin >> n >> k ;
map < i... | 0 | 17,747,403 |
#include<iostream>
#include<vector>
#define INF 1000000
using namespace std;
int main(){
int x, n;
cin >> x >> n;
vector<int> p(n);
int i, plus, minus;
for(i=0;i<n;i++){
cin >> p.at(i);
}
int ans=INF;
int count = 0;
while(1){
minus=INF;
plus=INF;
for(i... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
ll N, M; cin >> N >> M;
ll res = 0;
if (N * 2 <= M) {
res += N;
M -= 2 * N;
N = 0;
res += M/4;
} else {
res +... | 0 | 14,792,985 |
#include<iostream>
#include<string>
using namespace std;
int main(){
long long a=100000;
int n;
cin>>n;
for(int i=0;i<n;i++){
a*=1.05;
if(a%1000==0)
a-=1000;
a/=1000;
a*=1000;
a+=1000;
}
cout<<a<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
... | 0 | 24,155,343 |
#include <iostream>
using namespace std;
int main() {
while ( true ) {
int N, M, P;
cin >> N >> M >> P;
if ( N == 0 ) break;
int sum = 0, hit;
for ( int i = 1; i <= N; i++ ) {
int val;
cin >> val;
sum += val;
if ( i == M ) {
hit = val;
}
}
const int ans =... | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
usin... | 0 | 24,605,682 |
#include <bits/stdc++.h>
#define BPhuong ""
#define maxn 100005
#define maxm
#define fi(i,a,b) for(int i = a; i<= b; i++)
#define fid(i,a,b) for(int i = a; i>= b; i--)
#define se second
#define f first
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define bit(x, i) ((x>>i)&1)
#define oo 1e9
stru... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | 0 | 22,021,480 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b, c;
cin >> a >> b >> c;
if(*(a.end()-1) == *(b.begin()) && *(b.end()-1) == *(c.begin()))
printf("YES\n");
else printf("NO\n");
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | 0 | 37,681,510 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.e... | #include<iostream>
#include<string.h>
using namespace std;
long long sin[100001];
int main(){
while(1){
memset(sin,0,sizeof(sin));
int n,k;
int i,j,max=0,x;
cin>>n>>k;
if(n==0&&k==0)break;
for(i=0;i<n;i++){
cin>>sin[i];
}
for(i=0;i<n-k+1;i++){
x=0;
for(j=0;j<k;j++){
x+=sin[i+j];
}
if(max<x)max=x;... | 0 | 40,676,655 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string str, order, p, print_str;
int ordr_num, start, end;
cin >> str;
cin >> ordr_num;
for(int i=0;i<ordr_num;i++){
cin>>order;
if(order == "replace"){
cin >> start >> end >> p;
str.erase(start, end - start + 1);
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 0 | 82,438,316 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(v) v.begin(), v.end()
#define revall(v) v.rbegin(), v.rend()
constex... | #include "bits/stdc++.h"
#define rep(i,b) for(ll i=0;i<b;i++)
#define ll long long
using namespace std;
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvvl vector<vector<vector<ll>>>
#define debug(x) cerr<<#x<<" "<<x<<'\n';
bool cmp(pair<ll,ll> a, pair<ll,ll> b) { return a.second > b.second; }
ll mod = 1e... | 0 | 23,604,416 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 5,196,659 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = a[1] - a[0];
for (int i = 0; i < n - 1... | #include <bits/stdc++.h>
using namespace std;
void debug() {cout<<endl;}
template<typename T,typename... Args>
void debug(T x,Args... args) {cout<<x<<" ";debug(args...);}
#define forn(i,a,b) for(int i=a;i<b;++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef ... | 0 | 36,907,588 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int n,m;
cin>>n>>m;
int a[m],total=0;
rep(i,m){
cin>>a[i];
total+=a[i];
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define PI 3.1415926535
int main(void)
{
ll q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
n *= 4;
ll DP[9] = {};
DP[0] = 0;
DP[1] = ... | 0 | 48,730,190 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll ans;
ll mi = 1e18;
int main() {
cin >> n;
bool f = 1;
for (int i = 0; i < n; i++) {
ll a,b;
cin >> a >> b;
ans += a;
if (a != b) f = 0;
if (a > b) mi = min(mi, b);
}
if (f) {
... | 0 | 38,474,524 |
#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;
typedef long long ll;
typedef double db;
typedef vector <ll> vll;
typedef pair <ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 10... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define vii vector<int>
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pdd pair<double,double>
#define pldld pair<long long double, long long double>
#define ff first
#define ss second
#define pb pu... | 0 | 63,750,380 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <iostream>
#include <vector>
int main(){
using namespace std;
int h,w,i,j,k;
vector<int> v;
h = 1;
w = 1;
while(h!=0||w!=0){
cin >> h >> w;
if(h==0&&w==0){
break;
}
v.push_back(h);
v.push_back(w);
}
int size = v.size();
for... | 0 | 59,326,769 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
using namespace std;
int main(void) {
int n;
map<char, char> m;
while ... | 0 | 99,685,884 |
#include <stdio.h>
int main(void){
int a,b,d,r;
double f;
scanf("%d %d\n", &a, &b);
d = a/b;
r = a%b;
f = 1.0 * a/b ;
printf("%d ",d);
printf("%d ",r);
printf("%.8lf\n",f);
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int N, D, A;
cin >> N >> D >> A;
int X[N], H[N];
P p[N];
for(int i=0; i<N; i++){
int a, b;
... | 0 | 7,254,502 |
#include <bits/stdc++.h>
#define INF 1000000001
using namespace std;
int main()
{
int n;
cin.sync_with_stdio(false);
cin >> n;
vector<int> dp(n + 1, INF);
for (int i = 0, a; i < n; i++) {
cin >> a;
*lower_bound(dp.begin(), dp.end(), a) = a;
}
cout << lower_bound(dp.begin(), dp.end(), INF) - dp.begin() << end... | #include<iostream>
#include<algorithm>
#include<numeric>
int const num[9] = {1, 7, 4, 5, 3, 2, 9, 6, 8};
int const cnt[9] = {2, 3, 4, 5, 5, 5, 6, 6, 7};
int const MAXN = 10000;
int n[6], c[6], M, N;
bool use[6];
int count[6], ctmp[6], ix[6], maxv;
void search(int nn, int m) {
if(m == M && nn > 0) return;
if(nn > 0)... | 0 | 15,421,563 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int a[5];
for(int i= 0;i<5;i++) cin >>a[i];
int sai = 10;
int soko = 0;
for(int i= 0;i<5;i++){
if(a[i]%10 == 0)continue;
if(a[i]%10 <= sai){
sai = a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
A[i] -= i;
}
sort(A.begin(), A.end());
ll x = A[N/2];
ll ans = 0;
for ... | 0 | 8,327,652 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int> d(n);
rep(i,k){
int m;
cin >> m;
rep(j,m){
int a;
cin >> a;
d[a-1] = 1;
}
}
int ans = 0;
rep(i,n)if(d[i] == 0)ans++;
cout << ans << endl;
return 0;
} | const int isDebugMode = 0;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0,... | 0 | 28,824,569 |
#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n) n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[20000... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int ii = 0; ii < 10; ++ii){
for (int jj = 0; jj < 10; ++jj){
for (int kk = 0; kk < 10; ++kk){
vector <int> v;... | 0 | 77,965,772 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <string>
#include <math.h>
#define ll long long
#define vl vector<ll>
#define vvl vector<vector<ll> >
#define vvvl vector<vector<vector<ll> > >
#define vd vector<double>
#define vvd vector<vector<double> >
#define vvvd vector<vector<... | #include <stdio.h>
#define mod 1000000007
typedef long long ll;
int main(void) {
ll i, j, n, ans = 1;
scanf("%lld", &n);
ll t[n], a[n];
bool bt[n], ba[n];
for(i = 0; i < n; ++i) scanf("%lld", &t[i]), bt[i] = false;
for(i = 0; i < n; ++i) scanf("%lld", &a[i]), ba[i] = false;
bt[0] = ba[n - 1] = true;
for... | 0 | 36,203,686 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
int N;
cin>>N;
int h[N];
rep(i, N) cin>>h[i];
int max = h[0];
int min = h[0];
int count = 0;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> h(n+1);
rep(i,n) cin >> h[i+1];
vector<int> dp(n+1,0);
for(int i = 1; i <= n; i++){
if(i==1){
dp[i] = 0;
continue... | 0 | 24,186,997 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
int main() {
int N; cin >> N;
vector<int> v;
... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,... | 0 | 22,557,463 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << max(max(a,b),c)*10 + a + b + c - max(max(a,b),c) << endl;
return 0;
} | #include <cstdio>
#define MAX 10
int* sort(int* array);
int main(){
int array[MAX];
for(int i = 0; i < MAX; i++){
array[i] = 0;
scanf("%d", &array[i]);
}
sort(array);
for(int i = MAX - 1; i > 6; i--){
printf("%d\n", array[i]);
}
return 0;
}
int* sort(int* array){
int temp = 0;
for(int i = 0; i < MA... | 0 | 90,274,964 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
typedef long long ll;
const int INF = 1e+9+7;
const int H_MAX = 510;
const int W_MAX = 510;
int H,W;
vector<vector<int>> a(H_MAX,vector<int>(W_MAX,0));
int main(){
string ... | #include <iostream>
#include <vector>
#include <set>
#include <string>
#include <algorithm>
#include <queue>
#include <utility>
#include <climits>
#include <bitset>
#include <cmath>
#include <map>
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef ve... | 0 | 61,539,483 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define pdi pair<db,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define eps 1e-8
#define mo 974711
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef dou... | #include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define sz(x) ((int)(x).size())
using namespace std;
using ll = long long;
using pp = pair<int, int>;
const int INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = ... | 0 | 59,548,573 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve(void)
{
string o, e;
cin >> o >> e;
string ans = "";
rep(i, o.length())
{
ans += o[i];
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int cntDivisor(int x) {
int ret = 0;
for (int i = 1; i * i <= x; i++) {
if (x ... | 0 | 39,855,247 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#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>
#includ... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
string ans = "NO";
int a, b, c;
cin >> a >> b >> c;
for (int i = i; i <= b; ++i)
{
int t = a * i;
if (t % b == c)
... | 0 | 71,122,707 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n;
ll a[200000], ans = (1L << 62), X, x;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%ld", &a[i]);
X += a[i];
}
for (int i = 0; i < n - 1; i++) {
x += a[i];
ans = min(ans, abs(X - x - ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
map<ll, ll>a;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
if (a.count(x))a.at(x)++;
else a[x] = 1;
}
ll ans = 0;
for (auto b : a) {
if (b.first < b.second)ans += b.second - b.first;
else if (b.first > b... | 0 | 47,843,327 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int H, W;
cin >> H >> W;
vector<string> C(H);
for (int i = 0; i < H; ++i) {
cin >> C.at(i);
}
for (int i = 1; i <= H * 2; ++i) {
cout << C.at(((i + 1) / 2) - 1) << endl;
}
return 0;
} | #include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
long long a,b,n;
int main()
{
scanf("%lld%lld%lld",&n,&a,&b);
if(a*b<n||a+b-1>n){printf("-1\n");return 0;}
while(n>0)
{
long long x=min(a,n-b+1);
for(long long i=1;i<=x;i++)
printf("%d ",n-x+i);
... | 0 | 16,606,346 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int>vec(N);
for(int i=0;i<N;i++){
cin >>vec.at(i);
}
int count=0;
for(int i=0;i<N;i++){
if(vec.at(vec.at(i)-1)==i+1){
count++;
}
}
cout<<count/2<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
template<class T> bool chmin(T &a, T b){
if(a>b) {
a = b;
return true;
}
return false;
}
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
... | 0 | 19,063,751 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
int n;
string s[10010];
int a[100... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr first
#define sec second
#define rep(i,n) for(i=0;i<n;i++)
#define vi vector <int>
#define vc vector <char>
#define vl vector <ll>
#define vb vector <bool>
#define pb push_back
#define M 1000000007
#define... | 0 | 20,968,511 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n),n){
int stage[100000] = {0};
for(int i = 1;i <= n; i++){
scanf("%d",&stage[i]);
}
int x = 0;
int ans = -1000000;
for(int i = 1;i <= n; i++){
f... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 46,600,911 |
#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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, yy;
cin >> n >> yy;
yy /= 1000;
int x = -1, y = -1,... | 0 | 54,399,424 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 100000000000
const int MOD = 1e9+7;
const double PI = 3.141592653589793238462... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 55,861,099 |
#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
string s, t; cin >> s >> t;
int S; S = s.size();
string T;T= t.erase(S);
if (s == T) { cout << "Yes" << endl; }
else { cout << "No" << endl; }
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | 0 | 26,191,625 |
#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 L;
cin >> L;
double V = pow(L / 3.0, 3.0);
cout << fixed << setprecision(8) << V << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> H(N);
for (int i = 0; i < N; ++i) cin >> H[i];
int cnt = 0;
int tmp_cnt = 0;
for (int i = 1; i < N; ++i) {
if (H[i - 1] >= H[i]) {
tmp_cnt++;
... | 0 | 25,950,578 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
ty... | 0 | 16,975,699 |
#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()
{
vector<int> a(5);
rep(i, 5) cin >> a[i];
int mx = 0, ans = 0;
rep(i, 5)
{
ans += a[i];
int x = a[i] % 10;
if (x == 0)
... | #include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
#define pb push_back
#define mp make_pair
#define F .first
#define S .second
using ll=long long;
using ld=long double;
using namespace std;
const ll mod=1e9+7;
int main(){
ll n,tmp=0,c=0,c2=0,x1... | 0 | 86,980,744 |
#include<iostream>
#include<string>
using namespace std;
int main(){
long long a,b;
string s,s2;
cin >> s;
while(s.size() > 1){
s = s.erase(s.size() - 1);
if(s.substr(0, s.size() / 2) == s.substr(s.size() / 2)){
break;
}
}
cout << s.size() << endl;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | 0 | 43,920,691 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int heap[n + 1];
for (int i = 1; i <= n; i++) {
cin >> heap[i];
}
for (int i = 1; i <= n; i++) {
cout << "node " << i << ": key = " << heap[i] << ", ";
if (i != 1) {
cout << "parent key = " << heap[i / 2] << ", ";
}
if (i * 2 <= n... | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | 0 | 11,198,919 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> ai;
int res = 0;
for(int i = 0; i < N; i++) {
int temp;
cin >> temp;
ai.push_back(temp);
}
for(int i = 0; i < N; i++) {
if(ai[i] > 0 && (i + 1) == ai[ai[i] - 1]) {
ai[ai[i] - 1] = -1;... | #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(){
ll n,c,k;
cin >> n >> c >> k;
priority_queue<ll,vector<ll>,greater<ll>> q... | 0 | 28,190,827 |
#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,sse")
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c... | #include <bits/stdc++.h>
#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition)... | 0 | 61,790,656 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
const int MAX=1000010;
ll fac[MAX],finv[MAX],inv[MAX];
void COMinit(){
fac[0]=fac[1]=1;
... | 0 | 12,292,488 |
#include<iostream>
#include<string>
#include<vector>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
ll n, y;
cin >> n >> y;
rep(i, n+1){
... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <utility>
#include <map>
int needleX[4] = { -1,0,1,0 };
int needleY[4] = { 0,1,0,-1 };
int main(void) {
int n;
std::cin >> n;
std::vector<int> p(100+1);
... | 0 | 66,404,747 |
#include <stdio.h>
int main ()
{
int K,A,B;
scanf("%d%d%d",&K,&A,&B);
if((B/K)*K<A){
printf("NG\n");
}
else{
printf("OK\n");
}
return 0;
} | #include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, std::vector<long double> x, std::vector<std::string> u){
long double ans = 0.0;
REP(i, N) {
if (u[i] == "JPY") ans += x[i];
else ans += x[i] * 380000.0;
}
pr... | 0 | 3,867,384 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int diff = 1000;
for(int i=0; i<s.size()-2; i++) {
int x;
x = (int)(s[i]-'0')*100+(int)(s[i+1]-'0')*10+(int)(s[i+2]-'0');
diff = min(diff, abs(x-753));
}
cout << diff << endl;
return 0;
} | #include <iostream>
using namespace std;
#define MAX_N (1000000)
bool is_prime[MAX_N];
int sum[MAX_N + 1];
int main()
{
int n;
for (int i = 0; i < MAX_N; i++){
is_prime[i] = true;
}
is_prime[0] = false;
is_prime[1] = false;
for (int i = 4; i < MAX_N; i += 2){
is_prime[i] = false;... | 0 | 42,683,447 |
#include <iostream>
#include <climits>
#define MAX 101
#define INF LLONG_MAX
using namespace std;
long long m[MAX][MAX];
long long p[MAX];
int main(){
int n; cin >> n;
cin >> p[0];
for(int i=1;i<=n-1;i++){
cin >> p[i];
int x; cin >> x;
}
cin >> p[n];
for(int i=1;i<=n;i++) m[i][i]=0;
for(int l=2;l<... | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) ... | 0 | 62,149,720 |
#include<iostream>
#include<string>
int main () {
int n;
std::cin >> n;
std::string s, t;
std::cin >> s >> t;
std::string ans = "";
for (int i = 0; i < n; i++) {
ans += s[i];
ans += t[i];
}
std::cout << ans << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define SZ(c) ((int)(c).size())
#define debug(x) cerr << #x << " = " << (x) << '... | 0 | 65,994,573 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll N, X, T;
scanf("%lld %lld %lld... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <cmath>
#include <complex>
#include <cassert>
#define rep(i, x) for (int i = 0; i < (x); ++i)
#def... | 0 | 6,933,201 |
#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;
cout << n-k+1 << endl;
return 0;
} | #include <sstream>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int selection_sort(vector<int> &list) {
int count = 0;
for (int i = 0; i < list.size(); ++i) {
int mini = i;
for (int j = i + 1; j < list.size(); ++j) {
if (list[j] < list[mini]) {
mini = j;
}... | 0 | 44,206,038 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
ll A[200005], S[200005];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> A[i];
A[i]--;
S[i + 1] = (S[i] + A[i] + k) % k;
}
ll ans = 0;
map<int, int> mp;
for(int i = 0; i <= n; i... | #include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abc... | 0 | 77,596,306 |
#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 x,a;
cin >> x >> a;
if(x<a) cout << 0 << endl;
else if(x>=a) cout << 10 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
while(getline(cin, s)) {
if(s == ".") break;
vector<int> v(2);
vector<int> tmp[2];
bool f = true;
for(auto& c: s) {
if(c == '(') {
v[0]++;
tmp[0].push_back(v[1]);
}
if(c == ')') {
if(v[0] == 0 || tmp[0].back() != v[1]) ... | 0 | 35,681,527 |
#include <iostream>
#include <map>
#include <unordered_map>
#include <set>
#include <utility>
#include <stack>
#include <cstdio>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <iterator>
#include <sstream>
#define popcount(x) __builtin_popcount(x)
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include<limits.h>
#include<iomanip>
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, m, n) for(int i = m; i < n; i++)
#define ALL(v) v.begin(),v.end()
#define RALL(v) ... | 0 | 71,860,620 |
#include <cstdio>
#include <iostream>
#include <set>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define fi first
#define se second
using namespace std;
inline char nc()
{
static char buf[100000],*l=buf,*r=buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T ... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 87,852,741 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define int long long
using P = pair<int,int>;
signed main(){
int n;cin>> n;
int h[n];
rep(i,n)cin >> h[i];
int ans = 0;
int nh = 1;
rep(d,100){
int f = 0;
rep(i,n){
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,ans=0;
cin>>a>>b>>c>>k;
if(a<=k)
{
ans=a;
k-=a;
}
else
{
ans=k;
k=0;
}
if(b<=k)
k-=b;
else
k=0;
cout<<ans-k<<endl;
} | 0 | 19,025,040 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string O, E;
cin >> O >> E;
int len = O.size();
string S;
for (int i = 0; i < len; i++) {
S += O.at(i);
if (i < E.size()) S += E.at(i);
}
cout << S << endl;
} | #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()
typedef pair<int,int> P;
#define INF 10000000
int main()
{
int h,w;cin>>h>>w;
vector<vector<char>> a(h,vector<char>(w));
int i,j;
rep(i,h)rep(j,w)cin>>a[i][j];
vector<vector<in... | 0 | 34,824,662 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.