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 |
|---|---|---|---|---|---|
# ========== //\\ //|| ||====//||
# || // \\ || || // ||
# || //====\\ || || // ||
# || // \\ || || // ||
# ========== // \\ ======== ||//====||
# code
def solve():
n = int(input())
p = list(map(int, inpu... | Python | 6443dffb38285b6deb74f2371d8d0cac | 62370cd2fab43093ca94a23bee7ac543 | 1,500 | PASSED |
n = int(input())
list1 = list(map(int,input().split()))
list1.sort()
list2 = [-1]*(len(list1))
count=0
for i in range(1,len(list2),2):
if i>len(list2):
break
list2[i]=list1[count]
count+=1
for i in range(0,len(list2),2):
if i>len(list2):
break
list2[i]=list1[count]
count+=1
... | Python | 6443dffb38285b6deb74f2371d8d0cac | a57dbeaba8ed610336124fee044c5813 | 1,500 | PASSED |
n=int(input())
a=list(map(int,input().split()))
a.sort()
ind=0
ans=[0]*n
cnt=0
for i in range(1,n,2):
ans[i]=a[ind]
ind+=1
for i in range(0,n,2):
ans[i]=a[ind]
ind+=1
for i in range(1,n-1):
if(ans[i]<ans[i-1] and ans[i]<ans[i+1]):
cnt+=1
print(cnt)
print(*ans)
| Python | 6443dffb38285b6deb74f2371d8d0cac | a5a5f05c1702a5975fbd4e7a0f8d4f62 | 1,500 | PASSED |
def solve(n,A):
A.sort()
v = [0]*n
j = 0
for i in range(1,n,2):
v[i] = A[j]
j+=1
for i in range(0,n,2):
v[i] = A[j]
j+=1
count = 0
for i in range(1,n-1):
pre= i-1
cur = i
next = i+1
if v[pre] > v[cur] and v[next] > v... | Python | 6443dffb38285b6deb74f2371d8d0cac | 05ee5fca03b5867b27c8c4162ffeff2b | 1,500 | PASSED |
import math
def solution(n, a):
a.sort()
low = 0
r1, r2 = math.ceil((n-2)/2), [0]*n
for i in range(n):
if i <= r1-1 and a[i] == a[i + n//2 + 1]:
low += 1
if i % 2:
r2[i] = a[i//2]
else:
r2[i] = a[n//2 + i//2]
return [r1 - low, r2]
... | Python | 6443dffb38285b6deb74f2371d8d0cac | 45c6f9a2f0e613c23dc626cd800bf3f6 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
#define endl '\n'
using name... | C++ | f91197e474bdc3f2b881d556a330e36b | 924f0e07c81768e42ce305897212444e | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define c(P) cout<<P<<"\n"
#define pii pair<ll,ll>
#define mi map<ll,ll>
#define mii map<pii,ll>
#define F first
#define S second
#define sz(a) (ll)(a.size())
#define cr(P) ... | C++ | f91197e474bdc3f2b881d556a330e36b | 6ff71886ddc0c70f834df3d162aced6e | 2,400 | PASSED |
/*
* @Author: DarkDawn
* @School: BIT
* @Date: 2019-10-21 20:31:47
* @Last Modified by: DarkDawn
* @Last Modified time: 2019-10-21 20:52:02
*/
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#inclu... | C++ | f91197e474bdc3f2b881d556a330e36b | 1dc456163c99746fa7dd35c93e814cc6 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
using namespace std;
long long mod=1000000007;
vector<int> *graph;
vector<int> *reversed_graph;
void top_order(int u, bool vis[], stack<int> &topological_order){
vis[u]=true;
for(int i=0;i<graph[u].size();i++)
if(!vis[graph[u][i]])
top... | C++ | f91197e474bdc3f2b881d556a330e36b | dce3c01bc0fd7a4e4e67dc839ba8defb | 2,400 | PASSED |
#include "bits/stdc++.h"
using namespace std;
static const int maxn = 2e6 + 6;
vector < vector <int> > graph;
int sccno[maxn];
int discovery[maxn];
int low[maxn];
bool vis[maxn];
int dfsTime;
int scc;
stack <int> st;
void tarjan(int u)
{
vis[u] = 1;
discovery[u] = low[u] = ++dfsTime;
st.push(u);
... | C++ | f91197e474bdc3f2b881d556a330e36b | db608e7409c56e1a7af65dd1ca7da6bb | 2,400 | PASSED |
#include "bits/stdc++.h"
using namespace std;
static const int maxn = 2e6 + 6;
vector < vector <int> > graph;
int sccno[maxn];
int discovery[maxn];
int low[maxn];
bool vis[maxn];
int dfsTime;
int scc;
stack <int> st;
vector <int> jury;
vector <int> contestants;
void tarjan(int u)
{
vis[u] = 1;
discover... | C++ | f91197e474bdc3f2b881d556a330e36b | 6e9fc4bd74f05bd4ef297f4cf5f1ce69 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define sd(a) scanf("%d",&a)
#define sld(a) scanf("%lld",&a)
#define mst(a,b) memset(a,b,sizeof a)
#define pb push_back
#define mp make_pair
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;
const int maxn = 1e6+5;
int inf = 0x3f3f3f3f;
int dfn[maxn],low[maxn],n,m,belong[max... | C++ | f91197e474bdc3f2b881d556a330e36b | 255ed99290954220563ef3fdac4f1e16 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define sd(a) scanf("%d",&a)
#define sld(a) scanf("%lld",&a)
#define mst(a,b) memset(a,b,sizeof a)
#define pb push_back
#define mp make_pair
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;
const int maxn = 1e6+5;
int inf = 0x3f3f3f3f;
int dfn[maxn],low[maxn],n,m,belong[max... | C++ | f91197e474bdc3f2b881d556a330e36b | bb62d65b4e91772b2d7df6061f810e12 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int n,m,t;
vector<int> g[maxn],h[maxn];
int vis[maxn];
int cnt;
void dfs1(int u) {
vis[u] = 1;cnt++;
for(auto it : g[u]) {
if(vis[it]) continue;
dfs1(it);
}
}
void dfs2(int u) {
vis[u] = 1;cnt++;
for(auto it : h[u]) {
if(vis[it]) continu... | C++ | f91197e474bdc3f2b881d556a330e36b | e71f9ca147fecb5d3c029e9cb0eea7a6 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini freopen(name".inp","r",stdin); freopen(name".out","w",stdout)
#define foe(it,c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); it++)
#define long long long
#define db double
#define pii pair <int, int>
#define pll pair <long, long>
#d... | C++ | f91197e474bdc3f2b881d556a330e36b | 21cd35468a132657597bc12850bd448d | 2,400 | PASSED |
/*
Though leaves are many , the root is one.
Through all the lying days of my youth
I swayed my leaves and flowers in the sun.
Now I may wither into the truth.
- William Butler Yeats
*/
//#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option("arch=na... | C++ | bde1f233c7a49850c6b906af37982c27 | 0c9ed691705539dc2780828151a95ad5 | 2,700 | PASSED |
#include <bits/stdc++.h>
#include <string>
#include <cmath>
#include <sstream>
#include <unordered_map>
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for(ll i = (a-1); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
typedef long long int ll;
using namespace std;
//ll... | C++ | bde1f233c7a49850c6b906af37982c27 | 4709bd328c299bcfcdd3ba714b6ba780 | 2,700 | PASSED |
#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y... | C++ | bde1f233c7a49850c6b906af37982c27 | 213da6b02227a5c54b540ee42c187a78 | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,k;
scanf("%i %i",&n,&k);
ll c=0;int s=0;
while(k--){
int a,b;
scanf("%i %i",&a,&b);
c+=b;
s+=(ll)(a-1)*b%n;
if(s>=n)s-=n;
}
int o=((ll)n*(n-1)/2)%n;
if(c<n||o==s)printf("1\n");
else printf("-1\n");
return 0;
}
| C++ | bde1f233c7a49850c6b906af37982c27 | 306f2ffdb23f3e2d6f78868e13b717d2 | 2,700 | PASSED |
//CLOCKS_PER_SEC
using namespace std;
#include<bits/stdc++.h>
#define sqr(x) 1ll*(x)*(x)
//#define sort stable_sort
#define ll long long
#define mk make_pair
#define pb push_back
#define in insert
#define mtr(x,y,z) mk(mk(x,y),z)
#define fi first
#define se second
#define lch(x) ((x)<<1)
#define rch(x) (((x)<<1)|1)
#de... | C++ | bde1f233c7a49850c6b906af37982c27 | 586309ae23772a5f9859ab4db66ba187 | 2,700 | PASSED |
//CLOCKS_PER_SEC
using namespace std;
#include<bits/stdc++.h>
#define sqr(x) 1ll*(x)*(x)
//#define sort stable_sort
#define ll long long
#define mk make_pair
#define pb push_back
#define in insert
#define mtr(x,y,z) mk(mk(x,y),z)
#define fi first
#define se second
#define lch(x) ((x)<<1)
#define rch(x) (((x)<<1)|1)
#de... | C++ | bde1f233c7a49850c6b906af37982c27 | c07a99600349bd3e3f7db80e5836400c | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fr first
#define sc second
long long ln,n,ttl=0;
pair<long long,long long> a[200069];
long long tri(long long x)
{
return x*(x+1)/2;
}
int main()
{
long long i,k,w,sm=0,z;
scanf("%lld%lld",&ln,&n);
for(i=1;i<=n;i++)
{
scanf("%lld%l... | C++ | bde1f233c7a49850c6b906af37982c27 | 34d8985726b5ffe47baac106b117c1a5 | 2,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int main() {
int n,k,a,b,sum=0;
long long Sum=0;
scanf("%d%d",&n,&k);
for(int i=1;i<=k;i++) {
scanf("%d%d",&a,&b);
Sum+=b;
sum=(sum+1ll*a*b)%n;
}
if(Sum<n)puts("1");
else if(Sum>n)puts("-1");
else {
if(sum==(1ll*n*(n+1)/2%n))puts("1");
... | C++ | bde1f233c7a49850c6b906af37982c27 | 119e5ed232723c27dfdee6720635f8ea | 2,700 | PASSED |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<bitset>
using namespace std;
#define LL long long
#define DB double
#define MAXN 2000
#define Pr pair<int,int>
#define X first
#define Y second
#define INF 1000000001
#define MOD 998244353
#define mem(x,v) memset(x,v,si... | C++ | bde1f233c7a49850c6b906af37982c27 | 5ef835721d8c896a46f94593d070bb2f | 2,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long sum = 0, res = 0;
for (int i = 1; i <= k; i++) {
int a, b;
cin >> a >> b;
sum += b;
res += 1LL * a * b;
}
if (sum > n) {
cout << -1;
} else if (sum < n) {
cout << 1;
} else {
if (res % n == 1LL * n * (n ... | C++ | bde1f233c7a49850c6b906af37982c27 | 9cd14a0d8553e365c46b43b0ae5b7bb7 | 2,700 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
public class Main {
static final int NONE = -1;
static class Irving {
int n;
int[][] preferences;
int[][] rank;
int[] left;
... | Java | 82add5e87e7c801d8a840f09292e7a1b | 2e5c6c2efcf43888b9a6dccf10f4d7ac | 3,500 | PASSED |
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
#endif
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define PB push_back
#define SZ(x) ((int)(x).size())
using namespace std;
const int N=1005;
int n,who[N],a[N][N];
bool ban[N][N];
deque<int>pref[N];
void G... | C++ | 82add5e87e7c801d8a840f09292e7a1b | 9c49244e916d4f40d55f597cd4f5b2f2 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
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>;
using vd = vector<db>; ... | C++ | 82add5e87e7c801d8a840f09292e7a1b | 158dac92909ee3127566f102c62809a4 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
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>;
using vd = vector<db>; ... | C++ | 82add5e87e7c801d8a840f09292e7a1b | 094b9ac296be2d28b1d77101fa3262a1 | 3,500 | PASSED |
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
#endif
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define PB push_back
#define SZ(x) ((int)(x).size())
using namespace std;
const int N=1005;
int n,who[N],a[N][N];
bool ban[N][N];
deque<int>pref[N];
void G... | C++ | 82add5e87e7c801d8a840f09292e7a1b | 90e7af7b41ebeed679720c65a5f88529 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
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>;
using vd = vector<db>; ... | C++ | 82add5e87e7c801d8a840f09292e7a1b | 346dcc517e0fe893c43967ab77259918 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; ++i)
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define sz(x) (int)(x).size()
#define LL long long
#define mp make_pair
#def... | C++ | 82add5e87e7c801d8a840f09292e7a1b | de2da0c76fbb2b0e5c3ecd0d4931e604 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; ++i)
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define sz(x) (int)(x).size()
#define LL long long
#define mp make_pair
#def... | C++ | 82add5e87e7c801d8a840f09292e7a1b | 9e013c20f2ec3ed9593c4f3400082f06 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; ++i)
#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)
#define sz(x) (int)(x).size()
#define LL long long
#define mp make_pair
#def... | C++ | 82add5e87e7c801d8a840f09292e7a1b | 2fc8802c8872f293d71c954612dcda76 | 3,500 | PASSED |
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#else
#define D(...) ((void)0)
#endif
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define PB push_back
#define SZ(x) ((int)(x).size())
using namespace std;
const int N=1005;
int n,who[N],a[N][N];
bool ban[N][N];
deque<int>pref[N];
void G... | C++ | 82add5e87e7c801d8a840f09292e7a1b | 17fa78fedc57f7b25f61222ec1cc61f8 | 3,500 | PASSED |
import java.io.*;
import java.util.*;
public class E {
static int MOD = (int) 1e9 + 7, inv = (MOD + 1) / 2;
static long sum(long x) {
x %= MOD;
return x * (x + 1) % MOD * inv % MOD;
}
static long sum(long l, long r) {
long ans = sum(r) - sum(l - 1);
if (ans < 0)
ans += MOD;
return ans;
}
public ... | Java | 24f4bd10ae714f957920afd47ac0c558 | dfa35030716cb9e42c3958b06d824855 | 2,400 | PASSED |
import java.io.BufferedOutputStream;
import java.io.Closeable;
import java.io.DataInputStream;
import java.io.Flushable;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.math.BigInteger;
import java.util.InputMismatchException;
/**
* Built using CHelper plug-in
* Actua... | Java | 24f4bd10ae714f957920afd47ac0c558 | 922db010402c5f515036f15a0e414979 | 2,400 | PASSED |
//package bubblecup13.f;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class J {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
final int mod ... | Java | 24f4bd10ae714f957920afd47ac0c558 | 9162350d68a844fe2b32d382a44fb6d1 | 2,400 | PASSED |
/*
⣿⣿⣿⣿⣿⣿⡷⣯⢿⣿⣷⣻⢯⣿⡽⣻⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠸⣿⣿⣆⠹⣿⣿⢾⣟⣯⣿⣿⣿⣿⣿⣿⣽⣻⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣻⣽⡿⣿⣎⠙⣿⣞⣷⡌⢻⣟⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣿⣿⡄⠹⣿⣿⡆⠻⣿⣟⣯⡿⣽⡿⣿⣿⣿⣿⣽⡷⣯⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣷⣿⣿⣿⡀⠹⣟⣾⣟⣆⠹⣯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢠⡘⣿⣿⡄⠉⢿⣿⣽⡷⣿⣻⣿⣿⣿⣿⡝⣷⣯⢿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣯⢿⣾⢿⣿⡄⢄⠘⢿⣞⡿⣧⡈⢷⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢸⣧⠘⣿⣷⠈⣦⠙⢿⣽⣷⣻⣽⣿⣿⣿⣿⣌⢿⣯⢿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣯⣿⢿⣿⡆⢸⡷⡈⢻⡽⣷⡷⡄⠻⣽⣿⣿⡿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣏⢰⣯⢷⠈⣿⡆⢹⢷⡌⠻⡾⢋⣱⣯⣿⣿⣿⣿⡆⢻⡿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡎... | C++ | 24f4bd10ae714f957920afd47ac0c558 | ebae2f5d5d5f4064d3f00f1e8811de68 | 2,400 | PASSED |
#if 1
#ifdef LOCAL
#define _GLIBCXX_DEBUG 1
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <bits/extc++.h>
using namespace __gnu_pbds;
template<class T>
u... | C++ | 24f4bd10ae714f957920afd47ac0c558 | 9720b5d67ea5596027539d8a09dd5553 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int mx = 2000005, mod = 1000000007;
long long dp[61][8];
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while(t--)
{
long long m;
cin >> m;
long long x = m / 4 + 1, y = m / 2 - m / 4 + 1;
... | C++ | 24f4bd10ae714f957920afd47ac0c558 | f27f0b305602fc7f4cdedc672eb9559c | 2,400 | PASSED |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI=acos(-1.0);
#define t1(x) cerr<<#x<<"="<<x<<endl
#define t2(x, y) cerr<<#x<<"="<<x<<" "<... | C++ | 24f4bd10ae714f957920afd47ac0c558 | 561ad7a86a3650e1835fa81b7465dd39 | 2,400 | PASSED |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI=acos(-1.0);
#define t1(x) cerr<<#x<<"="<<x<<endl
#define t2(x, y) cerr<<#x<<"="<<x<<" "<... | C++ | 24f4bd10ae714f957920afd47ac0c558 | 8c94938cc7dff0ea74549daee87bfdff | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
void solve() {
long long x;
scanf("%lld", &x);
int sol;
long long a = x / 2 + 2;
if (a % 2 == 0) sol = 1LL * a / 2 % MOD * (a / 2 % MOD) % MOD;
else sol = (1LL * a / 2 % MOD * (a / 2 % MOD) % MOD + a / 2) % MOD;
printf("%d\n", sol);
}
... | C++ | 24f4bd10ae714f957920afd47ac0c558 | 7975e347cb42b40f790cb7e65121dd52 | 2,400 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;
const int mod = 1000000007, llog = 61;
const long long mmod = m... | C++ | 24f4bd10ae714f957920afd47ac0c558 | cb761e58ffbb0a4a0fd2df9b13593f18 | 2,400 | PASSED |
#include <iostream>
#include <new>
using namespace std;
int compare(const void* a, const void *b)
{
return *(int*)b - *(int*)a;
}
int main()
{
int n;
cin >> n;
int *a = new int[n];
long long sum = 0;
for(int i = 0; i < n; ++i)
{
cin >> a[i];
sum += a[i];
}
qsort(a, ... | C++ | 4266948a2e793b4b461156af226e98fd | 406f2e972ed5b187af0982ccfe252017 | 1,200 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <climits>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long int> v(n);
for(int i=0; i<n; i++) cin>>v[i];
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
long long int res = 0;
l... | C++ | 4266948a2e793b4b461156af226e98fd | 3a2f12bb935cad2dda29a952d6c91336 | 1,200 | PASSED |
#include <iostream>
using namespace std;
long long count[1000001];
long long set[300000];
int main() {
long long n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> set[i];
for (long i = 0; i < n; i++)
count[set[i]]++;
long cur = 0;
for (long i = 1; i <= 1000000; i++)
for (long j = 0; j < count[i]; j++) {
... | C++ | 4266948a2e793b4b461156af226e98fd | 9b17915297f7a136667ad98489de657a | 1,200 | PASSED |
#include<iostream>
#include<list>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<cmath>
#include<map>
#pragma comment(linker, "/STACK:367772160")
using namespace std;
#define y1 stupid_cmath
//const double pi = 2 * acos(0);
long long a[501000];
int main()
{
std::i... | C++ | 4266948a2e793b4b461156af226e98fd | 21d593630048f0636d96561e2af30752 | 1,200 | PASSED |
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<iomanip>
#include<queue>
#include <functional>
#include<set>
using namespace std;
int total,number[300005];
long long ans = 0;
bool cmp(int a, int b)
{
return a > b;
}
int main()
{
cin >> total;
for (int i = 0; i < total; i++)
cin >> n... | C++ | 4266948a2e793b4b461156af226e98fd | 14cd22cbd06306a33fa0be9816fc519a | 1,200 | PASSED |
#include <iostream>
#include <map>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <iomanip>
#include <stdio.h>
#include <ctype.h>
//#pragma comment (linker, "/STACK:167177216")
//-Wl, --stack=
using namespace s... | C++ | 4266948a2e793b4b461156af226e98fd | ba2c0220d4129d885bb15617a0bd2eee | 1,200 | PASSED |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <math.h>
#include <map>
#include <memory>
#include <numeric>
#include <ostream>
#inclu... | C++ | 4266948a2e793b4b461156af226e98fd | 17057f8aff1151b7a305c34a8d17b792 | 1,200 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void main ()
{
long long n;
cin>>n;
vector <long long> a;
a.resize(n);
for (long long i=0;i<n;i++) cin>>a[i];
sort(a.begin(),a.end());
... | C++ | 4266948a2e793b4b461156af226e98fd | a2ab3fee57e28f3af2392fc478a2dbc5 | 1,200 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <iomanip>
#include <set>
#include <deque>
#include <fstream>
using namespace std;
#define forn(i,n) for (int i = int(0); i < int... | C++ | 4266948a2e793b4b461156af226e98fd | 9665e94f4ca4b22037b439e55716313e | 1,200 | PASSED |
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <iomanip>
#include <memory.h>
using namespace std;
const int Nmax= 3*(1e5+17);
int v[Nmax];
int main (void){
//freopen("i.txt",... | C++ | 4266948a2e793b4b461156af226e98fd | 4c2fc9d34220bab7015c825890f50201 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s1,s2;
cin>>s1>>s2;
set<int>s[30];
for(int i=0;i<s1.size();i++) s[s1[i]-'a'].insert(i);//将s1中各个字母的位置按需存储在对应的字母下
int flag=-1;
int ans=1;
for(int i=0;i<s2.size();i++){
int t=s2[i]-'a';
if(s[t].empty()){//如果在... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 7aa578118293effef3ca6a7c922add12 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s1,s2;
cin>>s1>>s2;
set<int>s[30];
for(int i = 0; i<s1.size(); i++) s[s1[i] - 'a'].insert(i);
int flag = - 1;
int ans = 1;
for(int i = 0; i<s2.size(); i++)
{
int t = s2[i] - 'a';
if(s[t].empty())
{
puts("-1");
return 0;
}
set<int>:... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 39e4539aaa3c30e73f5df4fd27ca9a72 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int findMax(vector<int> &vec, int cur) {
int res = -1;
if (vec.size() > 10) {
int l = 0;
int r = vec.size() -1;
while (r > l) {
int mid = (l+r)/2;
if (vec[mid] <= cur) {
... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 107acba0a3ea4d8bf31044340a10634e | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
char s1[10009],s2[1000009];
int a[10009][26],b[26];
int main()
{
while(~scanf("%s %s",s1,s2))
{
memset(a,-1,sizeof(a));
memset(b,0,sizeof b);
int sum=0,flag=0;
int len1=strlen(s1),len2=strlen(s2);
for(int i=0; i<len1; ... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 6e6b4a97e18b1cdf32e006289192a372 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main() {
// 定义变量
string s1, s2;
// 获取输入
cin >> s1 >> s2;
// 建立s1中字符map
vector<int> s1Vec[26];
int s1Size = s1.size();
for (int i = 0; i < s1Size; ++i)
s1Vec[s1[i] - 'a'].push_back(i);
// 遍历s2
int ret = 1;
... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 5ff2bcd7c4948eda2458c49f23cb49be | 1,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;
char s1[10009],s2[1000009];
int a[10009][26],b[26];
int main()
{
while(~scanf("%s %s",s1,s2))
{
memset(a,-1,sizeof(a));
memset(b,0,sizeof b)... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 1b85b5756e32dc04130c7ff2899a3502 | 1,500 | PASSED |
#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
#define LEN_S1 10009
#define LEN_S2 1000009
char g_s1[LEN_S1];
char g_s2[LEN_S2];
int g_st[26][LEN_S1];
int main()
{
while(~scanf("%s %s", g_s1, g_s2))
{
int i = 0, j = 0;//, k = 0;
int len_s1 = 0;
int find = 0... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | c15dd55f38005144905c0a930d4b248b | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s1,s2;
while(cin>>s1>>s2)
{
set<int>s[30];
for(int i=0;i<s1.size();i++) s[s1[i]-'a'].insert(i);
int flag=-1;
int ans=1;
for(int i=0;i<s2.size();i++){
int t=s2[i]-'a';
if(s[t].empty()){... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 2e0b710450963ab4082f91518b36df6c | 1,500 | PASSED |
#include <iostream>
#include <string.h>
using namespace std;
string s1, s2;
int alpha[26];
int relation[26][10009];
int main() {
while (cin>>s1>>s2) {
memset(alpha, 0, sizeof(alpha));
memset(relation, -1, sizeof(relation));
int length1 = s1.length();
int length2 = s2.length();
if (length1 == 0) {
c... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 7b9b9172de3e71c982f263ea06dd26f8 | 1,500 | PASSED |
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define S1_LEN 10009
#define S2_LEN 1000009
char g_s1[S1_LEN];
char g_s2[S2_LEN];
int g_st[26][S1_LEN];
int main()
{
while(~scanf("%s %s", g_s1, g_s2))
{
int i = 0, j = 0;
int len_s1 = 0;
int find = 0;
int need ... | C++ | 1b83529ea4057c76ae8483f8aa506c56 | 7d47590c8dc5064711bbfde145ee8547 | 1,500 | PASSED |
/**
* author: Ashutosh Nayak (@nayakashutosh9)
* created: [2020-10-26 16:37]
* "Compete against yourself"
**/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | 9976a207b49e0d629bc06a6fdd92ca5f | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
#define ff first
#define ss seco... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | d8fbc0f373dc3129aa13b551d34221b9 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
#define ff first
#define ss seco... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | fdaf4a7d94e84f64548205f260dfcaec | 1,700 | PASSED |
#include <iostream>
#include <random>
#include <chrono>
#include <algorithm>
#include <set>
#include <stack>
#define rep(i, x) for(ll i = 0; i < x; i++)
#define CONCAT_(x,y) x##y
#define CONCAT(x,y) CONCAT_(x,y)
#define _v1 CONCAT(qyw1, __LINE__) // unique name in same line (otherwise use __COUNTER__)
#define _v2 CONCA... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | a7442b404797ea686279d65e06948a35 | 1,700 | PASSED |
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
inline int read() {
int x = 0, s = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
s = -1;
if (c == EOF)
return -0x7fffffff - 1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + (c ... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | 7ffe635ec01c73e34061b174e2406da4 | 1,700 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <chrono>
#define int long long
#define ld long double
#define db double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define m... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | 6b088d2a76a501d9edac7d01e981c7bf | 1,700 | PASSED |
//@sakshjha
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define JALDI ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define pb push_back
#define pi 3.14159265358979
const ll mod = 1e9+7;
const ll N = 2e5 +5 ;
int main()
{
JALDI
ll i,j,tc;
//... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | f36442f046c639fcff6feefbf3f60b2b | 1,700 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define PI 3.14159265359
#define sz(c) (int)c.size()
#define len(c) (int)c.length()
#define hcf(a, b) __gcd(a, b)
#define all(... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | cc0762cc4272431022efb427541f2a5f | 1,700 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#define _Parity_check_ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#pragma GCC optimize("Ofast")
#define ll long long
#define ld long double
#define pb push_back
#define all(x) x.begin(),x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | 312f875f8abfe99a006246b1fb149dfc | 1,700 | PASSED |
#include<bits/stdc++.h>
#pragma GCC diagnostic warning "-std=c++11"
using namespace std;
const int N = 2e5 + 10;
int n;
int f[N], r[N], ind[N], ans[N], x[N];
set < int > s, st;
main() {
cin >> n;
int x1 = 0, x2 = 0;
char c[2 * n + 1];
for(int i = 1; i <= 2 * n; i++) {
cin >> c[i];
if(c[i... | C++ | 5fa2af185c4e3c8a1ce3df0983824bad | e246594d12f1b68cbcdecd45c1bb2394 | 1,700 | PASSED |
#include <bits/stdc++.h>
#include<algorithm>
#include<string>
#include<math.h>
#define pf printf
#define sf scanf
#define read(k,a,b) sf("%I64d %I64d %I64d",&k,&a,&b)
#define pi acos(-1)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define REP(i, n) for(int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll... | C++ | 98de093d78f74273e0ac5c7886fb7a41 | 95740bbc1c419f4d21bb5779d2a5b31a | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
main()
{
long long k,a,b;
while(cin>>k>>a>>b)
{
long long ans;
if(a==0&&b==0)
ans=1;
else if(a<0&&b==0)
{
a=a*-1;
ans=a/k+1;
}
else if(a==0&&b>0)
{
ans=b/k+1;
}
else if(a<0&&b<0)
{
a=a*-1;
b=b*-1;
ans=(a/k)-((b-1)/k);
}
else if(... | C++ | 98de093d78f74273e0ac5c7886fb7a41 | 73108068323a0d64b543ccba47ddc9ed | 1,600 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
#define eps 1e-10
#define maxl 100010
#define mem(i,j) me... | C++ | 98de093d78f74273e0ac5c7886fb7a41 | 0f2a59406e72d28133b99e3814161394 | 1,600 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;
long long a1 , a2 , k , a3;
int main(){
cin >> k >> a1 >> a2 ;
if(a1 >= 0 && a2 > 0){
a3 = a2 / k - a1 / k ;
if(a1 % k == 0){
a3++ ;
}
}
... | C++ | 98de093d78f74273e0ac5c7886fb7a41 | 58266267277c44a34a4b543d85171dcd | 1,600 | PASSED |
//A,Elebereth,Gilthoniel mantae!
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<cstdio>
#include<stack>
#include<queue>
#include<cstring>
using namespace std;long long k,a,b;
long long fun(long long x)
{
return x/k+1;
}
int main()
{
cin>>k>>a>>b;if(a<b... | C++ | 98de093d78f74273e0ac5c7886fb7a41 | 41b76a2238c991447ee2925a86cfec50 | 1,600 | PASSED |
#include<iostream>
using namespace std;
int main()
{
long long int a,b,k,count=0;
cin>>k>>a>>b;
if(a>0 && a%k!=0 )
cout<<(b/k)-(a/k);
else if(a<0&&b<0&&b%k!=0)
cout<<(b/k)-(a/k);
else
cout<<(b/k)-(a/k)+1;
} | C++ | 98de093d78f74273e0ac5c7886fb7a41 | 629624b7ced2bc6a5b1fa4f7c0273dfc | 1,600 | PASSED |
// *** Solution By Bektemir Doolotbek uulu *** //
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long k,a,b;
cin>>k>>a>>b;
if(b>0 && b%k!=0){
b=b/k*k;
}
else if(b<0 && b%k!=0){
b=(b/k-1)*k;
}
cout<<(b-a+k)/k<<endl;
return 0;
}
| C++ | 98de093d78f74273e0ac5c7886fb7a41 | 353175dcf91a56b557c80c17a47c0310 | 1,600 | PASSED |
#include<iostream>
using namespace std;
long long int a,b,k;
main()
{
cin>>k>>a>>b;
a=a+(k-(a%k+k)%k)%k;
b=b-(b%k+k)%k;
cout<<(b-a)/k+1<<endl;
} | C++ | 98de093d78f74273e0ac5c7886fb7a41 | 198b3cfc911567f74b2691b89996eeff | 1,600 | PASSED |
# ========= /\ /| |====/|
# | / \ | | / |
# | /____\ | | / |
# | / \ | | / |
# ========= / \ ===== |/====|
# code
def sexy(a):
a.append(0)
# print(a)
k = sum(a)
b = a[:]
s0 = []
s1 = []
i = 0
... | Python | a981e174f1f3864d50deb541834f7831 | 40d628d4f76d1f5507af70d9143f3207 | 1,900 | PASSED |
g = list(map(int, input().split()))
v = [-1, 1, 0, 0, 1, -1]
g.insert(0, 0)
g.append(0)
for i in range(1, 5, 1):
if (g[i] == 0):
continue
s = [i]
c = g.copy()
c[i] -= 1
#print(s)
while (c[1] + c[2] + c[3] + c[4] > 0):
a = s[-1] - 1
b = s[-1] + 1
if (v[b] > v[a])... | Python | a981e174f1f3864d50deb541834f7831 | 69f024596143bb35efe4e2a80087f626 | 1,900 | PASSED |
a,b,c,d=[int(x) for x in input().split(' ')]
if abs(a+c-b-d) > 1:
print('NO')
else:
if d > c:
if d-c > 1:
print('NO')
else:
if a!=0 or b!=0:
print('NO')
else:
print('YES')
for i in range(c):
p... | Python | a981e174f1f3864d50deb541834f7831 | 7c1d53170771b9e5fc19ba910dc2f339 | 1,900 | PASSED |
def solve1(arr, start):
wynik = []
id = start
while True:
if arr[id] == 0:
if sum(arr) == 0:
break
return "NO\n"
arr[id] -= 1
wynik.append(str(id))
# print(id)
if id == 0:
id = 1
elif id == 1:
id ... | Python | a981e174f1f3864d50deb541834f7831 | 30407e43a391259f60b1c621004946a5 | 1,900 | PASSED |
import sys
import math,bisect
sys.setrecursionlimit(10 ** 5)
from itertools import groupby,accumulate
from heapq import heapify,heappop,heappush
from collections import deque,Counter,defaultdict
I = lambda : int(sys.stdin.readline())
neo = lambda : map(int, sys.stdin.readline().split())
Neo = lambda : list(map(int, sys... | Python | a981e174f1f3864d50deb541834f7831 | 53e6e57fb7119f948724d0ad9a1fdb94 | 1,900 | PASSED |
a = list(map(int, input().split(" ")))
for i in range(4):
res = []
b = []
if a[i] != 0:
for j in range(4):
b.append(a[j])
j = i
b[j] -= 1
res.append(j)
#print(res)
while(1):
chk = 1
if j == 0:
if b[j+1] > 0:
... | Python | a981e174f1f3864d50deb541834f7831 | 634bc35b8f29f73fefc4f347a26e72b6 | 1,900 | PASSED |
import copy
inp = [int(i) for i in input().split()]
sum=0
for i in inp:
sum+=i
for i in range (4):
if(inp[i]!=0):
ans=[]
tmp=copy.copy(inp)
ans.append(i)
tmp[i]-=1
pointer = i
for j in range (sum-1):
if pointer!=0 and tmp[pointer - 1] > 0:
... | Python | a981e174f1f3864d50deb541834f7831 | 5f59d7ed825e8e5ddbacfed8a841dda9 | 1,900 | PASSED |
T = 1
MAX = 3*(10**5) + 10
for t in range(1, T + 1):
# print('Case #' + str(t) + ': ', end = '')
# n = int(input())
a, b, c, d = map(int, input().split())
a_, b_,c_, d_ = a, b, c, d
if a == 0 and b == 0:
if abs(c - d) > 1:
print("NO")
continue
if c > d:
print("YES")
ans = ("2 " * (c - d > 0) + ... | Python | a981e174f1f3864d50deb541834f7831 | 11eee549ce2af0fc6f5444dd7dbd666a | 1,900 | PASSED |
str1 = input()
def go(x):
s = [int(i) for i in str1.split()]
res = []
while sum(s) > 0:
res.append(x)
s[x] -= 1
if s[x] < 0:
return
if x == 0:
x = 1
elif x == 1:
if s[0] < s[1] or s[0] == 0:
x = 2
else:... | Python | a981e174f1f3864d50deb541834f7831 | 93b9dead0d43bc06d30770e2484961c0 | 1,900 | PASSED |
import sys
a,b,c,d=[int(i) for i in raw_input().split()]
l=[]
flag=0
if a==b+1 and c==0 and d==0:
flag=1
l+=[0,1]*b+[0]
elif b==a and a==0 and d==c+1:
flag=1
l+=[3,2]*c+[3]
if flag:
print "YES"
for i in l:
print i,
sys.exit()
n1=b-a
n2=c-d
if abs(n1-n2)>1 or n1<0 or n2<0:
print "... | Python | a981e174f1f3864d50deb541834f7831 | fdba360a44457c90e1adeea028a8eb85 | 1,900 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n+1];
int soam=0,soduong=0,so0=0;
for (int i=1;i<=n;i++)
{
cin>>a[i];
if (a[i]<0)
soam++;
else if (a[i]>0)
soduong++;
else
so0++;
}
if (soduong=... | C++ | 03cf2cc26c84aab685ee78a1d6318b30 | ea28a9c9dfe1b814131650cffc240148 | 1,100 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n, array[100];
vector<int> n1, n2, n3;
bool n1_tiene1menos=false, n2_tiene2menos=false;
int main(){
cin >> n;
n1.clear();
n2.clear();
n3.clear();
for(int i=0; i<n; i++)
cin>> array[i];
//
for(int i=0;... | C++ | 03cf2cc26c84aab685ee78a1d6318b30 | ae5429de0b3b5d0e07e113bdb67d17cd | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ios std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define M 1000000007
#define mp make_pair
#define pb push_back
#define PB pop_back
#define sl(a) (int)a.length()
#define sz(a) (int)a.size()
#define lcase(a) (char)tolower(a)
#define ucase(a) (cha... | C++ | 03cf2cc26c84aab685ee78a1d6318b30 | 953b0bcbdf23c620fb80c000b98badc9 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define all(c) c.begin(),c.end()
#define REP(i,a,b) for(int i=a;i<=b;++i)
#define tr(container,it) \
for(auto it=container.begin();it!=container.end();++it)
typedef long long ll ;
typedef vector<int> vi;
#define mod 1000000007
bool isLucky(int x){
string s=to_string(x)... | C++ | 03cf2cc26c84aab685ee78a1d6318b30 | fa14742db694e5bf416dc44b2cc3ecd8 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int q,n=0,p=0,z=0;
cin>>q;
int x;
vector<int> ng ,ps,zr;
for(int i=0;i<q;i++){
cin>>x;
if(x<0) {
n++;
ng.push_back(x);
}
else if(x>0){
p++;
... | C++ | 03cf2cc26c84aab685ee78a1d6318b30 | dbdcb9518ad0b72f4854a8a2ea51fea8 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ENGZ ios::sync_with_stdio(0);ios_base::sync_with_stdio(0);cin.tie(0) , cout.tie(0)
using namespace std;
int main()
{
ENGZ ;
int n , arr[105] ,ne[105],po[105],m = 0 , k = 0,j=0;
cin >> n ;
for(int i=0;i<n;i++){
cin >> arr[... | C++ | 03cf2cc26c84aab685ee78a1d6318b30 | 8afb7e81dc30195936f2f686c269e3da | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n];
int small[n],big[n],eq[n];
int cs=0,cb=0,ce=0;
for(int i=0;i<n;i++)
{
cin>>arr[i];
if(arr[i]<0)
{
small[cs]=arr[i];
cs++;
}
else if(arr[i]==0)
{
eq[ce]=arr[i];
ce++;
}
else if(arr[i]>0)
{
big[... | C++ | 03cf2cc26c84aab685ee78a1d6318b30 | 00fdbaf5f7f2d11deaf49d8ca98b1bad | 1,100 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.