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;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define VI vector<int>
#define PII pair<int,int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define db double
#define all(x) (x).begin(),... | #include<iostream>
#define N 105000
#define P 1000000007
using namespace std;
int n,m,x[N],y[N],h[N],w[N],t,tl;
long long sum,ans;
int main()
{
ios::sync_with_stdio(false);
cin>>n>>m;
cin>>tl;
for(int i=1;i<n;i++)
{
cin>>t;
w[i]=t-tl;
x[i]=1LL*i*(n-i)%P;
tl=t;
}... | 0 | 89,184,165 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | #include <stdio.h>
static void
sort(int* h, int n)
{
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (h[j] > h[j-1]) {
int tmp = h[j];
h[j] = h[j-1];
h[j-1] = tmp;
}
}
}
}
int
main(void)
{
char line[80];
int a[5];
if (fgets(line, sizeof line, stdin)) {
if (sscanf(line, "%... | 0 | 94,856,836 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cassert>
using namespace std;
bool solve(){
int maxsize=0;
int maxcnt=0;
int ans_num;
int ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <tuple>
using namespace std;
using i64 = int64_t;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr i64 MOD = 100000... | 0 | 27,573,592 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A;
cin >> A;
cout << 180 * (A - 2) << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i <(int)(n); i++)
using namespace std;
int main(){
int N,M;
cin >> N >> M;
vector<vector<int>>S(12,vector<int>(12));
vector<int>P(M);
vector<int>K(M);
int k;
rep(i,M){
cin >> K[i];
int a = K[i];
rep(j,a){
cin >> S[i][j];
}
}
... | 0 | 28,418,296 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,w,k;
cin >> h >> w >> k;
vector<vector<int>> c(h, vector<int>(w));
char tmp;
int num=0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> tmp;
if(tmp=='.')c[i][j]=0;
else {
c[i][j]=1;
num++;
}
}
}
if(num<... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | 0 | 15,071 |
#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 ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, ... | 0 | 47,272,487 |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int m, n_mi, n_ma;
while (cin >> m >> n_mi >> n_ma, m || n_mi || n_ma) {
vector<int> p(m);
for (int i = 0; i < m; ++i) {
cin >> p[i];
}
int ma = -1;
int res;
for (int i = n_mi... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include ... | 0 | 19,133,185 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<set>
#include<regex>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<ioman... | 0 | 88,427,629 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,i;
cin >> a >> b >> c;
while(1){
if(c % a == 0) i++;
if(a == b) break;
a++;
}
cout << i << 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();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | 0 | 83,058,846 |
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <deque>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n; cin >> n;
vector<int> a(n + 1, 0);
vector<int> c(n + 1, 0);
for(int i = 1; i < ... | 0 | 59,782,098 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin >> a;
if(a < 10){
cout << a << endl;
}else if(10 <= a && a < 100){
cout << 9 << endl;
}else if(100 <= a && 999 >= a){
cout << 9 + (a - 100 + 1) << endl;
}else if(1000 <= a && a <= 9999){
cout << 909 << endl;
}else if(10000... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
ll n,m,d;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | 0 | 92,082,226 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
long long ans = 0;
if ( 1 <= n && n < 10 ) {
ans = n;
}
else if ( 10 <= n && n < 100 ) {
ans = 9;
}
else if ( 100 <= n && n < 1000 ) {
ans += 9 + n - 100 + 1;
}
else if ( 100... | #include<iostream>
using namespace std;
int main(){
int x,y;
for( ; ; ){
cin>> x >> y;
if(x==0&&y==0)break;
if(x<y||x==y){
cout<<x<<" "<<y<<endl;
}
else{
cout<<y<<" "<<x<<endl;
}
}
return 0;
} | 0 | 71,898,007 |
#include<iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
double a,b,c,d;
double tmp,e;
cin>>a>>b>>c>>d;
tmp=(c-a)*(c-a)+(d-b)*(d-b);
e=sqrt(tmp);
cout<<fixed<<setprecision(15)<<e<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it))... | 0 | 68,551,636 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define ... | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int A[N], max_A = 0, max_i = 0, next_A = 0;
for (int i = 0; i < N; i++){
cin >> A[i];
if (A[i] > max_A){
max_A = A[i];
max_i = i;
}
}
for (int i = 0; i < N; i++){
if (A[i] > next_A && i != max_i){
next_A ... | 0 | 71,816,512 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int main(){
bool z = true;
ll n;
cin >> n;
ll ans = 1;
vector<ll> a(n + 1);
vector<ll> vert(n + 1);
vector<ll> leaves(n + 2, 0);
rep(i, n + 1) cin >> a[i];
rep(i, n + 1) lea... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | 0 | 64,124,609 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
string S;
string T;
cin >> S >> T;
int res = 0;
rep(i,3){
if (S[i]==T[i])
res++;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1) return true;
for (long long i = 2; i*i <= x; i++) {
if (x % i == 0) return false;
}
return t... | 0 | 89,297,636 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define LEN(x) (int)x.size()
#define ALL(x) x.begin(), x.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int,int>;
using vpii = vector<pii>;
template<t... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n, x, ans;
int main()
{
cin >> n >> x;
ans = n;
LL a = x, b = n - x, t;
while(true)
{
if(a < b) swap(a,b);
if(b == 0) break;
ans += 2 * b * (a / b);
if(a % b == 0) ans -= b;
t = a % b; a = b; b = t;
}
cout << ans << endl;
return 0... | 0 | 83,846,239 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>
using namespace std;
bool solve(int n, int m... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
int main() {
string s; cin >> s;
int size=(int)s.size();
vector<int> v0(26,0),v1,v2;
for(int i=0;i<size;i... | 0 | 46,516,168 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v(4,0);
int main(){
for(auto &p: v)cin >> p;
sort(v.begin(),v.end());
if(v[0] == 1 && v[1] == 4 && v[2] == 7 && v[3] == 9)cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cctype>
#include <algorithm>
#include <functional>
#include <utility>
#include <vector>
#include <map>
const int maxn = 100005;
using ll = long long;
std::vector<int> G[maxn];
inline void ins_edge(int u, int v) {
G[u].push_back(v);
... | 0 | 58,556,321 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int k[m],s[m][10];
for(int i=0;i<m;i++){
cin>>k[i];
for(int j=0;j<k[i];j++){
cin>>s[i][j];
s[i][j]--;
}
}
int p[m];
for(int i=0;i<m;i++) cin>>p[i];
int ans=0;
for(int bit=0;bit<(1<<n);bit++){
int ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s;
ll n;
cin >>... | 0 | 34,106,996 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> ln(n);
for (auto& li : ln) {
cin >> li;
}
sort(ln.begin(), ln.end(), std::greater<int>());
int total = 0;
for (int i = 0; i < k; ++i) {
total += ln[i];
}
cout << total << endl;... | #include <iostream>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c;
cin >> a >> b >> c;
cout << ((a < b&&b < c) ? "Yes" : "No") << endl;
return 0;
} | 0 | 69,748,963 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
constexpr int M = 3;
constexpr int LOVE = 753;
constexpr int INF = 1000000000 + 8;
signed main() {
cin.tie(0);
... | 0 | 38,217,756 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
ll mod=1e9+7;
bool dx[2][18000],dy[2][18000];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string ss;cin>>ss;
int a,b;cin>>a>>b;
vector<int> d;
int p=0;
rep(i,ss.size()){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll n,m;
cin >> n >> m;
vector<pair<ll, int>> x(n);
for(int i=0;i<n;i++) cin >> x[i].first >> x[i].second;
sort(x.begin(), x.end());
ll ans =0;
for(int i=0;i<n;i++){
if(m<=x[i].second){
ans... | 0 | 89,922,150 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> a(n), cnt(n+1);
for(int i=0; i<n; i++) {
cin >> a[i];
cnt[a[i]]++;
}
ll sum = 0;
for(int i=1; i<=n; i++) sum += cnt[i] * (cnt[i] - 1) / 2;
for(int i=0; i<n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); ++i)
#define REP2(i, m, n) for (ll(i) = (ll)(n)-1; i >= (ll)(m); --i)
#define rep(i, n) REP(i, 0, n)
#define rep2(i, n) REP2(i, 0, n)
#define all(hoge) (hoge).begin... | 0 | 61,221,768 |
#include <iostream>
using namespace std;
int main () {
int X, A, B;
cin >> X >> A >> B;
int Y=-1*X;
if (0<=A-B) {
cout << "delicious";
}
else if (Y<=A-B&&0>A-B) {
cout << "safe";
}
else {
cout << "dangerous";
}
} | #include <bits/stdc++.h>
#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#in... | 0 | 19,827,560 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const do... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair <int, int>
#define all(vv) (vv).begin(), (vv).end()
#define time cerr << '\n' << (double)clock()/CLOCKS_PER_SEC << '\n'; return 0;
int n, m;
map <string, int> mp;
int32_t main() {
cin >> n;
... | 0 | 12,204,889 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define REP(i, d, n) for(int i=(d); i<(n); ++i)
#define all(v) v.begin(), v.end()
int main() {
int v, e;
cin >> v >> e;
const long long INF = 10000000000000000;
vector<vector<long long> > cost(v, vector<long long>(v... | 0 | 64,236,565 |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <fstream>
#include <iterato... | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf ... | 0 | 97,605,332 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> C(N - 1);
vector<int> S(N - 1);
vector<int> F(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> C[i] >> S[i] >> F[i];
}
for (int i = 0; i < N - 1; i++) {
int time ... | 0 | 79,758,292 |
#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 INF 1000000007
#define mod 1005
#define ll long long int
const double mx = 2e6 + 5 ;
void solve()
{
char ch;
cin>>ch;
cout<<(char)(ch+1)<<"\n";
}
int main()
{
ios_base::sync_with_... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B,M,a,b,x,y,c;
cin>>A>>B>>M;
std::deque<int> re;
deque<int> ra;
int minA=100001,minB=100001;
for (int i=0;i<A;i++) {
cin>>a;
re.emplace_back(a);
minA=min(minA,a);
}
for (int j=0;j<B;j++) {
... | 0 | 99,076,881 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, h;
cin >> n >> h;
int a[n], b[n];
for(int i = 0; i < n; i++)cin >> a[i] >> b[i];
int amax = *max_element(a, a + n);
sort(b, b + n);
reverse(b, b + n);
int damage = 0;
int ans = 0;
for(int i = 0; i <... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
ll H, W;
cin >>... | 0 | 44,516,035 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n;
int cnt = 0;
while(scanf("%d",&n) != EOF){
cnt = 0;
for(int a = 0;a < 10;a++){
for(int b = 0;b < 10;b++){
for(int c = 0;c < 10;c++){
for(int d = 0;d < 10;d++){
if(a+b+c+d == n){
cnt++;
}
}
}
}... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::nume... | 0 | 100,336,742 |
#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 <iostream>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cmath>
#include <cstdarg>
#include <cstdlib>
#include <string>
#include <tuple>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
int main(int argc, char const *argv[])
{
int h, w;
cin >> h >>... | 0 | 47,991,155 |
#include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#include <math.h>
int main() {
int a, b, ans;
cin >> a >> b;
ans = a * b;
if (ans / 2.0 == ans / 2) {
cout << "Even" << endl;
}
else {
cout << "Odd" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
int main() {
int n;
cin >> n;
vector<vector<int>> g(n);
rep(i,n-1) {
int u, v;
cin >> u... | 0 | 76,105,440 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define mk make_pair
typedef long long ll;
typedef long double ld;
ll f(ll n){
ll res = n - n % 4;
for(ll m = res + 1; m <= n; m++){
res ^= m;
}
return res;
}
void... | #include <bits/stdc++.h>
#define sp putchar(' ')
#define en putchar('\n')
#define MOD(x) ((((x)%Mod)+Mod)%Mod)
const int MAXN = 500005 ;
using namespace std ;
class Union_Find_Set
{
static const int N = 2000005;
public:
int tot,cnt[N],fa[N] ;
void clear(int n)
{
tot = n;
iota(fa,fa+n+1,0) ;... | 0 | 51,166,844 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define per(i, n, s) for (int i = (n-1); i >= (int)(s); i--)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll LINF = LLONG_MAX;
const ... | #include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval... | 0 | 95,501,388 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll W,H;
cin >> W >> H;
struct edge{
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define _GLIBCXX_DEBUG... | 0 | 28,681,417 |
#include<iostream>
#include<string>
using namespace std;
int main(){
char type[] = {'y','u','i','o','p','h','j','k','l','n','m'};
string str;
while(cin >> str , str != "#"){
int now = -1,i;
int ans = 0;
int len = str.size();
for(int k=0;k<len;k++){
for(i=0;i<=10;i++){
if(str[k] == type[i]){
if(no... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = N;
while (x >= 0) {
if (x % 4 == 0) {
cout << "Yes" << endl;
return 0;
};
x -= 7;
}
cout << "No" << endl;
return 0;
} | 0 | 39,119,438 |
#include <iostream>
#include <algorithm>
#include <vector>
int main ()
{
int w, h, x, y, r;
std::cin >> w >> h >> x >> y >> r;
bool a = (0 <= x - r) && (x + r <= w);
bool b = (0 <= y - r) && (y + r <= h);
if (a && b)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep1(i,n) for(int i=1;i<=n;++i)
int main(void){
int N,M,P,X;
while(cin>>N>>M>>P, N|M|P){
int sum=0,winner;
rep1(i,N){
cin>>X;
sum+=X;
if(i==M)winner=X;
}
if(winner)cout<<sum*(100-P)/winner<<... | 0 | 47,406,629 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define ll long long
int main() {
int t,... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2>... | 0 | 66,140,007 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | #include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<stdio.h>
#include<queue>
using namespace std;
int main()
{
string a;
cin >> a;
int size_a;
size_a = a.length();
string b = "";
for (int i = 0; i < size_a; i++)
{
if (a[i] == '0')
{
b.push_back('0');
}
else if (a[i] == '1')
... | 0 | 12,267,776 |
#include <iostream>
using namespace std;
#define x 1000000
int main(){
bool q[x];
for(int i=2;i<x;i++) q[i] = true;
for(int i=2;i<x;i++) if(q[i]) for(int j=2;j<=x/i;j++) q[i*j] = false;
int n;
while(cin >> n){
int a = 0;
for(int i=2;i<=n;i++) if(q[i]) a++;
cout << a << endl;
}
} | #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... | 0 | 68,069,750 |
#include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
while(1){
ll N, M;
cin >> N >> M;
if(!N && !M) break;
pair<ll, ll> po[N];
ll ans = 0;
for(ll i = 0; i < N; i++){
cin >> po[i].first >> po[i].second;
ans += po[i].first... | #define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod= 1e+9+7;
int main() {
ll x,y;
cin>>x>>y;
if(x>=0&&y>=0&&x<y){
cout<<y-x<<endl;
}
else if(x>=0&&y>=0&&x>y){
if(y==0)cout<<x... | 0 | 11,337,898 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<queue>
#define int long long
#define mod (int)(1000000007)
using namespace std;
int test[213456], aa[213456];
signed main() {
int n, a = 1234567890, ans = 0; cin >> n;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int w,h,n;cin>>w>>h>>n;
int x,y,a;
int tmpx1=0,tmpx2=w,tmpy1=0,tmpy2=h;
for(int i=0;i<n;i++){
cin>>x>>y>>a;
if(a==1){
if(tmpx1<x)tmpx1=x;
}
else if(a==2){
if(tmpx2>x)tmpx2=x;
}
else if(a==3){
if(tmpy1<y)tmpy1=y;
... | 0 | 51,547,186 |
#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... | #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,k;cin>>n>>k;
int a[n];
memset(a,0,sizeof(a));
rep(i,k){
int d;cin>>d;
rep(j,d){
int c;cin>>c;
--c;
++a[c];
}
... | 0 | 10,202,177 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename TYPE>
void print_vec(const vector<TYPE>& v){
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout << endl;
}
template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
cout << endl; cout << " ";
for... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 100001;
static... | 0 | 66,972,365 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t,flag=0;
cin>>t;
while(t!=0)
{
int x= t%10;
if(x==7)
{
flag=1;
break;
}
t/=10;
}
if(flag==1)
cout<<"Yes";
else
cout<<"No";
return 0;
} | 0 | 97,456,846 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
void solve(void)
{
int n;
string s, t;
cin >> n >> s >> t;
int ans = 2 * n;
rep(i, n)
{
int cta = 0;
rep(j, n)
{
if... | 0 | 69,120,329 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
using Graph = vector<vector<int>>;
int main(){
int A, B, C, D;
cin >> A >> B >> C >> D;
if(A+B > C+D) cout << "Left" << endl;
else i... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll a,b,c[1001],k=0,sum=0;
cin >> a>>b;
rep(i,a){
cin >> c[i];
sum+=c[i];
}
rep(i,a){
if(c[i]*4*b>=sum){
k++;
}
... | 0 | 61,758,352 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int a, b;
scanf("%d%d", &a, &b);
string s;
cin >> s;
int count = 0;
rep(i, s.size())
{
if (s[i] == '-')
count++;
}
if (count == 1)
{
if (a + b + 1 == s.size())
{
if (s[a] == '-')
{
... | #include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
int main()
{
int N;
stack<int> mystack;
while(cin>>... | 0 | 98,901,304 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <cmath>
#include <map>
using namespace std;
int H, W;
string s;
string mozi="snuke";
string alpha="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
i... | 0 | 65,290,177 |
#include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(i=0;i<(n);i++)
#define rrep(i,n) for(i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const ll MOD=1000000007ll;
const int MAX=5100000;
using namespace std;
int inputValue(){... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll INF=1000000010;
const ll MOD=1000000007;
const ll LINF=4000000000000000000;
const long double EPS=1e-9;
typedef pair<int,int> P;
int main(){
ll n,a,b;cin>>n>>a>>b;
if(a+b-1>n||a*b<n){
cout<<-1<<e... | 0 | 13,945,442 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <vector>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define in insert
#define er erase
#define fi first
#define se second
#define mp make_pair
#define all(x) x.begin(),x.e... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;cin>>n;
vector<int>v;
for(int i=0;i<n;i++){
int a;cin>>a;v.push_back(a);
}
sort(v.rbegin(),v.rend());
int pas1=-1,pas2=-1;
for(int i=0;i<n-1;i++){
int a=v[i],b=v[i+1];
if(a==b){
if(pas1==-1)pa... | 0 | 1,555,048 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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) { ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
--u; --v;
if (u > v) swap(u, v);
g[u].push_back(v);
... | 0 | 84,291,136 |
#include<cstdio>
int main(){
int dice[6];
int a,b,x,y,q,t = 0;
int ans[6][6] = {{0,3,5,2,4,0},{4,0,1,6,0,3},{2,6,0,0,1,5},{5,1,0,0,6,2},{3,0,6,1,0,4},{0,4,2,5,3,0}};
scanf("%d %d %d %d %d %d", &dice[0], &dice[1], &dice[2], &dice[3], &dice[4], &dice[5]);
scanf("%d", &q);
for(int i = 0; i < q; i++){
scanf("%d %d"... | #include <iostream>
using namespace std;
int main( void )
{
int a, b, c;
cin >> a >> b >> c;
if ( a == b && b == c )
{
cout << 1 << endl;
}
else if ( a == b | b == c | c == a )
{
cout << 2 << endl;
}
else
{
cout << 3 << endl;
}
return 0;
} | 0 | 52,727,144 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main(){
int h,w; cin >> h >> w;
int x,y;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
string s; cin >> s;
if(s == "snuke"){
x = i+1; y = j;
}
... | 0 | 79,102,087 |
#include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define maxii 100005
using namespace ... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) fo... | 0 | 89,679,253 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define repi(i,x,n) for(ll i=x;i<(ll)(n);i+... | 0 | 33,731,638 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char A;
cin >> A;
if(A<91){
cout << "A" << endl;
return 0;
}
cout << "a" << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | 0 | 97,222,237 |
#include <bits/stdc++.h>
using namespace std;
struct base{
#define type long long
#define log 60
type d[log+1] = {};
bool insert(type x){
for(int i=log; ~i; i--) if((x>>i)&1){
if(!d[i]){
d[i] = x;
break;
}
x ^= d[i];
}
... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, const char * argv[]) {
ios::sync_with_stdio(false);
string s;
cin>>s;
if (s.size()!=6) {
}else{
if (s[2]==s[3]&&s[4]==s[5]) {
cout<<"Yes";
}else{
cout<<"No";
}
}
retu... | 0 | 26,411,019 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second... | 0 | 28,871,164 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string button[10] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
int N; cin >> N;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
int64 pow2(uint64 e){
int64 p=1;
for(uint64 i=0; i<e; ++i){ p*=2; }
return p;
}
int64 nCr(int64 n, int64 r){
int64 ret=1;
for(int64 i=0; i<r; ++i){
ret = ret * (n-i) / (i+1);
... | 0 | 36,882,368 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int m... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { ... | 0 | 35,170,638 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii p... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | 0 | 77,427,509 |
#include <iostream>
#include <string>
#include <sstream>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
void f(const int,const int,int*);
int main()
{
priority_queue... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, m;
vector<string> A, B;
bool match_temp(int w, int h) {
for(int i = 0; i < m; i++) {
for(int j = 0; j < m; j++) {
if(A[h+i][w+j] != B[i][j]) {
return false;
}
}
}
return true;
}
int main(){
cin >> n >... | 0 | 34,909,806 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int n,a,b;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>a>>b;
if((b-a)%2==0){
co... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <random>
#include <unordere... | 0 | 46,494,573 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
string s;
cin >> s;
int a[4];
rep(i,4) a[i] = s[i] - '0';
rep(i,8) {
int result = a[0];
rep(j,3) {
result += pow(-1,i>>j&1)*a[j+1];
}
if (result == 7) {
cout << a[0];
rep(j... | 0 | 4,928,838 |
#include <iostream>
using namespace std;
int extgcd(int a, int b, int& x, int &y) {
if (b == 0) { x = 1; y = 0; return a; }
else {
int g = extgcd(b, a%b, y, x);
y -= a / b * x;
return g;
}
}
int mod_inv(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return x;
}
long long f... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 4,739,306 |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define int long long
#define pb push_back
#define For(i,n) f... | 0 | 75,969,453 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... | 0 | 32,453,855 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
vector<int> high;
for(int i=0;i<10;i++){
cin >> n;
high.push_back(n);
}
sort(high.begin(),high.end());
for(int i=9;i>=7;i--){
cout << high.at(i) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rept(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define reps(i,s,n) for(int (i)=(s);(i)<(int)(n);(i)++)
#define repst(i,s,n) for(int (i)=(s);(i)<=(int)(n);(i)++)
#define repr(i,n) for(int (i)=(n);(i)>=0;(i)--)
#define ... | 0 | 91,475,071 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = ll(1e18)+1;
int main(){
cin.tie(0);
ios::sync_with_stdio(... | #include<bits/stdc++.h>
using namespace std;
#define fo(i, n) for(i=0; i<n; i++)
#define Fo(i, k, n) for(i=k; i<n; i++)
#define w(x) int x; cin>>x; while(x--)
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define ll long long
#def... | 0 | 69,172,405 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const ll MOD2=998244353;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string ... | #include <iostream>
using namespace std;
int main(){
int n=1000 ,m ,coin=0;
while( true ){
cin >> m;
if( m == 0 ){
break;
}
n -= m;
if( n >= 500 ){
coin += n / 500;
n %= 500;
}
if( n >= 100 ){
coin += n / 100;
n %= 100;
}
if( n >= 50 ){
coin +... | 0 | 63,281,645 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
vector<int> a(n + 1);
vector<int> b(n);
a[0] = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
b[i - 1] = a[i] - a[i - 1];
}
b[0] = k - a[n] + a[1];
int max = 0;
for (int i = 0; i < n; i++)
{
if (b[i] > max... | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | 0 | 75,991,572 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 10;
int p[N], l[N];
void solve() {
int n, a, b, c; scanf("%d%d%d%d", &n, &a, ... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include... | 0 | 54,195,508 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
typedef vector<int> ivec;
const int MOD=1000000007;
int INF=100100100100100;
vector<... | 0 | 74,701,120 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
int n; cin >> n;
int ans = 0;
fo... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define per(i,n) for(int i=n-1;i>=0;--i)
#define sc1(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d %d",&a,&b)
#define sc3(a,b,c) scanf("%d %d %d",&a,&b,&c)
int main(){
int n,m,ans=0,chk=1;
sc2(n,m);
int d[8][8];
vecto... | 0 | 66,312,415 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N,A,B; cin >> N >> A >> B;
... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n)... | 0 | 72,872,967 |
#include <bits/stdc++.h>
using namespace std;
int main(){
map<int,int> m;
for(int i=0;i<3;i++){
int u,v;cin>>u>>v;
m[u] += 1;
m[v] += 1;
}
for(auto x: m) if(x.second > 2){
cout<<"NO"<<endl;
return 0;
}
cout<<"YES"<<endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | 0 | 54,403,140 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr int INF = (1<<29);
using ll = long long;
using pii = pair<int,int>;
struct edge{
int to,cost;
edge(int to, int cost) : to(to), cost(cost) {}
};
int main(){
int k... | #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++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allo... | 0 | 12,876,258 |
#include <iostream>
#include <queue>
using namespace std;
int main() {
int n;
int count = 0;
priority_queue<int> que;
while (cin >> n) {
que.push(n);
count++;
}
cout << que.top(); que.pop();
for (int i = 0; i < count-1; i++) {
cout << " " << que.top(); que.pop();
}
cout << endl;
return 0... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 0 | 66,711,173 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int toggle(char c)
{
if (isupper(c)) {
c = tolower(c);
} else {
c = toupper(c);
}
return c;
}
int main()
{
string s;
getline(cin, s);
transform(s.begin(), s.end(), s.begin(), toggle);
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int N,A,B,C,X;
while (cin >> N >> A >> B >> C >>X){
if (N+A+B+C+X == 0){
break;
}
int Y[N];
int frame = 0;
for (int i = 0; i <= N-1; i++){
cin >> Y[i];
}
int i = 0;
for (int frame = 0; frame <= 10000; frame++){
if(X == Y[i]){
i++;
... | 0 | 27,659,126 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
int N;
cin >> N;
cout << N*(N+1)/2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int maxn = 110000;
int main()
{
ios::sync_with_stdio(false)... | 0 | 90,316,964 |
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int q;
cin >> q;
while(q--)
{
ll a, b;
cin >> a >> b;
ll l = min(a, b);
ll h = max(a, b);
if(l == 1 && h == 1)
{
cout << 0 << endl;
continue;
}... | 0 | 66,887,985 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n,a;
cin>>n;
vector<int>v;
double sum=0;
for(int i=0;i<n;i++)
{
cin>>a;
v.push_back(a);
sum+=a;
}
int x=ceil(sum/n);
int y=flo... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
int main()
{
ll n,k;
cin>>n>>k;
ll a[n+1];
ll c[n+1];
for(ll i=1;i<=n;i++)
cin>>a[i];
for(ll i=1;i<=n;i++)
cin>>c[i];
ll ans=-inf;
for(ll i=1;i<=n;i++)
{
vector<ll>v;
v.push_back(0);
ll sum=c[i];... | 0 | 59,268,078 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> J(100001);
for (int a, b; cin >> a >> b;) J.at(a).push_back(b);
priority_queue<int> Q;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (auto j : J.at(i)) Q.push(j);
if (Q.size()) ans += Q.top(),... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
string s;cin>>s;
map<char,int>m;
rep(i,s.size()){
... | 0 | 39,463,281 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int x, y;
cin >> x >> y;
cout << (x % y ? x : -1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, M, ans=0, tmp=0;
priority_queue<ll> job[100005];
priority_queue<pair<ll,ll>> PQ;
signed main(){
cin >> N >> M;
for(int i=0;i<N;i++) {
ll a, b;
cin >> a >> b;
job[a].pus... | 0 | 1,379,516 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef long long ll;
... | #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 yes(ans) if(ans)p... | 0 | 1,358,970 |
#include<bits/stdc++.h>
using namespace std;
long long N;
long long A[200005];
int main(){
cin >> N;
for(long long i = 0; i < N; i++) {
cin >> A[i];
}
set<long long> aset;
for(long long i = 0; i < N; i++) {
if(aset.count(A[i]) != 0) {
cout << "NO" << endl;
return 0;
}
aset.insert(A[i]);
}
cout << "... | #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 | 30,689,100 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
int x = n / 111;
int rem = n % 111;
if(rem != 0) x += 1;
int ans = x * 111;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll 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 = vect... | 0 | 84,589,271 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <math.h>
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n),c;
rep(i,0,n) cin ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define ... | 0 | 64,037,773 |
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#define debug(a) cout << "*" << a << "*" << endl
using namespace std;
typedef long long ll;
char mp[50][101];
int m, n;
void fill_mp(int num, int x, char ch)
{
for (int i = x; ; i += 2)
{
for (int ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 30,829,269 |
#include<bits/stdc++.h>
#define ll long long
#define pp pair<int,int>
#define ppn pair<pp,int>
#define F first
#define S second
#define N 1000005
#define mod 1000000007
#define pi 3.14159265358979323846
using namespace std;
int dp[1000001];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.ti... | #include<iostream>
#include<algorithm>
using namespace std;
#define maxn 105
struct in{
char ch;
int val;
};
in a[maxn];
in b[maxn];
int n;
bool compareStable()
{
for(int i=0;i<n;i++)
{
if(a[i].ch!=b[i].ch)
return false;
}
return true;
}
void bubbleSort()
{
bool flag=1;
... | 0 | 45,456,029 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,k,i,j;
cin >> n >> k;
double ans=0;
for(i=1;i<=n;i++){
double ans1=1;
j=i;
while(j<k){
ans1*=1/(double)2;
j=j*2;
}
ans+=1/(double)n*ans1;
}
printf("%.12lf\n",ans);
} | #include<bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
int wari(int a,int b) {
if(a%b==0)
return a/b;
else
return a/b+1;
}
int keta(int a){
double b=a;
b=log10(b);
int c=b;
return c+1;... | 0 | 12,533,056 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
cin >>T ;
while(T--){
int s[3];
cin >> s[0] >> s[1] >> s[2];
sort(s,s+3);
if( s[0] * s[0] + s[1] * s[1] == s[2] * s[2] ) cout << "YES" << endl;
else cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int h, w;
cin ... | 0 | 94,641,334 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
bool compare_by_greater_y(pair<int,int>a, pair<int,int>b){
if(a.second!=b.second) return a.second>b.second;
else return a.first>b.first;
}
int main(){
int n,ans=0;
pair<int,int> r[100],b[100];
bool rf[100];
cin>>n;
REP(... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
bool app[30];
bool flug = false;
for(int i = 0; i< 26;++i){
app[i] = false;
}
for(int i = 0;S[i] != '\0';++i){
app[S[i]-'a']= true;
}
for(int i = 0;i<26;++i){
if(!app[i]){
cout << (cha... | 0 | 76,731,677 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
using namespace std;
int main(){
string s;
vector<string> v;
while(cin>>s){
v.push_back(s);
}
sort(v.begin(),v.end());
int l=0;
for(int i=0;i<(int)v.size();i++){
if(v[i].size() > v[l].... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | 0 | 23,937,415 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | #include<iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int gcd(int p, int q) {
if (p % q == 0)return q;
return gcd(q, p % q);
}
int main()
{
int k,n;
cin >> k>>n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
... | 0 | 89,536,329 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair < int , int >;
template < typename T >
void min_self (T & a, T b) {
if (a > b) a = b;
}
const int mx = 301;
const ll inf = 1e18 - 1;
void solve() {
int n, k;
scanf ("%d %d", &n, &k);
ll h[mx];
for (int i = 0; i < n; i++) {
scanf... | #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++)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i,n) {
cin >> v.at(i);
}
map<int,int>memo1,memo2;
rep(i,n){
if(i%2==0){
memo1[v.at(... | 0 | 85,763,335 |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int a, b;
cin >> a >> b;
int maior = max(a, b);
if (maior > 8)
cout << ":(";
else
cout << "Yay!";
cout << endl;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | 0 | 59,500,362 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.