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;
int n;
long long a[100001], r[100001],c[100005];
long long ans;
void msort(int s,int t){
if(s==t) return ;
int mid=s+t>>1;
msort(s,mid),msort(mid+1,t);//→→→→→→→递归的体现
int i=s,j=mid+1,k=s;
while(i<=mid&&j<=t)
if(a[i]<=a[j]) r[k++]=a[i++];//先赋值再+1
else r[... | C++ | ac879e7c63151c50281cebaf09e790df | cbd90c291281a210de65067897695337 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct BIT{
vector<l... | C++ | ac879e7c63151c50281cebaf09e790df | ec9714fb0123b48a1ea35de59a5409d4 | 2,400 | PASSED |
// LUOGU_RID: 92564052
#include <bits/stdc++.h>
using namespace std;
#define ri register int
#define ll long long
template<class T> inline void rd(T &x,char c=getchar(),bool f=0){
x=0; while(c<48||c>57) f|=c=='-',c=getchar();
while(c>=48&&c<=57) x=x*10+(c^48),c=getchar(); f&&(x=-x);
}
#define lowbit(x) (x... | C++ | ac879e7c63151c50281cebaf09e790df | 1c815fbabb46c071ef851d3aebb0993e | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ri register int
#define ll long long
template<class T> inline void rd(T &x,char c=getchar(),bool f=0){
x=0; while(c<48||c>57) f|=c=='-',c=getchar();
while(c>=48&&c<=57) x=x*10+(c^48),c=getchar(); f&&(x=-x);
}
#define lowbit(x) (x&-x)
constexpr int N =... | C++ | ac879e7c63151c50281cebaf09e790df | fc3c0ada62788e0ce50865e0383d1d9b | 2,400 | PASSED |
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
using namespace std;
const int nmax = 1e5 + 5;
long long aib[nmax], sp[nmax], vec[nmax];
void update(int poz, int n)
{
for(int i = poz; i <= n; i += (i & -i))
aib[i]++;
}
long long query(int poz)
{
long long sum = ... | C++ | ac879e7c63151c50281cebaf09e790df | 9a0dd7c6eac7a79acd34619c379287d4 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//{{{ template
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define vt vector
#define ar array
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define en '\n'
#define pb push_back
#define fast ... | C++ | ac879e7c63151c50281cebaf09e790df | b58c474e6a1685eca30c6d2357ca14f9 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int L = 2e5 + 10;
const int nax = 2e5 + 10;
const int MOD = 998244353;
const int LG = 17;
inline void plusle(int &a, int b){a+=b;if(a>=MOD)a-=MOD;}
inline void minun(int &a, int b){a-=b;if(a<0)a+=MOD;}
inline int add(int a, int b){a+=b;if(a>=MOD)a-=MOD;return... | C++ | 130b1e475b390e7de55ea01a50648bd6 | 2c0874134f57e42799ea46952fc4d92e | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int L = 2e5 + 10;
const int nax = 2e5 + 10;
const int MOD = 998244353;
const int LG = 17;
inline void plusle(int &a, int b){a+=b;if(a>=MOD)a-=MOD;}
inline void minun(int &a, int b){a-=b;if(a<0)a+=MOD;}
inline int add(int a, int b){a+=b;if(a>=MOD)a-=MOD;return... | C++ | 130b1e475b390e7de55ea01a50648bd6 | 11f14214d6ae44d1d3722ad1a140b38a | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int L = 2e5 + 10;
const int nax = 2e5 + 10;
const int MOD = 998244353;
const int LG = 17;
inline void plusle(int &a, int b){a+=b;if(a>=MOD)a-=MOD;}
inline void minun(int &a, int b){a-=b;if(a<0)a+=MOD;}
inline int add(int a, int b){a+=b;if(a>=MOD)a-=MOD;return... | C++ | 130b1e475b390e7de55ea01a50648bd6 | 3e1b611f4fa6b8d7a851a83a76189249 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int L = 3e5 + 10;
const int nax = 3e5 + 10;
const int MOD = 998244353;
const int LG = 19;
inline void plusle(int &a, int b){a+=b;if(a>=MOD)a-=MOD;}
inline void minun(int &a, int b){a-=b;if(a<0)a+=MOD;}
inline int add(int a, int b){a+=b;if(a>=MOD)a-=MOD;return... | C++ | 130b1e475b390e7de55ea01a50648bd6 | 6280098033d04ca4accdbe5837b6c213 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int L = 3e5 + 10;
const int nax = 3e5 + 10;
const int MOD = 998244353;
const int LG = 19;
void plusle(int &a, int b){a+=b;if(a>=MOD)a-=MOD;}
void minun(int &a, int b){a-=b;if(a<0)a+=MOD;}
int add(int a, int b){a+=b;if(a>=MOD)a-=MOD;return a;}
int sub(int a, ... | C++ | 130b1e475b390e7de55ea01a50648bd6 | 88ac1ecdc0bd4dc1612b4e311e2ed33c | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=998244353;
const int FACTN=200000+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)b%M;
}
int add(int a,int b,int c){
return add(add(a,b),c);... | C++ | 130b1e475b390e7de55ea01a50648bd6 | d5102224de3dd1a64ce02565494eb752 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const int MAX = 2e5+10;
template<typename T> struct rmq {
vector<T> v;
int n; static const in... | C++ | 130b1e475b390e7de55ea01a50648bd6 | b15d39ef7b6258abc8483b6efc8e932d | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const int MAX = 2e5+10;
template<typename T> struct rmq {
vector<T> v;
int n; static const in... | C++ | 130b1e475b390e7de55ea01a50648bd6 | 11388c3deb699c9cfbdc890a58a2a4b7 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
typedef long long ll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
const int MAX = 2e5+10;
template<typename T> struct rmq {
vector<T> v;
int n; static const in... | C++ | 130b1e475b390e7de55ea01a50648bd6 | d3c811b2552bdd9e26ef37cd660006c3 | 2,500 | PASSED |
/// -- -- ---- --- -- --
/// 14.09.2022 Wed 16:37
/// -- -- ---- --- -- --
#include <bits/stdc++.h>
using namespace std;
#define pll pair<long long, long long>
#define len(a) ((int)((a).size()))
#define all(a) a.begin(), a.end()
#define add push_back
#define mkp make_pair
#define ll long long
#define fr ... | C++ | 130b1e475b390e7de55ea01a50648bd6 | 6fea783ebe1c47fc9e058e8957a94949 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define debug(x) cerr << #x << ": " << x << endl;
const ll MAXN = 2e6 + 10;
int cmp, pos[MAXN], n, q, p... | C++ | a347be534b2585ab43ebb2a01e0f8c26 | 6c4973e742ea1bf4db8f09733c19221c | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 8e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define... | C++ | a347be534b2585ab43ebb2a01e0f8c26 | bdecddef17173f09a1b4c272e9c8a1c7 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 8e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define... | C++ | a347be534b2585ab43ebb2a01e0f8c26 | 2b93bc90de2b733ab4da5e5e29c89f61 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 8e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define... | C++ | a347be534b2585ab43ebb2a01e0f8c26 | fe3e4eb33202654ad446a556e5d8c082 | 2,500 | PASSED |
#include<cstdio>
#include<set>
#include<vector>
#define RI register int
#define CI const int&
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef pair <int,int> pi;
const int N=400005;
set <pi> s; int n,a[N<<1],q,opt,x,y,tot,id[N],fa[N<<1]; vector <int> ... | C++ | a347be534b2585ab43ebb2a01e0f8c26 | 3eab75c7d8d337cb744e75f889550797 | 2,500 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
struct DSU {
std::vector<int> f, siz;
DSU(int n) : f(n), siz(n, 1) { std::iota(f.begin(), f.end(), 0); }
int leader(int x) {
while (x != f[x]) x = f[x] = f[f[x]];
return x;
}
bool same(int x, int y) { return leader(x) == lead... | C++ | a347be534b2585ab43ebb2a01e0f8c26 | 051feea445afba037394942cc9da88c3 | 2,500 | PASSED |
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define PI 3.14159265358979
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair <int, int>;
using pll = pair <long long, long long>;
const int N = 8e5... | C++ | a347be534b2585ab43ebb2a01e0f8c26 | bc4afaa7677e57b6963d528fdea6824b | 2,500 | PASSED |
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <s... | C++ | a347be534b2585ab43ebb2a01e0f8c26 | 5a80a4c899d2a0c335730d24a0750f97 | 2,500 | 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++ | a347be534b2585ab43ebb2a01e0f8c26 | e9f75c64ee9480eae22c00f3293515ad | 2,500 | 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++ | a347be534b2585ab43ebb2a01e0f8c26 | 87dd7d1a86997f79b3e4072e6d2bc771 | 2,500 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
std::cin >> n;
std::vector<std::vector<std::array<int, 2>>> adj(n);
i64 sum = 0;
for (int i = 0; i < n - 1; i++) {
int u, v, w;
... | C++ | 2528924d2bbad27b117165a5c29efd51 | 10593030ffbb728be7080c3fb852aec2 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<vector<pair<ll,... | C++ | 2528924d2bbad27b117165a5c29efd51 | f5e1266dcf822e3f8255234fbb35d35f | 2,500 | 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")
#de... | C++ | 2528924d2bbad27b117165a5c29efd51 | c834f397bd122349448cfe21c5f9ff2d | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int((x).size()))
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define pob pop_back
#define F1(x) function<void(int)> x = [&]
#define F2(x) function<void(int, int)> x = [&]
#define F3(x) function<void(int, int, int)> ... | C++ | 2528924d2bbad27b117165a5c29efd51 | 7896c2a34795a4de4961be1bfee234f8 | 2,500 | PASSED |
#include<cstdio>
#include<vector>
#include<algorithm>
struct edge{int to;long long w;edge(int to=0,long long w=0){this->to=to,this->w=w;}};
std::vector<edge> a[100005];
std::vector<long long> pm[100005],ps[100005],sm[100005],ss[100005];
long long dp[100005],mx[100005],g[100005],ans=0,all=0;
int n;
void add(int ... | C++ | 2528924d2bbad27b117165a5c29efd51 | f6f0a8fb4e9303ccac04f69df377531b | 2,500 | PASSED |
#include<cstdio>
#include<vector>
#include<algorithm>
struct edge{int to;long long w;edge(int to=0,long long w=0){this->to=to,this->w=w;}};
std::vector<edge> a[100005];
std::vector<long long> pm[100005],ps[100005],sm[100005],ss[100005];
long long dp[100005],mx[100005],g[100005],ans=0,all=0;
int n;
void add(int ... | C++ | 2528924d2bbad27b117165a5c29efd51 | c9b592c53f255b034fad2f8a5eb2806b | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n;
vector<pair<int,int> > adj[N] ;
long long dp_down[N], dp2_down[N] ;
void solve_down(int x, int p){
vector<long long> big3 = {0, 0, 0} ;
for(auto u : adj[x]){
if(u.first == p)continue ;
... | C++ | 2528924d2bbad27b117165a5c29efd51 | 3c0d477f10e82d765ed89a933c1af12f | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5;
vector <pair <int, int> > g[maxn];
int dep[maxn];
int dep2[maxn];
int dep3[maxn];
int dep4[maxn];
int dep5[maxn];
int dep6[maxn];
int dep7[maxn];
void dfs(int v, int p) {
dep[v] = 0;
dep2[v] = 0;
vector <... | C++ | 2528924d2bbad27b117165a5c29efd51 | f3883756af0b1d9c1d3e9b747e1fa5f1 | 2,500 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_s... | C++ | 2528924d2bbad27b117165a5c29efd51 | 2b009ff42cf34b53c71d22656a479ed9 | 2,500 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_s... | C++ | 2528924d2bbad27b117165a5c29efd51 | 85d6a42b6f2f38bddc7757e96878665a | 2,500 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
#define lld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define fl(i,n) for(int i=0;i<n;i++)
#define rl(i,m,n) for(int i=n;i>=m;i--)
#define py cout<<"YES\n";
#define pn cout<<"NO\n";
#define pi 3.141592653589... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | 56ea48aeabef516c1daf108766b250ed | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int freq[N];
set<long long>divisors(long long n){
set<long long>st;
for(int i=1;i<=n/i;i++){
if(n%i==0){
st.insert(i);
st.insert(n/i);
}
}
return st;
}
int powr(int a, int b) {
if (b == 1)re... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | 305b1980d1c185eff0345da6dac9dd80 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 5, mod = 1e9 + 7;
const ll oo = 1e18;
ll a[N];
void solve() {
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
ll mn = a[0];
for(int i=0;i<n;i++) a[i] -= mn;
ll g = 0;
fo... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | 2c3c0186ff9f4d89140c3750e1ed0674 | 1,100 | PASSED |
#include <iostream>
using namespace std;
#include <bits/stdc++.h>
# define ll long long
#define FIO ios_base::sync_with_stdio(false),cout.tie(nullptr);
ll power(ll a,ll b,ll mod){
if(!b)
return 1;
ll res=power(a,b>>1,mod);
return((res%mod)*(res%mod)*((b&1)?a:1)%mod)%mod;
}
int main() {
//files()... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | 97db61e2292e7e36c4482da83f552c7f | 1,100 | PASSED |
//نحن قوم أعزَّنا الله بالإسلام فمهما ابتغينا العزَّة في غيره أذلَّنا الله
#include<bits/stdc++.h>
#define int long long
#define ld long double
#define fn(x) for (int i = 0; i <(x); i++)
#define we int t=1;cin>>t;while(t--)
#define hema ios_base::sync_with_stdio(0) , cin.tie(0) ,cout.tie(0);
#define all(x) (x).begin(),... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | d6efee8c5af56703267397b5efda1b5a | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n, Min, ans, temp;
cin >> n;
int arr[n];
for(int i=0; i<n; i++) cin >> arr[i];
sort(arr, arr+n);
//sama semua
if(arr[0] == arr[n-1])
cout << -1 << '\n';
else{
Min = arr[0];
ans = arr[n-1] - Min;
for(int i=0; i<n; i++){
if(ar... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | 898707e9872a0cc1bc22b7d3db978c98 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int zuida(int x,int y){
int z=y;
while(x%y!=0){
z=x%y;
x=y;
y=z;
}
return z;
}
int main(){
int t;
int a[50];
cin>>t;
while(t--){
int n;
cin>>n;
int l=0;
int k=1;
memset(a,0,sizeof(a));
for(int i=1;i<=n;i++){
int x;
cin>>x;
if(i==1)l=x;
e... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | b8f17c685ab146068c9d57a495593ce0 | 1,100 | PASSED |
#include "bits/stdc++.h"
using namespace std;
int t,n,a[100];
int main()
{
cin>>t;
while(t--)
{
cin>>n;
int mi=0x3f3f3f3f,ma=0x3f3f3f3f,j=1;
for(int i=1;i<=n;i++) cin>>a[i],mi=min(a[i],mi);
for(int i=1;i<=n;i++)
{
a[i]-=mi;
if(a[i]) a[j++]=a[i];
if(j>1) ma=min(a[j-1],ma);
}
if(j==1) cout<<... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | 17d02ff7cb750e6c22cbfecd2d646e8d | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cout<<"[" << #x << " is:" << x << "] "<<endl;
#define endl '\n'
void solve() {
int n; cin >> n;
int gcd = 0;
int s; cin >> s;
while(--n)
{
int x ; cin >> x;
gcd = __gcd(gcd,abs(x - s));
}
if(g... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | 8fe7ac47a9d7a6bdf3abda805d9e3507 | 1,100 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b)
{
if (b == 0)
{
return a;
}
return gcd(b, a % b);
}
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int minElement = 1e6 + 5;
vector<int> a(n);
... | C++ | 57f0f36905d7769167b7ba9d3d9be351 | 3b2be765e6639fd078fd8aad9fbe26a4 | 1,100 | PASSED |
#include<iostream>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
const int N = 400010;
int a[N];
void solve()
{
int n,k;
cin >> n >> k;
int end = n;
for(int i = 1;i <= k; i++)
cin >> a[i];
sort(a+1,a+1+k);
int cnt = 0;
for(int i = k;i ; i--)
{
... | C++ | fd1b846c46a074f6afa1fa6e2844c3e2 | 2723ff1395260ae442ded4e645b25806 | 1,000 | PASSED |
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[1000000];
int main(){
int T;
scanf("%d", &T);
while(T--){
long long n,k;
scanf("%lld%lld",&n,&k);
for(int i=1;i<=k;++i){
scanf("%d",&a[i]);
}
sort(a+1,a + k+1);
long sum=0, ans=0;
... | C++ | fd1b846c46a074f6afa1fa6e2844c3e2 | 97ae6b7da65d1d634ce8e11603c7b6f4 | 1,000 | PASSED |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define el '\n'
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ordered_set(datatype) tree<datatype, null_type, les... | C++ | fd1b846c46a074f6afa1fa6e2844c3e2 | 2caa694637372c844797833ca26ac3c4 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
long long int n,k,x;
cin>>n>>k;
long long int a[k+1];
for(int i=1;i<=k;i++)
{
cin>>a[i];
}
sort(a+1,a+k+1);
long long int cnt=0;
long long int step=0;
for(int i=k;i>=1;i--)
{
if(i==1&&a[i]>step){
co... | C++ | fd1b846c46a074f6afa1fa6e2844c3e2 | e05b2405ef094e728cf94e8e87aefcb5 | 1,000 | PASSED |
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
int t;
cin >> t;
while(t --){
int n, k;
cin >> n >> k;
vector<int> a(k);
for (int i = 0; i < k; i ++ )
cin >> a[i];
sort(a.begin(), a.end());
int ans = 0, sum = 0;
... | C++ | fd1b846c46a074f6afa1fa6e2844c3e2 | c6c5add3eb526d37fed83bee1254caa5 | 1,000 | PASSED |
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<iostream>
#include<queue>
using namespace std;
int main(){
int t,n,k,a[400000],sum,shu;
scanf("%d",&t);
while(t--){
sum=0;
shu=0;
scanf("%d%d",&n,&k);
for(int i=1;i<=k;i++){
scanf("%d",&a[i]);
a[i]=n-a[i];
}
sort(a+1... | C++ | fd1b846c46a074f6afa1fa6e2844c3e2 | 14b3b12095d8c84304a78d6183a55280 | 1,000 | PASSED |
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int n,c,m,k;
int mouse[400005];
int main(){
int t;
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&k);
for(int i=1;i<=k;i++){
scanf("%d",&mouse[i]);
}
sort(mouse+1,mouse+1+k);
c=0;
m=k;
int ans=0;
while(c<mouse[m]){
ans++;
... | C++ | fd1b846c46a074f6afa1fa6e2844c3e2 | ee56bc8b25b034c0e322a947edf19c67 | 1,000 | PASSED |
#include<bits/stdc++.h>
#include <iostream>
#include<algorithm>
#include <string>
#include <cmath>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int i,n,k;cin>>n>>k;
int s[400050];
for(i=0;i<k;i++)
{
cin>>s[i];
}
sort(s,s+k);
... | C++ | fd1b846c46a074f6afa1fa6e2844c3e2 | bb4f18d7248b5ed3d29aaee0799ebc23 | 1,000 | PASSED |
t = int(input())
for i in range(t):
a,b,c = map(int,input().split())
if (a==b==c) == 1:
print(1,1,1)
elif a>b and a>c:
print(0,a-b+1,a-c+1)
elif b>c and b>a:
print(b-a+1,0,b-c+1)
elif c>a and c>b:
print(c-a+1,c-b+1,0)
elif a==b:
if c>a:
... | Python | f80dea1e07dba355bfbefa4ff65ff45a | a320cb4bd70d5f2c0faae617e986eae6 | 800 | PASSED |
t=int(input())
for _ in range(t):
L=list(map(int,input().split()))
if (L.count(max(L))==3):
print(1,1,1)
elif(L.count(max(L))==2):
for i in range(3):
print(max(L)-L[i]+1,end=" ")
print()
else:
for x in L:
if x==max(L):
p... | Python | f80dea1e07dba355bfbefa4ff65ff45a | 674cd671e96c3f3c1166fd0160aee8d1 | 800 | PASSED |
import sys
count = int(input())
r = []
t = []
for line in sys.stdin:
n = list(map(int, line.split()))
m = max(n[0],n[1],n[2])
t = []
if max(n[1], n[2]) < n[0]:
t.append(0)
else:
t.append(1+ m - n[0])
if max(n[0], n[2]) < n[1]:
t.append(0)
else:
... | Python | f80dea1e07dba355bfbefa4ff65ff45a | f5bd7ad3fd4b24d11bde69374e65608a | 800 | PASSED |
t=int(input())
for i in range (t):
a,b,c= map(int,input().split())
if(a == b == c):
a = b = c = 1
print(a,b,c)
continue
if(a>b):
if(a>c):
temp=a
b=temp-b+1
c=temp-c+1
a=0
elif(a==c):
... | Python | f80dea1e07dba355bfbefa4ff65ff45a | 9440782628c54b2c597949ba9e6c166a | 800 | PASSED |
class Solution:
def answer(self, a:int, b:int, c:int):
maxx = max(a, b, c)
arr = []
if max(c, b) < a:
arr.append(0)
else:
arr.append(1+ maxx - a)
if max(a, c) < b:
arr.append(0)
else:
arr.append(1+ ... | Python | f80dea1e07dba355bfbefa4ff65ff45a | dd40909fb64bef625a662b934a42d282 | 800 | PASSED |
class Solution:
def answer(self, a:int, b:int, c:int):
maxx = max(a, b, c)
arr = []
if max(c, b) < a:
arr.append(0)
else:
arr.append(1+ maxx - a)
if max(a, c) < b:
arr.append(0)
else:
arr.append(1+ ... | Python | f80dea1e07dba355bfbefa4ff65ff45a | 337831a603b2df4807a60d60decbf355 | 800 | PASSED |
test=int(input())
for i in range(test):
a,b,c=map(int,input().split())
if a > b and a > c :
x = 0
else :
x = (max(b,c))-a+1
if b > c and b > a :
y = 0
else :
y = (max(a,c))-b+1
if c > a and c > b :
z = 0
else :
z = (max(a,b))-c+1
print(x,y,z) | Python | f80dea1e07dba355bfbefa4ff65ff45a | 3936a1d5a580b8f817d80951c4537d23 | 800 | PASSED |
import fileinput
if __name__ == '__main__':
test = 'test'
with fileinput.input() as f:
t = int(f.readline())
while t:
a, b, c = [int(x) for x in f.readline().split(' ')]
m = max(a, b, c)
m_count = 0
if a == m:
m_count +=... | Python | f80dea1e07dba355bfbefa4ff65ff45a | dd9565047c6d423f4452b2aba3f9b7ad | 800 | PASSED |
#include <iostream>
#include <string>
int quantosPassos(std::string inteiro) {
int tentativas; //Numero de tentativas feitas
bool found0 = false; //Marca se ja achou um 0
bool found5 = false; //Marca se ja achou um 5
// Tenta achar os seguintes pares: 2-5, 7-5, 0-0, ou 5-0
for (tentativas = 0; tentativas < in... | C++ | ab6fefc6c15d4647bc601f1f9db21d3f | 02e0bff955844390ee0a46d06d3c9ef5 | 900 | PASSED |
/* Authors' info: */
/* Name: Professor Mardeus <3 GND */
/* Birthday: 17 / 04 / 05 */
/* �The unseen blade is the deadliest� */
/* ... | C++ | ab6fefc6c15d4647bc601f1f9db21d3f | 5e88398534ab4d8064dc3535594070d4 | 900 | PASSED |
#include <iostream>
#include <vector>
std::vector<int> char_to_int_vector(std::string str)
{
std::vector<int> vec(str.length());
for (int i = 0; i < str.length(); i++)
{
vec[i] = ((int)str[i]) - 48;
}
return vec;
}
int steps_to_num(const std::vector<int> vec, const int target, const int st... | C++ | ab6fefc6c15d4647bc601f1f9db21d3f | 048ee31e3cdb61d8684d4d4d46de598d | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
string s;
cin >> s;
int mi = 1e9, si = s.size() - 1;
for (int i = 1; i < s.size();i++){
if(s[i] == '5'){
for (int j = i - 1; j >= 0;j--){
if... | C++ | ab6fefc6c15d4647bc601f1f9db21d3f | 7c69360dc412ab9fb760a28d1510e3b2 | 900 | PASSED |
#include "iostream"
#include "algorithm"
using namespace std;
bool panduan(string s)
{
int len = s.length();
if ((s[len - 1] == '5' && (s[len - 2] == '7' || s[len - 2] == '2')) || (s[len - 1] == '0' && (s[len - 2] == '5' || s[len - 2] == '0')))
return true;
else
return false;
}
int main()
... | C++ | ab6fefc6c15d4647bc601f1f9db21d3f | c155fceb7cc5fd741968807c9a4d4616 | 900 | PASSED |
#include<iostream>
using namespace std;
typedef long long LL;
LL x;
int ans;
bool check(int a, int b)
{
ans = 0;
bool is_a = false, is_b = false;
LL xx = x;
while (xx)
{
int op = xx % 10;
xx /= 10;
ans ++;
if (op == b)
{
is_b = true;
break;
}
}
while (xx)
{
int op = xx % 10;
xx /= 10;
... | C++ | ab6fefc6c15d4647bc601f1f9db21d3f | 7aebd10757a20974087c0caf53cedc04 | 900 | PASSED |
#include <bits/stdc++.h>
#define optimize ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ALL(x) x.begin(), x.end()
#define endl "\n"
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define MAXN 110
#define INF 10000010
#define debug cout<<"ate aqui ok\n"
using namespace std;
i... | C++ | ab6fefc6c15d4647bc601f1f9db21d3f | d8c2eaa369fdc6ed48f3064bd20b4939 | 900 | PASSED |
#include<bits/stdc++.h>
#define optimize ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define pii pair<int, int>
#define PI 3.141592653589793238462643383279502884L
#define mod % 1000000007
#define all(v) v.begin(), v.end()
#... | C++ | ab6fefc6c15d4647bc601f1f9db21d3f | fa77f5e622acf9c132ad7b2af272905f | 900 | PASSED |
// #pragma GCC optimize("-fdelete-null-pointer-checks,inline-functions-called-once,-funsafe-loop-optimizations,-fexpensive-optimizations,-foptimize-sibling-calls,-ftree-switch-conversion,-finline-small-functions,inline-small-functions,-frerun-cse-after-loop,-fhoist-adjacent-loads,-findirect-inlining,-freorder-functions... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | c0b2b8e490604da5aa0cec4e521e21f7 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
#define mod 1000000007
#define debug 1
#define deb(x) if(debug) cout<<#x<<"="<<x<< endl;
char p[1000005];
ll q[1000005];
struct
{
ll la;
ll lb;
ll lx;
}dp[42][42][42][42];
ll n,a,b,solved;
void solve(ll z)
{
if(solved) retur... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | 6d32a9f95d8ee30ccdc89f82bf86bb4d | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
#define mod 1000000007
#define debug 1
#define deb(x) if(debug) cout<<#x<<"="<<x<< endl;
char p[1000005];
ll q[1000005];
struct
{
ll la;
ll lb;
ll lx;
}dp[42][42][42][42];
ll n,a,b,solved;
void solve(ll z)
{
if(solved) retur... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | f6d1ae99f6c0901356f11556f733655c | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
#define mod 1000000007
#define debug 1
#define deb(x) if(debug) cout<<#x<<"="<<x<< endl;
char p[1000005];
ll q[1000005];
struct
{
ll la;
ll lb;
ll lx;
}dp[42][42][42][42];
ll n,a,b,solved;
void solve(ll z)
{
if(solved) retur... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | 846625db36e125c718f8b94f01656b20 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define debug 1
#define deb(x) if(debug) cout<<#x<<"="<<x<< endl;
char p[1000005];
ll q[1000005];
struct
{
ll la;
ll lb;
ll lx;
}dp[42][42][42][42];
ll n,a,b,solved;
void solve(ll z)
{
if(solved)... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | 0a145582ae30363a31477e74d814055a | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
vector<int> arr;
int n,a,b;
pair<int,int> memo[41][41][41][41];
int dp(int i, int r_red, int r_black, int r_cnt) {
if(i == n) {
if(r_red == 0 && r_black == 0 && r_cnt!=0 && (n-r_cnt)!=0) {
... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | 7aba59c38c7d7ce23428f19b37f2eefd | 2,100 | PASSED |
#include<bits/stdc++.h>
#define out(x) cout<<(x)<<endl;
#define endl '\n'
#define all(V) V.begin(),V.end()
#define ppb pop_back
#define fu(i,r,t) for(int i=r;i<=t;i++)
#define fd(i,r,t) for(int i=r;i>=t;i--)
#define fun(i) fu(i,1,n)
#define fum(i) fu(i,1,m)
#define ll long long
using namespace std;
const int... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | 8dabc040de59c4eab32e833a1ca247e4 | 2,100 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define ulld unsigned long long int
typedef long long ll;
using namespace std;
int dp[41][41][41][41];
int min1=100;
string p="";
int sol(string &str,int i,ll sum1,ll sum2,ll a,ll b,string &ans,int c)
{
if(dp[i][sum1][sum2][c]!=-1)
return d... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | 7687e06f4bf652f0e5a38d53f24bb682 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int dp[41][41][41][41];
string ans="";
int min1=INT_MAX;
int solve(string& s,string &s1,int n,int a,int b,int ind,int num1,int num2,int diff){
if(ind==s.size()){
if(num1==0 && num2==0){
if(n-diff==0 || diff==0) return I... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | 7c6e45d7d9d82b68a73701b6ab74dc12 | 2,100 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Общий файл.
#include <ext/pb_ds/tree_policy.hpp> // Содержит класс tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
#define all(a) a... | C++ | 2e01de6090e862f7f18a47dcbcb3be53 | e7597d3af436638aff9b5f966b5be77a | 2,100 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
void pfs(ll k, vector<ll> &A, unordered_map<ll, vector<ll>> &B, unordered_map<ll, bool> &C, vector<ll> &D, unordered_map<ll, ll> &E){
vector<ll> God;
for(int aa = 0; aa < D.size(); aa++){
if(E[D[aa]] <= 1){
C[D[aa]] = true;
A[0]++;
cout ... | C++ | 07ac198c1086323517540ecd0669eb4c | 5f1fe0cf009b3da0d090f4c3435461f7 | 1,600 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using nam... | C++ | 07ac198c1086323517540ecd0669eb4c | 47ad5d2e556de414f02cff9df9a25155 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define mod 1000000007
#define int long long
void solve(){
int n, k; cin>>n>>k;
int curr_freq[n+1], new_freq[n+1];
memset(curr_freq, 0, sizeof curr_freq);
set<int> graph[n+1];
for(int i=0; i<n-1; i++){
int u, v; cin>>u>>v;
graph[u].insert(v);
... | C++ | 07ac198c1086323517540ecd0669eb4c | 70aa3d6c7cc04a8536cf9fa5839fe0f9 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define mod 1000000007
#define int long long
void solve(){
int n, k; cin>>n>>k;
set<int> graph[n+1];
int curr_freq[n+1], new_freq[n+1];
memset(curr_freq, 0, sizeof curr_freq);
for(int i=0; i<n-1; i++){
int u, v; cin>>u>>v;
graph[u].insert(v);
... | C++ | 07ac198c1086323517540ecd0669eb4c | cf7d46903966c045030855ce01b0487a | 1,600 | PASSED |
//Hello, world!
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define mod 1000000007
#define int long long
void solve(){
int n, k; cin>>n>>k;
set<int> graph[n+1];
int curr_freq[n+1];
memset(curr_freq, 0, sizeof curr_freq);
for(int i=0; i<n-1; i++){
int u, v; cin>>u>>v;
graph[u].insert(v);
... | C++ | 07ac198c1086323517540ecd0669eb4c | 4725d0a7ede51f5633aa2198ab295486 | 1,600 | PASSED |
//Hello, world!
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define mod 1000000007
#define int long long
void solve(){
int n, k; cin>>n>>k;
set<int> graph[n+1];
int arr[n+1];
memset(arr, 0, sizeof arr);
for(int i=0; i<n-1; i++){
int u, v; cin>>u>>v;
graph[u].insert(v);
graph[v].insert(... | C++ | 07ac198c1086323517540ecd0669eb4c | f08e5cbb767daa7438565d4483b0f79e | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define mod 1000000007
#define int long long
void solve(){
int n, k; cin>>n>>k;
set<int> graph[n+1];
int arr[n+1];
memset(arr, 0, sizeof arr);
for(int i=0; i<n-1; i++){
int u, v; cin>>u>>v;
graph[u].insert(v);
graph[v].insert(u);
arr[u]++;
... | C++ | 07ac198c1086323517540ecd0669eb4c | 85dc2e9c68c5a58b3df6d961932a7fca | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define mod 1000000007
#define int long long
void solve(){
int n, k; cin>>n>>k;
set<int> graph[n+1];
int arr[n+1];
memset(arr, 0, sizeof arr);
for(int i=0; i<n-1; i++){
int u, v; cin>>u>>v;
graph[u].insert(v);
graph[v].insert(u);
arr[u]++;
... | C++ | 07ac198c1086323517540ecd0669eb4c | 1cb61a8b02aff238ea9a8be141b062b5 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int s[N];
char x[N];
void solve() {
scanf("%s", x + 1);
int len = strlen(x + 1);
for (int i = 1; i <= len; i++) {
s[i] = s[i - 1];
if (x[i] == '(' || x[i] == ')') s[i] += i & 1 ? 1 : -1;
}
int q... | C++ | 464ab27d5090b83a0d18d31d7141e329 | f8eba4726ddf5b0268256239943a9f03 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int readint() {
int x = 0, f = 1;
char s = getchar();
#define sc (s = getchar())
while (s < '0' || s > '9') {
if (s == '-') f = -1;
sc;
}
while (s >= '0' && s <= '9') {
x = (x << 3) + (x <... | C++ | 464ab27d5090b83a0d18d31d7141e329 | 97b4123176353e43f5fe1572ca1ae248 | 2,200 | PASSED |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
const int N=1e6+50;
int c[N];char s[N];
inline int Max(int x,int y){return x>y?x:y;}
inline int Min(int x,int y){return x<y?x:y;}
int main()
{
int t;scanf("%d",&t);
while(t--) {
cin>>... | C++ | 464ab27d5090b83a0d18d31d7141e329 | 8eefa17528078e9272429044b5a0ce27 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 50;
int n;
int a[maxn];
char s[maxn];
signed main()
{
// ios::sync_with_stdio(false);
register int T;
cin >> T;
while (T--)
{
cin >> s;
cin >> n;
memset(a, 0, sizeof a );
register int ... | C++ | 464ab27d5090b83a0d18d31d7141e329 | e519b5fc8090f216fd0a7e77c31e3387 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 50;
int n;
int a[maxn];
char s[maxn];
signed main()
{
ios::sync_with_stdio(false);
register int T;
cin >> T;
while (T--)
{
cin >> s;
cin >> n;
memset(a, 0, sizeof a );
register int le... | C++ | 464ab27d5090b83a0d18d31d7141e329 | 682da4fd377cbdb67f1d66adccd16846 | 2,200 | PASSED |
//Author:Happy Dog
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
const int mod=1e9+7;
using namespace std;
int x;
int main()
{
int t;
cin>>t;
while(t--)
{
string s;
cin>>s;
int n=s.size();
vector<int> a(n+1),b(n+1);
a[0]=b[0]=0... | C++ | 464ab27d5090b83a0d18d31d7141e329 | e2cecaf6e3ce397e08a97b7ebf4a5a81 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fr(i,s,e) for(int i=s;i<e;++i)
#define fr1(i,s,e) for(int i=s;i>e;--i)
#define p0(a) cout << a <<" "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c ... | C++ | 464ab27d5090b83a0d18d31d7141e329 | 058d3a36d3beeb1a530cefc2897f02ad | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fr(i,s,e) for(int i=s;i<e;++i)
#define fr1(i,s,e) for(int i=s;i>e;--i)
#define p0(a) cout << a <<" "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c ... | C++ | 464ab27d5090b83a0d18d31d7141e329 | f392096d6e3c580b81bbdc1289698961 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fr(i,s,e) for(int i=s;i<e;++i)
#define fr1(i,s,e) for(int i=s;i>e;--i)
#define p0(a) cout << a <<" "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c ... | C++ | 464ab27d5090b83a0d18d31d7141e329 | ded7df89e4b2e66c4a9f4e41d487f54b | 2,200 | PASSED |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T>
using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define ull unsigned long ... | C++ | 464ab27d5090b83a0d18d31d7141e329 | 800b1448a3c790b9c35ebc3cd149f1ba | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t, n, a[45], b[45], dem[2000005];
void solve(){
for(int i = 0; i <= 2e6; i++) dem[i] = 0;
map<int, int> mp;
for(int i = 1; i <= n; i++){
b[i] = a[i];
mp[a[i]]++;
}
bool ans = 0;
for(int i = 1; i <= n; i++){
if(mp... | C++ | 432411e161af5ef14803e946e2f7fbc3 | 2a9f50509c8c69924077bcf95127e96f | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t, n, a[45], b[45], dem[2000005];
void solve(){
for(int i = 0; i <= 2e6; i++) dem[i] = 0;
map<int, int> mp;
for(int i = 1; i <= n; i++){
b[i] = a[i];
mp[a[i]]++;
}
bool ans = 0;
for(int i = 1; i <= n; i++){
if(mp... | C++ | 432411e161af5ef14803e946e2f7fbc3 | 87c7a86de32d1bd9e622ae8399a36c7e | 1,900 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.