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 int long long
inline int read(){
int t=0, f=0; char v=getchar();
while(v<'0') f|=(v=='-'), v=getchar();
while(v>='0') t=(t<<3)+(t<<1)+v-48, v=getchar();
return f?-t:t;
}
const int N=3e5+5, mod=998244353;
int n,ans,x[N],f[N],sum[N],y[N],s;
int add(i... | C++ | 6dd3839826320795fa29702331a15744 | 89bc23f0b1a1fb0bc7abfa2529f24f2d | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int t=0, f=0; char v=getchar();
while(v<'0') f|=(v=='-'), v=getchar();
while(v>='0') t=(t<<3)+(t<<1)+v-48, v=getchar();
return f?-t:t;
}
const int N=3e5+5, mod=998244353;
int n,ans,x[N],f[N],sum[N],y[N],s;
int add(i... | C++ | 6dd3839826320795fa29702331a15744 | 16bad686fe34a8c3534a9ae6a5902bae | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int t=0, f=0; char v=getchar();
while(v<'0') f|=(v=='-'), v=getchar();
while(v>='0') t=(t<<3)+(t<<1)+v-48, v=getchar();
return f?-t:t;
}
const int N=3e5+5, mod=998244353;
int n,ans,x[N],f[N],sum[N],y[N];
bool s[N];
... | C++ | 6dd3839826320795fa29702331a15744 | cf5d0b8e90c6f6461affb3410fd38aeb | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int t=0, f=0; char v=getchar();
while(v<'0') f|=(v=='-'), v=getchar();
while(v>='0') t=(t<<3)+(t<<1)+v-48, v=getchar();
return f?-t:t;
}
const int N=3e5+5, mod=998244353;
int n,ans,x[N],f[N],sum[N],y[N];
bool s[N];
... | C++ | 6dd3839826320795fa29702331a15744 | f09118be48bfeb3ec33a9b99198520b7 | 2,200 | PASSED |
#include<bits/stdc++.h>
#include<cstdio>
#include<cctype>
#include<algorithm>
using namespace std;
#define maxn 202202
#define mod 998244353
template<class T>
inline T read(){
T r=0,f=0;
char c;
while(!isdigit(c=getchar()))f|=(c=='-');
while(isdigit(c))r=(r<<1)+(r<<3)+(c^48),c=getchar(... | C++ | 6dd3839826320795fa29702331a15744 | 9cdb9f4235a342c730b4c0737350cbbd | 2,200 | PASSED |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <string>
#include <chrono>
#include <thread>
#include <queue>
#include <list>
#include<unordered_set>
#define ll long long
#define ull unsigned ll
ll MM = 998244353;
co... | C++ | 6dd3839826320795fa29702331a15744 | c1341b225cd6bc65b51b782260919bd3 | 2,200 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const ll MOD=998244353;
int n;
ll x[200005],y[200005],dp[200005],sum[200005];
int b[200005];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>x[i]>>y[i]>>b[i];
for(int i=1;i<=n;i++)
{
int f=lower_bound(x+1,x+n+... | C++ | 6dd3839826320795fa29702331a15744 | 9d098dc34154b254873729df058d1eef | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define... | C++ | 6dd3839826320795fa29702331a15744 | db04646df45db8484bc8e5c3832885b8 | 2,200 | PASSED |
#include<iostream>
#include<cstdio>
#include<stdio.h>
#include<algorithm>
using namespace std;
const long long mod=998244353;
const int N=200005;
long long sum[N],x[N],n,ans;
long long y[N],s[N],g[N];
int main(){
scanf("%lld",&n);
for(long long i=1;i<=n;i++){
scanf("%lld%lld%lld",&x[i],&y[i],&s[i]);
}... | C++ | 6dd3839826320795fa29702331a15744 | fe437350ae48be4b90ac620f3c6d186f | 2,200 | PASSED |
// You told me...
// At your absolute best, you still won't be good enough for the wrong person...
// At your worst, you'll still be worth it to the right person...
// ............................................................................................
// It was good while it lasted, good bye... ... | C++ | 598c434832d8aa1cbba8b3ea309be235 | 3e7bdd00f0ee5b31e2db9bd7d81374b4 | 3,000 | PASSED |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define V vector
#define RE return
#define ALL(a) a.... | C++ | 598c434832d8aa1cbba8b3ea309be235 | fa38f73a25af9832440da4e4fded53b2 | 3,000 | PASSED |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define V vector
#define RE return
#define ALL(a) a.... | C++ | 598c434832d8aa1cbba8b3ea309be235 | 3f91bdf0cc811cf6699b3878c4d10921 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 44;
void die() {
cout << "REJECTED\n";
exit(0);
}
int n, k;
ll op[N], res[N][N];
//around (1 + n/k)^n
void dfs(int i, ll dk, ll fix) {
if(i == k) {
if(dk&(dk-1)) die();
if(fix && (fix + (1ll<<__bui... | C++ | 598c434832d8aa1cbba8b3ea309be235 | 8954bf1243efbe78ebad2c1d7de60eda | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;... | C++ | 598c434832d8aa1cbba8b3ea309be235 | dac1b8c280db9f9056a8033c8660017f | 3,000 | PASSED |
#include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz (int(s.size()))
#define bit(n, k) (((n) >> k) & 1)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
const int maxn = 50;
vector<int> indexes[maxn];
ll index_mask[maxn];
int arr[m... | C++ | 598c434832d8aa1cbba8b3ea309be235 | 1a4fdbac494faa318b2939c0252f2fde | 3,000 | PASSED |
/**
* created: 27/07/2021, 15:22:15
**/
#include <bits/stdc++.h>
using namespace std;
const int max_n = 44, inf = 1000111222;
const int max_k = 12;
int n, k, a[max_n], b[max_k][max_n];
vector<int> ids[max_k];
void check(int pos) {
if (pos == k) {
if (!is_sorted(a, a + n) || (n > 1 && ... | C++ | 598c434832d8aa1cbba8b3ea309be235 | ec916b8495be07522a6b39f3ef2d4496 | 3,000 | PASSED |
#include <bits/stdc++.h>
#define FOR(i,x,n) for(LL i=x; i<n; i++)
#define F0R(i,n) FOR(i,0,n)
#define ROF(i,x,n) for(LL i=n-1; i>=x; i--)
#define R0F(i,n) ROF(i,0,n)
#define WTF cout << "WTF" << endl
#define IOS ios::sync_with_stdio(false); cin.tie(0)
#define F first
#define S second
#define pb push... | C++ | 598c434832d8aa1cbba8b3ea309be235 | 1b7d18f5ba8cc85efb1e4def4cd423b0 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, m, a[11][41];
bool b[11][41];
vector<long long> c[11], d;
long long f[11], r[41], v[41], t[41];
int main() {
double t1 = clock();
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
r[i] = 1LL << (i - 1);
if (n == 1) {
printf("ACCEPTED\n");
... | C++ | 598c434832d8aa1cbba8b3ea309be235 | a6a4a4f8099d4061b9dc9a4a98df6dac | 3,000 | PASSED |
#include <iostream>
using namespace std;
typedef long long ll;
int m[12];
int l[12];
int f[12][42];
ll x[12];
ll y[12];
bool rec(int i, int k, int n, ll u)
{
if (i == k)
{
for (int j = 0; j <= n; j++)
{
if (u == (1ll << j) - 1)
{
return... | C++ | 598c434832d8aa1cbba8b3ea309be235 | c0e5def784edbf170bc8342ac2aa0237 | 3,000 | PASSED |
///WizardAP
#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 Nothing ""
#define ft first
#define sd second
#define pb push_back
#define pf push_front
#define sz(x) (int)(x... | C++ | ada7340984ca02702146e7b2ab71f194 | f5cf2c6d0cde6d92c2c4bdafca3985b0 | 2,300 | PASSED |
///WizardAP
#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 Nothing ""
#define ft first
#define sd second
#define pb push_back
#define pf push_front
#define sz(x) (int)(x... | C++ | ada7340984ca02702146e7b2ab71f194 | cddbb722e1d63d8189536b6e711a8724 | 2,300 | PASSED |
///WizardAP
#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 Nothing ""
#define ft first
#define sd second
#define pb push_back
#define pf push_front
#define sz(x) (int)(x... | C++ | ada7340984ca02702146e7b2ab71f194 | c734dba43a8ae081e852c5454fa3fd03 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct point
{
int l,r,c;
};
bool cmp(point &a,point &b)
{
return a.c < b.c;
}
signed main(void)
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >> m;
vector <int> a(n*m+5);
vector <int>... | C++ | ada7340984ca02702146e7b2ab71f194 | 4704bc218e03efc1337c3c70813d7613 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e4+10;
bool cho[maxn];
int vis[maxn];
struct line
{
int l,r,col;
}a[maxn],ans[maxn];
bool cmp(line x,line y)
{
return x.r<y.r;
}
vector<int>sav[maxn];
int main()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n*k;i++)
{
int x;
ci... | C++ | ada7340984ca02702146e7b2ab71f194 | a71952f48b716e4a870e559d0a43068f | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> c(n * k);
vector<vector<int>> locs(n);
for (int i = 0; i < n * k; ++i) {
cin >> c[i];
--c[i];
locs[c[i]].push_back(i);
}
vector<array<int, 3>> i... | C++ | ada7340984ca02702146e7b2ab71f194 | 4de24b1492a28c2e2c5f10bff580cdd9 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> c(n * k);
vector<vector<int>> locs(n);
for (int i = 0; i < n * k; ++i) {
cin >> c[i];
--c[i];
locs[c[i]].push_back(i);
}
vector<bool> done(n);
... | C++ | ada7340984ca02702146e7b2ab71f194 | 3e6d06bb1644065102bf3c34ac59fab5 | 2,300 | PASSED |
// Designed by Nguyen Thanh Chau
// a.k.a Paperback Collector
// En Taro Adun! - TemplarAssasin a.k.a Zeratul
// ##### #####
// ### #### #### ###
// ## ### ### ##
// ## #### ##
// ... | C++ | ada7340984ca02702146e7b2ab71f194 | 6ef77d27d27385621665fedcd731354a | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n * k), lst(n * k, -1);
for (int i = 0; i < n * k; i++) {
cin >> a[i];
--a[i];
f... | C++ | ada7340984ca02702146e7b2ab71f194 | 08331fe65b6f6969fee5485bbd3ffdf0 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
struct segment_change {
// Use a sentinel value rather than a boolean to save significant memory (4-8 bytes per object).
static const int SENTINEL = numeric_limits<int>::lowest();
// Note that to_set goes first, and to_add goes... | C++ | ada7340984ca02702146e7b2ab71f194 | 1d3fd5d287aa3dcd5d690a5836931207 | 2,300 | PASSED |
//#define DEBUG
//#define USEPB_DS
#define USETR1
#define CPPELEVEN
#define GPP
/*
* temp.cpp
*
* Created on: 2012-7-18
* Author: BSBandme
*/
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#if __cplusplus < 201500L
#include <bits/stdc++.h>
#else
#include <iostream>
#include <fstr... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | d8ee5d742df326e7a4673fba96f35910 | 3,400 | 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 <bits/st... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | d2394072ea5c8b148ab36e8e6231afa2 | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1010,mod=998244353;
int n,m,pd[N],fac[N];
namespace PQtree{
const int M=N<<2;
int op[M],tp[M],rt,tot;
//tp:0: P(可随意排列) 1:Q(只能顺序或倒序) op:0 都不是 1:都是 2:部分是
vector<int> son[M];
inline void init(){
tot=n;rt=++tot;tp[tot]=0;
for(int i=1;i<=n;+... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | 5da82e9c5c5e36440983ba1b07acf192 | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353;
#define maxn 109
#define pb push_back
int n,m,tot=0,opt[maxn*2],root;
int ops[maxn*2];
queue<int > deled;
std::vector<int > sons[maxn*2];
int nw(){
int id;
if(deled.size())id=deled.front(),deled.pop();
else id=++tot;
return id... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | f86d3457bcd3ba3ab509df9ec2707b12 | 3,400 | PASSED |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int Mxdt=100000,mod=998244353;
char gc(){
return getchar();static char buf[Mxdt],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxdt,stdin),p1==p... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | 96cc803a663843b67688b48d0a1cf894 | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
typedef pair<int,int> pr;
basic_string<int> g[50005];
int jc[50005]={1},tot,n,m,col[50005],tp[50005],rt,ans=1;//0p 1q
void End(){
puts("0"),exit(0);
}
void dfs(int x){
if(x<=n)return ;
col[x]=0;
for(int y:g[x])dfs(y),col[x]|=col[y];
... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | 7b390c88d6fb23549da5c0690f71b7fc | 3,400 | PASSED |
#include <bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
#define inf 0x3f3f3f3f
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define nep(i, r, l) for (int i = r; i >= l; i--)
void sc(int &x) { scanf("%d", &x); }
void sc(int &x, int &y) { scanf("%d%d", &x, &y); }
void sc(int &x, int &y... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | 08b7f81f3ede5b95ea353dd8ddb86b0a | 3,400 | PASSED |
#include <bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
#define inf 0x3f3f3f3f
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define nep(i, r, l) for (int i = r; i >= l; i--)
void sc(int &x) { scanf("%d", &x); }
void sc(int &x, int &y) { scanf("%d%d", &x, &y); }
void sc(int &x, int &y... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | b45dc1fb30faa405a648aa96592b5beb | 3,400 | PASSED |
#include <bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
#define inf 0x3f3f3f3f
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define nep(i, r, l) for (int i = r; i >= l; i--)
void sc(int &x) { scanf("%d", &x); }
void sc(int &x, int &y) { scanf("%d%d", &x, &y); }
void sc(int &x, int &y... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | 9abeff42048258848f66aba0fdf0197b | 3,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
struct node{
int a,col;
vector<int> son;
};
int n,m,x,y,ans,fact[1001];
bool fl[1001];
int add(int a,int b){
if(a+b>=mod)return a+b-mod;
return a+b;
}
int del(int a,int b){
if(a-b<0)return a-b+mod;
return a-b;
}
int... | C++ | ac7b2d60a3e58f83d68dfaf4b38a6443 | 31734aad4f912d92d1c320bd92fc4bbd | 3,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cout <<#x<<" = " <<x<<"\n"
int t, n, a, b;
int h;
bool same_half(){
if ( a <= h && b <= h) return true;
else if( a>=h+1 && b>=h+1) return true;
return false;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> t;
while(t--){
cin >> ... | C++ | 6ea491419f3ea387cf2aded8a8db914d | 04aefdcec754c4d29e7e2e4b3131dce8 | 900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
void _display(vector<int> vec)
{
for (int i = 0; i < vec.size(); i++)
{
cout << vec[i] << " ";
}
cout << endl;
}
void check(vector<int> vec,int a,int b)
{
int first_half = INT_MAX;
int second_half = INT_MIN;
for (int i = 0; ... | C++ | 6ea491419f3ea387cf2aded8a8db914d | 3c4d1f4e8e1ef87250884d8d671e081e | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define rang(a) a.begin(), a.end()
#define pb(e) push_back(e)
#define mp(a,b) make_pair(a,b)
#define x first
#define y second
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ss... | C++ | 6ea491419f3ea387cf2aded8a8db914d | dd567d995139d9848b1e86127a79299d | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
int32_t main()
{
fastio
int t;cin>>t;
for(int i=0;i<t;i++)
{
int n,a,b;
cin>>n>>a>>b;
int v[n];
for(int i=n ; i>0... | C++ | 6ea491419f3ea387cf2aded8a8db914d | cc282dd90596ea5586f4f8a6b3d2f76e | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
#define input(v) for(auto &i:v)cin>>i;
#define int long long
#define sor(v) sort(v.begin(),v.end())
#define sorr(v) sort(v.rbegin(),v.rend())... | C++ | 6ea491419f3ea387cf2aded8a8db914d | 3ae38616d0f16a6ffa7f004acf677faf | 900 | PASSED |
#include<stdio.h>
int main(){
int max,min,n,t,i,j;
scanf("%d",&n);
while(n--){
scanf("%d%d%d",&t,&min,&max);
if(min>t/2+1||max<t/2||min<=t/2&&max<=t/2||min>=t/2+1&&max>=t/2+1){
printf("-1\n");
continue;
}
printf("%d ",min);
for(i=t/2+1;i<=t;i++){
if(min==i) i++;
if(i!=max&&i<=t) printf("%d "... | C++ | 6ea491419f3ea387cf2aded8a8db914d | c0b39873a68daed7093b61d3adfb4699 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
scanf("%d",&t);
while(t--){
int a=0,b=0,N=0;
scanf("%d%d%d",&N,&a,&b);
int n;
n=N/2;
if(!(((2*n-(b+1)+2)<=n && a<=n) || (a>b && (a==n+1 && b==n)))){
printf("-1\n");
continue;
}
if((a>b && (a==n+1 && b==n))){
for(int i=a;i<=2*n;i+... | C++ | 6ea491419f3ea387cf2aded8a8db914d | 564cecbef639437b59a697693d03978c | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int t,n,a,b,cnta = 0,cntb = 0;
bool vis[109];
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&a,&b);
memset(vis,0,sizeof(vis));
vis[a] = 1,vis[b] = 1,cnta = 0,cntb = 0;
for(int i = a;i <= n;i++) if(!vis[i]) cnta++;
for(int i = ... | C++ | 6ea491419f3ea387cf2aded8a8db914d | 09f5ec8f892f53b6a2ee2e0b4cba546c | 900 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define T long long T; cin>>T; while(T--)
typedef long long ll;
#define IOS ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define debug(x) cout<<"["<<#x<<" is: "<<x<<"]"<<endl;
using namespace std;
u... | C++ | 6ea491419f3ea387cf2aded8a8db914d | 56ac318040060aaed4f8d854c831d223 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int n, a, b;
cin >> n >> a >> b;
vector<int> v(n);
int cnt = 0;
v[cnt ++] = a;
for(int i = n; i >= 1; i --){
if(i != a && i != b){
v[cnt ++] = i;
}
if(cnt == n / 2){
v[cnt ++] = b;
}
}
if(cnt != n){
cout << -1 << endl;
return;
}
... | C++ | 6ea491419f3ea387cf2aded8a8db914d | ee076cfd16eeec2a0d4cf79628ca4787 | 900 | PASSED |
#include <stdio.h>
#include <math.h>
int main(void)
{
int t, x, y, flag=0;
scanf("%d", &t);
while (t--)
{
scanf("%d%d", &x, &y);
for (int i = 0; i < 51; i++)
{
for (int j = 0; j < 51; j++)
{
if (((i + j) == (x + y) / 2) && ((ab... | C | f1d3032f1cb07ad6187a37c84376510d | 73569a0791ff8dabb98c64fa4b605347 | 800 | PASSED |
#include<stdio.h>
int main()
{
int b, c, x2, y2, x3, y3, temp, i, j, test;
scanf("%d", &test);
while(test--)
{
scanf("%d %d", &x2, &y2);
b=x2+y2;
if(b%2!=0)
{
printf("-1 -1\n");
continue;
}
c=b/2;
if(x2>=c)
... | C | f1d3032f1cb07ad6187a37c84376510d | 8bfaa176435343663c83bbf0177cbd05 | 800 | PASSED |
#include<stdio.h>
int main()
{
int b, c, x2, y2, x3, y3, temp, i, j, test;
scanf("%d", &test);
while(test--)
{
scanf("%d %d", &x2, &y2);
b=x2+y2;
if(b%2!=0)
{
printf("-1 -1\n");
continue;
}
c=b/2;
if(x2>=c)
... | C | f1d3032f1cb07ad6187a37c84376510d | 893f1ad9b257baa959e9379f4d9b3bb6 | 800 | PASSED |
#include<stdio.h>
#include<math.h>
int main()
{
int t,x,y,min,s;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&x,&y);
s=(x+y)/2;
if(x==0 && y==0)
{
printf("0 0\n");
}
else
{
if((x%2!=0 && y%2==0... | C | f1d3032f1cb07ad6187a37c84376510d | c10c39a69d4aba6dd38a8a7638957658 | 800 | PASSED |
#include<stdio.h>
#include<math.h>
int main()
{
int t,x,y,min,s;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&x,&y);
s=x+y;
if(x<y)
{
min=x;
}
else
{
min=y;
}
if(x==0 && y==0)
{
... | C | f1d3032f1cb07ad6187a37c84376510d | 4a1484a3b608691c562fcbf94d750d30 | 800 | PASSED |
#include<stdio.h>
#include<stdlib.h>
int min(int num1, int num2)
{
return (num1 > num2 ) ? num2 : num1;
}
int main()
{
int t;
scanf("%d", &t);
for (int i=1; i<=t ;i++){
int x,y;
scanf("%d%d", &x, &y);
if((x+y)%2==0 && x%2==0 &&y%2==0){
printf("%d %d\... | C | f1d3032f1cb07ad6187a37c84376510d | 4082d4cdb1596f01e2a5f56efc8a17d7 | 800 | PASSED |
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,x,y,t;
int i,j;
scanf("%d",&t);
while(t--)
{
int flag=1;
scanf("%d %d",&x,&y);
int sum=(x+y)/2;
for(i=sum;i>=0;i--)
{
for(j=sum;j>=0;j--)
{
if(i+j==sum&&flag)
{
if(abs(x-i)+abs(y-j)==sum&&flag)
{
pri... | C | f1d3032f1cb07ad6187a37c84376510d | 612a09dabf0003d52ec200b45dd340a3 | 800 | PASSED |
#include<stdio.h>
int main(){
int t,x,y;
scanf("%d\n",&t);
for(int i=0;i<t;i++){
scanf("%d %d\n",&x,&y);
if((x+y)%2!=0){
printf("-1 -1\n");
... | C | f1d3032f1cb07ad6187a37c84376510d | a6741c5bd782c5da1e957fa30762dae3 | 800 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int x_B, y_B;
int t;
scanf("%d", &t);
while(t--)
{
scanf("%d %d", &x_B, &y_B);
if((x_B + y_B)%2 == 0){
if(x_B>y_B)
{
printf("%d 0\n", ((x_B+y_B)/2));
}
els... | C | f1d3032f1cb07ad6187a37c84376510d | 55e0125971e1afaf4b4a0c5a4d3bbf84 | 800 | PASSED |
#include<stdio.h>
#include<math.h>
int main(){
int a,a2,b,b2,c,c1,c2;
int n;
scanf("%d",&n);
while(n>0){
scanf("%d %d",&a,&b);c=a+b;c/=2;
if((a+b)%2==1){
printf("-1 -1\n");
}
else{
if(a%2==0&&b%2==0){
if(a<b){
c1=a;c2=b-c;
}else{
c1=a-c;c2=b;
}
printf(... | C | f1d3032f1cb07ad6187a37c84376510d | 222c6cf76e220b277d6d2745b2a2839a | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
bool possible(long long a, long long b, long long x) {
if (b == 0)
return a == x;
if (a >= x && a % b == x % b)
return true;
return possible(b, a % b, x);
}
// we can always swap a and b if they are not equal
int main() {
int n;
cin >> n;
long long a, ... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | e3d292108b8840964dfa909ff83ce309 | 1,600 | PASSED |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
#define rep(i, a, b) for(int i=a;i<=b;i++)
#define per(i, a, b) for(int i=a;i>=b;i--)
using namespace std;
const int maxn=1e6+5;
const ll mod=1e9+7;
inline ll read(){ ll f = 1; ll x = 0;char ch = getchar();while(ch>'9'|... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | baf433cb86e68562292ad60d5a4408b1 | 1,600 | PASSED |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
#define rep(i, a, b) for(int i=a;i<=b;i++)
#define per(i, a, b) for(int i=a;i>=b;i--)
using namespace std;
const int maxn=1e6+5;
const ll mod=1e9+7;
inline ll read(){ ll f = 1; ll x = 0;char ch = getchar();while(ch>'9'|... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | 581d323bb53bb95fe96370f0b7f87a63 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int N=1e3+10;
bool pd(int x,int y,int z){
while(x&&y){
if(x<y) swap(x,y);
if(x==z||y==z||(x-z)%y==0) return 1;
x=x%y;
if(x==0||y==0||(x<z&&y<z)) break;
}
return 0;
}
signed main(){
int t;
cin>>t;
while... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | a68a78288a1a0b4621649a2cf1ae2d54 | 1,600 | PASSED |
/*
深山踏红叶，耳畔闻鹿鸣
飘摇风雨中，睹物思故乡
可叹，落叶飘零
*/
#include<bits/stdc++.h>
#define int long long
#define mem(x,y) memset(x,y,sizeof(x))
#define si set <node> :: iterator
using namespace std;
int read(){
int s = 0,w = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-')w = -1;ch... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | f5bda0899255474617c1bd42eb8af0f2 | 1,600 | PASSED |
/*
深山踏红叶，耳畔闻鹿鸣
飘摇风雨中，睹物思故乡
可叹，落叶飘零
*/
#include<bits/stdc++.h>
#define int long long
#define mem(x,y) memset(x,y,sizeof(x))
#define si set <node> :: iterator
using namespace std;
int read(){
int s = 0,w = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-')w = -1;ch = getchar();}
... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | e4bedeb1ac7b1318767a0347ab677d0b | 1,600 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
ll mod = 1000000007;
void print(vector<ll>v){
cout << "start" << "\n";
for(int i = 0;i<v.size();i++) cout << v[i] << " ";
cout << "\n" << "end" << "\n";
};
// git... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | ef9cfc3276ba9561c2083f84b866dad9 | 1,600 | PASSED |
#include<iostream>
#include<cctype>
#include<sstream>
#include<algorithm>
#include<stack>
#include<cmath>
#include<vector>
#include<string>
#include<cstring>
#include<iomanip>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<queue>
#include<numeric>
#include<bi... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | 4dd5d23420d48d941805a649e969272e | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FAST() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mod 1000000007
#define MOD1 998244353
#define inf 1e18
#define nl "\n"
#define ll long long
#define int ll
#define pi pair<int,int>
#define pb push_back
#define ppb pop_back
#... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | 441fc494c374158e58a8ff5fd9abdb86 | 1,600 | PASSED |
// Problem: D. X-Magic Pair
// Contest: Codeforces - Educational Codeforces Round 117 (Rated for Div. 2)
// URL: https://codeforces.com/contest/1612/problem/D
// Memory Limit: 512 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#defin... | C++ | 7e23e222ce40547ed8a4f7f1372082d9 | ba8ab9ea3c8107fc9949f73d21328d2b | 1,600 | PASSED |
#include <iostream>
#include <string>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
#define SHEHAB ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define ul unsigned long long
#define ld long double
ll work(ll k, ll x, ll msg)
{
ll z;
if (msg <= k)
{
z... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | e9f653e30594d59ee2bf534a04fd6b96 | 1,300 | PASSED |
#include <iostream>
#include <string>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
#define SHEHAB ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define ul unsigned long long
#define ld long double
void solve() {
ll k, x;
cin >> k >> x;
ll ans = 0;
ll z =... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | 2eb61e731dd18c202b00316431afab86 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long get(int x) {
return x * 1ll * (x + 1) / 2;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int k;
long long x;
cin >> k >> x;
long long l = 1, r = 2 * k - 1;
long long res = 2 * k - 1;
bool over = fa... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | 6fd4145bfd7e7625fe9350d83802c8a0 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pll> vll;
typedef map<ll, ll> mapll;
typedef long double ld;
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(a) (a).begin... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | c2992effb91db5f7f13745fbdec9c0e5 | 1,300 | PASSED |
// Let's Begin Mara Khawa ^+^
// author : @I_Love_My_Sherniii
// 14-07-22
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#define endl "\n"
#define int long long
#define sz(s) (int)s.size()
#define pi acos(-1.0)
#define fr(... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | 5d91083cc7b51d63d6e408fa7cf479aa | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ed '\n'
#define gp ' '
#define lli long long int
lli value(lli mid, lli k)
{
lli sum = 0;
if (mid > k)
{
sum = (k * (k + 1)) / 2;
lli left = mid - k;
lli next_part = sum - k;
lli bard = k - 1 - left;
next_part -=... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | e04d6bedb3d8f1295b04ddf03d2fe2eb | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#define pb push_back
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while(t--)
{
ll k, x;
cin >> k >> x;
ll l ... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | a70f875dce60ff788937a85c0a795cbb | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, x;
ll erfen1()
{
ll l = 1, r = n;
while(l < r){
ll mid = (l + r) >> 1;
ll zz = (mid * (2 + (mid - 1)) / 2);
if(x <= zz) r = mid;
else l = mid + 1;
}
return l;
}
ll erfen2()
{
ll l = 1, r = n - 1;
while(l < r){
ll mid = (l + r)... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | b8060860d94eb2c3bb706c5772494e3e | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--)
{
long long k,x;
cin >> k >> x;
if(k*k<=x)
{
cout << 2*k-1 << endl;
}
else
{
long long l=0,r=2*k-1;
while(l<r)
... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | 405890c1eb8a535fffb123927927c7c6 | 1,300 | PASSED |
#include <iostream>
using namespace std;
long long int t,k,x,mid,tmp,a,b;
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>t;
for(int i=0;i<t;i++){
cin>>k>>x;
if(k*k<=x){
cout<<2*k-1<<"\n";
}else{
a=1;
b=2*k-1;
while(a<=b){
mid=(a+b)/2;
if(mid>k){
tmp=(1+k)*k/2+(3*... | C++ | bf21c4809cd10904f05d531dd7af4ab5 | 9432eecf9e9c8da35ed5202f5182e719 | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#define int ll
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(), (a).end()
#define X first
#define Y second
typedef tree<int,... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | af35f8d707485ad38a14a8de986e9ccc | 2,000 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#define int ll
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(), (a).end()
#define X first
#define Y second
typedef tree<int,... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | fc3a297dc8ecd9528ad6178b1868401c | 2,000 | PASSED |
#define DEBUG 0
#define TESTSETS 0
#if DEBUG
#include <ultimate_power_2.h>
#else
#include <bits/stdc++.h>
#define echo(...) {}
#endif
/* ######################################################-- Utils ###############################################################- */
#define debug if(DEBUG)
... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | b988dae800361d879ae65b366077a006 | 2,000 | PASSED |
#define DEBUG 0
#define TESTSETS 0
#if DEBUG
#include <ultimate_power_2.h>
#else
#include <bits/stdc++.h>
#define echo(...) {}
#endif
/* ######################################################-- Utils ###############################################################- */
#define debug if(DEBUG)
... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | cd28987b7ad86d537adcde2c5d5b3be8 | 2,000 | PASSED |
#define DEBUG 0
#define TESTSETS 0
#if DEBUG
#include <ultimate_power_2.h>
#else
#include <bits/stdc++.h>
#define echo(...) {}
#endif
/* ######################################################-- Utils ###############################################################- */
#define debug if(DEBUG)
#define pow2... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | 64333989e4390c46f8d2e8ec50957dfb | 2,000 | PASSED |
#define DEBUG 0
#define TESTSETS 0
#if DEBUG
#include <ultimate_power_2.h>
#else
#include <bits/stdc++.h>
#define echo(...) {}
#endif
/* ######################################################-- Utils ###############################################################- */
#define debug if(DEBUG)
#define pow2... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | 3c6f06f9cd0ddcc55ecba92e463fecc5 | 2,000 | PASSED |
#define DEBUG 0
#define TESTSETS 0
#if DEBUG
#include <ultimate_power_2.h>
#else
#include <bits/stdc++.h>
#define echo(...) {}
#endif
/* ######################################################-- Utils ###############################################################- */
#define debug if(DEBUG)
... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | 512778b8834cc44014c5926270431f5b | 2,000 | PASSED |
#define DEBUG 0
#define TESTSETS 0
#if DEBUG
#include <ultimate_power_2.h>
#else
#include <bits/stdc++.h>
#define echo(...) {}
#endif
/* ######################################################-- Utils ###############################################################- */
#define debug if(DEBUG)
... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | f71490c7fb04da76afb5e2acdf840a9a | 2,000 | PASSED |
//why tf is this that much faster
#include <bits/stdc++.h>
using namespace std;
const int N = 200043;
const int K = 20;
vector<int> idx[N];
int m[N], k[N];
bool frac_greater(pair<int, int> a, pair<int, int> b)
{
return a.first * b.second > a.second * b.first;
}
int main()
{
int n;
... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | 377f7219bb9ec42c227ec25d5e8b64d2 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define _upgrade \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORB(i, a, b) for (int i = a; i >= b; i--)
#define REP(i, a) for (in... | C++ | 0fd45a1eb1fc23e579048ed2beac7edd | 0a56d44710bdadc897fa33af0fb5ea2d | 2,000 | PASSED |
//
// Created by 刘蕴臻 on 2022/1/26.
//
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <ctime>
#include <cmath>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll INF = ... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | e14fa0ce19f6d4e68fa1de0dcbe6de3d | 2,500 | PASSED |
//
// Created by 刘蕴臻 on 2022/1/26.
//
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <ctime>
#include <cmath>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll INF = ... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | 52b4a624e0438f0d0cbdad8bcdab464f | 2,500 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define int long long
#define uit unsigned int
using namespace std;
const int N=1e6+10;
const int eps=1e6+1;
const ll M=1e9+7;
int n;ll d[N<<1],c[N],now=0,pw[N],ANS=0,CNT=1;
ll get(int l,int r){return ((ll)(r-l+1)*(ll)(l+r)/(ll)2)%M;}
signed main(){
pw[0]=1;
... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | 169cb12daef623ec4861e85d8bc8bcce | 2,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6,mod=1e9+7;
int m,now,val,ans=1,fac[N+5],d[N<<1|5];
inline int read(){
int x=0;char c=getchar();
while(!isdigit(c))c=getchar();
while(isdigit(c)){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
return x;
}
inline int que(int l,int r){... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | b539b87250c8181f2b35dd8d82792770 | 2,500 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6,M=2e6,mod=1e9+7;
int n,m,val,ans=1,c[M+5],b[2][M+5],jc[M+5];
signed main(){
cin>>m;
for(int i=1;i<=m;++i)cin>>c[i],n+=c[i];
for(int i=1;i<=m;++i){
int x=N+1-c[i],y=N+c[i]-1;
b[x&1][x]++,b[x&1][y+1]--;
}
jc[0]=1;
fo... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | e16fe225f7d51cc156630f21c1ea25ed | 2,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#define MAXN 1000001
using LL = long long;
using namespace std;
int m;
LL cnt[MAXN * 2 + 1], fac[MAXN * 2 + 1], ans1, ans2 = 1;
const LL MOD = 1000000007LL;
LL Count(LL l, LL r) { return (l + r) * (r - l + 1LL) / 2LL % MOD; }
int main()
{
... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | 0ee2b92d72cd5d0b83a47a5a4f1be679 | 2,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#define MAXN 1000001
using LL = long long;
using namespace std;
int m;
LL cnt[MAXN * 2 + 1], fac[MAXN * 2 + 1], ans1, ans2 = 1;
const LL MOD = 1000000007LL;
LL Count(LL l, LL r) { return (l + r) * (r - l + 1LL) / 2LL % MOD; }
i... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | 06f764540b5eb5e10cb2636fe586f808 | 2,500 | PASSED |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp std::make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
template<class T> T dmax(T x,T y) { return x>y?x:y; }
template<class T> T dmin(T x,T y) { return x<y?x:y; }
#define int long long
// using namespace ... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | 79f2a611a7f919ebcc9d969b1bf3bf74 | 2,500 | PASSED |
#include <iostream>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <algorithm>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll, ll>
#define LINF 0x0fffffffffffffff // ~= 1e18
#define INF 0x7fffffff
#define ... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | 56aacac48e1bbcd05a0682164a85e760 | 2,500 | PASSED |
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=(b);a<=(c);a++)
#define per(a,b,c) for(int a=(b);a>=(c);a--)
#define mem(a,b) memset(a,b,sizeof(a))
#define ll long long
using namespace std;
const int N=5e5+5;
const int p=1e9+7;
const int inv2=((p+1)/2);
inline int inc(int x,int y) { if((x+=y)>=p) x-=p; r... | C++ | 5aa2dd625eee9679ef9ad03d25d848ac | ee2f7313d34a5d5c42bc9f5cb4bfe9c5 | 2,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define N 200010
#define long_long_MAX 9187201950435737471
#define long_long_MIN -9187201950435737472
#define int_MAX 2139062143
#define int_MIN -2139062144
#define jh(x, y) (x ^= y ^= x ^= y)
#define loc(x, y) ((x - 1) * m + y)
#define lowb... | C++ | 20783d008f54becf7e47df3279a69fcb | c752e9dcad0bd0bd130d8367eecc5547 | 2,800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.