code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#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;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | /// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) fo... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
cout << (N / 1 * 1 * (N / 1 + 1) - N / 3 * 3 * (N / 3 + 1) - N / 5 * 5 * (N / 5 + 1) + N / 15 * 15 * (N / 15 + 1)) / 2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int res = 0;
if (s[0] == 'R'||s[1] == 'R'||s[2] == 'R') res = 1;
if (s[0] == 'R' && s[1] == 'R') res = 2;
if (s[1] == 'R' && s[2] == 'R') res = 2;
if (s[0] == 'R' &... | 0 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YY cout << "Yes" << endl;
#define NN cout << "No" << endl;
#define ve vector
const i... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,... | #include <cstdio>
#include <algorithm>
#include <functional>
#include <stack>
#include <cmath>
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 llong long long
int main() {
while(1){
int n;
scan... | 0 |
#include <bits/stdc++.h>
#define LL long long
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define FOD(i,a,b) for(int i=a; i>=b; i--)
#define pa pair<int,int>
#define fi first
#define se second
#define MOD xxx
#define getbit(n,i) ((n>>(i-1))&1)
#define offbit(n,i) ((n^(1<<(i-1))
#define onbit(n,i) (n|(1<<(i-1)))
#define ... | #include <bits/stdc++.h>
using namespace std;
long long n, x, cur = 0;
vector<vector<long long>> tests;
long long check(long long k){
long long best, complete = k / x, other = k % x, cursum = 0;
if(complete >= n)
return cur + 1;
for(int i = 0; i < complete; ++i)
cursum += tests[i][0];
... | 0 |
#include <iostream>
#include <vector>
using i64 = long long;
template <class T = long long int>
class Bit {
private:
unsigned len;
T init;
std::vector<T> arr;
public:
Bit(unsigned length, T initialValue = 0): len(length), init(initialValue), arr(len + 1, init) {}
void update(unsigned a, T ... | #include<bits/stdc++.h>
#define maxn 100005
#define endl '\n'
using namespace std;
int arr[maxn],brr[maxn],pre[maxn];
struct sqrtd {
int next,cnt;
}table[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for(int i=1;i<=n;i++)
cin >> arr[i];
for(int i=1;i<n;i++)
brr[i] = arr[i+1] - arr... | 0 |
#include <iostream>
#include <string>
using namespace std;
string revstr( string str ) {
string ret;
for(int i = str.length() - 1; i >= 0; i--)
ret += str[i];
return ret;
}
int main(void){
string str;
cin >> str;
cout << revstr( str ) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#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()
#define endk '\n'
cons... | 0 |
/*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_sta... | //0039
//include-------------------------------------
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<stack>
using namespace std;
//typedef--------------------------------------
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int, int> PI... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
int n;
while(1) {
if(scanf("%d", &n) == EOF) break;
int total = 0;
rep2(i,1,(600/n)) {
total += n * n * i * n * i;
}
cout << total << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
map<string, int> day;
day["SUN"] = 7;
day["MON"] = 6;
day["TUE"] = 5;
day["WED"] = 4;
day["THU"] = 3;
day["FRI"] = 2;
day["SAT"] = 1;
string s;
cin >> s;
cout << day[s] << endl;
retur... | 0 |
#include<iostream>
#define INF 100000000000000
#define MAXN 1000+10
using namespace std;
long long dist[MAXN][MAXN];
int main(){
int i,j,k,n,m,a,b;
cin>>n>>m;
for (i = 0;i < n;++i){
for (j = 0;j < n;++j){
if (i != j) {
dist[i][j]=INF;
}
}
}
for (i = 0;i < m;++i){
cin>>a>>b;
cin>>dist[a][b];
... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
template <class T>
using gp_queue=priority_queue<T, deque<T>, less<T>>;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
E... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<stri... | #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 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1234567;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int cnt[200005];
signed main() {
int N;
cin >> N;
vector<int>a(N);
for(int i = 0; i < N; i++) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n;
cin >> n;
int a[n+1];
rep(i,n) cin >> a[i+1];
int ans[n+1];
rep(i,n) ans[i+1] = 0;
//rep(i,n) cout << a[i] << endl;
for(... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf,... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string ans = s.substr(0, s.size()-8);
cout << ans << endl;
return 0;
} | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#includ... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n;
cin >> n;
int h;
ll ans = 0;
cin >> h;
for(int i=0;i<n-1;i++){
int nh;
cin >> nh;
if(nh>=h) h = nh;
else ans += (h-nh);
}
cout << ans << endl;
return 0;
} | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("O3")
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdlib>
#include<set>
#include<vector>
#include<sstream>
#include<queue>
#include <iomanip>
#include<unordered_set>
#include <stack>
#include ... | 1 |
#include <iostream>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int H, W, A[509][509];
vector<tuple<int, int, int, int>> L;
int main() {
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) cin >> A[i][j];
}
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#defi... | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
#define maxn 1000010
using namespace std;
typedef long long llg;
struct data{
int l,r;
data(int a=0,int b=0):l(a),r(b){}
}s[maxn];
int *q[26],lq[26],ct[26],... | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template<typename T1,typename T2> inline T1 max(T1 a,T2 b){return a<b?b:a;}
template<typename T1,typename T2> inline T1 min(T1 a,T2 b){return a<b?a:b;}
namespace ae86
{
const int bufl = 1<<15;
char buf[bufl],*s=buf,*... | 1 |
#include<bits/stdc++.h>
#define re register
int f[6010][9030],mod;
int main()
{
re int n;
scanf("%d%d",&n,&mod);
f[0][6010]=1;
for(re int i=0;i<3*n;i++)
{
for(re int j=-i;j<=i/2;j++)
if(f[i][j+6010]){
f[i+1][j-1+6010]=(f[i+1][j-1+6010]+f[i][j+6010])%mod;
f[i+2][j+1+6010]=(f[i+2][j+1+6010]+1ll*f[i][j+6010... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
#include <cstring>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#d... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
bool truth = false;
cin >> n >> s;
s /= 1000;
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= n - i; j++)
{
if (i * 9 + j * 4 + n == s)
{
cout << i << ' ' << j << ' ' ... | #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()
{
//darts();
//longest_dis();
//sum_of_three_integers();
otoshidama();
}
void darts()
{
while (true)
{
... | 1 |
#include <cstdio>
#include <cctype>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
#define gcu getchar_unlocked
#define pcu putchar_unlocked
#define _T template <typename T>
#define _HT template <typename H, typename... T>
#define _il inline
#define _in _il int in
#define _sc _il bool s... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | 0 |
//http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2676345#1
#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<map>
#include<cstdio>
#include<fstream>
#include<cstring>
using namespace std;
#define rep(i,a) for(int i=0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long long int ll;
typedef pair<long long int, long long int> pii;
typedef pair<double, double> pdd;
#define SORT(c) sort((c).begin(),(c).end())
#define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>())
#define FOR(i,a,b) for(LL i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i=0; i<N; i++) {
cin >> s;
if (S.count(s)) S.at(s) += 1;
else S[s] = 1;
}
int M;
cin >> M;
for (int i=0; i<M; i++) {
cin >> s;
if (S.count(s)) S.at(s) -= 1;
... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n,m;
cin>>n;
map<str,int> a,b;
for(int i=0;i<n;i++)
{
str s;
cin>>s;
a[s]++;
}
cin>>m;
for(int i=0;i<m;i... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int Max=1e6+7;
ll a[Max]; int n,k;
int main(){
ios::sync_with_stdio(0);
scanf("%d%d",&n,&k);
for(int i=1; i<=n; i++) scanf("%lld",&a[i]);
ll ans=0;
//cout<<"OK"<<endl;
if(a[1]>=0) ans=a[k];
else if(a[n]<=0) ans=-a[n-k... | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
//loops
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define... | 1 |
#include <iostream>
using namespace std ;
long long b[102][102] , v , e ;
int main() {
cin >> v >> e ;
for(int i=1 ; i<=v ; i++) {
for(int j=1 ; j<=v ; j++) {
if(i==j) {
b[i][j]=0;
}
else {
b[i][j]=1e18 ;
}
}
}
for(int i= 0 ; i < e ; i++) {
int x , y , z ;
cin >> x >> y >> z ;
... | # include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stac... | 0 |
#include <stdio.h>
#define MAX 100000
using namespace std;
void swap(int A[], int index1, int index2) {
int temp;
temp = A[index1];
A[index1] = A[index2];
A[index2] = temp;
}
int partition(int A[], int p, int r) {
int x = A[r];
int i = p -1;
for(int j = p; j <= r-1; j++) {
if(A[j]... | #include<bits/stdc++.h>
#include<iomanip>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<float> p(N);
for(int i=0; i<N; i++) cin >> p.at(i);
for(int i=0; i<N; i++) p.at(i) = (p.at(i) + 1) / 2;
vector<double> q(N);
q.at(0) = p.at(0);
for(int i=1; i<N; i++) q.at(i) = q.... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
... | /*
https://www.cnblogs.com/SovietPower/p/9757375.html
*/
#include <cstdio>
#include <algorithm>
#define mod 998244353
const int N=1e6;
int fac[N+3],ifac[N+3];
inline int FP(int x,int k)
{
int t=1;
for(; k; k>>=1,x=1ll*x*x%mod)
if(k&1) t=1ll*t*x%mod;
return t;
}
#define C(n,m) (1ll*fac[n+m]*ifac[n]%mod*ifac[m]%m... | 0 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
// #include <bitset>
const int oo=2139063143;
const int N=310;
const int P=1000000007;
using namespace std;
typedef long long LL;
typedef double db;
#define p... | 0 |
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin>>a>>b;
if(a-b>0) cout<<a+a-1<<endl;
else if(b-a>0) cout... | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hel... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
set<int> s;
for(int i = 0; i < n; i++){
//cout << s.size() << endl;
int a; cin >> a;
if(s.count(a))
s.erase(a);
else
s.insert(a);
}
cout << s.size() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int n;
cin >> n;
vector<ll>a(n);
ll sum=0;
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n-1;++i) {
if(a[i]>a[i+1]){
sum+=a[i]-a[i+1];
a[i+1]=a[i];
}
}
cout << sum << endl;
return 0;
}
| 0 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (int)1e9 + 7;
int main() {
int n; cin >> n;
vector<int> a(n);
int sum = 0;
for (auto &ai: a) cin >> ai, sum += ai;
pair<int, int> mi{INF, -1};
for (int i = 0; i < n; i++) {
mi = min(mi, {abs(... | #include <iostream>
#include <map>
#include <string>
using namespace std;
class Dice {
private:
map<char, int> dice;
public:
Dice(int _I, int _II, int _III, int _IV, int _V, int _VI);
int GetNumber(char c);
void roll_E();
void roll_N();
void roll_S();
void roll_W();
};
Dice::Dice(int _I, int _II, in... | 0 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retur... | #include <iostream>
#include <iomanip>
#include <map>
#include <list>
#include <set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned long l... | 0 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// nam... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) <... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
ll n;
cin >> n;
ll ans;
for(int i = 1; i * i <= n; i++){
ans = i*i;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n; cin >> n;
int a,b;
switch (n)
{
case 1:
cout << "Hello World\n";
break;
case 2:
cin >> a >> b; cout << a+b << endl;
break;
}
return (0);
}
| 0 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
ll n, t;
cin >> n >> t;
vector<ll> tv(n);
rep(i, n) {
cin >> tv[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pi... | 1 |
#include <iostream>
using namespace std;
int gcd(int n, int m){
if(n % m == 0) return m;
return gcd(m, n % m);
}
int main()
{
int n;
cin >> n;
int a[100005];
for(int i = 0; i < n; i++) cin >> a[i];
if(n == 1){
cout << "Second" << endl;
return 0;
}
if(n == 2){
... | #include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int a,n,ans=1e9,b;
string s,t;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
b=0;
while(a%2==0){
b++;
a/=2;
}
ans=min(b,ans);
}
cout<<ans<<"\n";
return(0);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1010;
int h, w, a, b, mat[N][N];
ii arr[N];
bool can(int c1, int c2){
for(int i=0 ; i<c2 ; i++)
arr[i] = ii(b, i);
for(int i=c2 ; i<w ; i++)
arr[i] = ii(h-b, i);
sort(arr, arr+w);
memset(mat, 0, s... | #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 h, w, a, b;
cin >> h >> w >> a >> b;
vector<vector<int>> s(h, vector<int>(w));
rep(i, h) rep(j, w) {
if (i < b && j < a || i >= b && j >= a) s[i][j] ... | 1 |
#include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
string a, b, c; cin >> a >> b >> c;
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] != b[i] && b[i] != c[i] && c[i] != a[i]) {
ans += 2;
}
else if ((a[i] == b[i] && b[i] != c[i]) || (b[i] == c[i] && c[i... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false)
int a[200000], vs[200000],vs1[100006],p[300000];
vector<int>v[200000];
queue<int>q;
int f(int n)
{
int i, k=0;
vs[n]=1; q.push(n);
while(q.size()){
n=q.front(); q.pop();
for(i=0; i<v[n].size(); i++){
... | #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 - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... | 0 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
using lint = long long;
template <class T>
T gcd(T a, T b) {
while (b > 0) {
a %= b;
std::swap(a, b);
}
return a;
}
bool solve(int N, std::vector<lint>& A) {
lint sum = std::accumulate(A.begin(), A.end(), 0L... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 6.66;
int arr [ MAXN ];
string player[2] = { "First","Second" };
int main ( ) {
int n; scanf ( "%d",&n ) ;
for ( int i = 0;i<n;i++ ) scanf ( "%d", arr + i ) ;
int cnt[2] = { 0 , 0 };
bool is_one = false;
for ( int i = 0;i<n;i++ ) cnt[arr[i... | 1 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_... | #include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while(cin>>n, n) {
int now, max;
cin>>now;
max=now;
for(int i=1; i<n; i++) {
int t;
cin>>t;
if(now<=0) now=t;
else now+=t... | 1 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
string a;
string b;
string c;
cin >> a >> b >> c;
char turn = a[0];
a.erase(a.begin());
if(a.empty()) {
cout << 'A' << endl;
return 0;
... | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | 1 |
#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;
//const int INF = 1<<29;
//const int MODINF = 1000000007;
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N + 2, 0);
int sum = 0;
rep(i, 1, N + 1) cin >> ... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
void solve(void)
{
int n;
cin >> n;
vector<int> a(n + 2);
rep(i, n) cin >> a[i + 1];
a[0] = 0, a[n + 1] = 0;
int res = 0;
rep(i, n + 1) res += abs(... | 1 |
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[N];
for(int i = 0; i < N; i++){
cin >> a[i];
}
int min= a[0];
int max= a[0];
long long sum= a[0];
for(int i = 1; i < N; i++){
sum += a[i];
if(a[i] < min) min = a[i];
if(a[i] > max) max = a[i];
}
cout << min << " " << max << " " << sum <<... | #include<iostream>
int main(void){
int n, min = 1000000, max = -1000000;
long long sum = 0;
std::cin >> n;
if (n == 0) return 0;
for (int i = 0; i < n; i++){
int x;
std::cin >> x;
sum = sum + x;
if (min > x) min = x;
if (max < x) max = x;
}
std::cout << min << " " << max << " " << sum << std::e... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
const ll MAX = 1e2;
void solve(){
string a, b, c; cin>>a>>b>>c;
int size_a = a.size(), size_b = b.size();
cout<<(a[size_a-1] == b[0] && b[size_b-1] == c[0] ? "YES" : "NO")<<endl;
}
int main(){
solve();
Bye;
} | #include<stdio.h>
int main(){
char a[150];
int x=1;
scanf("%[^\n]", a);
for (int i=0 ; a[i]!='\0' ; i++){
if (a[i]==' '){
if (a[i-1]==a[i+1]){
continue;
} else{
x=0;
break;
}
}
}
printf("%s\n", x==1 ? "YES" : "NO");
return 0;
} | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
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... | /*
* Author: .-O_O-.
*/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)... | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 100010
using namespace std;
int n,l,q;
int a[maxn],tp[maxn][25];
void init(){
int to=1;
for(int t=1;t<=n;++t){
while(to<n&&a[t]+l>=a[to+1])to++;
tp[t][0]=to;
}
for(int t=n;t>=1;--t){
for(int i=1;i<=20;++i){
tp[t][i]=... | #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
//abc_150a();
//abc_151a();
//abc_152a();
//abc_154a();
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout <... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI a(n+2);
a[0]=0;
a[n+1]=0;
for(int i=1;i<=n;i++){
cin >> a.at(i);
... |
#include <iostream>
#include <vector>
#include <cstdio>
//2^32/26 = 165191049.846153846153846 = 165191050
#define MAGIC 0x9D89D8A
char shift (char c, int amount)
{
long n;
long q ;
long r;
n = (long) c - 'a' + amount;
q = n * MAGIC;
q >>= 32;
r = n - q * 26;
return (char) '... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int a, b; cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++) {
string a_tmp, b_tmp;
string ch = to_string(i);
for (int j = 0; j < ch.size(); j++) {
a_tmp.push_back(char(ch[j]));
b_tmp.push_back(char(ch[ch.size() - j-1]));
}
... | //include
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
//using
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
usin... | 1 |
#include <cstdio>
#include <cstdlib>
using namespace std;
const int mod = 998244353;
class inverse {
public:
inverse(int n, int mod);
~inverse();
long long get_inv(int x);
long long get_fact(int x);
long long get_invfact(int x);
long long get_comb(int x, int y);
private:
int ... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 200010, M = 1010, mod = 998244353;
int n, m, k;
int i... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define All(a) (a).begin(),(a).end()
void solve(){
int n;
scanf("%d",&n);
vector<int> a(n),b(n),c(n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++){
scanf("%d",&b[i]);
}
for(int i=0;i<n;i++){
scanf... | 1 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mod 1000000007
#define pb emplace_back
#define mp make_pair
#define fi first
#define sec second
typedef long long ll;
ty... | // #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
// #include<ext/pb_ds/assoc_container.hpp>
// #inclu... | 1 |
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define bug1( x ) {cerr << (#x) <<"="<< x << endl;}
#define bug2( x , y ) {cerr << (#x) <<"="<< (x) << " " << (#y) << "="<< (y) << endl;}
#define bug3( x , y , z ) {cerr << (#x) <<"="<<(x) <<... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using graph=vector<vector<int>>;
void add_directed_edge(graph& G,int u,int v){
G[u].emplace_back(v);
}
vector<int> topological_order(const graph& D){
int n=D.size();
vector<int> deg(n);
rep(u,n) for(int v:D[u]) deg[v]++;
ve... | 1 |
#include <stdio.h>
#include <string.h>
int main ( void ) {
char str[1000], str2[1000], str3[1000], s[7];
int q, a, b;
scanf ( "%s %d", str, &q );
for ( int i = 0; i < q; i++ ) {
scanf ( "%s", s );
if ( strcmp ( s, "print" ) == 0 ) {
scanf ( "%d %d", &a, &b );
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
while( cin >> N , N ){
string L[50];
int P[50], A[50], B[50], C[50], D[50], E[50], F[50], S[50], M[50];
vector< pair<double, string> > ans(N);
for(int i = 0; i < N; i++){
int time = 0, value = 0;
... | 0 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <cstdio>
#include <vector>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100000;
typedef long long ll;
#define pb push_back
int n, s;
int x[N + 5], p[N + 5];
int main() {
#ifdef Wearry
freopen("in", "r", stdin);
freopen("out", "w... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int64_t> A(N);
for(int i=0; i<N; i++) {
cin >> A[i];
}
partial_sum(A.begin(), A.end(), A.begin());
int64_t ans = numeric_li... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 5;
int a[maxn];
ll sum[maxn];
ll rsum(int l, int r)
{
return sum[r] - sum[l-1];
}
signed main(void)
{
ios_base::sync_with_... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int a, b;
int x[4],y[2];
int ans = 0;
int main() {
for(int i = 0; i < 4; i++){
cin >> a;
x[i] = a;
}
for(int i = 0; i < 2; i++){
cin >> b;
y[i] = b;
}
sort(x, x+4);
sort(y, y+2);
reverse(x, x+4);
reverse(y, y+2);
for(... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int a[4];
for(int i=0;i<4;i++) cin>>a[i];
int e,f;
cin>>e>>f;
sort(a,a+4,greater<int>());
if(e<f){
cout<<a[0]+a[1]+a[2]+f<<endl;
}
else{
cout<<a[0]+a[1]+a[2]+e<<endl;
}
return 0;
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#define ll long long
using namespace std;
int main(){
ll x;
cin>>x;
ll d=x/11;
ll r=x%11;
if(0==r){
cout<<2*d<<endl;
}else{
if(r<7){
cout<<2*d+1ll<<endl;
... | #include <iostream>
#include <string>
#include <map>
#include <string.h>
using namespace std;
int main(){
map<char,int> ch;//文字の数字辞書登録
ch['I']=1;
ch['V']=5;
ch['X']=10;
ch['L']=50;
ch['C']=100;
ch['D']=500;
ch['M']=1000;
int ans=0;
int len=0;
char s[1111];
while(cin >> s){
len=strlen(s);
... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <iomanip>
using ll=long long;
using namespace std;
int main(){
int N,K;
cin>>N>>K;
vector<int> P(N+2);
for(int i=0;i<N;i++){
cin>>P[i];
}
int tmp=0;
for(int i=0;i<K;i++){
tmp+=P[i];
}
in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,M,i,a,c = 0;scanf("%lld%lld",&N,&M);
map<ll,ll> mp;
mp[0] = 1;
for(i=0;i<N;i++){
scanf("%lld",&a);
c = (c+a) % M;
if(mp.find(c) != mp.end()) mp[c]++;
else mp[c] = 1;
}
ll ans = 0;
for(auto itr = mp.begin();... | 0 |
#include <iostream>
using namespace std;
int table[100][100];
int memo[100][100];
int w, h;
int xs, ys, xg, yg;
int n;
void solve(int xs, int ys, int c)
{
if( memo[xs][ys] ) {
return;
}
if( !( 0 < xs && xs < w+1 && 0 < ys && ys < h+1 && table[xs][ys] == c ) ) {
memo[xs][ys] = 1;
return;
}
if( xs == xg... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> x(n);
for (int i = 0; i < n; i++) cin >> x[i];
int l;
cin >> l;
vector<vector<int>> dbl(21, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
int ni = upper_bound(begin(x), end(x), x[i] + l) ... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
vector<long long>fact(200550);
long long bigmod(long long a, long long p){
if(p == 0){
return 1;
}
long long ans = bigmod(a, p/2);
ans = (ans * ans) % mod;
if(p % 2 == 1){
ans = (ans * a) % mod;
}
return an... | /*--------------------------------
Author: The Ace Bee
Blog: www.cnblogs.com/zsbzsb
This code is made by The Ace Bee
--------------------------------*/
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#define rg re... | 1 |
#include <iostream>
using namespace std;
int main() {
int n,a,b,pa,pb;
while(pa=pb=0,cin>>n,n){
for(;n;--n){
cin>>a>>b;
if(a>b)pa+=(a+b);
else if(a<b)pb+=(a+b);
else pa+=a,pb+=b;
}
cout<<pa<<" "<<pb<<endl;
}
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define n1 "\n"
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_fro... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void MAIN() {
int n;
cin >> n;
vector<vector<int>> a(3, vector<int>(n));
vector<vector<int>> d(3, vector<int>(n));
for (auto &i : a) {
fo... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 1 |
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
int a[100][100];
bool r[100];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
cin>>a[i][j];
}
}
priority_queue<pa... | #include <iostream>
#include <vector>
#include <queue>
#define to first
#define cost second
const int inf=1e9+7;
using namespace std;
int main(){
int n,tmp,r=0,flag[100]={},v=0;
cin>>n;
vector <pair<int,int> > gl[n];
priority_queue <pair<int,int> ,vector<pair<int,int> >, greater<pair<int,int> > >q;
//for(int... | 1 |
/**Lucky Boy**/
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define maxc 1000000007
#define maxn 100005
#define maxm 1000006
#define pii pair <int,int>
#de... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <cstdlib>
#include <vector>
#include <string>
#include <bitset>
#include <math.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7, INF = 1e18 + 1;
using namesp... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> wa(N + 5, 0);
for (int i = 0; i < M; i++) {
int p;
string s;
cin >> p >> s;
if (wa[p] >= 0 && s == "WA") wa[p]++;
else if (wa[p] >= 0 && s == "AC") wa[p] = wa[p] * (-1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
while(1){
int h,w;
cin >> h >> w;
int diagonal = h*h + w*w;
if(h==0 && w==0) break;
pair<int,int> ans = make_pair(500,500); //first = h , second = w
for(int i=1; i<151; i++){
for(int j=i+1;... | //2004 366 1/1 Thursday
#include <cstdio>
using namespace std;
void today(int mon, int day);
int main()
{
int mon, day;
while (1){
scanf("%d %d", &mon, &day);
if (mon == 0){
break;
}
today(mon, day);
}
return (0);
}
void today(int mon, int day)
{
int tmp = 0;
for (int i = 1; i < mon; i... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
int h,w,ans = 0;
int dx[4] = {-1,0,1,0},dy[4] = {0,-1,0,1};
bool flag = true;
cin >> h >> w;
string s[h];
rep(i,h) cin >> s[i];
rep(i,h){
rep(j,w){... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < min(k, 50); i++){
vector<int> imos(n); //I'll begin the imos method
for(int j = 0; j < n; j++){
int l = max(0, j-a[j]);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,q;
while(cin >> n && n != 0){
cin >> q;
map<int,int> d;
for(int i = 0;i < n; i++){
int m; cin >> m;
for(int j = 0; j < m; j++){
int t; cin >> t;
if(d.find(t) != d.end... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n, q;
while(true){
cin >> n >> q;
if(n == 0)
break;
int m;
vector< vector<int> > sch(n, vector<int>(101, 0));
for(int i=0; i<n; i++){
cin >> m;
for(int j=0; j<m; j++){
int temp;
cin >> ... | 1 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#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 sx,sy,tx,ty;
cin >> sx >> sy >> tx >> ty;
string f="",b="";
rep(i,ty-sy)f.push_back('U');
rep(i,tx-sx)f.p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long sx, long long sy, long long tx, long long ty){
ll dx = (tx - sx);
ll dy = (ty - sy);
string ans = "";
ans = ans + string(dy, 'U') + string(dx, 'R');
ans = ans + string(dy, 'D') + string(dx, 'L');
ans = ans ... | 1 |
//2015
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(void){
int i,ad[4]={0},e=0,f=0,sum=0;
for(i=0;i<4;i++){
cin>>ad[i];
}
cin>>e;
cin>>f;
sort(ad,ad+4,greater<int>());//降順,昇順＝＝sort(ad,ad+4);
for(i=0;i<3;i++){
sum+=ad[i];
}
if(e<f){
sum+=f;
}
else{
sum+=e;
... | /**
* author: zvm
* created: 25.09.2020 13:51:29
**/
#include <bits/stdc++.h>
using namespace std ;
typedef long long int ll ;
const ll INF = 1e18 ;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n ;
cin >> n ;
vector<int> a(n), b(n), c(n);
for( int i = 0 ; i < n ... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) { //最大公約数
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
ll digit_sum(ll a){... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m,x,y;... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int result;
result = 0;
int resultnow;
resultnow = 100;
int a;
for (int i = 0; i < n; i++)
{
cin >> a;
result = 0;
while (a%2==0)
{
a=a/2;
result=result+1;
}
re... | #include <bits/stdc++.h>
#include <iomanip> // setprecision
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
// 辺を何回使うか = x
//
// ### 全ての辺についての x の総和
// sigma(x)
// 辺
// = 辺1のx + 辺2のx + ... 辺nのx
// = 辺の本数 * x
// ### n 個の町から2個を選び、その間にできる辺の数を数える
// ### n=3 の場合、3C2 = (3*2) /... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
const ll mod = 998244353;
ll modpow(ll n,ll r){
ll res = 1;
while(r){
if(r & 1)re... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> L(N);
for(int i = 0; i < N; i++) cin >> L.at(i);
int total = 0;
if(N < 3) cout << "0" << endl;
else
{
for(int i = 0; i < N - 2; i++)
{
for(int j = i + 1; j < N - 1; j++)
{
for(in... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string s;
int w;
cin>>s>>w;
rep(i,s.size()) if(i%w==0)cout<<s[i];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{int A, B; cin >> A >> B;
cout << (B + A - 3) / (A - 1);} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <cmath>
#include <queue>
using namespace std;
using i64 = int64_t;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr i64 MOD = 1000000007;
constexpr... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1000010;
int x,n,fl,ans;
char s[maxn],t[maxn];
queue<int>q;
signed main()
{
cin>>n>>s+1>>t+1;
for(int i=1;i<=n;i++)if(s[i]!=t[i]){fl=1;continue;}
if(!fl)puts("0"),exit(0);
int x=n,y=n;
while(y)
{
while(y>1&... | 0 |
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int cnt[N],ans[N],a[N];
int n,q,bl;
int res;
struct node
{
int l,r,p;
}e[N];
bool cmp(const node &a,const node &b)
{
return (a.l/bl)==(b.l/bl) ? a.r<b.r :a.l>b.l;
}
void remove(int x)
{
if((--cnt[a[x]]... | #ifndef _TEMPLATE_ROOT
#define _TEMPLATE_ROOT
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define repl(i, a, b) for(ll i = a; i < (b); ++i)
#define repd(i, a, b) for(int i = a; i >= (b); --i)
#define repdl(i, a, b) for(ll i = a; i >= (b); --i)
#define all(x) begin(x),... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int i = 1;
while (++i <= n) {
int x = i;
if (x % 3 == 0) {
cout << ' ' << i;
}
else{
while (x > 0) {
if (x % 10 == 3) {... | #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 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
string s;
cin>>s;
vector<string>week={"SAT","FRI","TH... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i< (n); ++i)
const long long INF = 1LL<<58;
// aを常に小さい値にする 大きい値にする
template<class T> bool chmin(T &a, T b){ if(a>b) a = b; }
template<class T> void chmax(T &a, T b){ if(a<b) a = b; }
// 二分探索 前方のindexを返すもの（自分自身を含む） 前方:... | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
vector<vector<ll>> bunkai(ll a){
if(a... | 1 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cmath>
#include<string>
#include<fstream>
using namespace std;
//const int N = 1e3 + 5;
int main(){
int n,d=0,t=0,count=0;
cin >> n;
if (0 <= n&&n <= 2){
cout << 0 << endl;
return 0;
}
while (n)
{
n -=3;
if (n >= 3)
count++;
else{
c... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false) ;
cin.tie(NULL);
int n;
cin>>n;
if(n<=2) cout<<"0"<<endl;
else
{
cout<<n/3<<endl;
}
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define TC ll t; cin >> t; while(t--)
typedef long long ll;
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ll k,x;
cin >> k >> x;
for(ll i=x-k+1;i<=x+k-1;i++)
{
cout << i << " ";
}
return 0;
}... | #include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | 0 |
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
int main()
{
double x, y, x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
x = fabs(x2 - x1);
y = fabs(y2 - y1);
if( x == 0 ) {
cout << fixed << setprecision(5) << y << "\n";
return 0;
} else if( y == 0 ) {
cout << fixed << setprecisi... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using PI = pair<int, int>;
int main() {
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << setprecision(12) << fixed << hypot(abs(x1 - x2), abs(y1 - y2)) << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int l = S.length();
if (l == 1)... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <cstdlib>
using namespace std;
typedef... | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define FPEN freopen("in.txt", "r", stdin);
#define debug(...) \
{ cerr << "# " << __VA_ARGS__ << "\n"; }
#else
#define debug(...)
#define FPEN
#endif
const int maxn = 200009;
typedef long long i64;
typedef pair<i64, i64> pi64;
typedef pair<int, int> pi;
type... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | 1 |
#include<iostream>
#include<queue>
#include<cstring>
typedef std::pair<int, int> P;
int w, h;
int field[100][100];
int xs, ys, xg, yg;
int n;
const int dx[4] = { 0, 1, 0, -1 }, dy[4] = { -1, 0, 1, 0 };
int main()
{
while( std::cin >> w >> h, w | h )
{
memset( field, 0, sizeof( field ) );
std::cin >> xs >> ys ... | #include<stdio.h>
int main(void)
{
int n,pm[10001],pe[10001],pj[10001],i,x[10001],y[10001];
while(1){
scanf("%d",&n);
if(n==0) break;
for(i=0;i<n;i++){
scanf("%d %d %d",&pm[i],&pe[i],&pj[i]);
x[i]=(pm[i]+pe[i])/2;
y[i]=(pm[i]+pe[i]+pj[i])/3;
}
for(i=0;i<n;i++){
if(pm[i]==100||pe[i]==100||pj[i]==... | 0 |
/* C++ */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sy... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) (int)a.size()
#define fi first
#define se second
#define ar array
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int > pii;
const ll MOD =1e9+7;
void solve(){
int n,k,ans... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main(void){
int N,Y;
int c1,c2,c3;
c1 = -1;
c2 = -1;
c3 = -1;
cin >> N >> Y;
for(int a = 0;a <= N;a++){
for(int b = 0;b <= N-a;b++){
int c = N-a-b;
... | #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<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 |
#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++)
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9 * 2;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int count ... | #include<bits/stdc++.h>
using namespace std;
const int maxn=5e5;
const int mod=1e9+7;
int a[maxn+5],num[maxn+5],dp[maxn+5];
int x[1<<20],y[1<<20];
int n;
void update(int &x,int y)
{
x=(x+y)%mod;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]),a[i]^=a[i-1],num[i]=num[i-1]+(a[i]==0);
for(int i... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define MOD 1000000007
#define INF (1<<29)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,i,j,mx,t,x,ans,f[19][19],a[19],b[19];
char s[101];
int main(){
scanf("%lld",&n);
scanf("%s",s+1);
mx=1ll<<n;mx--;
for(t=0;t<=mx;t++){
a[0]=b[0]=0;
for(i=n*2;i>n;i--){
x=n*2-i;
if(t&(1ll<<x))a[++a[0]]=s[i]-'a';
else b[++b[0]]=s[i]-'... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int l[200000+5],r[200000+5],n,m,q,ret[200000+5],sz,p,num1[200000+5],num[200000];
int l1[200000+5],r1[200000+5],vec[600000+5],c[600000+5];
void Add( int x) //树状数组加入
{
for(;x<=sz;x+=(x&-x))
c[x]++; //因为这里只需要1，所以我就写出c[x]++了
}
int Su... | #include <stdio.h>
#include <string.h>
int main(){
char str[1000],ord[10],work[1000];
int q,a,b,i,k;
scanf("%s%d",str,&q);
for(i=0; i<q; ++i){
scanf("%s",ord);
memset( work , '\0' , 1000);
if(strcmp(ord,"replace") == 0){
scanf("%d%d%s",&a,&b,work);
for(k=a; k <= b; ++k)
str[... | 0 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<ran... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head;... | 1 |
#include <iostream>
using namespace std;
bool include3(int n){
while(n!=0){
if(n%10==3){
return true;
}
n = n /10;
}
return false;
}
void call(int n){
for(int i = 1; i <= n; i++){
if( i % 3 == 0 || include3(i) ){
cout << " " << i;
}
}
cout << endl;
}
int main()
{
int num;
cin>>num;
call(num)... | #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;
cin >> s;
string ans = "AC";
if(s[0] != 'A'){
ans = "WA";
}
int cnt = 0,... | 0 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,w) for (int i = 0;i < (w); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n;cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
deque<int> d;
int ans = 0;
f... | #include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << ... | /**
* This code has been written by YueGuang, feel free to ask me question. Blog: http://www.yx.telstudy.xyz
* created:
*/
#include <cstdio>
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#define REP(i, a, b) for(int i = a; i < b; i+... | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans,n,m,k,a[200001],d[200001],b[200001],c[200001],nt[200001];
void ksm(){
ll i;
while(k){
if(k&1){
for(i=1;i<=n;i++)nt[i]=b[c[i]];
for(i=1;i<=n;i++)b[i]=nt[i];
}
for(i=1;i<=n;i++)nt[i]=c[c[i]];
for(i=1;i<=n;i++)c[i]=nt[i];
k/=2;
}
}... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
int GCD(int a,int b){
if(b == 0)return a;
return GCD(b,a%b);
}
int main(void){
int H,W;
cin >> H >> W;
int a[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;... | 0 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;
const int INF=pow(2,31)-1;
std::vector<P> v(1e6,P(INF,-1));
int N=1;
void update(int a,int b,int c,int d,int k,int l,int r){
if(r<=a||b<=l)return;
if(a<=l&&r<=b)v[k]=P(c,d);
else{
update(a,b,c,d,k*2+1,l,(l+r)/2);
... | #include <bits/stdc++.h>
using namespace std;
bool upd[(1<<18)];
int val[(1<<18)];
void Set(int a,int b,int x,int k=0,int l=0,int r=(1<<17)){
if(b<=l || r<=a)return;
if( r-l>1 && upd[k] ){
upd[k*2+1] = upd[k*2+2] = 1;
val[k*2+1] = val[k*2+2] = val[k];
}
upd[k]=0;
if(a<=l && r<=b){
upd[k]=1;
val[k]=x... | 1 |
#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>;
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X, Y;
cin >> X >> Y;
int ans =0;
if(X>Y){
if(X*Y>0){
ans += X-Y+2;
}
else ans += max(X, -Y)-min(X, -Y)+1;
}
else{
if(X*Y>=0){
ans += Y-X;
}
else ans += max(-X, Y)-min(-X, Y)+1;
}
cout << ans << e... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
int dp[45][(1 << 17) + 5];
int main() {
int n, X, Y, Z;
cin >> n >> X >> Y >> Z;
int ban = (1 << Z - 1) | (1 << Y + Z - 1) | (1 << X + Y + Z - 1);
dp[0][0] = 1;
for(int i = 0; i < n; ++i) {
for(int j = 1; j < 11; ++j) {
for(int S = 0; S < 1 ... | #include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#inc... | 1 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){... | #include <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... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.