code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
signed main(void)
{
int n, m, K;
cin >> n >> m >> K;
rep(k, n)
{
rep(l, m)
{
if (k * (m - l) + (n - k) * l == K)
{
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 77,917,857 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 0 | 95,247,725 |
#include <iostream>
#include <vector>
typedef long long LL;
using namespace std;
int main() {
LL n;
LL d;
LL x;
cin >> n;
cin >> d >> x;
vector<LL> a(n);
for(LL i=0; i<n; i++){
cin >> a[i];
}
LL ans=x;
for(LL i=0; i<n; i++){
for(LL j=1; j<=d; j++){
if(... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define pb push_back
bool isPrime(ll n)
{
if (n <= 1) return false;
if (n <= 3) return true;
if (n%2 == 0 || n%3 == 0) return false;
for (ll i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
... | 0 | 39,939,032 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<(n);i++)
typedef long long ll;
int main() {
double a,b,x,ans;
cin >> a >> b >> x;
if(x < a*a*b/2){
ans = atan(a*b*b/2/x);
} else ans = atan(2*(a*a*b-x)/a/a/a);
double pi = ac... | #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" <... | 0 | 46,633,864 |
#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>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #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... | 0 | 88,280,738 |
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <string>
#include <math.h>
#include <cstdlib>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long ll;
typedef pair<int,int>pii;
#define lson ... | #ifndef COMPETITIVE_HEADER
#pragma GCC optimize ("Ofast")
#ifdef ONLINE_JUDGE
#pragma GCC target ("avx512f")
#else
#pragma GCC target ("avx")
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
... | 0 | 51,134,829 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
int main(){
ll a, ans, c;
double b;
cin >> a >> b;
c=b*100+0.1;
ans=a*c/100;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int H, W;
while (true) {
cin >> H >> W;
if (H == 0 && W == 0) break;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
cout << '#';
}
cout << endl;
}
cou... | 0 | 92,321,611 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long M, std::vector<long long> A){
priority_queue<long long> que;
for(auto a: A) que.push(a);
for(int i = 0; i < M; ++i){
long long max_val = que.top();
que.pop();
que.push(max_val/2);
}
long long ans ... | #include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | 0 | 15,506,752 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double d;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (abs(a*b)/gcd(a,b))
#define sqr(a) (a*a)
#define tt int t; cin>>t; while(t--)
#define lo(i, a, b) for(int i=a; i<=b; i++)
#define rlo(i, a) for(int i=a; i>0; i--)
#define be(a) a.begin(),a.e... | 0 | 80,355,871 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a) (ll) a... | #include<stdio.h>
int main(void)
{
int a[3];
int i,j,temp;
for (i=0;i<3;i++){
scanf("%d",&a[i]);
}
for (i=0;i<2;i++){
for (j=i+1;j<3;j++){
if (a[i]>a[j]){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(i=0;i<2;i++){
printf("%d ",a[i]);
}
printf("%d\n",a[2]);
return 0;
} | 0 | 7,777,799 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n),ar(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
ar.at(i)=a.at(i)-i-1;
}
sort(ar.begin(),ar.end());
int mid = ar.at(n/2);
long long ans = 0;
for(int i=0;... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast","no-stack-protector","unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx")
using namespace std;
#define F(i,L,R) for(int i=L;i<R;++i)
#define FE(i,L,R) for(int i=L;i<=R;++i)
#define getI(a) scanf("%d", &a)
#define getII(a,b) scanf("... | 0 | 48,563,430 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<functional>
#include<queue>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<utility>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
typedef long long int ll;
#defi... | 0 | 78,089,013 |
#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 = 100010, M = 1010;
int n, m;
LL x[N], y[N], z[N];
int main(... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 83,628,980 |
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char sr[3];
scanf("%s", sr);
int rc_cnt = 0;
int rc_ans = 0;
for (int i = 0; i < strlen(sr); i++)
{
if (sr[i] == 'S')
{
rc_cnt=0;
}
else if (sr[i] == 'R')
{
rc_c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#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 m... | 0 | 66,716,848 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
using... | 0 | 53,692,748 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T euqlid(T a, T b){
if(a < b){
int x = a;
a = b;
b = x;
}
T q, r;
q = b;
r = a % b;
if(r) return euqlid(q, r);
else return q;
}
int main(){
long long a, b, c, d;
cin >> a >> b >> c >> d;
l... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll W[55];
ll P[55];
ll patee(ll l, ll n){
ll whole = W[l];
ll pate = P[l];
if(l == 0){
return 1;
}
if(n == 1){
return 0;
}
if(n > 1 && n < (whole/2) + 1){
... | 0 | 86,032,202 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
using namespace std;
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define mod 1000000007
#define f first
#define s second
#define int ... | #include <stdio.h>
int main(void){
int a,b;
a = 1;
b = 1;
while(a != 10 && b != 11){
if(b != 10){
printf("%dx%d=%d\n",a,b,a * b);
b ++;
}
else{
b = 1;
a++;
}
}
return 0;
} | 0 | 26,345,170 |
#pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = 1e18, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W, x, y, z;
long long max_value = INF, max_index = -1;... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using std::string;
using std::vector;
using std::set;
using std::multiset;
using std... | 0 | 78,599,414 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 70,911,226 |
#include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a%... | #include <stdio.h>
int main (){
int n;
scanf("%d", &n);
long long int a1[n];
long long int a2 = 1;
long long int max = 1000000000000000000;
long long int tot;
for(int i = 0; i < n; i++){
scanf("%lld", &a1[i]);
}
for(int u = 0; u < n; u++){
if(a1[u] == 0){
printf("0 \n");
return 0;
}
}
for(int y ... | 0 | 95,354,742 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define INF 1e8
typedef long long int ll;
const double PI = acos(-1);
using Graph = vector<vector<int>>;
int main()
{
int x;
cin >> x;
if (x <= 599)
cout << "8" << endl;
else if (600 <= ... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | 0 | 70,406,748 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
ll N, H;
cin >> N >> H;
vector<ll> A(N), B(N);
for (int i = 0; i < N; ++i) cin >> A[i] >> B[i];
sort(A.begin(), A.end(), greater<ll>());
sort(B.begin(), B.end(), greater<ll>());
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | 0 | 3,774,813 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int ans;
if (a-b == 0){
ans = c;
}else if (b-c == 0){
ans = a;
}else{
ans = b;
}
cout << ans << endl;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | 0 | 60,015,838 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int s;
cin >> s;
vector<int> a;
a.push_back(s);
set<int> st;
st.insert(s);
for (int i = 1; i <= 1000000; ++i) {
if (a[i-1] % 2 == 0) {
a.push_back(a[i-1] / 2);
} else {
a.push_back(3 * a[i-1] + 1);
}
i... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
vector<int> vec(n,0);
vector<int> comp(n-1,0);
for(int i=0;i<n;i++){
cin >>vec.at(i);
}
sort(vec.begin(),vec.end());
for(int i=0;i<n-1;i++){
comp.at(i)=vec.at(i+1)-vec.... | 0 | 91,085,092 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
using namespace std;
typede... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll,ll> lll;
const ll MOD = 1000000007;
const ll INF = 1e9+5;
const double eps = 1e-7;
cons... | 0 | 52,024,775 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxn= 5e5+5;
#define mod 1000000007
#define endl '\n'
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
ll n,m;
cin>>n>>m;
if(n==1||m==1){
cout<<1;
return 0;
}
ll temp=(n... | #include <iostream>
using namespace std;
int main(){
int n, a = 0, b = 0, arr[] = {0, 1, 3};
cin >> n;
while(n--){
string s, t;
cin >> s >> t;
a += arr[(s > t) + (s >= t)];
b += arr[(s < t) + (s <= t)];
}
cout << a << ' ' << b << endl;
} | 0 | 75,162,938 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int N;
cin >> N;
int W[N+1];
for(int i=1;i<=N;i++)cin >> W[i];
int ans = 1000000;
for(int T=1;T<N;T++){
int S1=0,S2=0;
for(int i=1;i<=N;i++){
if(i <= T)S1+=W[i];
else S2+=W[i];
... | #include <iostream>
using namespace std;
int main(void) {
int n;
string s;
while (1) {
cin >> n;
if (n == 0) break;
int l = 0; int r = 0;
int f = -1;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> s;
if (s[0] == 'l') {
... | 0 | 93,847,626 |
#define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _ov... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vect... | 0 | 23,124,816 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
using pint = pair<ll, ll>;
int main(){
char x;
cin >> x;
if(x<='Z' && x>='A')cout <<'A' <<endl;
else
cout << 'a' << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sz size()
#define ll long long
#define all(_v) _v.begin(), _v.end()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pvllvll pair <vector <ll>, vector <ll> >
#define ld long doub... | 0 | 24,334,766 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 1e18
#define MIN -1e18
#define MOD 1000000007
#define base 139
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#define in1(a) scanf("%lld", &a)
#define in2(a, b) scanf("%lld%lld", &a, &b)
#def... | 0 | 12,546,411 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
const int mod=1e9+7;
int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h,w,m;
cin>>h>>w>>m;
vector<set<int>> b(h);
vector<int> sums_h(h,0);
vector<int> sums_w(w,0);
int bh,bw;
for(int i=0;i<m;i++){
cin>>bh>>bw;
sums_h.at(bh-1)++;
sums_w.at(bw-1)++;
b.at(bh-1).insert(bw-1);
}
int result=0;
int... | 0 | 70,332,784 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string S;
int w;
cin >> S >> w;
for (int i = 0; i < S.size(); i+=w) {
cout << S.at(i);
}
cout << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long) 1e9 + 7;
long modpow(long a, long b){
if(b == 0){
return 1;
} else if(a == 1){
re... | 0 | 87,044,002 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main()
{
ll A, B, K;
cin >> A >> B ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 2,337,725 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<clas... | #include <bits/stdc++.h>
using namespace std;
int main() {
set<long long>s;
int len;
cin >> len;
while(len--){
long long ai;
cin >> ai;
if(s.find(ai) != s.end()){
cout << "NO" << endl;
return 0;
}else{
s.insert(ai);
}
}
... | 0 | 3,937,567 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cstdio>
#define F(i,n) for(int i=0;i<(int)(n);i++)
#define INF 100000000
#define ll long long
using namespace std;
typedef pair<int, int> P;
int main() {
int n, m, p, x[110], ans,all;
while (1) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 91,729,539 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
float n,m;
cin>>n>>m;
int cnt=0;
vector<int> v;
for(int i=0;i<=n-1;i++){
int a;
cin>>a;
v.push_back(a);
}
int all_vote=0;
for(auto& i:v){
all_vote+=i;
}
float t;
t=all_vote*(1/(4*m));
int ans=0;
for(auto& i:v)... | #include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main() {
string str, str1, str2;
int m, h;
while (true) {
cin >> str;
if (str == "-") break;
cin >> m;
for (int i = 0; i < m; i++) {
cin >> h;
str1 = str.substr(0, h);
... | 0 | 19,897,440 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,m,i,ans;
cin >> n >> m;
if(n*2<=m){
ans=n;
m=m-n*2;
ans+=m/4;
}else{
ans=m/2;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<... | 0 | 61,575,201 |
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<cstdio>
#include<climits>
#include<iostream>
#include<algorithm>
#include<vector>
#include<deque>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<utility>
#include<queue>
using namespace std;
char moji(char x,int n){
if(x == '1'){
s... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) f... | 0 | 54,056,641 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
typedef long long ll;
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> ra... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N+1);
for(int i=1; i<=N; i++) cin >> a.at(i);
vector<bool> used(N+1, false);
int cnt = 0;
int pos = 1;
used.at(pos) = true;
bool flg = false;
while(true){
pos = a.at(pos);
cnt... | 0 | 37,270,542 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n,k; cin>>n>>k;
cout << !!(n%k)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) {
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n, m;
cin >> n >> m;
ve... | 0 | 2,690,399 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const int MOD = 1e9+7;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) x.begin(), x.end()
int main() {
string a;
cin >> a;
int b = a.size();
vi ans(26,1);
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<char>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> ... | 0 | 85,601,619 |
#include <iostream>
using namespace std;
int main(int argc, char** argv){
int a, b;
cin >> a >> b;
if(a>b){
cout << "a > b" << endl;
}else if(a==b){
cout << "a == b" << endl;
}else{
cout << "a < b" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(pos,mp) for(ll pos=mp.begin();pos!=mp.end();pos -++)
#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;
int m... | 0 | 82,673,091 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >>n;
string s; cin >> s;
int k; cin >> k;
char moji = s.at(k - 1);
for(int i = 0; i < n; i++){
if(s.at(i) != moji)
cout << "*";
else
cout << moji;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(c%__gcd(a,b)==0)
{
cout<<"YES"<<endl;
return 0;
}
else
{
cout<<"NO"<<endl;
}
} | 0 | 9,847,761 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | #include <iostream>
#include <algorithm>
#include<string.h>
using namespace std;
const int maxn = 2e5 + 10;
#define ll long long
ll a[200005];
ll b[200005], c[200005], d[200005], ans;
int upperbound(int l, int r, ll s){
while(l<r){
int m = (l+r)/2;
ll h = b[m] ^ b[s - 1];
if... | 0 | 13,207,479 |
#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()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #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>;
ll comb(int n, int r) {
if (r == 0 || r == n) return 1;
else if (r == 1) return n;
return comb(n-1, r-1) + comb(n-1, r);
}
int main() {
int n, p;
cin >> n >> p;... | 0 | 45,712,063 |
#include <cstdio>
#include <cmath>
int main() {
int A, B;
scanf("%d%d", &A, &B);
if (A + B == 0) puts("1");
else if (abs(A) < abs(B)) printf("%d\n", abs(B) - abs(A) + (A < 0) + (B < 0));
else printf("%d\n", abs(A) - abs(B) + (A > 0) + (B > 0));
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
struct Q{char x; int a, b, c, d;} a[2001][2001];
int n, m;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) cin >> a[i][j].x;
for(int i = 1; i <= n; i++) {
... | 0 | 36,820,749 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int MAXN = (int)1e5 + 5;
pair<ll, int> arr[MAXN];
pair<ll, int> pt[MAXN];
ll col[MAXN];
ll ans[MAXN];
ll m, lim;
int n;
void solve(... | 0 | 19,679,239 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
int N;
scanf("%d", &N);
vector<LL> d(N);
vector<int> weight(N, 1);
map<LL, int> mp;
for(int i = 0; i < N; i++){
scanf("%lld", &d[i]);
mp[d[i]] = i;
}
vector<pair<int, int>> res;
for(int it... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
int n;
cin >> n;
int t0=0;
int x0=0;
int y0=0;
for(int i=0;i<n;i++){
int t,x,y;
cin >> t >> x >> y;
t=t-t0;
x=x-x0;
y=y-y0;
int sum=abs(x)+abs(y);
if(sum>t || sum%2!=t%2){
... | 0 | 99,307,262 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef vector<int> vi;
typedef unsigned long ul;
typedef vector<ll> vl;
typedef p... | 0 | 80,481,267 |
#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... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<complex>
#include<string>
#include<cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 100000000
#de... | 0 | 60,912,154 |
#include <iostream>
using namespace std;
int main(){
int m, n_min, n_max, gap = 1000000, z;
int ary[1000001];
while(1){
cin >> m >> n_min >> n_max;
if(m == 0 && n_min == 0 && n_max == 0) break;
for(int i = 1 ; i <= m ; i++){
cin >> ary[i];
}
for(int i = n_min ; i <= n_max ; i++){
i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <sstream>
#include <set>
#include <map>
#define LLMAX 9223372036854775807
using namespace std;
using ll = long long;
int main() {
ll argN, argL, argT;
cin >> argN >> argL >> argT;
vector<ll> arg... | 0 | 40,632,519 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | 0 | 51,671,255 |
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
int main() {
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
cout<<x2+y1-y2<<' '<<y2+x2-x1<<' '<<y1-y2+x1<<' '<<x2-x1+y1<<endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
arr.push_back(a);
}
if (n == 1) {
cout << 0;
return 0;
}int i = 0;
int j = 1;
int ans = 0;
while (i < arr.size()) {
if (arr.at(i) != j) {
arr.... | 0 | 29,158,320 |
#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::sync_with_st... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
void ABC50(void);
void ABC51(void);
void ABC52(void);
void ABC53(void);
void ABC54(void);
void ABC55(void);
void ABC56(void);
void ABC57(void);
void ABC58(void);
void ABC59(void);
int main(void){
ABC59();
}
void ABC59(){
int da,db;
vector<strin... | 0 | 43,076,216 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #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};
signed main() {
int N;
cin >> N;
vector<int>a(N);
int cnt = 1;
int res = 0;
for(int i = 0; i < N; i++) {
... | 0 | 51,234,906 |
#include <iostream>
using namespace std;
int main(void)
{
int A,B;
int ans;
cin >> A >> B;
for(int i=1 ;i <=3;i++)
{
if(A != i && B != i)
{
ans = i;
break;
}
}
cout << ans << endl;
} | #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 | 21,223,221 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
using namespace std;
const int nmax = 1e9 + 7;
typedef long long ll;
int main(){
double N, M, D; cin >> N >> M >> D;
double ans;
if (D != 0){
ans... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll num[2];
cin >> num[0] >>num[1];
if(num[0] != 0){
num[0]--;
}
ll sum[2] ={};
for(int i=0;i<2;i++){
if(((num[i]%4)/2) ^ (num[i]%2)){
sum[i] =1;
}
}
for(int i=0;i<2;i++)for(... | 0 | 17,063,436 |
#include<bits/stdc++.h>
#include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,... | #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, k;
... | 0 | 1,568,840 |
#include<stdio.h>
#define limit 1000000000000000000
int main()
{
long long int a[100000],i,n,pro;
scanf("%lld",&n);
for(i=0,pro=1;i<n;i++)
{
scanf("%lld",&a[i]);
if(a[i]==0)
{
printf("0");
return 0;
}
}
for(i=0;i<n;i++)
{
if(pro... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
while(true){
int n;
int m;
int p;
cin >> n >> m >> p;
if(n==0 && m == 0 && p == 0){
break;
}
int allcnt = 0;
int viccnt = 0;
for(int i=0;i<n;i++){
int num;
cin >> num;
allcnt += num;
if(i+1 == m){
viccnt += n... | 0 | 35,799,533 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e9;
#define mod 1000000007
#define what_is(x) cerr<<#x<<" is "<<x<<"\n";
#define read(x) freopen("in.txt","r",stdin);
#define write(x) freopen("out.txt","w",stdout);
#define Fast ios_base::sync_... | #include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main() {
string s;
getline(cin, s);
for (auto x : s) {
if (islower(x))
cout << (char)toupper(x);
else if (isupper(x))
cout << (char)tolower(x);
else
cout << x;
}
... | 0 | 42,806,610 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{... | 0 | 24,376,460 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n, a, b;
cin >> n >> a... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
long long M=0;
long long AA=0;
long long BB=0;
long long SS=0;
cin>>N;
vector<string>vec(N);
for(int X=0;X<N;X++){
cin>>vec.at(X);
string S=vec.at(X);
for(int Y=0;Y<S.size()-1;Y++){
if(S.at(Y)=='A'&&S.at(Y+1)=='B'){
... | 0 | 21,465,341 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int gcd(int a, int b) {
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int N, X;
cin >> N >> X;
priority_queue<int> q; int x;
rep(i,0,N-1) {
cin >> x;
q.push(... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(a) (a).begin(),(a).end()
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
... | 0 | 49,106,022 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
map<int,int> Map;
template<class T>
void fact(T n){
for(T i = 2; i * i <= n; i++){
while(n % i == 0){
Map[i]++;
n /= i;
}
}
if(n == 1)return;
Map[n]++;
}
int main()
{
int n;
cin >> n;
i... | 0 | 38,733,505 |
#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 dp[105][4][2];
int main(){
string s;
int K;
cin >> s >> K;
int n = s.size();
dp[0][0][0] = 1;
rep(i, n)rep(j, 4)rep(k, 2){
int nd = s[i]-'0';
rep(d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
c... | 0 | 59,960,452 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd ( ll a, ll b)
{
if( b==0)
return a;
return gcd( b, a%b);
}
int main()
{
ll n, x;
cin>>n>>x;
ll a[n+1];
a[0] = x;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a , a+n+1);
ll temp = a[1] - a[... | #include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <float.h>
#include <iomanip>
#include <iostream>
using namespace std;
int gcd(int x,int y){
if(y==0)return x;
return gcd(y,x%y);
}
int lcm(int x,int y){
return x*y/gcd(x,y);
}
in... | 0 | 45,514,534 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<numeric>
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vector<ll> x(n), y(n), z(n);
... | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for(int (i)=0; (i)<(n); (i)++)
#define REP2(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1,) (__VA_ARGS__)
#define MOD 1000000007
template <class T> ostream& ope... | 0 | 39,887,485 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int n,ans=0;
cin>>n;
for(int i=1;i<n;i++)
{
ans+=(n-1)/i;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
#define ll long long int
#define rep(i,n) for(ll i=0;i<n;i++)
#define vec vector<ll>
#define mat vector<vector<ll>>
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}... | 0 | 8,255,845 |
#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>;
const int maxn = 55;
int a[maxn];
int temp[maxn],n,m;
int main(){
int i,ans=0;
cin >> n >> m;
for(i=1;i<=n;i++)
cin>>a[i];
for(int l=0;l<=n;l++)
{
for(int r=n... | #include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define RS resize
#define CLR clear
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
using namespace std;
int main(... | 0 | 69,388,403 |
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void){
int n;
cin>>n;
vector<ll> v(n);
ll ans = 0;
rep(i, n){
ll a, b;
cin>>a>>b;
ans -= b;
v[i] = a+b;
}
sort(v.begin(), v.end(), greater<ll>... | 0 | 52,856,783 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
int a, b;
int r;
int d;
double f;
cin >> a >> b;
d = a / b;
r = a % b;
f = (double)a / b;
printf("%d %d %f\n", d, r, f);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int gcd(int x, int y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
using Graph = vector<vector<ll>>;
ll inf=300000000000000000;
const double PI = 3.14... | 0 | 89,843,895 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();... | 0 | 27,076,630 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | 0 | 44,698,020 |
#include <bits/stdc++.h>
#define REP( i , nn ) for(int i = 0 ; i < (int) nn; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s; cin >> s;
int c = 0;
for(int i = 0; i < s.size(); i ++)
if(s[i] == 'x')
c ++;
if(c <= 7) puts("YES");
else puts("NO");
return 0;
} | 0 | 12,569,259 |
#include<iostream>
using namespace std;
int main() {
int a[5000], n, i, j, result, tmp;
while(cin >> n && n) {
for(i = 0; i < n; i++) cin >> a[i];
for(i = 1; i < n; i++) a[i] += a[i-1];
result = a[n-1];
for(i = n-1; i >= 0; i--)
{
if (a[i] > result) result = a[i];
for(j = 0; j < i; j++)
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
int main() {
int n;
while (cin >> n, n) {
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 1e8;
for (int i=0; i<n-1; ++i) {... | 0 | 17,484,478 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define db double
#define pb push_back
#define ppb pop_back
#define all(x) (x).begin(), (x).end()
template <typename... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | 0 | 67,307,375 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
replace(s.begin(), s.end(), ',', ' ' );
cout << s << '\n';
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <math.h>
#include <complex>
using namespace std;
typedef long long int ll;
typedef complex<long double> Point;
typedef vector<Point> Polygon;
const long double eps=1e-9;
namespace std{
bool operator<(const Point &p,const Point &... | 0 | 59,271,921 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <numeric>
#include <queue>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
int64_t mod = 1000000007 ;
int main(){
int n ;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
while (cin >> n)
{
long long ans = 0;
if (n < 3)
cout << 0 << endl;
else
{
for (long long i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
... | 0 | 2,687,520 |
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define MP make_pair
long long int map[1002][1002], mmap[1002][1002], tai = 1;
int main()
{
int n, w, h, s,x,y,siz,cnt=0,flg=0;
char c[2002];
pair<int, int> q;
queue<pair<int,int> > que;
queue<int>quec;
quec.push(0);
sca... | #include <bits/stdc++.h>
using namespace std;
int main()
{
bool f[27]={};
string s;
cin>>s;
for(int i=0;i<s.size();i++)
{
if(!f[s[i]-'a'])
{
f[s[i]-'a']=true;
}
else
{
cout<<"no";
return 0;
}
}
cout<<"yes";
... | 0 | 21,282,408 |
#include<bits/stdc++.h>
using namespace std;
int r,s,p;
int win(char c){
if(c=='r') return p;
else if(c=='s') return r;
else return s;
}
int main(){
int n,k,ans=0;
string t;
cin>> n >> k >> r >> s >> p >> t;
for (int i=0; i<k; i++){
string check;
bool pre=true;
for(int j=i; j<t.size(); j+=k){ ... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 55,699,543 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
S.pop_back();
while (S.size()) {
if (S.size() % 2) {
S.pop_back();
}
else {
string a, b;
a = S.substr(0, S.size() / 2);
b = S.substr(S.size() / 2);
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int dx[] = {-1, 0, 0, 1};
int dy[] = {0, -1, 1, 0};
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
for(int i = 0; i < h; i++) cin >> s[i];
string ans = "Yes";
for(int i = 0; i < h; i++){
for(int j = 0... | 0 | 15,966,107 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for(int i=0;i<7;i++){
if( pow(2,i) <= n && n < pow(2,i+1) ){
cout << pow(2,i) << endl;
break;
}
}
} | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using ... | 0 | 88,898,368 |
#include<iostream>
using namespace std;
int main() {
int x, n, a[100] = { 0 }, hasi;
for (int i0 = 0;i0 < 100;i0++) {
cin >> n;
cin >> x;
if (n == 0 && x == 0) {
break;
}
for (int i = 0;i < n;i++) {
for (int i2 = i + 1;i2 < n;i2++) {
for (int i3 = i2 + 1;i3 < n;i3++) {
if (i + i2 + i3 + 3 == ... | #include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
string s[9]={".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int main(){
int n;
string input;
cin >> n;
for(int i=0; i<n; i++){
char output[76] = "";
cin >> input;
char num = '0';
int kaisu = 0;
... | 0 | 49,059,017 |
#include <iostream>
#include <cstdio>
using namespace std;
string a, b;
int main() {
cin >> a >> b;
cout << (a==b ? 'H' : 'D');
return 0;
} | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
const int N = 1e5+10;
const ll INF = 1e15;
using namespace std;
vector<pair<int,ll>> Graph[N];
vector<ll> d;
void dijkstra (in... | 0 | 92,607,797 |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
bool ans = false;
for (int i = 0; i <= N/4; i++) {
int n = N - i*4;
if (n%7==0) ans = true;
}
if (ans) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
using dd = long double;... | 0 | 50,280,188 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;cin>>S;
for(int X=0;X<3;X++){
if(S[X]=='1')
S[X]='9';
else
S[X]='1';
}
cout<<S<<endl;
} | #include <iostream>
using namespace std;
#define REP(i,n) for(int i=0;i<int(n);i++)
int main()
{
while(1){
int m, n_min, n_max;
cin >> m >> n_min >> n_max;
if(m == 0 && n_min == 0 && n_max == 0) break;
int P[m];
REP(i,m) cin >> P[i];
int ans;
int gap = 0;
for(int i = n_min; i <= n_max;... | 0 | 97,179,876 |
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
string a,b;
cin >> a >> b;
int aa = a.size(),bb = b.size();
for (int i=0;i<bb;++i){
putchar(a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
ll N; cin >> N;
unordered_map<ll, bool> M, taboo;
vector<ll> V(N);
for(int i = 0; i < N; i++) {
cin >> V[i];
... | 0 | 14,645,362 |
#include <iostream>
#include <cstdio>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <string>
#include <ctype.h>
using namespace std;
class Point
{
public:
double x, y;
};
void solve()
{
Point P1, P2;
cin >> P1.x >> P1.y >> P2.x >> P2.y;
printf("%.6f\n", sqrt((P2.x - P1.x) * (P2.x - P1.x) + ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int h, w, a, b;
... | 0 | 52,994,548 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
string S;
cin>>S;
map<char,int> m;
rep(i,3)
m[S[i]]++;
if(m['a']==1&&m['b']==1&&m['c']==1)
cout<<"Yes"<<endl;
else
{
cout<<"No"<<endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <ut... | 0 | 44,808,740 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=9999999999999999;
int main() {
string S;
cin>>S;
cout<<(S<="2019/04/30"?"Heisei":"TBD")<<endl;
return 0;} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100005
#define maxn 200005
#define pb push_back
#define mk make_pair
#define endl "\n"
#define INF 10... | 0 | 88,677,283 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for ... | 0 | 99,691,393 |
#include <bits/stdc++.h>
#define INFTY 2000000100
using namespace std;
int main()
{
char S[8];
int value;
priority_queue<int> t;
do
{
scanf("%s", S);
if (S[0] == 'i')
{
scanf("%d", &value);
t.push(value);
}
else if (S[0] == 'e' && S[1] ... | #include <iostream>
#include <map>
#include <string>
constexpr int MOD = 1'000'000'007;
int main() {
int n;
std::string s;
std::cin >> n >> s;
std::map<char, int> mp;
for (const char c : s)
++mp[c];
long long ans = 1;
for (const auto e : mp) {
ans *= (e.second + 1);
a... | 0 | 32,509,487 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DE... | #include<stdio.h>
int main(void){
int a[3000],b[3000],d,e;
int c=0;
while(1){
scanf("%d %d",&a[c],&b[c]);
if(a[c]==0 && b[c]==0){
break;
}
c++;
}
for(d=0;d<c;d++){
if(a[d]>b[d]){
e=a[d];
a[d]=b[d];
b[d]=e;
}
printf("%d %d\n",a[d],b[d]);
}
return 0;
} | 0 | 74,963,518 |
# include <iostream>
# include <math.h>
using namespace std;
int main()
{
char letter;
cin >> letter;
if (letter > 64 && letter < 91)
cout << "A";
else
cout << "a";
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s;
cin>>s;
bool flag=false;
int len=s.size();
for(int i=1;i<s.size();i++){
if((len-i)%2!=0)continue;
else{
string str1=s.substr(0,(len-i)/2);
strin... | 0 | 11,651,062 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int V, E;
ll cost[105][105];
ll INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll cost2[105][105];
cin >> V >> E;
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (i == j) cost[i][j] = 0;
else ... | 0 | 44,724,810 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef vector <ll> v_ll;
typedef vector <vector <ll> > vv_ll;
typedef vector < pair <ll,ll> > vp_ll;
typedef pair <ll,ll> p_ll;
ll N,... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
#define NIL -1
int main(){
LL n;
LL m;
cin >> n >> m;
vector<LL> x(n);
vector<LL> y(n);
vector<LL> z(n);
for(LL i=0; i<n; i++){
cin >> x[i] >> y[i] >> z[i];
}
LL ans=0;
f... | 0 | 95,715,425 |
#define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ll;
static const ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int dp[105][4][3];
int main(void){
string s; cin >> s;
int KK; cin >> KK;
int n = s.size();
dp[0][0][0] = 1;
for(int i=0; i<n; i++){
for(int j=0; j<=KK; j++){
for(int k=0; k<2; k++){
... | 0 | 40,343,614 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int main() {
int N, abssum = 0, amax = -10001, amin = 10001;
cin >> N;
vector<int> A(N);
rep(i, N) {
cin >> A[i];
abssum += abs(A[i]);
amax = max(amax, A[i]);
amin = ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | 0 | 53,915,036 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
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; }
const ll INF=1LL<<60;
ll n;
i... | #include<iostream>
using namespace std;
int main(){
int n,m,X,Y;
cin>>n>>m>>X>>Y;
int maxx=X;
for(int i=0;i<n;i++){
int x;cin>>x;
maxx=max(maxx,x);
}
int miny=Y;
for(int i=0;i<m;i++){
int y;cin>>y;
miny=min(miny,y);
}
if(maxx<miny) cout<<"No War"<<endl... | 0 | 37,825,529 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
int N;cin >> N;
vector<int> v(N);
rep(i,N)cin >> v[i];
sort(v.begin(),v.end());
double ans = v[0];
for(int i = 1; i <... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 0 | 6,057,772 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.