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, m = map(int, raw_input().split())
nodes = map(int, raw_input().split())
min_node = (10**15, -1)
for i in xrange(n):
if nodes[i] < min_node[0]:
min_node = (nodes[i], i+1)
edges = [map(int, raw_input().split()) for _ in xrange(m)]
for i in xrange(n):
edges.append([min_node[1], i+1, min_node[0]+nodes[i... | Python | e52ec2fa5bcf5d2027d57b0694b4e15a | 36a04867bc041e3524b3e1477c08437d | 1,900 | PASSED |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
#define N 200000
#define M 200000
void init_rand() {
struct timeval tv;
gettimeofday(&tv, NULL);
srand(tv.tv_sec ^ tv.tv_usec);
}
int rand_(int n) {
return (rand() * 45677LL + rand()) % n;
}
struct E {
int i, j;
long long w;
} e... | C | e52ec2fa5bcf5d2027d57b0694b4e15a | c55850491ec853c07e8697f1bc18e193 | 1,900 | PASSED |
#include<stdio.h>
#include<stdlib.h>
#include<stdint.h>
#include<inttypes.h>
void msort_memcpy (uint8_t * restrict dst, uint8_t * restrict src, size_t size) {
while (size--) {
*dst++ = *src++;
}
}
void msort (void * const array, const size_t num, const size_t size, int (* const cmp) (const void *, const void ... | C | e52ec2fa5bcf5d2027d57b0694b4e15a | 7b7b60eecf4d520e713eba3f43a34667 | 1,900 | PASSED |
#include<stdio.h>
#include<stdlib.h>
#define N 200043
typedef struct road{
int x;
int y;
long long distance;
}road;
int p[N];
int getRoot(int x){
return ((x==p[x])?x:(p[x]=getRoot(p[x])));
}
int compare(const void *a,const void *b){
if(((road*)a)->distance-((road*)b)->distance>0)return 1;
else if(((road*)a)->... | C | e52ec2fa5bcf5d2027d57b0694b4e15a | cfbcb4ef2b8c53b1b9808c6a5749d6eb | 1,900 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using CompLib.Graph;
using CompLib.Util;
public class Program
{
int N, M;
long[] A;
int[] X, Y;
long[] W;
public void Solve()
{
var sc = new Scanner();
N = sc.NextInt();
M = sc.NextInt();
A = sc.L... | C# | e52ec2fa5bcf5d2027d57b0694b4e15a | 896b458b6f190cca7635c01c2ee664f3 | 1,900 | PASSED |
using CompLib.Collections;
using CompLib.Graph;
using CompLib.Util;
using System;
using System.Collections.Generic;
public class Program
{
public void Solve()
{
var pq = new PriorityQueue<(int u, int v, long cost)>((l, r) => l.cost.CompareTo(r.cost));
var ln = Console.ReadLine().Split(' ');
... | C# | e52ec2fa5bcf5d2027d57b0694b4e15a | 264ab55facad6bab43fe3de1d58122c8 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define MOD 1000000007
/**
* Author : kaspers, Delhi Technological University
*/
#define mp(x,y) make_pair(x,y)
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | 13f9fb1907dd869cfec00f10c182451d | 1,700 | PASSED |
#include<bits/stdc++.h>
#define MOD 1000000007
/**
* Author : kaspers, Delhi Technological University
*/
#define mp(x,y) make_pair(x,y)
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | 8ad413a7ff530709d4f14afa6d466e54 | 1,700 | PASSED |
#include <iostream>
#include <stdio.h>
using namespace std;
#define f stdin
int a[10000000], b[10000000], memo[10000000], pos[10000000];
int min(int l, int r)
{
if (l <= r)
{
return l;
}
return r;
}
int main()
{
int n, m, i, j, k, ind, p, l, x;
fscanf(f, "%d %d", &n, &m);
for (i = 1; i <= n; i++)
{
fscanf(... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | ccfba06411978c0466d7e139ee19d07c | 1,700 | PASSED |
// Shalin
#include <bits/stdc++.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <limits.h>
using namespace std;
#define si(x) scanf("%d",&x)
#define slli(x) scanf("%lld",&x);
#define sc(x) scanf("%c",&x);
#define ss(x) scanf("%s",x);
#define sd(x) scanf("%lf",&x);
#define bitcou... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | cf68958d1ecc29c173dd30491d7c97b5 | 1,700 | PASSED |
#include<stdio.h>
#include<set>
using namespace std;
#define ll long long
ll cum[10000007],a[10000007];
int bs(int l,int r,ll x)
{
while(l<r)
{
int mid=(l+r)/2;
ll y=(r-(mid+1)+1)*x;
ll yy=cum[r]-cum[mid+1-1];
if(y!=yy)
l=mid+1;
else
r=mid;
}
if(a[l]==x)
return -1;
return l;
}
int main()
{
int n... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | c1b38e1f703bcdc6b188e6cf18b13c48 | 1,700 | PASSED |
///BRR
#include <bits/stdc++.h>
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define pin freopen("lightson.in", "r", stdin);
#define pout freopen("lightson.out", "w", stdout);
#define mp make_pair
#define pb push_back
#define pf push_front
#define p_b pop_back
#define ... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | 1c4ccd650807b001f47437df10519740 | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n, m;
cin >> n >> m;
b[0] = -1;
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for(int i=1;i<=n;i++){
if (a[i]!=a[i-1]) b[i]=i-1;
else b[i]=b[i-1];
}
int l, r, x;
for (int i = 0;i < m; i++)
{
scanf("%d %d %... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | ab5277960345a69837b0480d690164a1 | 1,700 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int Maxn = 1e9 + 10;
const int N = 1e5 + 10;
const int INF=(0x7fffffff)/2;
ll a[2 * N];
ll b[2 * N];
int... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | 9766b3bf5410676191c4e82ade1f7fcf | 1,700 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int Maxn = 1e9 + 10;
const int N = 1e5 + 10;
const int INF=(0x7fffffff)/2;
ll a[2 * N];
ll b[2 * N];
int... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | 199df266e3557f9128a978f1933172e9 | 1,700 | PASSED |
//By Nurbergen Hinatolla
#include <algorithm>
#include <iostream>
#include <assert.h>
#include <stdlib.h>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <cstdio>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <cmath>
#include <math.h>
#include <map>
#include <set>
#i... | C++ | dcf7988c35bb34973e7b60afa7a0e68c | a817fb33190c2250d2a539904a669c59 | 1,700 | PASSED |
using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Numerics;
// (づ°ω°)づﾐ★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solver
{
class SegmentTree<T>
{
private readonly int size;
private readonly T[] data;
private readon... | C# | f7f1d57921fe7b7a697967dcfc8f0169 | ae452a3e109214737f776a9ce80495b5 | 2,100 | PASSED |
using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Numerics;
// (づ°ω°)づﾐ★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solver
{
private const int MAXN = 100000;
private int[] data = new int[4 * (MAXN + 1)];
int Gcd(int a, int b)
{
... | C# | f7f1d57921fe7b7a697967dcfc8f0169 | 09403f9ffddbf4a99be7cc851b4be1e0 | 2,100 | PASSED |
using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Numerics;
// (づ°ω°)づﾐ★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solver
{
class SegmentTree<T>
{
private readonly int size;
private readonly T[] data;
private readon... | C# | f7f1d57921fe7b7a697967dcfc8f0169 | cac97f85c967eb5d09340af55240b69e | 2,100 | PASSED |
using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Numerics;
// (づ°ω°)づﾐ★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solver
{
class RangeCount<T>
{
private readonly IDictionary<T, List<int>> index = new Dictionary<T, List<int>>();
... | C# | f7f1d57921fe7b7a697967dcfc8f0169 | 215273f22e610e7b4fe7979b9de635b1 | 2,100 | PASSED |
import java.io.BufferedReader
import java.io.InputStreamReader
import java.io.PrintWriter
private fun divides(a: Main.Player, b: Main.Player) = b.divisor / a.divisor > 0L && b.divisor % a.divisor == 0L
class Main(val inp: BufferedReader, val out: PrintWriter) {
interface Player {
val divisor: Long
... | Kotlin | f7f1d57921fe7b7a697967dcfc8f0169 | 650799643ccd5dfd5e80fc767716b63a | 2,100 | PASSED |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int INF = 2100000001;
int lc(int x){return x * 2;}
int rc(int x){return x * 2 + 1;}
struct MinCount{
int Min, Count;
MinCount(int _min, int _count){
Min = _min;
Count = _count;
}
};
struct segtree{
... | C++ | f7f1d57921fe7b7a697967dcfc8f0169 | 51187b7b7c5e81a0bd01b111e3695ea7 | 2,100 | PASSED |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include... | C++ | f7f1d57921fe7b7a697967dcfc8f0169 | be7e22af1da6d772989dbaa43d5b88fe | 2,100 | PASSED |
#include<iostream>
#include<vector>
#include<queue>
#include<map>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
const int MAXN = 1e5 + 19;
long long MIN[21][MAXN+1], GCD[21][MAXN+1], n, t;
pair<long long, long long> A[MAXN+1];
int gcd(int a, int b) {
re... | C++ | f7f1d57921fe7b7a697967dcfc8f0169 | ab93423d3fa5d927d60033ea8dbe1237 | 2,100 | PASSED |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
using namespace std;
const int kN = 1 << 17;
int GCD(int a, int b) {
return b ? GCD(b, a % b) : a;
}
struct SegmentTree {
vector<int> data;
SegmentTree() {
data.resize(2 * kN - 1);
}
int L(in... | C++ | f7f1d57921fe7b7a697967dcfc8f0169 | 6058757ad3f0f3e46482c93f653699bc | 2,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int oo = 1234567890;
int n, t, a[100010];
struct stNode {
int gcd, mn, cnt;
stNode(){}
stNode(int gcd, int mn, int cnt): gcd(gcd), mn(mn), cnt(cnt) {}
};
stNode tree[100010*5];
void build(int node, int l, int r)
{
if(l == r) {
tree[node].gcd... | C++ | f7f1d57921fe7b7a697967dcfc8f0169 | 31c23a1383caa807b32d323c744880fe | 2,100 | PASSED |
for _ in range(int(input())):
t=int(input())
l=[int(x) for x in input().split()]
for i in range(t):
if i%2==0 and l[i]<0:
... | Python | d07ae42b7902ba3a49cf4463248710ea | a9cea3a4e9db46d684a3672e30e919a9 | 1,100 | PASSED |
t = int(input())
for i in range(t):
n = int(input())
case = list(map(int, input().split()))
for x in range(n):
if case[x] < 0:
case[x] *= -1
for x in range(n):
if x % 2 == 0:
case[x] *= -1
else:
continue
case = list(map(str, case))
def... | Python | d07ae42b7902ba3a49cf4463248710ea | 54d89d0c78cd48dc3fd310d90d58b40f | 1,100 | PASSED |
t = int(input())
for i in range(t):
n = int(input())
case = list(map(int, input().split()))
for x in range(n):
if case[x] < 0:
case[x] *= -1
for x in range(n):
if x % 2 == 0:
case[x] *= -1
else:
continue
case = list(map(str, case))
pr... | Python | d07ae42b7902ba3a49cf4463248710ea | e1029f389fe860fb600504c2faf4ca8a | 1,100 | PASSED |
# You are capable of amazing things. Unknown
# by : Blue Edge - Create some chaos
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
i=1
ls=1
while i<n:
if ls:
if a[i]>a[i-1]:
a[i]*=-1
if a[i]>a[i-1]:
... | Python | d07ae42b7902ba3a49cf4463248710ea | 746e2d39de7e071ba1e7a2716de56351 | 1,100 | PASSED |
for _ in " "*int(input()):
n,a=int(input()),list(map(int,input().split()))
for i in range(n):print(abs(a[i])*(-1)**i,end=" ") | Python | d07ae42b7902ba3a49cf4463248710ea | fea6b1acae3201b0a29571899130dc3f | 1,100 | PASSED |
for _ in " "*int(input()):
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
if i%2:
if a[i]>0:
print(a[i]-(2*a[i]),end=" ")
else:
print(a[i],end=" ")
else:
print(abs(a[i]),end=" ") | Python | d07ae42b7902ba3a49cf4463248710ea | ad9db66303502e2d4bdcbbd66ec107a9 | 1,100 | PASSED |
for _ in " "*int(input()):n,a=int(input()),list(map(int,input().split()));print(*[abs(a[i])*(-1)**i for i in range(n)]) | Python | d07ae42b7902ba3a49cf4463248710ea | 00c20e2a50d4e895103ec86c43b0e809 | 1,100 | PASSED |
# t = int(input())
#
# case_array = [] # a group of cases
#
# for i in range(t):
# n = int(input()) # MEYUTAR
# my_input = input().split(" ")
# # 2 4 -3
# for j in range(len(my_input)):
# my_input[j] = int(my_input[j])
# case_array.append(my_input)
#
# ###################################
#
# for i in range(t):... | Python | d07ae42b7902ba3a49cf4463248710ea | add444390354a58a4633a6ebc03c2ce5 | 1,100 | PASSED |
t=int(input())
while(t!=0):
a=int(input())
b=list(map(int,input().split(" ")))
for i in range(0,a):
if(i%2==0):
print(abs(b[i]),end=" ")
elif(i%2!=0 and b[i]!=0):
print("-"+str(abs(b[i])),end=" ")
else:
print(b[i],end=" ")
print()
t=t-1 | Python | d07ae42b7902ba3a49cf4463248710ea | e4bea301d16f40f52657f5cc7e77466a | 1,100 | PASSED |
t = int(input())
while t:
t-=1
n=int(input())
a = list(map(int,input().split()))
for i in range(n):
if i%2==0:
if a[i]<0:
a[i] = abs(a[i])
if i%2==1:
if a[i]>0:
a[i] = -a[i]
print(*a) | Python | d07ae42b7902ba3a49cf4463248710ea | 57b821f14b06b0fd34597c0ebf87e702 | 1,100 | PASSED |
#include<iostream>
#include <ostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
typedef long long ll;
using namespace std;
int main()
{
int n;
// ll x;
string x;
int c[9];
cin >>n;
cin >> x;
... | C++ | 378a9ab7ad891d60f23645106d24f314 | 395ff717af72897c25d39a43615fe663 | 1,300 | PASSED |
#include<iostream>
#include <ostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
typedef long long ll;
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(NULL);
int n;
// ll x;
char x[2... | C++ | 378a9ab7ad891d60f23645106d24f314 | 82dd82016f434546884c82356ee75fc6 | 1,300 | PASSED |
/* CODE BY:
********************************************************************************************************
$$$$$$$$$ $$ $$ $$$$$$$$ $$ $$ $$ $$ $$ $$$$$$$$
$$ $$ $$ $$ $$ $$ $$ $$ $$ $$ $$ $$ $$
$$ $$ $$ $$ $$ $... | C++ | 378a9ab7ad891d60f23645106d24f314 | 306220c4e2240da51c792b634c751e27 | 1,300 | PASSED |
/* CODE BY:
************************************************************************************************************************************
$$$$$$$$$ $$ $$ $$$$$$$$$ $$ $$ $$ $$ $$ $$$$$$$$ $$$$$$$$$ $$$$$$$$$ $$$$$$$$$ $$ $$
$$ $$ $$ $$ $$ $$ $$ $$ $$ $$ ... | C++ | 378a9ab7ad891d60f23645106d24f314 | b91754121c7088f65b42c5779d04b631 | 1,300 | PASSED |
/* CODE BY:
********************************************************************************************************
$$$$$$$$$ $$ $$ $$$$$$$$ $$ $$ $$ $$ $$ $$$$$$$$
$$ $$ $$ $$ $$ $$ $$ $$ $$ $$ $$ $$ $$
$$ $$ $$ $$ $$ $... | C++ | 378a9ab7ad891d60f23645106d24f314 | 3249554084fa9897c8f260dd684131fd | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define deb(x) cout<<'>'<<#x<<": "<<x<<" ["<<__LINE__<<", "<<__func__<<"]\n";
void solve()
{
int n;
cin >> n;
string s, s1;
cin >> s;
s1 = s;
map<char, char> rep;
for (int i = 1; i <= 9; i++) {
... | C++ | 378a9ab7ad891d60f23645106d24f314 | 2a4f5c65ddcadfd020a9c243374348c0 | 1,300 | PASSED |
#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
#define ll long long int
#define ar array
#define ld long double
#define bigint int64_t
#define vll vector<ll>
#define pll ar<ll,2>
#define vpll vector<pll>
#define pb push_back
#define MOD 1000000007
#define ... | C++ | 378a9ab7ad891d60f23645106d24f314 | 8c4e1561b173fc39d8c4e2ad6626d9eb | 1,300 | PASSED |
#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
#define ll long long int
#define ar array
#define ld long double
#define bigint int64_t
#define vll vector<ll>
#define pll ar<ll,2>
#define vpll vector<pll>
#define pb push_back
#define MOD 1000000007
#define ... | C++ | 378a9ab7ad891d60f23645106d24f314 | 93322fd8266df94006fb5c6c41227313 | 1,300 | PASSED |
#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
#define ll long long int
#define ar array
#define ld long double
#define bigint int64_t
#define vll vector<ll>
#define pll ar<ll,2>
#define vpll vector<pll>
#define pb push_back
#define MOD 1000000007
#define ... | C++ | 378a9ab7ad891d60f23645106d24f314 | 7f0ec269763d602863d89d6cb4b377e0 | 1,300 | PASSED |
#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
#define ll long long int
#define ar array
#define ld long double
#define bigint int64_t
#define vll vector<ll>
#define pll ar<ll,2>
#define vpll vector<pll>
#define pb push_back
#define MOD 1000000007
#define ... | C++ | 378a9ab7ad891d60f23645106d24f314 | 242d2840607386abc5c9e09940652a20 | 1,300 | PASSED |
//optimization scc using dijkstra
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define iii pair<ii, int>
#define vi vector<int>
#define pb emplace_back
#define sz(x) (int)x.size()
#define all(v) v.begin(), v.end()
#define x first
#define y second
#define rep(i, j, k) for... | C++ | 0587d281830282418d4120cccbfd813b | 9f4a09031f9a834d88eca44817043358 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10, inf = 1e9 + 1;
unordered_map<string, int> mp;
vector<int> G[maxn], R[maxn], t;
int a[maxn], r[maxn], l[maxn], c, sccid[maxn];
pair<int, int> scc[maxn], dp[maxn];
bool v[maxn];
string lower(const string &s) {
string ret ... | C++ | 0587d281830282418d4120cccbfd813b | 2b8dfd3e21a7eddc7a7c2ef79dcf46de | 2,400 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10, inf = 1e9 + 1;
unordered_map<string, int> mp;
vector<int> G[maxn], R[maxn], t;
int a[maxn], r[maxn], l[maxn], c, sccid[maxn];
pair<int, int> scc[maxn], dp[maxn];
bool v[maxn];
string lower(const string &s) {
string ret ... | C++ | 0587d281830282418d4120cccbfd813b | 43ee2e3f42a18f46361f1d69b79514e8 | 2,400 | PASSED |
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define INF 1000000007
using namespace __gnu_pbds;
using namespace std;
int n,m,cnt,tot;
string s[100010],s1[100010],s2[... | C++ | 0587d281830282418d4120cccbfd813b | 307c8654b6c7e1e278809e40530456ff | 2,400 | PASSED |
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
int n,m,cnt;
string s[100010],s1[100010],s2[100010];
cc_hash_table<stri... | C++ | 0587d281830282418d4120cccbfd813b | 617176c298c647300b6ba33994f2e7cc | 2,400 | PASSED |
//**************************
//*** author : Alex Hu **
//************************
// _______ __________ ________ __
// \ \ ____\______ \ ____ / _____/ _____/ |_
// / | \ / _ \| _// __ \/ \ ____/ __ \ __\
// / | ( <_> ) | \ ___/\ \_\ \ ___/| ... | C++ | 0587d281830282418d4120cccbfd813b | bcb3bef5cd019f2364c71329d018841b | 2,400 | PASSED |
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
class scc{
public:
int n;
vector <vector<int>> g, gr, adjc;
vector <pair<int,int>> val, valc;
vector<bool> visited;
vector <int> toplist, c, indeg;
pair <int,int> mx;
scc(int n):n(n){
g.resize(n); gr.resize(n);
visited.resize... | C++ | 0587d281830282418d4120cccbfd813b | 00deb05f77044ad82e865fe7e96d40f6 | 2,400 | PASSED |
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <bitset>
#include <cstdio>
#include <vector>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <iostream>
#include <algorithm>
#include <tr1/unordered_map>
using namespace std;
u... | C++ | 0587d281830282418d4120cccbfd813b | bf081af3cbdc4a5d558abc3741b4bcfd | 2,400 | PASSED |
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#include <memory.h>
#include <algorithm>
#include <cctype>
using namespace std;
const int MAXN = 3e5 + 10;
int ret[MAXN], best[MAXN];
vector<int> edges[MAXN], rev[MAXN];
unordered_map<string, int> table;
int tag[MAXN], state[MAXN], tot, sc... | C++ | 0587d281830282418d4120cccbfd813b | 6569354c9babdbc87eafa19fe10384f1 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
using namespace std;
bool flag[100005],vis[100005];bool flag1;
ll tot[100005];
ll ans2,ans1;
vector<ll> v[100005];
unordered_map <int,pair<ll,ll> > mp;
unordered_map <string,int> key;
inline ll countR(string str)
{
int l=str.length();ll cnt=0;
for(... | C++ | 0587d281830282418d4120cccbfd813b | d38fdf4bd4e6ebc6b650f174ab28f30b | 2,400 | PASSED |
a,b=map(int,input().split())
x=list(map(int,input().split()))
y=[a-b+1]*a
z=list(range(1,a+1))
w=z[::-1]
c=[]
for i in range(a):
c.append(min(y[i],z[i],w[i],b))
s=0
for i in range(a):
s+=c[i]*x[i]
print(s/(a-b+1))
| Python | 838e643a978adbeed791a24ac1046ab5 | b8d62886bdafce7fc2f7705d3d221e04 | 1,300 | PASSED |
n,k = map(int,input().split())
arr = [int(i) for i in input().split()]
total =0
for i in range(n):
#print((arr[i])*(min(n-k+1,min(n-k+1,min(i,n-i-1)+1))))
total += (arr[i])*(min(n-k+1,min(k,min(i,n-i-1)+1)))
#print(total/k)
print ('{0:.10f}'.format(total/(n-k+1))) | Python | 838e643a978adbeed791a24ac1046ab5 | aadd0c0cf6582c887abcf9f90b18cfb2 | 1,300 | PASSED |
'''input
3 2
3 4 7
'''
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = [0] * (n+1)
s = 0
for x in range(n):
s += a[x]
b[x+1] = s
s = 0
for y in range(n-k+1):
s += b[y+k] - b[y]
print(s/(n-k+1)) | Python | 838e643a978adbeed791a24ac1046ab5 | 981f1f9d0d7dd4c3d718ddda0f400a65 | 1,300 | PASSED |
def readInts():
a = []
for i in input().strip().split():
a.append(int(i))
return a
def calc():
n , k = readInts()
a = readInts()
t = len(a)
dp = [0]*n
dp[0] = a[0]
for i in range(1 , t) :
dp[i] = dp[i-1] + a[i]
sum = dp[k-1]
for i in range(k , n):
... | Python | 838e643a978adbeed791a24ac1046ab5 | a30ac350596784417a47ca3beb519ca9 | 1,300 | PASSED |
n,k = map(int,input().split())
s = list(map(int,input().split()))
r = 0
for i in range(k):
r = r + s[i]
t = r
for i in range(k,n):
r = r - s[i-k]
r = r + s[i]
t = t + r
print(t/(n-k+1))
| Python | 838e643a978adbeed791a24ac1046ab5 | 2fc2ef6b7c6bb708ca55e7cbcff385c0 | 1,300 | PASSED |
(n, k) = map(int, input().split())
A = list(map(int, input().split()))
S = sum(A[:k])
oper = S
for i in range(n-k):
oper -= A[i]
oper += A[i+k]
S += oper
#if n != 1:
# print(str((sum(S) / (n-k+1))*2)[:-2])
#else:
print(S / (n-k+1)) | Python | 838e643a978adbeed791a24ac1046ab5 | 6c62b11ddedeebb417a446c27f780646 | 1,300 | PASSED |
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
ans = 0
for i in range(n):
ans += a[i]*min(min(k, n-k+1), min(i, n-i-1)+1)
print(ans/(n-k+1))
| Python | 838e643a978adbeed791a24ac1046ab5 | 057804ae2a62861a80acf46d8e4cd975 | 1,300 | PASSED |
n,k=map(int,input().split())
arr=list(map(int,input().split()))
ww=n-k+1
a=[]
a.append(0)
for i in range(n):
a.append(arr[i])
for i in range(1,n+1):
a[i]=a[i]+a[i-1]
ans=0
for i in range(k,n+1):
tmp=a[i]-a[i-k]
ans+=(tmp/ww)
print(ans) | Python | 838e643a978adbeed791a24ac1046ab5 | 7d38b352c60d16ae24db6fc0fd286764 | 1,300 | PASSED |
s = input().split()
n, k = int(s[0]), int(s[1])
sm = 0
ds = [int(i) for i in input().split()]
for i in range(n):
sm += min(i + 1, k, n - i, n - k + 1) * ds[i]
print(sm / (n - k + 1))
| Python | 838e643a978adbeed791a24ac1046ab5 | e2da0ae9b2ec5c2460800fee4970ede0 | 1,300 | PASSED |
n,k=map(int,input().split())
a=list(map(int,input().split()))
start=min(k-1,n-k)
count=sum(a[start:n-start])*(start+1)
for i in range(start):
count+=(a[i]+a[~i])*(i+1)
print(count/(n-k+1)) | Python | 838e643a978adbeed791a24ac1046ab5 | 67cf96be8c1afab2eeab39f4bd10de2a | 1,300 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
int const N = 5e3 + 41;
int ans[N], n, t[N], cnt[N], maxi, maxii;
void clear(){
for(int i=1;i<=n;++i){
cnt[i] = 0;
}
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;++i){
scanf("%d",&t[i]);
}
for(int i=0;i<n;++i){
maxi = 0;
clear();
for(int ... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | 55c6da302cc9023567b0a9ffbc149f8e | 1,500 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
#include<list>
#include<numeric>
#define ll __int64
using namespace std;
template<class T> T f_max(T a, T b){ return a ... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | babcb2dea29eee7090ef672ed3639a23 | 1,500 | PASSED |
//#define ONLINE_JUDGE
#if defined(ONLINE_JUDGE)
#define _SECURE_SCL 0
#endif
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <functional>
#include <memory>
#include <cmath>
#i... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | 8ba76e83fd8b64ca8257a59009e9e46e | 1,500 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#pragma comment (linker,"/STACK:256000000")
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <vector>
#include <cassert>
#include <string>
#include <cstdlib>
#include <ctime>
#include <ma... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | af85aec7ee33965fd93adba9b6eb0db3 | 1,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
int v[5001];
using namespace std;
int v1[5001];
map<int,int>v2;
int main()
{
int n,p,d,ma,index;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>p;
v[i]=p;
}
for(int i=1;i<=n;i++)
{
ma=0;
memset(v1,0,siz... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | 897f371429fd63d449fa5e967a5c8578 | 1,500 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <limits.h>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#include <memory.h>
#include <string.h>
#include <math.h>
#include <string>
#include <algorithm>
#include <functional>
#include <cassert>
#include <map>
#include <set>
#include <list>
using... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | 033c478879d35ac3372b768a4de3e132 | 1,500 | PASSED |
#pragma comment(linker, "/STACK:100000000")
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <sstream>
#include <queue>
#include <algorithm>
#include <iostream>
#include <list>
using namespace std;
... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | d2cec198d039081ddb5104d407af52e1 | 1,500 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <ctype.h>
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <io... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | 750f4af1d0c5a8337cda6660e86f1c8a | 1,500 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:100000000")
#include <stdio.h>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <fstream>
#include <iostream>
#include <ctime>
#include <fstream>
using na... | C++ | f292c099e4eac9259a5bc9e42ff6d1b5 | 4e612a3cb3f9bc5a5ed2d8fff7dc86f4 | 1,500 | PASSED |
/* practice with Dukkha */
#include <stdio.h>
#include <string.h>
#define N 5000
int main() {
static int aa[N], kk[N], ans[N];
int n, i, j, a, a_;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]), aa[i]--;
for (i = 0; i < n; i++) {
memset(kk, 0, n * sizeof *kk);
a_ = -1;
for (j = i; j < n; j... | C | f292c099e4eac9259a5bc9e42ff6d1b5 | 78dc992fb3b646cee344269b8ee1f97d | 1,500 | PASSED |
#pragma comment(linker, "/STACK:512000000")
#define _CRT_SECURE_NO_DEPRECATE
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <ctime>
#include <numeric>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
... | C++ | 6527406424b003cab6a1defdddb53525 | a52d13b38f69168074fa17cd562c8dce | 2,000 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iterator>
#include <set>
using namespace std;
struct edge {
int u, w;
edge(int _u, int _w)
: u(_u), w(_w) {}
};
class Solution {
public:
Solution()
: c(1), flag(100005, 0), team(100005), d(505, vector<int>(505, -1)), e(100005)
{input()... | C++ | 6527406424b003cab6a1defdddb53525 | 35fdeaefd2773bf903dc506f1c331a0b | 2,000 | PASSED |
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<map>
using namespace std;
int n , m , k , top , c[1] , d[555][555] , rep[555];
int u[111111] , v[111111] , x[111111] , s[111111];
int pa[111111] , id[111111];
int maxD = ... | C++ | 6527406424b003cab6a1defdddb53525 | 97305018519f106474231bec53cfe916 | 2,000 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
#define INF 100000000
int n,m,k;
int parent[100001];
int group[100001];
int dp[501][501];
vector<int> gs;
int f_parent(int t){
if(parent[t]==t)
return t;
else return f_parent(parent[t]);
}
int sz[100001];
void unite(int l, int r) {
l = f_pa... | C++ | 6527406424b003cab6a1defdddb53525 | 96098676bbf16700ac6d3ced0519a11d | 2,000 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
#define INF 100000000
int n,m,k;
int parent[100001];
int group[100001];
int dp[501][501];
vector<int> gs;
int f_parent(int t){
if(parent[t]==t)
return t;
else return f_parent(parent[t]);
}
int sz[100001];
void unite(int l, int r) {
l = f_pa... | C++ | 6527406424b003cab6a1defdddb53525 | 1f9b0a12a94f1f92456efaf97cab5bc4 | 2,000 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
#define INF 100000000
int n,m,k;
int parent[100001];
int group[100001];
int dp[501][501];
vector<int> gs;
int f_parent(int t){
if(parent[t]==t)
return t;
else return f_parent(parent[t]);
}
int sz[100001];
void unite(int l, int r) {
l = f_pa... | C++ | 6527406424b003cab6a1defdddb53525 | 98502588e51b028d57de9ce70b9dbf3c | 2,000 | PASSED |
#include <iostream>
#include <vector>
using namespace std;
#define INF 100000000
int n,m,k;
int parent[100001];
int group[100001];
int dp[501][501];
vector<int> gs;
int f_parent(int t){
if(parent[t]==t)
return t;
else parent[t]=f_parent(parent[t]);
return parent[t];
}
int sz[100001];
void unite(int ... | C++ | 6527406424b003cab6a1defdddb53525 | 439e0a0985e9a03aa01f1476a680e5dd | 2,000 | PASSED |
#include<stdio.h>
#include<string.h>
#define inf 0x3f3f3f3f
const int N=100015,MAX=505;
int type[N],father[N],mp[MAX][MAX];
inline int min(int a,int b){
return a>b?b:a;
}
int find(int x){
if(father[x]!=x)
father[x]=find(father[x]);
return father[x];
}
void floyd(int n){//ok
for(int k=1;k<=n;k+... | C++ | 6527406424b003cab6a1defdddb53525 | 94b265c42d6c287b659992ff56d6e7a9 | 2,000 | PASSED |
#include<iostream>
using namespace std;
#define MAX 100010
#define INF 1000000000
int n,m,k,x,y,z;
int p[MAX],G[505][505],v[MAX];
int fnd(int x){
if(p[x]!=x)
return p[x]=fnd(p[x]);
return p[x];
}
void floyd(int n){
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
... | C++ | 6527406424b003cab6a1defdddb53525 | 0027cc9e3f2e1fa3410c3c7230e01d83 | 2,000 | PASSED |
#include<stdio.h>
#include<string.h>
const int N=100015,MAX=505,inf=1e8;
int type[N],father[N],mp[MAX][MAX];
int min(int a,int b){
return a>b?b:a;
}
int find(int x){
if(father[x]!=x)
father[x]=find(father[x]);
return father[x];
}
void floyd(int n){//ok
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=... | C++ | 6527406424b003cab6a1defdddb53525 | 37627602be3f21963ed48a4f2f0792dc | 2,000 | PASSED |
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 200100;
int n, m;
pair <int, int> a[N];
pair <int, int> w[N];
bool check(int d) {
if (n % d != 0) {
return false;
}
for (int i = 0; i < m; i++) {
a[i] = make_pair((w[i].first + d) % n, (w[i].second... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | 9471330861bd3e0569d79984d1ff02f3 | 1,900 | PASSED |
#include <set>
#include <queue>
#include <cmath>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#define debug(x) cerr<<#x<<'='<<x<<endl
#define set0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll,l... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | e8c78f9a86e8e1265b9b95864c52c3d2 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<long long, null_type,less<long long>, rb_tree_tag,tree_order_statistics_node_update>
template <typename T>
void resize(int n, vector<T> &u)... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | c2841b823f8a3e1a1e75b0a9a90d17c5 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<pair<int, int>> segments(m);
for (auto& [a, b] : segments) {
cin >> a >> b;
--a, --b;
if (a > b) {
swap(a, b);
}
}
sort(segments.begin(), segments.end());
bool ok ... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | fb272d6fe48de3036336b763b116aec1 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
const int M = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> hsh(n);
for (int i = 0; i < n; ++i) {
hsh[i] = uniform_int_distribution<int>... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | 66158cd730159c1ba9c78399c3f58197 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<pair<int, int>> vec;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
if (u > v) swap(u, v);
vec.emplace_back(u, v);
}
sort(vec.begin(), v... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | 289a5f96f513e4cf6e42a6662241cdec | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<pair<int, int>> vec;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
if (u > v) swap(u, v);
vec.emplace_back(u, v);
}
sort(vec.begin(), v... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | 9937fd19bfb341662ced1655c2d1c8f7 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 200005;
int n;
vector<int> GetValid(vector<int> p, int len) {
//for (int x : p) printf("%d ", x);
//printf("\n\n");
int m = p.size() - 1;
for (int i = 0; i < m; i++) {
p.push_back(p[i] + n);
}
vector<int> d;
for (int i = 1... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | ab9ecb4e022ceb48e3bdf6257ca68dd9 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto& e : a)
#ifdef LOCAL
#define logv(a) {cerr << #a << " = "; fore(e, a) {cerr << e << " ";} cerr << "\n";}
... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | 4f57cc3c97efb421144256dd91ff48d0 | 1,900 | PASSED |
#include "bits/stdc++.h"
using namespace std;
const int maxn = 200005;
vector<int> vec;
int n, q;
void divs(int n){
for(int i=2; i*i <= n; i++){
if(n%i == 0){
vec.push_back(i);
if(n%(n/i) == 0)vec.push_back(n/i);
}
}
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
}
... | C++ | dd7a7a4e5feb50ab6abb93d90c559c2b | 80e1777a04b4572a8eb4550ce029c4b8 | 1,900 | PASSED |
//============================================================================
//Everyone has a different way of thinking, so God Created us
// Hope You Respect My Way..,Thank You ):
// Author : Murad
// Online Judge: Codeforces.cpp & Atcoder.cpp
// Description : Problem name
//==================================... | C++ | 74ddbcf74988940265985ec8c36bb299 | 9f4722492c23351197d6f8256f02f1a2 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
long long n ,m,ans = 1,mx1,mx2, b[2000005],c[2000005];map <int,int> mp;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie();
cin>>n;
for(int i = 1; i <= n ;i ++)
{
long long l ;
cin>>l;
mp[l]++;
}
cin>>m;
for(int i = 1; i <= m ;i ++)cin>>b[i];
... | C++ | 74ddbcf74988940265985ec8c36bb299 | 264803851094934e6b38ca053ce2b297 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
map<int,int>ma;
int n,m,c,d,ans,ans1;
const int N=2e5+5;
int a[N],b[N],e[N];
vector<int>v;
int main()
{
cin>>n;
for(int i=0;i<n;i++){cin>>a[i];
ma[a[i]]++;
}
cin>>m;
for(int i=0;i<m;i++)cin>>b[i];
for(int i=0;i<m;i++)cin>>e[i];
for(int i=0;i<... | C++ | 74ddbcf74988940265985ec8c36bb299 | 75657e2627cca55d64678e9584f1345e | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
ordered_set s;
s.insert(1);
cout<<*s.find_by_order(... | C++ | 74ddbcf74988940265985ec8c36bb299 | b0af6f0b78200afd02f9d563e35186ba | 1,300 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.