code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, ans = 0, h, w;
cin >> n >> h >> w;
for (int i = 0; i < n; i++)
{
int a, b;
cin >> a >> b;
ans += (a >= h && b >= w);
... | 1 | 50,795,943 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
using namespace std;
int N;
string input, keitai[10] = {"", ".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
stack<char> st;
int main(void){
cin >> N;
while(N--){
cin >> input;
for(int i = 0; i < in... | #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... | 1 | 2,395,085 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,LL> PL;
PL po(LL x){
LL y=sqrt(x-1)+1;
while((y-1)*(y-1)>=x)y--;
if(x>y*(y-1))return PL(y,y);
else return PL(y-1,y);
}
int main(){
LL n;cin>>n;
LL a=po(n).first,b=po(n).second;
LL sa=a*b-n;
c... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 1 | 8,653,406 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
vector<int >nos(n,0);
for(int i=0,a;i<n;i++){cin>>a;nos[i]=a-1;}
int tot=0;
for(int i=0;i<n;i++){
if(nos[nos[i]]==i)tot++;
}
cout<<tot/2;
} | #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... | 1 | 7,474,232 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,... | #include <cstdio>
#include <queue>
#include <string>
using namespace std;
template <class T>
using gp_queue=priority_queue<T, vector<T>, less<T>>;
int main() {
gp_queue<int> q;
for (char buf[1<<3]; scanf("%s", buf)!=EOF;) {
string instr(buf);
if (instr == "insert") {
int key;
... | 1 | 58,062,226 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | #include <iostream>
int main()
{
int x1, y1, x2, y2, x3, y3, x4, y4, a, b;
std::cin >> x1 >> y1 >> x2 >> y2;
a = x2 - x1;
b = y2 - y1;
x3 = x2 - b;
y3 = y2 + a;
x4 = x3 - a;
y4 = y3 - b;
std::cout << x3 << ' ' << y3 << ' '
<< x4 << ' ' << y4 << std::endl;
return 0;
} | 1 | 53,737,192 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
string S, T;
cin >> S >> T;
if(S.size() < T.size()) {
cout << "UNRESTORABLE\n";
return 0;
}
vector<int> candidate;
for(int i = 0; i <= S.size() - T.si... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
priority_queue<string, vector<string>, greater<string>> can;
for(int i = 0; i < s.size() - t.size() + 1; i++){
bool flag = true;
for(int j = 0; j < t.size(); j++){
if(s[i+j] != t[j] && s[i+... | 1 | 82,910,696 |
#include <bits/stdc++.h>
using namespace std;
int n;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++){
int ways = n / i - !(n % i);
ans += ways;
}
cout << ans << '\n';
return 0;
} | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull... | 1 | 74,076,548 |
#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;
cin >> n;
int64_t a[n];
rep(i,n) cin >> a[i];
sort(a, a+n);
int64_t suma[n+1];
suma[0] = 0;
rep(i,n) suma[i+1] = suma[i] + a[i];... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 1 | 43,865,577 |
#include<iostream>
using namespace std;
int main(void){
int coin[6]={500,100,50,10,5,1},price,sum;
while(cin>>price,price){
sum=0;
price=1000-price;
for(int i=0;i<6;i++){
while(price>=coin[i]){
price=price-coin[i];
sum++;
}
}
cout<<sum<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
n = 1000 - n;
int a = n / 500;
n %= 500;
int b = n / 100;
n %= 100;
int c = n / 50;
n %= 50;
int d = n / 10;
n %= 10;
int e = n / 5;
int... | 1 | 83,161,585 |
#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;
cin >> N;
vector<ll> A(N),B(N),ABdif(N);
ll sumA=0,sumB=0;
rep(i,N) {
cin >> A[i];
sumA+=A[i];
AB... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll, ll>> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define popcount(x) __builtin_popcountll(x)
const long double PI = acos(-1);
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll... | 1 | 96,938,885 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define inf 1e18
#define ps(x,y) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define yn(x) ((x) ? "Yes" : "No")
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
const int siz = 1e2 + 10;
const int SIZ = 1e6 + 10;
const ... | 1 | 27,825,567 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
int main() {
string S;
cin >> S;
if(S[3-1]==S[4-1]&&S[5-1]==S[6-1]) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb emplace_back
#define ll long long
#define ld long double
const int INF = 2e9 + 1;
const ll INFLL = 1e18 + 1;
const int mod = 1e9 + 7;
const int MAXN = 5e5 + 5;
int main() {
string s;
... | 1 | 8,508,830 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n,m,cnt=0,ans;
cin >> n >> m ;
int a[m];
for(int i=0; i<m; i++){
cin >> a[i] ;
cnt += a[i];
}
if(cnt > n){
ans = -1;
}else{
ans = n - cnt;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
static const double pi = 3.141592653589793;
int main(){
int n, m, a = 0, b, ans = 0;
cin >> n >> m;
for (int i = 0; i < m; i++){
cin >> b;
a = a + b;
}
if(0 <= n - a){
ans = n -a;
}else{
ans = -1;
}
cout << ans << endl;
} | 1 | 84,173,642 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <unordered_map>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
ll solve(){
int n,x,t;
cin>>n>>x>>t;
return ((n/x)+(n%x != 0))*t;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, X, T;
cin >> N >> X >> T;
int minute = 0;
while(N > 0){
minute += T;
N -= X;
}
cout << minute << endl;
} | 1 | 17,172,955 |
#include<bits/stdc++.h>
using namespace std;
char r[105];
int main(){
cin>>r;
int n=strlen(r);
for(int i=0;i<=n;i++)
for(int j=i;j<=n;j++){
string S="";
for(int k=0;k<i;k++)
S+=r[k];
for(int k=j;k<n;k++)
S+=r[k];
if(S.size()==7&&S=="keyence"){
cout<<"YES";
return 0;
}
}
cout<<"NO"... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T... | 1 | 89,445,216 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC return 0;
using namespace std;
int k, v[] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int main() {
DAU
cin >> k;
cout << v[k];
PLEC
} | #include<stdio.h>
#include<iostream>
int main(){
int n[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int i;
std::cin>>i;
std::cout<<n[i-1];
} | 1 | 21,436,406 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int gcd(int a, int b) {
if (b==0) return a;
else return gcd(b, a%b);
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main()
{
char x,y;
cin>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, a, b) for(int i = (a); i < (b); i++)
typedef long long ll;
int main() {
char x, y;
cin >> x >> y;
if (x < y) {
cout << "<" << endl;
} else if (x == y) {
cout << "=" << endl;
} else {... | 1 | 7,696,642 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n, n){
vector<int> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
int ans = 1e9;
for(int i = 0; i < n - 1; i++){
ans = min(ans, abs(v[i] - v[i + 1]));
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define INF 1LL << 55
#define MAX (1LL << 31) -1
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,int> P;
typedef pair<pair<int,int>,ll> p;
#define bit(n, k) ((n >> k) & 1)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
struct ... | 1 | 87,812,734 |
#include<iostream>
#include <list>
#include<stack>
#include<queue>
#include <vector>
#include <set>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<string>
#include <functional>
#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define REP(i,n) FOR((i),0,(n))
#define LL long long
#define CLR(a) memset(... | #include <cstdio>
#include <vector>
typedef long long ll;
int n,A,B;
std::vector<int> a[300005];
int main()
{
scanf("%d%d%d",&n,&A,&B);
if(A+B-1<=n&&n<=(ll)A*B)
{
for(int i=B;i>=1;--i)a[1].push_back(i);
int Rem=n-B,Nv=B+1;
for(int i=2;i<=A;++i)
{
int Cnt=Rem/(A-1)... | 1 | 4,044,522 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int A, B;
cin >> A >> B;
vector<vector<int>> ans(100, vector<int>(100, 0));
int i = 1;
int j = 1;
bool makeBlock = false;
while (A > 1) {
makeBlock = true;
ans[3 * i - 3][3 * j - 3] = 1;
ans[3 * i - 3][3 * j ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#define bit(n) (1LL << (n)... | 1 | 77,080,539 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;cin>>s;
int so = 0;
if(s == 4||s==2||s==1){
cout<<"4";
return 0;
}
for(int i = 1;;i++){
if(s%2 == 0) s=s/2;
else ... | 1 | 2,098,165 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s, t;
cin >> s >> t;
int ls = s.size();
int lt = t.size();
string ans = "UNRESTORABLE";
for (int si = 0; si + lt - 1 < ls; si++) {
string ss = s... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 1 | 98,481,048 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int ask(int c){
cout << c << endl; fflush(stdout);
string d; cin >> d;
if( d[0] == 'V'){ exit(0);}
return d[0] == 'M';
}
int main(){
int N; cin >> N;
int lb = 0; int lbt = ask(0);
int ub = N-1; int ubt = ask(N-1);
while(true){
in... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
int main() {
li n;
cin >> n;
cout << 0 << endl;
string state0;
cin >> state0;
if (state0 == "Vacant") {
return 0;... | 1 | 100,504,068 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main(){
std::cout<<std::fixed<<std::setprecision(10);
ll X, A;
... | #include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define rapgame ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define eb emplace_back
#define vi vector <int>
#define vlli vector <lli>
#define vulli vector <ulli>
#define vchar v... | 1 | 49,631,270 |
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define mp make_pair
#define pb push_back
#define F first
#define pi 3.14159265358979323846
#define S second
#define ll long long
#define ld long double
#define sz(s) (ll)s.size()
#define vl vecto... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false); cin.tie(NULL);
int t = 1;
while(t--) {
int n;
cin>>n;
int a[n], b[n], c[n];
f... | 1 | 21,084,957 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
typedef long long ll;
int main() {
string s;cin >> s;
rep(i,4)cout << s[i];
cout << ' ';
rep2(i,4,12)cout << s[i];
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i < (n);i++)
typedef long long ll;
typedef pair<int,int> P;
const int MOD = 1000000007;
int main(){
string s;
string subA,subB;
cin >>s;
rep(i,4)subA.push_back(s[i]);
for(int i = 4;i < 12;i++)subB.push_back(s[i]);
cout ... | 1 | 37,052,833 |
#include <iostream>
#include <math.h>
#include <vector>
#include <stack>
#include <cstdio>
#include <string>
#include <bitset>
#include <list>
#include <set>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <functional>
#include <queue>
#include <regex>
#include <cassert>
#include <map>
using n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9+7)
int main(){
int n;
cin >> n;
vector<int> yes;
int v = 2;
while(v*(v+1)/2<=n){
yes.push_back(v*(v+1)/2);
v++;... | 1 | 40,912,042 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
ll INF = (1LL << 60) - 1;
int MOD = 1e9+7;
ll calc(ll H, ll W){
ll mini = INF;
rep(h,1,H){
ll s1 = h * W;
ll s2 = (H-h) * (W/2);
ll s3 = (H-h) * ((W+1)/2);
mini = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 0x3f3f3f3f;
ll H, W;
void solve()
{
if(H%3==0 || W%3==0) cout << 0 << '\n';
else{
ll ans = 1e18;
for(int w=1;w<W;++w){
ll a1 = w*H, a2 = (W-w)*(H/2), a3 = H*W-a1-a2;
ll mx = max(a1,max(a2,a3));
ll mi = min(a1,min(a2,a3));... | 1 | 19,617,135 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | #include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inc... | 1 | 40,354,053 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
int main() {
int n;
cin >> n;
int ans;
for(int i = 1;; i *= 2){
if(i > n){
break;
}
ans = i;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main () {
int N; cin >> N;
int d = 2;
int max = 0;
while (true) {
if (N >= d) {
max = d;
d *= 2;
} else if (N <= 2) {
max = 1;
break;
} else {
break;
}
}
cout << max << endl;
return 0;
} | 1 | 75,240,244 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
string S, T, U;
int A, B;
cin >> S >> T;
cin >> A >> B;
cin >> U;
if (U == S) {
cout << (A - 1) << " " << B << endl;
}
else {
cout << A << " " << (B - 1) << endl;
}
}
int main() {
std::cout << std::fixed ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int) (x).size()
ll sum(int n);
void go(){
string s,t;cin>>s>>t;
int a,b;cin>>a>>b;
string u;cin>>u;
if(u==t) b--;
if(u==s)... | 1 | 64,843,726 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, K, R, S, P, ans = 0;
string T;
cin >> N >> K >> R >> S >> P >> T;
vector<char> A(N);
map<char, char> mp = {{'r', 'p'}, {'s', 'r'}, {'p', 's'}};
map<char, int> score = {{'r', R}, {'p', P}, {'s', S}};
for (int i = 0; i < N; i++)
{
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n , k , r , s , p;
string t;
cin >> n >> k >> r >> s >> p >> t;
string played(n , 'n');
auto opp = [](char c) {
if (c == 'r') return 'p';
if (c == 's') return 'r';
return 's';
};
auto score = [&](char c) {... | 1 | 80,576,175 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const int INF = 1000000;
const double PI=3.141... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vecto... | 1 | 97,892,138 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin>>s;
vector<char> v;
for(char c:s) v.push_back(c);
int s0=count(v.begin(),v.end(),'0'),s1=v.size()-s0;
cout<<abs(min(s0,s1)*2);
} | #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);
string s; cin>>s;
deque<char> dq;
for(auto ch : s){
if(dq.empty() || dq.back() == ch)dq.pus... | 1 | 6,213,030 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void){
ll n, m;
cin >> n >> m;
vector<int> c(n);
for (int i = 0; i < m; i++){
ll a, b;
cin >> a >> b;
a--; b--;
c[a] = (c[a] + 1) % 2;
c[b] = (c... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | 1 | 88,033,827 |
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 1e5 + 10 ;
int arr[MAX] ;
int n ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
int neg = 0 ;
for(int i = 0 ; i < n ; ++i)
{
cin>>arr[i] ;
if(arr[i] < 0)
neg++ ;
}
for(int i = 0 ; i < n ; ++i)
{
if(neg == n)
arr[i] *... | #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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 1 | 3,250,878 |
#include <iostream>
#include <vector>
using namespace std;
class DisjointSet{
public:
vector<int> p,r;
DisjointSet(int s){
p.resize(s,0);
r.resize(s,0);
int i;
for(i=0;i<s;i++){makeset(i);}
}
void makeset(int i){
p[i]=i;
r[i]=0;
}
bool same(int a,i... | #include <iostream>
#include <vector>
using namespace std;
class DisjointSet
{
public:
vector<int> rank,p;
DisjointSet() {}
DisjointSet(int size) {
rank.resize(size, 0);
p.resize(size, 0);
for (int i = 0; i < size; i++) {
p[i] = i;
rank[i] = 0;
}
... | 1 | 96,300,807 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i=s;i<n;i++)
int main()
{
int a,c;
char b;
cin >> a >> b >> c;
int ans;
if(b=='+')
ans=a+c;
else
ans=a-c;
cout << ans <<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string op;
int A, B;
cin >> A >> op >> B;
if (op == "+"){
cout << A + B << endl;
}
else if (op == "-"){
cout << A - B << endl;
}
} | 1 | 46,825,200 |
#include <bits/stdc++.h>
#define int long long
#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 e... | #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... | 1 | 19,095,373 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template<clas... | 1 | 9,352,984 |
#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<iostream>
#include<fstream>
#include<numeric>
#include<string>
#include<assert.h>
#include<vector>
#include<cstring>
#include<map>
#include<iter... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n;
cin>>n;
ll a[n];
ll sum=0,mn=0;
for(int i=0;i<n;i++){
cin>>a[i];
mn=__gcd(mn,a[i]);
}
cout<<mn<<endl;
} | 1 | 39,667,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll a[1010],sum[1010];
int main(){
ll n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
vector<ll>v;
for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++)v.push_back(sum[j]-sum[i-1]);
ll ans=0;
for(int i... | #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... | 1 | 95,861,979 |
#include <iostream>
using namespace std;
int main()
{
long long int a {},b {},c {},d {};
cin >>a>>b>>c>>d;
cout << max(max(a*c,a*d),max(b*c,b*d));
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typed... | 1 | 99,789,520 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;cin>>n>>m;
vector<ll> x(n),y(n),z(n);
rep(i,n)cin>>x[i]>>y[i]>>z[i];
ll ans=0;
for(int tmp=0;tmp<1<<3;tmp++){
b... | #include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define... | 1 | 8,775,391 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (scanf("%d", &x)==1) return x; el... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | 1 | 59,841,276 |
#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(n,v) cout<<#v<<":";for(int i=0;i<n;i++)cout<<v[i]<<" ";cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-... | #include <iostream>
#include <cstdio>
#include <string>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <vector>
#define REP(i,n) for(long long int i=0;i<n;i++)
#define P 1000000007
using namespace std;
long long int powmp(long long x,long long n){
const long long p = 1000000007;
if(n=... | 1 | 24,759,517 |
#include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int i;
int n;
long long int sum=1;
cin>>n;
for(i=1;i<=n;i++)
{
sum*=i;
}
cout<<sum<<endl;
} | #include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
long long int i = 1;
while (n >= 1) {
i *= n;
n--;
}
cout << i<<endl;;
return 0;
} | 1 | 43,637,461 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, s=0;
cin >> A >> B;
for(int i=A;i<=B;i++) if(i/10000==i%10 && i/1000%10==i/10%10) s++;
cout << s << endl;
} | #include<bits/stdc++.h>
#include<sstream>
using namespace std;
int main()
{
long long int a,b,i,n,flag=1,m,d,j,count=0;
cin>>a>>b;
for(i=a;i<=b;i++)
{
n=i;
ostringstream str1;
str1<<n;
string s=str1.str();
m=s.length();
d=m/2;
for(j=0;j<d;j++)
{
if(s[j]!=s[m-1-j])
{
flag=0;
break;
}
}
if(flag=... | 1 | 2,990,575 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
vector<ll> arr;
vector<int> pos;
ll fast_pow(ll a, int b) {
if(b==1) return a;
ll half = fast_pow(a, b/2);
ll ret = half*half%mod;
if(b%2) ret = ret*a%mod;
return ret;
}
ll mod_in... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;
#define N 100010
ll inv[N],fac[N],ifac[N];
int main(){
int n;
cin>>n;
int a[n+1]={};
int left,right;
for(int i=1;i<=n+1;i++){
ll d;
cin>>d;
... | 1 | 39,385,154 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n), b(n), d(n);
for(auto& e : a) cin >> e;
for(auto& e : b) cin >> e;
int64_t sum = 0, cnt = 0;
for(int i = 0; i < n; i++){
d[i] = a[i] - b[i];
if(d[i] < 0){
sum += d[i];... | 1 | 93,300,880 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using pint = pair<int,int>;
using vec = vector<int>;
using ll=long long;
u... | #include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
int main()... | 1 | 39,639,984 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 44,905,184 |
#include<iostream>
#include<vector>
using namespace std;
int N;
vector<int> streak;
int input[100 + 10];
int main() {
cin >> N;
for (int i = 0; i < N; i++)cin >> input[i];
int length = 1;
for (int i = 1; i < N; i++) {
if (input[i] == input[i - 1])length++;
else {
streak.push_back(length);
length = 1;
}
... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" ... | 1 | 4,431,289 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
vector<ll> a(n),b(100001,0);
rep(i,n){
cin >> a.at(i);
b.at(a.at(i))++;
}
ll ans=0,maxi=0;
for(int i=1;i<100000;i++){
maxi=b.at(i-1)+b.at(i)+b.at(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 1 | 82,498,821 |
#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 DEBUG
#define fi first
#defin... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, k;
cin >> a >> b >> c >> k;
if (k <= a)
cout << k << endl;
else if (k <= a + b)
cout << a << endl;
else
cout << a - (k - a - b) << endl;
return 0;
} | 1 | 52,952,480 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using ll = long long;
int main() {
ll q, h, s, d, n; cin >> q >> h >> s >> d >> n;
ll c = min(q * 4, min(h * 2, s));
if (c * 2 <= d) cout << n * c << endl;
else cout << d * (n / 2) + c * (n % 2) << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long counter=0;
long long n,a,s,d,r;
cin>>n>>a>>s>>d>>r;
long long b[3]={};
b[0]=n*4;
b[1]=a*2;
b[2]=s;
sort(b,b+3);
if(b[0]*2<=d){
cout<<r*b[0]<<endl;}
else if(r%2==0){
cout<<r/2*d<<endl;}
else{
cout<<(r-1)/2*d+b[0]<<endl;}} | 1 | 77,163,959 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
int n;
cin>>n;
deque<int>q;
for(int i=0;i<n;i++){
int a;
cin>>a;
if(i%2==0){
q.push_back(a)... | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pf push_front
#define pb push_back
#define debug(val) cerr << "The Value Of " << #val << " is : " << val << '\n';
typedef long double ld;
typedef ... | 1 | 73,456,193 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int ans,n;
int a[3];
void dfs(ve<int> &l, string s){
if(s.size() == n){
ve<int> l0(4,0),cnt(4,0);
rep(i,n){
l0[s[i]-'0'] += l[i... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 1 | 55,182,156 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const int N = 1e6 + 1;
signed main () {
ios_base::sync_with_stdio(NULL);
cin.tie(0); cout.tie(0);
int x;
cin >> x;
for (int i = 1;;i++) if (x * i % 360 == 0) return cout << i, 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
int ans=0;
for(int k=1;k<=360;k++)
{
if((k*x)%360==0)
{
ans=k;
break;
}
}
cout<<ans<<"\n";
return 0;
} | 1 | 22,086,882 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int b[n];
for(int i = 0;i < n-1;i++) cin >> b[i];
int a[n+1] = {0};
a[0] = b[0];
a[n-1] = b[n-2];
int sum = a[0] + a[n-1];
for(int i = 1;i < n-1;i++){
a[i] = min(b[i-1],b[i]);
sum += a[i];
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 105;
int a[N];
int n, b;
int main() {
cin >> n... | 1 | 65,990,463 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C;
D=min((A+B),(B+C));
cout << min((C+A),D) << endl;
} | #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... | 1 | 65,689,149 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
vector<int>E[10000];
int in[10000];
bool used[10000];
int main() {
int v, e; scanf("%d%d", &v, &e);
rep(i, e) {
int s, t; scanf("%d%d", &s, &t);
E[s].push_back(t);
in[t]++;
}
list<int>ls;
queue<int>que;
rep(i, v) {
if (!used... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
const int MAX_V = 10000;
const int MAX_E = 100000;
const int NO = 0;
const int MID = 1;
const int YES = 2;
vector<int> v_connection[MAX_V];
in... | 1 | 37,332,333 |
#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 <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int l[51];
for (int i = 0; i < N; i++) cin >> l[i];
sort(l, l + N, greater<int>());
int total_length = 0;
for (int i = 0; i < K; i++) total_length += l[i];
cout << total_length << endl;
} | 1 | 93,395,178 |
#include <cstdio>
#include <iostream>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int n, b, f, r, v;
int board[4][3][10];
int main() {
cin >> n;
rep(i,n) {
cin >> b >> f >> r >> v;
board[b - 1][f - 1][r - 1] += v;
}
rep(i,4) {
rep(j,3) {
rep(... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <unordered_map>
#include <math.h>
using namespace std;
#define _USE_MATH_DEFINES
int a[4][3][10];
int main() {
int b, r, f, v;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> b >> f >>... | 1 | 1,687,453 |
#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() {
ll n, p;
cin >> n >> p;
string s;
cin >> s;
ll amari[220000];
map<ll,ll> mp;
ll ten = 10LL;
if(p==2 || p==5) {
ll ans = 0LL;
rep(i,s.size()) {
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
int32_t main(){
int n,p;
cin>>n>>p;
string str;
cin>>str;
int ans=0;
if(p==2 || p==5){
for(int i=0;i<n;i++){
... | 1 | 49,306,813 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template... | #include<cstdio>
using namespace std;
using ll = long long;
const static int MOD = 1000000007;
int main(){
ll X, Y;
scanf("%lld %lld", &X, &Y);
if(X - Y >= -1 && Y - X >= -1) printf("Brown\n");
else printf("Alice\n");
return 0;
} | 1 | 22,442,478 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
ll a,b,k; cin >> a >> b >> k;
if(a>=k) a-=k;
else{
b-=k-a;
a=0;
}
if(b<0) b=0;
cout << a << " " << b <... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll a,b,k;
... | 1 | 71,650,094 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 1 | 14,249,981 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <iterator>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<28
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
struct edge
{
int to;
int cost;
edge(in... | #include<iostream>
#include<vector>
using namespace std;
#define FOR(i,a) for(int i=0;i<(int)(a);i++)
#define pb push_back
#define clr clear()
#define sz size()
typedef unsigned int ui;
class node{
public:
int num;
void set(int n){num = n;}
bool equal(int a){
return num == a;
}
};
class edge{
public:
node... | 1 | 60,272,972 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int n, m, k, ans;
unordered_set<string> s... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N ;
cin >> N;
vector<string> w(N);
for(int i= 0; i<N; i++){
cin >> w.at(i);
}
for(int i = 0; i<N-1; i++){
for(int j= i+1; j<N; j++){
if(w.at(i) == w.at(j)){
cout << "No" << endl;
return 0;
}
}
}
for(int ... | 1 | 100,125,765 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<ll> H(N);
for(int i = 0; i < N; i++){
cin >> H.at(i);
}
vector<bool> C(N,true);
for(int i = 0; i < M; i++){
ll A, B;
cin >> A >> B;
if(H.at(A-1) < ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
int N, M, H[100010];
vector<int> G[100010];
int main(){
cin >> N >> M;
rep(i, N) cin >> H[i];
rep(i, M){
... | 1 | 40,355,497 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s; cin >> s;
regex r ("(dream|dreamer|erase|eraser)*");
cout << ((regex_match(s, r)) ? "YES" : "NO") << endl;
} | #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<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define _GLIBCXX_DEBUG
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_el... | 1 | 10,125,183 |
#include<iostream>
using namespace std;
int main(){
int i=0;
int j=0;
int a,b,c;
cin>>a>>b>>c;
int k;
cin>>k;
while(1){
if(a<b)break;
i++;
b*=2;
}
while(1){
if(b<c)break;
j++;
c*=2;
}
if(k<(i+j)){
cout<<"No"<<endl;
}else{
cout<<"Yes"<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int A, B, C;
int K;
cin >> A >> B >> C;
cin >> K;
for (int i = 0; i <= K; ++i)
{
if (A < B * pow(2, i) && B * pow(2, i) < C * pow(2, K - i))
{
cout << "Yes" << endl;
return 0;... | 1 | 6,393,323 |
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if (r <= x && x <= W-r && r <= y && y <= H-r)
cout << "Yes\n";
else
cout << "No\n";
} | #include <iostream>
using namespace std;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
int a = r;
int b = W - r;
int c = r;
int d = H - r;
if (x >= a && x <= b && y >= c && y <= d) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | 1 | 54,172,125 |
#include <bits/stdc++.h>
using namespace std;
inline void read (int &x) {
char ch = getchar(); x = 0;
while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
} const int N = 105;
int h, w, f[N][N], k[N][N]; char ch[N];
#define judge(i, j, x, y) (k[i][j] == 1 && k[x][y] == 0)
si... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#d... | 1 | 15,165,522 |
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int s;
cin >> s;
map<int, int> mp;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | 1 | 37,441,116 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
int n;
cin >> n;
ll a[n];
REP(i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;cin>>N;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
int64_t ans=A.at(0)-1;int64_t a=2;
for(int i=1;i<N;i++){
if(A.at(i)==a)a++;
else
ans+=(A.at(i)-1)/a;
}cout<<ans<<endl;
return 0;
} | 1 | 50,360,169 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb em... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
vec l(1e5+5),r(1e5+5),w(1e5+5);
int main() {
ll n;
cin >> n;
for(ll i=1;i<=n;i++) {
ll tmp;
cin >> tmp;
w[tmp]=i;
l[i]... | 1 | 12,354,562 |
#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1e9 + 7;
vector<ll> d... | #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)
const int MAX = 1000010;
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;
... | 1 | 79,452,938 |
#include <iostream>
#include <cstdio>
int search(int i, int left, int count){
if(i == 10){
return left == 0 && count == 0;
}
return search(i + 1, left, count) + search(i + 1, left - i, count - 1);
}
int main(){
int n, s;
while(scanf("%d%d", &n, &s), n + s){
std::cout << search(0, s, n) << std::endl;
}
return... | #include <iostream>
using namespace std;
int cnt, n, s;
void dfs(int num, int d, int sum) {
if (d == n) {
if (sum == s) {
cnt++;
}
return;
}
if (num == 10) {
return;
}
dfs(num + 1, d, sum);
dfs(num + 1, d + 1, sum + num);
}
int main() {
while (1) {... | 1 | 6,203,050 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ld long double
#define ff first
#... | 1 | 61,363,557 |
#include <iostream>
#include <vector>
#include<cmath>
#include <set>
#include <map>
#include<cstring>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define ll long long
#define N 200005
#define fori for(i=0;i<n;i++)
#define fori1 for(i=1;i<=n;i++)
const int mod = 1e9 + 7;
ll a[3*N];
char s... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 1 | 3,268,412 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
int n, m, p[12];
vector<int> x[12];
cin >> n >> m;
rep(i, m) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rev(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 rev2(i, s, n) for (int i = (int)(n) - 1; i >= (int)(s); i--)
#define bitrep(i, n) for (int i = 0... | 1 | 57,399,953 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int A,B;
cin >> A >> B;
for (int i = 1; i <= 1500; ++i)
{
int tax8 = i * 8 / 100, tax10 = i * 10 / 100;
if (tax8 == A && tax10 == B)
{
cout << i << endl;
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
int main(){
int a, b;
cin >> a >> b;
int M=10*b;
int cnt=0;
rep(i,10){
if(floor((M+0.0)*0.08)==a){
cout << M;
return 0;
}
M++;
}
... | 1 | 2,951,931 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
void print_btree(vector<int> btree){
for(int i=1;i<btree.size();i++){
cout<<"node "<<i<<": key = "<<btree[i]<<", ";
if(i != 1)
cout<<"parent key = "<<btree[i/2]<<", ";
if(2*i < btree.size())
cout<<"left key = ... | #include <stdio.h>
#define MAX_H (260)
typedef struct
{
int key;
int parent_id;
int left_id;
int right_id;
} Node;
int H;
Node A[MAX_H + 1];
int main()
{
scanf("%d", &H);
for ( int i = 1; i <= H; i++ ) {
Node node;
int key;
node.parent_id = (i >> 1);
node.left_id = (i << 1);
node.right_id... | 1 | 8,673,252 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mP make_pair
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main()
{
ll S;
cin >> S;
ll dp[S+10];
dp[0] = 0;
dp[1] = 0;
dp[2] = 0;
dp[3] = 1;
dp[4] = 1;
dp[5] = 1;
for(ll i = 6; i <= S; i++){
dp[i] = (dp[i - 1]%MOD + dp[i - 3]%MOD)%MOD... | 1 | 20,258,299 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = n; i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int a, b, c;
cin >>a >> b >> c;
bool ok = false;
if (a == 1) ok = true;
for (int i = 1;... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll a,b,c;
cin >> a >> b >> c;
c %= a;
map<ll,ll> mp;
mp[c]++;
while(1){
... | 1 | 8,706,977 |
#include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n,ma,mi; cin>>n>>mi>>ma;
if(n == 0 & ma == 0 && mi == 0) break;
vector<int> sco(n);
for(int i=0; i<n; i++){
cin>>sco[i];
}
int ans=0,gap=0;
for(int i=mi; i<=ma; i++){
if(sco[i-1] - sco[i] >= gap){
... | #include <iostream>
#include <vector>
#include <cstdlib>
using namespace std;
int main(int argc, const char * argv[]) {
while(1){
int m,nmin,nmax;
vector<int> score;
vector<int> gap;
cin >> m >> nmin >> nmax;
if (m == 0 && nmin == 0 && nmax == 0) {
break;
... | 1 | 32,968,825 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ll n,i=1;
cin>>n;
map<ll,ll>m;m[n]=1;
while(1){
if(n&1)n=3*n+1;
else n/=2;
++i;
if(m[n]==1){
cout<<i;return 0;
}
else m[n]=1;
}
} | #include <iostream>
#include <map>
int main(){
int s;
std::cin >> s;
int i = 1;
std::map<int, int> mp;
mp[s]++;
while (true){
if (s % 2 == 0){
s = s / 2;
} else{
s = 3 * s + 1;
}
if (mp[s] == 0){
mp[s]++;
} else{
break;
}
i+... | 1 | 35,068,885 |
#include <iostream>
using namespace std;
int main() {
int r; cin>>r;
if(r<1200)
cout<<"ABC";
else if(r<2800)
cout<<"ARC";
else
cout<<"AGC";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | 1 | 68,474,265 |
#include <algorithm>
#include<stdio.h>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include<map>
#include <set>
#include<math.h>
using namespace std;
#define int long long
#define ll long long
#defi... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 1 | 50,653,390 |
#include <iostream>
class Dice
{
public:
Dice(int s1, int s2, int s3, int s4, int s5, int s6);
void rollE();
void rollN();
void rollS();
void rollW();
void rollR();
void rollL();
bool rollToTop(int v);
bool rollToFrontHorizontal(int v);
int getTop();
int getRight();
private:
... | #include <iostream>
#include <random>
using namespace std;
class Dice{
private:
int tmp;
public:
int q[6];
void roll(char d){
if(d=='N'){
tmp = q[4];
q[4] = q[0];
q[0] = q[1];
q[1] = q[5];
q[5] = tmp;
} else if(d=='E'){
tmp = q[2];
q[2] = q[0];
q[0] = q[3];
... | 1 | 88,215,518 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
cout << (a < b ? 0 : 10) << endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <stdlib.h>
#define ll long long
#define MOD_P 1000000007
#define PI 3.141592
using namespace std;
int main()
{
int x, a;
cin >> x >> a;
printf("%d", x < a ? 0 : 10);
return 0;
} | 1 | 938,121 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200000;
vector<int> adj[MAXN];
bool visited[MAXN];
int n,m,mx=0,curr=0;
void dfs(int node){
visited[node] = true;
for(int next : adj[node]){
if(!visited[next]){
curr++;
dfs(next);
}
}
}
int main(){
cin... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#include <iostream>
#include <vector>
using namespace std;
struct UnionFind
{
vector<int> par;
void init(int N) { par.assign(N, -1); }
int root(int x)
{
if (par[x] < 0) { return x; }
else { retu... | 1 | 56,177,507 |
#include <iostream>
#include <vector>
int main() {
int64_t N;
std::cin >> N;
std::vector<int64_t> count(N + 1, 0);
for (int64_t i = 1; i < N + 1; ++i) {
for (int64_t j = i; j < N + 1; j += i) {
count[j] += 1;
}
}
int64_t ans = 0;
for (int64_t i = 1; i < N + 1; ++i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
ll n;
cin >> n;
vector<ll> a(n+1);
rep(i, n+1) a[i] = 0;
rep(i, n) for (ll j = 0; j <= n; j += (i+1)) a[j]++;
ll ans = 0;
rep(i, n+1) ans ... | 1 | 31,711,175 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,i,c=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(i=0;i<n;i++)
{
if(a[i]==a[i+1])
c++;
}
if(c>=1)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >>n;
int a[n];
for(int i =0;i<n;i++) cin >>a[i];
sort(a,a+n);
bool x=0;
for(int i=0;i<n-1;i++)
if(a[i] ==a[i+1]) {
x=1;
break;}
if(!x)cout<<"YES\n";
else cout <<"NO\n";
return 0;
} | 1 | 38,412,864 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) co... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mx=1e9;
int s;
bool check(int a,int b,int c,int d)
{
int tmp1=0,tmp2=0;
if(min(a,c)<0)
{
tmp1=-min(a,c);
}
if(min(b,d)<0)
{
tmp2=-min(b,d);
}
if(a+tmp1<=mx&&c+tmp1<=mx&&b+tmp2<=mx&&d+tmp2<=mx)
{
printf("%lld %lld %lld %lld %lld ... | 1 | 32,161,143 |
#include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF ((long) 2e18)
#define MOD ((long) (1e9 + 7))
#define umap unordered_map
int main()
{
ios::sync_with_stdio(true); cin.tie(0); cout.tie(0);
long t = 1;
while (t--) {
long n, a, b;
cin >> n >> a >> b;
long ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<ll>
#define vii vector<pii>
#define pb push_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#d... | 1 | 9,672,060 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
typedef long double ld;
typedef long long ll;
using namespace std;
#define MAXN (1 << 10)
int a[MAXN];
int main() {
int n, m;
cin >> ... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#inclu... | 1 | 30,688,457 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.