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;
int main(){
long long n,a,b;
cin >> n>>a>>b;
if((b - a) % 2 == 0)puts("Alice");
else puts("Borys");
} | #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>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | 1 | 5,995,188 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<bool> num(1);
for (int i = 1; sum < N; i++) {
sum += i;
num.push_back(true);
}
num[sum - N] = false;
for (int i = 1; i < num.size(); i++) if (num[i]) cout << i << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,i=1;
cin>>N;
for(;true;i++){
if(i*(i+1)/2>=N)
break;
}
for(;i>0;i--){
if(N>=i){
cout<<i<<endl;
N-=i;
}
if(N==0)
break;
}
} | 1 | 21,642,753 |
#include <iostream>
using namespace std;
int main() {
int k;
int x;
cin>>k>>x;
int p=500 * k;
if (p >= x)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x(100000);
for(int i = 0;i < n;i++) cin >> x[i];
return x;
}
int main(){
int k,x;
cin >> k >> x;
if(k*500 >= x){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 64,111,676 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i, n = 0;
int a[3], score;
vector<vector<int>> vec;
while(1) {
cin >> a[0] >> a[1] >> a[2];
if(a[0] < 0 && a[1] < 0 && a[2] < 0) break;
vec.push_back(vector<int>(a, a+sizeof(int)));
++n;
}
... | #include <cstdio>
int main () {
int m, f, r;
while(true) {
scanf("%d %d %d", &m, &f, &r);
char rank = 'F';
if (m == -1 && f == -1 && r == -1) break;
int sum = m + f;
if (m == -1 || f == -1) {
rank = 'F';
} else if (80 <= sum) {
rank = 'A';
... | 1 | 89,058,062 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int A,B,C; cin >> A >> B >> C;
int maxv = max({A,B,C});
if(maxv %2 != (A+B+C)%2) maxv++;
int sum = (maxv - A) + (maxv - B) + (maxv - C);
cout << sum / 2 << endl;
} | #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 ... | 1 | 30,320,449 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n,m;
cin >> n >> m;
int k[n];
rep(i,n)k[i]=0;
rep(i,2*m){
int o;
cin >> o;
o--;
k[o]++;
}
int ans=0;
rep(i,n)ans+=k[i]%2;
if(ans==0)cout << "YES" << endl;
else cout << "N... | 1 | 30,663,638 |
#include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int n, m, X, Y;
cin >> n >> m >> X >> Y;
int x, y;
int maxx = X, miny = Y;
for (int i = 0; i < n; ++i) {
cin >> x;
maxx = max(maxx, x);
}
for (int i = 0; i < m; ++i) {
cin >> y;
miny = min(m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, X, Y; cin >> n >> m >> X >> Y;
vector<int> x(n), y(m);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
for (int i = 0; i < m; i++) {
cin >> y[i];
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
bool war = true;
f... | 1 | 82,147,427 |
#include "bits/stdc++.h"
using namespace std;
#define dump(x) cout << (x) << endl;
typedef int64_t Int;
Int mod = 1e9+7;
int main() {
Int a, b;
cin >> a >> b;
Int k;
cin >> k;
while (k > 0) {
b += a / 2;
a /= 2;
k--;
if (k == 0) break;
a += b / 2;
b /= 2;
k--;
}
cout << a << " ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int a, b, k;
cin >> a >> ... | 1 | 19,909,518 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int n,k;
cin>>n>>k;
if(n==k)cout<<0;
else if(n%k==0)cout<<0;
else cout<<1;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n,k;
cin >> n >> k;
if(n%k==0)cout << "0" << endl;
else cout << "1" << endl;
return 0;
} | 1 | 63,111,250 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
vector<bool> isexist1(b, false);
{
int cur = a % b;
while(!isexist1[cur]){
isexist1[cur] = true;
cur += a;
cur %= b;
}
... | #include<bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,sum=0;
cin >> A >> B >> C;
bool a=false;
for(int i=A;i<B*A+1;i+=A){
sum+=A;
if(sum%B==C){
a=true;
break;
}
}
if(a){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
} | 1 | 50,072,150 |
#include <iostream>
using namespace std;
int main() {
int n,mn=1e9+1,mx=0;
cin>>n;
for (int i = 0; i < n; ++i) {
int a;
cin>>a;
mn=min(mn,a);
mx=max(mx,a);
}
cout<<mx-mn<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T... | 1 | 77,992,279 |
#include <iostream>
#include <cstdlib>
#include <vector>
int main(void) {
int N;
int A;
int B;
int C;
int X;
int next_X;
int Y;
int next_Y;
int flame_num;
std::cin >> N;
while (N != 0) {
Y = -2;
flame_num = 0;
std::cin >> A >> B >> C >> X;
for ... | #include <iostream>
#include <vector>
int linear_random(int A, int B, int C, int x);
int main(int argc, char const* argv[])
{
while (true) {
int N, A, B, C, X;
std::cin >> N >> A >> B >> C >> X;
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0)
break;
std::vector<int> reels(N);
for (int i ... | 1 | 73,380,585 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double money = 100;
int n;
cin >> n;
for(int i=0;i<n;++i){
money *= 1.05;
money = ceil(money);
}
cout << (int)(money*1000) << endl;
} | #include <bits/stdc++.h>
using namespace std;
long money = 100000;
void up() {
int judge = money % 1000;
if(judge) {
money -= judge; money += 1000;
}
}
int main(void) {
int n; cin >> n;
for(int r = 0; r < n; r++) {
money *= 1.05; up();
}
cout << money << endl;
return(0);
... | 1 | 46,909,372 |
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).ren... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 8;
vector<char> aux;
vector<vector<char> > v;
char g[N][N], f[N][N];
void build(int pos, int h, int w){
if(pos == h+w+1){
v.push_back(aux);
return;
}
aux.push_back('0');
build(pos+1, h, w);
aux.pop_back();
... | 1 | 26,750,102 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> a, b;
for (... | 1 | 47,213,590 |
#include <bits/stdc++.h>
using namespace std;
int v[20000];
int b[10000], e[10000];
int p[20000];
int main()
{
int n;
while (scanf("%d", &n), n){
memset(p, 0, sizeof(p));
for (int i = 0; i < n; i++){
int h, m, s;
scanf("%d:%d:%d", &h, &m, &s);
b[i] = h * 60 * 60 + m * 60 + s;
scanf("%d:%d:%d", &h, &m,... | #include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n;
const int t = 86400;
while( scanf("%d",&n) , n ){
int table[t] = {};
for(int i=0 ; i<n ; ++i ){
int h1,m1,s1,h2,m2,s2,start,end;
scanf("%d:%d:%d %d:%d:%d", &h1 , &m1 , &s1 , &h2 , &m2 , &s2 );
start = s1 + m1*60 + h1*60*60 + ... | 1 | 95,422,654 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,a,b) for (int i = (a); i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=3.14159265358979323846;
int main (){
int X;
cin >> X;
int res = X%100;
int num = ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 1 | 53,259,642 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
cout << fixed << setprecision(16);
ll m, k;
cin >> m >> k;
if(m==1 && k==1 || (k >= 1ll<<m)) {
cout << -1 << endl;
return 0;
}
if(m==1 && k==0) {
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
typedef vector< vector< vector<ll> > > vvvint;
typedef vector<string> vstring;
typedef vector< vector<string> > vvstring;
typedef vec... | 1 | 10,001,819 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
if (s[0] == t[0] && s[1] == t[1] && s[2] == t[2]){
cout << "3" << endl;
}
else if (s[0] == t[0] && s[1] == t[1] && s[2] != t[2]){
cout << "2" << endl;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,s1;
cin>>s>>s1;
int count=0;
for(int i=0;i<3;i++){
if(s[i]==s1[i])
count++;
}
cout<<count;
return 0;
} | 1 | 73,956,449 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int N; cin >> N;
vector<ll> A(N);
ll ans = 0;
rep(i, N){
cin >> A[i];
}
rep(i, 60){
ll c1 = 0;
rep(j, N){
... | 1 | 94,851,443 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 0 ; i < (n) ; i ++ )
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using vin=vector<int>;
using P = pair<int, int>;
const int inf=1e9+7;
const ll INF=1e18;
int main() {
ll n,m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(), x.end(), y) - x.begin(... | 1 | 77,298,415 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W; cin >> H >> W;
vector<string> F(H);
for (int i=0; i<H; i++) cin >> F[i];
vector<vector<int>> L(H, vector<int>(W));
vector<vector<int>> R(H, vector<int>(W));
vector<vector<int>> U(H, vector<int>(W));
vector<vector<int>> D(H, vector<in... | #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 ... | 1 | 90,564,494 |
#include <stdio.h>
#include <limits.h>
int main(){
int n, a;
long long sum = 0;
int min = INT_MAX;
int max = INT_MIN;
scanf("%d", &n);
for(; n>0; n--){
scanf("%d ", &a);
sum += a;
if(a < min){
min = a;
}
if(a > max){
max = a;
}
}
printf("%d %d %lld\n", min, max, sum);
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<long> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
long rmax=-1000001;
long rmin=1000001;
long rsum=0;
for(int i=0;i<n;i++){
rsum+=a[i];
rmax=max(a[i],rmax);
rmin=min(a[i],rmin);
}
cout<<rmin<<" "<<rmax<<" "<<rsu... | 1 | 45,765,705 |
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <vector>
#include<algorithm>
#include <set>
#include <stdlib.h>
using namespace std;
int main()
{
int n,m,q,r=0;
int arr[1005];
cin>>n>>m;
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
for(int... | #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 (){
int N, K;
cin >> N >> K;
vector<int> p(N);
rep(i, N) cin >> p.at(i);
sort(p.begin(), p.end());
ll ans = 0;
rep(i, K){
ans += p.at(i);
}
cout <... | 1 | 59,783,916 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <cmath>
#include <climits>
#include <cstdint>
#include <cstring>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#pragma GCC optimize("O2")
#define sz(x) ((long long)(x).size())
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl "\n"
#define ff first
#define ss second
#define mp make_pair
#define pb push_... | 1 | 29,770,393 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
rep(r, N + 1) rep(g, N + 1) {
int b = (N - R ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f40;
const long long mod=2e9+7;
const long dou... | 1 | 29,701,186 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> cnt(4);
for ( int i=0; i<3; i++ ) {
int a,b;
cin >> a >> b;
--a; --b;
cnt[a]++;
cnt[b]++;
}
sort(cnt.begin(),cnt.end());
if ( cnt[0]==1&&cnt[2]==2&&cnt[0]==cnt[1]&&cnt[2]==cnt[3] ) {
puts("YES");
} else {
puts... | 1 | 78,451,532 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FastIO ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define pb push_back
#define mp make_pair
#define mem(x,i) memset(x,i,sizeof(x))
#define ff... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
if(a%b==0)
return(b);
else
return(gcd(b,a%b));
}
int main(){
int n;
cin >> n;
int ans;
cin >> ans;
for(int i=1;i<n;i++){
int a;
cin >> a;
ans=gcd(ans,a);
}
cout << ans << endl;
} | 1 | 38,557,342 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
int num, i, j, k, sum = 0;
double a = 0.5, ans = 0.0;
cin >> num;
vector<int> s(num, 0), t(num);
vector<double> v(num);
for (i = 0; i < num; i++) {
scanf("%d", &t[i]);
s[i] = sum;
sum += t[i];
}
for (i = 0; i ... | #include <bits/stdc++.h>
int main() {
int64_t n;
std::cin >> n;
std::vector<int64_t> t(n), v(n);
for (auto &i : t) {
std::cin >> i;
}
for (auto &i : v) {
std::cin >> i;
}
std::vector<int64_t> t_b(n), t_e(n);
t_b[0] = 0;
for (int64_t i = 1; i < n; i++) {
t_b[i] = t_b[i - 1] + t[i - 1];
... | 1 | 3,424,623 |
#include <stdio.h>
#include <stack>
using namespace std;
int main()
{
stack<int> sta;
int num;
while(scanf("%d", &num) != EOF){
if(num == 0 && sta.empty() == 0){
printf("%d\n",sta.top());
sta.pop();
}else{
sta.push(num);
}
}
return 0;
} | #include <iostream>
#include <stack>
using namespace std;
stack<int> st;
int main() {
int m, tmp;
while (cin >> m){
if(m > 0) {
st.push(m);
}
else if(m == 0) {
cout << st.top() << endl;
st.pop();
}
}
return 0;
} | 1 | 51,528,720 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N, A;
cin >> N >> A;
cout << pow(N, 2) - A << endl;
return 0;
} | #include<cstdio>
int main()
{
int n, m;
scanf("%d%d", &n, &m);
printf("%d\n", n * n - m);
return 0;
} | 1 | 35,635,336 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x... | #include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
int main(){
int n,q;
cin >> n >> q;
atcoder::dsu uf(n);
int t,u,v;
for(int i=0;i<q; i++){
cin >> t >> u >> v;
if(t)cout << uf.same(u,v) << endl;
else uf.merge(u, v);
}
} | 1 | 93,499,721 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
stri... | #include <bits/stdc++.h>
using namespace std;
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 all(a) (a).begin(), (a).end()
int main()
{
string s;
cin >> s;
int ans = 0;
bool ok = true;
rep(i, 3)
{
if (s[... | 1 | 92,508,478 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int num[102]={},N=0,mini,cnt=0;
cin >> N;
for(int i = 0; i < N; i++){
cin >> num[i];
}
for(int i = 0; i < N; i++){
mini = i;
for(int j = i; j < N; j++){
if(num[j] < num[mini]) mini = j;
}
swap(num[i],num[mini]);
if(num[i]... | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int d[n];
for(int i = 0; i < n; i++){
cin >> d[i];
}
int replaceCnt = 0;
int start = 0;
for(int i = 0; i < n; i++){
int min = d[start], pos = start;
for(int k = start; k < n;... | 1 | 24,385,128 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
void solve16(int a, int b) {
vector<int> v;
REP(i,a) {
int j;
ci... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | 1 | 93,553,365 |
#include<cstdio>
main(){int n,i=1,f[45]={1,1};for(scanf("%d",&n);++i<=n;f[i]=f[i-1]+f[i-2]);printf("%d\n",f[n]);} | #include <iostream>
using namespace std;
long long fib(int n){
long long a = 1, b = 1, tmp = 0;
while (n--){
tmp = a;
a += b;
b = tmp;
}
return b;
}
int main()
{
int n = 0;
cin >> n;
cout << fib(n) << endl;
return 0;
} | 1 | 33,767,500 |
#include <iostream>
using namespace std;
int n,m,p;
int mem[101];
int main(){
while(cin >> n >> m >> p, n || m || p){
int sum = 0;
for(int i = 1; i <= n ; i++){
cin >> mem[i];
sum += mem[i];
}
sum *= 100;
if(mem[m]==0)cout << 0 << endl;
else {
sum = sum * (100-p)/100;
c... | #include <iostream>
int main() {
for (;;) {
int n;
int m;
int p;
std::cin >> n;
std::cin >> m;
std::cin >> p;
if (n == 0 && m == 0 && p == 0) {
break;
}
int numberOfTickets = 0;
int numberOfTicketsForWinner = 0;
for ... | 1 | 86,806,625 |
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, long long M, long long X, long long Y, std::vector<long long> x, std::vector<long long> y){
sort(x.begin(), x.end(), greater<long long>());
sort(y.begin(), y.en... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,x,y;
cin >> n >> m >> x >> y;
vector<int> xi(n+1);
vector<int> yi(m+1);
xi[0]=x;
yi[0]=y;
for(int i=1;i<n+1;i++) cin >> xi[i];
for(int i=1;i<m+1;i++) cin >> yi[i];
sort(xi.begin(),xi.end());
sort(yi.begin(),yi.end... | 1 | 12,410,662 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define vl vector<ll>
#define pl pair<ll,ll>
#define vpl vector<pl>
#define vvl vector<vl>
using namespace std;
const int N = 1e5+5;
ll h[N], ans[N];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<int> h(n);
for(int i = 0;i<n;i++)
{
cin>>h[i];
}
int a = 0, b = abs(h[0] - h[1]);
if(n == 1)
{
cout<<0<<"\n";
return 0;
... | 1 | 97,900,241 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const long dou... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 1 | 65,933,666 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
int main(){
int N; cin >> N;
int A,B; cin >> A >> B;
int count[3] = {0};
int p;
REP(i,N){
cin >> p;
if(p<=A) count[0]++;
else if(p<=B) count[1]++;
else count[2]++;
}
int r = min(count[... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n, a, b;
cin >> n >> a >> b;
int cnt[3] = {0};
for (int i = 0; i < n; i++)
{
int p;
cin >> p;
if(p <= a){
cnt[0]++;
}
if(a < p && p <= b){
cnt[1]++;
}
if(b < p){
cnt[2]++;
}
}
cout << min(cnt[0], min(cnt[1], cnt[2])) << end... | 1 | 69,643,319 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=9999999999999999;
int main() {
string S;
cin>>S;
set<char>k;
for(int i=0;i<4;i++){
k.insert(S[i]);
}
if(k.size()==2){cout<<"Yes"<<endl;}
else{cout<<"No"<<endl;}
return 0;} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
sort(s.begin(),s.end());
if(s[0]==s[1] && s[1]!=s[2] && s[2]==s[3])
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
exit(0);
} | 1 | 22,324,387 |
#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_ele... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i<(n);i++)
#define fore(i,a) for(auto &i:a)
#define debug(a,b) cout << "debug : " << a << " , "<< b << endl
using ll=long long;
const ll INF=1LL<<60;
const ll mod=1E9+7;
int main(){
int n;
cin >> n;
... | 1 | 64,236,151 |
#include <iostream>
using namespace std;
int check(void);
#define INIT 0
#define NO 1
int main() {
int W =INIT;
int H =INIT;
int x =INIT;
int y =INIT;
int r =INIT;
int flag =INIT;
cin >> W;
cin >> H;
cin >> x;
cin >> y;
cin >> r;
i... | #include <iostream>
using namespace std;
void checkCircleOnRectangle(int w, int h, int x, int y, int r)
{
bool isOn = ((0 <= x - r && x + r <= w) &&
(0 <= y - r && y + r <= h));
cout << (isOn ? "Yes" : "No") << endl;
}
int main()
{
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
c... | 1 | 61,661,628 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; cin >> s;
int a = s[0] - '0';
int b = s[1] - '0';
int c = s[2] - '0';
int d = s[3] - '0';
if (a + b + c + d == 7) cout << s[0] << "+" << s[1] << "+" << s[2] << "+" << s[3] << "=7" << endl;
else if (a +... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
vector<int> X(4);
for (int i = 0; i < 4; ++i) {
X[i] = a[i]-'0';
}
for (int i = 0; i < (1 << 3); ++i) {
bitset<3> bit(i);
int sum = X[0];
vector<string> ans(7);
ans.push_back(to... | 1 | 91,567,097 |
#include<iostream>
#include<math.h>
#include<algorithm>
typedef long long ll;
using namespace std;
int main(){
int n,k;
cin>>k>>n;
if(k*500>=n)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(void) {
io;
int k,y; cin >> k >> y;
if ((k * 500) >= y) cout << "Yes";
else cout << "No";
return 0;
} | 1 | 90,422,691 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int r, g;
cin >> r >> g;
cout << 2 * g - r << "\n";
} | #include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
char s[] = "1001010111001010";
int main()
{
long long i,n,x,y,c1=0,c2=0;
ios::sync_with_stdio(0),cin.tie(0);
cin>>i>>n;
cout<<2*n-i;
return 0;
} | 1 | 31,402,941 |
#include <iostream>
using namespace std;
int main(){
int g[1001][1001];
int n,a,b,c;
cin >> n;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
g[i][j]=0;
}
}
for (int i = 0; i < n; ++i)
{
cin >> a >> b ;
for (int i = 0; i < b; ++i)
{
cin >> c;
g[a-1]... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k,u,d;
cin>>n;
vector<vector<int> > Adj(n,vector<int>(n,0));
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
Adj[i][j]=0;
}
}
for(int i=0;i<n;i++){
cin>>k>>u;
for(int j=0;j<u;j++){
... | 1 | 27,457,185 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> L(2*N);
for(int i=0;i<2*N;i++){
cin >> L.at(i);
}
long long sum=0;
sort(L.begin(),L.end());
for(int i=0;i<2*N;i+=2){
sum+=L.at(i);
}
cout << sum << endl;
} | #include <iostream>
using namespace std;
int main(void){
int n,i,j,ans=0;
cin >>n;
int l[200];
int max,tmp;
while(cin>>j){
l[i] = j;
i++;
}
cout<<endl;
for(i=0;i<2*n-1;++i){
max=i;
for(j=i+1;j<2*n;++j){
if(l[max]<l[j]){
max=j;
}
}
tmp=l[max];
l[max]=l[i];... | 1 | 84,078,137 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
for(int i = 0; i < S.size(); i++){
if(S[i] == '1'){
cout << '9';
}else if(S[i] == '9'){
cout << '1';
}else{
cout << S[i];
}
}
cout << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(void) {
string n;
cin >> n;
for(int i = 0; i < n.length(); i++){
if(n[i] == '1'){
n[i] = '9';
}else{
n[i] ='1';
}
}
cout << n[0] << n[1] << n[2] << endl;
return 0;... | 1 | 77,071,153 |
#include <iostream>
using namespace std;
int main()
{
int i;
char str[30];
cin >> str;
for(i=0; str[i] != 0; i++);
i--;
for(;i>=0; i--){
cout << str[i];
}
cout << endl;
return(0);
} | #include<iostream>
using namespace std;
int main(){string s;cin>>s;int i,l=s.length();for(i=1;i<=l;i++)cout<<s.at(l-i);cout<<endl;} | 1 | 52,223,423 |
#define rep(i, a, b) for(int i = a; i < (int)(b); i++)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline void chmax(T &a, const T &b) {if(a < b) a = b;}
template<class T> inline void chmin(T &a, const T &b) {if(a > b) a = b;}
const long long INF = 1LL<<60;
const long long MOD ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int d;
cout<<180*(n-2);
return 0;
} | 1 | 48,497,186 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i,N) cin >> h[... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int temp;
int count = 0;
... | 1 | 14,216,072 |
#include <iostream>
using namespace std;
int main(){
while (1) {
int n;
cin>>n;
if(n == 0)break;
char list[n][2];
for (int i = 0; i < n; i++) {
cin>>list[i][0]>>list[i][1];
}
int m;
cin>>m;
char str[m];
for (int i = 0; i < m; i++) {
cin>>str[i];
for (int j = 0; j < n; j++) {
if(str[i] ... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main() {
int N, M;
while(cin >> N && N!=0) {
map<char, char> conv;
for(int i=0; i<N; ++i) {
char pre, post;
cin >> pre >> post;
conv[pre] = post;
}
cin >> M;
... | 1 | 66,519,934 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(... | #include<bits/stdc++.h>
using namespace std;
void solve(){
int a,b,c,k;
cin>>a>>b>>c>>k;
while(k--){
if(c<=a) c*=2;
else if(c<=b) c*=2;
else if(b<=a) b*=2;
}
if(c>b && b>a)
cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
int main(){
solve();
} | 1 | 46,906,043 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | #include<bits/stdc++.h>
using namespace std;
long long q,h,s,d,n,ans,x;
int main()
{
cin>>q>>h>>s>>d>>n;
x=min(q*4,min(h*2,s));
if(x*2<=d)
cout<<x*n;
else
cout<<((n%2)*x)+n/2*d;
return 0;
} | 1 | 40,155,634 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,i... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
int N, K;
str... | 1 | 83,995,176 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int r = a-b;
if(r>=0){
cout<<r;
}
else{
cout<<"0";
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 1 | 11,900,676 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int t,n,i,j,k;
cin>>n;
int s=((n-1)*n)/2;
cout<<s;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 1 | 55,060,397 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); ... | 1 | 2,456,715 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k; cin >> n >> k;
if (k > (n - 1) * (n - 2) / 2) {
cout << "-1\n";
return 0;
}
int m = n - 1 + (n - 1) * (n - 2) / 2 - k;
cout << m << '\n';
for (int i = 1; i < n; i++)
cout << i << ' ' << n << '\n';
m -= n - 1;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 1 | 43,921,478 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
#define Reps(i, x, N) for(int i = x; i < N; i++)
const int LLINF = 1LL << 60;
signed main()
{
int N;
int A, B, C;
cin >> N;
Rep(i, N) {
int cnt = 0;
cin >> A >> B >> C;
while(A < 1000) {
... | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
typedef long long LL;
int main(){
int n;
cin >> n;
int y,m,d;
int a,x;
x=(1000-1)*195+(1000-1)/3*5;
for(int i=0;i<n;i++){
cin >> y >> m >> d;
a=(y-1)*195+(y-1)/3*5;
if(y%3){
... | 1 | 79,398,729 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
int n;
cin >> n;
vector<tuple<ll, ll, ll>> vec;
rep(i, n){
ll a, b;
cin >> a >> b;
vec.push_back(make_tuple(a+b, a... | #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... | 1 | 97,430,552 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long,long long>
#define ii pair<int,int>
#define mod 1000000007
#define endl '\n'
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
ll power(ll a,ll b){
ll ans=1;
while(b>0){
if(b%2!=0){
ans=(ans*a)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mx 100010
#define pi acos(-1)
#define endl '\n'
#define Fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
int main(... | 1 | 54,428,303 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
string make_string(int p, int x){
string left, right, a, b;
a=to_string(p); b=to_string(x);
rep(i,6-a.size()) left+='0';
left+=a;
rep(i,6-b.size()) right+='0';
rig... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n,m; cin>>n>>m;
vector<int> p(m),y(m);
map<int,int> t;
for(int i=0; i<m; i++){
cin >> p.at(i) >> y.at(i);
p.at(i)--;
t[y.at(i)] = i;
}
sort(y.begin(),y.end());
vector<int> num(n), ans(m);
... | 1 | 58,285,053 |
#include <bits/stdc++.h>
using namespace std;
#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(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | 1 | 34,002,135 |
#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 <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
const char* result = "dangerous";
if (B <= A) {
result = "delicious";
} else if (B - A <= X) {
result = "safe";
}
cout << result << endl;
return 0;
} | 1 | 31,422,451 |
#include <iostream>
#include <algorithm>
#include <string>
#include <math.h>
#include <cstdint>
#include <sstream>
#include <map>
#include <vector>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
ll ans, mx, sum, mn = 1e8, cnt;
int main(){
ll n;
cin>>n;
ll a[n],b[n];
for(ll i=0; i<n; ... | #include "bits/stdc++.h"
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;++i)
#define END(x) (*(x.end()-1))
using namespace std;
typedef long long ll;
template<typename T>
T gcd(T a, T b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
template<typename T>
T lcm(T... | 1 | 82,986,162 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
double a,b,x; cin>>a>>b>>x;
double ans=0;
if(pow(a,2)*b <= 2*x){
ans = atan((2*(a*a*b - x))/(a*a*a));
}else{
ans = -(atan((2*x)/(a*b*b)) - M_PI/2);
}
cout ... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 1 | 79,905,195 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef ... | #include <bits/stdc++.h>
using namespace std;
bool done = false;
void calc(int sum, string Sl, string Sr){
if (!done){
if (Sr.size() == 1){
if (sum + stoll(Sr) == 7){
cout << Sl << "+" << Sr << "=7" << endl;
done = true;
} else if (sum - stoll(Sr) == 7){
cout << Sl << "-" << Sr... | 1 | 7,739,588 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=2019;
int main(){
string N; cin >> N;
int K; cin >> K;
int size=N.size();
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ld> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<ll>> vvll;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;... | 1 | 76,304,249 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main()
{
int N, K, sum=0;
ci... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
int K = 0;
cin >> K;
vector<int> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
int ans = 0;
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
for (size_t i = 0; i < K; i++)
{
... | 1 | 41,044,803 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
const int INF = 1000100100;
int main(){
ll n,h,x,sum=0;
cin>>h>>n;
rep(i,n){
cin>>x;
sum+=x;
}
if(sum<h){
cout<<"No"<<end... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int h,n;
cin >> h >> n;
vector<int> a(n);
rep(i,n){
cin >> a.at(i);
}
sort(a.begin(),a.end(),greater<>());
rep(i,n){
h-=a.at(i);
if(h<=0){
cout << "Yes";
return 0;
}
... | 1 | 60,715,429 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 10000000000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
ll H,W; cin >> H >> W;
if(H == 1 || W == 1){
cout << 1 << endl;
return 0;
}
printf("%lld\n", (H*W+1)/2);
return 0... | #include<iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
uint32_t H, W;
cin >> H >> W;
if (H == 1 || W == 1)
cout << 1 << endl;
else
cout << W * (uint64_t)(H / 2) + (H % 2) * ((uint64_t)((W + 1) / 2)) << endl;
return 0;
} | 1 | 29,702,395 |
#include <bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
#define pii pair <int,int>
#define pb push_back
#define debug(x) cerr << #x << " = " << x << endl
using namespace std ;
typedef long long ll ;
char c[7][7] ;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int h=0,w... | #include<bits/stdc++.h>
using namespace std;
int h,w,k;
int arr[6][6];
int temp[6][6];
void copy(){
for(int i=0; i<h; i++){
for(int j=0; j<w; j++) temp[i][j] = arr[i][j];
}
}
int solve(){
int ret = 0;
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
if(temp[i][j]==1) ret++;
}
}
return ret;
}
void paint(i... | 1 | 72,513,008 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
int n; cin >> n;
string s; cin >> s;
int ans = 0;
for(int i = 0; i < 1000; i++){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define INF (1ll<<60)
#define mod 998244353
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
template<class T> inline bool c... | 1 | 64,757,116 |
#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);
}
void solve() {
int a, b, c; cin >> a >> b >> c;
if (c >= a && c <= b) cout << "Yes";
else cout <... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << (a <= c && c <= b ? "Yes" : "No") << endl;
} | 1 | 39,163,491 |
#include <iostream>
#include <queue>
#define ll long long
#define up (ll)1e10
#define MAXN 1000005
using namespace std;
struct node {
ll num, step;
node(){}
node(ll n, ll s) : num(n), step(s){}
};
deque <node> q;
bool vst[MAXN];
ll k;
void slove() {
q.push_front(node(1, 1));
while(!q.empty()) {
... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int K;
cin >> K;
vector<int> dist(K, -1);
priority_queue<pair<int,int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
dist[1] = 0;
q.push(make_pair(dist[1], 1));
while(!q.empty()){
auto p = q.top(); q.pop();
i... | 1 | 91,858,402 |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t,d,k;
cin>>n>>d;
ll arr[n][d];
for(i=0;i<n;i++) for(j=0;j<d;j++) cin>>arr[i][j];
ll count=0;
for(i=0;i<n;... | 1 | 44,741,460 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main(){
ll n,m;
cin >> n >>m;
if(n<m/2){
cout << (n+(m/2))/2 <<endl;}
else cout << m/2 <<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll s,c;
cin >> s >> c;
if(s >= c){
cout << c / 2 << endl;
return 0;
}
else
{
ll sum = s;
c -= s * 2;
sum += c / 4;
cout << sum << endl;
}
} | 1 | 37,142,845 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
using namespace std;
#define N (1000000000+7)
#define M 998244353
#define INF 1e16
typedef long long ll;
typedef p... | #include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
int main()
{
string s;
cin >> s;
const int n = s.length();
map<char, bool> f;
vector<long long> mask(n);
for (int i = 0; i < n; ++i) {
f[s[i]] ^= 1;
long long &now = mask[i];
for (int j = 'a'; j ... | 1 | 59,431,833 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | 1 | 55,374,235 |
#include<iostream>
#include<string>
using namespace std;
void SME(int a,int b,int c);
int main(){
int a,b,c;
cin>>a>>b>>c;
SME(a,b,c);
return 0;
}
void SME(int a,int b,int c){
if(a<b && b<c){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include <iostream>
#include<cstdio>
using namespace std;
int main(void){
int a;
int b;
int c;
cin >> a>>b>>c;
if(a<b&&b<c){
cout << "Yes";
}else {
cout <<"No";
}
cout <<endl;
} | 1 | 47,256,294 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 1 | 22,747,603 |
#include <iostream>
#include <string>
using namespace std;
class Slice {
public:
Slice(const char* p, size_t len) : p_(p), len_(len) {}
Slice substr(size_t pos, size_t len) const {
return Slice(p_ + pos, len);
}
const char* data() const { return p_; }
size_t length() const { return len_; }
std::string ... | #include <iostream>
#include <string>
using namespace std;
int main(){
string str;
while(cin >> str){
if(str == "-") break;
int num;
cin >> num;
int pos;
for(int i=0; i<num; i++){
cin >> pos;
str = str.substr(pos, str.size()) + str.substr(0, pos);
... | 1 | 45,004,773 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (auto &v : {111, 222, 333, 444, 555, 666, 777, 888, 999, 1111})
if (n <= v) {
cout << v << endl;
break;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= 9; ++i) {
if (i * 111 >= n) {
ans = i * 111;
break;
}
}
cout << ans;
} | 1 | 55,774,640 |
#include <cstdio>
#include <vector>
using namespace std;
int main(){
int n, k;
while( scanf("%d %d", &n, &k), n && k ){
vector<int> data(n);
for( int i=0; i<n; i++ ){
scanf("%d", &data[i]);
}
int ans = 0;
int sum = 0;
for( int i=0; i<k; i++ ) sum += data[i];
for( int i=k; i<n; i++ ){
sum += data[i... | #include <cstdio>
int a[200000];
int main() {
int n, k;
while (scanf("%d %d",&n,&k)&&n!=0) {
for (int i=0; i<n; i++) scanf("%d",&a[i]);
int max=0;
for (int i=0; i<k; i++) max+=a[i];
int tmp=max;
for (int i=0; i<n-k; i++) {
tmp=tmp-a[i]+a[i+k];
if (... | 1 | 83,123,635 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define rep(i,N) for(int i=0;i<(N);i++)
using namespace std;
int main(){
long long N,M;
cin>>N>>M;
vector<long long> P(M),Y(M);
rep(i,M)cin>>P[i]>>Y[i],--P[i];
vector< vector<long long> > city(N);
rep(i,M)city.at(P[i]).push_back(Y[i]);
... | #include <bits/stdc++.h>
using namespace std;
void solve () {
int n, m;
cin >> n >> m;
unordered_map <int , vector<int>> mp;
vector<pair <int, int>> a(m);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
mp[p].push_back(y);
a[i].first = p;
a[i].second = ... | 1 | 11,306,061 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
int n,m,s[2009],t[2009],dp[2009][2009];
signed main(){
cin>>n>>m;
for(int i=0;i++<n;)cin>>s[i];
for(int i=0;i++<m;)cin>>t[i];
for(int i=0;i++<n;)for(int j=0;j++<m;){
dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-... | #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)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<double,double> P;
const ll INF = 4*1e18;
const int MOD = 1000000007;
const double EPS = 1e-... | 1 | 17,761,763 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long N;
cin >> N;
int sum = 0;
for (long long i = 2; i*i <= N; i++) {
int j = 0;
while (N%i==0) {
j += 1;
N /= i;
}
if (j > 0) {
... | #include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define ld long double
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238463;
const int MAXN = 1000030;
bool isPrime[MAXN];
vector<ll> ans;
void si... | 1 | 12,419,684 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
int main()
{
optimize();
int a,b;
cin>>a>>b;
string sa=to_string(a);
string cpa=sa;
string sb=to_string(b);
string cpb=sb;
for(int i=0;i<b-1;i++)
{
... | #include <bits/stdc++.h>
using namespace std;
void solve(long long a, long long b) {
}
int main() {
long long aa, bb;
cin >> aa >> bb;
string a_tan, b_tan, a, b;
a_tan = to_string(aa);
b_tan = to_string(bb);
for (int i=0;i<bb;i++)
a += a_tan;
for (int i=0;i<aa;i++)
b += b_tan... | 1 | 18,018,232 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin>>s;
int diff, t=753;
for (int i = 0; i < s.size() -2 ; i++)
{
diff = 753 - (s[i]-'0') * 100 - (s[i+1] - '0')*10 - (s[i+2] - '0');
t = min(t, abs(diff));
}
cout<<t;
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string S;
cin>>S;
string check;
int num=0;
int A=0;
int B=0;
int ans=0;
for(int i=0;i<=(int)(S.length()-3);i++){
check=S.substr(i,3);
num=stoi(check);
A=num-753;
if(A<0)A*=-1;
B=ans-753;
if(B<0)B*=-1;
if(A<B... | 1 | 95,017,443 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,K;
cin>>N>>K;
vector<vector<ll>> Z(N,vector<ll>(2,0));
for(int i=0; i<N; i++){
ll t,d;
cin>>t>>d;
Z[i][0]=t;
Z[i][1]=d;
}
sort(Z.begin(), Z.end(), [](auto& x, auto& y){return x[1] > y[1];});
unordered_map<in... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<"... | 1 | 9,333,403 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define strall(v) (v).cbegin(),(v).cend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<class t,class... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using edge = struct {int to; ll cost;};
#define mod 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1 << 29)
int h, w, d;
int a[301][301];
int q;
int l[100001], r[100001];
vector<pair<int, int>> cood(90001);
vector<int> cost(90000... | 1 | 40,495,296 |
#define _USE_MATH_DEFINES
#include<iomanip>
#include<cmath>
#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<queue>
#include<deque>
#include<stack>
using namespace std;
ty... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int ans1 = a[n - 1];
int ans2 = 0;
int k = (ans1 + 1) / 2;
for(int i = 0; i < n; i++){
... | 1 | 13,499,464 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define int long long
#define _GLIBCXX_DEBUG
signed main(){
int N;cin>>N;
double ans=0;
REP(i,N){
double a;string s;cin>>a>>s;
if(s=="JPY")ans+=a;
else ans+=a*38... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | 1 | 63,364,444 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
#define INF 1e9
#define PI 3.141592653589793238
typedef long long ll;
int main() {
ll n,k;cin>>n>>k;
vector<ll> v(n);
ll ans=0;
for(int i=0; i<n; i++){
cin>>v[i];
}
sort(v.begin(), ... | #include <bits/stdc++.h>
using namespace std;
#define rep(k,dst) for(int i=k; i<dst; i++)
#define rep2(k,dst) for(int j=k; j<dst; j++)
#define INF 1000000000000
#define MOD 10000007
#define ll long long
#define pb pop_back
template<typename T> inline void chMin(T* a, T* b) {if(*a>*b) *a=*b;}
template<typename ... | 1 | 48,811,987 |
#include <iostream>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
map<int, int> count;
int getCount(int n) {
int ret = 0;
for (auto& i : count) {
if (i.second >= n) ++ret;
}
return ret;
}
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
rep(i, N) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define mfill(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x,y,h,w) if(0<=x&&x<h&&0<=y&&y<w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr,__VA_ARGS__)
#else
#define debug(... | 1 | 30,315,530 |
#include <iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;
map <int,int>mp;
void precalculation()
{
for(int a=0;a<=9;a++){
for(int b=0;b<=9;b++){
for(int c=0;c<=9;c++){
for(int d=0;d<=9;d++){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n){
int ans = 0;
for(int a = 0;a <= 9;a++){
for(int b = 0;b <= 9;b++){
for(int c = 0;c <= 9;c++){
for(int d = 0;d <= 9;d++){
if(a + b + c + d == n) ans++;
}
}
}
}
... | 1 | 86,004,676 |
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | typedef unsigned long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll m;
std::cin >> m;
ll dsum = 0;
ll sum = 0;
for (int i = 0; i < m; i++) {
ll d,c;
std::cin >> d>>c;
dsum += c;
sum += d*c;
}
std::cout << dsum-1+(sum-1)/9 << std::endl;... | 1 | 64,478,409 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.