code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#define llong long long
#define rep(i,l,n) for(llong (i)=(l);(i)<(n);(i++))
#define _min(a,b) ((a)<(b)?(a):(b))
#define _max(a,b) ((a)>(b)?(a):(b))
#define _abs(a) ((a)>0?(a):(-(a)))
using namespace std;
int main(){
llong N,X,M... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | 0 | 99,999,225 |
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
int main(){
string s;cin >>s;
ll n=s.size();
char now=s[0];
ll ans=0;
for (int i = 0; i < n; ++i) {
if(... | 0 | 60,584,219 |
#include<iostream>
#include<cstdio>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
const int N=200200,INF=1000010000;
int n,L,R,t,a[N];
struct ele{
int l,r,w;
ele(int _l=0,int _r=0,int _w=0){l=_l,r=_r,w=_w;}
}s[N];
bool chk(int S){
int x=0,t=0,w,y;
FOR(i,1,n){
if(a[i]>x){s[++t]=ele(x+1,a[i]);x=a[i]... | #include <bits/stdc++.h>
#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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
ll solve(ll n,... | 0 | 47,116,297 |
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef pair<int,int> P;
int main(){
int n,m;
while(cin>>n>>m,n||m){
vector<P> v;
for(int i=0;i<n;++i){
int d,p;
cin >> d >> p;
v.push_back(P(p,d));
}
sort(v.begin(), v.end(), greater<P>(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
scanf("%d", &n);
int l = 0, r = n - 1, m;
string sl, sr, sm;
printf("%d\n", l);
fflush(stdout);
cin >> sl;
printf("%d\n", r);
fflush(st... | 0 | 63,047,448 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,P>
#define T tuple<int,int,int>
using namespace std;
int gcdo(int a, int b){
... | 0 | 8,145,092 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> order_time(5);
int min_mod = 1e5, pos = 0;
for (int i=0; i<5; i++){
cin >> order_time.at(i);
int mod_temp;
mod_temp = order_time.at(i)%10;
if (mod_temp != 0){
min_mod = min(mod_temp, min_mod);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll,ll>;
using vll = vector<pll>;
#define COUNT first
#define CHAR second
bool check(ll X, const vl& A) {
ll N = A.size(), last = 0;
vll s(N, pll(0, 0));
for (int i = 1; i < N; ++i) {
ll dif... | 0 | 17,925,044 |
#include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(i=0;i<(n);i++)
#define rrep(i,n) for(i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const ll MOD=1000000007ll;
const int MAX=5100000;
using namespace std;
int inputValue(){... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#define IOS ios_base::sync_with_s... | 0 | 7,985,204 |
#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... | #include <iostream>
#include <fstream>
#include<bits/stdc++.h>
using namespace std ;
using ll = long long ;
class BBreakNumber {
public:
void solve(std::istream& cin, std::ostream& cout) {
int n ;
cin >> n ;
int ans = 0 ;
for(int i = n ; i>=0 ; --i){
if(i && (!(i & (i - 1)))){
... | 0 | 27,460,703 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
int n;
vector <int> numbers;
ll cost(int to){
ll ans = 0;
for (auto& i:numbers){
ans += (i - to)*(i - to);
}
return ans;
}
int main ()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#define int ll
cin >> n;
numbers... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
using namespace std;
const int LIM = 1e5;
int N, P[LIM], idx[LIM];
ll ans;
int main() {
cin >> N;
rep(i, N) {
cin >> P[i];
P[i]--;
}
rep(i, N) idx[P[i]] = i;
set<int> S;
for (int x = N - 1; x >= 0... | 0 | 53,880,824 |
#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>;
void solve() {
int n, m;
cin >> n >> m;
int x = 1900 * m + (n-m) * 100;
cout << x * (1 << m) << endl;
}
int main() {
solve();
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n... | 0 | 82,574,161 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS=1e-10;
const ll INF=1000000000;
int main(){
string s;
while(1){
getline(cin,s);
if(s=="."){
break;
}
stack<char> st;
bool f=true;
for(int i=0;i<s.size();i++){
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <u... | 0 | 60,148,837 |
#include<iostream>
main(){long long n,i;std::cin>>n;for(i=n;--n;)i*=n;std::cout<<i<<"\n";} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rep2(i,s,t) for(int i = s; i <= t; ++i)
#def... | 0 | 46,268,196 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
int main() {
int A, B, C, D; cin >> A >> B >> C >> D;
int ans = 0;
if (B <= C || D <= A) ans = 0;
else ans = min(B, D)- max(A, C);
cout << ans << endl;
return 0;... | #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<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | 0 | 67,680,486 |
#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()
{
string A;
cin >> A;
ll ans = A.size() * (A.size() - 1) / 2;
char c = 'a';
rep(i,26)
{
ll cnt = 0;
rep(j,A.size())
{
if (A[j] == c) cnt++;
}
if (cnt != ... | #include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (auto &ai: a) cin >> ai;
long long unit = 1LL * n * (n + 1) / 2;
long long sum = accumulate(begin(a), end(a), 0LL);
if (sum % unit) return !(cout... | 0 | 56,580,604 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
if (s!="keyence") {
for (int i=0;i+1<s.size();i++) {
for (int j=i+1;j<s.size();j++) {
string tmp=s;
tmp.erase(i,j-i);
if (tmp=="keyence") {
... | 0 | 20,574,628 |
#include <stdio.h>
int main(){
int d,s;
int i;
while(scanf("%d",&d)!=EOF){
s = 0;
for(i=1;d*i<600;i++){
s += d*(d*i)*(d*i);
}
printf("%d\n",s);
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | 0 | 61,695,259 |
#include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define sz size()... | #include <iostream>
#include <iomanip>
#include <limits>
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <functional>
#define big ((long long)(1e9) + 7)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define DBG(x) cerr << #x << ": " << (... | 0 | 27,724,190 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int r;
cin >> r;
if (r < 1200)
cout << "ABC";
else if (r >= 1200 && r < 2800)
cout << "ARC";
else
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(pi c, pi d){
return c.S < d.S;
}
int main() {
int n, k, s;
cin >... | 0 | 71,321,593 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n,m;
cin >> n>> m;
vector<vector<ll>> v;
for(int i=0;i<n;i++){
ll a,b;
cin >> a >> b;
v.push_back({a,b});
}
v.push_back({inf,inf});
sort(v.begin(),v.end());
priori... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const ll N = 1e6, inf = 1e9;
ll tree[2 * N], lazy[2 * N], ar[N];
void pushDown(ll node, ll s, ll e)
{
if(lazy[node])
{
ll l = 2 * node, r = 2 * node + 1;
if( s != e)
{
ll mid = (s + e)/2;
... | 0 | 75,404,053 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
static const int MAX = 10000;
using namespace std;
int V,E;
vector<int> G[MAX];
vector<int> ans;
bool used[MAX];
int indeg[MAX];
void bfs(int s){
queue<int> q;
q.push(s);
used[s]=true;
while(!q.empty())
{
int u=q.f... | #include <iostream>
using namespace std;
int main()
{
int h, w;
while (true) {
cin >> h >> w;
if (h == 0 && w == 0) {
return 0;
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i == 0 || i == h - 1 || j == 0 || j == w - 1) ... | 0 | 84,100,428 |
#include <iostream>
int main(int argc, char **argv){
for(int i = 1; i < 10; i++){
for(int j = 1;j < 10; j++){
std::cout << i << "x" << j << "=" << i * j;
std::cout << std::endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | 0 | 98,584,029 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true);... | #include<iostream>
#include<string>
#include<stdio.h>
using namespace std;
class Dice {
public:
int s[6], tmp;
Dice(int array[6]){
s[0] = array[0];
s[1] = array[1];
s[2] = array[2];
s[3] = array[3];
s[4] = array[4];
s[5] = array... | 0 | 62,812,115 |
#include<stdio.h>
#include<iostream>
using namespace std;
const static int MAX = 100000;
const static int NIL = -1;
typedef struct {
int parent;
int left;
int right;
} Node;
Node T[MAX];
int D[MAX];
void printChildren(int u) {
int c = T[u].left;
int i = 0;
printf("[");
while (c != NIL) {
if (i > 0) pr... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main() {
int n;
cin>>n;
vector<int> a(n);
... | 0 | 40,308,883 |
#include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <int> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
using namespace std;
void s... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | 0 | 73,874,934 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
cout << (s == "AAA" || s == "BBB" ? "No" : "Yes") << endl;
} | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include... | 0 | 72,945,641 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include <bits/stdc++.h>
using namespace std;
char maze[21][21];
#define r(z,x) for(int z=0;z<x;z++)
int ans;
void dfs(int x,int y){
int dx[4]={0,-1,0,1};
int dy[4]={1,0,-1,0};
maze[x][y]='#';
ans++;
r(i,4)if(maze[x+dx[i]][y+dy[i]]=='.')dfs(x+dx[i],y+dy[i]);
}
int main(){
int a,b;
while(cin>>a>>b,a||b){
ans=0;... | 0 | 15,945,097 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, M, X, Y; cin >> N >> M >> X >> Y;
int x_num = 0, y_num = 10e5;
for (int i = 0; i < N; i++) {
int tmp; cin >> tmp;
if (i == 0) x_num = tmp;
else x_num = max(x_num, tmp)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100005
vector < pair < int , int > > a[N];
int vis[N];
int pos[N];
int valid = 1;
void dfs(int n, int cur)
{
vis[n] = 1;
pos[n] = cur;
for(int i=0;i<a[n].size();i++)
{
if(vis[a[n][i].first]==0)
{
d... | 0 | 33,119,568 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int dp[100005][3] = {0};
int A[100005];
int B[100005];
int C[100005];
const int INF = 1e9+5;
int main(){
int N;
cin >> N;
for(int i=1; i<=N; i++){
cin >> A[i] >> B[i] >> C[i];
}
for(int j=0; j<=2; j++){
dp[1][0] = A[1];
dp[1][1] = B[1];
dp[1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i < int(n); ++i)
#define repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((... | 0 | 50,720,690 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(pi c, pi d){
return c.S < d.S;
}
int main() {
int n, k, s;
cin >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n,m;... | 0 | 73,689,823 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
void solve(long long N, std::vector<long long> A, std::vector<long long> B){
vector<pair<ll, l... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main()
{
... | 0 | 94,246,291 |
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<iomanip>
#include<math.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
#define INF 1000000000000000LL
int main(){
ll N; cin >> N;
ll a[N+1];
ll node = 0;
rep(i, N+1){
... | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
while(true){
int a[100000] = {0};
int n, k;
cin >> n >> k;
if(!n)
break;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int ans = 0;
for(int j = 0; j < k; j++){
ans +... | 0 | 97,297,577 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(void){
int N, K;
cin >> N >> K;
vector<int> price(N);
rep(i, N) cin >> price.at(i);
sort(all(price));
int ans=0;
rep(i, K){
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | 0 | 83,773,363 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
cons... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
string s;
cin >> n >> k >> s;
vector<int> memo(100005, 0);
int l=0, r=0, ans = 0, nans = 0;
bool frag1 = false;
for(int i=0; i<n; ++i){
if(s[i] == '0'){
if(frag1){
++memo[r];
++nans;
}else{
frag1 = ... | 0 | 50,702,879 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string line;
getline(cin, line);
for(unsigned int i=0; i<line.length(); i++) {
if('a' <= line[i] && line[i] <= 'z') {
line[i] -= 32;
}
else if('A' <= line[i] && line[i] <= 'Z') {
line[i] += 32;
}
}
cout << line... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
int q;
LL a, b;
int main() {
scanf("%d", &q);
while(q--) {
scanf("%lld%lld", &a, &b);
LL n = a * b;
LL temp = sqrt(n);
LL res = temp * 2LL;
if(temp * temp == n) {
res -= 2LL... | 0 | 11,493,100 |
#include<stdio.h>
int main()
{
int i,j,x,y;
while(1)
{
scanf("%d %d",&i,&j);
if(i==0&&j==0) break;
for(x=1;x<=i;x++)
{
for(y=1;y<=j;y++)
{
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
#define rep(i, n) for (int i = 0; i <(int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll MOD=1000000007;
const ll INF=1000000000000000001;
int main(){
ll n,m;cin>>n>>m;
ll a[n],b... | 0 | 85,494,067 |
#include <iostream>
#include <vector>
#include <list>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>a(n);
list<int>b;
bool f = true;
if(n%2 == 0){
f = true;
}else{
f = false;
}
for(int i=0; i<n; ++i){
int tmp;
cin >> tmp;
if(f){
b.push_back(tmp);
}else{
b.push_front(tmp);
}
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef pair<int,int> P;
#define fi first
#define se second
#define all(v) (v).begin(),v.end()
set<string> c;
const ll inf=(1e18);
const ll mod=1000000007;
const ll mod2=998244353;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/g... | 0 | 34,490,479 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
cout << (x * 2 <= y && y <= x * 4 && y % 2 == 0 ? "Yes" : "No") << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a) for(int i=0; i<a;i++)
#define loop2(i,a,b) for(int i=(a... | 0 | 37,785,032 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector <int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
int ans = accumulate(arr.begin(), arr.begin() + k, 0);
cout << ans ... | #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)
int main() {
ll a... | 0 | 80,425,128 |
#include "cstdio"
#include "vector"
#include "queue"
using namespace std;
const int maxm=100;
struct edge{int to,w;};
edge edges[maxm];
vector<int>g[maxm];
int n,m,p;
int vis[maxm],dis[maxm];
int max(int a,int b){return a>b?a:b;}
void add(int u,int v,int w)
{
edges[++p].to=v;
edges[p].w=w;
g[u].push_back(p);
}
void ... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
typedef pair<int,int> pii;
typedef vector<int> vi;
const int INF = (1<<25);
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
char maze[1001][1001];
int d[1001][1001];
int h,w,n;
int sx,sy;
int bfs(int num){
queue<pii> que;
... | 0 | 83,354,871 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,r;
cin >> n >> r;
if(n>=10)
cout << r;
else
cout << r+100*(10-n);
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 90,843,457 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if(x % y == 0){
cout << -1 << endl;
return 0;
}
long long k = 1;
while(1){
long long ans = k * x;
if(ans % y == 0){
k++;
continue;
}
cout << ans << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string S;
cin >> A >> B;
cin >> S;
if (S.size() == A + B + 1 && S.at(A) == '-'){
for(int i = 0; i < S.size(); i++){
if (i != A && S.at(i) == '-'){
cout << "No" << endl;
exit(0);
}
}
}
else {
... | 0 | 70,362,120 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
int N;
string A;
const ll MOD = 1000000007;
int main() {
cin >> N;
cin >> A;
if (A[0] == 'W' || A.back() == 'W') {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < 2 * N; i++) {
if (i % 2 == 0) {
if (A[i] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | 0 | 50,638,229 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_st... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 0 | 45,803,370 |
#include <iostream>
using namespace std;
int main() {
string S; cin >> S;
for (int i = 0; i < S.length(); i++) {
printf("%c", S[i]);
if (i == 3) printf(" ");
}
printf("\n");
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | 0 | 87,019,339 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
class Prints {
private:
class __Pr... | #include<bits/stdc++.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 pb push_back
#define ins insert
#define pqueue(... | 0 | 45,897,454 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int N, K;
string S;
cin >> N >> S >> K;
for(au... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
typedef lon... | 0 | 19,855,883 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repc(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 + ... | 0 | 17,429,500 |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<functional>
#include <random>
#include<iostream>
#include<iomanip>
using namespace std;
int N;
pair<int, int> A[100000];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i].fir... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pf printf
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define sz(v) ((int)(v).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) ... | 0 | 26,705,358 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
const do... | #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 | 34,338,329 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
int main() {
int A, B, K;
... | #include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define int long long
using namespace std;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (ll)(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)... | 0 | 93,801,337 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h1, h2, m1, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
if (h2 < h1)
h2 += 24;
int ans = (h2 - h1) * 60 + (m2 - m1) - k;
cout << ans << endl;
} | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 49,699,488 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n,a,b; cin >> n >> a >> b;
ll mod = n / (a+b);
ll count = (a+b) * mod;
ll ans = a * mod;
while(count < n) {
if(n-count > a) {
ans += a;
} else {
ans += n-count;
break;
}
count += a;
if(n-count > b) ... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 0 | 45,338,277 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <fstream>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
const ll mod = 1000000007;
const ll INF = 100000010000;
ll kai[100... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<long long int> v;
for (int x = 0; x < n; ++x){
long long int q; cin >> q;
v.push_back(q);
}
sort(v.begin(), v.end());
long long int ans = 0;
for (int ... | 0 | 45,681,156 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dep(i,a,b) for(int i=a;i>=b;i--)
typedef long long ll;
const int MAXN = 100050;
const int MAXM = 400500;
bool vis[MAXN];
int h[MAXN],nx[MAXM],to[MAXM],tot,rk[MAXN];
int color[MAXN],n,m;
void add_edge(int x,int y){to[++tot]=y;n... | #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 | 16,327,429 |
#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,Y; cin >> N >> Y;
Y /= 10... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int main(){
ll A, B;
cin >> A >> B;
ll ans;
if(A % 2 == 0 && B % 2 == 0){
if(((B-A)/2)%2 == 0){
ans = 0 ^ B;
}else{
ans = 1 ^ B;
}
}else if... | 0 | 65,750,186 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e6;
int V,E;
vector<vector<long long int>> d;
int main(){
cin >> V >> E;
d.assign(V, vector<long long int>(V, INF));
for (int i=0; i<V; i++){
d[i][i] = 0;
}
vector<int> a(E), b(E), c(E);
for (int i=0; i<E; i++){
... | #include <stdio.h>
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define prints(x, y) cout<<(x)<<" "<<(y)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#defi... | 0 | 16,826,427 |
#pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
const int maxn = 1<<20, mod = 924844033;
ll n, k, a[maxn], b[maxn], c[maxn];
ll ans = 0;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n... | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | 0 | 85,193,989 |
#include <bits/stdc++.h>
using namespace std;
const int N = 310;
long long dp[N][N], tmp[N][N];
long long h[N];
int n, K;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
set<long long> s;
vector<long long> v;
map<long long, int> pos;
cin >> n >> K;
s.insert(0);
for (int i = 0; i < n; ++i) {
cin... | #include<iostream>
using namespace std;
int main()
{
int n, i, tmp;
int num[10000];
long sum = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
}
for (i = 0; i < n-1; i++)
{
if (num[i] < num[i + 1])
{
tmp = num[i + 1];
num[i + 1] = num[i];
num[i] = tmp;
}
}
cout << num[n-1] << " ";
... | 0 | 53,216,728 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli n;
lli gcd(lli a, lli b){
if(b == 0) return a;
return gcd(b, a%b);
}
int main(void){
cin >> n;
lli ans = 0;
rep(i, n){
lli a;
cin >> a;
ans = gcd(ans, a);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 0 | 18,645,714 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORD(i, m, n) for (int i = m; i >= n; --i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REP1(i, n) for (int i = 0; i <= n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define EPS (1e-7)
#define INF (... | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
const int N = 110, M = N * N;
int x[N], y[N], a[N], b[N];
int n;
int h[N], e[M], ne[M], idx;
void add(int a, int b)
{
e[idx] = b;
ne[idx] = h[a];
h[a] = idx ++;
}
bool st[N];
int match[N];
bool find(int u)
{
f... | 0 | 35,696,340 |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
int cnt = 0;
vector<vector<ll>> vac;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin>>N;
vac.resize(N);
for(int i=0;i<N;i++){
vac[i].resize(3);
}
for(int i=0;i<N;i++){
for(int j=0;j<3;j++... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (ll)b; ++i)
#define digit(a) to_string(a).size()
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
int main(void)
{
... | 0 | 25,042,443 |
#include <iostream>
#include <cstring>
#define M 1000000
using namespace std;
char list[M][13];
void Init()
{
for(int i=0;i<M;i++)
list[i][0] = '\0';
}
int getch(char a)
{
if(a=='A')
return 1;
else if(a=='C')
return 2;
else if(a=='G')
return 3;
else
return 4;
... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define mp ... | 0 | 75,828,715 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
vector<int> prime={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
int n;
cin>>n;
int num[25];
rep(i,0,25){
num[i]=0;
}
... | 0 | 65,248,382 |
#include <algorithm>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, M;
int D[100005], P[100005];
void solve() {
vector<pair<int, int>> vec;
rep(i, N) vec.push_back(make_pair(P[i], D[i]));
sort(vec.begin(), vec... | #include <iostream>
#include <map>
using namespace std;
void solve()
{
int N; cin >> N;
map<long long,int> M;
for (int i = 0; i < N; ++i){
int a; cin >> a;
M[a]++;
}
long long x = 0,y = 0;
while(!M.empty()){
int k = M.rbegin()->first;
if(M[k] >= 2) {
x... | 0 | 11,797,465 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXSIZE=10000020;
int bufpos;
char buf[MAXSIZE];
#define NEG 0
void init(){
#ifdef LOCAL
freopen("E.txt","r",stdin);
#endif
buf[fread(buf,1,MAXSIZE,stdin)]='\0';
bufpos=0;
}
#if NEG
int readint(){
bool isneg;
int val=0;
for(;!isdigit... | 0 | 94,394,936 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> v(N, vector<int>());
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
v.at(a - 1).push_back(b - 1);
v.at(b - 1).push_back(a - 1);... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define endl '\n'
using namespace std;
const int N = 2e4 + 5;
int n, p[N];
int a[N], b[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n;
for(int i = 1; i <= n; i++)
{
... | 0 | 80,780,270 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
void solve()
{
int s;
cin >> s;
vector<ll> dp(2020);
dp[3] = 1;
rep(i, s + 1)
{
if (i > 3)
d... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int N;
cin >> N;
vec<ll> A(N);
rep(i, N) cin >> A[i];
map<ll,int> mp;
ll now = 0;
l... | 0 | 13,807,543 |
#include<iostream>
#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define pb(x) push_back(x)
#define gcd(a,b) __gcd(a,b)
#define all(v) v.begin(),v.end()
#define lcm(a,b) (a*b)/gcd(a,b)
#define bits(x) __builtin_popcountll(x)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NUL... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 0 | 93,267,468 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include <stdio.h>
int main(){
char p[101],x[202];
for(int i=0;i<101;i++)
p[i]=x[i]='\0';
int m=0,n=0;
bool f;
scanf("%s",x);
scanf("%s",p);
while(x[m]!='\0')m++;
while(p[n]!='\0')n++;
for(int i=m;i<m*2;i++){
x[i]=x[i-m];
}
for(int i=0;i<m;i++){
f=true... | 0 | 12,404,458 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = ... | #include <iostream>
#include <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... | 0 | 67,797,446 |
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#endif
typedef pair<ll, ll> pt;
con... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define arr array
using namespace std;
const int e = 2e6 + 69;
const ll mod = 1e9 + 7;
ll a[e];
int h, w;
string s[e];
ll row[3000][3000], col[3000][3000], another_col[3000][3000], another_row[3000][3000];
int main()
{
cin >> h >> w;
for(int i=1... | 0 | 86,655,511 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N;
unsigned int K;
std::cin >> N >> K;
std::vector<unsigned int> A(N);
std::vector<long long> B(N);
for (int i = 0; i < N; ++i) std::cin >> A[i] >> B[i];
long long ans = 0;
for (int r = 0; r <= 30; ++r) {
unsigned int X = K ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int base = 400;
int answer =8;
for(int g=0;g<8;g++)
{
base = base + 200;
if(n<base)
{
break;
}
answer --;
}
cout<<answer<<endl;
} | 0 | 98,355,841 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin >> N >> M;
vector<vector<int>> s(M);
for(int i = 0; i< M; i++){
int k; cin >> k;
for(int j = 0; j < k; j++){
int a; cin >> a; a--;
s[i].push_back(a);
}
}
vector<int> p(M);
for(i... | #include<cstdio>
#include<algorithm>
using namespace std;
bool solve(){
int a,b,n;
int map[16][16];
scanf("%d %d",&a,&b);
if(a==0&&b==0) return 0;
fill(map[0],map[0]+256,0);
scanf("%d",&n);
for(int i=0;i<n;i++){
int x,y;
scanf("%d %d",&x,&y);
map[--x][--y] = -1;
}
map[0][0] = 1;
for(int ... | 0 | 26,310,776 |
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#defi... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 93,516,051 |
#include <bits/stdc++.h>
using namespace std;
string num (int x) {
string res = to_string(x);
while (int(res.size()) < 6)
res = "0" + res;
return res;
}
signed main () {
int n, m;
cin >> n >> m;
vector < vector < pair < int, int > > > region(n + 1);
for (int i = 0; i < m; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
int W,H,N;
int x[110],y[110],a[110];
int main()
{
cin>>W>>H>>N;
int left=0,right=W,top=H,bottom=0;
for (int i = 0; i < N; i++)
{
cin>>x[i]>>y[i]>>a[i];
}
for (int i = 0; i < N; i++)
{
if(a[i] == 1){
if(x[i]>=left) left... | 0 | 75,420,544 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL<<60;
int main()
{
int n,c,k; cin>>n>>c>>k;
int t[n];
rep(i,n) {
cin >> t[i];
}
sort(t, t+n);
int ans = 0;
for (int i =0; i < n;) {
++ans;
int start = i;
... | #include <iostream>
void PrintWallLine( int length ){
using namespace std;
for( int i = 0; i < length; ++i ){
cout << '#';
}
cout << endl;
}
void PrintRoomLine( int length ){
using namespace std;
for( int i = 0; i < length; ++i ){
if( i == 0 || i == length-1 ){
cout <... | 0 | 13,137,274 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
int N,K;
cin>>N>>K;
vector<int> vec(N);
rep(i,N) cin>>vec.at(i);
int count=0;
sort(vec.begin(),vec.end());
vector<pair<int,int>> num={make_pair(1,vec.at(0))};
rep(i,N){
if(i==0) continue;
else ... | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type
summation(InputIterator first, InputIterator last) {
using T = typename InputIterator::value_type;
T *p = new T();
const auto sum = std::accumulate(first, last, *p);
delete p;
return sum;
}
template <typename T>
std:... | 0 | 86,650,142 |
#include <bits/stdc++.h>
using namespace std;
int main(){
while(true){
int n, m, p;
cin >> n >> m >> p;
if(n == 0)break;
vector<int> x(n);
int sum = 0;
for(int i= 0; i < n; i++){
cin >> x[i];
sum += x[i];
}
m--;
int ans = 0;
if(x[m] != 0){
ans = (100 - p)*sum/x[m];
}
cout << ans << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100010;
int n; ll a[maxn];
vector<int> G[maxn];
ll dfs(int v, int f) {
if (G[v].size() == 1) return a[v];
ll sum = 0;
vector<ll> V;
for (int u : G[v]) if (u ^ f) {
ll t = dfs(u, v);
sum += t, V.push_back... | 0 | 2,595,377 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
using namespace std;
int main() {
int r, g;
cin >> r >> g;
int ans = r + (g - r) * 2;
cout << ans << endl;
return 0;
} | 0 | 5,564,191 |
#include <stdio.h>
int main()
{
int N;
scanf("%d", &N);
printf("%d\n", N*(N + 1)/2);
return 0;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 44,368,192 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
int k,a,b; cin >> k>>a>>b;
for(int i = a; i<=b; ++i){
if(i%k==0) {
cout << "OK"; return 0;
}
}
cout << "NG";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<string> vs;
typedef pair<ll,ll> pll;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);... | 0 | 58,658,936 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N,K,num;
cin >> N;
cin >> K;
num = 1;
rep(i,N){
if (num < K)
num *= 2;
else
num += K;
}
cout << num << endl;
} | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
long long N;
cin >> N;
long long max_count = 0;
long long count = 0;
long long H;
for(int i=0; i<N; i++){
long long H_tmp;
cin >> H_tmp;
if(i==0){H = H_tmp;continue;}
if(H... | 0 | 23,040,090 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int rainy = 0, maxx = 0;
string days;
cin >> days;
for (int i = 0; i < days.size(); i ++) {
if (days[i] == 'R')
rainy ++;
if (rainy > maxx)
maxx = rainy;
if (days[i] == 'S')
rainy = 0;
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <numeric>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
#define debug(x) (cout << # x ": " << x << endl)
#define int long long int
#define r... | 0 | 88,299,113 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 89,156,421 |
#include<iostream>
#include<string>
#include<vector>
#include<iterator>
using namespace std;
int main()
{
int n,ta=0,ha=0;
string a,b;
cin >> n;
vector<string> taro;
vector<string> hana;
for(int i=0;i<n;i++){
cin >> a >> b;
taro.push_back(a);
hana.push_back(b);
for(int j=0;j<10000;j++){
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef unsigned long long ull;
#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)... | 0 | 82,247,214 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#def... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | 0 | 9,958,108 |
#include <iostream>
#include <string>
int main(void) {
int n;
std::string s;
int count;
std::string now_status;
while (1) {
std::cin >> n;
if (n == 0) {
break;
}
count = 0;
now_status = "";
for (int i = 0; i < n; i++) {
std::cin... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
using... | 0 | 25,668,137 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 0 | 37,988,473 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n,m;
cin >> n >> m;
int l = (n-m)*100 + m*1900;
rep(i,m) {
l *= 2;
}
c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#define REP(i,a,b) for(int i=int(a);i<int(b);i++)
using namespace std;
typedef long long int lli;
typedef pair<int,int> pii;
int main () {
int W, H;
while (cin >> H >> W, W + H) {
vector<vector<char> > map(W +... | 0 | 33,299,511 |
#include <iostream>
#include <vector>
using namespace std;
#define MOD 1000000007
int n;
vector<int> adj[100100];
long long dp1[100100], dp2[100100];
void dfs (int x, int p) {
dp1[x] = dp2[x] = 1;
for (auto i: adj[x]) {
if (i == p) continue;
dfs(i, x);
dp1[x] = (dp1[x]*dp2[i])%MOD;
dp2[x] = (dp2[x]*(dp1[i]+dp... | #include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
using namespace std;
typedef ... | 0 | 15,590,208 |
#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;
int main(){
int n; cin>>n;
string s,t; cin>>s>>t;
int ans=n*2;
int cnt=0;
re... | #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 | 798,985 |
#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>;
void fail() {
cout << -1;
exit(0);
}
int main() {
int n;
cin >> n;
++n;
vector<ll> a(n), b(n);
for (ll& i : a) cin >> i;
if (n == 1) return cout ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
template <typename T>
vector<T> _divisor(T a) {
vector<... | 0 | 99,697,789 |
#include <iostream>
#include <cmath>
using namespace std;
typedef struct _Point {
double x;
double y;
} Point;
typedef Point Vector;
Point subPoint(Point a, Point b) {
Point ret;
ret.x = a.x - b.x;
ret.y = a.y - b.y;
return ret;
}
bool apint(Point a, Point b, Point c, Point p) {
Vector ab = subPoint(b, a);
Vect... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | 0 | 95,001,706 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
int main(){
string s;
cin >> s;
if(s == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
if(s.size() < 26){
vector<P> alph(26);
rep(i, 26) alph[i] = make_pair(0, i);
rep... | #include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
typedef long int li;
int fact_ord(int b,int n){
int ret=0;
while(n){
n/=b;
ret+=n;
}
return ret;
}
int main(){
int n; cin >>n;
int primes[]= {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47} ;
int thresh[5]= {74... | 0 | 38,032,900 |
#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()
int main()
{
int n,m;
cin >> n >> m;
vector<int> a(m);
vector<int> b(m);
int i;
rep(i,m) cin >> a[i] >> b[i];
vector<int> count(n+1,0);
rep(i,m)
{
count[a[i]]++;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
void darts();
void longest_dis();
void sum_of_three_integers();
void otoshidama();
int main()
{
otoshidama();
}
void darts()
{
while (true)
{
int n, m;
cin >> n >> m;
if (n == 0) break;
vector<int> p... | 0 | 24,281,430 |
#pragma warning(disable:4996)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include "bits/stdc++.h"
using namespace std;
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define f first
#define s... | #include <bits/stdc++.h>
const int M = 1e4+10;
using namespace std;
int cnt;
vector<int> arr,vec[M];
set<int> st;
int in[M];
void go(){
while(!st.empty()){
int u=*st.begin();
st.erase(st.begin());
arr.push_back(u);
cnt++;
for(int i=0;i!=vec[u].size();i++){
in[vec[u][i]]--;
if... | 0 | 52,809,974 |
#include<cstdint>
#include<limits>
#include<cstdbool>
#include<cmath>
#include<iostream>
#include<vector>
#include<array>
#include<list>
#include<string>
#include<sstream>
#include<algorithm>
int main(){
int n,k;
std::cin>>n>>k;
int a=1;
for(int i = 0; i< n ;++i){
if(a<k)
a*=2;
else
a+=k;
}
std::cout<<a... | #include <bits/stdc++.h>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#define all(arr) arr.begin(), arr.end()
#define rep... | 0 | 11,607,991 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int A,B;
cin>>A>>B;
int ans=0;
if((A+B)%2==0)ans=(A+B)/2;
else ans=(A+B)/2+1;
cout<<ans<<endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
int mai... | 0 | 7,857,323 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) (cerr << #x << " = " << x << endl;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, M;
cin >> N >> M;
vector<ll> X(N), Y(N), Z(N);
for ( int i = 0; i < N; i++ ) {
cin >> X[i] >> Y[i] >> Z[i];
}
const ll INF = 1LL<<60;
ll ans = -INF;
ll dp[2][2][2][M+1];
for ( int t1 = 0; t... | 0 | 73,695,510 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using ld = long double;
int main(){
ll h,w,x,y;
cin... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main() {
int N, M;
while(cin >> N && N!=0) {
map<char, char> conv;
for(int i=0; i<N; ++i) {
char pre, post;
cin >> pre >> post;
conv[pre] = post;
}
cin >> M;
... | 0 | 3,644,930 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.