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 |
|---|---|---|---|---|---|
n,k=map(int,input().split())
l=list(map(int,input().split()))
s=list(map(int,input().split()))
sum1=0
dic={}
for i in range(n):
if s[i]!=0:
sum1=sum1+l[i]
else:
dic[i]=l[i]
#print('sum1',sum1)
#print(dic)
if len(dic)!=0:
l2=list(dic.values())
s2=list(dic.keys())
m=len(l2)
sum2=l2... | Python | 0fbac68f497fe189ee088c13d0488cce | 8cec0b3530ae2b8739ffa20bcde38d6e | 1,200 | PASSED |
n,k = map(int,input().split())
a = list(map(int,input().split()))
t = list(map(int,input().split()))
sum1 =0
count = 0
for i in range(n):
if(t[i] == 1):
sum1+=a[i]
elif(t[i] == 0 and i < k):
count+=a[i]
ans =count
i=1
#print(str(sum1) +' = sum')
while(i<n-k+1):
#print(str(a[i]) + ' = a[i]')... | Python | 0fbac68f497fe189ee088c13d0488cce | 24881368cb5a97ceb20da62060bf6abb | 1,200 | PASSED |
n, t = map(int, input().split())
theory = list(map(int, input().split()))
awake = list(map(int, input().split()))
have = 0
for i in range(0, n):
if(awake[i] == 1):
have += theory[i]
theory[i] = 0
# print(have)
# print(theory)
sum_theory = []
tmp = 0
for i in range(0, n):
tmp += theory[i]
... | Python | 0fbac68f497fe189ee088c13d0488cce | 2f00d7b3744443c7e688131836bdfc97 | 1,200 | PASSED |
(n, k) = map(int, input().split())
lst = []
for x in input().split():
lst.append(int(x))
array = []
for x in input().split():
array.append(int(x))
mass1 = [0]
for x in range(n):
mass1.append(mass1[-1] + lst[x])
mass2 = [0]
for x in range(n):
mass2.append(mass2[-1] + lst[x] * array[x])
ans = 0
for x... | Python | 0fbac68f497fe189ee088c13d0488cce | f148066b8e61f7aad723c74b44386594 | 1,200 | PASSED |
I = lambda : map(int,input().split())
n,k = I()
li = list(I())
le = list(I())
d={}
su=0
for i in range(n) :
su+=li[i]*le[i]
i=0
suu=su
t=0
for i in range(k) :
if le[i]==0 :
suu += li[i]
ans = suu
for i in range(k,n) :
if le[i]==0 :
suu+=li[i]
if le[i-k]==0 :
suu-=li[i-k]
ans=... | Python | 0fbac68f497fe189ee088c13d0488cce | 007a9eea2fd27a0d13874868fcebf611 | 1,200 | PASSED |
n,k = map(int,input().split())
lec = [int(i) for i in input().split()]
sleep = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
if sleep[i]:
cnt += lec[i]
lec[i] = 0
last = sum(lec[0:k])
Max= last
for i in range(k,n):
cur = last + lec[i] - lec[i-k]
if cur > Max: Max = cur
la... | Python | 0fbac68f497fe189ee088c13d0488cce | 6dc5e73b98e6268a98a447baf9d8ebe6 | 1,200 | PASSED |
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
p=[0]
ans=0;
e=0
for i in range(n):
if i>0:
p.append(p[i-1])
if b[i]==1:
ans+=a[i]
else:
p[i]+=a[i]
for i in range(k-1,n):
e=max(e,p[i]-(p[i-k] if i-k >= 0 else 0))
print(ans+e)
| Python | 0fbac68f497fe189ee088c13d0488cce | eea9f982e7f18b9c079e9eaad57b203f | 1,200 | PASSED |
options = list(map(int, input().split(" ")))
n = options[0]
awake = options[1]
lecture = [0] + list(map(int, input().split(" ")))
sleep = [0] + list(map(int, input().split(" ")))
sum_l1 = [0]
sum_l2 = [0]
output = 0
max_n = 0
for minute in range(1, n + 1):
sum_l1.append(sum_l1[minute - 1] + lecture[minute] * sl... | Python | 0fbac68f497fe189ee088c13d0488cce | df10b97476e97a28086991c3680dce2f | 1,200 | PASSED |
n,k = map(int,input().split())
weights = [int(x) for x in input().split()]
awaketime = [int(x) for x in input().split()]
asleeptime = [1-x for x in awaketime]
awaketheorems = [weights[i]*awaketime[i] for i in range(n)]
asleeptheorems = [weights[i]*asleeptime[i] for i in range(n)]
awaketotal = sum(awaketheorems)
asleept... | Python | 0fbac68f497fe189ee088c13d0488cce | 54e722da0460f33d3d5bad75c5c1019f | 1,200 | PASSED |
# http://codeforces.com/problemset/problem/961/B
def start_index(items, l):
current_sub = sum(items[0:l])
max_sub = current_sub
currentt_index = 0
max_index = 0
for i in items[l:]:
current_sub += i
current_sub -= items[currentt_index]
currentt_index += 1
if current_sub > max_sub:
max_sub = current_sub... | Python | 0fbac68f497fe189ee088c13d0488cce | 43bd538d577777e443a06b621fb70316 | 1,200 | PASSED |
#include<stdio.h>
void merge(int arr[][4], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1][4], R[n2][4];
for (i = 0; i < n1; i++){
L[i][0] = arr[l + i][0];
L[i][1] = arr[l + i][1];
L[i][2] = arr[l + i][2];
L[i][3] = ar... | C++ | 036ecfcf11c3106732286765e7b7fcdd | e79523348d36a00a0c45e64bddf7409e | 2,100 | PASSED |
#include<stdio.h>
void merge2(int arr[][4], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1][4], R[n2][4];
for (i = 0; i < n1; i++){
L[i][0] = arr[l + i][0];
L[i][1] = arr[l + i][1];
L[i][2] = arr[l + i][2];
L[i][3] = ... | C++ | 036ecfcf11c3106732286765e7b7fcdd | 4b09cb6e508d9882caf72f306bf4b5f8 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
ty... | C++ | 036ecfcf11c3106732286765e7b7fcdd | d798ebffbb9b1d77ac0514bcd9bb59e1 | 2,100 | PASSED |
#include "bits/stdc++.h"
#ifdef UNITTEST
#include "cppunit/extensions/HelperMacros.h"
#include "cppunit/ui/text/TestRunner.h"
#endif
namespace joshu {
/* Utils */
inline namespace {
template<typename Lhs, typename Rhs,
typename std::enable_if<
std::is_integral<Lhs>::value && std::is_signed<Lhs>:... | C++ | 036ecfcf11c3106732286765e7b7fcdd | ab4f5b4e2b61391f5e45f79e62e53fa1 | 2,100 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define pb push_back
#define pp(a, b) pair <a, b>
#define ll long long
#define ld long doub... | C++ | 036ecfcf11c3106732286765e7b7fcdd | dc526537bccdd4f0cfd9e9ac36259395 | 2,100 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define pb push_back
#define pp(... | C++ | 036ecfcf11c3106732286765e7b7fcdd | 0dc6c2cc28d17625a00e389ef29dda37 | 2,100 | PASSED |
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin()... | C++ | 036ecfcf11c3106732286765e7b7fcdd | 33cb3d090fb3cf0ae6515d2722bf0cb9 | 2,100 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | C++ | 036ecfcf11c3106732286765e7b7fcdd | 2ad8f96d665ed3b1ac21c1236f690c82 | 2,100 | PASSED |
#include<bits/stdc++.h>
#define pb push_back
#define y second
#define x first
using namespace std;
typedef long long INT;
typedef pair<int, int> pii;
template<typename T, typename U> inline void smin(T &a, const U &b) {if(a>b) a=b;}
template<typename T, typename U> inline void smax(T &a, const U &b) {if(a<b) a=b;}
#d... | C++ | 036ecfcf11c3106732286765e7b7fcdd | 38a8969cd808ac5782ca1ae3b9bee9a4 | 2,100 | PASSED |
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> pi3;
#define NN 100100
pi3 A[NN],B[NN];
int l[NN],r[NN],L[NN],R[NN];
multiset <int> ed,st;
set <pii> ss;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in","r",stdin);
freopen("out.out","w",s... | C++ | 036ecfcf11c3106732286765e7b7fcdd | f9c5778ec110757358aa29012762e022 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int __int64
vector <int> lbuf, rbuf;
int ans = 0;
int depth_x[22], depth_y[22];
void mergesort(vector <int> & a, int l, int r, int depth) {
if (r == l) {
return;
}
if (depth <= 0) {cout<< "xzxc"; exit(0);}
int mid = (l + r) / 2;
mergesort... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | 7905a8f41ae2f3caa1648fe3ef6a605d | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar,val) memset(... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | 0e2a98e63427a4b8211441a29ae82c76 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, arr[1100000], counter = 1, m, q, arr1[1100000];
ll inter[4000100], exter[4000100], totext[4000100], totint[4000100];
ll lev_inter[30], lev_exter[30], lev_tote[30];
map<int, int> m1;
vector< vector<int> > st(2500100);
void build(int a, int b,... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | d5a41443e980db9af4e17e1f50c288b7 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, arr[1100000], counter = 1, m, q;
ll inter[4000100], exter[4000100], totext[4000100], totint[4000100];
ll lev_inter[30], lev_exter[30], lev_tote[30];
vector< vector<int> > st(2500100);
void build(int a, int b, int index, int l)
{
if (a == b)... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | d13d12b0d2890ee9b863cfbe3fa2530e | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, arr[1100000], counter = 1, m, q;
ll inter[4000100], exter[4000100], totext[4000100], totint[4000100];
ll lev_inter[30], lev_exter[30], lev_tote[30];
vector< vector<int> > st(2500100);
void build(int a, int b, int index, int l)
{
if (a == b)... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | ece37ed9c451d67c3395f4eaa23d294a | 2,100 | PASSED |
#include <iostream>
#include <fstream>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <iterator>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | 61ba483a9c07e31b0790e2638c8f8e67 | 2,100 | PASSED |
#include <iostream>
#include <fstream>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <iterator>
#include <ext/pb_ds/assoc_container.hpp>
#define _m_ m--
#define x... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | eac25c54ab64c18b6dc842c70558f977 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define MAX 1048581
#define ll long long
int BIT[MAX], n, cnt[MAX];
int arr[MAX];
vector<int> V;
map<int, int> mp;
ll inv[25], eq[25], wh[25], t[25], t1[25], po[50];
void update(int pos, int val)
{
for(; pos<MAX; pos+= pos&(-pos)){
BIT[pos] += val;
}
}
i... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | b483e80f842c5eef3fe53cb58794b23e | 2,100 | PASSED |
#include<iostream>
using namespace std;
long long nums[1048576],numsrev[1048576];
long long cpy[1048576];
long long cnts[64],cntsrev[64];
void msort1(long long l,long long r,long long s) {
if(l==r) {
return;
}
msort1(l,(l+r)/2,s-1);
msort1((l+r)/2+1,r,s-1);
for(long long i=l; i<=r; i++) {
... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | 9ae6a150d1a9551e04aa581a8ac29d76 | 2,100 | PASSED |
#include <cstdio>
//#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (... | C++ | ea7f8bd397f80ba7d3add6f9609dcc4a | 57696af4449139f0adb553d2e44c41ae | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
namespace debug{
void __(short x){cout<<x;}
void __(int x){cout<<x;}
void __(long long x){cout<<x;}
void __(unsigned long long x){cout<<x;}
void __(double x){cout<<x;}
void __(long double x){cout<<x;}
void __(char x){cout<<x;}
void __(const ... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | a634e358db46696d6f4f459071a30e05 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
const int N = 1e5 + 10;
const int oo = 1e15;
typedef pair<int, int> ii;
int n, q, st;
int d[10*N + 1], ver[N];
vector<ii> vi[10*N + 1];
void build(int i, int l, int r) {
if(l > r) return;
if(l =... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | 24bf8770486f5d1111f7c1c9367d9c90 | 2,300 | PASSED |
#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define forr(i,p,n) for(ll i=p;i<n;i++)
#define tam 5010010
#define offset 30010
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ii> iiii;
typedef vector<ll> vi;
const ll MOD=1e9+7;
... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | 7d2fbbe3c15c6e0a51f4ffce74b6f25a | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define vll vector<ll>
#define... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | 8e5ff041b3315a61b33153b30d727c48 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define vll vector<ll>
#define... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | 9a972b84a16facd3c308e6caff86991c | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define vll vector<ll>
#define... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | 77c1f0dae5a6b6a7a8a2c38361d89dc0 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define vll vector<ll>
#define... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | b1ddc39e42e5d4b12e14d773b2492489 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n, q;
int s;
int seg(int node, int idx) {
if(idx == 1) return node;
else if (idx == 2) return node + (4 * n);
else return node + (8 * n);
}
typedef pair <int, int> pii;
vector <pii> g[1000010];
void build(int c = 1, int b = 1, int e = n) {
if(b == e... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | 0d6857339d3a6b4fa3d34b4c1d5203fe | 2,300 | PASSED |
#include "bits/stdc++.h"
using namespace std;
const int N = 1e6 + 5;
int n, m, s;
long long dist[N];
vector<pair<int, int>> g[N];
void init(int u, int b, int e) {
if (b == e) {
g[b].emplace_back(u + n, 0);
g[u + 5 * n].emplace_back(b, 0);
return;
}
int l = u << 1, r = l + 1, m = (... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | 74564815bb918d4bc0886eeecdab4d24 | 2,300 | PASSED |
#include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "_/debug.h"
#else
#define out(...) 69;
#endif
const int N = 2e6 + 6;
typedef pair<int, long long> pii;
int n, m, s;
int t, u, v, l, r, w;
int node[N];
long long d[N];
vector<pii> g[N];
int id(int u, int t) {
if (t == 1) return u;
... | C++ | b22f5f4a5d15030fbf7756f81caafb3c | 27e486af639dbac7f0eecd75225210ed | 2,300 | PASSED |
using System;
using System.Linq;
using System.Collections.Generic;
class Program
{
static int cre(int q, int w)
{
if (w > 0)
{
return cre(w, q%w);
}
else
{
return q;
}
}
static void Main()
{
string ss = Console.ReadLin... | C# | 71dc07f0ea8962f23457af1d6509aeee | 1d52639f3cee11ee5a910c42cb136cf1 | 1,700 | PASSED |
using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
//using System.Numerics;
using System.Text;
using System.Threading;
// (づ°ω°)づﾐe★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solver
{
int Gcd(int a, int b)
{
if (b == 0)
return a;
... | C# | 71dc07f0ea8962f23457af1d6509aeee | 686457d0cacab2ed7e9e74cc040ba922 | 1,700 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace C
{
class Program
{
static void Main(string[] args)
{
int n = int.Parse(Console.ReadLine());
var gcds = Console.ReadLine().Split().Select(int.P... | C# | 71dc07f0ea8962f23457af1d6509aeee | 3a22a7e2c932d99865d7846cd22c16ba | 1,700 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace C
{
class Program
{
static void Main(string[] args)
{
int n = int.Parse(Console.ReadLine());
var gcds = Console.ReadLine().Split().Select(int.P... | C# | 71dc07f0ea8962f23457af1d6509aeee | 749f16872159052fb55c67f5b6cd989c | 1,700 | PASSED |
using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
class Program
{
//////////////////////////////////////////////////
class tutu
{
public int count;
}
int gcd(int a, int b)
{
return (b!=0) ? gcd(b, a % b) : a;
}
void Solu... | C# | 71dc07f0ea8962f23457af1d6509aeee | 30a3fb513ea5a517b531e99e5d69061b | 1,700 | PASSED |
#include <stdio.h>
#include <stdlib.h>
#define MAX 555555
int a[MAX];
int used[MAX];
int alr[MAX];
int rem[MAX];
int gcd(int x, int y) {
return x == 0 ? y : gcd(y % x, x);
}
int cmp(const void *a, const void * b) {
return *((int*) a) - *((int*) b);
}
int main() {
int n, i;
scanf("%d", &n);
... | C | 71dc07f0ea8962f23457af1d6509aeee | 74da107a2fc552c47785974e8aba34b7 | 1,700 | PASSED |
#include<stdio.h>
#include<stdlib.h>
typedef unsigned u;
int F(const void*x,const void*y){return*(int*)x-*(int*)y;}
typedef struct S
{
u val;
struct S *lc,*rc;
}v;
v* alloc()
{
v *x;
x=(v*)malloc(sizeof(v));
x->lc=x->rc=NULL;
x->val=0;return x;
}
v *p,*q;
u tes(u n)
{
for(q=p;n;n>>=1)
{
if(n&1){if(q->lc==NULL... | C | 71dc07f0ea8962f23457af1d6509aeee | 09285a4234e5e759f5227dfe596c61e5 | 1,700 | PASSED |
#include <stdio.h>
#include <stdlib.h>
#define N 500
int compare(const void *a, const void *b) {
int ia = *(int *) a;
int ib = *(int *) b;
return ib - ia;
}
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
int main() {
static int gg[N * N], hh[N * 2], aa[N];
static char marked[N * N];
int n, k, ... | C | 71dc07f0ea8962f23457af1d6509aeee | 403669e60bc0b61cef2fff17221fe29b | 1,700 | PASSED |
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int num;
int cnt;
} Node_t;
Node_t B[250000];
int Size;
int Ans[500];
int AnsSize;
int cmp(const void *a, const void *b)
{
return (*(Node_t *)b).num - (*(Node_t *)a).num;
}
int GCD(int a, int b)
{
int temp;
while(b) {
temp = a;
... | C | 71dc07f0ea8962f23457af1d6509aeee | 2f8dd8292794146dcbd7e8a7077d3a4f | 1,700 | PASSED |
#include<stdio.h>
long a[251111],v[251111],cc[251111],rem[251111];
void swap(long *aaa,long *bbb)
{
long t;
t=*aaa;
*aaa=*bbb;
*bbb=t;
}
void qsort(long low,long high)
{
long i=low,j=high,mid=a[(low+high)/2];
while(i<j)
{
while(a[i]<mid)i++;
while(a[j]>mid)j--;
if(i<=... | C | 71dc07f0ea8962f23457af1d6509aeee | eaa383daa26ed1782a135a09da1e0df9 | 1,700 | PASSED |
// +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\
#include <bits/stdc++.h>
using namespace std ;
int const N = 2000 + 20 , K = 11 + 1 , MASK = (1 << K) + 20 , mod = 1e9 + 7 ;
int n , a[N] , k , dp[N][MASK] ;
inline void add (int &a , int b) {
a += b ;
if (a >= mod) {
a -= mod ... | C++ | 30340b756394abda26f714b8cc589d27 | 27ab498a9c500743929f2674722eaa56 | 2,000 | PASSED |
#include<iostream>
#include<cstdio>
using std::min;
int n,k,f[2057][2]={0,1};
int main(){
scanf("%d%d",&n,&k);
for(int i=0;n--;i=!i){
int x,xx=1<<k;
scanf("%d",&x);
for(int j=0;j<=xx;++j)f[j][i]=0;
for(int j=0;j<=xx;++j){
int yy=!(i%2),zz=j/2%2;
if(x!=4)(f[min(j+2,xx)][i]+=f[j][yy])%=1000000007;
if(x!=2)(f[zz?4:min(j+4... | C++ | 30340b756394abda26f714b8cc589d27 | 52ce63056f48a60ae97898d7baa7405b | 2,000 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int n, k; cin >> n >> k;
int d[2049][2] = {0}; d[0][1] = 1;
for(int i = 0; n--; i ^= 1)
{
int x; cin >> x;
for(int j = 0; j <= 1 << k; ++j) d[j][i] = 0;
for(int j = 0; j <= 1 << k; ++j)
{
if(x != 4) (d[min(... | C++ | 30340b756394abda26f714b8cc589d27 | df7d778031ebd79718034188cfeaff00 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 1<<13,M= 2005,mod = 1e9+7;
int dp[M][N],n,a[N],k;
int getst(int x,int s){
if(x>=k)return x;
if(x&(1<<(s-1)) )return 1<<s;
int i;
for(i=s;i<12;++i){
if(!(x&(1<<i) )){
x|= 1<<i;break;
}
else
x^= 1<<i;
}
if(x>=k)return x;
return x;
}
int sol... | C++ | 30340b756394abda26f714b8cc589d27 | 731e76e7fa0fecf4e206a258abdbc2b5 | 2,000 | PASSED |
#include <stdio.h>
#include <string.h>
const int MOD = 1000000007;
const int N = 2005;
const int M = 8050;
int n, k, num[N], dp[N][M][2], vis[N][M][2];
int solve(int len, int s, int flag) {
if (s>=(1<<k)) flag = 1;
if (vis[len][s][flag])
return dp[len][s][flag];
vis[len... | C++ | 30340b756394abda26f714b8cc589d27 | 56f704f733a06af61508fe3dd0a89b7a | 2,000 | PASSED |
#include <bits/stdc++.h>
#define mod 1000000007;
using namespace std;
typedef long long ll;
const int maxn=2049;
ll dp[maxn][maxn][2];
int a[maxn];
int main()
{
int n,k;
cin>>n>>k;
k = pow(2,k);
memset(dp,0,sizeof(dp));
for(int i = 1; i <= n; i++)
cin>>a[i];
dp[0][0][0] = 1;
for(in... | C++ | 30340b756394abda26f714b8cc589d27 | dd22dfaf6afbf90d6201a5bebe0ce462 | 2,000 | PASSED |
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define rint register int
using namespace std;
const int maxn=2086;
const int MOD=1000000007;
int f[maxn][1<<12],n,k;
inline void add(int &a,int b){
a=a+b;
if (a>=MOD)a-=MOD;
}
inline void check(){
for (rint i=1;i<=n;++i){... | C++ | 30340b756394abda26f714b8cc589d27 | 0e11a73f8c20a39ca9e0e37685bdaf06 | 2,000 | PASSED |
#include <bits/stdc++.h>
#define mod 1000000007;
using namespace std;
typedef long long ll;
const int maxn=2049;
ll dp[maxn][maxn][2];
int a[maxn];
int main()
{
int n,k;
cin>>n>>k;
k = pow(2,k);
memset(dp,0,sizeof(dp));
for(int i = 1; i <= n; i++)
cin>>a[i];
dp[0][0][0] = 1;
for(in... | C++ | 30340b756394abda26f714b8cc589d27 | 231bf579de71d184f27145aef39ab422 | 2,000 | PASSED |
#include <algorithm>
#include <iostream>
#include <cstdio>
using namespace std;
const int K = 10, mod = 1e9 + 7;
int f[2][ (1 << K) + 1 ];
int main() {
int n, k;
cin>>n>>k;
k--;
for (int i = f[0][0] = 1; i <= n; i++) {
int x;
cin>>x;
fill(&f[i & 1][0], &f[i & 1][1 << k] + 1, 0);
for (int j=0; j <= (1 << k... | C++ | 30340b756394abda26f714b8cc589d27 | 36f5eaf8cfd3493deba259d3065e3237 | 2,000 | PASSED |
#include <bits/stdc++.h>
#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 p=1e9+7;
int n,k;
int dp[2005][4096];
int main(){
dp[0][0]=1;
scanf("%d%d",&n,&k);
rep(i,1,n) {
int x;
scanf("%d",&x);
rep(j,0,(1<<k)) {
... | C++ | 30340b756394abda26f714b8cc589d27 | 56a8ddf5edeb3baa5cbe1d529fee27cf | 2,000 | PASSED |
import java.io.*;
import java.util.*;
public final class Template {
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int employeeDetails[][] = new int[n][m];
for (int i =... | Java | fad203b52e11706d70e9b2954c295f70 | cee32aad2fd8c07090c2bf69e31ad687 | 1,300 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class SpykeChatting {
public static void main(String[] args) {
int n = fs.nextInt(), m = fs.nextInt(), k = fs.nextInt();
int[][] employeeToChat = new int[n][];
... | Java | fad203b52e11706d70e9b2954c295f70 | 17322687a5131755f0c05a10a8194616 | 1,300 | PASSED |
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<queue>
#define loop(i,n) for(i=0;i<n;i++)
#define Loop_x(i,x,n) for(i=x;i<n;i++)
#define print_vec(it,v) for(it = v.begin() ; it != v.end() ; ++it) cout<<*it<<" ";
#define mp... | C++ | fad203b52e11706d70e9b2954c295f70 | f4da83059817da3a3f71649eb674d415 | 1,300 | PASSED |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
cin>>n>>m>>k;
int arr[n][m];
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
cin>>arr[i][j];
}
}
int b[m] = {0};
int pe[n] = {0};
for(int i = 0; i < k; i++){
... | C++ | fad203b52e11706d70e9b2954c295f70 | 344cb47555c83757769851325aebe35f | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
cin >> n >> m >> k;
int arr[n+1][m+1];
int pre[m+1][n+1];
int se[m+1][n+1];
int ans[n+1];
for(int i=0;i<=m;i++)
{
for(int j=0;j<=n;j++)
{
se[i][j]=0;
ans[j]=0;
}
}
... | C++ | fad203b52e11706d70e9b2954c295f70 | 98cbc100b9281aa9e360c91d25430faf | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main(){
long x,emps,chats,events;cin>>emps>>chats>>events;
std::vector< vector<long> > employ(emps), chatdata(chats);
for(long emp=0;emp<emps;emp++){
for(long chat=0;chat<chats;chat++){
cin>>x;
if(x==1){
employ[emp]... | C++ | fad203b52e11706d70e9b2954c295f70 | 1e3a8269259445078fb88b0398825527 | 1,300 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cstdio>
using namespace std;
const int N = (int) 2e5 + 5, M = 100;
int g[N][M];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
scanf("%d", &g[i][j]);
... | C++ | fad203b52e11706d70e9b2954c295f70 | 3c5725afd7d366d1d7b5667c126844cf | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, x, y;
cin >> n >> m >> k;
vector<vector<int>> v(n);
for (int i = 0; i < n; ++i) {
v[i].resize(m);
for (int j = 0; j < m; ++j)
cin >> v[i][j];
}
vector<int64_t> res(n);
vector<int> msg(m);
... | C++ | fad203b52e11706d70e9b2954c295f70 | 6ed28a4c9cc9c44badafb8c15026a0b1 | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define debug(x) cerr<<#x<<" -> "<<x<<'\... | C++ | fad203b52e11706d70e9b2954c295f70 | 2fe76350eb860fd15529fa043dc615ed | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 20020, M = 15;
int n, m, k, u, v, a[N][M], cnt[M], ans[N];
int main() {
cin >> n >> m >> k;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
scanf("%d", &a[i][j]);
}
}
while (k--) {
scanf("%d %d", &u, &v);
ans[u]--;
cnt[v]++;
... | C++ | fad203b52e11706d70e9b2954c295f70 | 89c6619a05bf93d6c0c88bbfd850c9e9 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define ld long double
#define clr(x) memset((x),0,sizeof(x))
const int MX = 900 + 10, MXM = 1e5 + 10, MD = 1e9 + 7;
int n, m, a[MX], ans, tmp, h[MX], col = 1, color[MX], U[MXM], V[MXM];
vector <int> adj[MX], radj[MX], t... | C++ | 32386f861b3fcea9efb91969602163f7 | 84e970f3fd0c8a815cf9a08227720dd3 | 2,100 | PASSED |
// #include <God>
/* Wow SO Amazing :) */
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
const int maxx = 1e5 + 7;
int n , m;
int par[maxx] , edge[maxx] , cnt[maxx], mol;
bool visit[maxx] , mark[maxx] , boreshi[maxx] , leaf[maxx] , Hambandi[maxx] , hambandi[maxx];
vector <pair<int ,... | C++ | 32386f861b3fcea9efb91969602163f7 | 1b75b30fdf412ae958848d0ca6d300d2 | 2,100 | PASSED |
// #include <God>
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
const int maxx = 1e5 + 7;
int n , m;
int par[maxx] , edge[maxx] , cnt[maxx], mol;
bool visit[maxx] , mark[maxx] , boreshi[maxx] , leaf[maxx] , Hambandi[maxx] , hambandi[maxx];
vector <pair<int , int> > adj[maxx];
vecto... | C++ | 32386f861b3fcea9efb91969602163f7 | 2207657c1d458dcda92d31277ae59e84 | 2,100 | PASSED |
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <cassert>
using namespace std;
#define pb push_back
#define ... | C++ | 32386f861b3fcea9efb91969602163f7 | 9daf895e0966bd8f14a8146cb0421262 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
vector<int> adj[N], child[N], ord;
bool mark[N];
int dp[N];
int d[N];
stack<int> st;
int col[N], cnt = 0;
int ver[N];
void dfs(int v)
{
mark[v] = 1;
st.push(v);
dp[v] = d[v];
for (auto u : adj[v])
if (!mark[u])
{
d[u... | C++ | 32386f861b3fcea9efb91969602163f7 | e7a4ed61174c86ef79a5d17d9e9ea97f | 2,100 | PASSED |
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <stdlib.h>
#include <sstream>
#include <assert.h>
#include <memory.h>
#include <complex>
#include <time.h>
#pragma comm... | C++ | 32386f861b3fcea9efb91969602163f7 | 82094f2af326d324eebad5bc46ccd49b | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
vector<int> adj[N], child[N], ord;
bool mark[N];
int dp[N];
int d[N];
stack<int> st;
int col[N], cnt = 0;
int ver[N];
void dfs(int v)
{
mark[v] = 1;
st.push(v);
dp[v] = d[v];
for (auto u : adj[v])
if (!mark[u])
{
d[u... | C++ | 32386f861b3fcea9efb91969602163f7 | 05e60ab563f7863f16e3568811a3daee | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
set <pair <int, int>> edges;
vector <int> adia[100010];
vector <int> newadia[100010];
int cnt;
int h[100010];
int up[100010];
int nou[100010];
int nr_frunze;
vector <int> one_old[100010];
int g[100010];
bool viz[100010];
vector <int> fii[100010];
set <int> frunzeact;
void... | C++ | 32386f861b3fcea9efb91969602163f7 | e63eb654b4b5cce19a5ba767914dc8f8 | 2,100 | PASSED |
// KALAM
# include<bits/stdc++.h>
using namespace std;
const int N = 900 + 77;
int n , m , top[N] , dis[N] , color[N] , tim = 1 , root;
bool M[N];
vector < int > a[N] , b[N] , vert[N] , leaves;
void dfs_pre(int v , int prev = - 1){
M[v] = 1;
for(int u : a[v]){
if(u == prev){
continue ;
}
... | C++ | 32386f861b3fcea9efb91969602163f7 | 8d6d89cb195c426228bbf70989e22808 | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 7;
vector<int> adj[N], child[N], ord;
bool mark[N];
int dp[N];
int d[N];
stack<int> st;
int col[N], cnt = 0;
int ver[N];
void dfs(int v)
{
mark[v] = 1;
st.push(v);
dp[v] = d[v];
for (auto u : adj[v])
if (!mark[u])
{
d[u... | C++ | 32386f861b3fcea9efb91969602163f7 | 4b9013b303f6a8f49b86bc7870e8f2a4 | 2,100 | PASSED |
import java.lang.*;
import java.util.*;
public class Cost{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] arr=new int[n];
int negCount=0;
int negMax=-100;
int posCount=0;
for(int i=0; i<n; i++){
... | Java | b11644953bdd1b92eb1b18c339a268a1 | e6092062d04df2f5d889af6cd8cd4ace | 1,400 | PASSED |
import java.lang.*;
import java.util.*;
public class Cost{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] arr=new int[n];
int negCount=0;
int negMax=-100;
int posCount=0;
for(int i=0; i<n; i++){
... | Java | b11644953bdd1b92eb1b18c339a268a1 | 1649622eeaca5833de2fad776cab143b | 1,400 | PASSED |
import java.io.*;
import java.util.*;
public class MyClass {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == n... | Java | b11644953bdd1b92eb1b18c339a268a1 | 63d8fb2722dc8e48d2109b3035d5b240 | 1,400 | PASSED |
import java.io.*;
import java.util.*;
//import java.math.*; // for bigInteger
public class Main {
public static void main(String args[]) throws Exception {
InputReader sc = new InputReader();
PrintWriter out = new PrintWriter(System.out);
int t=1; //t = sc.nextInt();
for(int tt=... | Java | b11644953bdd1b92eb1b18c339a268a1 | 241a0d31706e8ccfaa346484eef130b9 | 1,400 | PASSED |
#pragma comment(linker, "/STACK:512000000")
#include <bits/stdc++.h>
#ifdef AIM
#include <sys/resource.h>
#endif
using namespace std;
#define all(a) a.begin(), a.end()
typedef long long li;
typedef long double ld;
void solve(__attribute__((unused)) bool);
void precalc();
clock_t start;
#define FILENAME ""
int main() ... | C++ | be45e6d2ebf425d22963e9f444181c67 | 4a86f0764c1426cbcf8214e29eadabff | 3,000 | PASSED |
//HNOIday1t1出题人nmsl
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
typedef vector<int> vi;
#define pb push_back
int gi() {
int x=0,o=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*o;
... | C++ | be45e6d2ebf425d22963e9f444181c67 | 51c3d62f6aaaca3ca35f8daee79e5548 | 3,000 | PASSED |
//HNOIday1t1出题人nmsl
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
typedef vector<int> vi;
#define pb push_back
int gi() {
int x=0,o=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
if(ch=='-') o=-1,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*o;
... | C++ | be45e6d2ebf425d22963e9f444181c67 | 08698296502e5639a6d1c2f0a58a65b7 | 3,000 | PASSED |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | C++ | be45e6d2ebf425d22963e9f444181c67 | c2f679ce6d6adea9f0aee0dc00f1c83f | 3,000 | PASSED |
#include <bits/stdc++.h>
typedef std::pair <int, int> pii;
const int N = 100010;
char s[N];
int color[N];
void ask(std::vector <pii> vec){
if (vec.empty()){
return;
}
putchar('Q');
printf(" %d", (int) vec.size());
for (auto u : vec){
printf(" %d %d", u.first, u.second);
}
... | C++ | be45e6d2ebf425d22963e9f444181c67 | 6db4d1cdb625e41b0ab64d77bfe27e18 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<int> query(vector<int> s)
{
if (s.size() & 1) s.pop_back();
if (s.empty()) return vector<int>(0);
cout << "Q " << s.size() / 2 << " ";
for (int cur : s) cout << cur << " ";
cout << endl;
string bar; cin >> bar;
vector<int> foo(bar.length());
for (int i = 0; i... | C++ | be45e6d2ebf425d22963e9f444181c67 | b0ba77d793264967f45f13ac805dbc1e | 3,000 | PASSED |
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef l... | C++ | be45e6d2ebf425d22963e9f444181c67 | cd5e3e307a0374cd3f561cc6c79af915 | 3,000 | PASSED |
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>/
// #include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 998244353LL
#define IN freopen("nocross.in","r",stdin)
#define OUT freopen("nocross.out","w",stdout)
#define FOR(i,a,b) for(i=a ;... | C++ | be45e6d2ebf425d22963e9f444181c67 | 00e10b130eb8ac8cd77796de031edd8f | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
pii h[100010];
int c[100010],from[100010],num[100010],t,n,tt,cnt;
bool bo[100010],bo2[100010],now[30];
char s[100010];
inline int rd()
{
int x=0;char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar());
for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10... | C++ | be45e6d2ebf425d22963e9f444181c67 | c318c45b751b6cbffb3f92f37db4ec3e | 3,000 | PASSED |
#include<bits/stdc++.h>
#define P pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define N 100100
using namespace std;
int T,n,top,num[N],ans[N];
char a[N];
vector<int>A,B,C;
map<P,bool>mm;
inline void ask()
{
int i,j;
if(!A.size()) return;
printf("Q %d ",(int)A.size());
for(i=0... | C++ | be45e6d2ebf425d22963e9f444181c67 | 7ebb868ebe1b7c4c3824cd29f6d1f058 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,t,i,j,c;
/* freopen("in.txt","rt",stdin);
freopen("out.txt","wt",stdout);
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
/* cin>>t;
while(t--)
{
*/
cin>>n;
ll a[n+4];
for(i=0;i<n;i++)cin>>a[i];
sort(a... | C++ | a5ee97e99ecfe4b72c0642546746842a | 5239c406bfeb73f5b36155c8ef7ec88e | 1,100 | PASSED |
#include <bits/stdc++.h>
#include <time.h>
///Types
#define ll long long int
#define ld long double
///Constants
#define MOD 1000000007ll//(10e9+7)
#define INF 10e12
#define PI 3.14159265358979323846
///Macro expressions
#define FOR(i,a,b) for(i=a;i<b;i++)
#define FORI(i,a,b) for(ll i=a;i<b;i++)
#define nFOR(i,a,b) for... | C++ | a5ee97e99ecfe4b72c0642546746842a | 0a2d70630468a1b927007c323abc2e6f | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
cin>>n;
int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
if(arr[n-1]>=(arr[n-2]+arr[n-3]))
{
cout<<"NO\n";
return(0);
}
cout<<"YES\n";
for(i=0;i<=n-3;i++)
{
cout<<arr... | C++ | a5ee97e99ecfe4b72c0642546746842a | eb24e5dabc4e2380098165ddcbe4a7a2 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a[100000];
while(cin>>n)
{
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
if(a[n-1]>=(a[n-2]+a[n-3]))
{
cout<<"NO"<<endl;
return 0;
}
cout<<"YES"<<endl;
for(int i=0;i<n-2;i+... | C++ | a5ee97e99ecfe4b72c0642546746842a | c54e6cffccb2c235b0b667ee1d693523 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a[100000];
while(cin>>n)
{
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
if(a[n-1]>=(a[n-2]+a[n-3]))
{
cout<<"NO"<<endl;
return 0;
}
cout<<"YES"<<endl;
for(int i=0;i<n-2;i+... | C++ | a5ee97e99ecfe4b72c0642546746842a | 55320c850b187cc44b28e852f43fee21 | 1,100 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
if(a[n-1]<a[n-2]+a[n-3])
{
cout<<"YES"<<endl;
swap(a[n-1],a[n-2]);
for(int i=0;i<n;i++)
cout<<... | C++ | a5ee97e99ecfe4b72c0642546746842a | 19c14ad029312385bd1905872e7c1435 | 1,100 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.