ivorynoise

#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-6
/*
Discuss this?
	e^-x	Decreasing						
	sin()	Increasing		
	cos()	Decreasing		
	tan()	Increasing
	x^2		Decreasing

ivorynoise

2
278 721
999

4
184 609 668 768
793

3
209 72 156

ivorynoise

GbAKfQMoTUzeoUAIcKBiqNdiSdZOReKaBRIJDDeFpPvENgAmUEifQTxQmcmvtAlxtmtobFiOEDbtcRIzsgGyeJcHQylOmiwYxfbnISwSNfLtbskpAlZhyTciDSioOlBizDVInqnIpjqkfgYkkxbBHFTQrjyORnnqpETFCyAhQBnUozjADQoAKPQEqXwOBNdMUICDKaRjLNAwSrxiJgbbDOIEgGXnMNjflIWAOYOuYfflBfxGAzaBpNeBKxDiMsDuqcuhFpGNBHxnfVjOMVWrbozBNLZyipoVYIxZkJOosqCALfxbvTMsfjlzbzfPVtZsHpESlhDExLHWyZNZGQYYOjoBVQoIGQcSGUvqberDTqLxIRFuusKaMeLRgnhOBCqUOCWNlNFdPgdPdnqHveqcnZYgTMlDXnzSINsdhbhWabOewzqrTbwuMmHytVfvUarmzwwAREZGdECNyHiblfssWiApRnWTnkyenttrhmrMzhZQDLqnFMtP
50
bZxGsxtYAOsZfwMrkvc
vFaQtmponNZRWonLycMxRXtYzGZti
XqzLVvzAdgosVIaX
qqXvMeAySEcJ
DuyTCFPeQraVlOUJ
dHaSyKrbTWBnzjesQZTNfCaqLxWa
ljZpSXvRvw
StBcnPVubhwgOLBl

ivorynoise

0 Fuel consumption 10
100 Goal
0 Fuel consumption 5
100 Fuel consumption 30
200 Goal
0 Fuel consumption 20
10 Leak
25 Leak
25 Fuel consumption 30
50 Gas station

ivorynoise

100
13 16
8 6
1 2
7 3
13 9
1 11
1 6
11 3
2 4

ivorynoise

#include <bits/stdc++.h>
using namespace std;
int arr1[100] = {0}, arr2[100] = {0}, res[100];

void print(int arr[], int sz){
	int i = -1;
	while (arr[++i] == 0);
	while (i < sz) cout << arr[i++];
	cout << endl;
}

ivorynoise

import java.util.*;
class balParant{
	public static void main(String[] args){
		Scanner s = new Scanner(System.in);
		String str = s.nextLine();
		System.out.println(check(str));
	}

	public static boolean check(String s){
		char[] exp = s.toCharArray();

ivorynoise

import java.util.*;

class wordsRev{
	public static void main(String[] args){
		Scanner s = new Scanner(System.in);
		String inp = s.nextLine();
		String rev = wordsReverse(inp);
		System.out.println(rev);
	}

ivorynoise

import java.util.*;
class largestSubarray{
	public static void main(String[] args){
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int sum = s.nextInt();

		int num[] = new int[n];
		for (int i = 0; i < n; ++i)
			num[i] = s.nextInt();

ivorynoise

#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;

// int rev(string &s){
// 	int be = 0;
// 	int en = s.size();
// 	int sp = 0;
// 	while(sp != string::npos && be < en){
// 		sp = find()