code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
int64_t answer = A[0] - 1;
int offset = 2;
for (int i = 1; i < N; ++i) {
if (A[i] <= offs... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long Q,H,S,D,N,n;cin>>Q>>H>>S>>D>>n;
N=n*100;
if((Q*8<=H*4)&&(Q*8<=S*2)&&(Q*8<=D)){
cout<<Q*(N/25)<<endl;
return 0;
}
else if((H*4<=Q*8)&&(H*4<=S*2)&&(H*4<=D)){
cout<<H*(N/50)<<endl;
return 0;
}
... | 0 | 60,739,719 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
struct Node{
int value;
Node *prev,*next;
};
Node *nil;
void insert(int x){
Node *now;
now=(Node *)malloc(sizeof(Node));
now->value=x;
now->prev=nil;
now->next=nil->n... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int main() {
char C[1000][10... | 0 | 31,043,056 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int main() {
int64_t S; cin >> S;
auto OK = [&](int64_t x) -> bool {
return x * 1e9 < S;
};
int64_t l = 0, r = 1e9;
while(r - l > 1) {
int64_t c = (l + r) / 2;
if(OK(c)) l = c;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 0 | 69,549,536 |
#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define M 1000000007
#define pb push_back
#define p_q priority_queue
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,l... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#include <bitset>
#define rep(i, a, b) for ( ll i = (a); i < (b); i++ )
#define per(i, a, b) for ( ll i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp ... | 0 | 25,956,634 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define INF 0x3f3f3f3f
#define NIL (-1)
#define M 1046527
using namespace std;
int T[M+1];
void trans(char *s){
for(int i = 0; i < strlen(s); i++){
if(s[i] == 'A') s[i] = '4';
else if(s[i] == 'C') s[i] = '1';
else if(s[i] == 'G') s[i... | 0 | 69,357,869 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7;
#define INF 1e9+9;
#define ps(x,y) fixed<<setprecision(y)<<x
# define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ON... | #include <bits
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
typedef long long ll;
int main(){
int n,m;
cin>>n>>m;
int h[n];
rep(i,n)cin>>h[i];
map<int,bool>mp;
rep(i,n)mp[i]=true;
rep(i,m){
int j,k;
cin>>j>>k;
if(h[j-1]>h[k-1])mp[k-1]=false;
... | 0 | 85,668,377 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main() {
int W,H,N;
cin >> W >> H >> N;
vector<vector<int>> L(N, vector<int>(3));
rep(i,N) cin >> L[i][0] >> L[i][1] >> L[i][2];
int left=0,right=W,bottom=0,top=H;
rep(i,N) {
if(L[i][2]==1) left = max(left,L[i][0... | #include <bits/stdc++.h>
#include <math.h>
#include <regex>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
ld n , d;
vector<vector<ld>> x(n,vector<ld>(d));... | 0 | 36,295,457 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n,count=0;
cin>>n;
for(ll i=1;i*i<=n;i++){
if(n%i==0){
if(n/i-1>i) count+=n/i-1;
else break;
}
}
cout<<count<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string l;
cin >> l;
ll dp[2];
dp[0] = 0;
dp[1] = 1;
for(int i = 0; i < l.size(); i++){
if(l[i] == '1'){
dp[0] = (dp[0]*3+dp[1])%1000000007;
dp[1] = (dp[1]*2)%1000000007;
}
... | 0 | 32,203,989 |
#include<iostream>
#include<algorithm>
#include<map>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
#define lson (rt<< 1)
#define rson (rt<< 1 | 1)
#define gmid ((l+r)>> 1 )
using namespace std;
const int p=1e9+7;
int f[2002];
int main()
{
int n;
cin>>n;
f[0]=1;
for(int i=0;i<=n;++i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 << 3... | 0 | 9,813,111 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n+1);
for(int i=0; i<n+1; i++){
cin >> a[i];
}
vector<long long> b(n);
for(int i=0; i<n; i++){
cin >> b[i];
}
long long ans=0;
long long tmp1, tmp2;
for(i... | 0 | 9,044,079 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int ans = 0;
for(int i = 0; i <= x; ++i){
ans = 2*i + 4*(x-i);
if(ans == y){
cout <<... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 50000;
const int MAXM = 20;
const int INF = 50000;
int res;
vector<int> nums(MAXM);
vector<int> dp(MAXN);
int main()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> nums[i];
}
for... | 0 | 61,739,803 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int A,B,C;
cin>>A>>B>>C;
cout<<max(B+C-A,0LL)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | 0 | 33,857,633 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | #include <bits/stdc++.h>
long long *a{};
int n, k;
bool need(long long, long long, int, int);
int main()
{
scanf("%d%d", &n, &k);
a = new long long[n];
for (int i = 0; i < n; i++) scanf("%lld", a + i);
std::sort(a, a + n, std::greater<long long>());
int left{-1}, right{n};
while (left + 1 < right)
{
int mid{(l... | 0 | 45,638,785 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
class Prints {
private:
class __Pr... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0; i<(n); ++i)
#define REPR(i,n,m) for (int i=(n); i>=(m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD = vector<lo... | 0 | 43,960,410 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2... | 0 | 61,718,172 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int result,i,j,n,m,c[21],t[50001];
cin >> n >> m;
for(i = 0; i < m; i++){
cin >> c[i];
}
for(j = 0; j <= n; j++){
t[j]=10001;
}
t[0]=0;
for(i = 0; i < m; i++){
for(j = c[i]; j <= n; j++){
t[j]=min(t[j],t[j-c[i]]+... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
bool query(ll n) {
char c;
cout << "? " << n << endl;
cin >> c;
return c == 'Y';
}
int main() {
int d;
ll n, l, r, m;
for (d = 1, n = 1; d < 11 && query(n); d++, n *... | 0 | 49,769,999 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long M, std::vector<long long> A, std::vector<long long> B)
{
vector<vector<ll>> baito(M);
for (ll i = 0; i < N; i++) {
if (M - A[i] >= 0) {
baito[M - A[i]].push_back(B[i]);
}
}
p... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int INF = 1e9 + 1;
int main() {
int N;
cin >> N;
vector<double> t(N), v(N);
rep(i, N) cin >> t[i];
rep(i, N) cin ... | 0 | 4,274,966 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(long long i=0; i<(long long)(n);i++)
#define rep2(i,s,n) for(long long i=(s); i<(long long)(n);i++)
#define mod 1000000007
int main() {
int n,a,b;
cin>>n>>a>>b;
int cnta=0,cntb=0,cntc=0;
rep(i,n){
int p;
... | 0 | 58,194,685 |
#include <bits/stdc++.h>
using namespace std;
main(){
int N;
vector<int> A(N);
cin >> N;
for(int i=0;i<N;i++) cin >> A[i];
int mx=A[0];
int mn=A[0];
for(int i=0;i<N;i++){
if(mx<A[i]) mx=A[i];
if(mn>A[i]) mn=A[i];
}
cout << mx-mn <<endl;
} | #include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#pragma GCC optimize("Ofast")
#define rep(i, n) for(int i = 0; i < (n); ++i)
... | 0 | 30,432,196 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#include"atcoder/all"
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
long long MAX = 1000000000000000000;
int main(){
int N,M;
cin >> N >> M;
vector<string> v(N);
vector<string> w(M);
for(int i =0; i < N; i++){
cin >> v[i];
}
for(int i =0; i < M... | 0 | 13,688,023 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N, M;
cin >> N >> M;
long long ans;
if(N>M/2) ans = M/2;
else ans = max(N, N+(M-2*N)/4);
cout << ans << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S ... | 0 | 48,804,873 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define endl '\n'
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 59,738,663 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,L; cin >> N >> L;
vector<int> a(N);
for(auto&e:a) cin >> e;
for(int i=1;i<N;++i) {
if(a[i-1]+a[i]>=L) {
cout << "Possible" << endl;
for(int j=1;j<i;++j) cout << j << endl;
for(int j=N-1;j>=i;--j) cout << j << endl;
return 0;
}
}
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | 0 | 18,718,627 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
vector<vl> graph;
ll A[101010];
ll n;
ll dfs(ll p,ll r)
{
if(graph[p].size() == 1) return A[p];
vector <ll> X;
ll s = 0;
for(auto t: graph[p])
{
if(t != r)
{
ll x = dfs(t, p);
s += x;
X.push_back(x);
}
}
if... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
string S;
cin>>S;
int N=S.size();
vector<int> A(N+1,0),B(N+1,0);
for(int i=0;i<N;i++){
if(S[i]=='<')
A[i+1]=A[i]+1;
else
A[i+1]=0;
}
for(int i=N;i>0;i--){
if(S[i-1]=='>')
B[i-1]=B[i]+1;
else... | 0 | 42,345,501 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.e... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<pair<string, int> > a;
for(int i = 0; i < n; ++i) {
string r1; int r2;
cin >> r1 >> r2;
a.push_back({r1, r2... | 0 | 31,826,159 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N[4];
int main() {
for (int i = 0; i < 4; i++) cin >> N[i];
sort(N, N+4);
if (N[0] == 1 && N[1] == 4 && N[2] == 7 && N[3] == 9) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> next(n), c(n);
for (int i = 0; i < n; ++i) {
cin >> next[i]; next[i]--;
}
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
long long ans = -1e17;
for (int i = 0; i... | 0 | 54,214,954 |
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 0 | 72,076,164 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll K, A, B;
cin >> K >> A >> B;
if (A + 1 >= B || A >= K) {
cout << K + 1 << endl;
return 0;
}
ll dis = B - A;
K -= (A - 1);
cout << A + (dis * (K / 2)) + (K % 2) << endl;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<map>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
long long int n,m,k;
long long int x,y;
long long int mod = 1000000007;
long long int factorial(long long int n){
long long int res;
... | 0 | 74,658,357 |
#include<iostream>
using namespace std;
int main() {
int n,oki[1111],ok,ans[11111],an;
ok = 0;
an = 0;
while(cin >> n) {
if (n == 0) {
an = an + 1;
ans[an] = oki[ok];
ok = ok - 1;
}
else {
ok = ok + 1;
oki[ok] = n;
}
}
for (int i = 1; i <= an; i++) {
cout << ans[i] << endl;
}
} | #include <stdio.h>
int main(void)
{
int i,n,m;
char array[256];
char a[2];
char b[2];
char input[2];
while(1)
{
for(i=0;i<256;i++)
{
array[i] = i;
}
scanf("%d",&n);
if(n == 0)return 0;
for(i=0;i<n;i++)
{
scanf("%... | 0 | 50,475,454 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define int long lo... | #include "bits/stdc++.h"
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);i++)
int main(){
long long k;
cin>>k;
cout<<50<<endl;
long long a=k/50;
long long ans[50];
REP(i,50)ans[i]=49+a;
long long b=k%50;
REP(i,b){
REP(j,50){
... | 0 | 32,443,852 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long GCD(long long a, long long b){return b == 0 ? a : GCD(b, a % b);}
int main(){
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
cout << 180 * (n - 2);
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 34,556,959 |
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N
#define bit(x,y) ((x>>y)&1LL)
#define loop(x) for(int xv=1; xv<=x; xv++)
#define what_is(x) cerr << #x << " is " << x << endl;
#define error(args...) { s... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 0 | 8,998,749 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
in... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <fstream>
#include <unordered_map>
#include <time.h>
using namespace std;
#def... | 0 | 28,512,713 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
using namespace std;
#define ll long long
#define re register
#define file(a) freopen(a".in",,"r",stdin);freopen(a".out","w",stdout)
#define int ll
inline int gi(){... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 0 | 9,075,366 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,k,a,b,s;
cin>>n>>k>>a>>b;
if(k>=n)
{
s=n*a;
}
else
{
s=k*a+(n-k)*b;
}
cout<<s<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
const ll C = 1000000000+7;
int main() {
int N, K;
cin >> N >> K;
vector<ll> num(K, 0);
for(int i=1; i<=N; i++) num[i%K]++... | 0 | 17,481,493 |
#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,r,s,p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
int ans = 0;
for (int i = 0; i < n; i++) {
if(i - k >= 0 && t[i] == t[i - k]) {
t[i] = '?';
c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
template<typename T>
class RangeUpdateQuery {
public:
explicit RangeUpdateQuery(int n, T def) : N(calcN_(n)) {
mVal.assign(2*N+1, make_pair(-1, def));
}
void update(int l, int r, T value, int ts){
... | 0 | 24,649,195 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
usi... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 26,678,998 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S,ans="";
cin >> S;
bool f = false;
if (S == "zyxwvutsrqponmlkjihgfedcba") ans = "-1";
else{
if (S.length()<26){
for(int i='a';i<'z'+1;i++){
for(auto &v:S){
if(i==v){
break;
}
if (v==S[S.length()-... | 0 | 5,449,897 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
int MAX;
for (int i=1; i<=N; i*=2){
if(i*2>N){
MAX=i;
break;
}
}
cout<<MAX<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
string pluszero(int N){
string T=to_string(N);
if(T.size()>=6){
return T;
}
else{
int k=T.size();
rep(i,6-k){
T="0"+T;
... | 0 | 18,561,761 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
cout<<(n*(n+1))/2;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
#define INF (1e9)
int main() {
int H,N;cin>>H>>N;
vi A(N),B(N);
for (int i = 0; i < N; i++){
cin>>A[i]>>B[i];
}
vi dp(H+1,INF);
dp[H]=0;
for (int h = H; h >=0 ; h--){
... | 0 | 90,784,948 |
#include<stdio.h>
#include<string.h>
int main(){
int i, j;
int n;
int a, b;
char str[1000];
char op[10];
char p[1000];
scanf("%s", str);
scanf("%d", &n);
for(i=0; i<n; i++){
scanf("%s %d %d", op, &a, &b);
if(strcmp(op, "print")==0){
for(j=a; j<=b; j++){
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
int arr[n];
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
ll sum = 0;
for(int i = 0; i < n; i++) {
for(int j = i + 1; j < n; j++) {
sum += arr[i] * arr[j];
}
}
cout << sum << "\n";
}
int main() {
ios_ba... | 0 | 81,246,067 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N;
string S;
signed main()
{
cin >> N;
cin >> S;
int ans = 0;
rep(i,1000)
{
int mem = 1;
rep(j,N)
{
if('0' + ((i / mem) % 10) == S[j])
{
... | #include <iostream>
using namespace std;
int main(){
long long x,n,v,sum=0;
cin >> x >> n;
while(n-->0)
{
cin >> v;
sum= sum+v;
}
if(x-sum>=0)
{
cout << x-sum << endl;
}
else
{
cout << "-1" << endl;
}
return 0;
} | 0 | 95,675,475 |
#include <bits/stdc++.h>
using namespace std;
const string YES = "Yes";
const string NO = "No";
void solve(long long A, long long B, long long C)
{
cout << ((A + B >= C) ? YES : NO) << endl;
}
int main()
{
long long A;
scanf("%lld", &A);
long long B;
scanf("%lld", &B);
long long C;
scanf("%l... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | 0 | 79,983,220 |
#include <bits/stdc++.h>
#define N 100000
using namespace std;
int child[N][20];
int parent[N];
int depth[N];
int k[N];
int root;
char str[3][20] = {"root","internal node","leaf"};
void pr(int id){
int type;
if(parent[id] == -1) type = 0;
else if(k[id] > 0) type = 1;
else if(k[id] == 0) type = 2;
printf("node... | #include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int dfs(int v,int N,vector<bool>seen,const Graph G){
bool all_visited=true;
rep(i,N){
if(seen[i]==false){
all_visited=false;
}
}
if(all_visited){
... | 0 | 96,619,458 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
ll n, m... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | 0 | 56,581,749 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n,m; cin >> n >> m;
vector<string> a(n); rep(i,n) cin >> a[i];
vector<string> b(m); rep(i,m) cin >> b[i];
bool... | #include <bits/stdc++.h>
using namespace std;
static const int INF = 1<<30;
static const int SIZE = 100000+10;
int main(){
int n;
cin>>n;
vector<int> dp(SIZE,INF);
dp[0] = 0;
for(int i=1; i<=n; i++){
for(int six=1; six<=i; six *= 6){
if(i-six < 0) continue;
dp[i] = mi... | 0 | 47,212,622 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
const int N=100010;
int main()
{
struct Point {LL x, y;};
LL N;
cin >> N;
vector<Point> P(N);
for(auto& p: P) cin >> p.x >> p.y;
auto parity = abs(P[0].x+P[0].y)&1;
for(const auto& p: P) if((abs(p.x+p.y)&1) != parity) {
cout << -1 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | 0 | 20,848,878 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main(){
string s; cin >> s;
map<char,int> mp;
for(int i = 0; i < 4; i++){
mp[s[i]]++;
}
for(auto& x:mp){
if(x.second != 2){
puts("No");
return 0;
}
}
puts("Yes");
... | #include <iostream>
using namespace std;
int main(){
int n, x;
for(int i=0;;i++){
cin >> n >> x;
int c=0;
if(n==0&&x==0){
break;
}else{
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
for(int l=1;l<=n;l++){
if(j+k+l==x){
c++;
if(j==k||k==l||l==j){
c--;
}
}... | 0 | 61,555,745 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <cstdio>
#include<iostream>
#include <algorithm>
#include <cstring>
using namespace std;
char s[200005];
int main()
{
scanf("%s",s);
int len=strlen(s);
int num=0;
for(int i=0;i<len;i++)
{
num+=s[i]-'0';
}
if(num%9==0)
puts("Yes");
else
{
puts("No");
... | 0 | 24,815,247 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<string> w(n);
rep(i, n) cin >> w[i];
bool ok = true;
rep(i, n) rep(j, n) {
if (i == j) continue;
if (w[i] == w[j]) ok = fal... | #include <iostream>
#include <algorithm>
using namespace std;
void solve() {
int n, w, h, xi, yi, ai;
cin >> w >> h >> n;
int ans;
int xl_max, xr_min, yu_min, yl_max;
xl_max = yl_max = 0;
xr_min = yu_min = max(w,h);
for (int i = 0; i < n ; ++i) {
cin >> xi >> yi >> ai;
switch... | 0 | 13,293,415 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
int start,end,ans;
start = max(a,c);
end = min(b,d);
ans = end - start;
if(ans > 0)
cout << ans;
else
cout << 0;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int count = 0, count_max = 0;
int tmp;
int i;
int N, N_out = 1;
cin >> N;
for (i = 1; i <= N; i++)
{
tmp = i;
while (tmp%2 == 0 && tmp != 0)
{
count++;
tmp /= 2;
}
if (count >= count_max)
{
count_max = count;
N_out = i;
}
count = 0... | 0 | 61,887,990 |
#include<bits/stdc++.h>
using namespace std;
int p[100003];
int main(){
int n,m,i,j,c,t,s=0;
scanf("%d%d%d",&n,&m,&t);
for(i=1;i<=n;++i){
scanf("%d %d",&p[i],&c);
if(c==1)p[i]+=t;else p[i]-=t;
s+=p[i]/m,(s-=((p[i]%=m)<0))%=n,(p[i]+=m)%=m;
}
sort(p+1,p+n+1),(s+=n)%=n;
for(i=s+1;i<=n;++i)printf("%d ",p[i]);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 26,025,180 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0) cout << "Possible" << endl;
else cout << "Impossible" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#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<<" ";new... | 0 | 68,159,022 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> a(n, 0);
for(ll i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end(), greater<ll>());
vector<ll> leng(n, 0);
ll tmp = 0;
for(int j = 0; j < 2; j++){
for(ll i = tmp; i < n ... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | 0 | 87,294,752 |
#include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
int l = 0, r = n;
string left, right;
cout << 0 << endl;
fflush(stdout);
cin >> left;
right = left;
while(true){
string center;
int c = (l + r) / 2;
cout << c << endl;
... | 0 | 85,234 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | #include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<climits>
#include<map>
#include<string>
#include<functional>
#include<iomanip>
#include<deque>
#include<random>
using namespace std;
typedef long long ll;
typedef double lldo;
#define mp make_pair
#define pub push_back
#de... | 0 | 44,434,496 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32_t max_rest = INT32_MIN;
int32_t time = 0;
for (int32_t i = 0; i < 5; ++i) {
int32_t a;
cin >> a;
int32_t rest = 10 - a % 10;
if (re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const ll LINF = 1e15;
const int MOD = 1e9 + 7;
int main(){
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N... | 0 | 78,283,896 |
#include <bits/stdc++.h>
#define SIZE 10
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int S,W;
int i,j;
int tmp;
int answer=0;
int counter=0;
vector<int> given;
cin >> S >> W;
if(S>W)
cout << "safe" << endl;
else
cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 105;
const int mod = 1e9+7;
int n;
int m;
int dist[N][N];
vector < pair < pair < int , int > , int > > ed;
int main() {
memset(dist , '?' , sizeof dist);
scanf("%d%d" , &n , &m);
for(int i = 1; i <= n; i++)
dist[i][i] ... | 0 | 28,100,524 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz";
const string ALP="ABCDEFGHIJK... | 0 | 48,221,411 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X,Y,Z,K; cin >> X >> Y >> Z >> K;
vector<long long> A(X),B(Y),C(Z);
for(int i=0; i<X; i++) cin >> A[i];
for(int i=0; i<Y; i++) cin >> B[i];
for(int i=0; i<Z; i++) cin >> C[i];
vector<long long> D(X*Y);
for(int i=0; i<X; i++){
for(int j=0; j... | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define CL(x) ((x) * (x))
#define CR(x) (((x) * (x)) + 1)
typedef long long cc;
typedef pair <int, int> pii;
string s;
int res;
int dp[70000007];
int n;
int main() {
ios_base :: sync_with_stdio(f... | 0 | 83,274,696 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5, mod = 1e9 + 7;
int n, m;
vector<int> v[N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(int i = 0; i < n; i++){
int t, c;
cin >> t >> c;
v[t].push_back(c);... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000007;
const ll inf = 1e18;
#define REP(i, n) for (ll i = 0; i < (n); ... | 0 | 51,158,170 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <map>
const int MOD = 1e9+7;
typedef long long ll;
using namespace std;
ll llmax(ll x, ll y){
if (x > y) return x;
return y;
}
int main(){
int x, y;
cin >> x >... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define vec vector
int main(void)
{
while(1) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0) break;
vec<int> x(11, 0);
rep(i, n) {
int p, q;
cin >... | 0 | 78,726,780 |
#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;
int main(){
int n,i,j,k,l,m;
cin >> n;
int A[4][3][10];
for(i=0;i<4;i++){
for(j=0;j<3;j++){
for(k=0;k<10;k++){
A[i][j][k]=0;
}
}
}
for(i=0;i<n;i++){
cin >> j>>k>>l>>m;
A[j-1][k-1... | 0 | 31,316,496 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[101][101];
memset(a,0,sizeof(a));
cin>>n;
int u,k;
for(int i = 0;i < n;i++){
cin>>u>>k;
u--;
for(int j=0;j<k;j++){
int x;
cin>>x;
x--;
a[u][x]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(j)cout<<" ";
cout... | #include <iostream>
#include <cstring>
#include <vector>
using namespace std;
typedef pair<int , int> ii;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int N;
string S;
ll fac[maxn];
int main(){
cin >> N;
cin >> S;
fac[0] = 1;
for(int i = 1; i < maxn; ++i)fac[i] = fac[i - 1] * i % mod... | 0 | 43,488,533 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<int> a(n);
int ma = 0;
for (int i = 0; i < n; i+... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <stack>
#include <climits>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
const l... | 0 | 85,712,232 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main()
{
int n;
cin >> n;
vector<ll> A(n),B(n),Z(n);
rep(i,n)cin >> A[i];
rep(i,n)cin >> B[i];
rep(i,n)Z[i]=A[... | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string s, p;
std::cin >> s >> p;
int s_len, p_len;
bool flag = false;
s_len = s.length();
p_len = p.length();
for (int i=0; i<s_len; ++i){
if(flag){
break;
}
for (in... | 0 | 64,128,551 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n = 0;
cin >> n;
ll res = 0;
for(int i = 1;i <= n;i++){
string s = to_s... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | 0 | 68,870,920 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | #include <complex>
#include <iostream>
using xy_t = std::complex<double>;
double cross_product(xy_t a, xy_t b);
bool isInsideTriangle(xy_t a, xy_t b, xy_t c, xy_t p);
int main()
{
double x[4], y[4];
while (true)
{
for (size_t i {}; i < 4; ++i)
std::cin >> x[i] >> y[i];
if (!std::cin)
break;
... | 0 | 6,450,498 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int* a = new int[n];
int* b = new int[n];
for (int i = 0;i < n;i++) {
cin >> a[i];
b[i] = a[i];
}
sort(b, b + n);
for (int i = 0;i < n;i++) {
if (a[i] == b[n - 1]) {
cout << b[n - 2] << endl;
}
else {
cout ... | #include<bits/stdc++.h>
using namespace std;
const int M = 1e9+7;
const int N = 1005;
int dp[N][N];
int main(){
int h , w;
cin >> h >> w;
vector<string> s(h);
memset(dp , 0 , sizeof(dp));
for(int i = 0 ; i < h ; i++){
cin >> s[i];
}
dp[0][0] = 1;
for(int i = 0 ; i < h ; i++){
for(int j = 0 ; j < w ; j++){
... | 0 | 77,196,013 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdio>
using namespace std;
int A[251];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> A[i];
}
for (int i = 1; i <= n; ++i) {
cout << "node " << i << ": "
<< "key = " <... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define orz 1000000007
using namespace std;
int n,l,t,x[100005],w[100005];
ll ans;
int main(){
scanf("%d%d%d",&n,&l,&t);
for(int i=1;i<=n;++i)scanf("%d%d",x+i,w+i);
for(int i=1;i<=n;++i){
if(w[i]==1){
ans+=... | 0 | 46,299,709 |
#include <string>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main()
{
vector<bool> table(1000000000);
int n;
cin >> n;
rep(i,n){
long long a;
cin >> a;
if(ta... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll nature(ll a){
return max(a,-1*a);
}
int main(){
ll N;
cin>>N;
vector<ll> A(N);
ll sumprice;
for(ll i=0;i<N;i++){
cin>>A.at(i);
if(i==0){sumprice=max(A.at(0)... | 0 | 89,428,823 |
#include<bits/stdc++.h>
using namespace std;
#define long long long
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
}
vector<int> C;
long S=0, S1=0;
int ans=0;
for(int i=0; i<N; i++){
if(A[i]... | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int Mc = N/4+1;
int Md = N/7+1;
for(int i=0;i<Mc;i++){
for(int j=0;j<Md;j++){
if(i*4+j*7 == N){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | 0 | 16,840,966 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
ll N, A, B;
cin >> N >> A >> B;
ll ans = B*(N-1) + A - B - A*(N-1) + 1;
ans = max(ans, (ll)0);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | 0 | 68,303,652 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int n, d, x, ans = 0;
cin >> n >> d >> x;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
... | 0 | 52,600,363 |
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
#if !ONLINE_JUDGE
freopen("in1.txt", "r", stdin);
freopen("out1.txt", "w" , stdout);
#endif
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
}
else if (a == 1)
{
cout << "Alice" << endl;
}
else if (b == 1)
... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 91,854,050 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int Grundy(int v, int from, const vector<vector<int>>& g) {
int result = 0;
for (int x : g[v]) if (x != from) ... | #include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <c... | 0 | 69,142,464 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1e9+7;
#define INF 1e9+9;
#define ps(x,y) fixed<<setprecision(y)<<x
# define PI 3.14159265358979323846264338327950 L
typedef long long ll;
typedef unsigned long long ull;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ON... | #include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#defi... | 0 | 92,117,190 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i <= (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i >= 0; i--)
#define be(v) (v).begin(), (v).end()
#define ... | #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<vector<int>>s(m);
rep(i,m){
int k;cin>>k;
s[i].resize(k);
rep(j,k){
cin>>s[i][j];
--s[i][j];
... | 0 | 23,385,118 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 305
#define inf 1e18
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=ge... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define pi pair<int,int>
map<pll,int> black;
int dx[3] = {0,-1,-2}, dy[3] = {0,-1,-2};
map<pi,int> found;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll h, w;
cin >> h >> w;
int n;
cin >> n;
ll R[n], C[n];
for(int ... | 0 | 3,723,745 |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define repi(i,x,n) for(ll i=x;i<(ll)(n);i++)
typedef pair<int,int>... | 0 | 16,199,498 |
#include <iostream>
#include <string>
#include <list>
#include <algorithm>
using namespace std;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string s;
int n,i,a;
list<int> li;
list<int>::iterator p=li.begin();
cin >> n;
for(i=0;i<n;i++){
cin >> s;
if(s=="insert"){
cin >> a;
li.push_f... | #include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
typedef pair<int,int> P;
#define F first
#define S second
int N,M;
P p[10003];
int main(){
while(1){
scanf("%d %d",&N,&M);
if(!N && !M) break;
for(int i=0;i<N;i++)... | 0 | 80,918,468 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ... | 0 | 62,883,529 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0 ,-1};
signed main(){
int N;
cin >> N;
vector<vector<P>>ki(N);
for(int i = 0; i < N-1; i++) {
int a,b,c;
cin >> a ... | 0 | 40,661,644 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
getline(cin, str);
while (str[0] != '0') {
int n = 0;
for (unsigned int i = 0; i < str.size(); i++)
n += str[i] - '0';
cout << n << endl;
getline(cin, str);
}
return 0;
} | #include<bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
bool solve(vint a, int b){
set<int> s, ss;
s.insert(0);
... | 0 | 85,517,890 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void)
{
int A, B, C, D;
cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) << endl;
return (0);
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if(s=="A")
{
cout<<"T"<<endl;
}
if(s=="T")
{
cout<<"A"<<endl;
}
if(s=="C")
{
cout<<"G"<<endl;
}
if(s=="G")
{
cout<<"C"<<endl;
}
return 0;
} | 0 | 47,260,772 |
#include<cmath>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
stack<int> st;
queue<int> qu;
priority_queue<int> pq;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rep2(i,n) for(int i=1; i<=(int)(n); i++)
#define mins(x,y) x=min(x,y)
#define maxs(x,y) x=max(x,y)
#define ALL(a) a.begin(), a.... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
char a,b;
cin >> a >> b;
... | 0 | 4,455,644 |
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#define all(c) (c).begin(),(c).end()
using namespace std;
int main(void){
int n;
while(cin >> n,n){
vector<int>a(n);
for(int i=0;i<n;i++)cin >> a[i];
sort(all(a));
int ans = 1<<29;
for(int i=0;i+1<n;i++)
ans = min(ans,... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
typedef long long LL;
using namespace std;
int main(){
LL n;
LL k;
cin >> n >> k;
vector<LL> v(n);
for(LL i=0; i<n; i++){
cin >> v[i];
}
LL lim=min(n,k);
LL ans=0;
LL sum;
for(LL i=0; i<=lim; i++){
... | 0 | 4,036,449 |
#include<iostream>
#include<algorithm>
using namespace std;
int b[2000000];
void countingSort(int a[], int n, int maxa);
int main() {
int i, j, n, maxa, a[2000000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (i == 0)maxa = a[0];
else maxa = max(maxa, a[i]);
}
countingSort(a, n, maxa);
for (i = 0; i... | #include<iostream>
#include<vector>
int main(void)
{
std::vector<int> incar;
int n;
while(std::cin >> n)
{
size_t isize=incar.size();
if(n==0)
{
std::cout << incar[isize-1] << '\n';
incar.pop_back();
}
else
{
incar.push_back(n);
}
}
} | 0 | 20,594,466 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
ll gcd(ll a, ll b){
if(a < b) return gcd(b, a);
ll r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return b;
}
int main... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define P pair<long long,long long>
#define all(a) a.begin(),a.end()
#define INF 10000000000000000
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } r... | 0 | 87,172,609 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 43,148,134 |
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#inc... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x=0,y=0,z=0,l=0,m=0;
int p[] = { 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47 };
int n;
cin >> n;
int a[16];
fill(a,a+16,0);
for (int i = 2; i <= n; i++) {
int j = 0, temp = i;
while (temp > 1 && j < 15) {
if (temp%p[j]) j++;
e... | 0 | 5,293,068 |
#include<iostream>
#include<cmath>
int main(){
int n;
double x1,y1,x2,y2,x3,y3,x4,y4;
const double e = 1e-10;
std::cin >> n;
for(int i=0;i<n;i++){
std::cin >> x1 >> y1
>> x2 >> y2
>> x3 >> y3
>> x4 >> y4;
if(std::fabs((x1*y3+x2*y4+y2*x3+y1*x4)-(x2*y3+x1*y4+y1*x3+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begi... | 0 | 91,197,494 |
#include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
int b[n];
for(int i=0;i<n;i++){
cin>>a[i];
b[a[i]-1]=i+1;
}
for(int i=0;i<n;i++){
cout<<b[i]<<" ";
}
return 0;;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string w;
int a;
int b;
while(1){
cin >> w;
if(w=="-") break;
cin >> a;
for (int i=0; i<a; i++) {
cin >>b;
w += w.substr(0,b);
w.erase(0,b);
}
cout << w << endl;
}
} | 0 | 5,524,524 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
LL a,b,k;
cin >> a >> b >> k;
if(a+b <= k){
cout << '0' << ' ' << '0' << endl;
return 0;
}
if(a >= k){
cout << a-k << ' ' << b << endl;
return 0;
}
cout << '0' << ' ' << b-(k-a) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | 0 | 94,640,004 |
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int x, p;
};
bool cmp(Node a, Node b)
{
return a.x < b.x;
}
int main()
{
Node a[100005], b[100005];
int n;
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> a[i].x;
a[i].p = i;
}
sort(a+1,a+n+1,cmp);
int ans ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | 0 | 82,976,344 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
vector<int> x = {1,-1,0,0};
vector<int> y = {0,0,-1,1};
int main(){
string s;
cin >> s;
stri... | 0 | 46,033,904 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 46,593,240 |
#include <iostream>
#include <cstdio>
#include <bitset>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s,a,b)... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<queue>
#define pr(x) cout<<#x<<" "<<x;
#define pl(x) cout<<#x<<" "<<x<<endl;
#include<math.h>
#include<algorithm>
using namespace std;
char maze[1005][1005];
int dx[] = {-1,1,0,0};
int dy[] = {0,0,-1,1};
int d[1005][1005];
const int INF... | 0 | 11,853,821 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 27,014,221 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 3000005;
const int maxm = maxn*2;
const ll inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
int n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define endl '\n'
const ll MOD = 1000000007;
int... | 0 | 18,088,941 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.