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;
typedef long long ll;
typedef pair<int, int> PII;
const ll inf = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector dist(n, vector<ll>(n, inf));
vector<vector<array<int, 3>>> e(n);
... | C++ | 26789a1ef4b661d23c306f01f88e3211 | a698ccfb9562589d8900c0278fb90784 | 2,400 | PASSED |
#line 1 "/home/maspy/compro/library/my_template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
template <class T>
using vc = vector<T>;
template <cl... | C++ | 26789a1ef4b661d23c306f01f88e3211 | 936cf20eb427d4f7da610ca111bc97d3 | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define int long long
#define ff first
#define ss second
const int N = 607;
vector<vector<int>> d(N,vector<int> (N,1e18));
vector<pair<int,int>> g[N];
vector<pair<pair<int,in... | C++ | 26789a1ef4b661d23c306f01f88e3211 | 891f67de095ff22ea804cc14273687ef | 2,400 | PASSED |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define ll long long
#define int long long
#define bpp __builtin_popcount
#define ld long... | C++ | 26789a1ef4b661d23c306f01f88e3211 | 32e2195b4b7b92e64c82205ea501a467 | 2,400 | PASSED |
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<i... | C++ | 26789a1ef4b661d23c306f01f88e3211 | e093f71278b00a06f066e5841a259182 | 2,400 | PASSED |
#pragma GCC optimize("Ofast")
# include <bits/stdc++.h>
using namespace std;
# define rep(i, a, b) for(int i = a; i < (b); ++i)
# define trav(a, x) for(auto& a : x)
typedef long long ll;
typedef vector<int> vi;
const int INF = 1e9 + 5;
ll solve(int n, vector<vector<int>> &adj,
int q, vi &u, vi &... | C++ | 26789a1ef4b661d23c306f01f88e3211 | 6861318de419a7a2d85730fab012500a | 2,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 32768;
int ans[40000];
void dfs(int z)
{
if (ans[z] != -1)
{
return;
}
dfs(2 * z % MOD);
ans[z] = 1 + ans[2 * z % MOD];
dfs((z + 1) % MOD);
ans[z] = min(ans[z], 1 + ans[(z + 1) % MOD]);
}
signed main()
{
... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | 0bd0711609c2cb1948fc079a7db24f56 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 32768;
int ans[40000];
void dfs(int z)
{
if (ans[z] != -1)
{
return;
}
dfs(2 * z % MOD);
ans[z] = 1 + ans[2 * z % MOD];
dfs((z + 1) % MOD);
ans[z] = min(ans[z], 1 + ans[(z + 1) % MOD]);
}
signed main()
{
... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | 13b0be5392932d5e0b00dfcacd55eb27 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int MOD = 32768;
int ans[40000];
int dfs(int z){
if(ans[z] != -1){
return ans[z];
}
ans[z] = 1 + dfs(2*z%MOD);
ans[z] = min(ans[z], 1 + dfs((z+1)%MOD));
return ans[z];
}
signed main(){
int n; cin >> n;
memset(ans... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | 7906e9902c5e9ed31799326dd2052399 | 1,300 | PASSED |
// ਹਰਅਸੀਸ ਸਿੰਘ
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define infinity 899999999... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | ffbe8b8a5263db58536a7d0d863db334 | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define all(a) ((a).begin()), ((a).end())
#define log(v) for(auto __i = ((v).begin()); __i != ((v).end()); __i++) cout << *(__i) << " "; cout << "\n... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | 63f6b8648f011775071a08174bb34d3f | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define all(a) ((a).begin()), ((a).end())
#define log(v) for(auto __i = ((v).begin()); __i != ((v).end()); __i++) cout << *(__i) << " "; cout << "\n... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | 1b6b5b36545068af8650f708753f25f7 | 1,300 | PASSED |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MOD=32768;
ll func(ll x, vector<ll> &v1)
{
if (v1[x] != -1)
return v1[x];
v1[x] = 1 + func((x * 2) % MOD, v1);
v1[x] = min(v1[x], 1LL + func((x + 1) % MOD, v1));
return v1[x];
}
int main(){
int n;
cin>>n;
... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | 0dabd35db02306906c7614b13571b0ae | 1,300 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define all(a) ((a).begin()), ((a).end())
#define log(v) for(auto __i = ((v).begin()); __i != ((v).end()); __i++) cout << *(__i) << " "; cout << "\n... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | c3aaaabbb2a7fa75f15b824e47b90f27 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define MXN (int)(1e9 + 5)
#define MOD 32768
#define ld long double
#define ll long long
#define pb push_back
#define endl '\n'
#define all(x) x.begin(), x.end()
#define IO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
int count2(int x){
int ret = 0;
if(... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | 1f8da05c780dc7fb4bd3ac9c80331623 | 1,300 | PASSED |
#include<iostream>
using namespace std;
int n,v,minn,t,cnt;
int main(){
cin>>n;
while(n--){
scanf("%d",&v);
minn=2147483647;
for(int i=0;i<=15;i++){
cnt=i;
t=(v+i)%(1<<15);
while(t){
t=(t<<1)%(1<<15);
cnt++;
... | C++ | 5c844c0dc0eb718aea7b2446e90ce250 | 41fa5904d5d3f3c41bfbea1736d75c45 | 1,300 | PASSED |
#include <bits/stdc++.h>
#define file "test"
#define ll long long
#define st first
#define nd second
#define pii pair<ll,ll>
using namespace std;
const long long N = 2e6 + 4;
const long long INF = 1e18;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifndef ONLINE_JUDGE
freopen... | C++ | 94ec011dc830661c226bd860b9d70de5 | a06f61b738cf97c92c49b22cdfad7558 | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{int t;
cin>>t;
while(t--)
{
ll n;
cin >> n;
ll a[n], b[n];
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> b[i];
for(int i=0;i<n;i++)
... | C++ | 94ec011dc830661c226bd860b9d70de5 | fb7eb8fc8326fc3763d38b094f657dfd | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
main()
{
int t;
cin >> t;
while(t--)
{
int n;
cin >> n;
int ara[n];
int ara2[n];
for(int i=0;i<n;i++)
{
cin >> ara[i];
}
for(int i=0;i<n;i++)
{
... | C++ | 94ec011dc830661c226bd860b9d70de5 | 69b099da848d5667673db150f3e98607 | 800 | PASSED |
# pragma region Library
# include <bits/stdc++.h>
# define int Int
# define float Float
# define overload3(_1,_2,_3,name,...) name
# define _step(n) _rep(_,n)
# define _rep(i,n) _repr(i,0,n)
# define _repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)
# define rep(...) overload3(__VA_ARGS__, _repr, _rep, _... | C++ | 94ec011dc830661c226bd860b9d70de5 | 83acab6adc12d72e8e3197ee0acc34a0 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin >> n;
while(n--){
long long int k;
cin >> k;
long long int arr[k];
long long int arr_[k];
for(long long int i=0;i<k;i++){
cin >> arr[i];
}
for(long l... | C++ | 94ec011dc830661c226bd860b9d70de5 | ca0dec980cc348669d96b1b7cffce012 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t; cin>>t;
while(t--){
long long n; cin>>n;
vector<long long>a,b;
for(long long i=0;i<n;i++){
long long g;
cin>>g;
a.push_back(g);
}
for(long long i=0;i<n;i++){
long long g;
cin>>g;
b.push_back(g);
}
... | C++ | 94ec011dc830661c226bd860b9d70de5 | dc551b29febe7995cbbe0519d1e72ddb | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
using namespace std;
int main()
{
int n,t;
long long sum1 = 0;
cin >> t;
for (int k = 0; k < t; k++)
{
cin >> n;
int arra[n+1];
int arrb[n+1];
for (int i = 0; i < n; i++)
{
cin >> arra[i];
... | C++ | 94ec011dc830661c226bd860b9d70de5 | fd6d1c87e6c3f8ffc69e545774bdeb65 | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
using namespace std;
int main()
{
int n,t;
long long sum1 = 0;
cin >> t;
for (int k = 0; k < t; k++)
{
cin >> n;
long long arra[n+1];
long long arrb[n+1];
for (int i = 0; i < n; i++)
{
cin >... | C++ | 94ec011dc830661c226bd860b9d70de5 | e08e135c06071648f6cd0a6f2c3bfa19 | 800 | PASSED |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
using namespace std;
int main()
{
int n,t;
long long sum1 = 0, test1 = 0, test2 = 0;
cin >> t;
for (int k = 0; k < t; k++)
{
cin >> n;
long long arra[n+1];
long long arrb[n+1];
for (int i = 0;... | C++ | 94ec011dc830661c226bd860b9d70de5 | c5a8cfbe7508d667f8d1dd1e688a920f | 800 | PASSED |
#include <iostream>
using namespace std;
long long int absolute(long long int value)
{
if (value < 0) value *= -1;
return value;
}
void swap(long long int *num1, long long int *num2)
{
long long int tmp = *num1;
*num1 = *num2;
*num2 = tmp;
}
int main()
{
int t, n, i, j;
long long int a[2... | C++ | 94ec011dc830661c226bd860b9d70de5 | 485b193e29018c6d036828ce3008c588 | 800 | PASSED |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
import javax.net.ssl.SSLContext;
public class Main {
static final long MOD1=1000000007;
static final... | Java | 7c0ffbba9e61a25e51c91b1f89c35532 | f2014079c4223fddd196efc2bd8db534 | 2,500 | PASSED |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
import javax.net.ssl.SSLContext;
public class Main {
static final long MOD1=1000000007;
static final... | Java | 7c0ffbba9e61a25e51c91b1f89c35532 | 62a32f6456ef8c1ed9111b595c7e0a12 | 2,500 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
static int[][] size;
static int[][][] parent;
static char[][] a;
public static void main(String[] args) {
MyScanner in = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int n = in.nextInt(... | Java | 7c0ffbba9e61a25e51c91b1f89c35532 | b7617ee09c6a1328b65a102f805cf805 | 2,500 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
static int[][] size;
static int[][][] parent;
static char[][] a;
public static void main(String[] args) {
MyScanner in = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int n = in.nextInt(... | Java | 7c0ffbba9e61a25e51c91b1f89c35532 | 498defee779caefda456c8509e31eecc | 2,500 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
static int[][] size;
static int[][][] parent;
static char[][] a;
public static void main(String[] args) {
MyScanner in = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int n = in.nextInt(... | Java | 7c0ffbba9e61a25e51c91b1f89c35532 | 1d69412d8bfee63abea8b455dadc7a20 | 2,500 | PASSED |
// package c1661;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.lang.invoke.MethodHandles;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Random;
import java.uti... | Java | 7c0ffbba9e61a25e51c91b1f89c35532 | 860655fc04d4f865dc67315c4b6811d2 | 2,500 | PASSED |
import java.util.*;
import java.util.function.*;
import java.io.*;
import java.lang.reflect.Array;
// you can compare with output.txt and expected out
public class RoundEdu126E {
MyPrintWriter out;
MyScanner in;
// final static long FIXED_RANDOM;
// static {
// FIXED_RANDOM = System.currentTimeMillis... | Java | 7c0ffbba9e61a25e51c91b1f89c35532 | c60a19d2e7077c6513d088b4853bc4ad | 2,500 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Os")
#pragma GCC optimize("Og")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre... | C++ | 7c0ffbba9e61a25e51c91b1f89c35532 | ca07cea4f55ad7473ab3fa7738a26373 | 2,500 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Os")
#pragma GCC optimize("Og")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("... | C++ | 7c0ffbba9e61a25e51c91b1f89c35532 | 33ed1b52c2bf44bb1536b96f9569966f | 2,500 | PASSED |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Os")
#pragma GCC optimize("Og")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("... | C++ | 7c0ffbba9e61a25e51c91b1f89c35532 | 5a5369c1154b4948d240fa60701237d3 | 2,500 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class App {
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public ... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 030b150b9c2a706c875b66904069ff5e | 1,700 | PASSED |
import java.util.*;
import java.io.*;
public class Main {
static int mod = 1000000007;
static void read(int arr[], int start, int end, FastReader in) {
for (int i = start; i < end; i++) {
arr[i] = in.nextInt();
}
}
static int sumArr(int arr[]) {
in... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 900989b1c969b91b84cabb7e8dfea437 | 1,700 | PASSED |
import java.util.*;
public class Solution2 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int tc = sc.nextInt();
for(int i=0; i < tc; i++) {
int len = sc.nextInt();
int[] tree = new int[len];
long res = 0;
... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 8b45ae0387ad08843c2f17e22f10f26f | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
MyScanner in = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int t = in.nextInt();
while(t-- > 0) {
int n = in.nextInt();
lon... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 4b4dbb2ab7fd288aa7f2ced5a45b4e6a | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
MyScanner in = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int t = in.nextInt();
while(t-- > 0) {
int n = in.nextInt();
lon... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 7c8b3bb8e8b3bd1c52e7288c9ef4493d | 1,700 | PASSED |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
MyScanner in = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int t = in.nextInt();
while(t-- > 0) {
int n = in.nextInt();
lon... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 8c7e76fbe8bfb8def4fb0b30614e4110 | 1,700 | PASSED |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
MyScanner in = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int t = in.nextInt();
for(int i = 0; i < t; i++) {... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | c7d80fdf0d1106f4ecbc58b5ea749e49 | 1,700 | PASSED |
/*----------- ---------------*
Author : Ryan Ranaut
__Hope is a big word, never lose it__
------------- --------------*/
import java.io.*;
import java.util.*;
public class Codeforces1 {
static PrintWriter ou... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 56b9fc845aab6f27a8260f0a35b838c9 | 1,700 | PASSED |
/*----------- ---------------*
Author : Ryan Ranaut
__Hope is a big word, never lose it__
------------- --------------*/
import java.io.*;
import java.util.*;
public class Codeforces1 {
static PrintWriter ou... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 61602ea82c314470c17f4a195e8e63ef | 1,700 | PASSED |
/*----------- ---------------*
Author : Ryan Ranaut
__Hope is a big word, never lose it__
------------- --------------*/
import java.io.*;
import java.util.*;
public class Codeforces1 {
static PrintWriter ou... | Java | 1f7fa6c56cb7be9404aa2ebaba89a44c | 37a9790c975b79e083331328d8cfeb0e | 1,700 | PASSED |
#include <stdio.h>
#include <vector>
#include <stack>
#include <functional>
#include <numeric>
#include <complex>
#include <queue>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <assert.h>
#include <cstring>
#include <sstream>
#include <string>
#... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | c9acbc5c4a05edd27dede29e98e237a9 | 1,900 | PASSED |
#include <stdio.h>
#include <vector>
#include <stack>
#include <functional>
#include <numeric>
#include <complex>
#include <queue>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <assert.h>
#include <cstring>
#include <sstream>
#include <string>
#... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 42d39ccedbbc3e2011d1978cda71d8c9 | 1,900 | PASSED |
#include <stdio.h>
#include <vector>
#include <stack>
#include <functional>
#include <numeric>
#include <complex>
#include <queue>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <assert.h>
#include <cstring>
#include <sstream>
#include <string>
#... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 1674420f6ec98fe0e7352d0580e465a9 | 1,900 | PASSED |
#include <stdio.h>
#include <vector>
#include <stack>
#include <functional>
#include <numeric>
#include <complex>
#include <queue>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <assert.h>
#include <cstring>
#include <sstream>
#include <string>
#... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 4e5080917b63ccf435915520241ce558 | 1,900 | PASSED |
#include <stdio.h>
#include <vector>
#include <stack>
#include <functional>
#include <numeric>
#include <complex>
#include <queue>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <assert.h>
#include <cstring>
#include <sstream>
#include <string>
#... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 630992a4c0fb21553faa2f95b39c46b5 | 1,900 | PASSED |
#include <stdio.h>
#include <vector>
#include <stack>
#include <functional>
#include <numeric>
#include <complex>
#include <queue>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <assert.h>
#include <cstring>
#include <sstream>
#include <string>
#... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 163153bf6bcaabd1b340ec08dfcf1ebd | 1,900 | PASSED |
#include<bits/stdc++.h>
#define l(x) x<<1
#define r(x) x<<1|1
using namespace std;
typedef long long ll;
const int N =3e5+10;
struct stu
{
int l,r;
ll val;
ll lazy;
} tr[N<<2];
ll a[N],b[N];
void pushup(int u)
{
tr[u].val=tr[l(u)].val+tr[r(u)].val;
}
void pushdown(int u)
{
int l=tr[u].l,... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 2c266b5e1066230336161cb472163c88 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define l(x) x<<1
#define r(x) x<<1|1
using namespace std;
typedef long long ll;
const int N =3e5+10;
struct stu
{
int l,r;
ll val;
ll lazy;
} tr[N<<2];
ll a[N],b[N];
void pushup(int u)
{
tr[u].val=tr[l(u)].val+tr[r(u)].val;
}
void pushdown(int u)
{
int l=tr[u].l,... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 94916684d36f624c7bf9e72ccaca9b4f | 1,900 | PASSED |
#include<bits/stdc++.h>
#define l(x) x<<1
#define r(x) x<<1|1
#define int long long
using namespace std;
typedef long long ll;
const int N = 3e5 + 10;
ll b[N], a[N];
struct node
{
int l, r;
ll v, tag;
} tr[N * 4];
void build(int u, int l, int r)
{
tr[u].l = l, tr[u].r = r;
if (l == r)
{
tr[... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 820bdc95eabbdca0158c7776331e18b1 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return x*f;
}
const ll N=1000010;
ll n,k,a[N],b[N],ans1,ans2;
struct SegmentTr... | C++ | f5f3b9c93060f231a55b941a7fa804e1 | 94258290e225e1f5d82e569a3a348f64 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define N 200005
#define M 40000005
using namespace std;
long long arr[N];
long long val(long long a,long long b){
return (a / b) * (a/b) * (b - a%b) + (a / b + 1) * (a/b + 1) * (a%b);
}
map<long long,int> v;
int s[N];
void solve(){
long long n;
cin >> n;
long lo... | C++ | 611845be511503f1787603428a4de6c0 | bf2958a09f7615cdd8cff23854615593 | 2,600 | PASSED |
#include <bits/stdc++.h>
#define N 200005
#define M 40000005
using namespace std;
long long arr[N];
long long val(long long a,long long b){
return (a / b) * (a/b) * (b - a%b) + (a / b + 1) * (a/b + 1) * (a%b);
}
map<long long,int> v;
int s[N];
void solve(){
long long n;
cin >> n;
long lo... | C++ | 611845be511503f1787603428a4de6c0 | 832a0de53f03427d4d6e7386fb7043b0 | 2,600 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define eb emplace_back
#define fi first
#define se second
#define pii pair<int,int>
using namespace std;
const int mod=1e9+7;
int kpow(int x,int y,int rex=1){
for(;y;y>>=1,x=1ll*x*x%mod)if(y&1)rex=1ll*x*rex%mod;
return rex;
}
int exgcd(int a,int b,int &... | C++ | 611845be511503f1787603428a4de6c0 | 5f4bdd711ab0f6222d8e36d5d205c9b5 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
// Username: WillTheBill
#define _automulttst_ 0
#define _interactive_ 0
#define int long long
#define mod mod1
// values
const int mod1 = 1000000007;
const int mod2 = 998244353;
// defines
#define vec vector
typedef string str;
#define tup tuple
#define pb push_back
#defi... | C++ | 611845be511503f1787603428a4de6c0 | b9108623f9702f2cc2694802db2433a4 | 2,600 | PASSED |
// codeforces: https://codeforces.com/contest/1660/problem/A
#include <bits/stdc++.h>
using namespace std;
#define fast(); ios_base::sync_with_stdio(false); cin.tie(NULL);
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
ll minEnergy(int distance, int stations) {
if ... | C++ | 611845be511503f1787603428a4de6c0 | 0ea25664b02dd5eff094926eabe82bcf | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 5e18;
long long f(int x, int k) {
// minimum energy for segment of length x with k portals
if (k < 0) return INF;
k++;
if (k >= x) return x;
int small = x/k;
return 1LL * (k-x%k) * small * small + 1LL * (x%k) * (s... | C++ | 611845be511503f1787603428a4de6c0 | a271d1e84bdbb1f3282ce8a8acecd27e | 2,600 | PASSED |
#include<bits/stdc++.h>
#define LL long long
#define ls u<<1
#define rs u<<1|1
#define mm(x) memset(x,0,sizeof(x))
#define debug(x) cout << #x << ":" << x << '\n'
using namespace std;
int read()
{
int a=0;int f=0;char p=getchar();
while(!isdigit(p)){f|=p=='-';p=getchar();}
while(isdigit(p)){a=(a<... | C++ | 611845be511503f1787603428a4de6c0 | 6833d402f7579bf7249ad315ec0ba66b | 2,600 | PASSED |
#include<bits/stdc++.h>
#define LL long long
#define ls u<<1
#define rs u<<1|1
#define mm(x) memset(x,0,sizeof(x))
#define debug(x) cout << #x << ":" << x << '\n'
using namespace std;
int read()
{
int a=0;int f=0;char p=getchar();
while(!isdigit(p)){f|=p=='-';p=getchar();}
while(isdigit(p)){a=(a<... | C++ | 611845be511503f1787603428a4de6c0 | 139c253856ae246ccc57a307ebd2d9e1 | 2,600 | PASSED |
#include<bits/stdc++.h>
#define LL long long
#define ls u<<1
#define rs u<<1|1
#define mm(x) memset(x,0,sizeof(x))
#define debug(x) cout << #x << ":" << x << '\n'
using namespace std;
int read()
{
int a=0;int f=0;char p=getchar();
while(!isdigit(p)){f|=p=='-';p=getchar();}
while(isdigit(p)){a=(a<... | C++ | 611845be511503f1787603428a4de6c0 | 6d2d64cc57c6305d97ed91784fa77a22 | 2,600 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
using namespace std;
int64_t sqrtup(int64_t x)
{
double d = x;
d = sqrt(d);
d += 1;
return int64_t(d);
}
struct seg
{
... | C++ | 611845be511503f1787603428a4de6c0 | 94024a3e85ff019de604d942378bca64 | 2,600 | PASSED |
from sys import stdin, stdout
import sys
import heapq
from collections import defaultdict
import math
import bisect
import io, os
# from cffi import FFI
import copy
import itertools
# for interactive problem
# n = int(stdin.readline())
# print(x, flush=True)
input = io.BytesIO(os.read(0, os.fstat(0).st... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | fbae864d06746c3b0087d32e74821964 | 1,900 | PASSED |
from sys import stdin, stdout
import sys
import heapq
from collections import defaultdict
import math
import bisect
import io, os
# from cffi import FFI
import copy
import itertools
# for interactive problem
# n = int(stdin.readline())
# print(x, flush=True)
input = io.BytesIO(os.read(0, os.fstat(0).st... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | 198186968554cdad23291e6e848551e0 | 1,900 | PASSED |
import sys
import math
import heapq
import bisect
from collections import Counter
from collections import defaultdict, deque
from io import BytesIO, IOBase
from itertools import permutations
import string
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
import os
s... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | e8b84393d48797a274c76f1d65d79dfb | 1,900 | PASSED |
from heapq import heapify, heappop, heappush
from itertools import cycle
from math import sqrt,ceil
import os
import sys
from collections import defaultdict,deque
from io import BytesIO, IOBase
# prime = [True for i in range(5*10**5 + 1)]
# def SieveOfEratosthenes(n):
# p = 2
# while (p * p <... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | 1e0713321dbc7f90ecc92f8feeacd4b9 | 1,900 | PASSED |
# D. Frog Traveler
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
visited = [False for _ in range(n)]
visited[-1] = True
jumps = []
num_jumps = 0
curr = n-1
while curr >= 0:
if curr - a[curr] < 0:
jumps.append(0)
num_jumps += 1
... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | c5211c3b4c686e600e09edcac86ef681 | 1,900 | PASSED |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a = [0] + a
b = [0] + b
previous = [-1]*(n+1)
recent = [-1]*(n+1)
visited = [False]*(n+1)
previous[n] = -2
import collections
q = collections.deque()
q.append(n)
p = -1
k = 0
minn = n
while len(q):
temp = q.poplef... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | 8f6049c1f5e96f400f795bc7436aec29 | 1,900 | PASSED |
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a = [0] + a
b = [0] + b
previous = [-1]*(n+1)
recent = [-1]*(n+1)
visited = [False]*(n+1)
previous[n] = -2
import collections
q = collections.deque()
q.append(n)
p = -1
k = 0
minn = n
while len(q):
temp = q.poplef... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | fd0993516623d264aa06ab6767ec0ca9 | 1,900 | PASSED |
input = __import__('sys').stdin.readline
n = int(input())
a = [0] + list(map(int, input().split()))
b = [0] + list(map(int, input().split()))
dp = [10**6] * n + [0]
transition = [-1] * (n+1)
fixed = n
ptr = 0
queue = [n]
while ptr < len(queue):
i = queue[ptr]
ptr += 1
# push from i + b... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | 54f7851e6c53c11a298a629dd792f5ad | 1,900 | PASSED |
from collections import deque
def solve():
n = int(input())
arr = [0] + list(map(int, input().split()))
brr = [0] + list(map(int, input().split()))
p = [-1] * (n+1)
p[n] = n
bd = n
queue = deque()
queue.append((n, n))
while queue:
a, b = queue.popleft()
... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | 3a683f56183f3fe0ec996672a45da1ea | 1,900 | PASSED |
import sys
from collections import deque
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def err(x): print(x); exit()
n = inp()
a = tuple(map(int, sys.stdin.readline().split()))
b = tuple(map(int, sys.stdin.readline().split()))
N = 2*(n+1)
g = [[] for _ in range(N)]
for i in ra... | Python | 6f8de802d2b6b0f48f2be0531b3ac8d4 | 9cb893926e8a0829296fb98b9705a4eb | 1,900 | PASSED |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | C++ | 4a58039c5171597ecf78837e9db1d71d | eee007afa997b754fd78ab998d57bed1 | 800 | PASSED |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | C++ | 4a58039c5171597ecf78837e9db1d71d | 9d4796653cd191939ed686045a19f2d0 | 800 | PASSED |
#include "stdio.h"
#include "string.h"
char s[105];
int main(){
int t;
scanf("%d",&t);
while(t--){
scanf("%s",&s);
int len=strlen(s);
char min=s[0];
int t=0;
for (int i = 1; i < len; ++i) {
if(min>s[i]){
min=s[i];
t=i;
... | C++ | 4a58039c5171597ecf78837e9db1d71d | 768a3d1ebbecf90b4c3520d676f008d3 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while(t--)
{
string s;
cin >> s;
char mn = s[0];
int idx = 0;
for(int i = 0; i<s.size(); i++){
if(s[i] < mn){
... | C++ | 4a58039c5171597ecf78837e9db1d71d | 71ba571ad36a1211290205f9e1d2d830 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define nn '\n'
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define Se... | C++ | 4a58039c5171597ecf78837e9db1d71d | 1b3e2db9b70f87e06e39c8318059e4a4 | 800 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <bitset>
using namespace std;
//#include <unordered_map>
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define vi vector<int>
#define lp(... | C++ | 4a58039c5171597ecf78837e9db1d71d | 33551ffecfbaa7ff4b42af8dc9e0fb8b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t ;
string s ;
char ch[ 110 ] ;
int main(){
scanf( "%d" , &t );
while( t -- ){
cin >> s ;
strcpy( ch , s.c_str() ) ;
sort( ch , ch + s.length() ) ;
int tmp = s.find_first_of( ch[ 0 ] ) ;
s.erase( tmp , 1 ) ;
cout <<... | C++ | 4a58039c5171597ecf78837e9db1d71d | 2dcea36b801ccfa06236e5237b751467 | 800 | PASSED |
#include <iostream>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main()
{
ll t; cin >> t;
while(t--){
string s;
cin >> s;
ll mnpos;
char mn =CHAR_MAX;
... | C++ | 4a58039c5171597ecf78837e9db1d71d | a40353391075c22bc9c7aa4615e0bdef | 800 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string u;
cin>>u;
char a='z'+1;int j;
for(int i=0;i<u.size();i++)
{
if(u[i]<a)
{
a=u[i];
j=i;
}
}
//cout<<j<<endl;
... | C++ | 4a58039c5171597ecf78837e9db1d71d | e02f04259f343e3c8b2fb2f8ff5f21d6 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sorti(v) sort(v.begin(),v.end())
#define sortd(v) sort(v.begin(),v.end(),greater <ll> ())
#define sortv(v,mx) sort(v.begin(),v.end(),mx)
#define prs(n) cout<<n<<" "
#define prn(n) cout<<n
#define prns(n) cout<<n<<"\n"
#define pb pus... | C++ | 4a58039c5171597ecf78837e9db1d71d | 521ff735768eb20489303391e1dff8ae | 800 | PASSED |
#include <iostream>
#include <ranges>
#include <map>
#include <vector>
#include <cstdint>
#include <algorithm>
using namespace std;
int main()
{
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
uint64_t cases, size, position, step, highest = 0;
cin >> cases;
while (cases--)
{
cin >> size;
... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | ba54ba47915878b83744a222e772263d | 1,100 | PASSED |
/* ████████████████████████████████████████████████████████████████████████████████████
* ██████████████████████████████████████████████████████████████████████████████████████
* ███████████████████████████▓▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓╬╬╬╬╬╬▓███████████████████████
* █████████████████████████... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | fc63eb6860e4548ec1285ddab56b3f1d | 1,100 | PASSED |
/*_____________ Library _____________*/
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
/*__________________ AlL Defines __________________*/
#define rep(a,... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | c27b560249fd34692621cbcf55af437a | 1,100 | PASSED |
/*_____________ Library _____________*/
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
/*__________________ AlL Defines __________________*/
#define rep(a,... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | 8d9d4f3ec5007b4c7c294382d926558d | 1,100 | PASSED |
#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
const int N = 2050;
ll a[N][N];
ll b[N];
int maxn;
int main()
{
int t; cin >> t;
while (t--)
{
int n; cin >> n;
for (int i = 1; i <= n; i++) cin >> a[0][i];
for (int i = 0; i <= n; i++)
{
int flag = 0;
... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | 30c4d0b216693248855db4e6e231c767 | 1,100 | PASSED |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | a6bd51f95c20df13235220a45e6bb9e1 | 1,100 | PASSED |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | 2af61b0911d9d4b728665eaeaa672c50 | 1,100 | PASSED |
#include<iostream>
using namespace std;
int n,f[2000][2010],log2[2001];
void citire(){
cin>>n; int i;
for(i=0;i<n;i++)
cin>>f[0][i];
}
void creeareLog2(){
int i;
log2[1]=0;
for(i=2;i<=2000;i++)
log2[i]=log2[i/2]+1;
}
void pas(int lin){
int i,cnt[2001];
for(i=1... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | 5f0148d0ffc1e1a29c953565f4f2f5e9 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define rep0(i,n) for(ll i=0;i<n;i++)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define for_range(l,h) for(int i=l;i<=h;i++)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/__gcd((a),(b))
#define deb_n(n) cout<<... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | 217f0858cfc707ddb99f3f8cfb1ca14f | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define rep0(i,n) for(ll i=0;i<n;i++)
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define for_range(l,h) for(int i=l;i<=h;i++)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/__gcd((a),(b))
#define deb_n(n) cout<<... | C++ | 43009fe44c2b5905c8160ac7ae9c595a | 554658fe296ec7b0ebc4f4d798dda793 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
int main()
{
FAST;
//mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
int T;
cin >> T;
int i, j, k;
for(i = 0; i < T; i++)
{
int... | C++ | 81f4bc9ac72ed39da8614131954d0d99 | 2628a38f1174a245beaae5600228b3f4 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD 1000000007
int main()
{
FAST;
//mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
int T;
cin >> T;
int i, j, k;
for(i = 0; i < T; i++)
{
int N;
cin >... | C++ | 81f4bc9ac72ed39da8614131954d0d99 | 1d1b734dd8ed20e854ab9a1c6d9ddb46 | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD 1000000007
int main()
{
FAST;
//mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
int T;
cin >> T;
int i, j, k;
for(i = 0; i < T; i++)
{
int N;
cin >... | C++ | 81f4bc9ac72ed39da8614131954d0d99 | 21b6b89e35ef9e609fe514ce6ec06c2d | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
int main()
{
FAST;
//mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
int T;
cin >> T;
int N, A;
int i, j, k;
for(i = 0; i < T; i++... | C++ | 81f4bc9ac72ed39da8614131954d0d99 | d6c90363d8ccaa6e80925f4c9cd3e3b3 | 1,300 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.