source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define m_p make_pair
#define pb push_back
#define ppb pop_back
#define f first
#define s second
#define pii pair<int,int>
#define ios ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define double long double
const double pi=3.14159265358979;
co... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | e6063b8d317d954a19937044f3ba7777 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define sort_unique(x) sort(ALL(x)); x.resize(distance(x.begin(), unique(ALL(x))))
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#ifdef LOCAL
#define pause system("pause")
... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | 90bf6014b2d74d8bbb4bc9cec940a704 | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<algorithm>
#include <set>
#include <iterator>
using namespace std;
#define int long long
#define pii pair<int,int>
#define float double
#define pb push_back
#define lp(i,j,n) for( i=j;i<n;i++)
#define lop(j,k,n)for( j=k;j<n;j++)
#define m_p make_pair
#define fastio ios_base::sync_wit... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | 07e4ed2eeda5c3b0073b7e23e84f1cc4 | 1,800 | PASSED |
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | ca0adc23a343a1a6272799821e024a78 | 1,800 | PASSED |
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | de4b2c6cd8abf33aa9d7eff23ce3cec2 | 1,800 | PASSED |
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | abf50ae5984aa74cd2278b8855fb7ccb | 1,800 | PASSED |
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | 9fce690402296a69500293b894e3d8c7 | 1,800 | PASSED |
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | 1de22ffd674a470dc42a4947cd7d5a8d | 1,800 | PASSED |
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | f354d9fc0eb91b34382240c9aafd90b0 | 1,800 | PASSED |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#def... | C++ | 87c3a8a0d49288d0f6242fe2ac69a641 | 0e8e1ab32e358f967e69aa044b5d4c58 | 1,800 | PASSED |
import java.util.*;
import java.io.*;
public class Main implements Runnable {
public void solve() throws IOException {
long n = nextLong();
long d = nextLong();
long m = nextLong();
long l = nextLong();
if(l == m - 1){
... | Java | ecbc339ad8064681789075f9234c269a | 4824fcc56c417dbb5f85de361dcac3b1 | 1,700 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
public class Task018B {
public static void main(String... args) throws NumberFormatException,
IOException {
Solution... | Java | ecbc339ad8064681789075f9234c269a | 27816d0d0e9f606bb476ca9c83b9c996 | 1,700 | PASSED |
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.Scanner;
public class B {
public static void main(String[] args) throws IOException {
File inputFile = new File("entradaB");
if (inputFile.exists())
System.setIn(new FileInputStream(inputFile));
Scanner in = new... | Java | ecbc339ad8064681789075f9234c269a | d9b4fa50e3c50a4931954d6dc9eb85c6 | 1,700 | PASSED |
import java.util.*;
import java.io.*;
public class B0018 {
public static void main(String args[]) throws Exception {
new B0018();
}
B0018() throws Exception {
PandaScanner sc = null;
PrintWriter out = null;
try {
sc = new PandaScanner(System.in);
ou... | Java | ecbc339ad8064681789075f9234c269a | d3087734cb6cf66d9e9c46fc7f882b1d | 1,700 | PASSED |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
import java.io.Writer;
import java.math.BigInteger;
import java.io.InputStream;
/**
*... | Java | ecbc339ad8064681789075f9234c269a | 1c8f4618f5f1a9a09f4d92f26c237aff | 1,700 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.lang.reflect.Constructor;
import java.util.Arrays;
import java.util.StringTokenizer;
public class CodeE
{
static class Scanner
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new String... | Java | ecbc339ad8064681789075f9234c269a | 6760e767bca637341ba11e5e6b2f7128 | 1,700 | PASSED |
import java.io.*;
import java.util.*;
import java.math.*;
public class B implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
Random rnd;
void solve() throws IOException {
long total = nextInt(), oneJump = nextInt(), m = nextInt(), l = nextInt();
long current = 0;
while(true... | Java | ecbc339ad8064681789075f9234c269a | 8f0c7ac97b4d8a01f1d8032fe5fc9757 | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class Platforms {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(f.readLine());
long n = Long.parseLong(st.nextToken())... | Java | ecbc339ad8064681789075f9234c269a | 99b30e9f485109da62ff477478f50c29 | 1,700 | PASSED |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int jump = in.nextInt();
int m = in.nextInt();
int len = in.nextInt();
int delta = jump % m;
boolean[] p... | Java | ecbc339ad8064681789075f9234c269a | 93b4191fb3d00e31104483834e85056c | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class Codeforces {
public static void main(String[] args) throws IOException {
Reader.init(System.in);
long n = Reader.nextInt(), d = Reader.nextInt(), m = Reader.nextInt(), l = Reader.nextInt();
long arr[][] = new long[2][(int)n];
... | Java | ecbc339ad8064681789075f9234c269a | 25f9ad06968f23dc3248b7dd0742c3db | 1,700 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace round446
{
class Program
{
static void Main(string[] args)
{
int n = int.Parse(Console.ReadLine());
var line = Console.ReadLine();
v... | C# | 88390110e4955c521867864a6f3042a0 | eb445131ccdba4e13d0857dde9c2f1f4 | 900 | PASSED |
using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
class Program
{
//////////////////////////////////////////////////
void Solution()
{
var n = ri;
var a = rla(n);
var b = rla(n);
var sum = a.Sum();
... | C# | 88390110e4955c521867864a6f3042a0 | 8f0503dfd8a4a40c0787d2e317e2846a | 900 | PASSED |
import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.StringTokenizer
fun main(args: Array<String>) {
val sc = FastScanner(System.`in`)
val n = sc.nextInt()
val a = Array(n) { sc.nextLong() }
val b = Array(n) { sc.nextLong() }
val sum = a.sum(... | Kotlin | 88390110e4955c521867864a6f3042a0 | a7fcee7d1376d6e3f86b4b623565bd2d | 900 | PASSED |
import java.util.*
fun main(args: Array<String>) {
val s = Scanner(System.`in`)
val n= s.nextInt()
val a = Array(n){s.nextLong()}.sum()
val b = Array(n){s.nextLong()}.sortedArray().takeLast(2).sum()
print(if(b>=a) "YES" else "NO")
} | Kotlin | 88390110e4955c521867864a6f3042a0 | c29c15820a18cc831e68db8f96e66fa3 | 900 | PASSED |
import java.util.*
fun main(args: Array<String>) {
val s = Scanner(System.`in`)
val n= s.nextInt()
val a = Array(n){s.nextLong()}.sum()
val b = Array(n){s.nextLong()}.sortedArray()
println(if(b[n-1]+b[n-2]>=a) "YES" else "NO")
} | Kotlin | 88390110e4955c521867864a6f3042a0 | 4ea44324a11184da88689c9a17c6e05d | 900 | PASSED |
import java.util.*
fun main(args: Array<String>) = with(Scanner(System.`in`)) {
val n = nextInt()
var sum: Long = 0
for(i in 1..n) {
val x = nextInt()
sum += x
}
val a = Array(100003, {0})
for(i in 1..n) {
a[i] = nextInt()
}
a.sortDescending()
if(a[0] + a[1] ... | Kotlin | 88390110e4955c521867864a6f3042a0 | 4a77581ca3f062b22054b7d73ac104fa | 900 | PASSED |
fun main(args: Array<String>) {
val N = Integer.parseInt(readLine())
val totalVol = readLine()!!.split(" ").map { it.toLong() }.sum()
val twoCans = readLine()!!.split(" ").map { it.toLong() }.sortedDescending().take(2).sum();
println(if(twoCans >= totalVol) "YES" else "NO" )
} | Kotlin | 88390110e4955c521867864a6f3042a0 | 1b841e7d20ce24e1ba0c4f0e0d853d7d | 900 | PASSED |
import java.util.*
fun main(args: Array<String>) = with(Scanner(System.`in`)) {
val n = nextInt()
val sum = LongArray(n, { nextLong() }).sum()
val a = IntArray(n, { nextInt() }).sorted().takeLast(2).sum()
print("")
when {
a >= sum -> print("YES")
else -> print("NO")
}
}
| Kotlin | 88390110e4955c521867864a6f3042a0 | fb2319e6000ba97cce40df1299dc3069 | 900 | PASSED |
fun main() {
fun readLongs() = readLine()!!.split(" ").map(String::toLong)
readLine()
val biggers = LongArray(2)
val total = readLongs().sum()
val bs = readLongs()
for (b in bs) {
if (b >= biggers[0]) {
biggers[1] = biggers[0]
biggers[0] = b
} else if (b ... | Kotlin | 88390110e4955c521867864a6f3042a0 | aa465f366443f492c3caee5e584dbc1f | 900 | PASSED |
import java.io.*
import java.util.*
fun min(a:Double,b:Double) = if (a<b) a else b
fun max(a:Double,b:Double) = if (a>b) a else b
fun min(a:Long,b:Long) = if (a<b) a else b
fun max(a:Long,b:Long) = if (a>b) a else b
var cin: BufferedReader? = null
var cout: PrintWriter? = null
var tok = StringTokenizer("")
fun init()... | Kotlin | 88390110e4955c521867864a6f3042a0 | 85bb4d795b3351b70297f58d15945dd5 | 900 | PASSED |
#include <bits/stdc++.h>
#include <unistd.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i,j,n) for(i=j;i<n;i++)
#define repi(i,j,n) for(i=j;i>n;i--)
#define inf 1e18
#define M 1000000007
#define pie 3.141592653589793238
#define ll long long
#define ld long double
#defin... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 3ea09dc426a266bad3f8331790d9b51a | 2,000 | PASSED |
#include <bits/stdc++.h>
#include <unistd.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i,j,n) for(i=j;i<n;i++)
#define repi(i,j,n) for(i=j;i>n;i--)
#define inf 1e18
#define M 1000000007
#define pie 3.141592653589793238
#define ll long long
#define ld long double
#defin... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | e70e8f5d3ec8b39250ac9470da199b49 | 2,000 | PASSED |
#include <bits/stdc++.h>
#include <unistd.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i,j,n) for(i=j;i<n;i++)
#define repi(i,j,n) for(i=j;i>n;i--)
#define inf 1e18
#define M 1000000007
#define pie 3.141592653589793238
#define ll long long
#define ld long double
#defin... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 8cad1c91beca9e9c9a8fc6a1ac247ef7 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 934728a8d650e43f5ae9c46c26416c5e | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 076fb1dfd525c60602173639dbad76ef | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 8e80836501f9f40d0cc5449bc94d9a80 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 41389369381c83139317e6138495c2f7 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 3b1a709b6582934c69b3557558b1fdc3 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 6877a0d8455b3b34816a64689bcbe745 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define resz resize
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
... | C++ | 1e6d7ec8023eb0dc482b1f133e5dfe2a | 782a1507916517fd74a9584dc334084e | 2,000 | PASSED |
#include<bits/stdc++.h>
#define reg register
typedef long long ll;
#define f(i,j,k) for(reg int i=j;i<=k;++i)
using namespace std;
const int MN=505;
const ll MD=1e18;
bitset<MN>F[64][2][MN],G,H;
int n,m,lim;
int main(){
scanf("%d%d",&n,&m);
for(reg int i=1,s,t,x;i<=m;i++){
scanf("%d%d%d",&s,&t,&x);
F[0][x][s].set... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | 54ab499c98a03ac1282539241d83d164 | 2,400 | PASSED |
#include<cstdio>
#include<bitset>
#define lim 1000000000000000000ll
int n,m;
std::bitset<505> dp[505][2][505],f,g;
long long ans=0;
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=m;i++)
{
int x,y,opt;
scanf("%d%d%d",&x,&y,&opt);
dp[0][opt][x][y]=1;
}
for (int k=1;k<=60;k++)
for (int x=0;x<=1;x++)
... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | 8f9b5716a114d1c550296d50db0c4d25 | 2,400 | PASSED |
#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
const int N=510;
const int K=63;
const long long INF=1e18;
bitset <N> g[2][K][N],p,c;
long long mi[K];
int main() {
int n, m;
cin>>n>>m;
mi[0] = 1;
for (int i = 1;... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | 85a43dc6359afd94f45bbad4eaa48df6 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define re return
#define mp make_pair
#define fi first
#define se second
#define sz(a) (int)a.size()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef pair<ll, ll> pll... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | 5ba9ea39d7d896bab4bea381321dce20 | 2,400 | PASSED |
#include <cstdio>
#include <cstring>
#include <bitset>
using namespace std;
const int MAXN=505;
const int MAXD=60;
struct Matrix
{
int n, m;
bitset<MAXN> a[MAXN], b[MAXN];
Matrix() {}
Matrix(int r, int c): n(r), m(c) {}
void set(int x, int y, bool k)
{
a[x][y]=b[y][x]=k;
}
Matrix operator * (const Matrix& b) ... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | 94a24ab7a3c6e92fae4276360ba8bd79 | 2,400 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define sqr(x) ((x)*(x))
#define maxn 1e18
using namespace std;
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
bitset<39*(3+9+3+9)>f[2][... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | 8865ba15cd2fb27b045f6e2dd92a5a30 | 2,400 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | d24fe96f01cc0b6a71a703c491d4096c | 2,400 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | 2c3192b8cd3787d9bcc77da5c007ea70 | 2,400 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | d4daae4b1daf71fb0fbfdc9955c3f794 | 2,400 | PASSED |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | C++ | 079696e8e12e0e924be3aebddb0fb6d3 | a051aff7ded0aaf401be589d9aaa68a1 | 2,400 | PASSED |
//God & me
//hadmireza mazerat!
#include <bits/stdc++.h>
#define pb push_back
#define X first
#define Y second
#define int long long
using namespace std;
int in(){int x;return cin>>x,x;}
template<class T,class L>bool smax(T&x,L y){return x<y?(x=y,1):0;}template<class T,class L>bool smin(T&x,L y){return x>y?(x=y,1):0;}
... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | 5c9ee9d197793f99ae02cdec34449179 | 2,400 | PASSED |
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <unordered_set>
using namespace std;
const int MAXN = 1e5 + 10, lg = 19;
int n, q, h[MAXN], s = 1, st[MAXN], en[MAXN], val[MAXN], c = 1;
vector<int> ch[MAXN];
vector<pair<int, int> > hv[MAXN];
map<string, int> mp;
map<... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | 17554dc148bbb857ef90d0993ec11a0c | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
unordered_map<string,int> mp[N];
string str[N];
int depth[N],sz[N],heav[N],co[N],ans[N],dm;
vector<int> adj[N];
vector<bool> big(N);
vector<pair<int,int> > q[N];
void getsz(int s){
sz[s]=1;
int ma=-1;
for(auto it:adj[s]){
depth[it]=dep... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | a81571fb2c696ef1203e584b2c55ee00 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
map<string,int> mp[N];
string str[N];
int depth[N],sz[N],heav[N],co[N],ans[N],dm;
vector<int> adj[N];
vector<bool> big(N);
vector<pair<int,int> > q[N];
void getsz(int s){
sz[s]=1;
int ma=-1;
for(auto it:adj[s]){
depth[it]=depth[s]+1;
... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | 1ec3663d6e107a9cb8b2fbbdb547e082 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define LSB(i) ((i) & -(i))
const int maxn = 1e5+5;
struct Query{
int idx, l, r;
Query() {}
Query(int idx, int l, int r){
this->idx = idx;
this->l = l;
this->r = r;
}
bool operator <(const Query& other) const{
return t... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | e4d41031585dcd4cc7ad7e1970c2a842 | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<cstring>
#include<algorithm>
#define lson x<<1
#define rson x<<1|1
#define ll long long
#define rint register int
#define mid ((L + R) >> 1)
using namespace std;
template <typename xxx> inline void read(xxx &x) {
... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | ae6456705106e5dcf81777707402d52a | 2,400 | PASSED |
#include<stdio.h>
#include<map>
#include<string>
#include<iostream>
#pragma GCC optimize(2)
using namespace std;
int rd(){
int k=0;char c=getchar();
while(c>'9'||c<'0')c=getchar();
while(c>='0'&&c<='9')k=k*10+c-'0',c=getchar();
return k;
}
const int N=500001;
struct E{int v,nxt;}e[N];
struct Q{int w,d,nxt;}q[N];
in... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | a04dd2f71df2d78dfa94adc3f6d5bf5e | 2,400 | PASSED |
#include <map>
#include <set>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define Int register int
#define MAXN 100005
struct edge
{
int v,nxt;
}e[MAXN];
int top = 1;
int head[MAXN];
void Add_Edge (int u,int v)
{
e[++ top] = edge {v,head[u]};
head[u] = top;
... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | 35a53b56845ca1e516a8d3110f437c35 | 2,400 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
#include<vector>
#define R register
#define debug puts("wn")
#define next MabLcdG
using namespace std;
typedef int ll;
typedef long double ld;
typedef double dl;
typede... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | 81d6cbce620def362b79b9eb04f2065e | 2,400 | PASSED |
/* Header {{{ */
#include <bits/stdc++.h>
using namespace std;
typedef long long readtype;
typedef long long var;
typedef long double let;
readtype read() {
readtype a = 0, c = getchar(), s = 0;
while (!isdigit(c)) s |= c == '-', c = getchar();
while (isdigit(c)) a = a * 10 + c - 48, c = getchar();
return s ?... | C++ | e29842d75d7061ed2b4fca6c8488d0e4 | 2afd18d9985660843b10f13b5c499146 | 2,400 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | d9cb1bcea22fc04f224a8ec2284863c6 | 2,800 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | 0c309117e9a82a6f4f992d3d00717add | 2,800 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | a4a2069ac87ebfd07b28c04f9f9c3015 | 2,800 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | 8a96094913bcfaa3181719e90cae54be | 2,800 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | 86ddb64a7356461d343689a6549054db | 2,800 | PASSED |
#ifndef BZ
#pragma GCC optimize -O3
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = double;
using ull = uint64_t;
const int N = 500228;
const int INF = 4 * N;
const int NINF = -INF;
int ans[N];
vector<int> touchedIndices;
vector<int> touchedVertices;
void inc(int x) {
++ans[x... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | a133964498a0fd6feb65822a71c3bdfb | 2,800 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | a28e1bfc6fc620acc680bb3d08bf0961 | 2,800 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | 73e25be143e20781601248f89f9b25e7 | 2,800 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | c042aed8d64997bdabe8aa1cd7445302 | 2,800 | PASSED |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | C++ | 60a71ae88a24574b7a7efad33a3d86a0 | 5f533f81e7f37e425ba67573f7ec1342 | 2,800 | PASSED |
#include<bits/stdc++.h>
#define LIM 100002
using namespace std;
long long int bit[LIM];
void update(int in,int val)
{
while(in<LIM)
{
bit[in]+=val;
in=in+(in&(-in));
}
}
long long int get(int in)
{
long long int ans=0;
while(in)
{
ans+=bit[in];
in=in-(in&(-in));
}
return ans;
}
long long int arr[LIM],t... | C++ | 977aef0dfcf65b60bfe805757057aa73 | 0a1bcc3de715639e8eab67133584adae | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define INF 2147483647
#define lc(a) ((a) << 1)
#define rc(a) ((a) << 1 | 1)
#define lowbit(i) ((i) & (-i))
int inp(){
char c = getchar();
while(c < '0' || c > '9')
c = getchar();
int sum = 0;
while(c >= '0' && c <= '9'){
sum = sum * 10 + c ... | C++ | 977aef0dfcf65b60bfe805757057aa73 | 23da172f23d790002701550b470dc3e8 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define INF 2147483647
#define lc(a) ((a) << 1)
#define rc(a) ((a) << 1 | 1)
#define lowbit(i) ((i) & (-i))
int inp(){
char c = getchar();
while(c < '0' || c > '9')
c = getchar();
int sum = 0;
while(c >= '0' && c <= '9'){
sum = sum * 10 + c ... | C++ | 977aef0dfcf65b60bfe805757057aa73 | dcae5958a8581eeec89b78ef12beba61 | 2,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
typedef long long ll;
typedef long double ld;
#define int long long
int a[N];
struct Fen{
ll fen[N];
void ref(){
fill(fen , fen+N , 0);
}
ll get(int id){
ll ret=0;
for(; id ; id -= id&-id)
ret += fen[id]... | C++ | 977aef0dfcf65b60bfe805757057aa73 | 5885b544a7da558984fe9047c68d89c7 | 2,400 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::it... | C++ | 977aef0dfcf65b60bfe805757057aa73 | 8fbad6b697921d157ec86a7181c9e452 | 2,400 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <iterator>
#include <algorithm>
#include <queue>
#include <cmath>
//not same code
using namespace std;
typedef int64_t ll;
const int EPS = 1e-7;
const int N = 200013;
vector<ll> tree(N);
void init(){
for(int i = 0; i < N; ++i){
tree[i] ... | C++ | 977aef0dfcf65b60bfe805757057aa73 | 26d2a890561134f9a6f361908a3b429c | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100009;
int n;
int a[maxn];
long long fwt[maxn];
long long fwt_get(int k) {
long long ret = 0;
while (k) {
ret += fwt[k];
k -= k & -k;
}
return ret;
}
void fwt_add(int k, long long d) {
while (k <= n) {
fwt[k] +... | C++ | 977aef0dfcf65b60bfe805757057aa73 | 03c9dd6dca64507f52db6a52596e1d25 | 2,400 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
inline int gi() {
register int data = 0, w = 1;
register char ch = 0;
while (!isdigit(ch) && ch != '-') ch = getchar();
if (ch == '-') w = -1, ch = getchar();
w... | C++ | 977aef0dfcf65b60bfe805757057aa73 | e30bbadf3d87d1a6c35957a8141043b7 | 2,400 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <functional>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
typedef ... | C++ | 977aef0dfcf65b60bfe805757057aa73 | 042c56e61c5ec57b1774fddd9fca863e | 2,400 | PASSED |
import java.util.Scanner;
public class CodeForce {
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int w=0;
int x = 0;
if(n%2==0)
{
System.out.println(n/2);
... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | 586f43d293a85061f71926370d0d3521 | 800 | PASSED |
import java.util.Scanner;
public class A{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int t ,n;
n=sc.nextInt();
if(n%2!=0)
{
System.out.println(1+(n-3)/2)... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | a4f74cb598fb01c874996b3718f91ae9 | 800 | PASSED |
import java.util.Scanner;
public class A749 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
if(t%2==0){
System.out.println(t/2);
while(t > 0){
System.out.print("2 ");
t-=2;
... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | c7334d47b787a1a5e3cd862b019fd48f | 800 | PASSED |
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.Scanner;
/**
*
* @author yashvi1902
*/
public class bachgold {
public static void main(String[] args) {
... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | a6bbfd15fa2e0b88e47c0ab565975e3c | 800 | PASSED |
import java.util.Scanner;
public class P749A {
static void printAsMaximalPrimeSum(int n) {
int cont2=0, cont3=0, cont=0;
if (n % 2 == 1) {
cont++;
cont3++;
n =n-3;
}
while (n>0) {
cont++;
cont2++;
... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | bbba891c2dd293eaceb28f5bf49815de | 800 | PASSED |
import java.util.*;
public class solution {
public static void main(String[] args) {
Scanner s=new Scanner(System.in);
int t=s.nextInt();
if(t%2==0) {
int n=t/2;
System.out.println(n);
for(int i=0;i<n;i++) {
System.out.print(2+" ");
}
}
else {
t=t-3;
int n=t/2;
System.out.println(n... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | bb659e6cfba304215074caa02fb02385 | 800 | PASSED |
import java.util.*;
public class solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt() ;
System.out.println(n/2);
while (n > 3){
System.out.print(2 + " ");
n -= 2 ;
}
Sy... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | 7e8bc26e37be39fcbd02ff38a0941d44 | 800 | PASSED |
import java.util.Scanner;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author ASUS
*/
public class Main {
public static void main(String[] args) {
Scanner... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | 86001d83ab9acef755f38c21ee90bc8f | 800 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class SolutionA extends Thread {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new B... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | b85123ee1382809cadb7dfdcc395c7d1 | 800 | PASSED |
//package hiougyf;
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) throws IOException
{
Scanner sc =new Scanner(System.in);
int n=sc.nextInt();
int x=n/2;
System.out.println(x);
if(n%2==0) {
while(x-->0) System.out.print(2+" ");
}
el... | Java | 98fd00d3c83d4b3f0511d8afa6fdb27b | 6ab3b576be00c3b01f1b33c843b24433 | 800 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define SPEED ios_base::sync_with_stdio(false);
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define RFOR(i, b, a) for (ll i = b; i >= a; --i)
#define ALL(x) x.begin(), x.end()
#define DEBUG(args...) { string _s = ... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | e45c6e646bf6e0ffcb6d4e65e7467f61 | 2,000 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define SPEED ios_base::sync_with_stdio(false);
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define RFOR(i, b, a) for (ll i = b; i >= a; --i)
#define ALL(x) x.begin(), x.end()
#define DEBUG(args...) { string _s = ... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | 3572b2cd9bf54652ee3e1754f587e73b | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
ll hell=pow(10,9)+5;
void solve(){
ll n,st,x;
cin>>n>>st>>x;
vector<ll> v;
for(ll i=1;i<=n;i++)
v.push_back(i);
l... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | cc5f9d333b2305512115af20af160bc7 | 2,000 | PASSED |
// while (clock()<=69*CLOCKS_PER_SEC)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_c... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | 8bb27b5bc1297e538396873c46ab43de | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
using pi = pair<int,int>;
#define ST first
#define ND second
#define PB push_back
pi ask(int x) {
cout << "? " << x << endl;
int a,b;
cin >> a >> b;
return {a,b};
}
int main() {
int n, start, x;
cin ... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | 53a1ea65fa5dcc3b282f0ee30de0c72a | 2,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
int n,start,x,xx,y,an1,an2,an,nxt,c[100000];
int main(){
scanf("%d%d%d",&n,&start,&x);
for(int i=1;i<=n;i++){
c[i]=i;
swap(c[i],c[rng32()%i+1]);
}
//for(int i=1;i<=n;i++) printf("%d ",c[... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | 9121288a17838e6270dd7667969318a9 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e6+50;
const int M = 2e6;
const ll oo = 1e18;
const int mod = 1e9+7;
pair<int,int> ask(int x){
printf("? %d\n", x);
fflush(stdout);
int v,e;
cin>>v>>e;
return {v,e};
}
int ... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | 4752a293181356f005e59b5ca3c08ed0 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,pos,curval,x;
int val,nxt;
void ask(int i) {
cout<<"? "<<i<<endl;
cin>>val>>nxt;
}
void rep(int ans) {
cout<<"! "<<ans<<endl;
exit(0);
}
int main() {
cin>>n>>pos>>x;
ask(pos);
if(val>=x) rep(v... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | 73b9aa9bc5b5c7093c1d8151f5ca0b43 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n, strt, x, x1;
int mx = -1, mxpos = 0, needNxt;
pair<int, int> ask(int pos){
cout << "? " << pos << endl;
pair<int, int> ans;
cin >> ans.first >> ans.second;
return ans;
}
vector <int> vec;
int main(){
... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | d36d213e1ac1a0ad025fe3c41aa723b1 | 2,000 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <cmath>
#include <set>
#include <map>
#include <cstdio>
#include <stdlib.h>
#include <stack>
#include <numeric>
#include <bitset>
#include <cctype>
#include <list>
#include <assert.h>
#include <rand... | C++ | 8aba8c09ed1b1b25fa92cdad32d6fec3 | 00c64ed533006712b651f6209ac1c240 | 2,000 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define MIN 1<<31-1
#define HMAX 1000000000000000000
#define MOD 1000000007
#define REP(i,n) for(ll i = 0; i < (n); i++)();... | C++ | 75d05c16baaba4b17ad6a9c1dd641bc0 | 2362ec81e7baa43d54dfd9085788ea40 | 2,100 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.