code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
int C;
int D;
cin >> A >> B >> C >> D ;
if ((A+B)>(C+D)) {cout << "Left" << endl;}
else if ((A+B)==(C+D)) {cout << "Balanced" << endl;}
else if ((A+B)<(C+D)) {cout << "Right" << endl;}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | 0 | 73,800,054 |
#include <bits/stdc++.h>
#define sort stable_sort
using namespace std;
int _;
int a,b;
int main()
{
scanf("%d%d",&a,&b);
printf((a+b)%3 && a%3 && b%3 ?"Impossible\n":"Possible\n");
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <queue>
#include <cctype>
#include <climits>
#include <stack>
using namespace std;
template <typename T>
class UF{
public:
T ... | 0 | 49,907,297 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N,M,K;
cin >> N >> M >> K;
for(int y=0;y<=N;y++){
for(int x=0;x<=M;x++){
if(K == (M*y - y*x + x*(N-y))){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if ... | 0 | 38,581,705 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
in... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
... | 0 | 2,398,647 |
#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; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | #include <bits/stdc++.h>
#define int long long
#define pq priority_queue
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
map<string, int> anag;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
sort(s.begin(), s.end());
... | 0 | 75,317,254 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = unsigned long long;
using pii = pair<int, int>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7,maxn = 100000000;
const double PI = acos(-1);
ll fexp(ll base, ll p){
ll ans = 1;
while (p)... | 0 | 55,583,243 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a==b && a==c) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define mfill(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x,y,h,w) if(0<=x&&x<h&&0<=y&&y<w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr,__VA_ARGS__)
#else
#define debug(... | 0 | 47,656,345 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
typedef pair<ll,ll> pll;
#define reps(i,f,n) for(int i = int(f); i <= int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int>cnt(N+1, 0);
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
cnt[A]++;
}
sort(cnt.begin(), cnt.end());
int sum = 0;
vector<int>ans(N+1);
ans[0] = N+1;
... | 0 | 91,577,634 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<numeric>
#include<map>
#include<limits>
using namespace std;
#define R(i,s,n) for(int i=s;i<n;i++)
#define D(i,n,s) for(int i=n-1;i>=s;i--)
typedef pair... | 0 | 2,730,558 |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | #include <bits/stdc++.h>
signed main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int ticket[3][3];
bool scratched[3][3] = {};
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
std::cin >> ticket[i][j];
}
}
int q;
std::cin >> q;
... | 0 | 52,203,909 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,ans=0,p;
cin>>a>>b>>c;
if(a==b&&b==c){
cout<<0;
return 0;
}
while(1){
if(a%2==b%2&&b%2==c%2){
p=min(a,min(b,c));
if(a==p){
a+=2;
}
else if(b==p){
b+=2;
}
else{
c+=2;
}
ans++;
}
else if(a%2!=b%2&&a%2!=... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int H, W, D;
cin >> H >> W >> D;
map<int, pair<int, int>> A;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
int a;
cin >> a;
A.insert(make_pair(a, make_pair(i, j)));
}
}
i... | 0 | 50,999,223 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N,M;
cin>>N>>M;
if((M/2)<=N)
cout<<M/2<<endl;
else{
int64_t ans=(N+(M/2))/2;
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string Sd, T;
cin >> Sd;
cin >> T;
string S = "UNRESTORABLE";
int start = 0;
vector<string> match_results;
bool containded = false;
rep(i, Sd.size() - T.size() + 1)
{
... | 0 | 47,010,446 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< 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; } ret... | #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 repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int ex[7]={1,2,4,8,16,32,64};
int n;
... | 0 | 39,497,571 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
char c; cin>>c;
if(c=='A') cout<<"T\n";
else if(c=='T') cout<<"A\n";
else if(c=='G') cout<<"C\n";
else cout<<"G\n";
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 77,348,660 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll n,i,j,p,k,m,ans=0;
cin>>n;
vector<pa... | 0 | 92,386,313 |
#include <iostream>
using namespace std;
int sum(char *buf){
char *p = buf;
int sum = 0;
while(*p != 0){
if('0' <= *p && *p <= '9'){
sum += *p - '0';
}
p++;
}
return sum;
}
int main(int argc, char *argv[]){
char buf[1000+2];
while(1){
cin.getline(buf,sizeof(buf));
if (buf[0] == '0')break;
cout << ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
int main()
{
while (1)
{
int n; cin >> n;
if (n == 0) return 0;
int f = 1;
int l = 0, r = 0;
int ans = 0;
rep(i, 0, n)
{
string s; cin >> s;
if (s == "lu")
l = 1;
else if (s == "ru")
r = 1;
else if ... | 0 | 41,571,157 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
int main(){
int N, K;
scanf("%d", &N);
scanf("%d", &K);
long long ans = 0;
if (K%2==0){
int sho1 = N/K;
int sho2 = N/... | #include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | 0 | 110,365 |
#include<bits/stdc++.h>
#define LL long long
#define RG register
using namespace std;
template<class T> inline void read(T &x) {
x = 0; RG char c = getchar(); bool f = 0;
while (c != '-' && (c < '0' || c > '9')) c = getchar(); if (c == '-') c = getchar(), f = 1;
while (c >= '0' && c <= '9') x = x*10+c-48, c = getcha... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n;
ll ans=0;
cin>>n;
map<int,int> mp;
rep(i,n) {
int temp;
cin>>temp;
mp[temp]++;
}
... | 0 | 67,529,313 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rep2(i,n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using vi = vector<int>;
template <class T>
using Grid = vector<vector<T>>;
in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0... | 0 | 76,613,500 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string e = "";
for(int i = 0; i < s.size(); i++) {
if(s[i] == '0') {
e.push_back('0');
}
else if(s[i] == '1') {
e.push_back('1');
}
else if (s[i] == 'B' && e.size() > 0) {
e.pop_back();
}
}... | #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;
}
typedef long long int ll;
#defin... | 0 | 48,094,718 |
#include <iostream>
using namespace std;
int main()
{
int a, b, c, n;
cin >> a >> b >> c;
if (a==b && c%a==0) cout << 1 << "\n";
else {
for (int i=a; i<=b; i++) {
if (c%i==0) n++;
}
cout << n << "\n";
}
} | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 45,330,425 |
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
long long read() {
register long long x = 0;
register char f = 1, ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f ^= 1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ... | #include<bits/stdc++.h>
#include<string.h>
#define pb push_back
#define all(v) v.begin(),v.end()
#define see(x) cout<<#x<<" : "<<(x)<<endl;
#define ya cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define ff first
#define sc second
typedef unsigned long long ll;
using namespace std;
int main()
{
ll n,i,j,ans=0;
... | 0 | 79,467,037 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int main() {
cin >> s;
t = s;
reverse(t.begin(), t.end());
int n = s.size(), res = 0;
for (int l = 0, r = 0; l < n || r < n;) {
int cntl = 0, cntr = 0;
while (l < n && s[l] == 'x') ++l, ++cntl;
while (r < n && t[r] == 'x') ++r, ++cntr;
... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(... | 0 | 48,188,205 |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int a, b, c;
int count = 0;
cin >> a >> b >> c;
for (int div = a; div <= b; div++)
{
if (!(c%div))
count++;
}
cout << count << endl;
return 0;
} | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<cmath>
#include<bits/stdc++.h>
#define REP(i,n) for (int i = 0; (i) < (n); ++ (i))
#define FOR(i,n) for (int i = 1; (i) <= (n); ++ (i))
#define dump(x) cou... | 0 | 79,911,719 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
const int MOD = 1e9+7;
inline int add(int a, int b){ return (a+b)... | #include <iostream>
#include <cmath>
#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>
#inclu... | 0 | 58,275,928 |
#include <stdio.h>
int main() {
int arr[3][3]={};
for(int i=0; i<3; i++){
for(int j=0; j<3; j++){
scanf("%d", &arr[i][j]);
}
}
int n;
scanf("%d", &n);
int call;
for(int k=0; k<n; k++){
scanf("%d", &call);
for(int i=0; i<3; i++){
for(int j=0; j<3; j++){
if(arr[i][j]==call){
arr[i][j]=0;
}
... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define inf 100000000000000000
#define mod 1000000007
#define MAX 200005
#define pb push_back
#define mp make_pair
#define vit vector<int>::iterator
typedef pair<lint,lint> pii;
struct DSU{
vector<lint>parent,rank;
DSU(lint n){
parent.... | 0 | 58,126,080 |
#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 INF = 2147483647;
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i,n) cin >> d[i];
int sum=0;
rep(i,n){
for(int j=i+1;j<n;j++){
sum+=d[i]*d[j];
}
}
cout << sum << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | 0 | 10,240,916 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
typedef pair<int,int>pii;
typedef vector<int> vi;
typedef vector<vi> vii;
const int mxN=2e5+5,MOD=1e9+7;
int n,vis[mxN];
int dp[2][mxN];
vi adj[mxN];
void solve(int i,int p){
if(d... | #include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, cla... | 0 | 18,987,015 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int N, K;
vector<int> A;
int main() {
while (cin >> N >> K) {
A.resize(N);
for (int i = 0; i < N; ++i) cin >> A[i];
int res = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x,y,z,k;
cin >> x >> y >> z >> k;
ll a[x];
for(ll i=0;i<x;i++) cin >> a[i];
sort(a, a+x, greater<ll>());
ll b[y];
for(ll i=0;i<y;i++) cin >> b[i];
sort(b, b+y, greater<ll>());
ll c[z];
for(ll i=0;i... | 0 | 75,820,442 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main() {
string S;
getline(cin, S);
stack<int> st;
for (int i = 0; i < S.size(); i++){
int elem = S[i] - '0';
if (st.empty() || st.top() == elem)
st.push(elem);
else
st.pop();
... | 0 | 76,256,355 |
#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 <bits/stdc++.h>
using namespace std;
vector<int> countingSort(vector<int> &array,int n,int max){
vector<int> count_array(max+1,0);
for(int i=0;i<n;i++){
int x = array.at(i);
count_array.at(x) ++;
}
for(int i=1;i<=max;i++){
count_array.at(i) = count_array.at(i) + count_ar... | 0 | 14,851,886 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int sum,pl,pu;
long ansl,ansu,ans;
sum = 0;
pl = 0;
pu = 0;
ans = 0;
ansl = 0;
ansu = 0;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++) cin >> x[i];
for(int i = 0; i < n; i++){
... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
vector<pair<char,int>> RLE(string S){
vector<pair<char... | 0 | 100,518,207 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define float double
#define pb emplace_back
#define mp make_pair
#define pii ... | #include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
deque<int> deq;
int N; cin >> N;
while(N--){
string cmd; cin >> cmd;
if(cmd == "insert"){
int x; cin >> x;
deq.push_front(x);
}
else if(cmd == "d... | 0 | 51,613,021 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>func(int64_t x)... | #include <iostream>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#inclu... | 0 | 8,524,267 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n;
scanf("%d", &n);
int t = 0, x = 0, y = 0;
rep(i, n) {
int next_t, next_x, next_y;
scanf("%d%d%d", &next_t, &next_x, &next_y);
int distance = abs(x - next_x) + abs(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
int N=min(A,B);
int M=max(A,B);
int ans;
for(int i=1; i<N+1; i++){
if(M%(N-i+1)==0 && N%(N-i+1)==0) K--;
if(K==0){
ans=N-i+1;
break;
}
}
cout << ans <... | 0 | 29,389,141 |
#include <iostream>
using namespace std;
string kei[] = {".,!? ","abc","def","ghi",
"jkl","mno","pqrs","tuv","wxyz",};
int main(){
string str;
int n;
cin >> n;
while(n--){
cin >> str;
int cnt = 0;
for(int i = 0 ; i < str.size()-1 ; i++ ){
if(str[i] == str[i+1] && str[i] != '0')cnt++;
i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const long long INF = 2e18;
const long long MOD = 1e9+7;
#define sx(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i,n) for (int i = 0; i... | 0 | 51,320,916 |
#include<iostream>
#include<cstdio>
using namespace std;
void solve(int delta_x){
int number_of_rectangle, height_of_rectangle;
int integer = 0;
number_of_rectangle = 600 / delta_x;
for(int i = 1;i < number_of_rectangle;i++){
height_of_rectangle = (delta_x * i) * (delta_x * i);
integer += height_of_rectangle * ... | #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 <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | 0 | 91,770,824 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
voi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int a,b;
string s;
int main(void){
cin>>a>>b>>s;
for(int i=0;i<a+b+1;i++){
if(i==a){
if(s[i]!='-'){
cout<<"No"<<endl;
return 0;
}
}else{
... | 0 | 87,685,975 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define endt '\t'
#define ends ' '
#define die(x) return cout << x << endl, 0;
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {... | #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 | 51,240,194 |
#include<iostream>
using namespace std;
int main(){
int A[3][3],N,bingo[3][3];
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
cin >> A[i][j];
bingo[i][j]=0;
}
}
cin >> N;
for (int k = 0; k < N; k++){
int b;
cin >> b;
for (int i = 0; i < 3; i++){
for (int j ... | #include <bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> A(N);
copy_n(istream_iterator<unsigned long>(cin), N, A.begin());
vector<unsigned long> pw;
unsigned long x{0}, o{0};
for(const auto& i : A){
x ^= i;
o |= i;
}
... | 0 | 61,067,314 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
const int INFint = 1e9;
const ll INFll = 1e18;
ll MOD=1e9+7;
ll ... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 6,431,903 |
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S second
const in... | 0 | 37,629,648 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(),... | #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 mod 1000000007
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> vec(n+1);
rep(i, n+1) cin >> vec[i];
ll smallest = 0;
for(ll i=n; i>=0; i--){
if(i == n){
... | 0 | 20,696,226 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, K, X, Y;
cin >> N >> K >> X >> Y;
if(N >= K) cout << K * X + (N - K) * Y << endl;
else cout << N * X << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using ll = long long;
using namespace std;
int main(){
ll n; cin >> n;
vector<ll> p(n);
rep(i,n){
ll a; cin >> a; a--;
p[a] = i;
}
multiset<ll> check;
chec... | 0 | 75,054,367 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std;
const int N = 3e5 + 7;
const int mod = 1e9 + 7;
void solve1()
{
int n;
cin >> n;
vector < int > v(n + 2 , 0);
for( int i = 1; i <= n; i++ ){
cin >> v[i];
}
int sum = 0;
for( int i = ... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n;
cin>>n;
vector<ll>a(n);
rep(i,n)cin>>a[i];
map<ll,ll>mp;
rep(i,n){
mp[a[i]]++;
}
ll cnt=0;
for(auto p:mp){
if(p.first==p.second)cnt+=0;
... | 0 | 5,383,625 |
#include <iostream>
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define REP(i,n) FOR(i,0,n)
using namespace std;
int main(){
int m,min,max,gap,gapmax,n;
while(cin >> m >> min >> max && m != 0){
int p[m];
REP(i,m){
cin >> p[i];
}
gapmax = 0;
FOR(i,min,... | #include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | 0 | 69,420,635 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | #include <stdio.h>
int main()
{
char card[20001];
int maze,i,mvc,j,fc,cm,end=0;
while(1){
cm=0;
while(1){
scanf("%c",&card[cm]);
if(card[0]=='\n'){
continue;
}
if(card[0]=='-'){
goto theend;
}
if(card[cm]=='\n'&&cm!=0){
break;
}
cm++;
}
scanf("%... | 0 | 88,678,029 |
#include <bits/stdc++.h>
using namespace std;
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
#define rep1(i,a,b) for(int a_=(a),b_=(b),i=a_;i<b_;++... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define modP 1000000007
#define MAX_N 200002
using nam... | 0 | 68,401,939 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <set>
typedef long long ll;
using namespace std;
int main()
{
ll x,n,i,ans=10000001;
cin>>x>>n;
ll a;
set<ll>s;
for(i=0; i<n; i++)
{
cin>>a;
s.insert(a);
}
ll pos=10000001;
for(i=-15... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
int main() {
int N,M;
while(scanf("%d %d",&N,&M),N) {
priority_queue<P> Q;
for(int i=0;i<N;i++) {
int d,p;
scanf("%d %d",&d,&p);
Q.push(P(p,d));
}
int sum=0;
while(!... | 0 | 48,323,243 |
#include <iostream>
using namespace std;
int main() {
int N, X, T;
double num;
cin >> N >> X >> T;
num = N / X;
if (N % X) num++;
num *= T;
cout << int(num) << endl;
return 0;
} | #include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | 0 | 53,009,778 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
int64 k;
int main() {
scanf("%lld", &k);
int64 c = k / 50;
int64 r = k % 50;
if(c == 0) {
if(k == 0) {
printf("2\n0 0\n");
return 0;
}
if(k == 1) {
printf("2\n2 0\n");
return 0;
}
printf("%lld\n", k);
for(int i = 1; i <= ... | #include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int n[4];
for(int i = 0; i < 5; ++i)
cin >> n[i];
sort(n, n + 5, greater<int>());
for(int i = 0; i < 5; ++i){
if(i == 4)
cout << n[i] << endl;
else
cout << n[i] << " ";
}
return 0;
} | 0 | 23,768,220 |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<iterator>
#include<cmath>
#include<string>
#include<algorithm>
#include<sstream>
#include<queue>
#include<list>
#include<deque>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<chrono>
#include<iomanip>... | #include<bits/stdc++.h>
using namespace std;
int main(){
std::ios::sync_with_stdio(false);
list<unsigned long long> dat(0);
list<unsigned long long>::iterator t=dat.begin();
string com;
int n,a;
cin>>n;
for(int i=0; i<n; i++){
cin >> com;
if(com=="insert"){
cin >> a;
dat.push_front(a);... | 0 | 41,203,837 |
#include <iostream>
using namespace std;
int main(void){
int n;
int ai;
long long x=10000000000,y=(-100000000000),z=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>ai;
if(ai<x){
x=ai;
}
if(ai>y){
y=ai;
}
z=ai+z;
}
cout<<x<<" "<<y<... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define rrep(i,n) for(int i=(n);i>=0;--i)
#define ssort(n) sort((n).begin(),(n).end())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
#define Yes cout << "Yes" << endl
#de... | 0 | 41,453,082 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
vector<pair<string,ll>> v;
for(int i = 0;i<n;i++)
{
string s;
ll t;
cin>>s>>t;
pair<string,ll> p = {s,t};
v.push_back(p);
}
string x;
cin>>x;
bool check = 0;
ll ans = 0;
for(auto it = v.begin();it!=v.end();it++)
{
if(che... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
if (A.size()>B.size())
cout << "GREATER" << endl;
else if (A.size()<B.size())
cout << "LESS" << endl;
else{
bool eq = true;
int i=0;
while (eq){
if (A.at(i) > B.at(i)){
eq = false;
... | 0 | 76,419,344 |
#include<stdio.h>
int main()
{
int a,b,i, flag ;
char s[13];
while(~scanf("%d %d %s", &a, &b, s))
{
flag = 0;
if(s[a] != '-')
flag = 1;
if(!flag)
{
for(i=0; s[i] != 0; i++)
{
if(i==a) continue;
else if(s[i]<'0' || s[i]>'9')
{
flag = 1;
break;
}
}
}
if(flag) print... | #include <iostream>
using namespace std;
void func(int &points_A, int &points_B, string str1, string str2) {
int n;
int isLonger = 0;
if (str1.length() > str2.length()) {
n = str2.length();
isLonger = 1;
} else if (str1.length() < str2.length()) {
n = str1.length();
isLon... | 0 | 84,473,760 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | #include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ctime>
#define int long long
#define dou... | 0 | 44,780,810 |
#include <iostream>
#include <iomanip>
#include <map>
#include <utility>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 998244353;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
ll power(ll n, ll t)
{
ll r = 1;
repi(i, t, 0)
{
r *= n;
r %= MOD;
}
... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 98,643,410 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector <vc> vvc;
typedef vector <vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef ... | 0 | 86,440,885 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int... | 0 | 72,327,407 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int x;
cin >> x;
int div = x / 100;
int rem = x % 100;
bool ok = false;
if (x < 100) ok = false;
else if (rem == 0) ok = true;
else if (x >= div * 100 && x <= div * 105) {
ok = true... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
long long k;
cin >> k;
int n = (int)s.size();
if (s == string(n, s[0])) {
cout << n * k / 2 << '\n';
return 0;
}
long long cnt = 0;
for (int i = 0; i < n - 1; i++) {
... | 0 | 72,012 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i=s;i<n;++i)
#define drep(i,s,n) for (int i=n;i>=s;--i)
#define all(x) (x).begin(),(x).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define print(x) cout<<(x)<<endl
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b)
{if (a%b == 0) return(b);
else ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | 0 | 90,842,306 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
if (N % 2 == 0) cout << N/2 - 1 ... | #include <bits/stdc++.h>
using namespace std;
signed main () {
int n;
cin >> n;
vector < int > c(n - 1), s(n - 1), f(n - 1);
for (int i = 0; i < n - 1; ++i)
cin >> c[i] >> s[i] >> f[i];
for (int i = 0; i < n; ++i) {
int64_t ans = 0;
for (int j = i; j < n - 1; ++j) {
... | 0 | 72,410,403 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0; i < n; i++){
cin >> a.at(i);
}
for(int i=0; i < m; i++){
cin >> b.at(i);
}
re... | 0 | 57,384,075 |
#include <iostream>
#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 <climits>
#include <ctime>
... | #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 | 100,127,119 |
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
int main()
{
ll n, k;
cin >> n >> k;
vector<ll> val(1e+5 + 10, 0);
rep(i, n) {
ll a, b;
... | #include<cstdio>
int main(void){
int a=0,b=0,change=0;
while(true){
scanf("%d %d",&a,&b);
if((a==0)&&(b==0)){
break;
}
if(b<a){
change=a;
a=b;
b=change;
}
printf("%d %d\n",a,b);
}
return 0;
} | 0 | 57,577,779 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t X, Y, A, B, C, a, t, x = 0, y = 0, z = 0, ans = 0;
cin >> X >> Y >> A >> B >> C;
priority_queue<pair<int64_t, int64_t>> pq;
for (int i = 0; i < A; i++)
{
cin >> a;
pq.push({a, 0});
}
for (int i = 0; i < B; i++)
{
cin >> a;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define SIZE(x) ((int)(x).size())
#define UQ(v) v.erase(unique(v,begin(),v,end()),v.end());
ll INF = 1LL <<30;
#define pb push_back
int dxy4[5] = { 0,1,0,-1,0 };
int dxy8[9] = { 0,1,1,0,-1,1,-1,-1,0 };
int gcd(int a, int b) { return b ? gcd(b, a%b) : ... | 0 | 80,107,020 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | 0 | 91,108,085 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int X, A, B;
cin >> X >> A >> B;
if (A >= B) cout << "delicious" << endl;
else if (B - A <= X) cout << "safe... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> height(N);
for (ll i = 0; i < N; i++) {
cin >> height.at(i);
}
vector<vector<ll>> road(M, vector<ll>(2));
for (ll i = 0; i < M; i++) {
cin >> road.at(i).at(0) >> ro... | 0 | 82,826,778 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <climits>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <sstream>
#include <numeric>
using namespace st... | #include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main() {
int H, W;
while (cin >> H >> W && (H || W)) {
for (int i = 0; i < W; i++)
cout << "#";
cout << endl;
for (int i = 1; i < H - 1; i++) {
cout << "#";
for (int j = 1; j < W - 1; j++)
cout << ".";
cout << "#" ... | 0 | 39,809,686 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 0 | 3,467,661 |
#ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
int main()
{
int n;
cin >> n;
auto a = vector<int>(n);
for (auto& a_i : a) {
cin >> a_i;
}
auto factors = vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const ... | 0 | 34,361,723 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N; cin>>N;
ll count=1,ans=0,m=N;
for(ll i=0;i<N;i++){
ll a; cin>>a;
m=min(m,a);
if(a==count){
count++;
}else{
ans++;
}
}
if(m!=1){
cout<<-1<<endl... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 61,876,545 |
#include <iostream>
#include <string>
using namespace std;
int const NMAX = 1e5;
int v[1 + NMAX];
int main() {
int n, pos = 1, p, ans = 1;
string GUIDO;
cin >> n >> p;
ans *= p;
for(int i = 1;i < n;i++){
ans *= (p - 1);
}
cout << ans;
return 0;
} | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#in... | 0 | 11,412,002 |
#include <iostream>
using namespace std;
int main() {
int a1, a2, a3;
cin >> a1 >> a2 >> a3;
int maxdiff = max(abs(a1-a2), max(abs(a2-a3), abs(a3-a1)));
cout << abs(a1-a2) + abs(a2-a3) + abs(a3-a1) - maxdiff << endl;
} | #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 | 42,962,023 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
int res = 0;
res += (A>B) ? B : A;
res += (C>D) ? D : C;
cout << res << endl;
} | #include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
void _print(vector<int> res) {
for (int i = 1; i < res.size(); i++) {
cout << res[i] << " ";
}
cout << endl;
}
void maxHeap(vector<int> &heap, int i) {
int left = 2 * i;
int right = 2 * i + 1;
int lagest = i;
... | 0 | 47,176,888 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long Y,ans;
string s;
ans=0;
cin>>s>>Y;
for(int i=0;i<s.size();i++){
if(i%Y==0){
cout<<s[i];
}
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 75,171,215 |
#include <iostream>
int main(void){
std::string S, T, ans="No";
std::cin >> S >> T;
int N = S.size();
for (int i=0; i<N; ++i){
bool flg = true;
int loc = i;
for (int j=0; j<N; ++j){
if (loc + j >= N) loc -= N;
if (S.at(loc + j) != T.at(j)){
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fo(i, n) for(int i = 1; i <= n; ++i)
typedef long long ll;
const int N = 500505;
const int mod = 1e9 + 7;
int n, a[N], u, v;
vector<int> g[N];
inline void no() {
cout << "NO";
exit(0);
}
inline ll dfs(int v, int p = 0) {
vector<ll> h... | 0 | 68,821,415 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | #include <bits/stdc++.h>
#include <sstream>
#include <algorithm>
#include <map>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
using namespace std;
#define endl '\n'
#define ll long long int
#define c(x) ll x;cin>>x
#define cc(x,y) ll x,y;cin>>x>>y
#define ccc(x,y,z) ll x,y,z; cin>>x>>y>>z
#defi... | 0 | 66,400,456 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, l, r, G;
G = 0;
cin >> N;
for(int i = 0; i < N; i++) {
int p = 0;
cin >> l >> r;
p = ((r - l) + 1);
G += p;
}
cout << G << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <functional>
#include <complex>
#include <cmath>
#include <vector>
#include <climits>
#include <set>
using namespace std;
int main()
{
int n;
int g[10][10];
while (cin >> n, n) {
set<int> pat;
fill((int *)g, (int *)(g + 10), INT_MAX ... | 0 | 57,344,996 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
const do... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define lb lower_bound
#define ub upper_bound
#define srt(a) sort(a.begin(),a.end())
typedef vector<int> vi;
typedef vector<vi> vvi;
ty... | 0 | 77,114,381 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin,(obj).end()
#define SORT(li... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n+1);
for ( int i=0; i<n; i++ ) {
cin >> a[i];
}
for ( int i=0; i<k; i++ ) {
vector<int> b(n+1);
for ( int i=0; i<n; i++ ) {
int l=max(0,i-a[i]);
int r... | 0 | 82,817,427 |
#include <iostream>
#include <algorithm>
using namespace std;
int res[300000];
int main(){
long long n, a, b;
cin >> n >> a >> b;
if(a+b > n+1 || a*b < n){
cout << -1 << endl;
return 0;
}
int r = n;
int past = 0;
int i=0;
while(r > 0){
int len;
len = min(a, r - b + past + 1);
for(int m=r-len+1; m<=r; ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 23,316,076 |
#include <iostream>
using namespace std;
int many(int, int);
int main()
{
int a, b, c;
cin >> a;
cin >> b;
while (a != 0 || b != 0) {
c = many(a, b);
cout << c << endl;
cin >> a;
cin >> b;
}
return 0;
}
int many(int x, int y)
{
int n, m, r, p, q = 0;
for (n = 1; n <= x; n++) {
for (m = 1; m <= x; m+... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 0 | 50,311,649 |
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
void Fast()
{
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
}
inline int D()
{
int t;
scanf("%d",&t);
return t;
}
inline ll llD()
{
ll t;
scanf("%lld",&t);
return t;
}
... | #include <bits/stdc++.h>
using namespace std;
int n,k;
int h[305];
long long dp[305][305];
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%d",h+i);
}
memset(dp,0x3f,sizeof(dp));
dp[0][0]=0;
for(int i=0;i<=n;i++){
for(int j=0;j<=min(i,k);j++){
for(int k=i+1;k<=n+1;k++){
if(j+k-i-1<=::k){... | 0 | 83,947,370 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 61,161,635 |
#include <iostream>
using namespace std;
int main() {
int X, Y, x, y, r;
cin >> X >> Y >> x >> y >> r;
if (x + r <= X && x - r >= 0 && y + r <= Y && y - r >= 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define RE... | 0 | 40,325,753 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #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 | 41,398,879 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
void _read();
const int nax = 1e5 + 11, mod = 1e9 + 7;
int n;
vector<int> adj[nax];
int dp[nax][2];
void dfs( int u = 1, int p = 1 ) {
bool is = true;
dp[u][0] = dp[u][1] = ... | #include <bits/stdc++.h>
using namespace std;
int N;
int sides[3];
bool rtt(int* arr){
for(int i = 0; i < 3; i++){
if(arr[i] * arr[i] == arr[(i + 1) % 3] * arr[(i + 1) % 3] + arr[(i + 2) % 3] * arr[(i + 2) % 3]){
return true;
}
}
return false;
}
int main(){
cin >> N;
for(... | 0 | 34,826,924 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
vector<int>a(n);
for (auto &it : a)
cin >> it;
vector<int>ans(n);
ans[0] = 0;
ans[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++)
ans[i] = min(ans[i - 1] + ab... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
void solve() {
ll n;
cin >> n;
vector<string> v;
string x;
for (ll i = 0; i < n; ++i) {
cin >> x;
sort(x.begin(), x.end());
v.emplace_back(x);
}
sort(v.begin(), v.end());
vector<ll> aux;
ll len = 1;
for ... | 0 | 13,164,965 |
#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;
double ans = 0;
rep(i, n)
{
double a;
cin >> a;
ans += 1 / a;
}
printf("%.6lf\n", 1 / ans);
return 0;
} | #include <iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
using namespace std;
int main(void){
string s,t;
cin>>s>>t;
int sl= s.length();
int tl= t.length();
int i=0,j=0,l=-1;
for( i=0;i<(sl-tl+1);i++){
bool ok=true;
for( j=0;j<tl;j++){
if(s[i+j]!='?' && s[i+j]!=... | 0 | 20,060,187 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main() {
string s;
cin >> s;
if(s[0]!='A'){
cout << "WA" <<endl;
return 0;
}
int cnt = 0;
... | #include <bits/stdc++.h>
#define FOR(i, k, n) for(int i = (k); i < (n); i++)
#define FORe(i, k, n) for(int i = (k); i <= (n); i++)
#define FORr(i, k, n) for(int i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(int i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(... | 0 | 76,032,383 |
#include <math.h>
#include <assert.h>
#include <algorithm>
#include <set>
#include <iostream>
#include <vector>
#include <iomanip>
#include <queue>
#include <map>
#include <string>
#include <cstring>
#include <functional>
#include <stack>
#include <array>
#include <random>
#include <chrono>
#include <climits>
#include ... | #include <bits/stdc++.h>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> A(N);
for (int i = 0; i < N; i++) {
std::cin >> A[i];
}
if (N == 1) {
std::cout << 0 << std::endl;
return 0;
}
std::vector<std::vector<int>> dp(N, std::vector<int>(K));
dp[N -... | 0 | 70,961,453 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int ans = 0;
if (a >= k) {
ans += k;
a -= k;
k... | #include <bits/stdc++.h>
using namespace std;
long long a, b, h = 100, w = 100;
string ans[100];
void solve();
int main() {
cin >> a >> b;
solve();
cout << h << " " << w << endl;
for(int i = 0; i < h; ++i) cout << ans[i] << endl;
return 0;
}
void solve() {
int cnt = 1;
for(int i = 0; i < 50; ++i)
for(... | 0 | 85,689,959 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define sz size()
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).begin(), (x).end()
typedef long long ll;
ty... | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
ll N, A, B;
cin >> N >> A >> B;
if(!(N <= A * B && A + B - 1 <= N)){
cout << -1 << endl;
return 0;
}
vector<ll> v[B];
ll low = 1, up = N;
for(ll i = B - 1; 0 <= i; i--){
v[i].push_back(B - i)... | 0 | 66,507,387 |
#include<bits/stdc++.h>
#warning Check Max_Limit,Overflows
using namespace std;
# define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
# define ff first
# define ss second
# define pb push_back
# define mod 1000000007
# define ll long long
# define db double
# define pii pair<ll,ll>
# define inf (ll)1e18
# defi... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | 0 | 69,372,982 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 19,728,144 |
#include<iostream>
using namespace std;
int main(void){
long long x,y;
cin>>x>>y;
int cnt(1);
while(x*2<=y){
x *= 2;
cnt++;
}
cout<<cnt<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const char INF = '9' + 1;
int main(){
int n;
string data[50];
string temp[50];
string tmp;
string junban[10];
char minv;
int m;
int p[10] = {0};
int i,j;
cin >> n;
for(i = 0;i < n;i++){
cin >> data[i];
temp[i] = data[i];
junban[temp[i][1] -... | 0 | 43,695,010 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#define ll ... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll n,k;cin >>n>>k;
ll g=0;
vector<ll>a(n);
for (int i = 0; i < n; ++i) {
... | 0 | 41,913,202 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string ans;
if(n<1200) ans = "ABC";
else ans = "ARC";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 0 | 49,120,661 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
vector<vector<int>> vec(11);
int... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 29,697,422 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.