code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
void solve()
{
int n;
cin>>n;
string a,b;
cin>>a>>b;
for(int i=0;i<n;i++){
cout<<a[i]<<b[i];
}
cout<<endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
solve();
retu... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int> > vec(N,vector<int>(2));
for(int i=0; i<N; i++){
vec[i] = {1,1000000000};
}
int tmp=0;
for(int i=0; i<N; i++){
int T;
cin >> T;
if (... | 0 | 7,231,687 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
static const double EPS = 1e-9;
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
int main(void){
vector<int> count;
... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | 0 | 25,271,266 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
const int N = 1e4 + 10;
ll a[N], b[N];
int main() {
#ifdef LOCAL_EXEC
#else
ios_base::sync_with_stdio(false); cin.tie(NULL);
#endif
int n; cin >> n;
ll sa = 0;
for (int i = 0; i < n; i++) {
... | 0 | 82,264,759 |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
void solve()
{
string s;
int k;
cin >> k >> s;
cout << s.substr(0, k);
if(s.length()>k)
{
cout << "...";
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll t;
solve();
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | 0 | 4,862,592 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
for (a=0; a<10000; a++ ){
cin >> b >> c;
if ( b == 0&&c == 0) break;
else {
if ( b<=c ){cout<< b << " " << c << endl;}
else {
cout<< c << " " << b << endl;
}
}
}
return 0;
} | #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, a, b;
cin >> n >> a >> b;
if (a > b){
puts("0");
return 0;
}
if (n == 1 && a != b){
puts("0");
return 0;
}
if (a == b){
... | 0 | 60,166,323 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long w, h, x, y;
cin >> w >> h >> x >> y;
printf("%.08Lf ", (long double)w*h/2.0);
if (2*x == w && 2*y == h)
printf("1\n");
else
printf("0\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long l... | 0 | 38,564,622 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
in... | #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, k;
cin >> n >> k;
vector<int> a(n);
for (int& i : a) cin >> i, --i;
vector<int> s(n + 1, 0);
for (int i = 1; i <= n; ++i) (s[i] += s[... | 0 | 31,778,510 |
#include <iostream>
int main(){
long long H, W;
std::cin >> H >> W;
long long ans = H*W;
for(long long i=1; i<H; ++i){
long long S0 = W * i;
long long S1 = W/2 * (H-i);
long long S2 = (W-W/2) * (H-i);
long long max = std::max(S0,std::max(S1,S2));
long long min = std::min(S0,std... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_map>
#include<climits>
#include<cstdlib>
#include<cmath>
#include<string>
#include<iomanip>
#include<bitset>
using namespace std;
#define ll long long int
ll const ... | 0 | 30,575,676 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int k0=0,k1=0;
for(char c:S){
if(c=='0')
k0++;
else
k1++;
}
cout<<min(k0,k1)*2<<endl;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define REP(i, m, n) for(... | 0 | 74,611,476 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
string a, b, c;
cin >> a >> b >> c;
if(a.back() == b.front()){
if(b.back() == c.front()) cout << "YES" << endl;
... | #include<bits/stdc++.h>
using namespace std;
map<string,int> mp;
int main(){
int maxcnt=0;
string str,maxs="";
while(cin>>str){
if(maxs.size()<=str.size())maxs=str;
for(int i=0;i<str.size();i++){
if(str[i]>='A' && str[i]<='Z'){
str[i]+='a'-'A';
}
}
mp[str]++;
if(maxcnt<mp[str])ma... | 0 | 20,611,848 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int a[3];
rep(i, 3) scanf("%d", &a[i]);
sort(a, a + 3);
printf("%d\n", a[1] - a[0] + a[2] - a[1]);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define PI acos(-1)
int main(){
string s,t;
cin >> s >> t;
vector<vector<int>> alfs(26),alft(26);
for(int i = 0;i < (int)s.size();i++){
alfs[s[i] - 'a'].push_back(i);
alft[t[i] - 'a'].push_back(i);
}
for(int i = ... | 0 | 47,210,709 |
#include <bits/stdc++.h>
int n;
int s[128];
int main() {
for(;;) {
scanf("%d", &n);
if( n == 0 ) break;
for(int i = 0; i < n; ++i) {
scanf("%d", &s[i]);
}
std::sort(s, s + n);
int total = 0;
for(int i = 1; i < (n - 1); ++i) {
total += s[i];
}
total /= (n - 2);
print... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 10,709,745 |
#include <iostream>
unsigned long long fact(unsigned long long n)
{
if (n <= 1) return 1;
else return n * fact(n - 1);
}
int main()
{
unsigned long long n;
std::cin >> n;
std::cout << fact(n) << std::endl;
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 45,388,810 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
map<string, int> dict;
int n;
cin >> n;
string cmd, word;
for(int i = 0; i < n; i++){
cin >> cmd >> word;
if(cmd == "insert")
dict[word.c_str()] = 1;
else if(cmd == "find"){
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<string> s( H );
for( int i = 0; i < H; i++ ) {
cin >> s[i];
}
int dy[4] = { 1, -1, 0, 0 };
int dx[4] = { 0, 0, 1, -1 };
string ans = "Yes";
for( int y = 0; y < H; y++ ) {
for( int x = 0; x < W; x++ ) {
if( s[y][x]... | 0 | 59,355,871 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i= (a); i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() { char x, y;
cin >> x >> y;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
vector<pair<int, int>> v;
for(int i = 2; i <= n; i++){
bool sosu = true;
for(int j = 0; j < v.size(); j++){
int x = v[j].first, y = i;
while(y % x == ... | 0 | 48,315,411 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll>P;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
#include <atcoder/dsu>
using namespace atcoder;
int main(){
int n,q;cin>>n>>q;
dsu uf(n);
rep(i,q){
... | #include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
const ... | 0 | 73,172,544 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int inf =1000000000;
int main() {
int n;
ll c, k;
cin >> n >> c >> k;
vector<ll> t(n);
rep(i, n) cin >> t[i];
sort(t.begin(), t.end());
vector<int> bus;
int l = 0;
boo... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
... | 0 | 46,030,471 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++){
cin >> data.at(i).at(j);
}
}
for (int i = 0; i < data.size(); i++) {
for (int j = 0; j < W; j++){
... | #include <bitset>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <stdio.h>
#include <math.h>
#include <bits/stdc++.h>
using namespace... | 0 | 18,940,075 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>; ... | 0 | 29,022,053 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int D;
cin >> D;
cout << "Christmas";
for(int i = 25; i > D; i--) {
cout << " Eve";
}
cout << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 100005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 98,286,522 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
int a, b, c, m;
scanf("%d %d %d", &a, &b, &c);
m = max(a,max(b, c));
if(m==a)
{
printf("%d",(a*10)+b+c);
}
else if(m==b)
{
printf("%d", (b*10)+a+c);
}
else if(m==c)
{
... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 22,401,917 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
... | #include <bits/stdc++.h>
using namespace std;
#define sci1(a) scanf("%d",&a)
#define sci2(a,b) scanf("%d %d",&a,&b)
#define sci3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define scs(s) scanf("%s",s)
#ifndef GET_MACRO
#define GET_MACRO(__1,__2,__3,NAME,...) NAME
#endif
#define sci(...) GET_MACRO(__VA_ARGS__,sci3,sci2,sci1)(__... | 0 | 73,701,384 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
int main(){
int n,k; cin >> n >> k;
vector<ll> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
ll ans=1e18;
for(int i=0;i<(1<<n);i++){
if(__builtin_popcount(i)>=k){
ll... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 22,405,247 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s;
cin >> s;
ll l = s.size(), ans = 0, b = 0;
for(int i = 0; i < l; i++){
if(s[i] == 'B') b++;
else... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
#define setbits(x) __builtin_popcountll(x)
#define mod 1000000007
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) int x; cin>>x; while(x-... | 0 | 72,068,611 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void) {
int n;
int temp;
int divmin;
vector<int> a;
while (true) {
scanf("%d", &n);
if (n == 0) { break; }
divmin = 1000000;
for (int i = 0; i <= n-1; i++) {
cin >> temp;
a.push_back(temp);
... | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;
const int maxn=1e5+10;
const int mod=1e9+7;
ll x[maxn],y[maxn];
ll n,m;
int main()
{
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++)
scanf("%lld",&x[i]);
for(int i=1;i<=m;i++)
s... | 0 | 80,877,831 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define vv(T) vector<vector<T>>
#define coa cout << ans << endl; return 0;
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | 0 | 1,510,807 |
#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 ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
int const INF = 1 << 30... | 0 | 79,936,481 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 10000000... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 46,700,029 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int,null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set_pair tree<pair<int,int>,null_type,less<pair<int... | 0 | 65,462,972 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int I... | #include <bits/stdc++.h>
using namespace std;
#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;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 71,458,273 |
#include <bits/stdc++.h>
using namespace std;
int findSet(vector<int>& a, int i) {
if (a[i] < 0) return i;
return a[i] = findSet(a, a[i]);
}
void mergeSets(vector<int>& a, int i, int j) {
int x = findSet(a, i);
int y = findSet(a, j);
if (x == y) {
return;
}
if (a[x] > a[y]) {
int t = x;
x = y;... | #include <bits/stdc++.h>
using namespace std;
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff ... | 0 | 98,835,301 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#defin... | #include<stdio.h>
int main(){
int a, b;
scanf("%d %d", &a, &b);
int result = 1;
for(int i = 0; i < a; i++){
if(result < b)
{
result = result * 2;
}
else
{
result = result + b;
}
}
printf("%d\n", result);
return 0;
} | 0 | 29,346,860 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
const ll INF = 1LL<<60;
const ll MOD = 1e9+7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,K;cin>>n>>K;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n;
ll k;
cin>>n>>k;
vector<pair<ll,ll>> v(n);
rep(i,n) cin>>v[i].first>>v[i].second;
sort(v.begin(),v.end());
... | 0 | 64,950,256 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | #include <bits/stdc++.h>
#define arep(a,i,n) for(int i=(a);i<(n);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define cinf(x,n) for(int i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(int i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
c... | 0 | 45,470,868 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include<bits/stdc++.h>
using namespace std;
bool isPairwise = true;
unordered_map<long long int, long long int> m;
void factors(int a) {
if(isPairwise == false) {
return;
} else {
if(m[a] && a != 1) {
isPairwise = false;
return;
} else {
m[a] = 1;
... | 0 | 21,682,390 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
map<int, int> a;
REP(i, n) {
int tmp;
cin >> tmp;
a[tmp]++;
}
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
void bfs(vector<vector<int>> &G, vector<int> &dist, vector<int> &prev, int start) {
dist[start] = 0;
queue<int> q;
q.push(start);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int next_v : G[v]) {
if (dist[next_v] ... | 0 | 100,606,893 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
vector<ll> A(N... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
int H, W;
int func2(vector<vector<bool>> &a, vector<vector<bool>> &v)
{
int r[H][W] = {};
int ans;
queue<pair<int, int>> q;
rep(i... | 0 | 39,530,913 |
#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,... | #define rep(i,n) for (int i=0;i<n;i++)
#include <vector>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
string s;
cin >> s;
int n=(int)s.size()+1;
vector <unsigned long long> t;
vector <unsigned long long> l;
int tmp=1;
rep(i,n-2){
if(s.at(i)==s.at(i+1)){
tmp++... | 0 | 50,443,608 |
#include <stdio.h>
int main(void)
{
int N, K;
scanf("%d", &N); scanf("%d", &K);
printf("%d", N - K + 1);
return 0;
} | #include <iostream>
using namespace std;
string s = "qwertasdfgzxcvb";
int main() {
string str;
while ( cin >> str, str != "#" ) {
if (str.size() == 0) cout << 0 << endl;
else {
int ans = 0;
bool prev = false;
for (int i = 0; i < str.size(); ++i) {
if ((s.find(str[i], 0) != -1) ^ prev) {
if (i) ... | 0 | 4,512,863 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i=0; i<(n); ++i)
int p[10001];
int main(void){
int m, n_min, n_max;
while(cin >> m >> n_min >> n_max && m) {
rep(i, m) cin >> p[i];
sort(p, p+m, greater<int>());
int gap = 0;
int ans = 0... | #include<bits/stdc++.h>
#define int long long
#define re(i,n) for(i=0;i<n;i++)
#define bre(i,n) for(i=n;i>0;i--)
#define rep(i,l,r) for(i=l;i<r;i++)
#define brep(i,l,r) for(i=r;i>l;i--)
const int inf=1145141919810893;
const int mod=998244353;
using namespace std;
template<class T>bool chmin(T &a,const T &b){
if(a>b){
... | 0 | 82,754,975 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
typedef double DOUBLE;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REP... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a;
int b;
int c;
cin >> a >> b >> c;
for (int i = 1; i < 10001; i++){
if ((a*i)%b == c){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
} | 0 | 74,880,434 |
#include <bits/stdc++.h>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
#define PI 3.14159265358979
const int INF = 1 << 29;
const int64_t MOD = 1000000007;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<clas... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
int ansN=0,anslis[30000][2]={0};
int topa=0;
if(((N-1)*(N-2))/2<K){
puts("-1");
return 0;
}
else{
for(int i=1;i<=N;i++){
... | 0 | 62,055,600 |
#include <iostream>
int mcxi2int(std::string s) {
int ret = 0;
int tmp = 1;
for (int i = 0; i < s.size(); i++) {
switch (s[i]) {
default: {
tmp = s[i] - '0';
break;
}
case 'm': { ret += tmp * 1000, tmp = 1; break; }
case 'c': { ret += tmp * 100, tmp = 1; break; }
case 'x': { ret += tmp * 10,... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
using namespace std;
typedef long lo... | 0 | 44,811,397 |
#include <iostream>
#include <vector>
class Point{
private :
int x;
int y;
int path;
bool roadWork;
public :
Point() : x(), y(), path(), roadWork() {}
void setX(int i) { x = i; }
void setY(int i) { y = i; }
void setPath(int i) { path = i; }
void setRoadWork(bool b) { roadWork = b; }
int getX() { return... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
int main(){
ll n,m,x,y;
cin>>n>>m>>x>>y;
ll a_max=-101;
ll b_min=101;
ll tmp;
rep(i,n){
cin>>tmp;
a_max=std::max(a_max, tmp);
}
rep(i,m)... | 0 | 54,299,484 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 25,110,473 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll MEMO[2001][2001][4];
int main() {
ll H, W;
cin >> H... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
int main()
{
long long N, X;
cin >> N >> ... | 0 | 77,843,440 |
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for... | #include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
int main() {
ll n; cin >> n;
map<ll,ll> mp;
set<ll> st;
ll ans = 0;
rep(i,n){
ll tmp; cin >> tmp;
st.insert... | 0 | 3,657,833 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | 0 | 78,815,393 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<cmath>
#include<numeric>
#include<iomanip>
#include<functional>
#include<cstdlib>
#include<queue>
#include<deque>
const double PI = acos(-1);
#define rep(i,n)for(int i=0;i<(n);i++)
using n... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll p=3;
ll happy(ll n,ll h[][3])
{
ll t[n][3];
for(int j=0;j<3;j++)
{
t[0][j]=h[0][j];
}
for(int i=1;i<n;i++)
{
for(int j=0;j<3;j++)
{
t[i][j]=h[i][j]+ max(t[i-1][(j+1)%p], t[i-1][(j+2)%p] );
... | 0 | 94,249,723 |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<tuple>
#include<bitset>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
string s;
ll k;
cin >> s >> k;
ll index ... | #include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#includ... | 0 | 19,412,658 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#include <iomanip>
int main(){
int t, x;
std::cin >> t >> x;
std::cout << std::fixed << std::setprecision(15) << (double)t / x << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
int K;
cin >> K;
ll a[N];
ll R[N+1];
R[0] = 0;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
R[i+1] = R[i] ... | 0 | 11,568,937 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
size_t sz = s.size() / 2;
string s2(sz, '0');
if (s.size() % 2 != 0)
s2 = s2 + '0';
size_t j = 0;
for (size_t i=0; i<s.size(); ++i) {
if ((i + 1) % 2 != 0) {
s2[j] = s[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9+7
int n;
ll dp[102][102];
ll p[102];
void init(){
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++){
dp[i][j]=inf;
}
dp[i][i]=0;
}
}
void cal(int l, int r){
if(l>=r)return;
if(dp[l][r]<inf)... | 0 | 86,998,688 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define bug cout << "ok" << endl
const ll INF = 1e9 + 5, N = 2e5 + 5, mod = 1e9 + 7, M = 1e5 + 5;
int p[N], sz[N];
void make_set(int v){
p[v] = v;
sz[v] = 1;
}
i... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | 0 | 38,734,508 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#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 all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int ... | 0 | 42,350,846 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string a, b;
cin >> a;
cin >> b;
if (a.size() > b.size()) {
cout << "GREATER";
}
else if (a.size() < b.size()) {
cout << "LESS";
}
else if (a.size() == b.size()) {
if (a > b) {
cout << "GREATER";
}
else if (a < b) {
cout << "L... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> fri(A);
vector<int> mic(B);
for (int i = 0; i < A; i++) {
cin >> fri.at(i);
}
for (int i = 0; i < B; i++... | 0 | 68,688,508 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n,k,x,y,a=0,b=0,c=0;
cin>>n>>k>>x>>y;
if(n<=k)
{
c=n*x;
}
if(n>k)
{
a=x*k;
b=(n-k)*y;
c=a+b;
}
cout<<c;
return 0;
} | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vect... | 0 | 84,746,741 |
#include <iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
using namespace std;
int main(void){
int n,k;
cin>>n>>k;
int ans=1;
while(n--){
ans= min(ans*2, ans+k);
}
cout<<ans;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 56,355,514 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=1000000007;
#define INF (1<<30)
#define LINF (lint)(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define INF 1000000000
#define MOD 1000000007
void solve() {
string s;
ll n, ans;
cin >> n >> s;
vi r, g;
for (int i = 0; i < n; ++i) {
if (s[i] == '... | 0 | 70,376,545 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string x;
cin>>x;
int a,b,c;
a=0;b=0;c=0;
for(int i=0;i<3;i++){
if(x[i]=='a'){
a+=1;
}else if(x[i]=='b'){
b+=1;
}else if(x[i]=='c'){
c+=1;
}
}
if(a==1&&b==1&&c==1){
cout<<"Yes";
}else{
cout<<"No";
}
} | #include<bits/stdc++.h>
#define sc(x) scanf("%d",&x)
#define sc2(x,y) scanf("%d%d",&x,&y)
#define scs(x) scanf("%s",x)
#define pr(x) printf("%d",x)
#define prn(x) printf("%d\n",x)
#define memc(x,y) memcpy(&x,&y,sizeof(x))
#define mems(x,y) memset(x,y,sizeof(x))
#define fli() freopen("in.txt","r",stdin)
#define flo() fr... | 0 | 98,884,753 |
#include <iostream>
#include <stack>
#define REP(i,n) for(int i = 1; i < n; i++)
using namespace std;
int main() {
REP(i,10){
REP(j,10){
cout << i << "x" << j << "=" << i*j << endl;
}
}
} | #include<bits/stdc++.h>
using namespace std;
int main() {
while (true)
{
int n; cin >> n;
if(n == 0) break;
vector<int> train(86410, 0);
for (int i = 0; i < n; i++)
{
string ss, se; cin >> ss >> se;
int sh = (ss[0] - '0') * 10 + ss[1] - '0';
... | 0 | 60,405,111 |
#include <bits/stdc++.h>
using namespace std;
long double t, x;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> t >> x;
long double ans = t / x;
cout << fixed << setprecision(10) << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 0 | 41,430,001 |
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define eb emplace_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using name... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,d,x; cin >> n >> d >> x;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int sum=x;
for(int i = 0; i < n; i++) {
for(int j = 1; j < d+1; j+=a[i]) {
sum+=1;
}
}
cout << sum <<... | 0 | 74,166,637 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | #include <bits/stdc++.h>
#define pb push_back
#define pi pair<int, int>
#define l first
#define r second
#define all(x) x.begin(), x.end()
#define fori(a, b, step) for (int i = a; i < b; i += step)
#define forj(a, b, step) for (int j = a; j < b; j += step)
const int maxn = 5e5 + 1, CC = 10001;
using namespace std;
shor... | 0 | 44,562,310 |
#include<stdio.h>
#include<math.h>
int main()
{
int r,c;
long long d;
while(~scanf("%d %d", &r, &c))
{
d = r==1||c==1? 1: (((long long)c*r)+1)/2;
printf("%lld\n", d);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define PI (acos(-1.0))
#define MODN 1000000007
#define MODN2 998244353
#define ALL(V) (V).begin(),(V).end()
#define INT_MAX_HALF (INT_MAX / 2)
#define EPS (1e-10)
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
... | 0 | 50,496,285 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int a, b, c, d;
string res = "No";
int main(){
cin >> a >> b >> c >> d;
if(abs(c - a) <= d){
res = "Yes";
}
if(abs(b - a) <= d && abs(c - b) <= d){
res = "Yes";
}
cout << res <... | #include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | 0 | 84,243,367 |
#include <bits/stdc++.h>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cmath>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
static const double pi=3.141592653589793238462643383279;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){re... | #include <iostream>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (A % 2 == 1) A--;
A /= 2;
B += A;
i++;
if (i >= K) break;
if (B % 2 == 1) B--;
B /= 2;
A += B;
}
cout << A << " " << B << endl;
} | 0 | 35,207,640 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
rep(i, N) cin >> s[i];
vector<int> cnt(3, 0);
rep(i, N) {
... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
long long arr[10000007] ;
int main()
{
long long n , sum = 0 , i , j ;
scanf("%lld",&n);
for ( i=1 ; i<=n ; i++)
{
for ( j = i ; j<=n ; j+= i )
{
arr[j]++;
}... | 0 | 51,423,517 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
#define to_s to_string
#define len(v) (ll)v.size()
#define UNIQUE(v) v.erase(uniq... | #include<bits/stdc++.h>
using namespace std;
bool db = false;
typedef long long LL;
typedef long double LD;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<LL, pll> pl_ll;
typedef pair<pll, LL> pll_l;
const LL INF = 1e18+1;
const LL maxn = 2*1e6+1;
LL t, n, m;
LL a[maxn+1];
in... | 0 | 16,923,137 |
#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include <string.h>
using namespace std;
int main() {
char s[10];
cin >> s;
if ( s[0] >= 'A' && s[0] <= 'Z' ) {
cout << "A" << endl;
} else {
cout << "a" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPP(i, n) for(int i = 1; i <= n; ++i)
#define REPR(i, n) for(int i = n-1; i >= 0; --i)
#define FOR(i, m, n) for(int i = m; i < n; ++i)
#define ALL(v) v.begin(), v.end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
using na... | 0 | 52,988,429 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<char,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(fals... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> x;
long long tmp;
x.push_back(-1e9-3);
for(int i = 0;i<n;i++){
cin >> tmp;
x.push_back(tmp);
}
long l;
cin >> l;
x.push_... | 0 | 85,574,776 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int budget = min(A, B) + min(C, D);
cout << budget << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main(){
int H, W, M;
cin >> H >> W >> M;
vector<int> Hi(H, 0);
vector<int> Wi(W, 0);
set<pair<int,int>> ... | 0 | 71,641,713 |
#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 ff first
#define ss second
#define all(v) v.begin(), v.end()
#define int long long
#define pb push_back... | #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
for(int i=1;;i++){
int x;
scanf("%d",&x);
if(x){
printf("Case %d: %d\n",i,x);
}else{
... | 0 | 26,839,903 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define INF 1e9
#define MAXN 20005
#define MOD 1000000007
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pii pa... | #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
int main(){
... | 0 | 49,886,657 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main()
{
int n;
cin >> n;
multiset<int> ms;
for(int i = 0; i < n; i++)
{
int a;
cin >> a;
ms.insert(a);
}
int h = *ms.rbegin();
if(h % 2 == 0)
{
if(ms.count... | 0 | 66,102,083 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int L, N;
cin >> N >> L;
priority_queue<string, vector<string>, greater<string>> pq;
for (int i = 0; i < N; i++)
{
string tmp;
cin >> tmp;
pq.push(tmp);
}
for (int i = 0; i < N; i++)
{
cout << pq.top();
pq.pop();
}
cout <... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define mp make_pair
ll inf = 1e18;
ll p = 1e9 + 7;
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
... | 0 | 9,573,303 |
#include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define F first
#define S second
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
using namespace std;
ll mod=1e9 +7;
ll expo(ll base,ll exponent,ll mod){
ll ans=1;
while(exponent!=0){
if(exponent&1) ans=(1... | #include<iostream>
#include<algorithm>
using namespace std;
long long N, L, T;
long long X[100000], W[100000];
pair<long long, int> X_after[100000];
int main(){
cin >> N >> L >> T;
for(int i = 0; i < N; i++){
cin >> X[i] >> W[i];
int j;
if(W[0] == 1){
j = i;
}else{
... | 0 | 98,578,570 |
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | #include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int s[N],a[N];
pair<int ,int >p[N];
int gcd(int a,int b)
{
if(a%b==0)return b;
return gcd(b,a%b);
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
int ans=a[0];
for(int i=0;... | 0 | 73,945,686 |
#include <iostream>
#include <algorithm>
#define INF (2 << 28)
using namespace std;
int main(){
int n, k, a[111111];
int sum[111111];
while(cin >> n >> k, n||k){
fill_n(sum, 111111, 0);
for(int i = 0; i < n; i++) cin >> a[i];
sum[0] = a[0];
for(int i = 0; i < n; i++) sum[i] =... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s, t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
int cnt = 0;
while(1){
int i = (int)s[cnt];
int j = (int)t[cnt];
if(i == 0 & j == 0){
cout << "No" << endl;
break;
}
if(i < j){
cout... | 0 | 68,592,657 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
int main(){
int h,w,a,b;
cin>>h>>w>>a>>b;
rep(i,h){
rep(j,w){
if(i<=h-b-1&&j<=w-a-1||i>h-b-1&&j>w-a-1) cout<<0;
else cout<<1;
}
cout<<endl;
}
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int... | 0 | 67,493,623 |
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#define ll long long
using namespace std;
int main()
{
ll K;
while(scanf("%lld",&K)!=EOF)
{
printf("50\n");
for(int i=0; i<50; i++)
{
if(i<K%50)
{
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int n,mod,x,ans;
int a[1000005];
int a2[1000005];
signed main()
{
cin>>n>>x>>mod;
int pos=0,len=0,pos2=n,sum=0;
if(n<=100000)
{
for(int i=1;i<=pos2;i++)
{
ans+=x;
x=(x*x)%mod;
}
cout<<ans;
return 0;
}
for(int i=1;i<=n;i++)
{
ans... | 0 | 78,728,373 |
#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<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<map>
#include<vector>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<functional>
#include<iomanip>
#define closeSync ios::sync_with_stdio(0);ci... | 0 | 3,270,395 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
const ll oo = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define FOR(i,a,b) for (ll i = (a);... | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
if(n>=1 && n<=199)
cout<<10;
else
if(n>=200 && n<=399)
cout<<9;
else
if(n>=400&& n<=599)
cout<<8;
else
if(n>=600&& n<=799)
cout<<7;
else
if(n>=800&& n<=999)
cout<<6;
else
if(n>=1000&& n<=1199)
... | 0 | 26,078,667 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int sum = 0;
bool find = false;
vector<int> ps;
for (int i = 1; !find && i < N+1; ++i) {
if (sum+i >= N) {
sum += i;
ps.push_back(i);
find = true;
}
else {
sum += i;
ps.push_back(i);
}
}
int ns = ... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int N;cin>>N;
... | 0 | 64,020,915 |
#include <stdio.h>
int main(){
int a, b;
scanf("%d %d", &a, &b);
if(a*b%2==0) printf("Even");
else printf("Odd");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long dp[310][610];
int main() {
int n, k; cin >> n >> k;
vector<long long> h(n+1, 0);
for (int i = 0; i <= n+1; i++) {
for (int j = 0; j <= 2*n; j++) dp[i][j] = 1e16;
}
dp[0][0] = 0;
for (int i = 0; i < n; i++) cin >> h[i+1];
for (in... | 0 | 169,423 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int k;
int cnt = 0;
cin >> n >> k;
cout << n-k+1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define len(x) (int)(x.size())
#define all(vs) vs.begin(), vs.end()
using ii = pair<int, int>;
using ll = long long;
int32_t main(){
ll n, a, b;
cin >> n >> a >> b;
ll k = n/(a+b);
ll ans = k*a + min(a, n%(a+b));
cout << ans << endl; ... | 0 | 30,433,937 |
#include <bits/stdc++.h>
using namespace std;
class dice{
public:
int d1;
int d2;
int d3;
int d4;
int d5;
int d6;
int kaisi(int s1, int s2, int s3, int s4 ,int s5,int s6);
string huru(string x);
int kakunin(int x,int y);
};
int dice::kaisi(int s1,int s2,int s3,int s4,int s5,int s6){
d1 = s1;
d2 = s2;
d3 ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template ... | 0 | 13,926,577 |
#include"bits/stdc++.h"
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
char a;
cin>>a;
if('a'<=a&&a<='z'){
cout<<"a"<<endl;
}
else if('A'<=a&&a<='Z'){
cout<<"A"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
const int N = 300006;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<bool> bad(n);
for... | 0 | 89,573,488 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <iomanip>
#include <tuple>
#include <map>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll GCD(ll a, ll b) {
if (b == 0) return a;
else r... | #include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) for(int i=a; i>=0; i--)
#... | 0 | 89,916,567 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
const int MOD{ int(1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define ... | 0 | 102,284 |
#include<iostream>
using namespace std;
char ans[2][10]={
"No\n",
"Yes\n"
};
int main(){
int a,b,c;
cin>>a>>b>>c;
bool flag=0;
if(a<b)if(b<c)flag=1;
cout<<ans[flag];
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 0 | 37,976,176 |
#include<iostream>
using namespace std;
main(){
int n,k,a;
int node1=0,node2,max;
int ruiseki[100001]={0};
while(1){
cin>>n>>k;
if(n==0&&k==0)break;
node2=k;
for(int i=1;i<=n;i++){
cin>>a;
ruiseki[i]=ruiseki[i-1]+a;
if(i>=k){
if(i==k){
max=ruiseki[node2]-ruiseki[node1];
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 0 | 91,202,271 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a, a+n, greater<int>());
int d = a[m-1], sum = accumulate(a, a+n, 0);
if (d * 4 * m < sum) cout ... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
using Graph ... | 0 | 37,869,865 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int answer = 0;
int count = N;
for (int i = 0; i <= count; i++)
{
answer += i;
}
cout << answer <<endl;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 77,313,296 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int... | #include<iostream>
using namespace std;
int main() {
int n,x;
while(1) {
cin >> n >> x;
int count = 0;
if ((n == 0) && (x == 0)) break;
for (int i = 1; i <= n; i ++) {
for (int j = i + 1; j <= n; j ++) {
for (int k = j + 1; k <= n; k ++) {
... | 0 | 61,715,889 |
#include<bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
... | #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 int INF = 1e9;
const int MOD = 1000000007;
const int MAX = 1000000;
int main(){
int a,b;
cin >> a >> b;
if(a == 1 && b == 1){
cout << 1 << " " ... | 0 | 73,877,858 |
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<cmath>
#include<bitset>
#include<cassert>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<iomanip>
#include<fstream>... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | 0 | 91,826,801 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
#define SZ(x) ((int)(x).size())
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const double pi=acos(-1);
int main() {
... | #include<bits/stdc++.h>
using namespace std;
#define INF 100000000000;
int main()
{
int N,K;cin >> N >>K;
long long ans=INF;
vector<int> building(N),building_fix(N);
for (int i=0;i<N;i++) cin >> building[i];
for (int i=0;i<1<<N;i++)
{
for (int i=0;i<N;i++) building_fix[i]=building[i];
long long now=0;
vecto... | 0 | 43,964,022 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, M;
cin>>n;
cin >> m >> M;
int ans = m;
rep (i, n-1) {
ans+=min(m, M);
m = M;
cin>>M;
}
cout << ans << endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#d... | 0 | 92,903,430 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
string s, t;
cin >> s >> t;
string ans = "No";
char c;
rep(i, s.size()){
c = s[s.size(... | #include<iostream>
using namespace std;
int main()
{
int n;
int input = 0;
int ansmin = 0;
int ansmax = 0;
long long anssum = 0;
cin >> n;
for (int cnt = 0; cnt < n; cnt++)
{
cin >> input;
if (cnt == 0)
{
ansmin = input;
ansmax = input;
}
if (input < ansmin)
{
ansmin = input;
}
else if ... | 0 | 28,434,814 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000001;
constexpr ll INF= 9 * 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
int main() {
int M,K;
cin >> M >> K;
if(M == 0) {
if(K == 0) {
cout <<... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
const ll LINF = 10010... | 0 | 37,899,146 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.