code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
string n;
cin >> n;
rep(i, 3) {
if(n[i] == '1') cout << 9;
else cout << 1;
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
vector<char> S(10);
string r ="YAKI";
int i;
int y=0;
for(i=0;i<s.size();i++){
S.at(i)=s.at(i);
}
for(i=0;i<4;i++){
if(S.at(i)!=r.at(i)){
y++;
}
}
if(y==0){
... | 0 | 37,917,261 |
#include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <iostream>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
map<int, int> count;
int getCount(int n) {
int ret = 0;
for (auto& i : count) {
if (i.second >= n) ++ret;
}
return ret;
}
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
rep(i, N) {... | 0 | 7,839,912 |
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <iomanip>
#include <math.h>
#include <algorithm>
#define hmm "\n"
#define test() int t; cin>>t; while(t--)
#define ll long long int
#define ull unsigned long long
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define mod 1000000007l... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | 0 | 15,287,844 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <vector>
#include <set>
#include <cassert>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 25,567,661 |
#include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int k, n,i=0,ans=0,kaka=1000000;
cin >> k >> n;
vector<i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 51,668,514 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 83,225,932 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main(){
cout << std::fixed << std::setprecision(15);
int a,b,k;
cin>>a>>b>>k;
for(int i=0;i<k;i++){
if(a%2)a--;
a/=2;b+=a;
swap(a,b);
}
if(k%2)cout<<b<<'... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7 , mod = 1e9 + 7 ;
long long n ;
long long x[N] ;
long long a[N] ;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n ;
long long a[n+1] ;
long long ans = 0 , mx = 1 ;
long long rem = ... | 0 | 44,912,084 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n,B,a,b,count=0,sum=0,f=0;cin>>n>>B;
vector<ll> vc;
ll mx=-1;
for(ll i=1;i<=n;i++)
{
cin>>a>>b;
vc.push_back(b);
mx=max(a,mx);
}
sort(vc.begin(),vc.end(),greater<ll>());
for(ll i=0;i<vc.size();i++)
... | 0 | 72,770,017 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
cin >> a;
cout << a*a;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 11,041,860 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
const ll MOD = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
vector<ll> a(5);
rep(i,5) cin>>a[i];
ll ans=INF;
vector<ll> p={0,1,2,3,4};
do{
ll tmp=0;
... | #ifndef DEBUG
#pragma GCC optimize("O3,unroll-loops")
#pragma loop_opt(on)
#endif
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define FAST ;
#else
#define FAST ios::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define cerr
#endif
#define _ <<' '<<
#define Fr(i, s, e) for(auto i = s; i < e; ++i)
#defi... | 0 | 46,869,805 |
#include <bits/stdc++.h>
#define endl "\n"
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<int(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ipair;
template <class T>ostream &operator<<(ostrea... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main()
{
while (true) {
int N, M;
cin >> N >> M;
if (N == 0 && M == 0) {
break;
}
vector<pair<int, int>> pairs(N);
long long int sum = 0;
for (int i = 0; i < N; i++) {
cin >> pairs[i].second >> pairs[... | 0 | 15,743,133 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = ll(1e18)+1;
int main(){
cin.tie(0);
ios::sync_with_stdio(... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define int long long
#define pb push_back
#define mod 1000000007
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define inf 1e18
#define pre(x,y) fixed<<setprecision(y)<<x
#define pq priority_queue<int>
#define mp... | 0 | 49,162,564 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long long unsigned int llu;
ll INF = 1000000009;
ll MOD = 1000000007;
void solve(){
string a;
cin >> a;
ll mp[30];
rep(i,30){
mp[i]=0;
}
rep(i,... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 17,177,372 |
#include<iostream>
using namespace std;
int m[101][101];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,u,k,v;
cin>>n;
for(int i=0;i<n;++i){
cin>>u>>k;
u--;
for(int j=0;j<k;++j){
cin>>v;
v--;
m[u][v]=1;
}
}
for(int i=0;i<n;++i){
for(int j=0;j<n;++j){
... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<int>>;
using dou =long double;
string Yes="Yes";
string YES="YES";
string NO="NO";
string No="No";
template<class T> inline bool chmax(T& a, T b) { i... | 0 | 18,840,554 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
ll inf = LLONG_MAX;
long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO"... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define inf 10000000002
#define pb push_back
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define MAX 100
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define bye ... | 0 | 74,663,839 |
#include<iostream>
using namespace std;
int main(){
int n,m;
while(1){
cin>>n;
char a[n],b[n],cha;
if(n==0)
break;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
cin>>m;
for(int i=0;i<m;i++){
cin>>cha;
for(int j=0;j<n;j++){
if(cha==a[j]){
cout<<b[j];
break;
}els... | #include<iostream>
using namespace std;
#define ll long long
ll n;
ll a[100005];
ll dp[100005];
const ll Inf = 1e10;
ll MinCostToReachFromNToZero(ll N){
if(dp[N] != -1)return dp[N];
if(N <= 0) return 0;
ll ans = abs(a[N] - a[N-1]) + MinCostToReachFromNToZero(N-1);
if(N-2 >= 0){
ll ans2 = abs(a[N] - a[N-... | 0 | 9,921,824 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int) (n); i++)
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a, b, c, k;
cin >> a >> b >> c >> k;
int cnt = 0;
while(a >= b) {
b *= 2;
cnt++;
}
w... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se... | 0 | 43,106,245 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int,int>;
void Yes() {
cout << "Yes" << endl;
}
void No() {
cout << "No" << endl;
}
int main(void) {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min(a,b) + min(c,d);
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;... | 0 | 43,901,596 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector<int> A(M);
for(int i=0;i<M;i++) cin >> A.at(i);
vector<int> cnt={0,2,5,5,4,5,6,3,7,6};
sort(A.begin(),A.end());
vector<int> dp(N+1,0);
dp.at(0)=1;
for(int i=0;i<M;i++){
int x=cnt.at(A.at(i));
for(int j=0;... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
char c;
cin>>a>>b;
string s1="",s2="";
for(int i=0; i<a; i++)
{
c=b+'0';
s1+=c;
}
for(int i=0; i<b; i++)
{
c=a+'0';
s2+=c;
}
if(s1.size()>s2.size())
{
for(int i=0; i... | 0 | 70,891,420 |
#include <bits/stdc++.h>
using namespace std;
int main(){
using ll = int64_t;
ll n, k;
cin >> n >> k;
vector<ll> a(n), b(n);
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
}
ll ans = 0;
for(int j=0;j<n;j++){
if((k | a[j]) == k)ans += b[j];
}
for(int i=1;i<31;i++){
if((k & (1LL << i)) == 0)... | #include <bits/stdc++.h>
#define gcd(m,n) __gcd(m,n)
#define lcm(m,n) m*(n/gcd(m,n))
#define fast std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define endl '\n'
#define MOD 1000000007
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
#... | 0 | 12,530,301 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #include <bits/stdc++.h>
#define endl '\n'
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
typedef unsigned long long ull;
typedef long long lld;
typedef long double ld;
typedef pai... | 0 | 22,611,856 |
#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 rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[233333];
int n;
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%lld", &a[i]), a[i] -= i;
sort(a + 1, a + 1 + n);
ll Mid = 0, ans = 0;
if(n % 2 == 0) Mid = (a[n / 2] + a[n / 2 + 1]) / 2;
else Mid = a[n / 2 + 1];
for(int i = ... | 0 | 41,081,806 |
#define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,t,x,y;
int tp,xp,yp;
int a,b,c;
bool ans=true;
cin >> n;
tp=0;
xp=0;
yp=0;
for(int i=0;i<n;i++){
cin >> t >> x >> y;
a=abs(t-tp);
b=abs(x-xp);
c=abs(y-yp);
if((a<b+c)||((a-b-c)%2!=0... | 0 | 80,912,234 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <functional>
#include <cmath>
#include <numeric>
#define REP(i,n) for(lint i{}, i##_len=(n); i<i##_len; ++i)
#define DREP(i, h, j, w) for(lint i{}; i < (l... | #include "bits/stdc++.h"
using namespace std;
int main(){
int H,W,K;
string* c;
cin >> H >> W >> K;
c = new string[H];
for(int i=0;i<H;i++)
cin >> c[i];
int result = 0;
for(int hbit=0;hbit<(1<<H);hbit++){
for(int wbit=0;wbit<(1<<W);wbit++){
int sum=0;
for(int i=0;i<H;i++){
if((... | 0 | 43,528,523 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
if(is_reverse) for(ll i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(ll i=0; i<num; i++){ cout<<v[i]; if(i... | #include <bits/stdc++.h>
#define pragma
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define aisort sort(a,a+n)
#define adsort sort(a,a+n,greater<ll>())
#define PI 2 * acos(0)
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<ll> vi;
type... | 0 | 22,776,423 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
int main(){
long Q,H,S,D;
long N;
long total=0;
cin>>Q>>H>>S>>D>>N;
total = (N/2)*min({8*Q,4*H,2*S,D})+(N%2)*min({4*Q,2*H,S});
cout<<total<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mod 1000000007
#define wi while
#define vl vector<ll>
#define vi vector<int>
#define map map<char,ll>
#define endl "\n"
const int mxN = 200001;
int ma... | 0 | 13,844,639 |
#include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
using namespace std;
int main() {
int NUM[8], P[8], Q[8];
int N,p,q;
cin >> N;
rep(i, N) cin >> P[i];
rep(i, N) cin >> Q[i];
rep(i, N) NUM[i] = i+1;
int cnt = 0;
do {
cnt++;
bool flag = true;
rep(i, N) {
if(P[i] ... | #include <iostream>
#include <algorithm>
#include <string>
#include <math.h>
#include <cstdint>
#include <sstream>
#include <map>
#include <vector>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e8, cnt;
int main(){
ll n;
cin>>n;
ll a[n],b[n];
for(ll i=0; i<n; ... | 0 | 10,987,401 |
#include <stdio.h>
int kuadrat(int a, int b)
{
int total = 1;
while(b > 0){
total *= a;
b--;
}
return total;
}
int main()
{
int cases;
scanf("%d", &cases);
long long int arr[cases], total = 1;
int i = 0;
char temp;
do
{
scanf("%lld%c", &arr[i], &temp);... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define rept(_i,iv,n,type) for(type _i=(type)(iv);_i<(type)(n);++_i)
#define rept0(_i,n,type) rept(_i,0,n,type)
#define repi0(_i,n) rept(_i,0,n,int)
#define repl0(_i,n) rept(_i,0,n,ll... | 0 | 64,237,475 |
#include<iostream>
#include<cassert>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define pb push_back
#define eb emplace_back
#define... | 0 | 6,289,529 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
int count =0;
for (int i = 0; i < W; i++) {
bool flag = true;
for... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
using namespace std;
const ll MOD = 1000000007;
int main() {
ll n, k;
scanf("%lld %lld", &n, &k);
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
ll v;
scanf("%lld", &v);
a[i] = v;
}... | 0 | 47,605,931 |
#include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
using namespace std;
using ll = long long;
using vel = vector<ll>;
using ves = vec... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 62,761,849 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int I... | 0 | 46,945,768 |
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <complex>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main()
{
int n;
string s;
cin >> n >> s;
stack<char> c;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c.push('(');
} else {
if (c.empty()) {
cout << '(';
} else {
c.pop();
}
}
}
cout << s;
while (!c.empt... | 0 | 81,103,568 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
const int MOD = 1e9+7;
int main(){
int N;
cin >> N;
vector<ll> A(60);
long long num;
rep(i, 0, N){
cin >> num;
... | #include<bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int> > adj;
int cnt, odd;
vector<int> col;
void dfs(int u, int c) {
cnt++;
col[u] = c;
for(int i = 0; i < adj[u].size(); i++) {
int v = adj[u][i];
if(col[v] != -1) {
if(col[v] == col[u]) odd = 1;
con... | 0 | 26,453,267 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
char a, b;
cin >> a >> b;
if (a == 'H')
cout << (b == 'H' ? "H" : "D") << endl;
else
cout << (b == 'H' ? "D" : "H") << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s;
cin >> s;
vector<int> alp(26, 0);
for(char d : s){
alp[d - 'a'] = 1;
}
bool f = true;
for(int i = 0; i < 26; i++){
if(alp[i] == 0){
f = false;
cout << char(i + 'a'... | 0 | 94,769,291 |
#include<bits/stdc++.h>
using namespace std;
int A[10010],B[10010];
int main()
{
int N;
cin>>N;
for(int i=0;i<N;i++)
cin>>A[i];
for(int i=0;i<N;i++)
cin>>B[i];
long long Asum=0,Bsum=0,Csum=0;
for(int i=0;i<N;i++)
{
Asum+=A[i];
Bsum+=B[i];
Csum+=max(0,(B[i]-A[i]+1)/2);
}
Bsum-=Asum;
if(Bsum<0)
puts... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
using pii = pair<int, int>;
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int N) : par(N), rank(N) {
for (int i = 0; i < N; i++) {
par[i] = i;
rank[i] = 0;
... | 0 | 48,906,461 |
#include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB e... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 0 | 28,483,897 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
con... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 0 | 95,286,291 |
#include <bits/stdc++.h>
#include<string.h>
#define ll long long
#include<vector>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main(){
IOS;
int n,m;
cin>>n>>m;
int votes=0;
vector<int> v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
votes+=v[i];}
sort(v.begin(),v.end(),greater<int>()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string A,B;
cin >> A >> B;
if(A[0] == B[0]){
cout << "=" << endl;
return 0;
}
if(A[0] > B[0]){
cout << ">" << endl;
}else{
cout << "<" << endl;
}
return 0;
} | 0 | 83,590,088 |
#include <iostream>
using namespace std;
int main() {
int a,b,c,d,e,f,g,h;
cin >> a >> b >> c >> d >> e >> f >> g >> h;
int S=a+b+c+d;
int T=e+f+g+h;
if (S>T){
cout << S << endl;
}
else cout << T << endl;
return 0;
} | #include<iostream>
#include <cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#de... | 0 | 52,812,029 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long LL;
int N;
int main(){
string str;
while(getline(cin,str),str!="."){
vector<string>s(1000);
int num=0;
bool check=true;
REP(i,str.size()){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int N = 0 ,A, B, C, K;
string S;
cin >> A >> B >> C >> K;
if (K <= A) cout << K << endl;
else if (K <= A + B) cout << A <<endl;
else cout << 2*A + B -K << endl;
} | 0 | 41,321,901 |
#include <bits/stdc++.h>
using namespace std;
#define INF 100005
#define MOD 1000000007
int main()
{
string a;
cin >> a;
int n=a.size();
for(int i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
cout << i+1 << " " << i+2 << endl;
return 0;
}
}
for(int i=0;i<n-2;i++)
{
i... | #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 | 35,849,690 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const int N = 1e5 + 5;
vector<int> g[N];
int siz[N];
bool f[N], col[N];
i64 mono, ant, col1, col2;
int n, m;
bool dfs(int u, int far = -1) {
bool flag = false;
siz[u] = 1;
f[u] = true;
for (auto v: g[u]) if (v != far) {
if (!f[v]) {
col[v] =... | # include <iostream>
# include <queue>
# include <cctype>
typedef std::pair<int, int> P;
const int INF = 100000;
const int MAX_H = 1000;
const int MAX_W = 1000;
const int MAX_N = 9;
int dx[4] = { 1,-1,0,0 }, dy[4] = { 0,0,1,-1 };
int h, w, n;
int d[MAX_H][MAX_W];
char ch[MAX_H][MAX_W];
P p[MAX_N + 1];
int bfs(P s, P g)... | 0 | 61,657,793 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | #include <iomanip>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
ty... | 0 | 49,503,769 |
#include<iostream>
using namespace std;
int main(){
string S;
cin >> S;
cout << (S[0] == S[1] || S[0] == S[2] || S[1]==S[2] ? "No" : "Yes") << endl;
return 0;
} | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
string s;... | 0 | 6,659,128 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int n, k;
cin >> n >> k;
vector<int> h(n);
for(int i = 0; i < n; i++){
cin >> h[i];
}
int count = 0;
for(int i = 0; i < n; i++){
... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par, s;
UnionFind(int n) : par(n), s(n, 1) {
for(int i = 0; i < n; i++) par[i] = i;
}
int root(int n) {
return par[n] == n ? n : root(par[n]);
}
void unite(int n, int m) {
n = root(n);
m ... | 0 | 4,823,984 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[20],n,s,h;
string v;
main()
{
a[0]=1;
for(int i=1;i<=15;i++)
a[i]=a[i-1]*10;
s=0;
for(int i=10;i>=1;i--)
{
int check = a[i]-1;
cout << "? " << check << "\n";
fflush(stdout);
cin >> v;
if(v == "N")
{
s = i+1;
break;
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int myposition(const pair<long long int, long long int>& p) {
long long int x = p.fi... | 0 | 30,464,065 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("sse,sse2,... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 76,455,850 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
long H, W, ans = LONG_MAX;
cin >> H >> W;
for (long i = 1; i < H; i++) {
long a = LONG_MAX;
pair<long, long> h1(i, H - i);
pair<long, long> h2(h1.first / 2, h1.first - h1.first / 2... | #define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <set>
#include <queue>
#define fi first
#define se second
using namespace std;
typedef long long LL;
... | 0 | 38,483,636 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b)... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 1000000007
#define inf 100000000000000000
using namespace std;
typedef long long ll;
typ... | 0 | 40,936,808 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int N,ren=1,ans=0;
cin >> N;
vector<long long int> A(N),sum(N+1);
sum[0] = 0;
for(int i=0;i<N;i++){
cin >> A[i];
sum[i+1] = sum[i] + A[i];
}
sort(sum.begin(),sum.end());
for(int i=1;i<=N;i++){
if(... | 0 | 29,552,491 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
struct mint {
int n;
m... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
int ans = 0;
for (int i = 0; i < h; i++) cin >> s[i];
for (int i = 0; i < (1<<h); i++) {
for (int j = 0; j < (1<<w); j++) {
int count = 0;
for (int x = 0; x < h; x++)... | 0 | 9,236,117 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int res = n;
for (int i = 0; i <= n; i++)
{
int cnt = 0;
int t = i;
while (t > 0)
cnt += t % 6, t /= 6;
t = n - i;
while (t > 0)
{
cnt += t % 9, t /= 9;
... | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <map>
#include <list>
using namespace std;
#define FOR( i, k, n ) for ( int i = ( k ); i < ( int )( n ); ++i )
#define REP( i, n ) FO... | 0 | 89,521,139 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++){
cin >> A.at(i);
}
vector<long long> Acnt(N+1,0);
for(auto x: A){
Acnt.at(x)++;
}
long long s=0;
for (int i = 1; i < N+1; i++){
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 17,576,753 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #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(){
int w,h,n;
cin>>w>>h>>n;
bool grid[h][w];
rep(hi,h)rep(wi,w){
grid[hi][wi]=0;
}
rep(i,n){
int x, y, a;
cin>>x>>y>>a;
if(a==1){
x--;
for(int wi=x; w... | 0 | 41,691,064 |
#include <iostream>
#include <cstdio>
#include <cstring>
#define N 100005
using namespace std;
struct edge{
int k,next;
}e[N<<1];
int n,home[N],cnt=-1,f[N];
void add(int x,int y){
cnt++;
e[cnt].k=y;
e[cnt].next=home[x];
home[x]=cnt;
}
void dfs(int k,int F){
for(int i=home[k];~i;i=e[i].next) if(e[i].k!=F){
dfs(e... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define r... | 0 | 11,851,970 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t n,m;
cin >> n >> m;
int64_t h[n+1];
for(int i = 1; i <= n; i++){
cin >> h[i];
}
int64_t a[m+1],b[m+1];
for(int i = 1; i <= m; i++){
cin >> a[i] >> b[i];
}
int peek[n+1];
for(int i = 1; i <= n; i++){
peek[i] = 1;
}
for... | 0 | 96,399,059 |
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector<int> x(N);
vector<int> y(M);
for(int i = 0; i < N; i++) {
cin >> x[i];
}
for(int i = 0; i < M; i++) {
... | 0 | 25,050,888 |
#include <iostream>
using namespace std;
int main(){
int n, x;
int y = 0;
while(1){
cin >> n >> x;
if(n == 0 && x == 0)
break;
for(int a=1; a<=n; a++){
for(int b=2; b<=n; b++){
for(int c=3; c<=n; c++){
if(a+b+c == x && a < b && b < c)
y++;
}
}
}
cout << y << endl;
y = 0;
}
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,r) for(int i = 0; i < (r); i++)
#define pb push_back
#define ALL(a) a.begin(), a.end()
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define uint unsigned long long
#define endl '\n'
template<typename T> ostream &operato... | 0 | 92,677,022 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
using namespace std;
long long int combination2(long long int c);
int main() {
long long int N, sum = 0;
cin >> N;
vector<long... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
long long h, w;
long long sa, sb, sc;
long long sb2, sc2;
long long smin(l... | 0 | 22,535,156 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#define pb push_back
... | 0 | 44,657,218 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <ctime>
#include <numeric>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <complex>
#include <deque>
#include <functional>
#include <list>
#in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | 0 | 68,354,594 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a=0, b=0;
cin >> a >> b;
cout << (a+b-1)/2+1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) cout ... | 0 | 88,882,904 |
#include<bits/stdc++.h>
using namespace std;
#define maxn 1e18
long long a[100005],b[250],len,c[250];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
if(a[i]==0)
{
cout<<"0"<<endl;
return 0;
}
}
long long sum=1;
for(int i... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> l, p;
ll func(ll n, ll x) {
if (n == 0)
return x;
if (x <= 1)
return 0;
else if (1 < x && x <= l[n-1]+1)
return func(n-1, x-1);
else if (x == l[n-1]+2)
return p[n-1] + 1;
else ... | 0 | 81,925,413 |
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
const double pi = 3.141592653589793;
struct Cordinate{
double x;
double y;
};
void kock( int n, Cordinate p1, Cordinate p2 ){
if( n==0 ){
return;
}
Cordinate s, t, u;
s.x = (2*p1.x+1*p2.x)/3;
s.y = (2*p1.y+1*p2.y)/3;
t.x = (1*... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,t;
cin>>n>>t;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
int ans=0;
for(int i=1;i<n;i++)
{
if((a[i]-a[i-1])>=t)
ans+=t;
else
ans+=a[i]-a[i-1];
}
ans+=t;
cout<<ans<<endl;
} | 0 | 35,938,123 |
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main(){
int n;
string str, s1;
string order;
int a, b;
cin >> str;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> order >> a >> b;
if (order == "print") {
for (int i = a; i <= b; i++) {
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | 0 | 62,513,315 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
long long N; cin >> N;
long long S = 0;
vector<long long> a(N), b(N);
for (int i = 0; i < N; ++i) cin >> a[i], S += a[i];
if (S % (N * (N+1)/2) != 0) {
cout << "NO" << endl;
return 0;
}
l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> pii;
typedef vector<pi> vpi;
typedef set<ll> si;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll INF = 1e9;
ll MOD = 1e9;
#define lb... | 0 | 46,729,438 |
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll n, m, t;
cin >> n;
m = n;
t = 0;
while (0 < m)
{
t++;
m ... | #include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
#include <numeric>
using namespace std;
typedef long long ll;
... | 0 | 72,363,950 |
#include<iostream>
#include <stdio.h>
#include<vector>
using namespace std;
int dfs(int n, int level){
if(n<0) return 0;
if (level == 0 && n<0) return 0;
if(level == 0 && n == 0) return 1;
if(level > 0){
int sum = 0;
for(int i=0; i<=9; i++){
if(i<=n)
sum += df... | #include <iostream>
int main() {
long long int n;
std::cin >> n;
long long exclude = -1, last = 1;
for (long long i = 1; i <= n; i++) {
long long t = i * (i + 1) / 2;
if (t > n) {
exclude = t - n;
last = i;
break;
}
}
for (long long i =... | 0 | 55,726,968 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
string s = "Christmas";
int n;
cin>>n;
while(n<25){
s+=" Eve";
n++;
}
cout<<s<<endl;
return 0;} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
const ll INF =1001001001;
int main(){
int A,B;
cin >> A >> B ;
int abottom;
if(A%2==0){
abottom = A*25/2;
}else abottom = A*25/2+1;
int atop;
if(A%2==0){
atop = (A+1)*25/2+1;
}else atop = (A... | 0 | 446,529 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, a[10000];
int MIN = 1000000;
int MAX = -1000000;
long long SUM = 0;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
MIN = min(MIN,a[i]);
MAX = max(MAX,a[i]);
SUM = SUM + a[i];
}
cout << MIN << " " << MAX ... | #include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, K;
cin >> N >> K;
double ans = 0;
double tmp_ans;
int score;
for ( int first_score=1; first_score<=N; first_score++ ) {
score = first_score;
tmp_ans = (double) 1 / N;
while ( score < K ) {
... | 0 | 54,255,656 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
template<typename T,typename U> using P=pair<T,U>;
template<typename T> using V=vector<T>;
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false... | 0 | 19,037,479 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<ll> mat(n);
ll rsum = 0;
for(int i = 0;i < n; ++i){
cin >> mat[i];
rsum ^= mat[i];
}
for(int i = 0;i < n; ++i){
mat[i] &= (~rsum);
}
ll l = 0; ... | 0 | 10,009,352 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define OUT(x) std::cout << (x) << std::endl
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
return 0;
}
if (A == 1) {
cout << "Alice" << endl... | #include <iostream>
#include <stack>
int main()
{
std::stack<int> s;
while (true) {
int n;
std::cin >> n;
if (std::cin.eof()) break;
if (n == 0) {
std::cout << s.top() << std::endl;
s.pop();
}
else s.push(n);
}
} | 0 | 86,046,714 |
#include<bits/stdc++.h>
using namespace std;
const int INF= 1e9+5;
typedef long long ll;
int main(){
int x,a,b;
cin>>x>>a>>b;
if(x+a<b)cout<<"dangerous"<<endl;
else if(b<=a)cout<<"delicious"<<endl;
else cout<<"safe"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | 0 | 54,075,606 |
#include <cstdio>
#include <algorithm>
using namespace std;
#define INF (1<<29)
int main(void) {
int n, m, a;
scanf("%d %d", &n, &m);
int c[m + 1], t[n+1];
for (int i = 0; i < m; i++) {
scanf("%d", &a);
c[i] = a;
}
for (int i = 0; i <= n; i++) t[i] = INF;
t[0] = 0;
for (i... | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | 0 | 86,695,642 |
#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(){
string o,e;
cin >> o >> e;
int size = max((int)o.size(), (int)e.size());
if((int)e.size() != (int)o.size()){
size--;
rep(i,size) cout << o[i] << e[i];
cout <<... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
using namespace std;
int main() {
int x, n,p[200];
cin >> x >> n;
for(int i = 0; i < n; i++)
cin >> p[i];
if(n == 0) {
cout << x << endl;
return 0;
}
bool flags = 0, flagt = 0;
for(int i = 0; ; i++) {
int ... | 0 | 8,351,216 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
int main() {
int N;
cin >> N;
double balance;
for (int i=0; i<N; i++){
double x;
string u;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<pair<int, int>> P(N);
for(int i = 0; i < N; ++i) {
int a; cin >> a;
P[i] = make_pair(a, i);
}
sort(P.begin(), P.end(), greater<pair<int, int>>());
multiset<int> ms;
ms.insert(-1);
ms.insert... | 0 | 89,305,629 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | #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 | 96,196,420 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<ll, n... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | 0 | 42,948,361 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
string n;
cin >> n;
string ans = "No";
rep(i, 3) if (n[i] == '7') ans = "Yes";
cout << ans << endl;
return 0;
} | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define ... | 0 | 60,011,599 |
#include<iostream>
using namespace std;
#define df 0
typedef long int li;
void rem(li x,li& you,li& others,int n);
int main(){
if(df) printf("*debug mode*\n");
int n; cin >> n;
li a[n],s=0;
for(auto& x:a){
cin >> x;
s+=x;
}
li y[n],oth[n];
for(int i=0;i<n;i++){
y[i]=oth[i]=0;
}
bool flag;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 61,122,033 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <cstdio>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <s... | #include <iostream>
using namespace std;
int main(){
int m,f,r;
while(cin>>m>>f>>r,m!=-1||f!=-1||r!=-1){
if(m==-1||f==-1)cout<<"F\n";
else if(m+f>=80)cout<<"A\n";
else if(80>m+f&&m+f>=65)cout<<"B\n";
else if(65>m+f&&m+f>=50)cout<<"C\n";
else if(50>m+f&&m+f>=30){
if(r>... | 0 | 9,715,690 |
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin>>s;
s.erase(s.length()-1,1);
for(int i=s.length()-1;i>1;i--) {
if(s.substr(0,(s.length()/2))==s.substr((s.length()/2),(s.length()/2))) {
cout<<s.length()-1<<endl;
break;
} else {
s.erase(s.length()-1,1);
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/keyence2020_c.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) ... | 0 | 45,163,101 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
ll A,B;
cin >> A >> B;
A--;
ll temp = 0, ansA = 0, ansB = 0;
if ((A/2) % 2 == 1) temp = 1;
ansA = temp ^ A;
if (A % 2 == 1) ansA = ansA ^ (A-1);
temp = 0;
if ((B... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | 0 | 60,502,943 |
#include <iostream>
using namespace std;
int main(){
int n,x,count;
while(1){
cin>>n>>x;
if(n==0 && x==0) break;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
if(i+j+k==x && i!=j && i!=k && j!=k && i<j && j<k) count++;
}
}
}
cout<<count<<endl;
count=0;... | #include <iostream>
#include <string>
#include <sstream>
using namespace std;
int main(){
int sum;
string inp;
ostringstream oss;
while (true){
cin >> inp;
if (inp == "0"){
break;
}
sum = 0;
for (unsigned int i = 0; i < inp.length(); i++){
sum += inp[i] - '0';
}
oss << sum << endl;
}
cout << o... | 0 | 27,071,685 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
int l,r;
cin >> l >> r;
int mi=2018*2018;
for (int i = l; ... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define DBG(...) \
do { \... | 0 | 89,563,696 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> SE... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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 ... | 0 | 60,436,651 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 14,798,359 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <functional>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
ll dp[100100][2];
int main()
{
string L;
cin >> L;
int N=L.size();
dp[0][0]=1;
for(int i=0;i<N;i++){
if(L[i]=='1'){
dp[i+1][0]+=dp[i][0]*2;
... | 0 | 94,663,719 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n... | #include <bits/stdc++.h>
#define sort stable_sort
using namespace std;
int _;
int n,k,a[100050],ans;
int main()
{
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++)
scanf("%d",a+i);
sort(a,a+n);
for(int i=n-1;i >= n-k;i--)
ans += a[i];
printf("%d\n",ans);
return 0;
} | 0 | 35,647,513 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
int K; cin >> K;
int R = min(N, K);
vector<int> V(N);
rep(i, N){
cin >> V[i];
}
int fa = 0;
for (int i = 0; i <= R; i++){
for (... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
const int INF=1e9;
struct edge{
int to,cost;
edge(int a,int b):to(a),cost(b){}
edge(){}
};
struct data{
int At,cost;
data(int a,int b):At(a),cost(b){}
data(){}
bool operator>(const data &d)const{
... | 0 | 72,537,180 |
#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;
int main() {
int n, m;
cin >> n >> m;
int a[n], b[n], c[m],... | #include <iostream>
#include <string>
#include <queue>
using namespace std;
int main() {
long long K;
cin >> K;
queue<long long> Que;
for (long long i = 1; i <= 9; i++) Que.push(i);
long long res = 0;
for (long long i = 0; i < K; i++){
long long a = Que.front();
Que.pop();
if (i == K - 1) res = ... | 0 | 94,748,797 |
#include<bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long bigmod(long long a, long long p){
if(p == 0){
return 1;
}
long long ans = bigmod(a, p/2);
ans = (ans * ans) % mod;
if(p % 2 == 1){
ans = (ans * a) % mod;
}
return ans;
}
int main(){
long long ... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int 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++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 21,708,871 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int h,w,d;
cin >> h >> w >> d;
vector<P> a(h*w);
rep(i,h){
rep(j,w){
int x;
cin >> x;
P p(i,j);
... | 0 | 89,889,865 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using LL = long long;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<long> VL;
int main() {
int n; cin >> n;
vector<int> A(n+1);
rep(i, n) {
cin >> A.at(i+1);
}
for(int i=1; i<n+1; i++) {
cou... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B,M,priceA,priceB,priceC;
cin>>A>>B>>M;
int a[A],b[B],x[M],y[M],c[M];
for(int i=0;i<A;i++){
cin>>a[i];
}
for(int i=0;i<B;i++){
cin>>b[i];
}
for(int i=0;i<M;i++){
cin>>x[i]>>y[i]>>c[i];
}
f... | 0 | 42,019,819 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,s,n) for(int i=s; i<n; i++)
#define ALL(x) x.begin(), x.end()
type... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"
int main () {
ios::sync_with_stdio (false);
cin.tie (0); cout.tie (0);
ll x, y;
cin >> x >> y;
ll ans;
if (x > y) {
if (x < 0)
ans = 2 + abs ... | 0 | 73,616,437 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a, T b) {if (a < b){a = b;return true;}... | #include <bits/stdc++.h>
using namespace std;
inline int ctoi(char c) { if(c < '0' || '9' < c) throw invalid_argument("ctoi error"); return c - '0'; }
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for(int i = (int)(k); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <typenam... | 0 | 87,043,975 |
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main() {
double a,b,c,C,S,h,L;
cin >> a >> b >> C;
h = b*sin(C * M_PI / 180);
S = 0.5 * a * h;
L = a+b+sqrt(a*a+b*b-2*a*b*cos(M_PI /180 * C));
cout << setprecision(10) << S << endl;
cout << setprecision(10) << L... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 0 | 49,943,000 |
#include<iostream>
#include<vector>
#define rep(i,n) for(int i=0; i<(n); ++i)
int main(){
int n,m; std::cin >> n >> m;
std::vector<bool> ac(n+1,false);
std::vector<int> wa_cnt(n+1,0);
rep(i,m){
int p;
std::string s;
std::cin >> p >> s;
if(ac[p]) continue;
if(s == ... | #include<cstdio>
using namespace std;
int upd(int x){
if(x == 1){
x = 9;
}
else if(x == 9){
x = 1;
}
return x;
}
int main(){
int n;
while(~scanf("%d", &n)){
int x = n/100, y = n%100/10, z = n%10;
x = upd(x);
y = upd(y);
z = upd(z);
prin... | 0 | 85,982,801 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.