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>
#define For(i,x,y) for (int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (int i=(x);i<(y);i++)
#define Dow(i,x,y) for (int i=(x);i>=(y);i--)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) ... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | f923d1d562762b97506691e2c6b6e9bd | 3,500 | PASSED |
#include<bits/stdc++.h>
#define I inline
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(x) ((x)>0?(x):-(x))
#define re register
#define RI re int
#define ll long long
#define db double
#define lb long db
#define N ((1<<19)+5)
#define M (100+5)
#define K (200000+5)
#define mod 99824435... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | a3a7730d612a6289e85a19aba7416f1f | 3,500 | PASSED |
#include<bits/stdc++.h>
#define I inline
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(x) ((x)>0?(x):-(x))
#define re register
#define RI re int
#define ll long long
#define db double
#define lb long db
#define N ((1<<19)+5)
#define M (100+5)
#define K (200000+5)
#define... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | 48e7681bf1c93fc962c9422162762ee2 | 3,500 | PASSED |
#include<bits/stdc++.h>
#define I inline
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(x) ((x)>0?(x):-(x))
#define re register
#define RI re int
#define ll long long
#define db double
#define lb long db
#define N ((1<<19)+5)
#define M (100+5)
#define mod 998244353
#defin... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | d343dd2f15a28230db6766dbcf254e88 | 3,500 | PASSED |
//.....
#pragma GCC optimize("Ofast")
#include <cstdio>
#include <cstring>
#include <cassert>
#include <algorithm>
const int N = 1e6 + 10, mod = 998244353; typedef long long ll;
int F[N], G[N], H[N], A[N], B[N], m, lim, rev[N];
inline int ksm(int a, int b)
{
int ret = 1;
while (b)
{
if... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | 92257f16040c0f29d7d5a9750d9b0fee | 3,500 | PASSED |
#pragma GCC optimize("Ofast")
#include <cstdio>
#include <cstring>
#include <cassert>
#include <algorithm>
const int N = 1e6 + 10, mod = 998244353; typedef long long ll;
int F[N], G[N], H[N], A[N], B[N], m, lim, rev[N];
inline int ksm(int a, int b)
{
int ret = 1;
while (b)
{
if (b & 1) ... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | e5f50996e6584256580b12b89240d03c | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
inline ll read(){
ll x=0;
bool f=0;
char c=getchar();
while(!isdigit(c)){
if(c=='-') f=1;
c=getchar();
}
while(isdigit(c)){
x=x*10+c-'0';
c=getchar();
}
return f?-x:x;
}
const ll mod=998244353,g=3,invg=332748118;
ll ksm(l... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | 8b1a970337a6f870c612d357e42f03a9 | 3,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
inline ll read(){
ll x=0;
bool f=0;
char c=getchar();
while(!isdigit(c)){
if(c=='-') f=1;
c=getchar();
}
while(isdigit(c)){
x=x*10+c-'0';
c=getchar();
}
return f?-x:x;
}
const ll mod=998244353,g=3,invg=332748118;
ll ksm(l... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | 5c144d99f580548267d185f03054da62 | 3,500 | PASSED |
#include <stdio.h>
#define md 998244353
#define MN 524288
int w0[MN+1],w1[MN+1];
int ksm(int a,int b)
{
int jg=1;
while(b>0)
{
if(b&1)jg=1ll*jg*a%md;
a=1ll*a*a%md;b/=2;
}
return jg;
}
void getww(int n)
{
for(int h=2;h<=n;h<<=1)
{
int wn=ksm(3,(md-1)/h);
for(int i=0,w=... | C++ | 42c82423da85da63dbf0ac108db4e2d9 | ea4ce2b5fe97cbc2551dc5f4c217d883 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = 1000000007;
inline ll _p(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1) res = res * x % MOD;
x = (x * x) % MOD;
y >>= 1;
}
return res;
}
inline ll inv(ll x) { return _p(x, MOD - 2); }
void add(ll& a, ll& b,... | C++ | 81efc64bba6d5a667e453260b83640e9 | 5ffb0f28b2616dcbd059fb48be78c6fe | 2,300 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
//
const int MOD = 1000000007;
inline ll _p(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1) res = res * x % MOD;
x = (x * x) % MOD;
y >>= 1;
}
return res;
}
inline ll inv(ll x) { return _p(x, MOD - 2); }
void ad... | C++ | 81efc64bba6d5a667e453260b83640e9 | bf920e3e2ba59178700277dcb43ea529 | 2,300 | PASSED |
// basic {{{
#ifdef LOCAL
#include "/Users/ahmed/Projects/public/problems/precompile/bits-debug/stdc++.h"
#else
#include "bits/stdc++.h"
#endif
using namespace std;
template <typename T> void set_max(T& a, T b) {
a = max(a, b);
}
template <typename T> void set_min(T& a, T b) {
a = min(a, b);
}
temp... | C++ | 81efc64bba6d5a667e453260b83640e9 | a346e78f515cc4d1b621fb970e3d91a7 | 2,300 | PASSED |
// basic {{{
#ifdef LOCAL
#include "/Users/ahmed/Projects/public/problems/precompile/bits-debug/stdc++.h"
#else
#include "bits/stdc++.h"
#endif
using namespace std;
template <typename T> void set_max(T& a, T b) {
a = max(a, b);
}
template <typename T> void set_min(T& a, T b) {
a = min(a, b);
}
temp... | C++ | 81efc64bba6d5a667e453260b83640e9 | 7e5ca7da79f5c110cb354366ed349081 | 2,300 | PASSED |
// basic {{{
#ifdef LOCAL
#include "/Users/ahmed/Projects/public/problems/precompile/bits-debug/stdc++.h"
#else
#include "bits/stdc++.h"
#endif
using namespace std;
template <typename T> void set_max(T& a, T b) {
a = max(a, b);
}
template <typename T> void set_min(T& a, T b) {
a = min(a, b);
}
temp... | C++ | 81efc64bba6d5a667e453260b83640e9 | 6227f05e047f2b704373e8995e954d38 | 2,300 | PASSED |
// basic {{{
#ifdef LOCAL
#include "/Users/ahmed/Projects/public/problems/precompile/bits-debug/stdc++.h"
#else
#include "bits/stdc++.h"
#endif
using namespace std;
template <typename T> void set_max(T& a, T b) {
a = max(a, b);
}
template <typename T> void set_min(T& a, T b) {
a = min(a, b);
}
temp... | C++ | 81efc64bba6d5a667e453260b83640e9 | 1eadd9349b26ae20fff6bdcb85d75d0c | 2,300 | PASSED |
#include <bits/stdc++.h>
#define debug(x) printf("x -> %d\n", x);
#define debug2(x, y) printf("x -> %d\ty -> %d\n", x, y);
#define GCD(a, b) {return b == 0 ? a : gcd(b, a % b);}
#define LL long long
#define DB double
using namespace std;
const DB EPS = 1e-6;
const LL MOD = 1e9 + 7;
const int INF = 0x3f3f... | C++ | 81efc64bba6d5a667e453260b83640e9 | 6994fbbd8051c8ccebd125028edddc7e | 2,300 | PASSED |
#include <bits/stdc++.h>
#define debug(x) printf("x -> %d\n", x);
#define debug2(x, y) printf("x -> %d\ty -> %d\n", x, y);
#define GCD(a, b) {return b == 0 ? a : gcd(b, a % b);}
#define LL long long
#define DB double
using namespace std;
const DB EPS = 1e-6;
const LL MOD = 1e9 + 7;
const int INF = 0x3f3f... | C++ | 81efc64bba6d5a667e453260b83640e9 | 324313cd5f1aefd7bc1e6366f5c2bcb4 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define re register int
#define PII pair<int,int>
#define x first
#define y second
#define cf int _; cin>> _; while(_--)
#define sf(x) scanf("%lld",&x)
#define sf2(x,y) scanf("%lld %lld",&x,&y)
#define pft(x) printf("%lld ",x)
#define pfn(x)... | C++ | 81efc64bba6d5a667e453260b83640e9 | 98d72704feee5784d460c4981dd088c4 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define lson (i<<1)
#define rson (i<<1|1)
#define repeat(i, s, n) for(int i = s; i <= n; ++i)
#define foreach(i,items) for(auto &i: items)
#define downrep(i, n, s) for(int i = n; i >= s; --i)
#define lowbit(x) (x&-x)
#define bzero(x) memset(x, 0, sizeof(x))
#defi... | C++ | 81efc64bba6d5a667e453260b83640e9 | fa1dffa2e2cc050ee2ae9f13cb62a3cf | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int f[200005],a[200005],n,lk[200005],b[200005];
int check(int x)
{
int i,j,flag=0,tmp=0,now;
for(i=1;i<=n;i++)
b[i]=a[i];
for(i=n;i>=3;i--)
{
if(b[i]<x) return 1;
now=min(a[i],b[i]-x)/3;
b[i]-=now*3;
b[i-1]+=now;
b[i-2]+=now*2;
}
if(b[1]<x||b[2]<x)
retu... | C++ | 895d5850e420a36ae3b5f0a50e359423 | 35827d9ef527efe9b9769705bbd19a46 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int S=2e5+5;
int h[S];
int s1[S];
int d,l,r,n,mid,ans;
int i,j,t,minshi;
bool cheak(int mid)
{
for(i=1;i<=n;i++)
s1[i]=h[i];
for(i=n;i>=3;i--)
{
if(s1[i]<mid)//若当前位置的值<mid(不符合要求)
return 0;
else
d=min(s1[i]-mid,h[i])/3;//题目描述
s1[i-1]+=d;
s... | C++ | 895d5850e420a36ae3b5f0a50e359423 | f8a9554d55deeb1360c90d206a63e558 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int S=2e5+5;
int h[S];
int s1[S];
int d,l,r,n,mid,ans;
int i,j,t,minshi;
bool cheak(int mid)
{
for(i=1;i<=n;i++)
s1[i]=h[i];
for(i=n;i>=3;i--)
{
if(s1[i]<mid)//若当前位置的值<mid(不符合要求)
return 0;
else
d=min(s1[i]-mid,h[i])/3;//题目描述
s1[i-1]+=d;
s... | C++ | 895d5850e420a36ae3b5f0a50e359423 | d4ab882fa95488b2644586ae36dadd11 | 1,600 | PASSED |
#include "bits/stdc++.h"
using namespace std;
const int N=200001;
int a[N],b[N],n,ans,f;
int main(){
int t;
scanf("%d",&t);
while (t--){
scanf("%d",&n);
for (int i = 1; i <=n ; ++i) scanf("%d",&a[i]);
int l=1,r=1e9;
while (l<r){
int m=l+r>>1;f=1;
... | C++ | 895d5850e420a36ae3b5f0a50e359423 | df49d5c4492ae51d505c1a6354fd5561 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,l,r,m,f,ans,a[200001],b[200001];
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
l=1;r=1e9;
while(l<=r){
int m=l+r>>1;f=1;
for(int i=1;i<=n;i++) b[i]=a[i];
for(int i=n;i>=3;i--){
if(b... | C++ | 895d5850e420a36ae3b5f0a50e359423 | 7149458bbad26aac81c46281fd05f7d4 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,l,r,m,f,ans,a[200001],b[200001];
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
l=1;r=1e9;
while(l<=r){
m=l+r>>1;f=1;
for(int i=1;i<=n;i++) b[i]=a[i];
for(int i=n;i>=3;i--){
if(b[i]>... | C++ | 895d5850e420a36ae3b5f0a50e359423 | 5e26eb0659d5a9be49cc715758a586e9 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,n,l,r,m,f,ans,a[200001],b[200001];
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
l=1;r=1e9;
while(l<=r){
m=l+r>>1;f=1;
for(int i=1;i<=n;i++) b[i]=a[i];
for(int i=n;i>=3;i--){
if(b[i]>... | C++ | 895d5850e420a36ae3b5f0a50e359423 | 212f145c41de5b2f58d9a906a8612a21 | 1,600 | PASSED |
#include<cstdio>
#include<algorithm>
using namespace std;
int _,n,i,l,r,m,f,ans,a[200001],b[200001];
int main(){
scanf("%d",&_);
while(_--){
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
l=1;r=1e9;
while(l<=r){
m=l+r>>1;f=1;
for(i=1;i<=n;i++)b[i]=a[i];
for(i=n;i>=3;i--){
if(b[... | C++ | 895d5850e420a36ae3b5f0a50e359423 | 4aae10840b5216588455ae624f0d02be | 1,600 | PASSED |
#include<cstdio>
#include<algorithm>
using namespace std;
int t,n,i,l,r,m,f,ans,a[200001],b[200001];
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
l=1;r=1e9;
while(l<=r){
m=l+r>>1;f=1;
for(i=1;i<=n;i++)b[i]=a[i];
for(i=n;i>=3;i--)if(b[i]>=m)b... | C++ | 895d5850e420a36ae3b5f0a50e359423 | b41b5459cb249c6c6cba6019c7746ca4 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define uint unsigned int
#define repFwd4(_Name,START,END,INC)for(int _Name=START;INC>0?i<END:i>END;_Name=_Name+INC)
#define repFwd1(END)repFwd4(i,0,END,1)
#define repFwd2(START,END)repFwd4(i,START,END,1)
#d... | C++ | 895d5850e420a36ae3b5f0a50e359423 | 495e572d5800e8d376a4cdff54e37563 | 1,600 | PASSED |
// LUOGU_RID: 93412194
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int>> PIII;
bool cmp(PII x,PII y)
{
return x.second<y.second;
}
void solve(){
int n;
cin>>n;
vector<PII> temp;
vector<PIII> ans;
for(int ... | C++ | eca433877ef3fbda198c5f2c95a359e7 | a62f1bd6f096f42e2a179aeb4e77972e | 1,100 | PASSED |
// LUOGU_RID: 93376166
#include<bits/stdc++.h>
using namespace std;
struct Test
{
int left,right,length,middle;
}test[3000];
bool com(Test a,Test b)
{
return a.length<b.length;
}
int main()
{
bool op[3000]={0};
int N,M;
cin>>N;
for(int i=0;i<N;i++)
{
cin>>M;
for(int j=1;j<=M;j++)
{
c... | C++ | eca433877ef3fbda198c5f2c95a359e7 | cc5d627a96fc285de730ad6b049e8b16 | 1,100 | PASSED |
// LUOGU_RID: 93218798
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
struct zu {
int l, r, len, num = 0;
};
zu a[1500];
int n;
bool cmp(zu a, zu b)
{
return a.len < b.len;
}
int main(void)
{
int time;
cin >> time;
while (time--)
{
bool p[1500] = { 0 };
... | C++ | eca433877ef3fbda198c5f2c95a359e7 | f163167231ec3e8602647c39160eea8a | 1,100 | PASSED |
// LUOGU_RID: 93218753
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
const int maxn = 1400;
int T, n, ans[maxn];
struct Node
{
int l, r, len, num = 0;
};
Node a[maxn];
bool cmp(Node a, Node b)
{
return a.len < b.len;
}
int main()
{
cin >> T;
while (T--)
{
bo... | C++ | eca433877ef3fbda198c5f2c95a359e7 | 70be5e1acffad214b5b564817991b775 | 1,100 | PASSED |
#include<iostream>
#include <cstdio>
using namespace std;
const int maxn=1e3+10;
int t,n;
int vis[maxn][maxn];
void fun(int l,int r){
vis[l][r]=0;
if (l==r) {
printf("%d %d %d\n",l,l,l);
return ;
}
if(vis[l+1][r]==1) {
printf("%d %d %d\n",l,r,l);
fun... | C++ | eca433877ef3fbda198c5f2c95a359e7 | ba6343ffa17ecc5adc22d00c7f5a8db1 | 1,100 | PASSED |
#include<iostream>
#include <cstdio>
using namespace std;
const int maxn=1e3+10;
int t,n;
int vis[maxn][maxn];
void fun(int l,int r){
vis[l][r]=0;
if (l==r) {
printf("%d %d %d\n",l,l,l);
return ;
}
if(vis[l+1][r]==1) {
printf("%d %d %d\n",l,r,l);
fun... | C++ | eca433877ef3fbda198c5f2c95a359e7 | 0c8c4efbe94d4f743ac9c83da17b5034 | 1,100 | PASSED |
#include<iostream>
#include<cstring>
using namespace std;
const int N= 1e3+10;
struct node
{
int x,y;
}arr[N];
int main()
{
int t;
cin>>t;
while(t--)
{
memset (arr,0,sizeof(arr));
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>arr[i].x>>arr[i].y;
}
for(int i=1;i<=n;i++)
{
... | C++ | eca433877ef3fbda198c5f2c95a359e7 | 414673e561df4eacf4189eeb73b19653 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<typename G>inline void read(G&x) {
x=0;G f=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') f=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+(ch&15),ch=getchar();
x*=f;
}
const int MAXN=1e3+5;
int t,n;
bool f[MAXN][... | C++ | eca433877ef3fbda198c5f2c95a359e7 | 63b987d87f5cd0eb31342e9b9342e1cd | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
int l,r,d;
}a[1001];
bool p[1001][1001];
void init() {
memset(p,0,sizeof(p));
cin>>n;
for (int i= 1; i <= n ; i ++ ) {
cin>>a[i].l>>a[i].r;
p[a[i].l][a[i].r]=1;
}
}
bool ok(int l,int r) {
if (r<l) return true;
if (l>r) return ... | C++ | eca433877ef3fbda198c5f2c95a359e7 | 8bd94e2a8dbff4f9f2dc0bb0639cd499 | 1,100 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int list[10000];
struct Pair{
int l;
int r;
};
void clear(){
memset(list, 0, 10000);
}
void put(Pair a){
int l = a.l;
int r = a.r;
for (int i = l; i <= r; i++)
list[i]++;
}
int getM(Pair a[], int n)... | C++ | eca433877ef3fbda198c5f2c95a359e7 | cd43edfc3fe33421b940571f7490bc72 | 1,100 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int t,n,m,cx,cy,c1x,c1y;
int main()
{
cin>>t;
while(t--)
{
cin>>n>>m>>cx>>cy>>c1x>>c1y;
if(cx==c1x || cy == c1y)
{
cout<<0<<endl;
continue;
}
int dx=1,dy=1,t=... | C++ | 6f819ce1d88d5211cd475a8673edba97 | 7bd7a710928498e8430aabab76760c2d | 800 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int t1;
int ans;
int main()
{
int t,n,m,cx,cy,c1x,c1y;
cin>>t;
while(t--)
{
t1++;
scanf("%d%d%d%d%d%d",&n,&m,&cx,&cy,&c1x,&c1y);
int dx=1,dy=1,t=0,f=0;
while(1)
{
int ... | C++ | 6f819ce1d88d5211cd475a8673edba97 | fb3b4b9460ea44db6bcfc6edfd298b0f | 800 | PASSED |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int t,n,m,cx,cy,c1x,c1y;
int main()
{
cin>>t;
while(t--)
{
cin>>n>>m>>cx>>cy>>c1x>>c1y;
if(cx==c1x || cy == c1y)
{
cout<<0<<endl;
continue;
}
int dx=1,dy=1,t=... | C++ | 6f819ce1d88d5211cd475a8673edba97 | d617dc44216a4763c4c6d14d69ffa26a | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m,x0,y0,x,y;
cin>>n>>m>>x0>>y0>>x>>y;
cout<<min(x>=x0?x-x0:2*n-x-x0,y>=y0?y-y0:2*m-y-y0)<<endl;
}
return 0;
} | C++ | 6f819ce1d88d5211cd475a8673edba97 | da4383f09bac26d8141bb5339c7b53fa | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "template/debug.h"
#else
#define dbg(args...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt;
scanf("%d", &tt);
while (tt--) {
int n, m;
scanf("%d %d", &n, &m);
int rb, cb, rd, cd;
scanf("%d %d %d %... | C++ | 6f819ce1d88d5211cd475a8673edba97 | ae10b9a258895049709f89c5d4c5bcd5 | 800 | PASSED |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<iostream>
using namespace std;
int main() {
int k,f1=1,f2=1;
int step = 0;
int a, b, a1, b1, a2, b2;//tu,jiqi,zangwu
scanf("%d",&k);
while (k--) {
scanf("%d%d%d%d%d%d",&a,&b,&a1,&b1,&a2,&b2);
if... | C++ | 6f819ce1d88d5211cd475a8673edba97 | d1d4124764c1c6ed4fd4610c1a70f938 | 800 | PASSED |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int dx=1,dy=1,res=0;
int n,m,x,y,xx,yy;
cin>>n>>m>>x>>y>>xx>>yy;
while(x!=xx&&y!=yy)
{
if(x==n) dx=-dx;
if(y==m) dy=-dy;
x=x+dx;
y=y+dy;
res++;
}
cout<<res<<endl;
}
}
| C++ | 6f819ce1d88d5211cd475a8673edba97 | a7ccf3781ee5eb15e8ec1efcb1d468f9 | 800 | PASSED |
#include <iostream>
using namespace std;
void solve(){
int n, m, rb, cb, rd, cd;
cin >> n >> m >> rb >> cb >> rd >> cd;
int dist1, dist2;
if(rd < rb){
dist1= n-rd+n-rb;
} else dist1=rd-rb;
if(cd < cb){
dist2= m-cd+m-cb;
} else dist2= cd-cb;
cout << min(dist1,dist2) << endl;
}
int main (){
int t;
cin >> ... | C++ | 6f819ce1d88d5211cd475a8673edba97 | bda8e218eb8c85f210939f4a70fb27a6 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long swap(long long a,long long b) {
long long tmp=a;
a=b;
b=tmp;
}
int main() {
long long n;
cin>>n;
for(long long i=0; i<n; i++) {
long long a1, a2, b1, b2, x1, x2, d1, d2;
cin>>a1>>a2>>b1>>b2>>d1>>d2;
x1=1;
x2=1;
long long dem=0;
for(long long j=0;... | C++ | 6f819ce1d88d5211cd475a8673edba97 | cefbefc4c4fc2c53a7e9a2e0b834e06c | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m,rr,rc,dr,dc;
cin>>n>>m>>rr>>rc>>dr>>dc;
// cout<<n<<" "<<m<<" "<<rr<<" "<<rc<<" "<<dr<<" "<<dc<<"\n";
int r=1,c=1,ts=0,f=1,lo=10;
while(f==1)
{
if(rr==dr || rc==dc)
{
f=0;
}
else
{
... | C++ | 6f819ce1d88d5211cd475a8673edba97 | e250f19fe2e3e53802051aca9100d88b | 800 | PASSED |
#include "bits/stdc++.h"
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
#define lcm(a,b) ((a*b)/(__gcd(a,b)))
... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | 728633c0b19247a647488f9468a07a8c | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 1010001
int n,k;
bool vis[N],dup[N];
char s[N];
vector<int>sk;
struct Node{int l,r;} node[N];
void get_order(int x)
{
if(node[x].l > 0) get_order(node[x].l);
sk.push_back(x);
if(node[x].r > 0) get_order(node[x].r);
}
vo... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | c9a7b514856e71b073cfce73ba958ae0 | 2,500 | PASSED |
#define rep(a, s, t) for(int a = s; a <= t; a++)
#include<bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5, M = 2e3 + 5;
#define int long long
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch =... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | d0082c0f63e5eb03f8e2233679d54402 | 2,500 | PASSED |
/** Nguyen Anh Tu **/
#include <bits/stdc++.h>
#define maxn 200005
#define maxc 1000000007
#define MOD 1000000007
#define task ""
#define mp make_pair
#define pb push_back
#define ep emplace_back
#define F first
#define S second
#define pii pair<int,int>
#define ll long long
#define bit(p,x) ((x>>p) & 1)
... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | 448b61e60f0c9b76ed6f4a30873e672e | 2,500 | PASSED |
// oeis.org
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {c... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | 593f300cd4897a8f5662c6df0289c11f | 2,500 | 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>
using namespace std;
int n,k;
char s[200005];
... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | 54e406b18a75a06ec1cb15c0ebd9775f | 2,500 | PASSED |
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
#include <assert.h>
using namespace std;
typedef long long ll;
#define F first
#define S ... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | e7bba3a09503330643f591671be2b484 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define ll long long
#define ull unsigned ll
#define inf 0x3f3f3f3f
#define djq 1000000007
#define lowbit(x) (x&(-x))
const double alpha=0.73;
inline void file(){
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
}
char buf[1<<2... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | 414af0f0568ba35742db1d423719361b | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define ll long long
#define ull unsigned ll
#define inf 0x3f3f3f3f
#define djq 1000000007
#define lowbit(x) (x&(-x))
const double alpha=0.73;
inline void file(){
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
}
char buf[1<<2... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | a52f5d743762ea04161239f99e9ac0e0 | 2,500 | PASSED |
//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
... | C++ | 9463dd8f054eeaeeeeaec020932301c3 | 4386fecd0030ca7003396a971f98fad6 | 2,500 | PASSED |
/*
Author: Arnab Ghosh
Created: 06-09-2022 19:07:03
*/
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
/*-------------------------------DEFINE MACROS--... | C++ | 943ce230777aca97266c272bdb9b364c | 867459358c51bdede0967b856b8fa73c | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long t, n; cin >> t;
int aux;
vector<long long> a, ops(4);
while (t--)
{
cin >> n;
a.resize(n);
for(int i = 0; i < n; i++) cin >> a[i];
i... | C++ | 943ce230777aca97266c272bdb9b364c | b970a64b08d6fc8b248b34c15a317c14 | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define nl endl
#define st string
#define g " "
#define si s.insert
#define vi vector<int>
#define pb v.push_back
#define yes cout << "Yes" << endl;
#define Yes cout << "YES" << endl;
#define no cout << "No" << endl;
#define No cout << "NO" << endl;
#define te... | C++ | 943ce230777aca97266c272bdb9b364c | 2a6a6a80c8f5ecfb1daa463b7bc001de | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define nl endl
#define st string
#define g " "
#define si s.insert
#define vi vector<int>
#define pb v.push_back
#define yes cout << "Yes" << endl;
#define Yes cout << "YES" << endl;
#define no cout << "No" << endl;
#define No cout << "NO" << endl;
#define te... | C++ | 943ce230777aca97266c272bdb9b364c | 9188bd80333ff8d14c80bb6183932f7d | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define nl endl
#define st string
#define g " "
#define si s.insert
#define vi vector<int>
#define pb v.push_back
#define yes cout << "Yes" << endl;
#define Yes cout << "YES" << endl;
#define no cout << "No" << endl;
#define No cout << "NO" << endl;
#define te... | C++ | 943ce230777aca97266c272bdb9b364c | 1e4be474209d55cc152929076db3b66c | 900 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define nl endl
#define st string
#define g " "
#define si s.insert
#define vi vector<int>
#define pb v1.push_back
#define yes cout << "Yes" << endl;
#define Yes cout << "YES" << endl;
#define no cout << "No" << endl;
#define No cout << "NO" << endl;
#define t... | C++ | 943ce230777aca97266c272bdb9b364c | bf3f06928499f021d5937a9221d43614 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long int mod97 = 1000000007;
const long long int modg = 998244353;
#define int long long
#define ld long double
#define input(v)(n) for(int i=0;i<n;++i){int x; cin>>x; v.push_back(x);}
#define yes cout ... | C++ | 943ce230777aca97266c272bdb9b364c | 441df41cca0109b3724b26908bed46fe | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long int mod97 = 1000000007;
const long long int modg = 998244353;
#define int long long
#define ld long double
#define input(v)(n) for(int i=0;i<n;++i){int x; cin>>x; v.push_back(x);}
#define yes cout ... | C++ | 943ce230777aca97266c272bdb9b364c | a56d7d6b1b944678cb6f5aef9ccce7ae | 900 | PASSED |
/* Honesty and Transparency makes you vulnerable. Be Honest and Transparent anyway */
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vec;
#define short int si
#define space " "
#define upper(s) transform(s.be... | C++ | 943ce230777aca97266c272bdb9b364c | 9007f1e2229fa5bec89deb45e198f479 | 900 | PASSED |
// in the name of GOD
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 100, INF = 2e9;
int t, n;
int a[maxn];
void input() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
}
void solve() {
int ans = a[n] - a[1];
for (int i = 2; i < n; i++)... | C++ | 943ce230777aca97266c272bdb9b364c | 50049b5724afe0b25bcfdcd49363e3d1 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int c[200001];
vector<int> v[200000];
string s;
void solve()
{
// dau ma tu nhien suy nghi phuc tap vai l** ><
int n, dem = 0;
cin >> n;
n *= 2;
s = "";
cin >> s;
s = " " + s;
for(int i = 1; i <= n - 1; i++){
if(s[i] =... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | 5811bffe51a46bf54e943323f645d02f | 1,300 | PASSED |
//
// Created by Jun ping Lei on 2021-06-28.
//
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const long long INF = 1e17;
long long modexp(long long base, long long power) {
long long x = base;
long long ans = 1;
while (power) {
if (power % 2) {
a... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | 0ddae24825561dbb23ff1956af4e00d8 | 1,300 | PASSED |
// Problem: C. Jatayu's Balanced Bracket Sequence
// Contest: Codeforces - Codeforces Round #819 (Div. 1 + Div. 2) and Grimoire of Code Annual Contest 2022
// URL: https://codeforces.com/contest/1726/problem/C
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#i... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | 3b15f41fd0e5413945e9a412c26cc326 | 1,300 | PASSED |
#define fastcall __attribute__((optimize("-O3")))
#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")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimi... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | d28ac23570a808b0caae67f2a826383c | 1,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define ull unsinged long long
#define INF 0x3f3f3f3f
#define EPS 1e-8
#define For(a, b, c) for (int a = b; a <= c; ++ a)
#define Rev(a, b, c) for (int a = b; a >= c; -- a)
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#defi... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | 7b8a1fa69b398d2aef22caa8527ceed8 | 1,300 | PASSED |
#define fastcall __attribute__((optimize("-O3")))
#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")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimi... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | 73be3a6d3b3bae97a9ae9c90a607d10f | 1,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define ull unsinged long long
#define INF 0x3f3f3f3f
#define EPS 1e-8
#define For(a, b, c) for (int a = b; a <= c; ++ a)
#define Rev(a, b, c) for (int a = b; a >= c; -- a)
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | de2245d26b5fcdf93b86be1b6945567d | 1,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define ull unsinged long long
#define INF 0x3f3f3f3f
#define EPS 1e-8
#define For(a, b, c) for (int a = b; a <= c; ++ a)
#define Rev(a, b, c) for (int a = b; a >= c; -- a)
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | 0ce216ee606c05f665c745092cf1d610 | 1,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
#define ull unsinged long long
#define INF 0x3f3f3f3f
#define EPS 1e-8
#define For(a, b, c) for (int a = b; a <= c; ++ a)
#define Rev(a, b, c) for (int a = b; a >= c; -- a)
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | 2e72f3e0a9c1eedc94abe3bd60df4557 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define For(a, b) for(int i = a; i <= b; ++i)
#define RFor(a, b) for(int i = a; i >= b; --i)
#define Forr(a, b, c) for(int i = a; i <= b; i+=c)
#define FOr(a, b... | C++ | 6280a3373ab8fc34bb41fd98648019a6 | 9201d44e798e45a9507eb71bc802308f | 1,300 | PASSED |
#include<iostream>
#include<map>
#include<set>
#include<unordered_map>
#include<queue>
#include<string>
#include<math.h>
#include<cstring>
#include<bitset>
#include<math.h>
#include<vector>
#include<numeric>
#include<functional>
#include<stack>
#define ll long long
#define ull unsigned long long
#define... | C++ | ff66c68e8f53b0c051efe5db9428e91d | 645bf67d4c714406e8ee9f334973bb88 | 2,000 | PASSED |
#include<iostream>
#include<map>
#include<set>
#include<unordered_map>
#include<queue>
#include<string>
#include<math.h>
#include<cstring>
#include<bitset>
#include<math.h>
#include<vector>
#include<numeric>
#include<functional>
#include<stack>
#define ll long long
#define ull unsigned long long
#define... | C++ | ff66c68e8f53b0c051efe5db9428e91d | 3564fcc5d598f1505ddf300d1618a751 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define rep(i, j, k) for(int i = j; i <= k;i++)
#define per(i, j, k) for (int i = j; i >= k;i--)
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) a.begin(),a.end()
#define lowbit... | C++ | ff66c68e8f53b0c051efe5db9428e91d | b55733d12840ec70a03d895bfb1a9113 | 2,000 | PASSED |
//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <... | C++ | ff66c68e8f53b0c051efe5db9428e91d | 33fc74c85bc9a03b55146022a457d407 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
double PI=3.14159265359;
const bool multi=0;
const int N=200007;
... | C++ | ff66c68e8f53b0c051efe5db9428e91d | 95fa304c586aa6be591384dfc7235c55 | 2,000 | PASSED |
//Harder, Better, Faster, Stronger (author: Mortelman)
#include <iostream>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <queue>
#include <string>
#include <deque>
#include <set>
#include <vector>
#define fs first
#define sc second
#define inf ... | C++ | ff66c68e8f53b0c051efe5db9428e91d | 77df477e76a658b1e0b215639d4fc23d | 2,000 | PASSED |
/*
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░█░░░░░░░░░░░░░░░░
░░░░░░░░░▀░░░░░█░░░░░░░▀░░░░░░░░
░░░░░░░░▀░▀░░░░█░░░░░█▀▀▀░░░░░░░
░░░░░░█░░░░░█░░█░░█░░█░░░░░░░░░░
░░░░░░▀▀▀▀▀▀▀░░▀▀▀▀▀▀▀▀▀▀░░░░░░░
░░░░░░░░░░░░░░░░░▀░▀░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
*/
#ifdef LLOC
#include "bits/gh.h"
#define debug(...... | C++ | ff66c68e8f53b0c051efe5db9428e91d | 805f985901e028b053865656f2ccb2f8 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int mxN=2e5+9;
int ok[mxN],ans[mxN],re[mxN];
int n,m;
typedef pair<int,int> ii;
vector<ii> a[mxN];
vector<ii> b;
void bfs(int s)
{
queue<int> q;
q.push(s);
while (q.size()) {
int top=q.front();
q.po... | C++ | ff66c68e8f53b0c051efe5db9428e91d | 1abd92a53225a9a07278998d923a6dce | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int mxN=2e5+9;
const int mxM=1e6+9;
int ok[mxN],re[mxN];
int ans[mxM];
int n,m;
typedef pair<int,int> ii;
vector<ii> a[mxN];
vector<ii> b;
void bfs(int s)
{
queue<int> q;
q.push(s);
while (q.size()) {
... | C++ | ff66c68e8f53b0c051efe5db9428e91d | dc8b0d0bcad88d702fae2badf0d80018 | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int mxN=2e5+9;
const int mxM=1e6+9;
int ok[mxN],re[mxN];
int ans[mxN];
int n,m;
typedef pair<int,int> ii;
vector<ii> a[mxN];
vector<ii> b;
void bfs(int s)
{
queue<int> q;
q.push(s);
ok[s]=1;
while (q.s... | C++ | ff66c68e8f53b0c051efe5db9428e91d | fc92406d38a4f15e77a1c7aeef66ec34 | 2,000 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while (t > 0)
{
long long n, m;
cin >> n >> m;
long long temp = m % n;
long long sum = m - m % n;
long long ave = m / n;
if (ave != 0)
{
if (temp % 2 ... | C++ | 041143f69ce9d00924ce8deb56b723c5 | 75cfdfc28c084f4b7a171fd408931c7c | 1,100 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int long long
int INF = 1e9;
int MOD = 1e9 + 7;
... | C++ | 041143f69ce9d00924ce8deb56b723c5 | dbc1ac88bd81aec746e5da298f593a6b | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
/*
inline int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0' && ch<='9')
x=x*10+ch-'0',ch=getchar();
re... | C++ | 041143f69ce9d00924ce8deb56b723c5 | d79e48c2d5f83b0328239b78612012ec | 1,100 | PASSED |
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "bits/stdc++.h"
using namespace std;
#define nhan43 ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define DEBUG(X) { auto _X = (X); cerr << "L" << __LINE__ << ": " << #X << " = " << (_X) <... | C++ | 041143f69ce9d00924ce8deb56b723c5 | 68daaabd7c190f4e0972f393f663b547 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll eps = 1e-9;
typedef vector<int>vi;
typedef vector<ll>vl;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define read(v,n) for(ll i=0;i<n;i++)cin>>v[i];
void solve()
{
ll n , m;
cin>>... | C++ | 041143f69ce9d00924ce8deb56b723c5 | 41222844414a40be7dfa06002d37d8bc | 1,100 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX = 200007;
const int MOD = 1000000007;
void solve(){
int n,m;cin>>n>>m;
if(n>m or (m%2==1 and n%2==0))cout<<"NO\n";
else if(n==1)cout<<"YES\n"<<m<<"\n";
else if(n&1){
cout<<"YES\n";
for (int i = 0; i <n-1... | C++ | 041143f69ce9d00924ce8deb56b723c5 | bbcadcc55db87886c7b4b5e2ec256a3e | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t, m, n;
cin >> t;
for(int i=0; i<t; i++)
{
cin >> m >> n;
if(m > n)
cout << "No" << endl;
else if(n%m == 0)
{
cout << "Yes" << endl;
for(int i=0; i<m; i+... | C++ | 041143f69ce9d00924ce8deb56b723c5 | 807b99cd9ab18ca7982d485f85476181 | 1,100 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fo(i, start, end, jump) for(int i = start; i <= end; i += jump)
void solution(){
int t;
cin >> t;
while(t--) {
int n, m;
cin >> n >> m;
if(m < n or... | C++ | 041143f69ce9d00924ce8deb56b723c5 | 94d87b410d8bdced290a8bebf81a621e | 1,100 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fo(i, start, end, jump) for(int i = start; i <= end; i += jump)
void solution(){
int t;
cin >> t;
while(t--) {
int n, m;
cin >> n >> m;
if(m < n or... | C++ | 041143f69ce9d00924ce8deb56b723c5 | 391a53ff451404c5448cf1b091ff560e | 1,100 | PASSED |
#pragma GCC optimize("Ofast")
#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;
/*
greater_equal
find by order will give count of elements > x
repeated elements will be stored
greater
find by order will giv... | C++ | 041143f69ce9d00924ce8deb56b723c5 | fec718632cba69afe29d37caadf538cc | 1,100 | PASSED |
#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 | e0a753d7e806005cc30ae15fa60f60fa | 2,400 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.