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>
#define rep(i,a,n) for(int i=int (a);i<int (n);i++)
#define OUT freopen("output.txt", "w", stdout)
#define IN freopen("input.txt", "r", stdin)
#define mem(a,b) memset((a),(b),sizeof(a))
#define NumofDigits(n) ((int)log10(n)+1)
#define NumofBits(n) ((int)log2(n)+1)
#define PI 3.141592653589793... | C++ | daabf732540e0f66d009dc211c2d7b0b | 08cd1c1ef44cb18c8d72f4eb9ffad1d0 | 1,500 | PASSED |
//BIRDS SET FREE
#include<bits/stdc++.h>
using namespace std; //31 July 1999
#pragma GCC optimize("O3")
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define repA(i, a, n) for(ll i = a; i <= (n); ++i)
#define repD(i, a, n)... | C++ | daabf732540e0f66d009dc211c2d7b0b | 546a81a252b6666e69c8433ae2d3be7f | 1,500 | PASSED |
/*****************************************************************************/
#define JaiShreeRam
/****************************************************************************/
/*
/********************************* आत्मनिर्भर *****************************/
/*
TO NIGHT
--------------------------
BY - Percy Bysshe ... | C++ | daabf732540e0f66d009dc211c2d7b0b | 9e3eba10d3c01dfbcdb1268de55b8683 | 1,500 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define infinity 1000000000000000000
using namespace std;
ll power(ll x, ll y)
{
ll res=1;
while(y>0)
{
if(y%2==1)
res=(res*x);
x=(x*x);
y=y/2;
}
return res;
}
// bool sortbys... | C++ | daabf732540e0f66d009dc211c2d7b0b | 58388195aed9494b7c02ace28f423ef4 | 1,500 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using _TYPE = int;
... | C++ | daabf732540e0f66d009dc211c2d7b0b | 2acb472c4fdfcaa94e2c8b97af7f02fa | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n , a , x , arr[(int)1e6] ;
long long cnt ;
int main(){
scanf("%d%d",&n,&a);
while( n-- && scanf("%d",&x) ){
cnt += arr[(int)(x^a)] ;
++arr[x] ;
}
printf("%I64d\n",cnt);
return 0 ;
} | C++ | daabf732540e0f66d009dc211c2d7b0b | 6374d13a8eb77eac8296a9e8694f5902 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n , a , x , arr[100005] ;
long long cnt ;
int main(){
scanf("%d%d",&n,&a);
while( n-- && scanf("%d",&x) ){
if((int)(x^a)<100005) cnt += arr[(int)(x^a)] ;
++arr[x] ;
}
printf("%I64d\n",cnt);
return 0 ;
} | C++ | daabf732540e0f66d009dc211c2d7b0b | b13f781610d27fb9ca4e9f4cdc3ce3b7 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define loop(i,n) for(int i = 0;i < (n);i++)
#define range(i,a,b) for(int i = (a);i <= (b);i++)
#define all(A) A.begin(),A.end()
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define sz(A) ((int)A.size())
#define vi vector<int>
#define vl vector<long long>
#define vd vector<dou... | C++ | daabf732540e0f66d009dc211c2d7b0b | f608d6ea147275ed253c4749633cd4d6 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define loop(i,n) for(int i = 0;i < (n);i++)
#define range(i,a,b) for(int i = (a);i <= (b);i++)
#define all(A) A.begin(),A.end()
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define sz(A) ((int)A.size())
#define vi vector<int>
#define vl vector<long long>
#define vd vector<dou... | C++ | daabf732540e0f66d009dc211c2d7b0b | 07c020872e22837c62a9be2e0d753b74 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define pii pair<int,int>
#define ppi pair<pair<int,int>,int>
#define sorta(a) sort(a.begin(),a.end());
#define rsorta(a) sort(a.rbegin(),a.rend());
#define sorta2(a,n) sort(a,a+n);
#define p(a) for(int i=0;i<a.size();i++)cout<<a[i]<<" ";cout<<"\n";
#define p2(a,n) for(int i=0;i<n;i++)cout<<a... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | 89784807fe96b8dfbe0bd7a965735de1 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define pii pair<int,int>
#define ppi pair<pair<int,int>,int>
#define sorta(a) sort(a.begin(),a.end());
#define rsorta(a) sort(a.rbegin(),a.rend());
#define sorta2(a,n) sort(a,a+n);
#define p(a) for(int i=0;i<a.size();i++)cout<<a[i]<<" ";cout<<"\n";
#define p2(a,n) for(int i=0;i<n;i++)cout<<a... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | 25a1e971de8e30996be9f5bfc3f58732 | 1,200 | PASSED |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <bitset>
#include <random>
#include <chrono>
#include <complex>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <cstring>
#include <cass... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | b3dd8582f998dbe215bfa0a9145dca33 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
ll a[n];
for(ll i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
ll ans[n];
ll cnt=1;
f... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | 7c90a6f39194522488edfecfc5519992 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//#define readfile
#define ll long long
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
#ifdef readfile
freopen("in.txt","r",stdin);
#endif
int t;
cin>>t;
for(int i=0;i<t;i++){
int l;
cin>>l;
vector<ll> inp;... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | 820c3402aaf09b77506c8903bb947a2c | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t,i;
cin>>t;
while(t--)
{
int n;
cin>>n;
long int arr[n];
for(i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
int k;
for(k=(i-1)/2,i=0;i<n;i++)
{
if(i&1)
cout<<arr[k+(i+1)/2]<<... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | 26a6b837b73f32d7e07aaea274d95c20 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define U long long int
#define fr(a,b) for(U i=a;i<b;i++)
#define frj(a,b) for(U j=a;j<b;j++)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define pp pop_back
#define tt U t;cin>>t;while(t--)
#define nnn cout<<"\n"
#define sr... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | 9ee43488cf2ad340bec0acf18e20bdc8 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC push_options
#pragma GCC optimize ("unroll-loops")
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define watch2(x,y) cout <<(#x)<<" is "<<(x)<<" and "<<(#y)<<" is "<<(y)<<"\n"
#define pow2(x) ((x)*(x))
#define ll long long
#define ld long double
#def... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | deee846fab54387b121b7d08d9de8ee7 | 1,200 | PASSED |
/****************************
Author: Siddharth Kumar Yadav
*****************************/
#include <bits/stdc++.h>
#define ll long long int
#define f(i, a, b) for (int i = a; i < b; i++)
#define vi vector<int>
#define pb push_back
#define us unsigned long long int
#define endl '\n'
#define mod 998244353
#define mp mak... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | 0f6c990f7a069941b56094205ee3eb4a | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll T,N;
cin>>T;
while(T--){
cin>>N;
ll A[N];
for(ll i=0;i<N;i++)
cin>>A[i];
sort(A,A+N);
ll median;
if(N%2==0)median=N/2;
else median=(ll(N/2));
for(ll i=0;i<median;i++){
cout<<A[median+i]<<" "<<A[median-i... | C++ | 3c8bfd3199a9435cfbdee1daaacbd1b3 | 7458d2a07451ddc1d9aa701eca1a406f | 1,200 | PASSED |
/**
* Mx NINJA
* 01:50:13 ص
* 21/12/2013
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Stack;
public class Main {
public static void main(String[] args)throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(... | Java | 26f1b8c3cb83603c904e1508df4067f4 | 31cccdffd9b92bb1975a1d998a67cdde | 1,400 | PASSED |
import java.util.Deque;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author nik
*/
public class Plugin {
public static void main(String[] args) {
Scanner sc... | Java | 26f1b8c3cb83603c904e1508df4067f4 | 444c78326dc2c4f6ae82b6168e82be9d | 1,400 | PASSED |
import java.util.Deque;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Scanner;
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author nik
*/
public class Plugin {
public static void main(String[] args) {
Scanner sc... | Java | 26f1b8c3cb83603c904e1508df4067f4 | ee56723880c07ec8670cff9747e737e8 | 1,400 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
char[] a = r.readLine().toCharArray();
char[] b = new char[a.le... | Java | 26f1b8c3cb83603c904e1508df4067f4 | 0167c72a406e1fd733742e037b8b90d9 | 1,400 | PASSED |
import java.util.*;
public class Temp {
public static void main(String args[]){
Scanner in = new Scanner(System.in);
String s = in.nextLine();
Stack<Character> st = new Stack<Character>();
boolean del = true;
while (del){
del = false;
st.clear();
... | Java | 26f1b8c3cb83603c904e1508df4067f4 | 77d235b914537e3e412469fd2871d3fa | 1,400 | PASSED |
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Stack;
public class P81A {
public static void main (String[] args){
Scanner scan = new Scanner(System.in);
String str = scan.next();
Stack<Integer> stack = new Stack<Integer>();
for(int j = 0, i = 0; i < str.len... | Java | 26f1b8c3cb83603c904e1508df4067f4 | eecbe5ba5fe1c3f423859d78b6af76d3 | 1,400 | 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 P1 implements Runnable {
private void solve() throws IOException {
String s = nextToken();
StringBuilder... | Java | 26f1b8c3cb83603c904e1508df4067f4 | 27a34dc6c5ff9496e5c223ea3a1d640c | 1,400 | PASSED |
import java.util.Scanner;
public class A_Plugin {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String line = sc.nextLine();
char[] cs = line.toCharArray();
char[] out = new char[cs.length];
int tos = 0;
fo... | Java | 26f1b8c3cb83603c904e1508df4067f4 | e9d483315833337d07f9746d93d50e6b | 1,400 | PASSED |
import java.util.LinkedList;
import java.util.ListIterator;
import java.util.Scanner;
public class Plagin
{
public static void main(String[] s)
{
Scanner in = new Scanner(System.in);
String data = in.next();
char [] result = data.toCharArray();
LinkedList<Character>list = new Li... | Java | 26f1b8c3cb83603c904e1508df4067f4 | cd9951b0596353c721ab33a59fb4c079 | 1,400 | PASSED |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.security.AccessControlException;
import java.util.Iterator;
import java.util.LinkedList;
import ja... | Java | 26f1b8c3cb83603c904e1508df4067f4 | 413e1445284e7e4a7d732372f1006064 | 1,400 | PASSED |
/****** BISMILLAH HIR RAHMANIR RAHIM ******/
/*
"For indeed, with hardship [will be] ease. Indeed, with hardship [will be] ease."
-- Surah Inshirah (94:5-6)
And We will surely test you with something of fear and hunger and a loss of wealth and lives and fruits, but give good tidings to the patient,
Who, when disas... | C++ | 250c0e647d0f2ff6d86db01675192c9f | 28c5e86309178d28d995f125c58e1a4a | 1,800 | PASSED |
//In the name of Allah
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const int MAXN=100*100*10*3+10;
vector<int >a[MAXN];
int parent[MAXN];
bool mark[MAXN];
int fe[MAXN],dl;
void dfs(int v,int par,int k){
mark[v]=true;
//cerr<<v<<endl;
int cnt=0;
parent [v]=par;
fe[... | C++ | 250c0e647d0f2ff6d86db01675192c9f | 316eaf0b1f759e4241f7023fb76fd886 | 1,800 | PASSED |
//In the name of Allah
#include <bits/stdC++.h>
using namespace std;
const int N=(1e+5)+10;
#define PB push_back
vector<int> a[N];
bool mark[N]={false};
int p[N]={0};
int r[N]={0};
vector<int> C;
bool check[N]={false},flag=false;
int n,m,k;
void dfs2(int v,int h){
//cout<<v<<"\n";
C.PB(v);
if(check[v])
... | C++ | 250c0e647d0f2ff6d86db01675192c9f | d4c320e9750ac2c92709fabc2fba8a68 | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
list<int>adjlist[100005];
bool visited[100005]={0};
int level[100005];
int k,f=0;
void dfs(int s)
{
visited[s]=1;
list<int>::iterator it;
for(it=adjlist[s].begin();it!=adjlist[s].end();it++)
{
if(visited[*it])
{
if(level[s]-level[*... | C++ | 250c0e647d0f2ff6d86db01675192c9f | 07fbd84ec983964640fc9dd0b1697893 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n,m,k,u,v;
vector<vector<int> > adj;
bool vis[110000];
int instak[110000];
vector<int>stk;
void solve(int node,int par=-1){
if(instak[node] > 0){
vector<int>ans;
ans.push_back(node);
while(stk.size() && stk.back()!=node){
ans.push_back(stk.back());
stk.po... | C++ | 250c0e647d0f2ff6d86db01675192c9f | 509d582b6e78ee0dddb9da7548af13af | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int n,m,k,u,v;
vector<vector<int> > adj;
bool vis[110000];
int instak[110000];
vector<int>stk;
void solve(int node,int par=-1){
if(instak[node] > 0){
vector<int>ans;
ans.push_back(node);
while(stk.size() && stk.back()!=node){
ans.push_back(stk.back());
stk.po... | C++ | 250c0e647d0f2ff6d86db01675192c9f | a1d36eaa777f2baac347e9f3ca0b2c87 | 1,800 | PASSED |
//Be Name Khoda
//tan man gar tanhast dele man ba delhast.
//doostani daram behtar az barge derakht
//ke doayam guyand va doashan guyam.
#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;
template <typename T... | C++ | 250c0e647d0f2ff6d86db01675192c9f | a692803fbe754fca524a626596891552 | 1,800 | PASSED |
/*
*************************
Id : Matrix.code
Task:
Date:
**************************
*/
#include <bits/stdc++.h>
using namespace std;
/*------- Constants---- */
#define Long long long
#define ull unsigned long long
#define mod 1000000007
#define... | C++ | 250c0e647d0f2ff6d86db01675192c9f | 51cd527131bf6986d06a4c9135eb6f4d | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxm = 3*1e5+7;
vector<int>graph[maxm];
bool visited[maxm];
int k;
vector<int> res;
void dfs(int curr,int depth,int chk)
{
visited[curr] = true;
res.push_back(curr);
for(auto i : graph[curr])
{
if(i == chk and res.size() > k)
{
... | C++ | 250c0e647d0f2ff6d86db01675192c9f | 2efc82ecd2142bb71a434a8c03cc98fe | 1,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fo(i,b,n) for(int i=(b); i<(n) ; i++)
#define xx first
#define yy second
#define pb push_back
#define sz(n) int(n.size())
#define pii pair
#define MP make_pair
#define tp tuple
#define MT make_tuple
#define gt(x,y) get<x>(y)
#define read... | C++ | 250c0e647d0f2ff6d86db01675192c9f | 54bd9ee4c791736b6032b7dbc6089df8 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000050, base = 3;
int ans, deg[maxn];
char buffer[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> buffer;
int len = strlen(buffer), a = 0, b = 0, p = 1;
for (int i = 0; i < len; ++i) {
a = a * base + buffe... | C++ | 0090979443c294ef6aed7cd09201c9ef | dcdc33ac6ac6abb19bf9a6fe1af07e88 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000050, base = 5;
int ans, deg[maxn];
char buffer[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> buffer;
int len = strlen(buffer), a = 0, b = 0, p = 1;
for (int i = 0; i < len; ++i) {
a = a * base + buffe... | C++ | 0090979443c294ef6aed7cd09201c9ef | 437ef2d7f4c278cbb7c14f1658913ea6 | 2,200 | PASSED |
//In the name of ALLAH
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
int const N = 1e7 + 20, base = 1e6 + 3, mod = 1e9 + 7;
ll val[N], c1, c2, p = 1, ans;
string s;
int main(){
ios::sync_with_stdio(false); cin.tie... | C++ | 0090979443c294ef6aed7cd09201c9ef | bcdb39d6fbc094fb5e416560a0d346f6 | 2,200 | PASSED |
//In the name of ALLAH
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
int const N = 5e6 + 20, base = 701, mod = 1e9 + 9;
ll dp[N], n, ans, x, y, z;
ll hsh[N], hsh2[N], p[N];
string s;
int main () {
ios::sync_with_s... | C++ | 0090979443c294ef6aed7cd09201c9ef | a739b7720aa76efe506774bc73006385 | 2,200 | PASSED |
#include <cstdio>
#include <iostream>
#include <cmath>
using namespace std;
typedef long long LL;
const int MAXN = 5*1e6 + 10;
const LL BASE = 127;
const LL MOD = 635000027;
char str[MAXN];
LL hsh;
int pre = 1;
LL revBase = 1;
LL revhsh;
LL dp[MAXN];
int main(int argc, char **argv)
{
// freopen("7D.in", "r", stdin)... | C++ | 0090979443c294ef6aed7cd09201c9ef | 155730eccbc041658a7d541eebda17bf | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
char temp[(int)1e7 + 5];
char str[(int)1e7 + 5];
int p[(int)1e7 + 5];
int du[(int)1e7 + 5];
int ans = 0;
void init(){
int len = strlen(temp);
for(int i = 1; i <= len * 2 + 1; i++)
str[i] = '#';
str[0] = '&';
for(int i = 2; i <= len * 2 + 1; i += 2)
str[i] = temp[i... | C++ | 0090979443c294ef6aed7cd09201c9ef | 3ad4d38669f826ff054399d5d942c64d | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
char temp[(int)1e7 + 5];
char str[(int)1e7 + 5];
int p[(int)1e7 + 5];
int du[(int)1e7 + 5];
int ans = 0;
void init(){
int len = strlen(temp);
for(int i = 1; i <= len * 2 + 1; i++)
str[i] = '#';
str[0] = '&';
for(int i = 2; i <= len * 2 + 1; i += 2)
str[i] = temp[i... | C++ | 0090979443c294ef6aed7cd09201c9ef | 36ef5d199aad84438f74d8c19ece7134 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
char a[5000010],s[10000010];
int f[10000010];
int n;
void change() {
s[0]=s[1]='#';
for (int i=0;i<n;i++) s[(i<<1)+2]=a[i],s[(i<<1)+3]='#';
n=n*2+2; s[n]='\0';
}
void manacher() {
int MaxRight=0,mid;
for (int i=1;i<n;i++) {
if (i<MaxRight) f[i]=m... | C++ | 0090979443c294ef6aed7cd09201c9ef | a5253bf284b925bdc4695b4a76371843 | 2,200 | PASSED |
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
const int N=5e6+7,b=131;
char str[N];
int n;ll ans=1,k[N];
ull p[N]={0},s[N]={0},B[N]={0};
inline bool isPal(int i,int j){int ie=(i+j-1)>>1;int jb=i+j-ie;return p[... | C++ | 0090979443c294ef6aed7cd09201c9ef | 3bed69d7d634ad65b1b4dbbd7a85a6f8 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=5000010;
const unsigned long long m1=31,m2=23;
char s[N];int len;unsigned long long h,fh,sh,fsh,mi=1,mi2=1,b,a[N],sum;
int main()
{
scanf("%s",s);
a[0]=1;sum=1;
h=fh=sh=fsh=s[0]-'0';
len=strlen(s);
for(int i=1;i<len;i++)
{
b=s[i]-'0';
mi*=m1;mi2*=m2;
... | C++ | 0090979443c294ef6aed7cd09201c9ef | 7fe068629136d50443e1ed7f28c55cae | 2,200 | PASSED |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
public class C {
static int n, nums[];
static boolean valid(int pos) {
if (pos > n)
return true;
if (pos % 2 == 0) {
if (pos < n && nums[pos] <= nums[pos + 1])
return false;
if (pos > 1 && nums[pos - 1] >= nu... | Java | e5b0e43beaca9baf428afec6ce454c50 | 0be05bbc47fc14768a007c495712c77a | 1,900 | PASSED |
import java.io.*;
import java.util.*;
public class Copy_4_of_CF {
FastScanner in;
PrintWriter out;
class O implements Comparable<O> {
int x, y;
public O(int x, int y) {
super();
this.x = Math.min(x, y);
this.y = Math.max(x, y);
}
@Override
public int compareTo(O o) {
if (x != o.x) {
ret... | Java | e5b0e43beaca9baf428afec6ce454c50 | ca7a5467d4c4e8cfd92f93a74853c511 | 1,900 | PASSED |
/*
* Code Author: Akshay Miterani
* DA-IICT
*/
import java.io.*;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static double eps=(double)1e-6;
static long mod=(int)1e9+7;
public ... | Java | e5b0e43beaca9baf428afec6ce454c50 | efaf16645c8e9c5ac7d2e8b413345686 | 1,900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class BearAndUpDown {
private static class Pair implements Comparable<Pair>... | Java | e5b0e43beaca9baf428afec6ce454c50 | c309768105dfbcf6adf36596eb5aff83 | 1,900 | PASSED |
import java.io.*;
import java.util.*;
import java.util.stream.*;
import java.util.function.*;
import static java.lang.StrictMath.*;
import static java.util.stream.Collectors.*;
public class TaskC {
private static final String INPUT_FILE = "input.txt";
private static final String ONLINE_JUDGE = "ONLINE_J... | Java | e5b0e43beaca9baf428afec6ce454c50 | be9530d8c5d8b67b1f67ea45b2a42cb1 | 1,900 | PASSED |
import java.util.*;
import java.io.*;
public class TaskC {
private FastScanner in;
private PrintWriter out;
public void solve() throws IOException {
int n = in.nextInt();
int[] t = new int[n];
List<Integer> bad = new ArrayList<>();
Set<Integer> badSet = new TreeSet<>();
... | Java | e5b0e43beaca9baf428afec6ce454c50 | 7a38f3752220e4175eaad044ad386629 | 1,900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Iterator;
import java.util.StringTokenizer;
public class BearandUpDown {
static HashSet<Integer> set;
static int n;
static int vals[];
static boolean... | Java | e5b0e43beaca9baf428afec6ce454c50 | 89eb63aebae31647744ab5d40f764e28 | 1,900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Iterator;
import java.util.StringTokenizer;
public class BearandUpDown {
static HashSet<Integer> set2;
static int n;
static int vals[];
static boolea... | Java | e5b0e43beaca9baf428afec6ce454c50 | 917929b3efd287d8d0ba4a0f00e5ecc8 | 1,900 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Iterator;
import java.util.StringTokenizer;
public class BearandUpDown {
static HashSet<Integer> set2;
static int n;
static int vals[];
static boolea... | Java | e5b0e43beaca9baf428afec6ce454c50 | 9e81a11eed9465decaaa682a4920472b | 1,900 | PASSED |
import java.io.*;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class TaskC {
StringTokenizer st;
BufferedReader in;
PrintWriter out;
public static void main(String[] args) throws IOException {
TaskC taskC = new TaskC();
... | Java | e5b0e43beaca9baf428afec6ce454c50 | 30142a01012c75069aa6b35558bcef48 | 1,900 | PASSED |
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<stack>
#include<functional>
#include<cstring>
#include<cstdio>
#include<cmath>
#define ll long long
using namespace std;
void f1(char *s1){
if(s1[0]=='?') s1[0]='1';
for(int i=1;i<strlen(s1);i++){
if(s1[i]=='?') s1[i]='0';
... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | 62d07bc3237d6ea203f406a8f7528d0d | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
char s[maxn][10];
int len[maxn];
int n;
bool gao(char *s1, char* s2){
int l=strlen(s1);
if(!l) return false;
if(s2[0]=='?'){
char tmp[10];
strcpy(tmp,s2+1);
if(gao(s1+1,tmp)){
strcpy(s2+1,tmp);
... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | e73bfe731c8e852cbe02a53ba046903e | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+1;
string s[maxn];
int a[maxn];
int n;
int Max(string &a){
int n=a.size();
int ret=0;
for(int i=0; i<n; ++i){
ret=ret*10;
if(a[i]=='?') ret+=9;
else ret+=a[i]-'0';
}
return ret;
}
int cal(string &x, int v){... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | f8aa99261b1d26f2314aa9751a158ea5 | 2,000 | PASSED |
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 100005;
char s[maxn][10];
int len[maxn];
bool can(char *s1, char *s2){
int len=strlen(s1);
if(len==1){
if(s2[0]=='?'){
if(s1[0]=='9'){
s2[0]='0';
return false;
... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | 4ecc99764bf2520037679aa2bb804d5d | 2,000 | PASSED |
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 100005;
char s[maxn][10];
int len[maxn];
bool can(char *s1, char *s2){
int len=strlen(s1);
if(len==1){
if(s2[0]=='?'){
if(s1[0]=='9'){
s2[0]='0';
return false;
... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | 5b0649e8b637243a104c1f27a74ed263 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+1;
string s[maxn];
int n;
int Max(string &a){
int n=a.size();
int ret=0;
for(int i=0; i<n; ++i){
ret=ret*10;
if(a[i]=='?') ret+=9;
else ret+=a[i]-'0';
}
return ret;
}
bool gao(string &x, string y){
if(x... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | c90d24ef27752535a5f8f5bde7fea3be | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
char s[maxn][10];
int len[maxn];
int n;
bool gao(char *s1, char* s2){
int l=strlen(s1);
if(!l) return false;
if(s2[0]=='?'){
char tmp[10];
strcpy(tmp,s2+1);
if(gao(s1+1,tmp)){
strcpy(s2+1,tmp);
... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | 7214bff80202f61d068d43cfd7f54989 | 2,000 | PASSED |
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 100005;
char s[maxn][10];
int len[maxn];
int b=0;
bool can(char *s1, char *s2){
int len=strlen(s1);
if(len==1){
if(s2[0]=='?'){
if(s1[0]=='9'){
s2[0]='0';
return fa... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | 512cfb2daeb4d9a27a7e968a867dc1e4 | 2,000 | PASSED |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;
#define maxn 100010
string ans[maxn];
bool check(string &pre,string &now)
{
//cout<<pre<<" "<<now<<endl;
int l1=pre.size(),l2=now.size();
if(l1>l2)
return false;
if(l1<l2)
{
... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | da42d5b5c8ddb9d37822a63ce59b7f36 | 2,000 | PASSED |
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
const int N = 100010, D = 15;
int n, l[N];
char s[N][D];
void iz()
{
printf("NO\n");
exit(0);
}
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%s", s[i] + 1);
l[i] = strlen(s[i] + 1)... | C++ | 7e0ba313c557cb6b61ba57559e73a2bb | 8ecd8f3efcbd2f009085f9f64fe0570c | 2,000 | PASSED |
#include <iostream>
using namespace std;
long long i,j,n,k,a[100001],b[100001],ans;
int main()
{
cin >> n;
for(i=0;i<n;i++)cin >> a[i] >> b[i];
for(i=0;i<n;i++)
{
if(a[i]<=b[i])ans++;
}
if(ans>=n)cout << "Poor Alex" << endl;
else cout << "Happy Alex" << endl;
return 0;
}
| C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | 1f941a302f7d01611b52672f684a1337 | 1,100 | PASSED |
#include <iostream>
using namespace std;
long long n,i,a[1000001],b[1000001],k;
int main()
{
cin >> n;
for(i=0;i<n;i++)
{
cin >> a[i] >> b[i];
if(a[i]==b[i])k++;
}
if(k>=n)cout << "Poor Alex" << endl;
else cout << "Happy Alex" << endl;
return 0;
}
| C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | d686a7e3ef320b4e0df88b4293f74672 | 1,100 | PASSED |
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <math.h>
#include <string>
#include <ctype.h>
#include <algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
int n;cin>>n;
for (int i = 0; i ... | C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | 97a04eca865a4cc44e0885160ffcdac0 | 1,100 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;cin>>n;
vector<pair<int, int>> vc;
int maxi=-99999;
for (int i = 0; i < n; ++i) {
int x,y; cin>>x>>y;
vc.emplace_back(x,y);
if (y>maxi)
maxi=y;
}
sort(vc.begin... | C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | 5ffeaaa8212d10d172cc8d3ee87bd271 | 1,100 | PASSED |
#include <iostream>
using namespace std;
int n, a, b;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a != b) {
cout << "Happy Alex";
return 0;
}
}
cout << "Poor Alex";
} | C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | 8488ed1420eb560a3335847391ceab8f | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,flg = 0,i, a, b;
cin >> n;
for( i = 0; i<n; i++){
cin >> a >> b;
if(a!=b){
flg = 1;
//return 0;
}
}
if(flg==1){
cout<< "Happy Alex" << endl;
}
else{
cout<<"Poor Alex"<<endl;
... | C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | c24c0d5453b78f8da824e6d86adc4443 | 1,100 | PASSED |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define endl "\n"
#define space " "
#define ll long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define RREP(i,b,a) for(ll i=b;i>=a;i--)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define fast ios_base::sync_with_stdio(... | C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | 7d1cc84e1cd8eae15305e46ba14307d2 | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return(a.first<b.first);
// else if(a.first==b.first)
// return(a.second>b.second);
// else
// return false;
}
int main() {
ll n;
cin>>n;
pair<ll,ll> a[1... | C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | 1e603f96a7f0269cf5ab162314f0a81f | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,z;
cin>>x;
for (int i=1;i<=x;i++)
{
cin>>y>>z;
if(y!=z)
{
cout<<"Happy Alex";
return 0;
}
}
cout<<"Poor Alex";
} | C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | e6b8d01221952c2953cf0cd5d0f29120 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,z;
cin>>x;
string m;
for (int i=1;i<=x;i++)
{
cin>>y>>z;
if(y!=z)
{
m="Happy Alex";
break;
}
else
{
m="Poor Alex";
continue;
}
}
cout<<m;
return 0;
} | C++ | c21a84c4523f7ef6cfa232cba8b6ee2e | 76ffe3ac5fd980c9d691ad7804edbf78 | 1,100 | PASSED |
import java.io.BufferedInputStream;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Objects;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class C {
public static void main(String[] args) throws... | Java | 206861107f0c06d3c8e358a85b9ddd7f | 4c4451eb58d0ffd568a23a2175eae3c5 | 1,600 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
public class C {
public static void main(String[] args) {
FastScanner scan = new FastScanner();
PrintWrit... | Java | 206861107f0c06d3c8e358a85b9ddd7f | 94e71471456bac5b9af9b819a8d896e1 | 1,600 | PASSED |
import java.math.*;
import java.util.*;
//import javafx.util.*;
import java.io.*;
public class Prg10 {
PrintWriter pw = new PrintWriter(System.out);
Random rnd = new Random();
int a;
void run() {
a = ni();
int b = ni();
int[][] m = new int[a][b], pstr = new int[a][b], pstl = n... | Java | 206861107f0c06d3c8e358a85b9ddd7f | 2f39145a9366a0fcf58d6deac315b157 | 1,600 | 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.
*/
//package Round545;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
/**
*
* @aut... | Java | 206861107f0c06d3c8e358a85b9ddd7f | 54a3b43a9d016fd9c23f1645f7eea951 | 1,600 | PASSED |
import java.io.*;
import java.util.*;
public class C {
public static void solution(BufferedReader reader, PrintWriter writer)
throws IOException {
In in = new In(reader);
Out out = new Out(writer);
int n = in.nextInt();
int m = in.nextInt();
int[][] grid = new in... | Java | 206861107f0c06d3c8e358a85b9ddd7f | 272807239061a25a89565921bbd67d2e | 1,600 | PASSED |
import java.io.*;
import java.util.*;
public class informatics {
public static void main(String[] args) throws IOException{
BufferedReader scan = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenize... | Java | 206861107f0c06d3c8e358a85b9ddd7f | c23e54a4c7f4b862a4ba6dbedfc9ef70 | 1,600 | PASSED |
import java.util.*;
import java.io.*;
public class C {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int N = scanner.nextInt();
int M = scanner.nextInt();
int[][] vals = new int[N][M];
... | Java | 206861107f0c06d3c8e358a85b9ddd7f | b562a3f66dcd69f2a7bc532ed619d4c9 | 1,600 | PASSED |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
public class Q3 {
public static void main(String[] args) {
InputReader s = new InputReader(System.in);
PrintWriter out = ... | Java | 206861107f0c06d3c8e358a85b9ddd7f | 4171afe3f37a983d132f2206781a69b2 | 1,600 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.Arrays;
import java.util.Iterator;
import java.util.Collection;
import java.util.Set;
import java.io.IOException;
import java.io.InputStreamReader;
import java.i... | Java | 206861107f0c06d3c8e358a85b9ddd7f | f427d7891b74f4db0ca890aa42a9b680 | 1,600 | PASSED |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.Arrays;
import java.util.Iterator;
import java.util.Collection;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.FileNotFoundExceptio... | Java | 206861107f0c06d3c8e358a85b9ddd7f | ff3faa5f9ecdf59b9e63e262ff39eac0 | 1,600 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pii;
const int N = 300010;
int a[N + 10];
map<int, int> m;
int main()
{
int n, ans = 10000;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int gg = 0;
for (int i = 1; i... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | ba30c66f7ba0cbd55e851bd92f1058db | 1,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pii;
const int N = 300010;
int a[N + 10];
map<int, int> m;
int main()
{
int n, ans = 10000;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), m[a[i]]++;
i... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | c74bf254260be95d48b5e703edfcad26 | 1,500 | PASSED |
//bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsig... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | b38c4db0ce23d9872edd3ff99bdc13b3 | 1,500 | PASSED |
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
#define pi acos(-1)
#include<string.h>
#define rep(i,n) for(i=0;i<n;i++)
#define pb push_back
using namespace std;
typedef long long int lli;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | 2129ca2b4715a8beb3df8d35b630d5a6 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define loop(a,b,c) for(int a=b;a<c;a++)
#define loopa(p,v) for(auto p:(v))
#define lloop(a,b,c) for(long long a=b;a<c;a++)
#define rloop(a,b,c) for(int a=c-1;a>=b;a--)
#define rlloop(a,b,c) for(long long a=c-1;a>=b;a--)
#define mem(ar,value) memset(ar,value,sizeof(a... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | bfdfdd799f89a78251b3fd60097176ca | 1,500 | PASSED |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pii pair<int,int>
#define ll long long int
#define sf(a) scanf("%d", &a)
#define forn(i,n) for(int i = 0; i < n; ++i)
const int mx = 1e6+5;
const int inf = 0x3f3f3f3f;
using namespace std;
int main(){
ios::sync_with_stdio(0);
c... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | 7f6c71c0970b4de6ebdc6a9c11ba90e3 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pii pair<int,int>
#define ll long long int
#define sf(a) scanf("%d", &a)
#define forn(i,n) for(int i = 0; i < n; ++i)
const int mx = 1e6+5;
const int inf = 0x3f3f3f3f;
using namespace std;
int main(){
ios::sync_with_stdio(0);
c... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | 9703beb0676afbb3d8d3695d18eb3041 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define bug(a) cerr << #a << " : " << a << endl;
#define FastRead ios_base::sync_with_stdio(false);cin.tie(NULL);
const int MAX = 2e3+10;
int a[MAX] , n;
map<int,int> mp;
bool vis[MAX];
int main()
... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | d13c3366dadccb943c491e6f65fae808 | 1,500 | PASSED |
/**
* Author : Coda
* Title : B
* Date : 2019-08-25
*/
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef double DB ;
const long long mod = 1e9+7 ;
const double pi = acos(-1) ;
#define PB push_back
#define MP make_pair
#define lb lower_bound
#define ub... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | 45e8e4792d46b0d81e11a1888c4355e4 | 1,500 | PASSED |
/**
* Author : Coda
* Title : B
* Date : 2019-08-25
*/
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef double DB ;
const long long mod = 1e9+7 ;
const double pi = acos(-1) ;
#define PB push_back
#define MP make_pair
#define lb lower_bound
#define ub... | C++ | 9873a576d00630fa6e5fd4448a1a65ad | 0abfe9f4ee2321fffb98bdc21ba3ce61 | 1,500 | PASSED |
#pragma comment(linker, "/STACK:36777216")
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
#include <assert.h>
#include <string>
#include <map>
#include <unordered_map>
#include <hash_map>
#include <vector>
#include <algorithm>
#include <functional>
#... | C++ | c9e9b82185481951911db3af72fd04e7 | b620e54fc46f740ac398dc5c0efd7abf | 1,500 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.