code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define fin ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i+= 1)
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
const int mod = 1e9+7;
int32_t main()
{
int n, m;
cin >> n >> m;
vector<string> in(n);
rep(i, n)
{
cin >> in[i];
}
int dp[n][m];
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
rep(i, n)
{
rep(j... | 0 | 40,948,427 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define sc... | 0 | 13,355,324 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#define ALL(v) (v).begin... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string s1;
string s2;
cin>>s1;
cin>>s2;
int l=s1.length();
int m=s2.length();
vector<vector<int>> Table(l+1,vector<int>(m+1));
for(int i=0;i<l+1;i++){
Table[i][0]=i;
}
for(int j=0;j<m... | 0 | 15,324,255 |
#include <queue>
#include <iostream>
using namespace std;
int main() {
string word;
priority_queue<int> Q;
while (cin >> word) {
if (word == "insert") {
int n;
cin >> n;
Q.push(n);
}
else if (word == "extract") {
int n = Q.top();
cout << Q.top() << endl;
Q.pop();
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int grid[105][105];
int main(){
int n;cin >> n;
vector<int> a(n);
rep(i,n) cin>> a[i];
ll ans... | 0 | 25,862,649 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
int max_x;
cin >> max_x;
rep(i, N - 1){
int x;
cin >> x;
max_x = max(max_x, x);
}
int min_y;... | #include <map>
#include <algorithm>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <string>
#include <iostream>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#include <bitset>
using namespace std;
using ll = long long;
using ld = long double;
template<class T... | 0 | 2,619,338 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1e5 + 7... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y;
cin >> N >> Y;
int x,y,z,ans=0,money;
for(x=0;x<=N;x++){
if(x*10000>Y){
break;
}
for(y=0;y<=N-x;y++){
z = N-x-y;
money = 10000*x+5000*y+1000*z;
if(money==Y){
ans=1;
... | 0 | 69,472,533 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a >... | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int n;
int bj[maxn];
int a[maxn];
int cnta[maxn];
int cntb[maxn];
typedef pair<int,int> pii;
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(i&1)
{
cnta[a[i]]++;... | 0 | 98,229,497 |
#include <iostream>
#include <algorithm>
#include <vector>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
int n,x;
while(cin >> n >> x)
{
if(n == 0 && x == 0) break;
int count = 0;
REP(i,1,n-1)
{
REP(j,i+1,n)
{
REP(k,j+1,n+1)
{
... | #include<bits/stdc++.h>
using namespace std;
long long N;
long long u[200005];
long long v[200005];
int main(){
cin >> N;
for(long long i = 0; i < N - 1; i++) {
cin >> u[i] >> v[i];
u[i]--; v[i]--;
if(u[i] > v[i]) {
swap(u[i], v[i]);
}
}
long long maxi = 0;
for(long long i = 0; i < N; i++) {
long long... | 0 | 50,135,784 |
#include <iostream>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
map<int, int> count;
rep(i, M) {
int a, b;
cin >> a >> b;
count[a]++;
count[b]++;
}
for (auto& num : count) {
if (num.second % 2) {
cout... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | 0 | 78,509,130 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <numeric>
#include <string>
#include <complex>
#include <algorithm>
#include <iostream>
#include <vector>
#include <bitset>
#include <deque>
#include <queue>
#include <map>
#include <utility>
#include <functional>
#include <iomanip>
#incl... | 0 | 66,081,574 |
#include <iostream>
using namespace std;
int main()
{
int x, y;
cin >> x >> y;
x = x * x;
x = x - y;
cout << x;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 68,685,283 |
#include<stdio.h>
int main()
{
int k,x;
scanf("%d %d",&k,&x);
k=k*500;
if(k>=x||k==x){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FO... | 0 | 64,753,040 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
bool diff = false;
long long ans = 0;
int big = 1E9 + 6;
for (int i = 0; i < n; i++)
{
int a, b;
cin >> a >> b;
ans += a;
if (a > b && b < big)
big = b;
diff = diff... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int fn(long long x, long long y, long long z){
return x*x + y*y + z*z + x*y... | 0 | 34,921,908 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main() {
double a, b, C;
double S, L, h;
cin >> a >> b >> C;
double D = acos(-1.0) * C /180.0;
S = a * b * sin(D) / 2.0;
L = a + b + sqrt(a*a + b*b -2*a*b*cos(D));
h = b*sin(D);
printf("%lf\n%lf\n%lf\n",S, L, h);
return 0;... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9+7
typedef long long int ll;
const int maxn = 1000;
ll mod = INF;
int main(){
int h,n;
int a[1000],b[1000];
int dp[10001];
cin >> h>>n;
for(int i=0;i<n;i++){
cin >> a[i]>>b[i];
}
for(int i=0;i<=10000;i++){
dp[i]=INF... | 0 | 55,251,050 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
string s;
cin >> s;
int a = 0,... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 69,582,896 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
bool compare(int a,int b){
return a<b;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
int p=0;
int count=0;
int max=0;
for(int i=0;i<s.size();i++){
if(s[i]=='R'){
count++... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){
vector<vector<int>> a(3, vector<int>(3));
int n, b;
rep(i, 3){
rep(j, 3){
cin >> a[i][j];
}
}
cin >> n;
vector<vector<int>> bingo(3,vector<int>(3));
rep(i, n){
... | 0 | 58,284,841 |
#include <iostream>
#include <string>
using namespace std;
const string L = "qwertasdfgzxcvb";
int main(){
string s;
while(cin >> s, s != "#"){
int ans = 0;
bool prev = L.find(s[0]) != string::npos;
for(int i=1; i<(int)s.size(); ++i){
bool cur = L.find(s[i]) != string::npos;... | #include <bits/stdc++.h>
using namespace std;
vector<int>ansl;
string s;
int main(){
int M,N_MIN,N_MAX;
cin >>M>>N_MIN>>N_MAX;
while(!((M==0)&&(N_MIN==0)&&(N_MAX==0))){
vector<int> v;
for(int i = 0;i<M;i++){
int x;
cin >>x;
v.push_back(x);
}
int ans = N_MIN-1;
int gap = v[N_M... | 0 | 59,748,605 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
if ((n[0] == n[1] && n[1] == n[2])
|| (n[1] == n[2] && n[2] == n[3])) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <string.h>
#include <iomanip>
using namespace std;
#define int long long
#define ul... | 0 | 20,032,739 |
#include <stdio.h>
int main() {
int n, ct = 0;
char s[105];
scanf("%d", &n);
scanf("%s", &s);
if (n % 2 != 0) {
printf("No");
return 0;
}
int half = n / 2;
for (int i = 0; i < half; i++) {
if (s[i] == s[i + half]) {
ct++;
}
}
if (ct == ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | 0 | 41,442,637 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << A[2] - A[0] << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
#define pll pair<ll, ll>
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B, C, K;
... | 0 | 77,052,540 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
int alp[26] = {};
while (cin >> s) {
for (int i = 0; i < s.length(); i++) {
if (s[i] < 'A') continue;
if (s[i] < 'a') alp[s[i] - 'A']++;
else alp[s[i] - 'a']++;
}
}
f... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#... | 0 | 59,563,464 |
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#... | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class T1, class T2>
bool chmax(T1 &l, const ... | 0 | 84,098,518 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? ... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define inf 100000000000000000
#define mod 1000000007
#define MAX 10000005
#define pb push_back
#define mp make_pair
#define vit vector<int>::iterator
typedef pair<lint,lint> pii;
bool prime[MAX];
int lowFactor[MAX];
void SIEVE(void){
for(int i=1... | 0 | 95,383,683 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
cin >> a[0];
cin >> a[1];
cin >> a[2];
sort(a, a+3);
printf("%d %d %d\n", a[0], a[1], a[2]);
} | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int bingo[3][3];
bool mark[3][3];
int main(){
for(int i=0; i<3; ++i){
for(int j=0; j<3; ++j){
int a;
cin >> a;
bingo[i][j] = a;
}
}
int N; cin >> N;
for(i... | 0 | 91,983,281 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for (int i = 0; i < 19; i++){
if (s[i] != ',')
cout << s[i];
else
cout << " ";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_ROW = 510;
const int MAX_COL = 510;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};
int GaussJordan(BitMatrix &A, b... | 0 | 44,844,036 |
#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;
cin >> h >> w;
vector<vector<int>> xs(h);
vector<vector<int>> ys(w);
rep(i, w) {
ys[i].push_back(0);
ys[i].push_back(h+1);
}
rep(i, h) ... | #include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define... | 0 | 16,232,900 |
#include <bits/stdc++.h>
using namespace std;
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; } return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;... | #include <algorithm>
#include <iostream>
using namespace std;
int n, m, v, p;
bool check(int *a, int i) {
if (a[i] + m < a[n-p]) return false;
else if (v <= i+p) return true;
long long amt = (long long)m * (v - (i + p));
for (int j = i+1; j <= n-p; j++) {
if (a[i] + m < a[j]) return false;
... | 0 | 98,054,982 |
#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 ... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | 0 | 77,547,262 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #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<vector<char>>;
using vbo=ve... | 0 | 83,948,806 |
#include <iostream>
using namespace std;
int main() {
int h, w, b;
char a;
cin >> h >> w;
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) {
string s;
cin >> s;
if (s=="snuke") {
a=65+j;
b=i+1;
}
}
}
cout << a << b;
} | #include<bits/stdc++.h>
#define li long long int
using namespace std;
int main(){
li n;
cin>>n;
if(n>=400&&n<600)
cout<<8<<endl;
if(n>=600&&n<800)
cout<<7<<endl;
if(n>=800&&n<1000)
cout<<6<<endl;
if(n>=1000&&n<1200)
cout<<5<<endl;
if(n>=1200&&n<1400)
cout<<4<<endl;
if... | 0 | 37,074,716 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
vector<ll> P;
vector<ll> C;
set<ll> roop(ll x,ll &point) {
set<ll> S;
S.insert(x);
ll k=x;
x=P[x-1];
point+=C[x-1];
while(x!=k) {
S.insert(x);
x=P[x-1];
point+=C[x-1];
}
return S;
}
int main() {
l... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 13,101,516 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a,b,c;
cin >>a >> b>> c;
if(c % gcd... | #include<bits/stdc++.h>
using std::cout;
using std::cin;
using std::endl;
int main()
{
int i=0, count=1;
char num[1001];
std::vector<int> sum(10, 0);
cin>>num;
while (1)
{
if (strcmp(num, "0")==0)
break;
for (int j = 0; j < std::strlen(num); j++)
{
... | 0 | 87,932,446 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N ;
cin >> N ;
map<long long , long long> A ;
for(int i = 0 ; i < N ; i++){
long long P ;
cin >> P ;
A[P]++ ;
}
long long X = 0 , Y = 0;
for(auto a : A){
if( a.second >= 2 && X <= a.first) {
Y = X ;
X = a.fir... | #include <iostream>
#include <climits>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define MOD 1000000007LL
int h,w;
int m;
set<pair<int, int>> t;
set<int> vt;
set<int> hr;
map<int, int> vn;
map<... | 0 | 72,710,196 |
#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 <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
string s[n] = {};
for ( int i = 0... | 0 | 25,359,612 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for(int i = 0; i < N; ++i){
cin >> A[i];
}
int cnt = 0;
for(int i = 0; i < N; ++i){
int minj = i;
for(int j = i; j < N; ++j){
if(A[j] < A[minj]) minj = j;
}
if(i != minj){
++cnt;
swap(A[i], A[minj]);
}
}
for(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define IN(type, n) type n; cin >> n
void count_num(ll n, unordered_map<ll, ll> &count, unordered_map<ll, ll> &over_count) {
if (over_count.count(n)) over_count[n]++;
else {
count[n]++;
if... | 0 | 59,244,926 |
#include <algorithm>
#include <complex>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<long double> point;
int main() {
int n; cin >> n;
vector<point> v(n);
for (int i = 0; i < n; i++) {
int x, y; cin >> x >> y;
v[i] = point(x, y);
}
sort(v.begin(), v.end... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <bitset>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define ALL(g) (g).begin(), (... | 0 | 2,544,268 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int N;
cin >> N;
vec<ll> A(N + 1), S(N + 1), M(N + 1);
rep(i, N + 1) cin >> A[i];
S[N] = A[N];
for (int i = N - 1; i >... | #include <iostream>
using namespace std;
int main( void )
{
int n,s;
while( 1 ){
int ret = 0;
cin>>n>>s;
if( n==0 && s==0 ) break;
for( int i=0; i < (1<<10); i++ ){
int a=1,b=0,c=0;
for( int j=0; j<10; j++ ){
if( i & a ){ b += j; c++; }
a <<= 1;
}
if( c == n &... | 0 | 93,833,237 |
#include <cstdio>
const int N = 9;
int main(){
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
printf("%dx%d=%d\n", i, j, i*j);
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
int main()
{
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
ll ans = 0, ind = 0;
... | 0 | 87,052,053 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
int ans=a[0];
for(int i=1;i<n-1;i++){
if(ab... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | 0 | 5,110,441 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,fl=0 ; cin>>a>>b>>c ;
for(int x=1 ; x<=100000 ; x++)
{
if((b*x+c)%a==0) {fl=1 ; break ;}
}
if(fl) cout<<"YES"<<endl ;
else cout<<"NO"<<endl ;
} | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 92,734,832 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a==b && b==c && a==c){
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
in... | 0 | 55,734,359 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | 0 | 72,474,872 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <bits/stdc++.h>
using namespace std;
int main(){
int s;
cin >> s;
vector<int> v;
for(int i=0; i<4; i++){
int a=s/pow(10,3-i);
a%=10;
v.push_back(a);
}
for (int i=0 ; i<(1<<(3)); i++){
bitset<3> p(i);
int ans=v[0];
for (int j=0; j<3; j++){
if(p[j]==1){
ans += v[... | 0 | 20,452,949 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
int l, r;
int L = 0, R = N;
for(int i = 0; i < M; i++) {
cin >> l >> r;
L = max(L,l);
R = min(R,r);
}
cout << (R - L >= 0)*(R - L + 1) << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const double PI=acos(-1.0);
int N,P; string S;
void input()
{
cin>>N>>P>>S;
}
void solve()
{
vi count(P,0);
ll ans=0;
if(P==2 || P==5){
for(ll i=0;i<N;+... | 0 | 79,659,881 |
#include <iostream>
#include <algorithm>
using namespace std;
static const int N = 101;
int main()
{
int n;
int p[N],m[N][N];
cin>>n;
for (int i = 1; i <= n; i++)
{
cin>>p[i-1]>>p[i];
m[i][i] = 0;
}
for (int l = 2; l <= n; l++)
{
for (int i = 1; i <= n-l+1; i++)
... | #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... | 0 | 28,392,740 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<cmath>
#include<numeric>
#include<iomanip>
#include<functional>
#include<cstdlib>
#include<queue>
#include<deque>
const double PI = acos(-1);
#define rep(i,n)for(int i=0;i<(n);i++)
using n... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, m;
cin >> n;
vector<string> A(n);
for (int i = 0; i < n; i++)cin >> A.at(i);
cin >> m;
vector<string> B(m);
for (int i = 0; i < m; i++)cin >> B.at(i);
vector<string> name(m+n, " ");
vector<int> mny(m+n, 0);
for (int i = 0; i < n; i++)
{
for ... | 0 | 43,291,952 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
ll g=1;
for(int i=0;i<n;i++)
{
ll t;cin>>t;
g=... | #include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
vector<string> ... | 0 | 47,598,029 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin >> s >> t;
for(int i=0;i<t.size();++i)
{
cout << s.at(i) << t.at(i);
}
if(t.size()<s.size()) cout << s.at(s.size()-1);
return 0;} | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
struct vec
{
int64_t x,y;
int quatr() const
{
if (x>0 && y>=0) return 0;
else if (x<=0 && y>0) return 1;
else if (x<0 && y<=0) return 2;
else if (x>=0 && y<0) return 3;
else return 666;
}... | 0 | 38,904,014 |
#include <bits/stdc++.h>
#define N 100005
using namespace std;
int n;
vector<int> g[N];
int dfs(int u, int fa) {
int sg = 0;
for(auto v : g[u]) {
if(v == fa) continue;
sg ^= dfs(v, u) + 1;
}
return sg;
}
int main() {
scanf("%d", &n);
for(int i = 1, u, v; i < n; ++i) {
sca... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | 0 | 94,140,382 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int n, k; cin >>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x,y;
cin>>x>>y;
if(x>0&&y==0){
cout<<x+1<<endl;
}
else if(x<0&&y==0){
cout<<abs(x)<<endl;
}
else if(x>=0&&y>=0){
if(x<=y)
cout<<y-x<<endl;
else
cout<<x-y+2<<endl;
}else if(x<0&&y<0)... | 0 | 76,321,535 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "... | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FORr(i,k,n) for(int64 i=(int64)k;i>=n;i--)
#define FORE... | 0 | 53,126,338 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size();
if(n<26){
map<char,int> mp;
char a='a';
for(int i=0;i<26;++i){
mp['a'+i]++;
}
for(int i=0;i<n;++i){
mp[s[i]]++;
}
bool ok=true;
for(auto p : mp){
if(p.second==1 && ok==t... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int x,n,i,ii,iii,answer=0,j,jj,jjj;
while(1){
cin>>n>>x;
answer=0;
if(x==0 && n==0){
break;
}
for(i=1;i<=n;i++){
for(ii=1;ii<=n;ii++){
for(iii=1;iii... | 0 | 56,168,605 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
const int N = 200200;
using namespace std;
int n;
int a[N];
set < pair < pair < int, int >, int > > s;
bool can(int m)
{
s.clear();
s.insert({{1, a[1]}, 1});
for(int i = 2; i <= n; i++){
if((--s.end(... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,an=INT_MAX,s;cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int k=-100;k<=100;k++)
{s=0;
for(int i=0;i<n;i++)
s+=(a[i]-k)*(a[i]-k);
an=min(an,s);
}
cout<<an<<endl;
} | 0 | 49,142,860 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "O3"
#define rep(i,a,n) for(long long i=a; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const double EPS = 1e-9;
const ll powll = 1LL<<1;
int main(void){
int m, nmin, nmax;
while(1){
... | #include<bits/stdc++.h>
using namespace std;
class disjoint_set {
private:
vector<int> id;
vector<int> rank;
public:
disjoint_set(int size) {
id = vector<int>(size);
rank = vector<int>(size);
for (size_t i = 0; i < size; i++) {
id[i] = i;
}
}
int size() {
return id.size();
}
int getRoot(int x) {
i... | 0 | 18,235,402 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int k;
cin >> k;
int a,b;
cin >> a >> b;
if(a%k==0||b%k==0){
cout << "OK" << endl;
}
else if(a/k<b/k){
cout << "OK" << endl;
}
else{
... | #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 < (n); ++i)
int main() {
string s;
cin >> s;
int w;
cin >> w;
int tmp_num = 0;
while(1) {
if ( tmp_num > s.length() - 1 ) {
break;
}
... | 0 | 9,312,460 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include<algorithm>
#include<iostream>
#define INF -11111111
using namespace std;
int main(){
int n;
int a[5555];
while(1){
int ret = INF,sum;
cin >> n;
if(!n)break;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
sum = 0;
for(int j=i;j<n;j++){
sum += a[j];
... | 0 | 29,592,479 |
#include <iostream>
using namespace std;
int main() {
int a,b;
scanf("%d%d",&a,&b);
int x=b,y=a,a1=a,b1=b;
while(x!=1)
{
a=a*10+a1;
--x;
}
while(y!=1)
{
b=b*10+b1;
--y;
}
int m=max(a,b);
printf("%d",m);
return... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | 0 | 75,217,525 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int mod... | 0 | 6,891,928 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #include <iostream>
using namespace std;
char d[1<<22];
unsigned char key[256];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, hash;
char com[8], str[16], *p;
key['A']=0;
key['C']=1;
key['G']=2;
key['T']=3;
cin>>n;
for(int i=0; i<n; i++) {
cin>>com>>str;
... | 0 | 65,948,160 |
#include <iostream>
using namespace std;
int main (){
int a,b,c,k,n=0;
cin >> a >> b >> c >> k;
while (!(a<b)){
b*=2;
n++;
}
while (!(b<c)){
c*=2;
n++;
}
if (k>=n) cout << "Yes";
else cout << "No";
} | #include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>... | 0 | 79,756,817 |
#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();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) f... | #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 | 57,793,688 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.... | 0 | 72,352,371 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double money = 100;
int n;
cin >> n;
for(int i=0;i<n;++i){
money *= 1.05;
money = ceil(money);
}
cout << (int)(money*1000) << endl;
} | #include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deq... | 0 | 39,261,696 |
#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 n, k, s;
cin >> n >> k >> s;
vector<int> a(n);
if (s == (int)1e9) {
rep(i, n) {
if (i < k) a[i] = s;
else a[i] = 1;
}
} else {
re... | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
int main()
{
int type_ref, type_mic, type_dis;
cin >> type_ref >> type_mic >> type_dis;
vec... | 0 | 76,551,939 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k; cin >> n >> k;
vector<int> data(n + 1, 0);
for (int i = 1 ; i <= n ; i++)
cin >> data[i], data[i]-... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | 0 | 1,760,105 |
#include<stdio.h>[
int main (){
int a,b,c;
scanf("%d%d%d",&a, &b, &c);
if(a < b && b < c) printf("Yes\n");
else printf("No\n");
return 0;
} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 0 | 9,068,945 |
#include <bits/stdc++.h>
using namespace std;
const int Mx = 1 << 17;
vector<int> N[Mx];
bool DFS(int v, int p = -1) {
int c = 0;
for(int u : N[v])
if(u != p)
c += DFS(u, v);
if(c == 0) return 1;
if(c == 1) return 0;
cout << "First";
exit(0);
}
int main() {
int n; cin >> n;
int m = 0;
for(int i = 1; i < n... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod ... | 0 | 56,486,496 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push
#define lld long long int
#define ins insert
#define adv advance
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl vector<long long int >
#... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | 0 | 92,858,491 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin >> n >> m;
int a[n];
int sum = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
int ans = 0;
for(int i = 0; i < n; i++){
if(a[i] * (4*m) >= sum){
ans++;
}
}
if(ans >= m){
cout << "Yes" << endl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,l,r) for(ll i=(l); i<(r); i++)
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& ... | 0 | 41,849,671 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
vector<int> v(n);
for(int i=0; i<n; i++) cin >> v[i];
sort(v.begin(), v.end());
int a=v[0], b=v[n-1];
int max = v[0]+k-v[n-1];
for(int i=1; i<n; i++) {
if(v[i]-v[i-1]>max) {
max = v[i]-v[i-1];
a = v[i], b... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie();
int n, m;
cin>>n>>m;
int a[n];
int total = 0;
for(int i = 0; i < n; i++){
cin>>a[i];
total +=a[i];
}
int div = 4*m;
int k = 0;
int temp;
if(total%div == 0)
... | 0 | 65,541,517 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
vector<ll> h(n);
rep(i,n) cin >> h[i];
sort(h.begin(),h.end());
ll ans = 0;
for (int i = 0; i < n-k; i++) {
ans += h[i];
}
cout << ans << en... | #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;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
int ans = 0;
rep(i, N - 1) {
if (a[i] == a[i + 1]) {
ans++;
a[i + 1] = 101 + i;
... | 0 | 89,150,227 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... ... | #include <iostream>
#include <string>
using namespace std;
int main(){
int m,f,r;
int num = 0;
string grade;
while(1){
cin >> m >> f >> r;
if(m == -1 && f == -1 && r ==-1) break;
if(m + f < 30 || m == -1 || f == -1) grade += 'F';
else if(m + f >= 80) grade += 'A';
... | 0 | 56,307,909 |
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <utility>
#include <typeinfo>
#include <tuple>... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M,X;
cin >>N>>M>>X;
vector<int> S(M,0);
vector<vector<int>> A(N,vector<int>(M+1));
for(int i=0;i<N;i++){
for(int j=0;j<M+1;j++){
cin >>A[i][j];
S[j]+=A[i][j];
}
}
int ans=10000000,e=0,cnt=0,d=0;
for(int i=0;i<1<<N;i++){
... | 0 | 96,305,297 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int N, M, K, ans;
cin >> N >> M >> K;
ans=0;
for (int i=0; i<=N; i++) {
for (int j=0; j<=M; j++) {
if (i*(M-j)+j*(N-i)==K) {
ans=ans+1;
}
}
}
if ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#defi... | 0 | 13,964,216 |
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define FT() int t; scanf("%d",&t); while(t--)
#define pb push_back
#define nl printf("\n")
#define fi(i,start,end) for(int i=start; i < (int)end ; ++i)
#define ip(n) scanf("%d",&n)
#defi... | #include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cctype>
#include <cstdlib>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
using namespace std;
bool debug=true;
int main(){
int n;
string s[10]={""... | 0 | 64,292,498 |
#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, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 0 | 54,697,989 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
ll k,a,b;
cin >>k >>a >>b;
ll ans=1;
if(k<=a-1){
cout << ans+k<< endl;
return 0;
}
else {
if(b-a<=2){
cout << ans+k<< endl;
return 0;
}
ans=a;k-=(a-1);
ans+=(b-a)*(k/2)+k%2;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | 0 | 23,539,211 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll res(ll x){
if(x%4==0) return x;
if(x%4==1) return 1;
if(x%4==2) return x+1;
if(x%4==3) return 0;
}
int main() {
ll a,b;
cin >> a >> b;
ll ansa=0,ansb=0;;
ll now=1;
a--;
ansa=re... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n=1;
int result[n];
for(int s=0;s<n;s++){
string x,y;
cin>>x;
cin>>y;
int x_size=x.size();
int y_size=y.size();
int score[x_size+1][y_size+1];
for(int i=0;i<x_size+1;i++){
score[i][0]=i;
... | 0 | 23,408,357 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int H, W; cin >> H >> W;
vector<string> s(H);
rep(i, H) cin >> s[i]... | #include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int n, k;
int ary[100000];
int main() {
while(1) {
scanf(" %d %d", &n, &k);
if(n == 0 && k == 0) break;
memset(ary, 0, sizeof ary);
rep(i,n) {
static int t;
scanf(" %d", &t);
ary[i] = t... | 0 | 46,981,612 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = pow(10, 9) + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
const long long INF = 1<<29;
int N,A,B,C;
vector<int> l;
int dfs(int i,int a,int b,int c){
if(i==N){
if(!a||!b||!c) return INF;
else return abs(A-a) + abs(B-b) + abs(C-c);
}
int res = dfs(i+1,a,b,c);
res ... | 0 | 18,575,105 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Arra... | #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... | 0 | 86,456,003 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rep2(i,s,n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#inc... | 0 | 16,645,182 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, h;
cin>>n>>h;
int a = 0;
vector<int> b(n);
for(int i = 0; i < n; i++){
int x; cin>... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 14,203,359 |
#include<iostream>
#include<string>
#include<stack>
int main(){
while(1){
std::stack<char>Cstr;
Cstr.push(' ');
std::string str;
int count=0;
std::getline(std::cin,str);
if(str==".")break;
for(int i=0;i<str.size();i++){
if(str[i]=='('||str[i]=='['){
count++;
Cstr.push(str[i]);
}else if(str[... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, N;
cin >> H >> N;
int s = 0;
int v;
for (int i = 0; i < N; ++i)
{
cin >> v;
s += v;
}
cout << (s >= H ? "Yes" : "No");
return 0;
} | 0 | 64,273,305 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <bits/stdc++.h>
#define N 1005
#define INF 0x3f3f3f3f
#define mod 1000000007
using namespace std;
typedef long long ll;
ll ans;
int main(){
ll n, k;
cin >> n >> k;
map <int,ll> mp;
for(int i=0; i<n; i++){
int a,b;
cin >> a >> b;
mp[a]+=b;
}
ll cntr = 0;
for(... | 0 | 70,272,999 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int N,M;
cin>>N>>M;
cout<<N*N-M<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double a, b, c,S,L,h;
cin >> a >> b >> c;
c = c * M_PI / 180;
S = ((a * b) * sin(c)) / 2;
L = a + b + sqrt(pow(a, 2) + pow(b, 2) - (2 * a * b * cos(c)));
h = b * sin(c);
cout.precision(15);
cout << S << endl;
cout... | 0 | 84,897,270 |
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(x, a, b) for(int x = (a); x <= (b); ++x)
#define rop(x, a, b) for(int x = (a); x < (b); ++x)
#define per(x, a, b) for(int x = (a); x >= (b); --x)
using namespace std;
typedef long long LL;
typedef double DB;
LL n,... | #include <iostream>
using namespace std;
int main(){
int n, b, f, r, v;
int oh[4][3][10] = { 0 };
cin >> n;
for(int i = 0; i < n; i++){
cin >> b >> f >> r >> v;
b--; f--; r--;
oh[b][f][r] += v;
}
for(int i = 0; i < 4; i++){
for(int j = 0; j < 3; j++){
for(int k = 0; k < 10; k++){
cout << ' ' << oh[... | 0 | 60,987,708 |
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define ll long long int
#define pb push_back
int m... | #include <bits/stdc++.h>
using namespace std;
int main () {
int H, N;
cin >> H >> N;
vector<vector<int>> M(N, vector<int>(2));
int K = 1000000000;
for (int i = 0; i < N; i++) {
cin >> M.at(i).at(0) >> M.at(i).at(1);
K = min(K, M.at(i).at(1));
}
sort(M.begin(), M.end());
vector<int> DP(H + 1, 100... | 0 | 90,762,975 |
#include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<set>
#include<vector>
#define INF 100000000
#define MAX_N 10000
#define MAX_M 100
typedef long long int ll;
using namespace std;
int main(){
int a,b,c;
scanf("%d %d %d", &a, &b, &c);
if(a < b && b < c)
... | using namespace std;
#include<iostream>
#include<stdio.h>
int main(){
int x;
cin >>x;
int a[x];
for (int j =1;j<=x;j++) cin>>a[j];
for (int i=1;i<=x;i++){
cout<<"node "<<i<<": key = "<<a[i]<<", ";
if(i>1) cout<<"parent key = "<<a[i/2]<<", ";
if(i*2<=x) cout<<"left key = "<<a[i*2]<<", ";
if((i*2)+1<=x) cout<<"right ... | 0 | 53,378,038 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | #include <bits/stdc++.h>
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 100005;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;
#define DEBUG
#define FORi(N) for(ll i = 0; i < N; ++i)
#define FORj(N) for(ll j = 0; j < N; ++j)
#define FORk(N) for(ll k ... | 0 | 50,334,316 |
#include <bits/stdc++.h>
#include <functional>
#include<stdio.h>
using namespace std;
#define ll long long int
#define dd long double
#define pb push_back
#define pf push_front
#define pi pair<ll,ll>
#define vi vector<ll>
#define vpi vector<pi>
#define mi ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int mod = 1e9 + 7;
ll dp[2020][2020];
ll sum[2020][2020];
int main() {
int n,m;
cin >> n >> m;
vector<int> s(n), t(m);
rep(i,n) cin >> s[i];
rep(i,m) cin >> t[i];
memset(dp,0,sizeof... | 0 | 69,020,212 |
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
string result = "Yes";
if (a >= b || b >= c) {
result = "No";
}
cout << result << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int a[100];
int list[4]={0,0,0,0};
for(int i=1;i<=10;i++){
cin>>a[i];
if(list[1]<a[i]){
list[3]=list[2];
list[2]=list[1];
list[1]=a[i];
}
else if(list[2]<a[i]){
list[3]=list[2];
list[2]=a[i];
}
else if(list[3]<a[i]){
list[3]=a[i];
}
... | 0 | 74,120,185 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<int> h;
... | #include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
#define bitcount(x) __builtin_popcount(x)
#define bitcountll(x) __builtin_popcountll(x)
#define in(a) scanf("%d",&a)
#define in2(a,b) scanf("%d%d",&a,&b)
... | 0 | 57,624,587 |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <numeric>
#include <vector>
#include <set>
#include <queue>
using namespace std;
int h,w,n;
char s[1252];
int mp[1252][1252];
int ys[11];
int xs[11];
bool used[1252][1252];
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
int bfs(int sy... | #include <bits/stdc++.h>
using namespace std;
long N, K, ans;
vector<long> A;
int main(void) {
cin >> N >> K;
A.resize(N, 0);
for (long i = 0; i < K; i++) {
long d; cin >> d;
for (long j = 0; j < d; j++) {
long a; cin >> a; a--;
A[a]++;
}
}
for (auto e... | 0 | 71,928,758 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 10000000... | #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() {
vector<int> a(5);
rep(i,5) cin >> a.at(i);
vector<int> b(5);
rep(i,5){
b.at(i)=a.at(i)%10;
}
rep(i,5){
if(b.at(i)==0)continue;
... | 0 | 14,838,277 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <func... | 0 | 30,709,991 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int32_... | #include<cstdio>
#include<algorithm>
using namespace std;
int a,b,c,d,S,T;
int main(){
scanf("%d%d%d%d",&a,&b,&c,&d);
S=a+b+c+d;
scanf("%d%d%d%d",&a,&b,&c,&d);
T=a+b+c+d;
printf("%d\n",max(S,T)); ... | 0 | 57,905,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(pos, len) for(int pos=0;pos<len;pos++)
#define repp(pos, len) for(int pos=1;pos<=len;pos++)
#define INF 987654321
#define IINF 2987654321987654321
#define MOD 998244353
const int MAXN = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
const long long int m=pow(10,9)+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,y;
cin>>n>>y;
for(ll i=0;i<=n;i++)
{
for(ll j=0;j<... | 0 | 63,146,082 |
#include<bits/stdc++.h>
typedef long long int ll;
#define optimization() ios_base::sync_with_stdio(0);
#define FOR(V,lim) for(ll V=0;V<lim;V++)
#define endl '\n'
using namespace std;
int main()
{
ll a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw"<<endl;
else if((a==1 || a>b) && b>1)
cout<<"Alice"<... | #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... | 0 | 41,876,282 |
#include<iostream>
int main(void){
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int cnt = 1;
char b = s[0];
for(int i = 1; i < n; i++){
if(s[i] != b){
cnt++;
b = s[i];
}
}
std::cout << cnt << std::endl;
return 0;
} | #include <bits/stdc++.h>
int main(){
int n,a,b,c,max;
bool output[1000]={false};
std::cin >> n;
for (int i=0;i<n;++i)
{
std::cin >> a >> b >> c;
if (a>b && a>c){
max = a;
a = 0;
}
else if (b>a && b>c){
max= b;
b = 0;
... | 0 | 40,688,757 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.