code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 998244353
using namespace std;
ll fn(ll n, ll p) { return n - n % p; }
int main() {
ll k;
cin >> k;
vector<ll> a(k);
for(int i = 0; i < k; i++) {
cin >> a[i];
}
ll ans1, ans2;
ll l = 0, r... | 0 | 10,455,956 |
#include<bits/stdc++.h>
int main(){
int n;
std::cin>>n;
std::vector<int> v(n);
for(int i=0;i<n;i++){
std::cin>>v[i];
}
long long ans=0;
int cur=0;
for (int i=0;i<n;i++){
ans+=(v[i]+cur)/2;
if (v[i]!=0)
cur=(v[i]+cur)%2;
else
cur=0;
}
std::cout<<ans<<"\n"... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int h... | 0 | 19,806,654 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll n,k;
cin>>n>>k;
vector<ll> cnt(1e5+1);
for(i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i,x) cin >> a[i];
rep(i,y) cin >> b[i];
rep(i,z) cin >> c[i];
vec... | 0 | 86,067,601 |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 1 << 26;
int dp[maxn], opt[200010], pre[200010], cnt[26], INF = 1e9;
char s [200010];
int main()
{
for(int i = 1; i < maxn; i++)
dp[i] = INF;
scanf("%s", s + 1);
int n = strlen(s + 1);
for(int i = 1; i <= n; i++) ... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include... | 0 | 20,196,359 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
double x1,y1,x2,y2,x3,y3,x4,y4;
int n;
cin >> n;
for(int i=0;i<n;i++){
scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
x2-=x1; y2-=y1;
x4-=x3; y4-=y3;
if(x2*y4-y2*x4==0) printf("YES\n");
else printf("NO\n");
}
... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 31,781,109 |
#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 __... | #include <iostream>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30
using namespace std;
t... | 0 | 88,017,306 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin>>n>>k;
if(k>1 && k!=n)
cout<<n-k<<endl;
else
cout<<0<<endl;
} | #include "bits/stdc++.h"
using namespace std;
struct Node{
int parent,left,right;
};
Node T[100005];
int n,D[1000005];
void setDepth(int u, int p){
D[u]=p;
if(T[u].right!=-1){
setDepth(T[u].right,p);
}
if(T[u].left!=-1){
setDepth(T[u].left,p+1);
}
}
int main(){
int i=0,j=0,k=0,c=0,l=0,r=0,Tc=0;
... | 0 | 81,849,713 |
#include<bits/stdc++.h>
#define REP(i,b,e) for(int i=b; i<e; i++)
int main(){
int n, m;
scanf("%d %d", &n, &m);
int dist[n][n], a[m], b[m], c[m];
REP(i, 0, n) REP(j, 0, n) dist[i][j] = 1e9;
REP(i, 0, m){
scanf("%d %d %d", &a[i], &b[i], &c[i]);
a[i]--, b[i]--;
dist[a[i]][b[i]] = c[i];
dist[b[i]][a[i]] = c[i... | #include <iostream>
#include <stdio.h>
#include <string>
#define MAX_N 100'000
using namespace std;
bool A[MAX_N]{};
int B[MAX_N]{};
int main() {
int N, M;
cin >> N >> M;
int cnt = 0;
for (int i = 0; i < M; ++i) {
int p;
string S;
cin >> p >> S;
if (!A[p - 1]) {
if (S == "AC") {
++... | 0 | 42,381,008 |
#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 ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int main() {
int n, m;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void){
int n, a[10005], b[10005]... | 0 | 23,786,356 |
#include <bits/stdc++.h>
using namespace std;
int arr[200010];
long long sum[200010];
int main()
{
int n, i;
scanf("%d", &n);
for(i = 1; i <= n; i++)
scanf("%d", &arr[i]);
for(i = 1; i <= n; i++)
sum[i] = sum[i - 1] + arr[i];
long long r = 1e18;
for(i = 1; i < n; i++)
r =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 200000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
typedef int64_t ll... | 0 | 78,415,655 |
#include<bits/stdc++.h>
#define pb emplace_back
#define int long long
#define vi vector<int>
#define pii pair<int,int>
#define mp(x,y) make_pair(x,y)
#define vp vector<pair<int,int>>
#define setbits(x) __builtin_popcountll(x)
#define f first
#define se second
#define iniz(n) memset(n,0,sizeof(n))
#define inin(n) memset... | #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,917,656 |
#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 EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
#define max(x, y) ((x... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
int N,M;
cin >> N >> M;
int P[M];
string S[M];
REP(i,M) cin >> P[i] >> S[i];
int ac = 0;
int wrong[N];
int ... | 0 | 53,325,202 |
#include<bits/stdc++.h>
#define fst first
#define snd second
#define pb push_back
#define mp std::make_pair
#define FOR(i,a,b) for(auto i=(a);i<(b);++i)
#define RFOR(i,a,b) for(auto i=(a);i>=(b);--i)
#define REP(i,a) for(long i=0;i<(a);++i)
#define RREP(i,a) for(long i=(a);i>=0;--i)
#define EACH(i,a) for(auto (i)=(a).b... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 6,115,998 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d",&x);
int main(){
int n; sc(n)
vector<int> A(n);
for (i... | #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>;
#define INF 100000000
int main()
{
int n;
cin>>n;
int count = 0;
for(int i=1;i<=n;i++)
{
int even=0;
int num = i;
while(num)
{
... | 0 | 74,011,174 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
using ll = long long int;
ll n; string s;
ll midnum(int i,int j){
set<int> s_mid;
for(int k=i+1; k<j; k++){
int i3=(int)s[k]-48;
s_mid.insert(i3);
}
return s_mid.size();
}
int main() {
cin>>n>>s;
vector<int... | #include <stdio.h>
#include <iostream>
using namespace std;
int main(){
int a,b;
double f;
cin >> a >> b;
f =(double)a/b;
printf("%d %d %lf\n",a/b, a%b, f);
return 0;
} | 0 | 92,387,268 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> d(N);
for(int i = 0; i < N; i++) cin >> d[i];
int sum = 0;
for(int i = 0; i < N; i++){
for(int j = i + 1; j < N; j++) sum += d[i] * d[j];
}
cout << sum << endl;
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define between(a,x,b) ((a)<=(x)&&(x)<=(b... | 0 | 46,933,955 |
#include <iostream>
using namespace std;
int main() {
int m, f, r;
bool loop = true;
while (loop) {
cin >> m >> f >> r;
int sum = m + f;
if ((m == -1) && (f == -1) && (r == -1)) {
loop = false;
} else if ((m == -1) || (f == -1)) {
cout << 'F' << endl;
} else if (sum >= 80) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 0 | 301,984 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define MOD 1000000007
#define int long long
#define vi vector<long long int>
#define pb push_back
#define rep(i,a,n) for (int i=(a);i<(n);++i)
using namespace __gnu_pbds;
using namespa... | #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;... | 0 | 100,058,418 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;
int N, K, s;
ll sum, ans, a;
int main()
{
cin >> N >> K;
vector<ll> T, S;
T.push_back(0);
S.push_back(0);
for (int i = 0; i < N; i++)
{
... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
ll M = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
... | 0 | 100,065,412 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <algorithm>
int main()
{
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::unordered_map<int, int> mapa;
mapa.insert(std::make_pair(0, 0));
std::string str;
std::getline(std::cin, str);
int n = str.length();
int xoring = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
int64_t GCD(int64_t a, int64_t b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main() {
int64_t N, X;
cin >> N >> X;
vector<int64_t> x(N+1);
for ( int64_t i = 0; i < N; ++i){
cin >> x[i];
}
x[N] = X;
sort(x.begin(),x.e... | 0 | 39,363,902 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> ... | 0 | 99,288,131 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,e,f,g,h,i,j,k,l,m,n,t,prothom,boro;
cin>>n>>k;
cin>>a;
boro=a;
for(int i=1;i<n;i++)
{
cin>>b;
a=__gcd(a,b);
boro=max(boro,b);
}
if(k<=boro && k%a==0)
{
cout<<"POSSIBLE"<<endl;
}
else
{
cout<<"IMPOSSIBLE"<<e... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
using ll = long long;
int main(){
int a,b;
std::cin >>a >> b;
std::string ans = "Impossible";
if((a+b)%3==... | 0 | 80,527,573 |
#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, ll> 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; } ret... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 41,541,515 |
#include <bits/stdc++.h>
using namespace std;
string s;
void solve() {
int values[26] = {0};
for (char i : s) {
values[i - 'a']++;
}
for (int i = 0; i < 26; i++) {
if (values[i] == 0) {
printf("%c\n", 'a' + i);
return;
}
}
printf("None\n");
}
int m... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | 0 | 12,549,916 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define loop(i,n) rep(i,0,n)
using namespace std;
using ll = long long;
ll sum_a[100001],sum_aplus[100001];
int main(){
int n,k;
cin >> n >> k;
sum_a[0]=0;
sum_aplus[0]=0;
loop(i,n){
ll a;
scanf("%lld",&a)... | #include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
struct point
{
double x,y;
};
void koch(int n,point p1,point p2)
{
if(n==0) return;
point s,t,u;
double th=M_PI*60/180;
s.x=(2*p1.x+p2.x)/3;
s.y=(2*p1.y+p2.y)/3;
t.x=(p1.x+2*p2.x)/3;
t.y=(p1.y+2*p2.y)/3;
u.x=(t... | 0 | 17,053,709 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 61,954,648 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int,int>;
template<class T>bool chmax(T &a, const T &b) { if (a<... | #include<cstdio>
long long x[100005];
long long y[100005];
const long long mod = 1e9+7;
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++){
scanf("%lld",&x[i]);
}
for(int i=0;i<m;i++){
scanf("%lld",&y[i]);
}
long long sumx = 0;
for(int i=0, j=n-1;j>i;i++,j--){... | 0 | 86,518,977 |
#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>
#inclu... | #include<iostream>
#include<vector>
#include<climits>
using namespace std;
vector<long> p;
vector<long> c;
int main(){
long n,k;
cin >> n >> k;
p.resize(n);
c.resize(n);
for(int i = 0;i < n;i++){
cin >> p[i];
p[i]--;
}
for(int i = 0;i < n;i++){
cin >> c[i];
}
... | 0 | 15,966,543 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, y;
cin >> n >> y;
int cnt_10000 = -1, cnt_5000 = -1, cnt_1000 = -1;
for(int i = 0; i <= n; i++){
for(int j = 0; j + i <= n; j++){
int k = n - i - j;
int ans = 10000 * i + 5000 * j + 1000 * k;
if(ans == y){
cnt_10000 = ... | #include <bits/stdc++.h>
using namespace std;
char C[36][3];
char Cb[36][3];
char Cs[36][3];
int Ib[36];
int Is[36];
int N;
bool is_stable(char c[][3], int ind[]){
char num='1';
for (int i=1; i<N; i++) {
if (c[i][1] == num) {
if (ind[i-1] > ind[i]) {
return false;
... | 0 | 98,353,026 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 24,268,433 |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define ... | #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() {
string s,ans="WA";
cin>>s;
map<string,int> cnt;
if(s[0]=='A'){
for(int i=2; i<s.size()-1; i++){
if(s[i]=='C'){
cnt["C"]++;
}
}
if(cnt["C"]==1){
... | 0 | 20,188,980 |
#include <stdio.h>
int main()
{
int n1=0,n2=0,n3=0;
scanf("%d %d %d",&n1,&n2,&n3);
if(n1<n2&&n2<n3)
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=100005,maxm=400005;
int last[maxn],pre[maxm],other[maxm],t,cal[maxn],vis[maxn],q[maxn],head,tail;
int n,m,x,y;
void add(int x,int y)
{
++t;
pre[t]=last[x];
last[x]=t;
other... | 0 | 3,911,588 |
#include <iostream>
#include <vector>
#include <cmath>
#include <bits/stdc++.h>
using namespace std;
const int N = pow(10,5);
vector<bool> isp(N+1, true);
void sieve() {
isp[0] = false;
isp[1] = false;
for (int i=2; pow(i,2)<=N; i++) {
if (isp[i]) for(int j=2; i*j<=N; j++) isp[i*j] = false;
}
}
int main() {... | #include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" << ... | 0 | 57,640,047 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
vector<ll> a(n);
for(int i=0;i<n;i++){
ll ai;
cin>>ai;
a[i]=ai-i-1;
}
sort(a.begin(),a.end());... | #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>
#incl... | 0 | 60,643,139 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
using ll=long long;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=1e9+5;
const ll INF=1e18+5;
using P=pair<int,int>;
int dx[4]={1,0,-1,0... | #include <bits/stdc++.h>
#define append push_back
#define L first
#define R second
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const long long M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9,... | 0 | 14,288,698 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <string>
using namespace std;
int main(){
string str;
vector<string> out;
int N;
cin >> str >> N;
for(int i=0;i<N;i++){
int a, b;
string instr, p;
cin >> instr;
if(instr == "print"){
c... | 0 | 11,011,406 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
for (int i = 0; i <s.size(); i++) {
cout << s[i];
if (i == 3) cout << " ";
}
cout << "\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if ... | 0 | 6,335,393 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
const long long MOD = (long long)1e9 + 7;
int main(){
int n;
long long ans = 1;
cin >> n;
vector<long long> t(n + 2), a(n + 2);
for(int i = 1; i <= n; i++){
cin >> t[i];
}
for(int i = 1; i <= n; i... | #include <bits/stdc++.h>
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long fibonatti(long long d){
long long count = 0;
... | 0 | 12,362,298 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, w,mins = 10000000;
cin >> n;
vector<int>rui(n + 1, 0);
re... | #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'
co... | 0 | 70,859,304 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a;
cin>>n;
std::deque<int> deq;
deq.emplace_back(0);
int sum=0;
for (int i=0;i<=n;i++) {
if (i!=n) {
cin>>a;
deq.emplace_back(a);
sum+=abs(deq[i]-deq[i+1]);
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++)
{
cin >> s.at(i);
}
int xabx = 0, bxxa = 0, xxxa = 0, bxxx = 0;
for (int i = 0; i < N; i++)
{
string si = s.at(i);
for (int j = 0; j < ... | 0 | 25,220,097 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
while(true){
int n,k;
cin>>n>>k;
if(n==0 && k==0){
break;
}
int a[n],sum=0;
for(int i=0;i<n;i++){
... | 0 | 65,101,799 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define REP(i, a, n) for(int i=a; i<n; ++i)
#define pb push_back
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const double PI = 3.141592... | # include <cstdio>
# include <cstring>
# define MAX 10005
const int maxn = 2000000 + 10;
int a[maxn], b[maxn], c[MAX];
void CountingSort(const int A[], int B[], const int k, const int n) {
for (int i = 1; i <= n; i++)
c[A[i]]++;
for (int i = 1; i <= k; i++)
c[i] = c[i] + c[i - 1];
for (int i... | 0 | 79,822,315 |
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
... | #include <iostream>
#include <set>
int main()
{
int s; std::cin >> s;
std::set<int> ss;
ss.insert(s);
int cnt = 1;
while (true) {
s = ((s%2) == 0)?(s/2):(3*s+1);
cnt++;
if (ss.find(s) != ss.end()) {
break;
}
ss.insert(s);
}
std::cout << cnt... | 0 | 29,782,677 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main(){
int n; cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
sort(a, a+n);
int a_i = a[n-1];
int t1 = *lower_bound(a, a+n, (a_i+1)/2);
int t2 = *(lower_bound(a, a+n, (a_i+1)/2) - 1);
int a_j = -1;
if((a_i+1)/2 - t2 <= t1 - ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e+9 + 5;
const int MAX = 205;
vector<vector<ll> > d(MAX, vector<ll>(MAX, INF));
void floyd() {
for (int k = 0; k < MAX; k++) {
for (int i = 0; i < MAX; i++) {
for (int j = 0; j < MAX;... | 0 | 71,268,126 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
string c1, c2;
int ans1=0, ans0=0;
for(int i=0; i<s.size(); i++){
if(i%2 == 0){
if(s[i] == '0'){
ans1++;
}else{
ans0++;
}
}else{
... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ii = pair<int, int>;
struct UnionFind {
vi p, sz;
int n;
UnionFind(int n): n(n) {
p.resize(n);
sz.assign(n, 1);
for (int i = 0; i < n; i++)
p[i] = i;
}
int find_set(int u) {
return p[u] = u == p[u] ? u : find_set... | 0 | 99,074,539 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define ALL(s) s.begin(),s.end()
#define P pair<ll,ll>
#define vl vector<ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvl vector<vector<ll>>
#define print(n) cout<<n<<endl
const int M=100010;
const int MOD=100000000... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
string S; cin >> S;
vector<set<int>> x(10);
for(int i = 0; i < N; i++){
int d = S[i] - '0';
x[d].insert(i);
}
int ans = 0;
for(int a = 0; a <= 9; a++){
for(int b = 0; b <= 9; b++){
... | 0 | 31,014,607 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,m,v,p,x,y,z;
cin>>n>>m>>v>>p;
long long int a[n];
long long int s[n];
int i;
for(i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n,greater<long long int> ());
int ans=p;
s[p-1]=0;
for(i=p;i<n;i++)
{
s[i]=s[i-1]+a[p-1]-a[i];
}
for(i=p;i<n;... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef... | 0 | 83,769,036 |
#include <iostream>
int main() {
std::ios_base::sync_with_stdio(false);
int alphas[26];
std::fill_n(alphas, 26, 0);
char c;
while (! (std::cin >> c).eof() ) {
int idx = tolower(c) - 'a';
if (0 <= idx && idx < 26) alphas[idx]++;
}
for (int i = 0; i < 26; i++) {
c = (ch... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i,n){
cin >> a[i];
}
int l = 0, r = 0;
int now = 0;
ll ans = 0;
while(l<n){
wh... | 0 | 29,319,243 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | #include <bits/stdc++.h>
using namespace std;
#define MAX 1000000
int main() {
int A, B, M, i, j, min, price;
cin >> A >> B >> M;
vector<int> fr(A);
vector<int> mr(B);
vector<vector<int>> discount(M, vector<int>(3));
for (i = 0; i < A; i++) cin >> fr.at(i);
for (i = 0; i < B; i++) cin >> mr.... | 0 | 34,763,481 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d;
d = 0;
cin >> a >> b >> c;
while (a <= b){
if (c % a == 0){
d = d+1;
}
a = a+1;
}
cout << d <<endl;
return 0;
} | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
using namespace std;
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
int N;
string s;
cin >> N >> s;
int sum = 0;
for(int i = 0; i < 10; i++) {
for(int l = 0; l < N; l++... | 0 | 28,347,061 |
#include <iostream>
#include <utility>
using namespace std;
int main(void){
int A[4],B[4],sumA=0,sumB=0;
for(int i=0; i < 4; i++){
cin >> A[i];
sumA+= A[i];
}
for(int i=0; i < 4; i++){
cin >> B[i];
sumB+=B[i];
}
cout << max(sumA,sumB) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> a(M);
for(int i = 0; i < M; i++){
int k;
cin >> k;
a.at(i).resize(k);
for(int j = 0; j < k; j++){
cin >> a.at(i).at(j);
a.at(i).at(j)--;
}
}
vector<int... | 0 | 35,652,875 |
#include <cmath>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
int n, m;
cin >> n >> m;
ll sum = 0;
vector<P>p(n);
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p.begin(), p.e... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
int n, m;
cin >> n >> m;
priority_queue<int> pq;
while (n--)
{
int x;
cin >> x;
pq.push(x);
}
while (m--)
{
int t = pq.top();
pq.pop();
... | 0 | 91,983,672 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;cin>>n>>m;
vector<int> a[100001];
for (int i=0;i<n;i++) {
int b,c;cin>>b>>c;
a[b].push_back(c);
}
int ans=0;
priority_queue<int> q;
for (int i=1;i<=m;i++) {
for (int x:a[i])
... | #include "bits/stdc++.h"
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define LOWER_BOUND(A, key) distance(A.begin(),... | 0 | 2,945,063 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 998244353;
const int Inv2 = (MOD+1)/2;
signed main(){
int n;
cin>>n;
int a[(1<<n)],b[(1<<n)]={},c[(1<<n)]={},p[4];
for(int i=0;i<(1<<n);i++)cin>>a[i];
for(int i=0;i<(1<<n);i++){
b... | 0 | 50,111,556 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
vector<ll>a,b;
for(ll i=0;i<n;i++){
ll x;
cin>>x;
a.push_back(x);
b.push_back(x);
}
sort(b.begin(),b.end());
ll ans=0;
for(ll i=0;i<n;i++){
ll now=a[i];
auto itr=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n, k;
... | 0 | 59,372,534 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww{cww(){ios::sync_with_stdio(fa... | #include<bits/stdc++.h>
using namespace std ;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define ar array
#define inf() ifstream cin("d.txt")
#define onf() ofstream cout("test.txt")
#define mod 1000000007
#define pb push_back
#define... | 0 | 94,109,043 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define INF (int)1e9+4
#define INFL (ll)1e18+4
#define md (int)1e9+7
#define mx 10000000
#define mk make_pair
#define pi pair<int,int>
#define ss second
#define ff first
#define pb emplace_back
#define onell(x) __builtin_pop... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define... | 0 | 37,624,445 |
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <list>
#include <cassert>
#include <ctime>
#include... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define fi first
#define se second
#define in insert
#define mp make_pair
#define GCD(a,b) __gcd(a,b);
#define endl "\n"
#define FRU f... | 0 | 14,440,146 |
#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= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string a,b;cin >>a;
ll n=a.size();
for (int i = 0; i < n; ++i) {
if(a[i]... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
int N,M;
vector<P> graph[200010];
vector<int> dist;
bool dfs(int now, int d){
dist[now] = d;
for(auto p:graph[now]){
i... | 0 | 26,811,386 |
#include <iostream>
using namespace std;
int main(void)
{
int k,n,i,max,ans;
cin>>k>>n;
int a[200000];
for(i=0;i<n;i++){cin>>a[i];}
int b[200000];
for(i=0;i<n-1;i++){b[i]=a[i+1]-a[i];}
b[n-1]=a[0]+k-a[n-1];
max=0;
for(i=0;i<n;i++) {if(b[i]>max)max=b[i];}
ans=k-max;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | 0 | 25,471,989 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,k;
string s;
int main(){
cin >> n >> k;
cin >> s;
vector<ll> vec;
if(s[0]=='0') vec.push_back(0);
for(ll i=0;i<n;){
ll j=i;
while(j<n&&s[j]==s[i]) j++;
vec.push_back(j-i);
i=j;
}
if(s[n-1... | 0 | 78,822,567 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define fi frist
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 80,566,180 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxx=300;
int main(){
int n;
cin>>n;
int A[maxx];
for(int i=1;i<=n;i++) cin>>A[i];
for(int i=1;i<=n;i++){
printf("node %d: key = %d, ",i,A[i]);
if(i/2>0) printf("parent key = %d, ",A[i/2]);
if(2*i<=n) printf("left key =... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 35,558,761 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> t(N+2, 0), v(N+2, 0);
for(int i = 1; i <= N; i++) cin >> t[i];
for(int i = 1; i <= N; i++) cin >> v[i];
vector<int> l(N+2, 0), r(N+2, 0);
for(int i = 2; i < N+2; i++) l[i] = l[i-1] + t[i-1];
for(int i... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair ... | 0 | 38,299,682 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> V(1000);
void print(ll x) {
cout << "node " << x << ": key = " << V[x] << ", ";
if (x > 1) {
cout << "parent key = " << V[x / 2] << ", ";
}
if (x * 2 <= N) {
cout << "left key = " << V[x * 2] << ", ";
}
if (x * 2 + 1 <= N) {
... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 42,543,604 |
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <functional>
#include <map>
#include <math.h>
#include <list>
using namespace std;
#define mod 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
long long int... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define pb push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define s... | 0 | 23,615,838 |
#include<bits/stdc++.h>
using namespace std;
int main(){
const int mod=1000000007;
int n,m;
cin>>n>>m;
int s[n],t[m];
for(int i=0;i<n;i++)cin>>s[i];
for(int i=0;i<m;i++)cin>>t[i];
vector<vector<long long>>dp(n+1,vector<long long>(m+1,0));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#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 ... | 0 | 49,578,175 |
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <cstdio>
#include <set>
#include <stack>
#include <queue>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (ll... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll n,m;
cin >> n >> m;
vector<pair<ll,ll>> v(n);
REP(i,n){
int a,b;
cin >> a >> b;
v[i].firs... | 0 | 37,625,664 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double... | #include <bits/stdc++.h>
#define check(x) cout<<(#x)<<": "<<x<<" ";
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ss second
#define ff first
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ld long double
#define all(c) (c).begin(), (c).end()
#define FOR(i, a, b) fo... | 0 | 52,635,778 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, m, n) for (int i = m; i < n; i++)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double... | #include <algorithm>
#include <bits/stdc++.h>
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
#define INF 100000000000000000
int main() {
string s;
cin >> s;
vector<ll> A(26);
rep(i, s.size()) { A[s[i] - 'a']++; }
r... | 0 | 55,046,894 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int N;
string s[100007];
int main(){
cin >> N;
for(int i = 0;i < N;i++) {
cin >> s[i];
sort(s[i].begin(),s[i].end());
}
sort(s,s + N);
long long int ans = 0;
long long int j = 0;
for(int i = 0;i <... | #include <bits/stdc++.h>
#define ls (o << 1)
#define rs (o << 1 | 1)
#define mid ((L + R) >> 1)
using namespace std;
typedef long long LL;
const int N = 25;
int dp[N][N];
int dfs(int a, int b) {
if (~dp[a][b]) return dp[a][b];
vector<int> nxt;
for (int i = 1; i + i <= a; ++i) {
nxt.push_back(dfs(a - i - i, b + i))... | 0 | 16,188,605 |
#include<iostream>
int main(){
int na,nb,nc;
std::cin>>na>>nb>>nc;
if(na < nb && nb < nc)
std::cout<<"Yes"<<std::endl;
else
std::cout<<"No"<<std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool count_black(vector<vector<char>> &array,int k){
int black = 0;
for(int i=0;i<array.size();i++){
for(int j=0;j<array.at(0).size();j++){
if(array.at(i).at(j) == '#') black++;
}
}
return black == k;
}
void show(vector<vector<cha... | 0 | 65,592,972 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
ll n,H,W,x,y;
ll cnt = 0;
int main(){
ios... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int n;
cin >> n;
vi a(n+1);
vi b(n);
ll sum = 0;
rep(i,n+1){
cin >> a.at(i);
sum += a.at(... | 0 | 43,759,022 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#inclu... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <utility>
#include <climits>
#include <string>
typedef long long ll;
using namespace std;
string shuffle(string s, int x){
string s1, s2;
for(auto itr = s.begin(); itr < s.begin()+x; itr++){
s1 += *itr... | 0 | 29,761,995 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 24,855,646 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int N; string S;
cin >> N >> S;
long long r ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; 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; cin>>n>>m;
vector<l... | 0 | 56,546,929 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define debug(var) do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cerr << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cerr << e << " "; } std::cerr << std::endl;}
te... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
int main() {
int N,K;
cin >> N ... | 0 | 59,492,336 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve(void)
{
string s;
cin >> s;
string ans = "";
deque<char> q;
rep(i, s.size())
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
... | 0 | 44,543,247 |
#include <bits/stdc++.h>
const char nl = '\n';
using namespace std;
using ll = long long;
using ld = long double;
const int N = 1e5+10;
ll n, m, v, p;
int a[N];
bool check(int x) {
ll score = a[x] + m;
ll rem = 1LL * (v-1) * m;
int k = 0;
for (int i = 0; i < n; i++) {
if (i == x) continue;
if (a[i] > s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 0 | 16,834,975 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n; scanf("%d",&n);
vector<int> a(n); rep(i,n) scanf("%d",&a[i]);
sort(a.begin(),a.end());
int cnt=0;
rep(i,n) if(i>0 && a[i-1]==a[i]) cnt++;
printf("%d\n",n-(cnt+1)/2*2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 33,926,576 |
#include<iostream>
#include<sstream>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<numeric>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define all(r) (r).begin()... | #include<iostream>
using namespace std;
typedef struct DICE{
int s[6];
}dice;
dice dice_rotate(dice d, char rotate){
int swap;
if(rotate == 'E'){
swap = d.s[2];
d.s[2] = d.s[0];
d.s[0] = d.s[3];
d.s[3] = d.s[5];
d.s[5] = swap;
}else if(rotate == 'N'){
swap... | 0 | 4,284,411 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define endl "\n"
#define oo 0x3f3f3f3f3f3f3f3fLL
#define pb push_back
#define loop(i,n) for(int i = 0;i < int(n);i++)
#define range(i,a,b) for(int i = int(a);i <= int(b);i++)
#define sz(s) (int)(s.size... | 0 | 66,707,989 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
using namespace std;
const lon... | #include <iostream>
#include <iomanip>
using namespace std;
int main()
{
while(1){
int a,b,i,j;
cin >> a >> b;
if(a==0 && b==0){
break;
}
else{
for(j=0; j<a; j++){
for(i=0; i<b; i++){
if(i==(b-1)){
... | 0 | 87,400,181 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double PI = 3.1415926535897932384;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct UnionFind... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
using namespace std;
int main(){
int n,a;
string s;
cin>>n>>s;
a=s.size();
if(a<=n){
cout<<s<<endl;
}
else{
s[n]='.';
s[n+1]='.';
s[n+2]='.';
for(int i=0;i<n+3;i+... | 0 | 63,297,671 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, M; cin >> N >> M;
priority_queue<ll> pq;
for (int i = 0; i < N; ++i) {
ll a; cin >> a;
pq.push(a);
}
for (int i = 0; i < M; ++i) {
ll highest = pq.top(); pq.pop();
pq.push(highest /... | #include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
ll gcd(ll a , ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll lcm(ll... | 0 | 52,168,998 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 89,162,336 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... | 0 | 92,524,640 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
if (n == 1 || m == 1) {
if (n == 1 && m == 1) {
cout << 1 << endl;
return 0;
}
cout << max(0LL, max(n, m) - 2) << endl;
return 0;
} else if (n ... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 31,030,549 |
#include <bits/stdc++.h>
#define fr first
#define se second
#define r_0 return 0
#define ll long long
#define pb push_back
#define TIME ios_base::sync_with_stdio(0);
using namespace std;
const long long INF = 1e7;
const long long N = 5e5 + 7;
const long long mod = 1e9 + 7;
const long double eps = 1E-7;
long long cnt, n... | #include<iostream>
#include<queue>
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 1000;
const int MAX_M = 1000;
const int MAX_T = 9;
const int INF = 100000000;
int n, m, t;
int sx, sy;
int ans = 0;
char field[MAX_N][MAX_M];
int d[MAX_N][MAX_M];
P factory[MAX_T];
int dx[4] = {0, -1, 0, 1}, dy[4] = {-1,... | 0 | 99,628,746 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)
using namespace std;
int main(void){
int student = 0;
int maxN,minN = 0;
int gap = 0,gapMa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep_lr(i,l,r) for(int i=(l);i<(r);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<int, int, int> T;
constexpr int INF... | 0 | 10,444,062 |
#include<bits/stdc++.h>
using namespace std;
long long a[200010];
int main(){
long long n,s,t=1,ans=0;
int i;
scanf("%lld",&n);
scanf("%lld",&s);
a[0]=s;
for (i=1;i<n;i++)
scanf("%lld",&a[i]);
i=1;
long long k=0;
ans=1;
while (i<n)
{
if ((s^a[i])==s+a[i])
{
s^=a[i];
i++;
t++;
ans+=t;... | #include <stdio.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(... | 0 | 19,775,974 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
typedef pair<ll, int> P;
int main(){
int N; cin >> N;
int a[N+1], b[N+1];
for(int i=1; i<=N; i++){ a[i] = 20000*i; b[i] = 20000*(N-i+1); }
for(int i=0; i<N; i++){
int p; cin >> p;
a[p] += i; b[p] += i;
}
for(int i=1; i<=N; i++){
cout << a[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
int n, m;
cin >> n >> m;
vector<int> k(m);
vector<vector<int>> s(m);
for(int i = 0; i < m; i++) {
cin >> k[i];
s[i].resize(k[i... | 0 | 85,046,066 |
#include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void)
{
int a;
double b;
cin >> a >> b;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(... | 0 | 34,213,865 |
#include <bits/stdc++.h>
using namespace std;
#define cp_io ios_base::sync_with_stdio(0);cin.tie(0)
#define ll long long int
#define oo 1000000010
#define MAX 1000000
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define nl "\n"
int main()
{
cp_io;
#ifndef ONLINE_JUDGE
freopen... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#def... | 0 | 93,897,160 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
#define pb push_back
template<class T> inline bool... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
class Dice{
public:
vector<int> d;
void spin(string s){
if(s == "S"){
swap(d[0],d[4]);
swap(d[4],d[1]);
swap(d[4],d[5]);
}
if(s == "E"){
swap(d[0],d[3]);
swap(d[2],d[3]);
swap(d[3],d[5]);
}
... | 0 | 72,912,801 |
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using ll = long long;
const int MOD = 1e9+7;
int main() {
FASTIO
int s;
cin >> s;
if(s < 3) cout << "0\n";
else if(s < 6 && s >= 3) cout << "1\n";
else {
vector<ll> dp(s+1,... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b... | 0 | 27,169,358 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int x1 , y1 , x2 , y2 ;
cin >> x1 >> y1 >> x2 >> y2 ;
cout << x2+y1-y2 << " " << y2+x2-x1 << " " << x1+y1-y2 << " " << y1+x2 - x1 << endl ;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#def... | 0 | 90,647,674 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set... | #include <iostream>
long long int factorial(long long int n){
if(n==0 || n==1) return (1);
else return (n*factorial(n-1));
}
using namespace std;
int main(){
long long int n;
cin >> n;
cout << factorial(n) << '\n' ;
} | 0 | 17,891,902 |
#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 1e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
ll LCM(ll a,ll b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,x); REP(i,sizeof(a)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (... | 0 | 68,683,975 |
#include <bits/stdc++.h>
using namespace std;
bool prime[1000005];
int dp[100][100];
int f(int a, int b) {
if (a == 0) {
return 0;
}
if (b > a)
return 0;
if (dp[a][b] != -1) return dp[a][b];
return dp[a][b] = max(f(a,b+1), f(a-b, b+1)+1);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int64_t N;
cin ... | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | 0 | 96,976,126 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.