source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
const int N=1000010;
#define int long long
int dp[N];
int fact[N];
int inv[N];
int inv2[N];
const int mod=998244353 ;
int qmi(int a,int b)
{
int res=1;
while(b){
if(b&1) res=res*a%mod;
b>>=1;
a=a*a%mod;
}
return res;
}
int C(int a,int b)
{
re... | C++ | 0b3f93005a639a9a51279fae65c15301 | af7bc4137a94579f047732cd905641e8 | 2,400 | PASSED |
#pragma GCC target("abm,movbe,bmi,bmi2,lzcnt,popcnt,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("omit-frame-pointer")
#define NDEBUG 1
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <ca... | C++ | 0b3f93005a639a9a51279fae65c15301 | c20093850388c667430974aefc8c45fb | 2,400 | PASSED |
#pragma GCC target("abm,movbe,bmi,bmi2,lzcnt,popcnt,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("omit-frame-pointer")
#define NDEBUG 1
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <ca... | C++ | 0b3f93005a639a9a51279fae65c15301 | 14c40f4b1726fadc8d214fc2fd8072ad | 2,400 | PASSED |
#pragma GCC target("abm,movbe,bmi,bmi2,lzcnt,popcnt,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("omit-frame-pointer")
#define NDEBUG 1
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <ca... | C++ | 0b3f93005a639a9a51279fae65c15301 | 19ef1b83c2fc49f96fc02566d2e4cab4 | 2,400 | PASSED |
#pragma GCC target("abm,movbe,bmi,bmi2,lzcnt,popcnt,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("omit-frame-pointer")
#define NDEBUG 1
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <ca... | C++ | 0b3f93005a639a9a51279fae65c15301 | a04a7c8a15c2a15cf73909ff117e165a | 2,400 | PASSED |
#pragma GCC target("abm,movbe,bmi,bmi2,lzcnt,popcnt,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("omit-frame-pointer")
#define NDEBUG 1
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <ca... | C++ | 0b3f93005a639a9a51279fae65c15301 | 69ea537ed2b1e3c97085e6c2009ac7f7 | 2,400 | PASSED |
#pragma GCC target("abm,movbe,bmi,bmi2,lzcnt,popcnt,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("omit-frame-pointer")
#define NDEBUG 1
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <ca... | C++ | 0b3f93005a639a9a51279fae65c15301 | b94250a58713caa653ed38f3f7953c65 | 2,400 | PASSED |
#pragma GCC target("abm,movbe,bmi,bmi2,lzcnt,popcnt,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("omit-frame-pointer")
#define NDEBUG 1
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <ca... | C++ | 0b3f93005a639a9a51279fae65c15301 | c6a55852eda9c0aedcb6bce0eb947340 | 2,400 | PASSED |
#pragma GCC target("abm,movbe,bmi,bmi2,lzcnt,popcnt,avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("omit-frame-pointer")
#define NDEBUG 1
#include <immintrin.h>
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <ca... | C++ | 0b3f93005a639a9a51279fae65c15301 | e51df0634ff49ba1425e8d4f6661a544 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, t, g[N], c[N], o[N], st[N], ed[N];
long long dp[N], s[N];
const int M = N * 5;
int val[M << 2];
void init() {
fill(val, val + (M << 2), n + 1);
}
void cover(int p, int l, int r, int ll, int rr, int x) {
if (l >= ll && ... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | 532334d86b4dd31b6011135631c54920 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, t, g[N], c[N], o[N], st[N], ed[N];
long long dp[N], s[N];
const int M = N * 5;
int val[M << 2];
void init() {
fill(val, val + (M << 2), n + 1);
}
void cover(int p, int l, int r, int ll, int rr, int x) {
if (l >= ll && ... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | c4ce2e217def9b8ab17cb9ff9ea2d548 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define blank " "
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef pair<ll, ll> pll;
const int MAXN = 200200;
const int MOD = 998244353;
//ll cc[MAXN];
ll g[MAXN], c[M... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | 03bfa86804a9d3a1bfd68f87ff79d724 | 2,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
struct List {
int n;
map<int, pair<LL, LL>> lst;
List(int n) {
this->n = n;
lst[0] = make_pair(0ll, 0ll);
}
void cover(int cl, int cr, LL k, LL b) {
auto p = lst.lower_bound(cl);
pair<LL,... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | 3733cc1726de0290beb51a72b240a307 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long t;
cin >> n >> t;
vector<long long> g(n), c(n);
for (int i = 0; i < n; i++) {
... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | 50afed87872148b5c11e310656b63c75 | 2,900 | PASSED |
#include <bits/stdc++.h>
class dynamic_seg_tree {
public:
static int n;
static int cnt;
struct node {
int ls, rs, v;
node() : ls(), rs(), v() {}
node(int t_v) : ls(), rs(), v(t_v) {}
};
static node nd[20000000];
protected:
int rt;
void up(int u) {
nd[u].v = nd... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | 8a4d5847b4ccc7a0fa8ea2b1a4cb1940 | 2,900 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | 55916f19a0e6fff5a0b66d12e0abd0ea | 2,900 | PASSED |
//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef __APPLE__
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
#... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | 6da2c94c754962391a7093ea4afac58c | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | f335c672264365bff74d1533c926d1c7 | 2,900 | PASSED |
// =========== Template ========== //
#include <bits/stdc++.h>
// #include<bits/extc++.h>
using namespace std;
int fastio() { ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin.tie(nullptr); return 0; }
int __fastio = fastio();
template<typename A, typename B> ostream& operator<<(ostream &os, cons... | C++ | dafbdc2a71452ccc70d1719eb2abea19 | 2b7f3870b434514724527ebfe40776fa | 2,900 | PASSED |
import math
pi = 3.14159265358979323846264338327950288419716939937510
eps, sq2 = 1e-13, math.sqrt(2)
x, y = [], []
n = 0
def binary_find(la, lb, ra, rb, cy, fy, alpha_1, alpha_2, ab):
while math.fabs(cy - fy) > eps:
mid_y = cy / 2.0 + fy / 2.0
la = lb = 0.0
ra, rb = pi - alpha... | Python | 36cf5a28f09a39afc1e6d1e788af71ee | a9ea9cd076fbaa4b70dde693a3728409 | 3,500 | PASSED |
import math
pi = 3.14159265358979323846264338327950288419716939937510
eps, sq2 = 1e-13, math.sqrt(2)
x, y = [], []
n = 0
def binary_find(la, lb, ra, rb, cy, fy, alpha_1, alpha_2, ab):
while math.fabs(cy - fy) > eps:
mid_y = cy / 2.0 + fy / 2.0
la = lb = 0.0
ra, rb = pi - alpha... | Python | 36cf5a28f09a39afc1e6d1e788af71ee | b9e8d4d8f5866a9b84d48015bc42bfa0 | 3,500 | PASSED |
import math
pi = 3.14159265358979323846264338327950288419716939937510
eps, sq2 = 1e-13, math.sqrt(2)
x, y = [], []
n = 0
def binary_find(la, lb, ra, rb, cy, fy, alpha_1, alpha_2, ab):
while math.fabs(cy - fy) > eps:
mid_y = cy / 2.0 + fy / 2.0
la = lb = 0.0
ra, rb = pi - al... | Python | 36cf5a28f09a39afc1e6d1e788af71ee | 65e6dd0b2cdb3ac8f26ef25b2e6789ca | 3,500 | PASSED |
// LUOGU_RID: 95134063
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
using ll = long long;
using db = long double;
const int N = 5050;
const db eps = 1e-13, pi = acos((db)-1);
class vec{
public:
ll x, y;
vec(ll xx = 0, ll yy = 0)... | C++ | 36cf5a28f09a39afc1e6d1e788af71ee | db6e5c4d5b63e6c9cf70d8c37d3e37af | 3,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
using ll =long long int;
using db=long double;
const int N=5050;
const db eps=1e-14,pi=acos((db)-1);
class vec{
public://简单起见
ll x, y;//也许是这里丢失精度了
vec(ll xx=0.0, ll yy=0.0):x(x... | C++ | 36cf5a28f09a39afc1e6d1e788af71ee | 11d68715ec2a8e756ad8f041f0fa1d62 | 3,500 | PASSED |
/*
The rights belong to the respective author,and this codes can be found at
codeforces.com/blog/entry/106675 .Here, I just use for testing.
*/
#include<bits/stdc++.h>
using namespace std;
using lol=long long int;
using ldd=long double;
#define endl "\n"
const ldd PI=acos(-1.0);
const int ITERATIONS = 60;
c... | C++ | 36cf5a28f09a39afc1e6d1e788af71ee | 3b7a982d91d65b2b68fe3e221a759f70 | 3,500 | PASSED |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cs... | C++ | 36cf5a28f09a39afc1e6d1e788af71ee | 10361f573e64fb2fceb08a35d8956473 | 3,500 | PASSED |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cs... | C++ | 36cf5a28f09a39afc1e6d1e788af71ee | 64093bd47b78927a012cf8a6ef88d8b9 | 3,500 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <v... | C++ | 36cf5a28f09a39afc1e6d1e788af71ee | 5c09c8b7cee0088e44ee73972a5f7a27 | 3,500 | PASSED |
#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pt;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
const ld pi = acos(-1);
const ld eps = 1... | C++ | 36cf5a28f09a39afc1e6d1e788af71ee | b63da2438851b521926f007503d6c99b | 3,500 | PASSED |
#include <bits/stdc++.h>
#define rep(i,s,t) for(int i=s,__=t;i<=__;i++)
#define pre(i,s,t) for(int i=s,__=t;i>=__;i--)
#define ll long long
#define re register
const int N=2e5+10,M=998244353;
using namespace std;
inline int read() {
int s = 0, w = 1;
char ch = getchar();
while(ch < '0' || ch > '9'... | C++ | 6d231ace7f404c0089e1d33d948afc11 | 05a4ce0ca4dd2c3edcdb8081d43167fb | 3,300 | PASSED |
#include <bits/stdc++.h>
#define rep(i,s,t) for(int i=s,__=t;i<=__;i++)
#define pre(i,s,t) for(int i=s,__=t;i>=__;i--)
#define ll long long
#define re register
const int N=2e5+10,M=998244353;
using namespace std;
inline int read() {
int s = 0, w = 1;
char ch = getchar();
while(ch < '0' || ch > '9'... | C++ | 6d231ace7f404c0089e1d33d948afc11 | cd4e5ed45dd7fdfc2d99143282779d6c | 3,300 | PASSED |
//2022.9.6 by ljz
//email 573902690@qq.com
//if you find any bug in my code
//please tell me
#include <bits/stdc++.h>
#include <random>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
//using namespace __gnu_cxx;
//template<class T> u... | C++ | 6d231ace7f404c0089e1d33d948afc11 | e16c225872a1793ef564811ac8c6dc09 | 3,300 | PASSED |
// LUOGU_RID: 90302591
//I play to win
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pi pair<int,int>
#define ld long double
#define vi vector<int>
#define all(x) begin(x),end(x)
using namespace std;
inline ll read()
{
ll x=0,f=1;char c=getchar();
for(;!isdigit(c);c=ge... | C++ | 6d231ace7f404c0089e1d33d948afc11 | b7aac1f2ba85bd14bad51ef5593a8d0c | 3,300 | PASSED |
//I play to win
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pi pair<int,int>
#define ld long double
#define vi vector<int>
#define all(x) begin(x),end(x)
using namespace std;
inline ll read()
{
ll x=0,f=1;char c=getchar();
for(;!isdigit(c);c=getchar())if(c=='-')f=-1;... | C++ | 6d231ace7f404c0089e1d33d948afc11 | 93948ba74ce0aa228cb33cbf42cfbfa1 | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
template <long long mod>
struct modular {
long long value;
modular(long long x = 0) {
value = x % mod;
if (value < 0) value += mod;
}
modular& operator+=... | C++ | 6d231ace7f404c0089e1d33d948afc11 | 87d758d8dcb84747d6ebe3203f6d4eee | 3,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int P = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 200005;
int n, a[N], b[N], cnt[2][N << 1];
int fac[N];
namespace t0 {
pair<int, int> val[N << 3];
int lazy[N << 3];
inline void push_up(int p) {
val[p] = min(val[p << 1... | C++ | 6d231ace7f404c0089e1d33d948afc11 | 695f527430641700084e1ba272016bd8 | 3,300 | PASSED |
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
using... | C++ | 6d231ace7f404c0089e1d33d948afc11 | a1d44f6b6467085c2d12b1e0c211796c | 3,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+5, P = 998244353 ;
struct node
{
int a;
bool b;
bool operator<(const node &_)const
{
return a<_.a;
}
}A[N];
int n,B[N],C[N],C_ori[N],cntC,cntB[N];
/// a+rank[a](0) a+n-rank(a)(1)
bool is_0,Is_same=1;
int mn,T,fac[N];
void checkmin(in... | C++ | 6d231ace7f404c0089e1d33d948afc11 | 2aa37df41063460896892df2ffe27820 | 3,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define rep(i,n) for(ll i=0;i<n;i++)
ll p=998244353;
ll inv(ll a, ll b){
if(a==1){
return 1;
}
ll x=inv(b%a,a);
ll k=b/a;
ll y=((b%a)*x-1)/a;
return (k*b-k*x-y)%b;
}
int main... | C++ | 6d231ace7f404c0089e1d33d948afc11 | 561db34ac96ef5992b6a9d7f86cae94e | 3,300 | PASSED |
#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <vector>
#include <deque>
#include <queue>
#include <map>
#define ll long long
#define loop(n) for (int i = 0; i < n; i++)
#define nloop(n) for (int j = 0; j < n; j++)
#define srt(v) sor... | C++ | 710c7211d23cf8c01fae0b476a889276 | 3c9b2a6c09aed44dea1192da588c18a7 | 1,000 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <algorithm>
#include <cmath>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iterator>
#define ll long long int
#define fr(n) for(int i = 0; i<n;i++)
#define pb push_back
#define mx(a) *max_element(a.begi... | C++ | 710c7211d23cf8c01fae0b476a889276 | 65a630ab0619cbfa727ea758e615369d | 1,000 | PASSED |
// Jinqian kan qi xiang shang xiezhe
// Qinxianglian na sanshi er sui na zhuang gao dang chao fuma lang
// ta qi junwang a man huangshang na huihun nan er zhao dongchuang
#include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace... | C++ | 710c7211d23cf8c01fae0b476a889276 | c6fe896f3ed15f9ec6464374fa836973 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define mst(a) memset(a,0,sizeof(a))
#define PII pair<int,int>
#define over(i,s,t) for(int i=s;i<=t;i++)
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define PI 3.1415926535
const int INF = 0x3f3f3f3f;
const int m... | C++ | 710c7211d23cf8c01fae0b476a889276 | 5fc514947a4ed0fd5d841439f39a6059 | 1,000 | PASSED |
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<algorithm>
#include<cmath>
#include<math.h>
#include <iomanip>
#include<numeric>
#define ll long long
#define hilight(x) std::cout << "==========(" << (x) << ")==========\... | C++ | 710c7211d23cf8c01fae0b476a889276 | 7652590aacfc239499bc7e8db0a16bf4 | 1,000 | PASSED |
#include "bits/stdc++.h"
#define F first
#define S second
#define PB push_back
#define FOR(i,a,b) for (int i = a; i < b; i++)
using namespace std;
using ll= long long;
using ld= long double;
using vi=vector<int>;
using mp=map<int,int>;
using st=set<int >;
using pa=pair<int,int>;
int gcd1(int a,int b)
{
if(b==0)
... | C++ | 710c7211d23cf8c01fae0b476a889276 | decedecef59cc5181993c79400a26d53 | 1,000 | PASSED |
/*
*
* <اللهم صل وسلم وبارك علي سيدنا محمد>
* ( كن راضيا بما اعطاك الله من النعم )
* " وان تعدوا نعمة الله لا تحصوها "
*
* =====================================... | C++ | 710c7211d23cf8c01fae0b476a889276 | 55a9d24889b7c2a4ed3cdc75863335bf | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
auto mul = [](string s,int k) ->string {
string res = "";
while(k--) res += s;
return res;
};
int tc;
cin>>tc;
while(tc--) {
string s,t;
cin>>s>>t;
int n = s.length(),m = t.length();
... | C++ | 710c7211d23cf8c01fae0b476a889276 | c6ba98ecf758e7cc50ca325230c24a41 | 1,000 | PASSED |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
using namespace std;
int main()
{
cin.sync_with_stdio(0), cin.tie(0);
int q;
bool ch;
string s, t, ans;
cin >> q;
while (q--)
{
string s1;
ch = fa... | C++ | 710c7211d23cf8c01fae0b476a889276 | ecadb36324ea6a49163df9908b321947 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int gcd(int p,int q)
{
if(q==0)
{
return p;
}
return gcd(q,p%q);
}
int main(){
int t,n,a,b,i,j,c,x=0,g,l,z=0;
cin>>t;
while(t--)
{
string str1,str2,str3;
cin>>str1>>str2;
a=str1.size();b=str2.size();
if(str1==str2)
{
cout... | C++ | 710c7211d23cf8c01fae0b476a889276 | f325c3f8ca65df95c6867d21c912fc49 | 1,000 | PASSED |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int h=0,n=0;
int i=0;
cin >> n ;
while (h<n){
int f=0,g=0;
float l=0;
cin >>f>>g;
int arr[f];
for (int i=0;i<f;i++){
cin >> arr[i];
if (arr[i]>g){l++;}
}
if(l==0){cout<<"YES"<<endl;}else{
sort(arr, arr+f);
if (arr[0]+arr[1... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | c4c9554dd35c9d6ca0d1a2d41839dc94 | 800 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n,d,c=0,x,answer=-1;
cin>>n>>d;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];}
sort(a,a+n);
for(int i=0;i<n;i++){
if(a[i]<=d)
c++;
else if(a[... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | cb07f71549408e15c05ba7da5983b320 | 800 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n,q,d;
ll arr [1000] ,arr2 [1000];
cin >>n;
for (ll i = 1; i <=n ; ++i) {
memset(arr2,0,sizeof (arr2));
cin>>q>>d;
for(ll j=1 ;j<=q;j++){
cin>>arr[j];
}
i... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | 7071ed502e67cb2c3ebfbdcdd6819d3b | 800 | PASSED |
#include <bits/stdc++.h>
#define ZALATA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define S second
#define F first
#define nl "\n"
#define printGrid(grid,r,c) for(int i=0 ;i<=r;i++){for(int j=0 ;j <= c;j++){ printf("%3d ", grid[i][j]);} printf("\n"); }
#define fillContainer(vec) for (auto &i : vec ... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | 81857c286eff4a932059886f3ae1bc33 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define Fast ios_base:: sync_with_stdio(false),cin.tie(NULL);
#define ll long long
#define sk " "
#define nl "\n"
#define foi(l, n, m) for(int i=l; i<n; i+=m)
#define foj(l, n, m) for(int j=l; j<n; j+=m)
#define F(m) freopen(m , "rt", stdin)
const int N = 1e8+1;
const int M... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | 6da72c737c9009fc975818f7e0b742c8 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void Alien35() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#ifndef ONLINE_JUDGE
freopen("test.in", "rt", stdin);
freopen("test.out", "wt", stdout);
#endif
}
const int N = 1e5 + 5, M = 1e4 + 5, OO = 0x3f3f3f3f, MOD = 1e9 + ... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | d9750ba04f7f7c993ca7bf44c47a4876 | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
using namespace std;
int main()
{
fastread();
ll t,n,d, a[105];
cin>>t;
while(t--){
c... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | e3a46c090fe45315a4505c10cbc3b91b | 800 | PASSED |
/*████████████████████████████████████████████████████████████████████████████████████
█░░░░░░░░░░░░░░█░░░░░░░░░░░░░░█░░░░░░██████████░░░░░░█░░░░░░░░░░█░░░░░░░░░░░░░░░░███
█░░▄▀▄▀▄▀▄▀▄▀░░█░░▄▀▄▀▄▀▄▀▄▀░░█░░▄▀░░░░░░░░░░░░░░▄▀░░█░░▄▀▄▀▄▀░░█░░▄▀▄▀▄▀▄▀▄▀▄▀░░███
█░░▄▀░░░░░░░░░░█░░▄▀░░░░░░▄▀░░█░░▄▀▄▀▄▀▄▀▄▀▄▀▄▀▄▀▄▀░░█░░░... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | 237e3cb9e1c63884f8e7b3096b3e6374 | 800 | PASSED |
#include<bits/stdc++.h>
#include<string>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
using namespace std;
const int N=1e5;
int arr[N];
//int v[N],g[N],temp[N];
ll lcm(int a,int b){
return (a*b)/__gcd(a,b);
}
set<int> divs(int n)
{
set<int>s;
... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | 9800c3cb03dfbcc91c7cb6fd8a650ab3 | 800 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
#define ashry ios_base::sync_with_stdio; cin.tie(NULL); cout.tie(NULL);
#define ll long long
using namespace std;
const int N=1e5+5;
ll a[N];
ll b[N];
void solve ()
{
int n,k,tmp;
bool big=false;
cin>>n>>k;
vector <int> v;
for (int i=0;i<n;i++)
{
... | C++ | 044c2a3bafe4f47036ee81f2e40f639a | a26dbe0ff2421acf2d974297a8b70b60 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll t;cin>>t;
while(t--)
{
ll n,d;cin>>n>>d;
if(n==d)
{
for(int i=0;i<n;i++)cout<<(i+1)<<' ';
cout<<"\n";
}
else
{
int a[d];
for(int i=0;i<d;i++)a[i]=(i+1);
reverse (a,a+d);
int x=n-d;
... | C++ | 67de9506ac2458ee67346bae1a9e3926 | 8e1327055fa897e85ad5c41b6f391e4a | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const double eps=1e-9;
int main()
{
int t, n, k;
cin>>t;
while(t--&&cin>>n>>k){
for(int i=1;i<=n-(2*(n-k)+1);i++)
cout<<i<<" ";
for(int i=k;i>=2*k-n;i--)
cout<<i<<" ";
cout<<"\n";
}
return 0;... | C++ | 67de9506ac2458ee67346bae1a9e3926 | da946c5b86a5882bbc012cf45c078f13 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{int t;
cin>>t;
while(t--)
{int n,d;
cin>>n>>d;
vector<int> v;
for(int i=0;i<d;i++)
v.push_back(i+1);
for(int i=1;i<=n-d;i++)
v.push_back(d-i);
vector<int> q;
for(int i=0;i<(d-(n-d+1));i++)
q.push_back(v[i]);
for(int i=0;i<=n-d;i++)
q.push_back(d... | C++ | 67de9506ac2458ee67346bae1a9e3926 | 147313e7f51432cbf4d5e87ac595b781 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int cf;cin>>cf;
while(cf--){
int n,k;cin>>n>>k;
int f=n-k+1;
for(int i=0;i<k-f;i++){
cout<<i+1<<' ';
}
for(int i=0;i<f;i++){
cout<<k-i<<' ';
}
cout<<'\n';
... | C++ | 67de9506ac2458ee67346bae1a9e3926 | 15d2d68bc585e891550159992219a889 | 1,500 | PASSED |
// 赤コーダーになりたい
// お願い いいですか？
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// Pragmas
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Namespaces
using n... | C++ | 67de9506ac2458ee67346bae1a9e3926 | e14cda1f6af9f94b8d9ab2f8b6fc4e7a | 1,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const double Pi = acos(-1);
const double eps = 1e-8;
const double INF = 1e12;
const int N = 501000, M = 1000010;
const int mod = 998244353;
int n, m, k, cnt, ans;
int a[500010];
void solve() {
cin >> n >> k;
if(n > k && k > 1) {
for(in... | C++ | 67de9506ac2458ee67346bae1a9e3926 | ff64e99b922f4e6b9323a8731b638a7a | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int t;
cin >> t;
while(t--) {
int n, k;
cin >> n >> k;
vector<int> p(k);
for(int i = 0; i < p.size(); ++i) {
p[i] = i + 1;
}
reverse(p.begin() + (k * 2 - ... | C++ | 67de9506ac2458ee67346bae1a9e3926 | 8fe5895568373ed0e5d578139a89fa87 | 1,500 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int n,k,t;
cin>>t;
while(t--)
{
cin>>n>>k;
for(int i=1;i<=k-(n-k)-1;i++)
cout<<i<<" ";
for(int i=k;i>=k-(n-k);i--)
cout<<i<<" ";
cout<<endl;
}
}
| C++ | 67de9506ac2458ee67346bae1a9e3926 | 279400b68d07ce2fd8c5aee27b7b6ad2 | 1,500 | PASSED |
//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include <sstream>
#include<cstring>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<vector>
#include<set>
#define inf 1000000000
using namespace st... | C++ | 67de9506ac2458ee67346bae1a9e3926 | 6e604bc19a1ab979fe9ef5e72d46addb | 1,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
//#define int ll
#define inr int
#define gcd(a, b) int gcd(int a,int b){return b == 0?a:gcd(a%b);}
#define getbit(x, y) ((x) >> (y)&1)
#define endl "\n"
#define end " "
#define rep(i, a, b) for(int i=a;i<=b;i++)
#define per(i, a, b) for(int i=b;i>=a;i--)
#define mm(a, b) m... | C++ | 67de9506ac2458ee67346bae1a9e3926 | 8f7deaf1d2aa75cb7ab9fadd10acc84a | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
vector<int> v ,pre_mn, pre_mx,suf_mn, suf_mx;
int main() {
int t = 1;
cin >> t;
while (t--) {
//ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n, m;
string s;
cin >> n >> m >> s;
s = "5" + s;
v=vector<int>... | C++ | 85769fb020b0d7f8e447a84a09cdddda | f3980534ab36c50e439fc390098d53de | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define cincout (cin.tie(0) and cout.tie(0)->sync_with_stdio(0));
//#define F first
//#define S second
//#define PB push_back
//#define MP make_pair
//#define ffin freopen("input.txt", "r", stdin);
//#define ffout freopen("output.txt", "w", stdout);
//typedef long long ll... | C++ | 85769fb020b0d7f8e447a84a09cdddda | 0326fb3ac1611d7cd6195be49ce345ab | 1,700 | PASSED |
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
const ll e5 = 2e5 + 5, e9 = 1e9 + 7, INF = 1e18;
int dx[]{0,1,0,-1, -1, -1, 1, 1, 0};
int dy[]{1,0,... | C++ | 85769fb020b0d7f8e447a84a09cdddda | bd830345c803c68d27b0504176f12da0 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,q;
cin>>n>>q;
string s;
cin>>s;
int ansprefix[n+1];
ansprefix[0]=0;
for(int i=1;i<=n;i++)
{
if(s[i-1]=='+')
{
... | C++ | 85769fb020b0d7f8e447a84a09cdddda | 2a0a97e81659c90b1934e284b7ae6a60 | 1,700 | PASSED |
#pragma GCC optimze "trapv"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tasree ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int main(){
tasree
int t;cin>>t;
while(t--)
{
int n,m;
string s;
cin>>n>>m;
cin>>s;
vector<int>v(n+5),leftMin(n+5),leftMax(n+5),leftSum(n+5),rightMin(n+5... | C++ | 85769fb020b0d7f8e447a84a09cdddda | badb35009d9eccf1bf53a5f4cab12150 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tasree ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int main(){
tasree
int t;cin>>t;
while(t--)
{
int n,m;
string s;
cin>>n>>m;
cin>>s;
vector<int>v(n+5),leftMin(n+5),leftMax(n+5),leftSum(n+5),rightMin(n+5),rightMax(n+5);
for(int i=... | C++ | 85769fb020b0d7f8e447a84a09cdddda | c8adc888cbd4d48797d7a8b009f24dc2 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tasree ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int main(){
tasree
int t;cin>>t;
int n,m,mn,mx,l,r;string s;
while(t--)
{
cin>>n>>m;
cin>>s;
vector<int>v(n+5),leftMin(n+5),leftMax(n+5),leftSum(n+5),rightMin(n+5),rightMax(n+5);
... | C++ | 85769fb020b0d7f8e447a84a09cdddda | 237da719af060dea59a1e83e66ba6af9 | 1,700 | PASSED |
#include <iostream>
#include<cmath>
#include<vector>
#include<utility>
#include<map>
#include<string>
#include<algorithm>
#include<set>
#include <iomanip>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<set>
using namespace std;
#define ll long long
#define pb push_back
#define EPS 1e-10
v... | C++ | 85769fb020b0d7f8e447a84a09cdddda | e1a7893b66a9560d1a500d1c9268daa7 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define _for(i,j,n) for(int i = j; i < n; i++)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
void init_code() {
fast_io;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
... | C++ | 85769fb020b0d7f8e447a84a09cdddda | cf46b1760db5aded381419038f18736c | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std ;
char c[200001] ;
int t, sum1, pref[200001], sum[800001], pref_mn[800001], pref_mx[800001] ;
pair<int, int> p ;
void build(int l, int r, int v)
{
if(l == r)
{
int num = 1 ;
if(c[l] == '-')num = -1 ;
pref_mn[v] = min(num, 0) ;
pref_mx[v... | C++ | 85769fb020b0d7f8e447a84a09cdddda | 64b066e8b0efc3fcc02e34927c918a97 | 1,700 | PASSED |
#include <iostream>
#include <cassert>
#include <vector>
using namespace std;
typedef long long ll;
const int M = 998244353;
const int FACTN = 300000 + 7;
int add(int a, int b) {
a += b;
if (a >= M)return a - M;
if (a < 0)return a + M;
return a;
}
int mul(int a, int b) {
return a * (ll... | C++ | 8af6166a5b04690c4074f8ee86b03873 | fffed8a31b31d7793bceb10fbf21c55a | 2,800 | PASSED |
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4", "avx")
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define ull unsigned long long
#define YES puts("YES")
#define NO puts("NO")
#define Yes puts("Yes")
#define No puts("No")
#define... | C++ | 8af6166a5b04690c4074f8ee86b03873 | 7d4c8070d785cec527ce6a152a9c7bbd | 2,800 | PASSED |
/*
* ## ##### #### #### # # ####
* # # # # # # # # # # # #
* # # ##### # # # # # # #
* ###### # # # # # # ## # # #
* # # # # # # # # ## ## # #
* # # ##### #### #### # # ####
*/
#include <bits/stdc... | C++ | 8af6166a5b04690c4074f8ee86b03873 | 83f843e0f6d93501c54907ba68775f75 | 2,800 | PASSED |
// 旅立つ魂よ、どうか迷わぬようにと、導に進んでいけ、決意の火
#include <bits/stdc++.h>
#define forn(i,s,t) for(int i = (s); i <= (t); ++i)
#define form(i,s,t) for(int i = (s); i >= (t); --i)
#define rep(i,s,t) for(int i = (s); i < (t); ++i)
using namespace std;
typedef long long i64;
const int N = 1 << 19, Mod = 998244353;
struct Mint {
... | C++ | 8af6166a5b04690c4074f8ee86b03873 | 936b228638fe9aa93a19a1b883dd5a07 | 2,800 | PASSED |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
using namespace std;
const LL MOD=998244353;
LL qpow(LL x,LL a)
{
LL ... | C++ | 8af6166a5b04690c4074f8ee86b03873 | f04a49a7dd21c351ff647862f1494364 | 2,800 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | 8af6166a5b04690c4074f8ee86b03873 | 5ff4a33c751e6b7c69e4a3cbd5a28563 | 2,800 | PASSED |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <... | C++ | 8af6166a5b04690c4074f8ee86b03873 | cc221bd1c765730b7c805be047141310 | 2,800 | PASSED |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
// #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#include <limits>
#include <type_traits>
namespace suisen {
// ! utility
template <typename ...Types>
using constraints_t = std::enable_if_t<std::conjunc... | C++ | 8af6166a5b04690c4074f8ee86b03873 | c012eef8a53639d1fb8b13d66150e361 | 2,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using u32 = unsigned int;
using db = double;
using ld = long double;
using pii = std::array<int, 2>;
using pll = std::array<ll, 2>;
const int INF = 0x3f3f3f3f;
const long long INFll = 0x3f3f3f3f3f3... | C++ | 8af6166a5b04690c4074f8ee86b03873 | 35186cc362815532030c05b5a2210e69 | 2,800 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cassert>
#include <ctype.h>
#include <queue>
#include <cstring>
#include <set>
#include <bitset>
#include <map>
#include <chrono>
#include <random>
#include <unordered_map>
#include <stdio.h>
using namespace std;
... | C++ | 8af6166a5b04690c4074f8ee86b03873 | a9932db8b6723dc71e51c644a177f53f | 2,800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
ll n, m, INF = 1e15;
vector<vector<pair<ll, ll>>> a;
vector<ll> ans;
void input() {
cin >> n >> m;
a.resize(n);
for (ll i = 0; i < m; i++) {
ll ui, vi, wi;
cin >> ui >> vi >> wi;
... | C++ | 4de02364b27e697b5750f0bd88fac821 | 7b352c96a304d3dadeb44d4d7e8570cb | 2,400 | PASSED |
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
typedef pair<long long, int>PII;
const int N = 1e6 + 10;
const int M = 5e6 + 10;
int e[M], ne[M], h[N], w[M], idx = 0;
long long dist[N];
int st[N];
int n, m;
void add(int a,int b,int c)
{
w[idx] = c;
e[... | C++ | 4de02364b27e697b5750f0bd88fac821 | 828416112bf8d901d92443279cc73019 | 2,400 | PASSED |
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
typedef pair<long long, int>PII;
const int N = 1e6 + 10;
const int M = 5e6 + 10;
int e[M], ne[M], h[N], w[M], idx = 0;
long long dist[N];
int st[N];
int n, m;
void add(int a,int b,int c)
{
w[idx] = c;
e[... | C++ | 4de02364b27e697b5750f0bd88fac821 | 1aa6b3c3f57393c65c372dbb368e3719 | 2,400 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> order_set;
vector<... | C++ | 4de02364b27e697b5750f0bd88fac821 | cef0e569edf2544a86ea1f59f140be47 | 2,400 | PASSED |
#ifndef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
x = 0;
bool f = 0;
char s = getchar();
for (; !isdigit(s); s = getchar()) f = s == '-';
for (; isdigit(s); s = getchar()) x = (x << ... | C++ | 4de02364b27e697b5750f0bd88fac821 | 066a1a83471ceeabc2bede7d2af44ac6 | 2,400 | PASSED |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
x = 0;
bool f = 0;
char s = getchar();
for (; !isdigit(s); s = getchar()) f = s == '-';
for (; isdigit(s); s = getchar()) x = (x << 1) + (x << 3) + (s ^ 48);
... | C++ | 4de02364b27e697b5750f0bd88fac821 | 8d9044dda5354a2f210a4a0e493cc408 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
x = 0;
bool f = 0;
char s = getchar();
for (; !isdigit(s); s = getchar()) f = s == '-';
for (; isdigit(s); s = getchar()) x = (x << 1) + (x << 3) + (s ^ 48);
x = f ? -x : x;
}
template <ty... | C++ | 4de02364b27e697b5750f0bd88fac821 | c3bca8de655de566fd0ec6a2ffd52d0e | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int M=4e6+10,N=2e5+10;
const long long inf=1e18;
struct edge{
int v,w,next;
}e[M<<1];
int n,m,tot,head[N<<2];
void add(int u,int v,int w){
e[++tot].v=v;
e[tot].w=w;
e[tot].next=head[u];
head[u]=tot;
}
int read(){
int s=0,f=1;
char ch=getchar... | C++ | 4de02364b27e697b5750f0bd88fac821 | 3dbacfd9817429096a5bd3ecfb07695e | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int M=4e6+10,N=2e5+10;
const long long inf=1e18;
struct edge{
int v,w,next;
}e[M<<1];
int n,m,tot,head[N<<2];
void add(int u,int v,int w){
e[++tot].v=v;
e[tot].w=w;
e[tot].next=head[u];
head[u]=tot;
}
int read(){
int s=0,f=1;
... | C++ | 4de02364b27e697b5750f0bd88fac821 | 159a672aede2f0d7357db4777354e229 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define lli long long int
using namespace std;
struct node
{
int vertex;
lli weight;
bool first,second;
friend ostream & operator << ( ostream & out , const node & other )
{
out << " vertex = "<<other.vertex <<" weight = "<< other.weight <<" min = "<< oth... | C++ | 4de02364b27e697b5750f0bd88fac821 | 894b270f405715077d7e0084419dfaaf | 2,400 | PASSED |
#include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxN = 3e3, maxX = 101; int n;
short a[maxN];
int b[maxN];
bool done[maxX];
// source (0) -[b[i]]> numbers (1 : n) -[b[i]]> sink(n + 1)
const int maxVertices = maxN + 2, inf = 4e8;
int sou... | C++ | 198b6e6b91c7b4655d133a78421ac249 | 5bec9c514cecbf76875e9ba57a18817a | 2,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.