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;
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ll long long int
#define MP make_pair
#define F first
#define S second
#define endl "\n"
//erase it ,if it's not essential .....:D
#define TS to_string
#define FF fflush... | C++ | 02bdd12987af6e666d4283f075f73725 | 590809621ba338607c4e13b53da8ee23 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ll long long int
#define MP make_pair
#define F first
#define S second
#define endl "\n"
//erase it ,if it's not essential .....:D
#define TS to_string
#define FF fflush... | C++ | 02bdd12987af6e666d4283f075f73725 | 476ec2312a64c8b04f276c3009a021b2 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
cout << n << endl;
vector<int> a;
for (int i = 0; i < n; i++)
{
a.push_bac... | C++ | 02bdd12987af6e666d4283f075f73725 | 5d53a126aa3d4c8191e336e06ef278e1 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cout<<n<<endl;
vector<int> a;
for (int i = 0; i < n; i++)
{
a.push_back(i+1);
... | C++ | 02bdd12987af6e666d4283f075f73725 | 1488d5cb273ae0f9b7fda5913e65e6fd | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve()
{
long long n;
cin >> n;
vector<long long> arr(n);
long long k = 1;
for (long long i = 0; i < n; i++)
{
arr[i] = k;
k++;
}
long long loop_it;
int numm = 0;
int jj = n;
... | C++ | 02bdd12987af6e666d4283f075f73725 | 38a4871732ce331c186ca6b557cb8187 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void solve()
{
long long n;
cin >> n;
vector<long long> arr(n);
long long k = 1;
for (long long i = 0; i < n; i++)
{
arr[i] = k;
k++;
}
long long loop_it;
int numm = 0;
int jj = n;
cout<... | C++ | 02bdd12987af6e666d4283f075f73725 | b60e3b092c822454e48818f528203ca2 | 800 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
const int N = 1e5 + 5;
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
int pref[N];
void solve() {
int n;
cin>>n;
vector<int>v;
if(n==2){
cout<<2<<endl;
c... | C++ | 02bdd12987af6e666d4283f075f73725 | cbd324dc9decb184739909727032d3a9 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll t=1;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>t;
while(t--){
ll n;
cin>>n;
std::vector<ll>temp(n) ;
for(int i=0 ;i<n;i++)
temp[i]=i... | C++ | 02bdd12987af6e666d4283f075f73725 | de40ed6ebcde87327955c88dff4666d5 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define v2i vector<vi>
#define ii pair<int, int>
#define F first
#define S second
#define len(s) (int)s.size()
#define quicksilver ios_base::sync_with_stdio(0), cin.tie(0)
int tc = 1;
signed main()
{
quicks... | C++ | 02bdd12987af6e666d4283f075f73725 | 8ba80c84b543237ad94236c94576b1a3 | 800 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
typedef long double ld;
#define pb push_back
#define count_bits __builtin_popcount
#include <ext/... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 29e8168bc56a1311ae0be8ca531989de | 2,000 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
typedef long double ld;
#define pb push_back
#define count_bits __builtin_popcount
#include <ext/... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | cd5217aac223d84df0d06fab12848ae0 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 200010
#define pb push_back
#define LL long long
#define INF 0x3f3f3f3f
#define fi first
#define se second
#define F(i,j,k) for(int i=j;i<=k;i++)
#define Fd(i,j,k) for(int i=j;i>=k;i--)
#define MOD 1000000007
void solve();
void steal();
int addm(in... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 9be80a25fd95711f97b94ad20a4826ff | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 200010
#define pb push_back
#define LL long long
#define INF 0x3f3f3f3f
#define fi first
#define se second
#define F(i,j,k) for(int i=j;i<=k;i++)
#define Fd(i,j,k) for(int i=j;i>=k;i--)
#define MOD 1000000007
void solve();
int addm(int a, int b){ret... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 7dc9dcf45c4bc2f37ef866f78dc6e1b6 | 2,000 | PASSED |
#include<iostream>
#include<algorithm>
long long max(long long x, long long y) {
if (x > y) return x;
else return y;
}
long long min(long long x, long long y) {
if (x < y) return x;
else return y;
}
using namespace std;
int main() {
int tests; cin >> tests;
while (tests--) {
int m = 4; cin... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 50fe1da79b9edf84db0b70e8467f7875 | 2,000 | PASSED |
#include <iostream>
#include <set>
#include <map>
#include <utility>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <cmath>
#include <random>
#include <functional>
#define all(x) (x).begin(), (x).end()
#define rsort(x) sort(x,[&](auto a, auto b){ return ... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 4a24bd717aa403211ca6d5ab3e8387d2 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mp make_pair
#define fast_io ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
//-----constants---------------
ll llmx=1e15;
ll llmn=-1e15;
const ll mod =998244353;
//const ll mod=1000000007;
//const int N... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 253d4f53bfcd3f8e25cdff865a9332be | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mp make_pair
#define fast_io ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
//-----constants---------------
ll llmx=1e15;
ll llmn=-1e15;
const ll mod =998244353;
//const ll mod=1000000007;
//const int N... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 239fb9fc8dfe094a0cb4372981951e42 | 2,000 | PASSED |
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
#include <numeric>
using namespace std;
using ll = long long;
ll MOD = pow(10, 9)+7;
ll inv(ll i) {if (i == 1) return 1; return (MOD - ((MOD / i) * inv(MOD % i)) % MOD) % MOD;}
void problemA()... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 3a484706a017568cb9181c574df0709f | 2,000 | PASSED |
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
#include <numeric>
using namespace std;
using ll = long long;
int MOD = 998244353;
void problemA()
{
ll n;
cin >> n;
cout << (n + 2*(n/2) + 2*(n/3)) << endl;
}
void problemB()
{
... | C++ | f9f82c16e4024a207bc7ad80af10c0fe | 20521b0898d8fcaf8c81e2368af209b4 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | 7b2bb3ef725f072d48fe81e8b8d72567 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | 55f0a82c2025118201de9b7759422d8b | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | de5674cc4133433b3a0e2b79af00c8ec | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | c8035660c72b57b6788cad3055b09b83 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | 17a3464c062b7e9cc90a1ce522acb74b | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | 5ee8211203d385a58f03ae388771e6da | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | 4cc604644fcd99fee7ff3b283a1a4042 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | c2e6e3ecc77412e16d23546a203f77cc | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | 390352346401dce4bc162890ceff9c9f | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
long long T,i,j,sum,x,y,n,m,k,ans[2020][2020],kk;
long long phi(long long x,long long y){return y?(y&1?x*phi(x,y-1)%mod:phi(x*x%mod,y/2)):1;}
int main(){
scanf("%lld",&T);
ans[1][1]=1;
for (i=2;i<=2019;i++) for (j=1;j<=i;j++) ans[i]... | C++ | fc8381e8c97190749b356f10cf80209e | ae321925c7159e7d00278c1ace063fbd | 2,500 | PASSED |
#include<bits/stdc++.h>
#define NN 600100
#define INT long long
#define ls (u << 1)
#define rs (ls | 1)
#define md ((L + R) >> 1)
using namespace std;
int a[NN];
vector <INT> dp[NN], Lp[NN], Rp[NN];
INT sum[NN];
void solve(int u, int L, int R) {
if(L == R) {
int x = max(0, a[L]);
dp[u].push_back(x);
Lp[u].pus... | C++ | 376b293013562d5e004411f42082ce5c | 5224e720fe820217bd234508b3feda5f | 2,500 | PASSED |
#include <bits/stdc++.h>
#define INT long long
#define ls (u << 1)
#define rs (ls|1)
#define mid ((L + R) >> 1)
using namespace std;
const int NN = 300100;
INT sum[4*NN], a[NN];
vector<INT> mx[4*NN], pre[4*NN], suf[4*NN];
void push_up(int u){
sum[u] = sum[ls] + sum[rs];
int n = pre[ls].size();
for(int i = 0; i < n; ... | C++ | 376b293013562d5e004411f42082ce5c | af8fcc153c41b2d23340fd60850bce7d | 2,500 | PASSED |
#include <bits/stdc++.h>
#define ls ( u << 1)
#define rs ( ls | 1)
#define mid ((L+R)>>1)
using namespace std;
using INT = long long;
const int NN = 2e6 + 100;
INT a[NN], sum[NN];
vector < INT > suf[NN], pre[NN], dp[NN];
void build(int u, int L, int R){
if(L+1==R){
INT x = max(0ll, a[L]);
suf[u].push_back(x);
pr... | C++ | 376b293013562d5e004411f42082ce5c | 216cad84096817406eb92c00860582e8 | 2,500 | PASSED |
#include<bits/stdc++.h>
#define ls (u << 1)
#define rs (ls | 1)
#define mid (L + R >> 1)
using namespace std;
using INT = long long;
const int NN = 3e5 + 10;
INT A[NN], sum[4*NN];
vector <INT> mx[4*NN], pre[4*NN], suf[4*NN];
void push_up(int u, int L, int R){
sum[u] = sum[ls] + sum[rs];
for(int i = 0; i < mx[ls].siz... | C++ | 376b293013562d5e004411f42082ce5c | e8a77e598fc1c4c0b520122ad40ceda4 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int K = 18;
#define ls (u<<1)
#define rs (ls|1)
#define mid (L+R>>1)
struct node
{
long long sum, pref, suff, ans;
node(int x)
{
sum = x;
pref = suff = ans = max(x, 0);
}
node() {};
};
node push_up (const node& l, const node&... | C++ | 376b293013562d5e004411f42082ce5c | f29fa8edce94a875582495b9e88bd713 | 2,500 | PASSED |
#include<bits/stdc++.h>
#define NN 600100
#define ls (u << 1)
#define rs (ls | 1)
using namespace std;
using INT=long long;
int a[NN];
vector <INT> dp[NN], Lp[NN], Rp[NN];
INT sum[NN];
void solve(int u, int L, int R) {
if(L == R) {
int x = max(0, a[L]);
dp[u].push_back(x); Lp[u].push_back(x);
Rp[u].push_back(... | C++ | 376b293013562d5e004411f42082ce5c | 9a05e43377efede292ed3e5c86269be6 | 2,500 | PASSED |
// LUOGU_RID: 92762940
#include<iostream>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll n;
struct node{
ll ml,mr,m,s;
node(){}
node(ll _ml,ll _mr,ll _m,ll _s):
ml(_ml),mr(_mr),m(_m),s(_s){}
void init(){
cin>>s;
if(s>0){
ml=mr=m=s;
}
}
node operator +(node &a){
... | C++ | 376b293013562d5e004411f42082ce5c | 09bcc6d5c41afa5e28be8cf4655f954f | 2,500 | PASSED |
#include<iostream>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll n;
struct node{
ll ml,mr,m,s;
node(){}
node(ll _ml,ll _mr,ll _m,ll _s):
ml(_ml),mr(_mr),m(_m),s(_s){}
void init(){
cin>>s;
if(s>0){
ml=mr=m=s;
}
}
node operator +(node &a){
return node(
max(m... | C++ | 376b293013562d5e004411f42082ce5c | c1cea149370dba405792a0cea8744345 | 2,500 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#inclu... | C++ | 376b293013562d5e004411f42082ce5c | b7f59a574b4ab25634a993a34d8a9bb4 | 2,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define nd second
#define st first
#define lb(x) ((x) & (-(x)))
#define b(x) ((x) / Sqn + 1)
#define ppc(x) (__builtin_popcount(x))
#define brekp cout<<"OK"<<endl
#define GetMid int mid = (l + r) / 2
#define ls in * 2
#define rs in * 2 + 1
#define rnd() (abs((ll)... | C++ | 376b293013562d5e004411f42082ce5c | 5a6091ac96c17c3f15125ad2d6d06a09 | 2,500 | PASSED |
import java.util.*;
import java.io.*;
public class Main {
static FastScanner fs = new FastScanner();
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder("");
public static void main(String[] args) {
int t = fs.nextInt();
for (int... | Java | f9cf1a6971a7003078b63195198e5a51 | c224cf72d8095e3af1d74aac88029ec1 | 1,700 | PASSED |
// package c1608;
import java.io.File;
import java.lang.invoke.MethodHandles;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Random;
import java.util.Scanner;
//
// Codeforces Round 2021-12-11 02:05
// C. Game ... | Java | f9cf1a6971a7003078b63195198e5a51 | 6ef529d9cc112869cb93e7600678286c | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class gotoJapan {
public static void main(String[] args) throws java.lang.Exception {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream)... | Java | f9cf1a6971a7003078b63195198e5a51 | 2dd40488f69cabd482587044c817b4af | 1,700 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.Writer;
imp... | Java | f9cf1a6971a7003078b63195198e5a51 | 4a021d78d28c84af2077f79a8b4e9140 | 1,700 | PASSED |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main {
ArrayList<Integer>[] graph;
HashSet<Integer> set;
void solve() {
int n = in.nextInt();
int[] a = array(n, 1);
int[] b = array(n, 1);
Integer[] indexA = sort(a);
Integer[] inde... | Java | f9cf1a6971a7003078b63195198e5a51 | fa0c3de732b0669092d8d0861c2900bf | 1,700 | PASSED |
import java.util.*;
import java.io.*;
import java.math.*;
import java.sql.Array;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.SQLIntegrityConstraintViolationException;
public class Main {
private static class MyScanner {
private static final int BUF_SIZE = 2048;... | Java | f9cf1a6971a7003078b63195198e5a51 | 38e1f6d3a48b8b4b576de850a45e7ead | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class CodeForces{
/*-------------------------------------------EDITING CODE STARTS HERE-------------------------------------------*/
public static void main(String[] args) throws IOException{
openIO();
int testCase = 1;
testCase = sc.nextInt... | Java | f9cf1a6971a7003078b63195198e5a51 | 07eda208887efdcf568cc771e0aea33b | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class CodeForces{
/*-------------------------------------------EDITING CODE STARTS HERE-------------------------------------------*/
public static void main(String[] args) throws IOException{
openIO();
int testCase = 1;
testCase = sc.nextInt... | Java | f9cf1a6971a7003078b63195198e5a51 | 32af8a1087201572f78ec9304b891a7b | 1,700 | PASSED |
/*
Rating: 1367
Date: 24-01-2022
Time: 17-11-22
Author: Kartik Papney
Linkedin: https://www.linkedin.com/in/kartik-papney-4951161a6/
Leetcode: https://leetcode.com/kartikpapney/
Codechef: https://www.codechef.com/users/kartikpapney
*/
import java.util.*;
import java.io.BufferedRe... | Java | f9cf1a6971a7003078b63195198e5a51 | 237508f6878c959be33ed6e351e775aa | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class GameMaster {
static int p;
static boolean map1on;
public static void main(String[] args) throws Exception {
CustomScanner sc = new CustomScanner();
CustomPrinter cp = new CustomPrinter();
int T = sc.nextInt();
... | Java | f9cf1a6971a7003078b63195198e5a51 | b98e58305e2f391ae5e448062712f387 | 1,700 | PASSED |
// LUOGU_RID: 90674838
// LUOGU_RID: 90674682
#include <bits/stdc++.h>
#define mod 998244353
using namespace std;
int jc[200005],pomod[200005];
int n;
char ch[200005][2];
int ans;
int cnt,sum1,sum2;
int cnt1,cnt2;
int power(int x,int k)
{
int ans=1;
while(k)
{
if(k%2)ans=1ll*ans*x%mod;
x=1ll*x*x%... | C++ | 3858151e51f6c97abe8904628b70ad7f | 261c20e4933d4d9d9774b5fc32f0c9ab | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=2e5+5;
const int Mod=998244353;
int n,ans,cnt,s1,s2,cnt1,cnt2,mul[N],inv[N];
char s[N][5];
int qpow(int x,int k)
{ int res=1;
while(k)
{ if(k&1)res=1ll*res*x%Mod;
x=1ll*x*x%Mod;
k>>=1;
}
return... | C++ | 3858151e51f6c97abe8904628b70ad7f | 4774587be730cc0c7f427d9d8af14522 | 2,400 | PASSED |
// LUOGU_RID: 90673387
#include <bits/stdc++.h>
#define mod 998244353
using namespace std;
int jc[200005],pomod[200005];
int n;
char ch[200005][2];
int ans;
int cnt,sum1,sum2;
int cnt1,cnt2;
int power(int x,int k)
{
int ans=1;
while(k)
{
if(k%2)ans=1ll*ans*x%mod;
x=1ll*x*x%mod;
k/=2;
}
retu... | C++ | 3858151e51f6c97abe8904628b70ad7f | 6813d23ea8a7a3fbd21cdf0760ef02fd | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=2e5+5;
const int Mod=998244353;
int n,ans,cnt,s1,s2,cnt1,cnt2,mul[N],inv[N];
char s[N][5];
int qpow(int x,int k)
{ int res=1;
while(k)
{ if(k&1)res=1ll*res*x%Mod;
x=1ll*x*x%Mod;
k>>=1;
}
return... | C++ | 3858151e51f6c97abe8904628b70ad7f | 1b7f9a0f5fb692a384f07ed982aec1db | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=2e5+5;
const int Mod=998244353;
int n,ans,cnt,s1,s2,cnt1,cnt2,mul[N],inv[N];
char s[N][5];
int qpow(int x,int k)
{ int res=1;
while(k)
{ if(k&1)res=1ll*res*x%Mod;
x=1ll*x*x%Mod;
k>>=1;
}
return... | C++ | 3858151e51f6c97abe8904628b70ad7f | 4393bd8b726b909fff9a61e2ba0546df | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=2e5+5;
const int Mod=998244353;
int n,ans,cnt,s1,s2,cnt1,cnt2,mul[N],inv[N];
char s[N][5];
int qpow(int x,int k)
{ int res=1;
while(k)
{ if(k&1)res=1ll*res*x%Mod;
x=1ll*x*x%Mod;
k>>=1;
}
return... | C++ | 3858151e51f6c97abe8904628b70ad7f | 2a34cc5ef073f7dc267159c5976b5477 | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=2e5+5;
const int Mod=998244353;
int n,ans,cnt,s1,s2,cnt1,cnt2,mul[N],inv[N];
char s[N][5];
int qpow(int x,int k)
{
int res=1;
while(k)
{
if(k%2)res=1ll*res*x%Mod;
x=1ll*x*x%Mod;
k/=2;
}
re... | C++ | 3858151e51f6c97abe8904628b70ad7f | fa2c4562ff35a6489f8aba1a028158ff | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=2e5+5;
const int Mod=998244353;
int n,ans,cnt,s1,s2,cnt1,cnt2,mul[N],inv[N];
char s[N][5];
int qpow(int x,int k)
{
int res=1;
while(k)
{
if(k&1)res=1ll*res*x%Mod;
x=1ll*x*x%Mod;
k>>=1;
}
r... | C++ | 3858151e51f6c97abe8904628b70ad7f | ba6450b77a05f116c736f376c7df7edd | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;const int N=2e5+5;const int Mod=998244353;int n,ans,cnt,s1,s2,cnt1,cnt2,mul[N],inv[N];char s[N][5];int qpow(int x,int k){int res=1;while(k){if(k&1)res=1ll*res*x%Mod;x=1ll*x*x%Mod;k>>=1;}return res;}int C(int x,int y){return 1l... | C++ | 3858151e51f6c97abe8904628b70ad7f | 8f47c1e093980f413592273176bd16c3 | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=2e5+5;
const int Mod=998244353;
int n,ans,cnt,s1,s2,cnt1,cnt2,mul[N],inv[N];
char s[N][5];
int qpow(int x,int k)
{ int res=1;
while(k)
{ if(k&1)res=1ll*res*x%Mod;
x=1ll*x*x%Mod;
k>>=1;
}
return... | C++ | 3858151e51f6c97abe8904628b70ad7f | 7d6220ceba893dad4e6afc734f1796b1 | 2,400 | PASSED |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <queue>
#include <cstring>
#include <stdlib.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define debug(x) cout<<#x<<": "<<x<<endl;
using namespac... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | 51045e867196727b1a3a7a4aee8111a2 | 1,200 | PASSED |
#include<iostream>
#include<algorithm>
#include<vector>
#include<math.h>
#include<queue>
#include<stack>
#include<string.h>
#define for0(x,n) for(int x=0;x<n;x++)
#define for1(x,n) for(int x=1;x<=n;x++)
using namespace std;
typedef long long ll;//long long
typedef pair<double,double>PDD;
typedef pair<int,in... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | 5c899d50bef6f82a6d69f80037f5a3ee | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long li;
const int N=200005;
int n,d,a[N],cnt[N];
string s;
int main(){
int t;
cin>>t;
while(t--){
int a,b;
cin>>n>>a>>b;
if(abs(a-b)>1||a+b>n-2){
cout<<-1<<"\n";
continue;
}
... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | 4545cbfa6d4844d944ffb1118c37c1f0 | 1,200 | PASSED |
/*वक्रतुण्ड महाकाय सूर्यकोटि समप्रभ |
निर्विघ्नं कुरु मे देव सर्वकार्येषु सर्वदा ||*/
//जय श्री राम
//हर हर महादेव
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define endp "\n"
#define sp " "
#define yes "YES\n"
#define no "NO\n"
#define mo 1000000007
using nam... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | d041e15141cace4b04a47e5167012b6f | 1,200 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
for(int k=0;k<t;k++)
{
long long n,a,b;
cin>>n>>a>>b;
long long arr[n];
for(long long i=0;i<n;i++)
{
arr[i]=i+1;
}
if(a+b>n-2 || a-b>1 || b-a>1)
... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | b8ca64955a4b1cb3166c1a13bedaec3d | 1,200 | PASSED |
// Problem: B. Build the Permutation
// Contest: Codeforces - Codeforces Round #758 (Div.1 + Div. 2)
// URL: https://codeforces.com/contest/1608/problem/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
#define pb... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | 2a71fe996d310e9b00bd8263fbee9baf | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,a,b;
cin>>n>>a>>b;
int rest=a+b;
//rest+=2;
//int baki=n-rest;
int take=n;
if(n%2==0)
{
take=(n/2)-1;
}
... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | c6a18af34d0d22e16b76f6b521a10cb2 | 1,200 | PASSED |
#include<bits/stdc++.h>
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
vector<int>buildPeak(int p, int v,int n)
{
vector<int>ans(n);
vector<int>temp(n);
for(int i=0;i<(n);i++)
{
temp[i]=i+1;
//ans[i]=i+1;
}
if(n==2)
{
ans[0]=1;
ans[1]=... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | 06a6c167dabde924b4045030811433af | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef LOCAL
void debug_print(string s) {
cerr << "\"" << s << "\"";
}
void debug_print(const char* s) {
debug_print((string)s);
}
void debug_print(bool val) {
cerr << (val ? "true" : "false");
}
void debug_print(i... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | 3ae8c648add05e4c2a348ded0db8a027 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define INF 1e18
#define mod 1000000007
void solve()
{
int n,a,b;
std::cin>>n>>a>>b;
if(a==0 and b==0)
{
for(int i=1;i<=n;i++)
std::cout<<i<<" ";
std::cout<<"\n";
return;
}
if(abs(a-b)<=1 and n>=a+b+2)
{
if(a... | C++ | 2fdbf033e83d7c17841f640fe1fc0e55 | 51597285efbdedb2815c8535b1109578 | 1,200 | PASSED |
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
int nums[n];
for (int i = 0; i<n; i++)
{
cin>>nums[i];
int j = nums[i];
int maxx[j];
int l =maxx[0] = 3;
for (int k = 0; k<j; k++)
{
maxx[k+1] = maxx[k] + 1;
cout<<maxx[k] <<" ";
}
cout<<endl;
}
return 0;
}
| C++ | 76bfced1345f871832957a65e2a660f8 | 769b07f836012377d74abbabed70fd62 | 800 | PASSED |
#include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
int nums[n];
for (int i = 0; i<n; i++)
{
cin>>nums[i];
int j = nums[i];
int maxx[j];
int l =maxx[0] = 2;
for (int k = 0; k<j; k++)
{
maxx[k+1] = maxx[k]+ 1;
cout<<maxx[k] <<" ";
}
cout<<endl;
}
return 0;
}
| C++ | 76bfced1345f871832957a65e2a660f8 | d67ebfd6928b51747460cd666fc6c4a7 | 800 | PASSED |
#include<bits/stdc++.h>
#define nl '\n'
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define SIU ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
const ll md = 1e9+7;
const ll MAXN = 1e3+1;
using namespace std;
void solve() {
ll n;
... | C++ | 76bfced1345f871832957a65e2a660f8 | 6e9cc7fae5fe4ccbaa34cf8108b62920 | 800 | PASSED |
#include<iostream>
using namespace std;
// AUTHOR
// IZAZ ULLAH
//---------------------------------------------------------
#define max3(a,b,c) max(a,max(b,c)) //
#define max4(a,b,c,d) max(max(a,b),max(c,d)) //
#define min3(a,b,c) min(min(a,b),c) //
#d... | C++ | 76bfced1345f871832957a65e2a660f8 | 6222641afe057824e22d58889f1482cd | 800 | PASSED |
#include<iostream>
using namespace std;
// AUTHOR
// IZAZ ULLAH
//---------------------------------------------------------
#define max3(a,b,c) max(a,max(b,c)) //
#define max4(a,b,c,d) max(max(a,b),max(c,d)) //
#define min3(a,b,c) min(min(a,b),c) //
#d... | C++ | 76bfced1345f871832957a65e2a660f8 | bb2bcc70b8ce97ec454fbc512c332ef6 | 800 | PASSED |
#include<iostream>
using namespace std;
// AUTHOR
// IZAZ ULLAH
//---------------------------------------------------------
#define max3(a,b,c) max(a,max(b,c)) //
#define max4(a,b,c,d) max(max(a,b),max(c,d)) //
#define min3(a,b,c) min(min(a,b),c) //
#d... | C++ | 76bfced1345f871832957a65e2a660f8 | eea687c27e9e22fb495f9df6dff256a1 | 800 | PASSED |
#include <bits/stdc++.h>
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
using namespace std;
const ll MAX = 1e3;
const ll MOD = 123456789;
const ll INF = 1e9;
ll n, k, m;
ll a[MAX][MAX];
ll dp[MAX];
void solve(){
cin >> n;
if (n == 1) cout << 1;
else for (ll... | C++ | 76bfced1345f871832957a65e2a660f8 | 98398b67784792f9e8c67359c0bacfb8 | 800 | PASSED |
#include <bits/stdc++.h>
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
using namespace std;
const ll MAX = 1e4 + 5;
const ll MOD = 123456789;
const ll INF = 1e9;
ll n, k, m;
// ll a[MAX][MAX];
// ll dp[MAX];
void solve(){
cin >> n;
if (n == 1) cout << 1;
el... | C++ | 76bfced1345f871832957a65e2a660f8 | dd78b4be0e16c51e5e4bb6c8c38d1074 | 800 | PASSED |
# include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long
#define lmax LLONG_MIN
#define lmin LLONG_MAX
#define mod 100000007
// res=res*(N-r+i)/i; --->>>>>to calculate ncr //
void solve()
{
int n;
int N=100000;
cin>>n;
for(int i=2;i<=n+1;i++)
{
cout<... | C++ | 76bfced1345f871832957a65e2a660f8 | 3af0ddeb31e9f2d52eb37ce160f25e29 | 800 | PASSED |
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
************************************... | C++ | 76bfced1345f871832957a65e2a660f8 | bc2a430bf13d64e436f73624ef30441b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 998244353;
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 pw(int a, int b) {
... | C++ | 3c29bece25011227d753a369016664d6 | 366f513afbe93d5934685140a7e09dda | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 998244353;
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 pw(int a, int b) {
... | C++ | 3c29bece25011227d753a369016664d6 | b9471e97ef4fc6f93deba2648a92e1bc | 3,200 | PASSED |
#include <algorithm>
#include <cstring>
#include <cstdio>
#define ll long long
#define mod 998244353
int qpow(int x, int p, int m){
int ans = 1, base = x;
while (p){
if (p & 1) ans = 1ll * ans * base % m;
base = 1ll * base * base % m;
p >>= 1;
}
return ans % m;
}
using namespace std;
int n,... | C++ | 3c29bece25011227d753a369016664d6 | 9086396cf77f2a679d92c3079cf44cae | 3,200 | PASSED |
#include <algorithm>
#include <cstring>
#include <cstdio>
#define ll long long
#define mod 998244353
int qpow(int x, int p, int m){
int ans = 1, base = x;
while (p){
if (p & 1) ans = 1ll * ans * base % m;
base = 1ll * base * base % m;
p >>= 1;
}
return ans % m;
}
using namespace std;
int n,... | C++ | 3c29bece25011227d753a369016664d6 | 4b4776dd48954b5cb0b609555be50599 | 3,200 | PASSED |
// LUOGU_RID: 95151760
#pragma GCC target("sse3", "sse2", "sse")
#pragma GCC target("avx", "sse4", "sse4.1", "sse4.2", "ssse3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimi... | C++ | 3c29bece25011227d753a369016664d6 | 46d4c95cefb8c5474375e29fdc48a609 | 3,200 | PASSED |
#pragma GCC target("sse3", "sse2", "sse")
#pragma GCC target("avx", "sse4", "sse4.1", "sse4.2", "ssse3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")... | C++ | 3c29bece25011227d753a369016664d6 | d475a225f423f0d83078b674034bff0c | 3,200 | PASSED |
#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
namespace shik{
const int N=2333,mod=998244353;
int f[2][N][N],s[N<<1][N],fra[N],ifra[N],b[N],mi[N<<1],ma[N<<1],l[N],r[N];
inline char gc()
{
static char buf[1<<16],*S,*T;
if(S==T)
{
T=(S=buf)+fread(buf,1,1<<16,stdin)... | C++ | 3c29bece25011227d753a369016664d6 | 569a76a5c7da2307619e905c43b74fa2 | 3,200 | PASSED |
#include<iostream>
#include<cstring>
#include<cstdio>
#define ll long long
using namespace std;
namespace shik{
const int N=2333,mod=998244353;
int f[2][N][N],s[N<<1][N],fra[N],ifra[N],b[N],mi[N<<1],ma[N<<1],l[N],r[N];
inline char gc()
{
static char buf[1<<16],*S,*T;
if(S==T)
{
T=(S=buf)+fread... | C++ | 3c29bece25011227d753a369016664d6 | 18b01a1bebd6ba2a849d4e6dd2b6a5d5 | 3,200 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,fma")
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using f80 = long double;
template <class U, class V = U> using P = pair<U, V>;
using pii = P<int>;
using ll = i64;
using ld = f80;
... | C++ | 3c29bece25011227d753a369016664d6 | e5e7dc8675bc25134a450a49c311cdc9 | 3,200 | PASSED |
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,fma")
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using f80 = long double;
template <class U, class V = U> using P = pair<U, V>;
using pii = P<int>;
using ll = i64;
using ld = f80;
... | C++ | 3c29bece25011227d753a369016664d6 | 9b80c2f4b4d59d4702b099c2461b7c47 | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool home = true;
struct Cell {
int x;
int y;
int type;
};
bool cmp1(Cell a, Cell b) {
return a.x < b.x;
}
bool cmp2(Cell a, Cell b) {
return a.y < b.y;
}
const int N = (int) 1e5 + 7;
int n;
bool okLR(vector<C... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | d7c75428eae90cc3a3b24ebce86974e5 | 2,800 | PASSED |
/*
* File created on 12/11/2021 at 16:51:26.
* Link to problem:
* Description:
* Time complexity: O()
* Space complexity: O()
* Status: ---
* Copyright: Ⓒ 2021 Francois Vogel
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functi... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | 1c014a5100c39f0d783cc60c9169bd9c | 2,800 | PASSED |
//#pragma GCC optimize "tree-vectorize"
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <array>
#include <cstdio>
struct UnsafeInput... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | eade970e8131f82c1002c6eaa8b353f5 | 2,800 | PASSED |
//#pragma GCC optimize "tree-vectorize"
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <array>
#include <cstdio>
struct UnsafeInput... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | 46efb435685936ef1ac6df5549a1f153 | 2,800 | PASSED |
//#pragma GCC optimize "tree-vectorize"
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <array>
#include <cstdio>
struct UnsafeInput... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | 08d7886f4cec0d0301d1cb66d417d405 | 2,800 | PASSED |
//#pragma GCC optimize "tree-vectorize"
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <array>
using namespace std;
bool online_j... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | 4385c1df839e0fcb0bcbbbe2b89e56a1 | 2,800 | PASSED |
//#pragma GCC optimize "tree-vectorize"
#pragma GCC target "movbe,mmx,sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,avx,avx2,aes,pclmul,fsgsbase,rdrnd,fma,bmi,bmi2,f16c,rdseed,clflushopt,xsavec,xsaves,adx,prfchw,lzcnt,abm"
#include <algorithm>
#include <iostream>
#include <array>
using namespace std;
bool online_j... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | 3f8d3f5b5733f49cc00b3d655c732665 | 2,800 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <queue>
#include <stack>
#include <random>
#include <numeric>
#include <map>
#include <complex>
//#include <ext/rope>
//#include <ext/pb_ds/assoc_container.hpp>
//#inc... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | 3d10907e65f209fb235d3645445d120a | 2,800 | PASSED |
#include<bits/stdc++.h>
#define ls i<<1
#define rs i<<1|1
#define fi first
#define se second
#define min amin
#define max amax
#define pb push_back
using namespace std;
using ll=long long;
using pii=array<int,2>;
const int N=2E5+10;
const int inf=1<<30;
template<typename T>T min(T x){return x;}
template<t... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | 72dec0092197ef09d9baeffbb1e1d314 | 2,800 | PASSED |
#include<bits/stdc++.h>
#define ls i<<1
#define rs i<<1|1
#define fi first
#define se second
#define min amin
#define max amax
#define pb push_back
using namespace std;
using ll=long long;
using pii=array<int,2>;
const int N=2E5+10;
const int inf=1<<30;
template<typename T>T min(T x){return x;}
template<t... | C++ | 1e9e504e6a2a9cef8d9946aae512a388 | df3344552ae2fe4b93839694bd2e137a | 2,800 | PASSED |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define rep(i, a, b) for(int i = (a); i <= int(b); i ++)
#define per(i, a, b) for(int i = (a); i >= int(b); i --)
#define fi ... | C++ | b2747a9ce21ac43085ce4c6a9f5fa417 | cd3b03187ddad88cc0295259e89950b1 | 3,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.