code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
const int mod = 998244353;
inline int pls( int a , int b ) { a += b - mod; return a + ( a >> 31 & mod ); }
inline int mns( int a , int b ) { a -= b; return a + ( a >> 31 & mod ); }
inline void inc( int & a , int b ) { a += b - mod; a += a >> 31 & mo... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;... | 1 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 1 |
#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>
#line 1 "lib/segme... | //#define _GLIBCXX_DEBUG
#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()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | 1 |
#include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for(auto it = (... | // Crt. 2019-12-12 20:27:16
#include <algorithm>
#include <iostream>
#include <cstdio>
#define N 200005
using namespace std;
typedef long long ll;
int n, m, now[N], ans[N], tmp[N];
ll x[N], y[N], z[N], K;
int main() {
#ifdef LOCAL_JUDGE
freopen("work.in", "r", stdin);
freopen("work.out", "w", stdout);
#endif... | 1 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<list>
#include<stack>
#include<queue>
#include<iomanip>
#include<functional>
using namespace std;
typedef long long llong;
int main() {
int p, q, r;
string x = "this the that";
//cout << x.find... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
string table = "abcdefghijklmnopqrstuvwxyzAB... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod (int) (1e9+7)
// vector<ll>primes;
// void swap(ll &a, ll &b){
// ll c=a;
// a=b;
// b=c;
// }
// bool is_prime(int a){
// //bool f=true;
// for(int i=2; i*i<=a; i++){
// if(a%i==0){
// return false;
// }
// }
... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int a;
cin>>a;
cout<<(a+a*a+a*a*a)<<endl;
return 0;
} | 1 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#define INF 100000000000000000LL
using namespace std;
int main()
{
int n, m;
int a, b;
scanf("%d %d", &n, &m);
vector<int> v[100000];
for(int i=0; i<m; i++){... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
vector<int> S[MAX],color(MAX,0),odd,even;
void DFS(int u){
int cnt=1;
bool ok=true;
stack<int> ST;
color[u]=1;
ST.push(u);
while(!ST.empty... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x;
int ans=0;
cin>>x;
ans=x*x;
ans*=x;
cout<<ans<<'\n';
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define All(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
//accumulate(vec.begin(), vec.end(), 0)
//std::sort(v.begin(), v.end(), std::greater<Type>());
//set_intersection(x, x+7... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t ... | #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;
const ll mod = 1... | 0 |
//
// main.cpp
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,m;
int A[1001]={},B[1001]={};
vector<pair<int,int> > vec;
cin >> n >> m;
for(int i=0;i<n;i++){
cin >> A[i];
// vec.push_back(make_pair(A[i],i));
}
for(int i=0;i<m;i++){
cin >> B[i];
}
// sort(vec.begin(),ve... | #include<bits/stdc++.h>
using namespace std;
int n, m;
int a[1020], b[1020];
int vote[1020];
int main()
{
while(cin >> n>> m)
{
memset(vote, 0, sizeof vote);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=m;i++) scanf("%d",&b[i]);
for(int i=1;i<=m;i++)
{
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main (){
int a,b,d,e,A,B,N;
cin>>A>>B;
N=0;
for(int i=A;i<B+1;i++){
a=i%10;
b=(i/10)%10;
d=(i/1000)%10;
e=(i/10000)%10;
if(a==e&&b==d){
N++;
}
}
cout<<N<<endl;
}
| #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
ll P[N];
for(ll i=0;i<N;i++){
cin >> P[i];
}
ll ans = 1;
ll now = P[0];
for(ll i=1;i<N;i++){
if(P[i]<now){
ans++;
n... | 0 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author rahdirigs
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void add(T& a, T b, int mod) {
a += b;
if (a >= mod)
a -= mod;
}
template <typename T> void sub(T& a, T b, in... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int dp[10010][110];
int mod = 1e9 + 7;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int d;
cin >> d;
int n = s.size();
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
if (N == 1){
cout << 1 << endl;
return 0;
}
vector<int>A(N);
vector<vector<vector<int>>> data(N, vector<vector<int>>(N, vector<int>(2)));
for (int i = 0; i < N; i++) {
cin >> A.at(i);
for (int j = 0; j < ... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define inf 1000000007
#define mod 1000000007
#define MAX 100005
#define pb push_back
#define mp make_pair
#define vit vector<int>::iterator
typedef pair<int,int> pii;
vector<pii> V[MAX];
int pos[MAX],flg,visited[MAX];
void dfs(int u){
visited[u]=1... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<bool> v(10, true);
rep(i, k) {
int a;
cin >> a;
... | #include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<stack>
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++)
vector<int> card[10];
map<stack<int> ,int> check;
int visit[10];
stack<int> ub;
int cont;
void saiki(int dep,int k,i... | 0 |
#include <iostream>
#include <string>
using namespace std;
class Dice{
public:
int dice[6];
int buff1, buff2, buff3;
void north(){
buff1 = dice[0];
buff2 = dice[1];
buff3 = dice[5];
dice[5] = dice[4]; // 5 <- 1'
dice[0] = buff2; // 0 <- 4
dice[4] = buff1; // 4 <- 5'
dice[1] = buff3; // 1 <- 0'
}
voi... |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";... | 0 |
#include <iostream>
using namespace std;
int data[100];
int count=0;
void BubbleSort(int[],int);
int main(){
int i,n;
cin>>n;
for(i=0; i<n; i++){
cin>>data[i];
}
BubbleSort(data,n);
for(i=0; i<n; i++){
cout<<data[i];
if(i==n-1)cout<<endl;
else cout<<" ";
}
cout<<count<<endl;
return 0;
}
voi... | #define DIN freopen("input.txt","r",stdin);
#define DOUT freopen("output.txt","w",stdout);
#include <bits/stdc++.h>
#include <cstdio>
#define mem(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int i=(a);i<=(int)(b);i++)
#define REP_(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
using namespace std;
typedef l... | 0 |
#include<iostream>
#include<queue>
using namespace std;
int main(){
priority_queue<int>q1,q2;
int a,b;
for(int i=0;i<4;i++){
cin>>a;
q1.push(a);
}
for(int i=0;i<2;i++){
cin>>a;
q2.push(a);
}
for(int i=0;i<3;i++){
b+=q1.top();
q1.pop();
}
... | #include<iostream>
using namespace std;
int main(){
int a[3],e,f,x,y,z,i;
cin>>a[0]>>a[1]>>a[2]>>a[3]>>e>>f;
x=100;
y=0;
for(i=0;i<4;i++){
y=y+a[i];
if(x>a[i]){
x=a[i];
}
}
z=y-x;
if(e>f){
z=z+e;
}else{
z=z+f;
}
cout<<z<<endl;
return 0;
} | 1 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef int_fast64_t ll;
template<int N, typename T, T M>
struct ModFact {
T fact[N+1];
constexpr ModFact() : fact() {
fact[... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
#define MOD 1000000007
int main(){
int n; cin >> n;
string s; cin >> s;
vector<long long int> l,r;
int parity = 0;
for(int i=0;i< 2*n;i++){
if(parity < 0){cout << 0 << endl; return 0;}
if(parity==0 && s[i]=='W'){cout << 0 << end... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int N; cin >> N;
vector<long long> cnt(45*20*10, 0);
for(int i=0;i<N;i++){
string s; cin >> s;
long long v = 0;
int a = -1;
for(auto& c : s){
if(c == '.') a = 0;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mxD = 110, mxN = 1e4 + 5, mod = 1e9 + 7;
string K;
int D, n;
vector<int> digits;
ll dp[mxN][mxD][2];
ll rec(int idx, int sum, int flag) {
if (idx == n) {
if (sum % D == 0) {
return 1;
}
return 0;
}
if (dp[idx][sum][flag] != -1) ... | #include<bits/stdc++.h>
#define X first
#define Y second
#define ll long long
#define MP make_pair
#define PB push_back
using namespace std;
const int MAXN=1e5;
ll MOD=1e9+7;
string s;
ll d;
ll dp[105];
ll novidp[105];
ll rj,n;
ll br;
void update(){
for(int i=0; i<103; i++){
dp[i]=novidp[i];
novidp[i]=0;
}
}... | 1 |
#include<cmath>
#include<iostream>
int main(){
double r; std::cin >> r;
std::cout << 2*M_PI*r << std::endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_st... | 0 |
#include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | /**
* auther: moririn_cocoa
*/
// #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_me... | 1 |
#include <iostream>
#include <vector>
#include <cstring>
#include <queue>
#include <utility>
#include <algorithm>
#define INF 700000000
using namespace std;
vector<pair<int, int>> adj[110];
int solve (int x, int d)
{
int dst[110];
bool done[110];
priority_queue<pair<int, int>> que;
for (int i=0; i<11... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
int main() {
int n,k;
while(cin >> n >> k, n && k) {
long long INF = 1e10;
vector<vector<long long>> dist(n, vector<long long>(n, INF));
for(int ... | 1 |
#include<iostream>
using namespace std;
int main(){
string str,str2;
cin >> str;
int n = str.size();
for(int i = 0;i < n;i++){
str2.push_back(str[n-i-1]);
}
cout << str2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
for (int i = 1; i < s.size(); ++i)
if (s[i - 1] == 'A' && s[i] == 'C') {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
}
| 0 |
#include <stdio.h>
#include <string.h>
int main(){
char arry[20];
scanf("%s",&arry);
int ln=strlen(arry),i;
for(i=ln-1;i>=0;i--)
{
printf("%c",arry[i]);
}
printf("\n");
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin>>s;
for(string::reverse_iterator r = s.rbegin();r!=s.rend();r++) cout<<*r;
cout<<endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | #include <algorithm>
#include <cctype>
#include <cstring>
#include <cstdio>
using namespace std;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 3e2+5;
int n, m, f[N][... | 1 |
#include <cstdio>
using namespace std;
using int64 = long long;
int64 merge(int a[], int left, int mid, int right)
{
int64 count = 0;
int n1 = mid - left;
int n2 = right - mid;
int l[n1 + 1], r[n2 + 1];
for (int i = 0; i < n1; i++)
l[i] = a[left + i];
for (int i = 0; i < n2; i++)
r[i] = a[mid + i]... | #include <bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long int
#define ull unsigned long long int
const int INF = 1e9 + 7;
const int N = 1e5+5;
int main() {
IO;
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> ... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v[i];
int ans = 0;
rep(i,n+1) for(int j = 0; j+i <= n; j++){
if(i+j > k) cont... | #include<bits/stdc++.h>
using namespace std;
long long ara[57],dp[52][52][101];
long long solve(long long fr,long long sc,long long cap)
{
if(sc<fr || cap==0)return 0;
else if(dp[fr][sc][cap]!=-1)return dp[fr][sc][cap];
else
{
long long p=-99999999999999;
if(cap-1>=0)
{
... | 1 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
int people[100005][4];
int sum[100005];
int main(){
int N;
scanf("%d", &... | #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)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | 1 |
#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;
bool isPrime[100010];
void ... | #include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
bool is_prime(in... | 1 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double H, W, N;
cin >> H >> W >> N;
if (H > W) cout << ceil(N/H);
else cout << ceil(N/W);
return 0;
} | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
using namespace std;
int partition(int *A,int p,int r)
{
int x,j,temp;
x = A[r];
j = p-1;
for(int i = p; i < r; i++)
{
if (A[i] <= x)
{
j++;
temp = A[j];
A[j] = A[i];
A[i] = temp;
}
}
temp = A[j+1];
A[j+1] = A[r]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Vec = vector<int>;
int mod=1000000007;
bool IsPrime(int num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false;
double sqrtNum = sqrt(num);
for (int i ... | 0 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
cout << s.substr(0, n - 8) << endl;
}
| 1 |
#include<iostream>
using namespace std;
int main(){
int a, ans;
cin >> a;
ans = a * (1 + a + a * a);
cout << ans << endl;
return 0;
} | //q1.cpp
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp mak... | #include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <cmath>
#include <cstdio>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
typedef unsigned long long ull;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 400005
#define MOD 998244353
#define LL long long int
LL ans,res,C[MAXN],fac[MAXN],revfac[MAXN];
int n,m,k;
LL qpow(LL a,int b)
{
LL tmp=1;
while(b)
{
if(b&1)
tmp=tmp*a%MOD;
... | #include<bits/stdc++.h>
#define ll long long
#define re register
#define ull unsigned ll
using namespace std;
inline int read(){
int s=0,t=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')t=-1;ch=getchar();}
while(ch>='0'&&ch<='9')s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*t;
}
const int N=3e5+5;
const i... | 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 rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | //Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
const int max_n = 1e5;
const ll mod = 1e9+7;
const ll INF = 1LL<<60;
typede... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int dp[31];
int main() {
dp[0] = 1;
for (int i=1; i<31; ++i) {
int sum = 0;
for (int j=i-1; j>=i-3 && j>=0; --j) {
sum += dp[j];
}
dp[i] = sum;
}
int n;
while (cin >> n, n) {
... | 0 |
#include<bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug cout<<"Debugging.."<<endl
using namespace std;
int main()
{
faster;
ll int n;
cin>>n;
int a=pow(n,2);
int b=pow(n,3... | #include <iostream>
int main() {
int a; std::cin >> a;
int sum = a;
sum += a*a + a*a*a;
std::cout << sum << std::endl;
return 0;
} | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll mod = 1e9 + 7;
int digit(ll x) {
int digits = 0;
while(x > 0){
x /= 10;
digits+... | #include <bits/stdc++.h>
#define pb push_back
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
#define fore(i,v) for(int i=g[v],d=es[i].d;i;i=es[i].nxt,d=es[i].d)
using namespace st... | 0 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long lon... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
return b != 0 ? gcd(b, a % b) : a;
}//MAX
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
//MIN
main() {
int n,h,w;
cin >> n >> h >> w;
cout << (n-w+1)*(n-h+1)<<endl;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, Q;
cin >> N >> Q;
vector<vector<int>> vec(N,vector<int>(3));
for(int i=0; i<N; i++){
for(int j=0; j<3; j++){
cin >> vec.at(i).at(j);
}
}
vector<int> query(Q+2,-1e9);
for(int i=1; i<=Q; i++){
cin >> query.at(i);
}
query.a... | 1 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
int f(int x){
if(x < 0){x *= (-1);}
return x;
}
int main(){
int n; cin >> n;
vector<int> v(n+10, 0);
int time = 0;
for(int i = 1; i <= n; i++){
cin >> v[i];
time += f(v[i] - v[i-1]);
}
time += f(v[n]);
for... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep_r(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(),x.end()
#define resize(x, n) x.resize(n)
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll INF = 10... | 1 |
#include<bits//stdc++.h>
using namespace std;
int main(){
int m,minn,maxn;
while(cin>>m>>minn>>maxn&&m!=0){
int a[200];
for(int i=0;i<m;i++){
cin>>a[i];
}
sort(a,a+m);
reverse(a,a+m);
int go=-1;
int n=0;
for(int i=minn;i<=maxn;i++){
if(go<a[i-1]-a[i]){
go=a[i-1]-a[i];
n=i;
}
else i... | #include<iostream>
using namespace std;
int main(){
int n,a,b,c=0,max=0,x;
cin >> n;
if(n==2)cin >> a >> b ;
else if(n==3)cin >> a >> b >> c ;
if(n==2){
if(a<b){
x=a;a=b;b=x;
}
}
if(n==3){
if(a<b){
x=a;a=b;b=x;
}
if(b<c){
x=b;b=c;c=x;
}
if(a<b){
x=a;a=b;b=x;
}
}
for(int i=0;i<a;i++)... | 0 |
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define free freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return 1;}return 0;}
template<class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return 1;}return 0;}
int main(){
double d,t,s;
... | 1 |
#include<cstdio>
using namespace std;
#define N 300050
#define M 10
#define mod 1000000007
int dp[N][M],t[M][2],as;
char s[N];
int main()
{
t[1][1]=2;t[1][0]=8;
t[2][1]=3;t[2][0]=4;
t[3][1]=3;t[3][0]=3;
t[4][1]=2;t[4][0]=5;
t[5][1]=4;t[5][0]=4;
t[6][1]=2;t[6][0]=7;
t[7][1]=6;t[7][0]=9;
t[8][1]=6;t[8][0]=9;
t[9... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define MOD 998244353
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num ... | 0 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
vector<bool> a(26,false);
string s; cin >> s;
if(s.size()<26){
for(int i = 0; i < s.size(); i++) {
a[(int)s[i]-97]=true;
}
for(int i = 0; i < 26; i++) {
if(a[i]==false){
... | 0 |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repn(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define pb... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for(int i = a; i < b; ++i)
ty... | 0 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <numeric>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define rep... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define W(x, y) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << y;
#else
#define W(x, y)
#endif
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;
using vl = vector<ll... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
struct data_t {
string name;
double eff;
bool operator<(const data_t& right) const {
if (eff == right.eff) {
return (name < right.name);
}
else {
return (eff > right.eff);
}
}
};
int main(void) {
int... | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII; typedef pair<LL, LL> PLL;
typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<VVI> VVVI;
typedef vector<LL> VLL; typedef vector<VLL> VVLL; ... | 1 |
#include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
vector<ll> prime(ll n){
vector<ll> rt;
for(ll i=2;i*i<n;i++){
ll tmp=0;
while(n%i==0){
tmp++;
n/=i;
}
if(n%i!=0&&tmp!=0) rt.push_back(tmp);
... | 0 |
#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
#def... | #include <bits/stdc++.h>
using namespace std;
int moveX(vector<char>& str, int posX, int targetX)
{
while(posX < targetX)
{
posX += 1;
str.push_back('R');
}
while(targetX < posX)
{
posX -= 1;
str.push_back('L');
}
return posX;
}
int moveY(vector<char>& str... | 0 |
#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#... | #include<bits/stdc++.h>
#define ll long long
#define ljc 998244353
using namespace std;
#define gc getchar
inline ll read(){
register ll x=0,f=1;char ch=gc();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=gc();}
while (isdigit(ch)){x=(x<<3)+(x<<1)+ch-'0';ch=gc();}
return (f==1)?x:-x;
}
ll ans[1010][1010],n;... | 0 |
#include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
r=r*2*3141592;
cout<<r/1000000<<"."<<r%1000000;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
const double PI = 3.14159265358979;
double R;
cin >> R;
cout << R*2*PI << endl;
return 0;
} | 1 |
#include<stdio.h>
#include<string.h>
int main(void)
{
char str[20];
int len,i;
scanf("%s",str);
len=strlen(str);
for(i=len-1;i>=0;i--){
printf("%c",str[i]);
}
printf("\n");
return 0;
}
| #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
// cin >>
// cin <<
int main(){
string a;
getline(cin,a);
reverse( a.begin() , a.end() );
cout <<a<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define MAX_N 100
#define INF 1000000000
int N;
int r[MAX_N],c[MAX_N];
int memo[MAX_N][MAX_N]... | #include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <algorithm>
#include <array>
using namespace std;
int INF = 100000000;
struct Matrix { int row, col; };
int getMinMCM(const vector<Matrix>& matVec) {
const size_t n = matVec.size();
//table(i,num)は、与えられた行列積のindex=i(0始まり）の行列から、nu... | 1 |
#include <iostream>
#include <cmath>
#include <cstdlib>
using namespace std;
int main(int argc, char* argv[])
{
int n = 0, n2 = 0;
cin >> n;
//n = atoi(argv[1]);
if(n < 1 || n > 100) {
return 1;
}
n2 = pow(n, 3.0);
cout << n2 << endl;
}
| #include <cstdio>
int main() {
int a, b;
scanf("%d", &a);
b=a*a*a;
printf("%d\n",b);
return 0;
}
| 1 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = max(a, b);
if (max(a, b) - min(a, b) >= 2) {
sum += max(a,b) - 1;
}
else {
sum += min(a,b);
}
cout << sum;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a[5];
int ans;
for(int i=0;i<2;i++){
cin>>a[i];
}
sort(a,a+2);
ans=a[1];
a[1]--;
sort(a,a+2);
ans+=a[1];
cout<<ans<... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | #include <iostream>
//#include<stack>
#include<set>
#include<bits/stdc++.h>
using namespace std;
//int f[10005];
//int chazhao(int x)
//{
// if(x==f[x])
// return x;
// else
// return f[x]=chazhao(f[x]);
//}
int main()
{
set<int >ss;
int n,x;
cin>>n>>x;
ss.insert(x);
for(int i=1;i<n;i++)
{
cin>>x;
if(ss.cou... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N,a[500010],s[500010];
vector<int>pos[1<<20];
int sum0[500010];
const int MOD = 1e9 + 7;
int main() {
scanf("%d",&N);
for (int i=1;i<=N;i++) {
scanf("%d",&a[i]);
s[i] = s[i - 1] ^ a[i];
pos[s[i]].push_back(i);
sum0[i] = sum0[i - 1] + (s[i] == 0);
}
if (s[... | //Only the Creator has given me strength!🖤
#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<iostream>
#include<fstream>
#include<numeric>
#include<string>
#include<vector>
#include<cstring>
#i... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template <class Abel> struct BIT {
vector<Abel> dat[2];
Abel UNITY_SUM = 0; // to be set
/* [1, n] */
BIT(int n) { init(n); }
void init(int n) { for (int iter = 0; iter < 2; ++iter) dat[iter].as... | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i, a, n) for (int i=(a); i<(n); i++)
#define per(i, a, n) for (int i=(a); i>(n); i--)
typedef long long ll;
const int maxn = 5e5+5;
const int mod = 1e9+7;
using namespace std;
int block, curl, curr, res;
struct qry {
int id, l, r;
} q[maxn];
int ans[maxn], a... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m);
vector<string> s(m);
rep(i, m) cin >> p[i] >> s[i];
rep(i, m) --p[i];
vector<int> ac(n, 0), wa(n, 0);
rep(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main(){
int n, m; cin >> n >> m;
vector<vector<string>> v(n);
rep(i, m){
int a; cin >> a;
string s; cin >> s;
v.at(a-1).push_back(s);
}
int ac = 0, wa = 0;
... | 1 |
#include <stdio.h>
int main(){
int X,Y,Z;
int *px,*py,*pz;
scanf("%d",&X);
scanf("%d",&Y);
scanf("%d",&Z);
px = &Z;
py = &X;
pz = &Y;
printf("%d %d %d",*px,*py,*pz);
} | #include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
int a;
int b;
int c;
void input() {
cin >> a >> b >> c;
}
void solve() {
swap(a, b);
swap(a, c);
cout << a << ' ' << b <... | 1 |
//#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | using namespace std;
#include <iostream>
#include <string>
#include <set>
#include <functional>
#include <vector>
#include <algorithm>
#include <stdio.h>
int CtoI(char c){
if(c=='I')return 1;
else if(c=='V')return 5;
else if(c=='X')return 10;
else if(c=='L')return 50;
else if(c=='C')return 100;
else if(c=='D')ret... | 0 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <locale>
#include <iostream>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int pie = l*n - n;
for (int i = 1; i <= n; i++) {
pie += i;
}
if (l < 0) {
if (n-1 < abs(l)) pie -= l+n-1;
}
else {
pie -= l;
}
cout << pie << endl;
} | 0 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | #include<bits/stdc++.h>
using namespace std;
const int N=(1<<18);
const int mod=1e9+7;
int dp[50][N];
int n,a,b,c;
int main()
{
//freopen("H:\\c++1\\in.txt","r",stdin);
//freopen("H:\\c++1\\out.txt","w",stdout);
scanf("%d",&n);
scanf("%d",&a);scanf("%d",&b);scanf("%d",&c);
int bz=(1<<(a-1))|(1<<(a+b-1))|(1<<(a+b+c... | 0 |
#include<bits/stdc++.h>
using namespace std;
struct node
{
int num,fa,ls,rs;
node(int _num,int _fa)
{
num=_num;
fa=_fa;
ls=rs=-1;
}
};
typedef vector<node> Tree;
Tree T;
void insert(int t,int n)
{
if(T[0].num==INT_MAX)
T[0].num=n;
else if(T[t].num>n)
if(T[t].ls==-1)
{
T[t].ls=T.size();
T.p... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <list>
#include <stack>
#include <cctype>
#include <cmath>
using namespace std;
/* typedef */
typedef long long ll;
/* consta... | 1 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
int n;
int main(){
scanf("%d",&n);
string s,t;cin>>s>>t;
if(s==t)puts("0"),exit(0);
reverse(s.begin(),s.end()),reverse(t.begin(),t.end());
int k=0;
queue<int>q;
int ans=0;
for(int i=0,j;i<n;i=j+1){
for(j=i;j+1<n&&t[j+1]=... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
... | 0 |
#include<stdio.h>
#include<algorithm>
using namespace std;
char str[110];
int b[110];
int main(){
int a;
while(scanf("%d",&a),a){
for(int i=0;i<a;i++)scanf("%d",b+i);
scanf("%s",str);
for(int i=0;str[i];i++){
int p=0;
if('a'<=str[i]&&str[i]<='z')p=str[i]-'a';
else p=str[i]-'A'+26;
p-=b[i%a];
if(p... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define fi first
#define se second
void read(int &x){
char ch=getchar();x=0;
for (;ch==' '||ch=='\n';ch=getchar());
for (;ch!=' '&&ch!='\n';x=x*10+ch-'0',ch=getchar());
}
void write(int x){
if (x>9) write(x/10);
putchar(x%10+'0');
}
int n;
pi... | #include <algorithm>
#include <cstdio>
#include <tuple>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < int(n); ++(i))
#define repeat_reverse(i, n) for (int i = (n)-1; (i) >= 0; --(i))
#define whole(x) begin(x), end(x)
using ll = long long;
using namespace std;
template <class T> inline void setmin(T & a, ... | 1 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,T;
cin>>N>>T;
vector<int>t(N);
for(int i=0;i<N;i++){
cin>>t[i];
}
int a=N*T;
for(int i=1;i<N;i++){
if((T-(t[i]-t[i-1]))>0){
a-=(T-(t[i]-t[i-1]));
}
}
cout<<a<<endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t minimum;
for(int i = 0; i < 5; i++) {
if(i == 0) {
cin >> minimum;
}
else {
int64_t a;
cin >> a;
minimum = min(minimum, a);
}
}
cout << (N - 1) / minimum + 5 << endl;
} | #include<bits/stdc++.h>
using namespace std;
long long mi(long long A,long long B,long long C,long long D,long long E){
return min(min(min(min(A,B),C),D),E);
}
int main(){
long long N,A,B,C,D,E;cin>>N>>A>>B>>C>>D>>E;
if(mi(A,B,C,D,E)==A){cout<<(N+A-1)/A+4;return 0;}
if(mi(A,B,C,D,E)==B){cout<<(N+B-1)/B+4;return... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include<iostream>
#include<string>
#include<algorithm>
#define NC 5
using namespace std;
int C[ NC ];
bool isStraight(){
for ( int i = 2; i < 5; i++ ){
if ( C[i-1] != C[i] - 1 ) return false;
}
if ( C[4] == 13 ) return ( C[0] == 1 ) ? true : false;
return ( C[0] == C[1] - 1 ) ? true : false;
}
boo... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a;
string b;
cin >> a >> b;
if(a >= b.size()){
cout << b;
}else{
cout << b.substr(0,a) << "...";
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
if(s.at(0)=='7' ||s.at(1)=='7' || s.at(2)=='7') cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| #include<iostream>
//#include<algorithm>
#include<cmath>
#include<string>
//#include<set>
//#include<vector>
#include<iomanip>
using namespace std;
int main(){
int n;
cin >> n;
if(n%10==7){cout<<"Yes"; return 0;}
else{n/=10;}
if(n%10==7){cout<<"Yes"; return 0;}
else{n/=10;}
if(n%10==7){cout... | 1 |
#include<iostream>
using namespace std;
int main(void){
int date[100];
int n,q;
int i,j;
while(cin>>n>>q,(n||q)){
for(i=0;i<100;i++)date[i]=0;
for(i=0;i<n;i++){
int m;
cin>>m;
for(j=0;j<m;j++){
int d;
cin>>d;
date[d]++;
}
}
int max=0;
for(i=0;i<100;i++){
if(date[i]>date[max])... | #include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
#define scanf_s scanf
#define fir first
#define sec second
#define mp make_pair
#define mt make_tuple
#define pub push_back
using namespace std;
typedef long long int llint;
const llint one = 1;
const llint big = (one<<30);
bool solve(void){
i... | 1 |
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main(){
int n;
string str, s1;
string order;
int a, b;
cin >> str;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> order >> a >> b;
if (order == "print") {
for (int i = a; i <= b; i... | #include <stdio.h>
#include <string.h>
void op_print(char *str, int a, int b)
{
for(int i = a; i <= b; ++i)
{
putchar(str[i]);
}
putchar('\n');
}
void op_replace(char *str, int a, int b, char *p)
{
for(int i = a; i <= b; ++i)
{
str[i] = p[i - a];
}
}
void op_reverse(char *str, int a, int b)
{
for(; a < b... | 1 |
#include<cstdio>
#define RI register int
#define CI const int&
using namespace std;
const int N=1005;
char
tp5[N][N]={
"aabc.",
"..bcd",
"fee.d",
"f.ghh",
"iigjj"
},
tp7[N][N]={
"ab...c.",
"ab...c.",
"..dee.f",
"..d.g.f",
"..hhg.i",
"jj..kki",
"llmm.nn"
};
int n; char a[N][N];
in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
vector<string> three = {
"a..",
"a..",
".bb"
};
vector<string> four = {
"ahff",
"ahgg",
"bbde",
"ccde"
};
vector<string> five = {
"ahhgg"... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int m;
cin >> m;
ll res = 0;
ll sum = 0;
rep(i,m){
ll c,d;... | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
double n;
cin>>n;
vector<v... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
double X[N];
double Y[N];
double sum = 0;
int num = 0;
FOR(i,0,N) cin >> X[i] >> Y[i];
FOR(i,0,N-1) {
FOR(j,i+1,N) {... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#define N 1001000
typedef long long ll;
template<typename T> inline void read(T &x) {
x = 0; char c = getchar(); bool flag = false;
while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
using namespace st... | 1 |
#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=(a);i>(n);--i)
#define pb emplace_back
#define mp make_pair
#define lowbit(x) (x & -x)
typedef long long LL;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const... | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
using namespace std;
typed... | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_M... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int res = 0;
int mn = 200001;
for (int n = 0; n < N; ++n) {
int A;
cin >> A;
if (A < mn) {
++res;
mn = A;
}
}
cout << res << endl;
return 0;
}
| 0 |
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <functional>
int main (){
int m,nmin,nmax,ans,diff;
int point[200];
while(1){
scanf("%d %d %d",&m,&nmin,&nmax);
if(m == 0 && nmin == 0 && nmax == 0) break;
for(int i = 0;i < m;i++){
scanf("%d",&point[i]);
}
//std::s... | #include <bits/stdc++.h>
using namespace std;
typedef long long 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++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int h,w;
cin >> h >> w;
int a,b;
cin >> a >> b;
rep(i,h){
rep(j,w){
bool left,... | 0 |
#include <stdio.h>
int main(){
int x[5],i,j;
while(scanf("%d,%d,%d,%d,%d",&x[0],&x[1],&x[2],&x[3],&x[4])!=EOF){
for(j=0;j<5;j++){
for(i=0;i<4;i++){
if(x[i]>x[i+1]){
int g=x[i+1];
x[i+1]=x[i];
x[i]=g;
}}}
if(x[0]==x[1] && x[1]==x[2] && x[2]==x[3]){
printf("four card\n");
continue;
}
if(x[1]==x[2] &&x[2]==x[3]&&x[3]==x[4... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int card[5], cnt, max_cnt, min_cnt, cnt_one;
char cnm;
while(cin >> card[0]){
cnt = 1;
for(int i=1; i<9; i++){
if(i % 2 == 0){
cin >> card[cnt];
cnt++;
}
else cin >> cnm;
}
sort(card, card + 5);
max_cnt = 1;
mi... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define inf LLONG_MAX
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
const string MINUSINF = "-";
void chmax(string &a, stri... | #include <iostream>
#include <map>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#pragma warning (disable: 4996)
using namespace std;
int dat[10] = { 0,2,5,5,4,5,6,3,7,6 };
int N, M, A[1 << 18];
int dp[1 << 18];
int main() {
cin >> N >> M;
for (int... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(), a.end()
const int N = 1005, mod = 1e9 + 7;
int a, b, c, d, gt[N], dp[N][N], n;
int pw(int x, int i){
int b = 1;
for(; i; i >>= 1, x = x * x... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <utility>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <climits>
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pa... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int main(){
int a[10], b[10];
for(int i = 0; i < 10; i++){
cin >> a[i];
}
for(int i = 0; i < 10; i++){
cin >> b[i];
}
sort(a, a + 10);
sort(b, b + 10);
printf("%d %d\n", (a[7] + a[8... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int W[10],K[10];
int score1=0,score2=0;
for(int i=0;i<10;i++){
cin >>W[i];
}
for(int i=0;i<10;i++){
cin >>K[i];
}
sort(W,W+10);
sort(K,K+10);
for(int i=9;i>6;i--){
score1+=W[i];}
cout <<score1<<" ";
for(int i=9... | 1 |
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#inc... | 1 |
#include<stdio.h>
#include<cmath>
int main(){
double x1,x2,y1,y2,r,R;
scanf("%lf %lf %lf %lf",&x1,&y1,&x2,&y2);
r=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
R=sqrt(r);
printf("%lf\n",R);
return 0;
} | #include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n] , b[n] , c[... | 0 |
#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 = 1e3+23;
int n;
int bio[N][N];
int a[N][N];
int dp[N][N];
vector<pair<int, i... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1e9+7;
int id[1005][1005];
vector<in... | 1 |
#include<iostream>
#include<stdio.h>
using namespace std;
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<(n);i++)
const int mod=1000000007;
int main(){
int d,t,s;
cin>>d>>t>>s;
if(d-t*s<=0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define endl "\n"
typedef long long ll;
const int BIG_NUM = 1e9;
//8+
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int d, t, s;
cin >> d >> t >> s;
double... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string str, comm, sa, sb, sinj;
cin >> str;
int n, a, b;
cin >> n;
cin.ignore();
for (int i = 0; i < n; i++)
{
getline(cin, comm, ' ');
if (comm.substr(0, 5) == "print") {
getline(cin, sa, ' ');
... | #include <iostream>
#include <string>
#include <string.h>
using namespace std;
#define SWAP(var,a,b) {var tmp=a; a=b; b=tmp;}
int main()
{
string str;
int n;
cin >> str >> n;
string order;
string buf;
char c;
int a,b;
string p;
string ShowString[100];
int count=0;
for(int i=0;i<n;i++)
{
... | 1 |
#include <cstdio>
int main(){
int a;
scanf("%d",&a);
printf("%d\n",a*a*a);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, N, d, S;
cin >> X;
N = X;
for (int i = 0; i < 9; i++) {
if (N != 0) {
d = N % 10;
N /= 10;
S += d;
}
else {
break;
}
}
if (X % S == 0) {
cout << "Yes" << endl;
}
else {
cout <<... | 0 |
#include <bits/stdc++.h>
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d){
lo... | #include <stdio.h>
int main()
{
int hour_1;
int hour_2;
int min_1;
int min_2;
int k;
scanf("%d %d %d %d %d", &hour_1, &min_1, &hour_2, &min_2, &k);
int total_hour = hour_2 - hour_1;
int total_minute = min_2 - min_1;
int duration = (total_hour * 60) + total_minute - k;
printf("%d\... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll inf=1e9+7;
const ll mo... | ///A drunk man will find his way home, but a drunk bird may get lost forever...
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
//template <typename T>
//using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tr... | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define REP(i,n) for (int i = 0; i < n; ++i)
const int MAX = 1e5+10;
int N, M;
ll K;
ll X[MAX];
vi mult(vi a, vi b) {
int n = a.size();
vi res(n);
REP (i, n) res[i] = b[a[i]];
return res;
}
vi s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <s... | 1 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main(void)
{
int N;
scanf("%d", &N);
cin.get();
while(--N, N>=0){
char instr[1001];
char *t;
gets(instr);
while( (t = strstr(instr, "Hoshino")) != NULL){
t += 6;
*t = 'a';
}
printf("%s\n", instr);
}
return... | #include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
#define BUFSIZE 1024
char buf[BUFSIZE];
int main()
{
int n = atoi(fgets(buf, BUFSIZE, stdin));
while (n--) {
fgets(buf, BUFSIZE, stdin);
for (int i = 0; i < strlen(buf); ++i) {
if (strncmp(buf + i, "Hoshino", 7) == 0)
buf[i+6] =... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define pll pair<ll, ll>
#define tri pair<pll, ll>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vlp vector< pair<ll, ll> >
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.