Instruction
stringlengths 261
35k
| Response
stringclasses 1
value |
|---|---|
For this Question: Given four integers a, b, c, and d. Find the value of a<sup>(b<sup>(c<sup>d</sup>)</sup>)</sup> modulo 1000000007.
(Fact: 0<sup>0</sup> = 1)The first and the only line of input contains 4 integers a, b, c, and d.
Constraints
1 <= a, b, c, d <= 12Output a single integer, the answer modulo 1000000007.Sample Input
2 2 2 2
Sample Output
65536
Explanation
2^(2^(2^2)) = 2^(2^4) = 2^16 = 65536.
Sample Input
0 7 11 1
Sample Output
0, I have written this Solution Code: nan, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given four integers a, b, c, and d. Find the value of a<sup>(b<sup>(c<sup>d</sup>)</sup>)</sup> modulo 1000000007.
(Fact: 0<sup>0</sup> = 1)The first and the only line of input contains 4 integers a, b, c, and d.
Constraints
1 <= a, b, c, d <= 12Output a single integer, the answer modulo 1000000007.Sample Input
2 2 2 2
Sample Output
65536
Explanation
2^(2^(2^2)) = 2^(2^4) = 2^16 = 65536.
Sample Input
0 7 11 1
Sample Output
0, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(ll i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;
const int N = 2e5+5;
// it's swapnil07 ;)
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif
int powmod(int a, int b, int c = MOD){
int ans = 1;
while(b){
if(b&1){
ans = (ans*a)%c;
}
a = (a*a)%c;
b >>= 1;
}
return ans;
}
void solve(){
int a, b, c, d; cin>>a>>b>>c>>d;
int x = pow(c, d);
int y = powmod(b, x, MOD-1);
int ans = powmod(a, y, MOD);
cout<<ans;
}
signed main()
{
fast
#ifdef SWAPNIL07
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
// cin>>t;
while(t--){
solve();
cout<<"\n";
}
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You need to make an order counter to keep track of the total number of orders received.
Complete the function <code> generateOrder() </code> which returns a <code>function func()</code>. This function <code>func</code> should maintain a <code> count (initially 0)</code>. Every time <code>func</code> is called, <code> count</code> must be incremented by 1 and the string <code>"Total orders = " + count</code> must be returned.
<b>Note:</b> The function generateOrder() will be called internally. You do not need to call it yourself. The generateOrder() takes no argument. It is called internally.The generateOrder() function returns a function that returns the string <code>"Total orders = " + count</code>, where <code>count</code> is the number of times the function is called.
const initC = generateOrder(starting);
console.log(initC()) //prints "Total orders = 1"
console.log(initC()) //prints "Total orders = 2"
console.log(initC()) //prints "Total orders = 3"
, I have written this Solution Code: let generateOrder = function() {
let prefix = "Total orders = ";
let count = 0;
let totalOrders = function(){
count++
return prefix + count;
}
return totalOrders;
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a Deque and Q queries. The task is to perform some operation on Deque according to the queries as described in input:
Note:-if deque is empty than pop operation will do nothing, and -1 will be printed as a front and rear element of queue if it is empty.User task:
Since this will be a functional problem, you don't have to take input. You just have to complete the functions:
<b>push_front_pf()</b>:- that takes the deque and the integer to be added as a parameter.
<b>push_bac_pb()</b>:- that takes the deque and the integer to be added as a parameter.
<b>pop_back_ppb()</b>:- that takes the deque as parameter.
<b>front_dq()</b>:- that takes the deque as parameter.
Constraints:
1 <= N(Number of queries) <= 10<sup>3</sup>
<b>Custom Input: </b>
First line of input should contain the number of queries Q. Next, Q lines should contain any of the given operations:-
For <b>push_front</b> use <b> pf x</b> where x is the element to be added
For <b>push_rear</b> use <b> pb x</b> where x is the element to be added
For <b>pop_back</b> use <b> pp_b</b>
For <b>Display Front</b> use <b>f</b>
Moreover driver code will print
Front element of deque in each push_front opertion
Last element of deque in each push_back operation
Size of deque in each pop_back operation The front_dq() function will return the element at front of your deque in a new line, if the deque is empty you just need to return -1 in the function.Sample Input:
6
push_front 2
push_front 3
push_rear 5
display_front
pop_rear
display_front
Sample Output:
3
3, I have written this Solution Code:
static void push_back_pb(Deque<Integer> dq, int x)
{
dq.add(x);
}
static void push_front_pf(Deque<Integer> dq, int x)
{
dq.addFirst(x);
}
static void pop_back_ppb(Deque<Integer> dq)
{
if(!dq.isEmpty())
dq.pollLast();
else return;
}
static int front_dq(Deque<Integer> dq)
{
if(!dq.isEmpty())
return dq.peek();
else return -1;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Implement the function <code>floor</code>, which should take a number which can be a float(decimal)
and return its result as an integer with floor function applied to it (Use JS In built functions)Function will take a float as inputFunction will return a numberconsole.log(floor(1.99)) // prints 1
console.log(floor(2.1)) // prints 2
console.log(floor(-0.8)) // prints -1, I have written this Solution Code: function floor(num){
// write code here
// return the output , do not use console.log here
return Math.floor(num)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Implement the function <code>floor</code>, which should take a number which can be a float(decimal)
and return its result as an integer with floor function applied to it (Use JS In built functions)Function will take a float as inputFunction will return a numberconsole.log(floor(1.99)) // prints 1
console.log(floor(2.1)) // prints 2
console.log(floor(-0.8)) // prints -1, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
float a = sc.nextFloat();
System.out.print((int)Math.floor(a));
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Emily was playing with triplets. She was excited to find out how many triples of non-negative integers (a, b, c) satisfy a+b+c≤S and a×b×c≤T, where S & T are non-negative integers.The input line contains S, and T separated by space.
<b>Constraints</b>
0≤S≤100
0≤T≤10000
S and T are integers.Print the number of triples of non-negative integers (a, b, c) satisfying the conditions.<b>Sample Input 1</b>
1 0
<b>Sample Output 1 </b>
4
<b>Sample Input 2</b>
2 5
<b>Sample Output 2 </b>
10
<b>Sample Input 3</b>
10 10
<b>Sample Output 3 </b>
213
(In example 1,the triplets are(0,0,0),(0,0,1),(0,1,0) and (1,0,0), I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
int main(){
int S, T; cin >> S >> T;
int cnt = 0;
for(int a = 0; a <= S; a++){
for(int b = 0; a+b <= S; b++){
for(int c = 0; a+b+c <= S; c++){
if(a*b*c <= T) cnt++;
}
}
}
cout << cnt << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer n holding some random value, your task is to assign value 10 to the given integer.User task:
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>Assignment_Operator()</b>, which takes no parameter.
<b>Constraints:</b>
1 <= n <= 100You don't need to print anything you just need to assign value 10 to the integer n.Sample Input:-
48
Sample output:-
10
Sample Input:-
24
Sample Output:-
10, I have written this Solution Code: static void Assignment_Operator(){
n=10;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an integer array arr. You can choose a set of integers and remove all the occurrences of these integers in the array, your task is to print the minimum size of the set so that at least half of the integers of the array are removed.The first line contains n the size of the array and the next line contains input of the array
<b>Constraints</b>
1 <= n<= 1e5 (n is even)
1 <= arr[i] <= 1e5Return the minimum set size Sample Input :
10
3 3 3 3 5 5 5 2 2 7
Sample Output :
2
Explanation :
Choosing {3, 7} will make the new array [5, 5, 5, 2, 2] which has size 5 (i. e equal to half of the size of the old array).
Possible sets of size 2 are {3, 5}, {3, 2}, {5, 2}.
Choosing set {2, 7} is not possible as it will make the new array [3, 3, 3, 3, 5, 5, 5] which has a size greater than half of the size of the old array.
Sample Input 1:
5
7 7 7 7 7
Sample Output 1:
1
Explanation :
The only possible set you can choose is {7}. This will make the new array empty., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine().trim());
int arr[] = new int[n];
String[] str = br.readLine().trim().split(" ");
for (int i = 0; i < n; i++) {
arr[i] = Integer.parseInt(str[i]);
}
HashMap<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < n; i++) {
map.put(arr[i], map.getOrDefault(arr[i], 0) + 1);
}
PriorityQueue<Integer> maxHeap = new PriorityQueue<>(Collections.reverseOrder());
for (Map.Entry entry : map.entrySet()) {
maxHeap.add((Integer) entry.getValue());
}
long ans = 0;
int h=n/2;
int c=0;
while(ans<h) {
ans += maxHeap.poll();
c++;
}
System.out.println(c);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an integer array arr. You can choose a set of integers and remove all the occurrences of these integers in the array, your task is to print the minimum size of the set so that at least half of the integers of the array are removed.The first line contains n the size of the array and the next line contains input of the array
<b>Constraints</b>
1 <= n<= 1e5 (n is even)
1 <= arr[i] <= 1e5Return the minimum set size Sample Input :
10
3 3 3 3 5 5 5 2 2 7
Sample Output :
2
Explanation :
Choosing {3, 7} will make the new array [5, 5, 5, 2, 2] which has size 5 (i. e equal to half of the size of the old array).
Possible sets of size 2 are {3, 5}, {3, 2}, {5, 2}.
Choosing set {2, 7} is not possible as it will make the new array [3, 3, 3, 3, 5, 5, 5] which has a size greater than half of the size of the old array.
Sample Input 1:
5
7 7 7 7 7
Sample Output 1:
1
Explanation :
The only possible set you can choose is {7}. This will make the new array empty., I have written this Solution Code: from collections import defaultdict
import numpy as np
n=int(input())
val=np.array([input().strip().split()],int).flatten()
d=defaultdict(int)
l=n
for i in val:
d[i]+=1
a=[]
for i in d:
a.append([d[i],i])
a.sort(reverse=True)
c=0
h=0
for i in a:
c+=1
h+=i[0]
if(h>(l//2-1)):
break
print(c), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an integer array arr. You can choose a set of integers and remove all the occurrences of these integers in the array, your task is to print the minimum size of the set so that at least half of the integers of the array are removed.The first line contains n the size of the array and the next line contains input of the array
<b>Constraints</b>
1 <= n<= 1e5 (n is even)
1 <= arr[i] <= 1e5Return the minimum set size Sample Input :
10
3 3 3 3 5 5 5 2 2 7
Sample Output :
2
Explanation :
Choosing {3, 7} will make the new array [5, 5, 5, 2, 2] which has size 5 (i. e equal to half of the size of the old array).
Possible sets of size 2 are {3, 5}, {3, 2}, {5, 2}.
Choosing set {2, 7} is not possible as it will make the new array [3, 3, 3, 3, 5, 5, 5] which has a size greater than half of the size of the old array.
Sample Input 1:
5
7 7 7 7 7
Sample Output 1:
1
Explanation :
The only possible set you can choose is {7}. This will make the new array empty., I have written this Solution Code: /**
* Author : tourist1256
* Time : 2022-01-12 19:43:00
**/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
int minSetSize(vector<int> &arr) {
unordered_map<int, int> counter;
priority_queue<int> q;
int res = 0, removed = 0;
for (auto a : arr) counter[a]++;
for (auto c : counter) q.push(c.second);
while (removed < arr.size() / 2) {
removed += q.top();
q.pop();
res++;
}
return res;
}
int main() {
#ifdef LOCAL
auto start = std::chrono::high_resolution_clock::now();
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (auto &it : a) {
cin >> it;
}
cout << minSetSize(a) << "\n";
#ifdef LOCAL
auto stop = std::chrono::high_resolution_clock::now();
auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>(stop - start);
cerr << "Time taken : " << ((long double)duration.count()) / ((long double)1e9) << "s " << endl;
#endif
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an integer N of at least 100. Print the last two digits of N. Strictly speaking, print the tens and one's digits of N in this order.The input consists of an integer.
N
<b>Constraints</b>
100≤N≤999
N is an integer.Print the answer.<b>Sample Input 1</b>
254
<b>Sample Output 1</b>
54
<b>Sample Input 2</b>
101
<b>Sample Output 2</b>
01, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
cout<<(n%100)/10<<n%10<<endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S consisting of characters 'A' or 'B' only, you need to find the maximum length of substring consisting of character 'A' only.The first and the only line of input contains the string S.
Constraints
1 <= |S| <= 100000
S consists of characters 'A' or 'B' only.Output a single integer, the answer to the problem.Sample Input
ABAAABBBAA
Sample Output
3
Explanation: Substring from character 3-5 is the longest consisting of As only.
Sample Input
AAAA
Sample Output
4, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String st = br.readLine();
int len = 0;
int c=0;
for(int i=0;i<st.length();i++){
if(st.charAt(i)=='A'){
c++;
len = Math.max(len,c);
}else{
c=0;
}
}
System.out.println(len);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S consisting of characters 'A' or 'B' only, you need to find the maximum length of substring consisting of character 'A' only.The first and the only line of input contains the string S.
Constraints
1 <= |S| <= 100000
S consists of characters 'A' or 'B' only.Output a single integer, the answer to the problem.Sample Input
ABAAABBBAA
Sample Output
3
Explanation: Substring from character 3-5 is the longest consisting of As only.
Sample Input
AAAA
Sample Output
4, I have written this Solution Code: S=input()
max=0
flag=0
for i in range(0,len(S)):
if(S[i]=='A' or S[i]=='B'):
if(S[i]=='A'):
flag+=1
if(flag>max):
max=flag
else:
flag=0
print(max), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S consisting of characters 'A' or 'B' only, you need to find the maximum length of substring consisting of character 'A' only.The first and the only line of input contains the string S.
Constraints
1 <= |S| <= 100000
S consists of characters 'A' or 'B' only.Output a single integer, the answer to the problem.Sample Input
ABAAABBBAA
Sample Output
3
Explanation: Substring from character 3-5 is the longest consisting of As only.
Sample Input
AAAA
Sample Output
4, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;
const int N = 2e5+5;
// it's swapnil07 ;)
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif
void solve(){
string s; cin>>s;
int ct = 0;
int ans = 0;
for(char c: s){
if(c == 'A')
ct++;
else
ct=0;
ans = max(ans, ct);
}
cout<<ans;
}
signed main()
{
fast
#ifdef SWAPNIL07
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
// cin>>t;
while(t--){
solve();
cout<<"\n";
}
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tono loves to do shopping. Today, she went to the market where there are N different types of products. She wants to buy exactly K of them at the minimum cost. Although she is super smart, she wants to check your smartness as well. Can you tell her the minimum cost required to buy exactly K products if she has already decided to buy product J?
<b>Note:</b> Tono does not buy the same product twice, and Tono will definitely buy product J (J is the <b>index</b> of the item).The first line of the input contains three integers, N, K, and J, denoting the number of products in the market, the number of products Tono needs to buy, and the product that Tono will definitely buy.
The next line contains N singly spaced integers, the cost of the N products C[1], C[2], ..., C[N].
<b>Constraints:</b>
1 <= N <= 200000
1 <= K <= N
1 <= J <= N
1 <= C[i] <= 1000
Output a single integer, the minimum amount Tono needs to pay.Sample Input 1:
5 3 4
1 2 3 4 5
Sample Output 1:
7
Sample Input 2:
5 1 3
2 4 3 1 1
Sample Output 2:
3
<b>Explanation:</b>
Tono needs to buy exactly 3 products, and she will definitely buy the 4th product. Thus, she will buy the 1st, 2nd, and the 4th product. The total cost she pays is 1+2+4=7.
, I have written this Solution Code: import java.util.*;
import java.io.*;
class Main {
public static void main(String[] args) throws IOException {
int n = io.nextInt(), k = io.nextInt(), j = io.nextInt() - 1;
int[] arr = new int[n];
for(int i = 0; i < n; i++) {
arr[i] = io.nextInt();
}
int cost = arr[j];
arr[j] = Integer.MAX_VALUE;
Arrays.sort(arr);
for(int i = 0; i < k - 1; i++) {
cost += arr[i];
}
io.println(cost);
io.close();
}
static IO io = new IO();
static class IO {
private byte[] buf;
private InputStream in;
private PrintWriter pw;
private int total, index;
public IO() {
buf = new byte[1024];
in = System.in;
pw = new PrintWriter(System.out);
}
public int next() throws IOException {
if(total < 0)
throw new InputMismatchException();
if(index >= total) {
index = 0;
total = in.read(buf);
if(total <= 0)
return -1;
}
return buf[index++];
}
public int nextInt() throws IOException {
int n = next(), integer = 0;
while(isWhiteSpace(n))
n = next();
int neg = 1;
if(n == '-') {
neg = -1;
n = next();
}
while(!isWhiteSpace(n)) {
if(n >= '0' && n <= '9') {
integer *= 10;
integer += n - '0';
n = next();
}
else
throw new InputMismatchException();
}
return neg * integer;
}
public int[] nextIntArray(int n) throws IOException {
int[] arr = new int[n];
for(int i = 0; i < n; i++)
arr[i] = nextInt();
return arr;
}
public long nextLong() throws IOException {
long integer = 0l;
int n = next();
while(isWhiteSpace(n))
n = next();
int neg = 1;
if(n == '-') {
neg = -1;
n = next();
}
while(!isWhiteSpace(n)) {
if(n >= '0' && n <= '9') {
integer *= 10;
integer += n - '0';
n = next();
}
else
throw new InputMismatchException();
}
return neg * integer;
}
public double nextDouble() throws IOException {
double doub = 0;
int n = next();
while(isWhiteSpace(n))
n = next();
int neg = 1;
if(n == '-') {
neg = -1;
n = next();
}
while(!isWhiteSpace(n) && n != '.') {
if(n >= '0' && n <= '9') {
doub *= 10;
doub += n - '0';
n = next();
}
else
throw new InputMismatchException();
}
if(n == '.') {
n = next();
double temp = 1;
while(!isWhiteSpace(n)) {
if(n >= '0' && n <= '9') {
temp /= 10;
doub += (n - '0') * temp;
n = next();
}
else
throw new InputMismatchException();
}
}
return doub * neg;
}
public String nextString() throws IOException {
StringBuilder sb = new StringBuilder();
int n = next();
while(isWhiteSpace(n))
n = next();
while(!isWhiteSpace(n)) {
sb.append((char)n);
n = next();
}
return sb.toString();
}
public String nextLine() throws IOException {
int n = next();
while(isWhiteSpace(n))
n = next();
StringBuilder sb = new StringBuilder();
while(!isEndOfLine(n)) {
sb.append((char)n);
n = next();
}
return sb.toString();
}
private boolean isWhiteSpace(int n) {
return n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1;
}
private boolean isEndOfLine(int n) {
return n == '\n' || n == '\r' || n == -1;
}
public void print(Object obj) {
pw.print(obj);
}
public void println(Object... obj) {
if(obj.length == 1)
pw.println(obj[0]);
else {
for(Object o: obj)
pw.print(o + " ");
pw.println();
}
}
public void flush() throws IOException {
pw.flush();
}
public void close() throws IOException {
pw.close();
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tono loves to do shopping. Today, she went to the market where there are N different types of products. She wants to buy exactly K of them at the minimum cost. Although she is super smart, she wants to check your smartness as well. Can you tell her the minimum cost required to buy exactly K products if she has already decided to buy product J?
<b>Note:</b> Tono does not buy the same product twice, and Tono will definitely buy product J (J is the <b>index</b> of the item).The first line of the input contains three integers, N, K, and J, denoting the number of products in the market, the number of products Tono needs to buy, and the product that Tono will definitely buy.
The next line contains N singly spaced integers, the cost of the N products C[1], C[2], ..., C[N].
<b>Constraints:</b>
1 <= N <= 200000
1 <= K <= N
1 <= J <= N
1 <= C[i] <= 1000
Output a single integer, the minimum amount Tono needs to pay.Sample Input 1:
5 3 4
1 2 3 4 5
Sample Output 1:
7
Sample Input 2:
5 1 3
2 4 3 1 1
Sample Output 2:
3
<b>Explanation:</b>
Tono needs to buy exactly 3 products, and she will definitely buy the 4th product. Thus, she will buy the 1st, 2nd, and the 4th product. The total cost she pays is 1+2+4=7.
, I have written this Solution Code:
a=input().split()
b=input().split()
for j in [a,b]:
for i in range(0,len(j)):
j[i]=int(j[i])
n,k,j=a[0],a[1],a[2]
c_j=b[j-1]
b.sort()
if b[k-1]<=c_j:
b[k-1]=c_j
sum=0
for i in range(0,k):
sum+=b[i]
print(sum), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tono loves to do shopping. Today, she went to the market where there are N different types of products. She wants to buy exactly K of them at the minimum cost. Although she is super smart, she wants to check your smartness as well. Can you tell her the minimum cost required to buy exactly K products if she has already decided to buy product J?
<b>Note:</b> Tono does not buy the same product twice, and Tono will definitely buy product J (J is the <b>index</b> of the item).The first line of the input contains three integers, N, K, and J, denoting the number of products in the market, the number of products Tono needs to buy, and the product that Tono will definitely buy.
The next line contains N singly spaced integers, the cost of the N products C[1], C[2], ..., C[N].
<b>Constraints:</b>
1 <= N <= 200000
1 <= K <= N
1 <= J <= N
1 <= C[i] <= 1000
Output a single integer, the minimum amount Tono needs to pay.Sample Input 1:
5 3 4
1 2 3 4 5
Sample Output 1:
7
Sample Input 2:
5 1 3
2 4 3 1 1
Sample Output 2:
3
<b>Explanation:</b>
Tono needs to buy exactly 3 products, and she will definitely buy the 4th product. Thus, she will buy the 1st, 2nd, and the 4th product. The total cost she pays is 1+2+4=7.
, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;
const int N = 2e5+5;
// it's swapnil07 ;)
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif
void solve(){
int n, k, j; cin>>n>>k>>j;
vector<int> vect;
int ans = 0;
For(i, 1, n+1){
int a; cin>>a;
if(i!=j)
vect.pb(a);
else
ans += a;
}
sort(all(vect));
for(int i=0; i<k-1; i++){
ans += vect[i];
}
cout<<ans;
}
signed main()
{
fast
#ifdef SWAPNIL07
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
// cin>>t;
while(t--){
solve();
cout<<"\n";
}
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alita has two a sequence of numbers x1, x2,…..xn. She has to go fight a battle with these sequence of numbers. But these numbers are not correct for the battle. She has to convert these numbers to another sequence of numbers y1, y2,…….yn. Alita is busy preparing for the battle so she needs your help.
There is only two type of moves you can perform on any xi (where 1<=i<=n) only.
You have to make initial sequence (x1, x2…..xn) equal to the correct sequence (y1, y2,...yn) in minimum number of moves.
Moreover you can not rearrange anything.
There are two types of moves :-
1. Multiply xi by 2.
2. Decrease xi by 1.
Calculate the minimum number of moves required.
Help Alita!!The first line of input contains the size of array N.
The second line contains the array x1, x2,...xn.
The second line contains the array y1, y2,...yn.
Constraints:-
1 <= N <= 100000
1 <= xi, yi <10^9Print the minimum number of operation required.Sample Input:
4
3 12 2 4
15 9 17 5
Sample Output:
19
Explanation:
For 3 to 15:- 3->2->4->8->16->15 = 5
For 12 to 9:- 12->11->10->9 = 3
For 2 to 17:- 2->4->3->6->5->10->9->18->17 = 8
For 4 to 5:- 4->3->6->5 = 3
total operation = 5+3+8+3 = 19
Sample Input:
1
6077
27091
Sample Output:
2695, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str[] = br.readLine().trim().split(" ");
int n = Integer.parseInt(str[0]);
long a[] = new long[n];
long b[] = new long[n];
String strg[] = br.readLine().trim().split(" ");
for(int i=0;i<n;i++)
a[i] = Long.parseLong(strg[i]);
String strgg[] = br.readLine().trim().split(" ");
for(int i=0;i<n;i++)
b[i] = Long.parseLong(strgg[i]);
long count = 0;
for(int i=0;i<n;i++)
{
count = helpAnita(a[i], b[i]) + count;
}
System.out.print(count);
}
public static long helpAnita(long a, long b)
{
if(a==b)
return 0;
if(a>b)
return a-b;
else
{
if(b%2 == 0)
return 1 + helpAnita(a, b/2);
else
return 1 + helpAnita(a, b+1);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alita has two a sequence of numbers x1, x2,…..xn. She has to go fight a battle with these sequence of numbers. But these numbers are not correct for the battle. She has to convert these numbers to another sequence of numbers y1, y2,…….yn. Alita is busy preparing for the battle so she needs your help.
There is only two type of moves you can perform on any xi (where 1<=i<=n) only.
You have to make initial sequence (x1, x2…..xn) equal to the correct sequence (y1, y2,...yn) in minimum number of moves.
Moreover you can not rearrange anything.
There are two types of moves :-
1. Multiply xi by 2.
2. Decrease xi by 1.
Calculate the minimum number of moves required.
Help Alita!!The first line of input contains the size of array N.
The second line contains the array x1, x2,...xn.
The second line contains the array y1, y2,...yn.
Constraints:-
1 <= N <= 100000
1 <= xi, yi <10^9Print the minimum number of operation required.Sample Input:
4
3 12 2 4
15 9 17 5
Sample Output:
19
Explanation:
For 3 to 15:- 3->2->4->8->16->15 = 5
For 12 to 9:- 12->11->10->9 = 3
For 2 to 17:- 2->4->3->6->5->10->9->18->17 = 8
For 4 to 5:- 4->3->6->5 = 3
total operation = 5+3+8+3 = 19
Sample Input:
1
6077
27091
Sample Output:
2695, I have written this Solution Code: def minoperation1(n1,n2):
count = 0
while(n2 > n1):
if n2%2 == 0 and n2>n1:
count += 1
n2 = n2//2
else:
count +=1
n2 = n2+1
return count + n1 - n2
n = int(input())
xi = list(map(int,input().split()))
yi = list(map(int,input().split()))
f = 0
mini = 0
for i in range(n):
mini += minoperation1(xi[i],yi[i])
print(mini), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alita has two a sequence of numbers x1, x2,…..xn. She has to go fight a battle with these sequence of numbers. But these numbers are not correct for the battle. She has to convert these numbers to another sequence of numbers y1, y2,…….yn. Alita is busy preparing for the battle so she needs your help.
There is only two type of moves you can perform on any xi (where 1<=i<=n) only.
You have to make initial sequence (x1, x2…..xn) equal to the correct sequence (y1, y2,...yn) in minimum number of moves.
Moreover you can not rearrange anything.
There are two types of moves :-
1. Multiply xi by 2.
2. Decrease xi by 1.
Calculate the minimum number of moves required.
Help Alita!!The first line of input contains the size of array N.
The second line contains the array x1, x2,...xn.
The second line contains the array y1, y2,...yn.
Constraints:-
1 <= N <= 100000
1 <= xi, yi <10^9Print the minimum number of operation required.Sample Input:
4
3 12 2 4
15 9 17 5
Sample Output:
19
Explanation:
For 3 to 15:- 3->2->4->8->16->15 = 5
For 12 to 9:- 12->11->10->9 = 3
For 2 to 17:- 2->4->3->6->5->10->9->18->17 = 8
For 4 to 5:- 4->3->6->5 = 3
total operation = 5+3+8+3 = 19
Sample Input:
1
6077
27091
Sample Output:
2695, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
long long a[n],b[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
long long ans=0;
for(int i=0;i<n;i++){
cin>>b[i];}
for(int i=0;i<n;i++){
long long x=a[i],y=b[i];
while(y>x){
if(y&1){y++;ans++;}
else{y=y/2;ans++;}
}
ans+=x-y;
}
cout<<ans<<endl;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a singly linked list and an element K, your task is to insert the element at the tail of the linked list.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>addElement()</b> that takes head node and the integer K as a parameter.
Constraints:
1 <=N<= 1000
1 <=K, value<= 1000Return the head of the modified linked listSample Input:-
5 2
1 2 3 4 5
Sample Output:
1 2 3 4 5 2
, I have written this Solution Code: a,b=[int(x) for x in input().split()]
c=[int(x) for x in input().split()]
for i in c:
print(i,end=" ")
print(b), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a singly linked list and an element K, your task is to insert the element at the tail of the linked list.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>addElement()</b> that takes head node and the integer K as a parameter.
Constraints:
1 <=N<= 1000
1 <=K, value<= 1000Return the head of the modified linked listSample Input:-
5 2
1 2 3 4 5
Sample Output:
1 2 3 4 5 2
, I have written this Solution Code: public static Node addElement(Node head,int k) {
Node temp=head;
while(temp.next!=null){
temp=temp.next;}
Node x= new Node(k);
temp.next = x;
return head;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N integers, your task is to calculate the sum of bit difference in all pairs which can be formed.The first line of input contains a single integer N, the second line of input contains N space separated integers depicting values of the array.
Constraints:-
1 <= N <= 100000
0 <= Arr[i] <= 1000000000Print the sum of bit difference of all possible pairs.
Note:- Since the answer can be quite large print your answer modulo 10<sup>9</sup> + 7Sample Input:-
2
1 3
Sample Output:-
2
Explanation:-
(1, 1) = 0
(1, 3) = 1
(3, 1) = 1
(3, 3) = 0
Sample Input:-
2
1 2
Sample Output:-
4, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
String str[]=br.readLine().split(" ");
int a[]=new int[n];
for(int i=0;i<n;i++){
a[i]=Integer.parseInt(str[i]);
}
long res=0;
for (int i=0;i<32;i++){
long cnt=0;
for (int j=0;j<n;j++)
if ((a[j] & (1 << i)) == 0)
cnt++;
res=(res+(cnt*(n-cnt)*2))%1000000007;
}
System.out.println(res%1000000007);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N integers, your task is to calculate the sum of bit difference in all pairs which can be formed.The first line of input contains a single integer N, the second line of input contains N space separated integers depicting values of the array.
Constraints:-
1 <= N <= 100000
0 <= Arr[i] <= 1000000000Print the sum of bit difference of all possible pairs.
Note:- Since the answer can be quite large print your answer modulo 10<sup>9</sup> + 7Sample Input:-
2
1 3
Sample Output:-
2
Explanation:-
(1, 1) = 0
(1, 3) = 1
(3, 1) = 1
(3, 3) = 0
Sample Input:-
2
1 2
Sample Output:-
4, I have written this Solution Code: def suBD(arr, n):
ans = 0 # Initialize result
for i in range(0, 64):
count = 0
for j in range(0, n):
if ( (arr[j] & (1 << i)) ):
count+= 1
ans += (count * (n - count)) * 2;
return (ans)%(10**9+7)
n=int(input())
arr = map(int,input().split())
arr=list(arr)
print(suBD(arr, n)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N integers, your task is to calculate the sum of bit difference in all pairs which can be formed.The first line of input contains a single integer N, the second line of input contains N space separated integers depicting values of the array.
Constraints:-
1 <= N <= 100000
0 <= Arr[i] <= 1000000000Print the sum of bit difference of all possible pairs.
Note:- Since the answer can be quite large print your answer modulo 10<sup>9</sup> + 7Sample Input:-
2
1 3
Sample Output:-
2
Explanation:-
(1, 1) = 0
(1, 3) = 1
(3, 1) = 1
(3, 3) = 0
Sample Input:-
2
1 2
Sample Output:-
4, I have written this Solution Code:
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define max1 101
#define MOD 1000000007
#define read(type) readInt<type>()
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}signed main(){
int N;
cin>>N;
int a[55];
int A[N];
FOR(i,N){
cin>>A[i];}
for(int i=0;i<55;i++){
a[i]=0;
}
int ans=1,p=2;
for(int i=0;i<55;i++){
for(int j=0;j<N;j++){
if(ans&A[j]){a[i]++;}
}
ans*=p;
// out(ans);
}
ans=0;
for(int i=0;i<55;i++){
ans+=(a[i]*(N-a[i])*2);
ans%=MOD;
}
out(ans);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Bob has an array of N numbers. He wants to calculate the product of the array but does not want integers greater than 10<sup>18</sup>. So, if the result exceeds 10<sup>18</sup>, print -1 instead.<b>Constraints:</b>
2 ≤ N ≤ 10<sup>5</sup>
0 ≤ A<sub>i</sub> ≤ 10<sup>18</sup>
All values in the input are integers.Print the value of A<sub>1</sub>×A<sub>2</sub>....×A<sub>N</sub> as an integer, or -1 if the value exceeds 10<sup>18</sup>.Sample Input 1
2
1000000000 1000000000
Sample Output 1
1000000000000000000
Sample Input 2
3
101 9901 999999000001
Sample Output 2
-1
<b>Explanation</b>
We have 1000000000×1000000000=1000000000000000000.
We have 101×9901×999999000001=1000000000000000001, which exceeds 10<sup>18</sup>, so we should print -1 instead., I have written this Solution Code:
a = int(input())
ls = list(input().split())
temp=1
fl=0
for x in range(a):
if(int(ls[x])==0):
print(0)
fl=1
break
if(fl==0):
for y in range(a):
temp = temp*int(ls[y])
if(temp>1000000000000000000):
print(-1)
break
if(temp<1000000000000000000):
print(temp), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Bob has an array of N numbers. He wants to calculate the product of the array but does not want integers greater than 10<sup>18</sup>. So, if the result exceeds 10<sup>18</sup>, print -1 instead.<b>Constraints:</b>
2 ≤ N ≤ 10<sup>5</sup>
0 ≤ A<sub>i</sub> ≤ 10<sup>18</sup>
All values in the input are integers.Print the value of A<sub>1</sub>×A<sub>2</sub>....×A<sub>N</sub> as an integer, or -1 if the value exceeds 10<sup>18</sup>.Sample Input 1
2
1000000000 1000000000
Sample Output 1
1000000000000000000
Sample Input 2
3
101 9901 999999000001
Sample Output 2
-1
<b>Explanation</b>
We have 1000000000×1000000000=1000000000000000000.
We have 101×9901×999999000001=1000000000000000001, which exceeds 10<sup>18</sup>, so we should print -1 instead., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f(i,p,q) for(long long int i=p;i<q;i++)
void solve(){
ll n,m=1,x=0;
cin>>n;
vector<ll> a(n);
f(i,0,n) cin>>a[i];
ll k=pow(10,18);
ll p=k;
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
f(i,0,n-1){
p/=a[i];
m*=a[i];
}
if(p<a[n-1]) cout<<-1<<endl;
else cout<<m*a[n-1]<<endl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
//ll t;
//cin>>t;
//while(t--)
solve();
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Bob has an array of N numbers. He wants to calculate the product of the array but does not want integers greater than 10<sup>18</sup>. So, if the result exceeds 10<sup>18</sup>, print -1 instead.<b>Constraints:</b>
2 ≤ N ≤ 10<sup>5</sup>
0 ≤ A<sub>i</sub> ≤ 10<sup>18</sup>
All values in the input are integers.Print the value of A<sub>1</sub>×A<sub>2</sub>....×A<sub>N</sub> as an integer, or -1 if the value exceeds 10<sup>18</sup>.Sample Input 1
2
1000000000 1000000000
Sample Output 1
1000000000000000000
Sample Input 2
3
101 9901 999999000001
Sample Output 2
-1
<b>Explanation</b>
We have 1000000000×1000000000=1000000000000000000.
We have 101×9901×999999000001=1000000000000000001, which exceeds 10<sup>18</sup>, so we should print -1 instead., I have written this Solution Code: import java.io.*;
import java.util.*;
import java.math.BigInteger;
class Main {
public static boolean search0 (int index,String [] arr){
for(int i =index;i<arr.length;i++){
if(arr[i].equals("0")){
System.out.println(0);
return true;
}
}
return false;
}
public static void main (String[] args)throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String [] arr = br.readLine().split(" ");
BigInteger limit = new BigInteger("1000000000000000000");
BigInteger result = BigInteger.ONE;
int i =0;
for( i=0; i<n;i++){
result = result.multiply(new BigInteger(arr[i]));
if(result.compareTo(limit)>0){
if(search0(i+1,arr)){
break;
};
System.out.println("-1");
break;
}
}
if(i==n){
System.out.println(result);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of size N consisting of only 0's and 1's, your task is to find the maximum number of consecutive's 1's you can get by flipping at most M 0'sFirst line of input contains two space separated integers denoting values of N and M, next line contains N space separated integer denoting the values of array.
Constraints:-
1 < = M < = N < = 100000
0 < = Arr[i] < = 1Print the maximum number of consecutive 1's.Sample Input:-
5 1
1 0 1 0 0
Sample Output:-
3
Sample Input:-
5 5
1 1 1 1 1
Sample Output:-
5, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static int longestSubSeg(int a[], int n, int k)
{
int count0 = 0;
int l = 0;
int max_len = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 0)
count0++;
while (count0 > k) {
if (a[l] == 0)
count0--;
l++;
}
max_len = Math.max(max_len, i - l + 1);
}
return max_len;
}
public static void main (String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String [] input1 = br.readLine().split(" ");
String [] input2 = br.readLine().split(" ");
int N = Integer.parseInt(input1[0]);
int M = Integer.parseInt(input1[1]);
int [] arr = new int[N];
for(int i=0;i<N;i++){
arr[i]=Integer.parseInt(input2[i]);
}
int maxlen = longestSubSeg(arr,N,M);
System.out.print(maxlen);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of size N consisting of only 0's and 1's, your task is to find the maximum number of consecutive's 1's you can get by flipping at most M 0'sFirst line of input contains two space separated integers denoting values of N and M, next line contains N space separated integer denoting the values of array.
Constraints:-
1 < = M < = N < = 100000
0 < = Arr[i] < = 1Print the maximum number of consecutive 1's.Sample Input:-
5 1
1 0 1 0 0
Sample Output:-
3
Sample Input:-
5 5
1 1 1 1 1
Sample Output:-
5, I have written this Solution Code:
n,k = map(int, input().split())
arr = list(map(int, input().split()))
max_len = 0
j = 0
for i in range(len(arr)):
if arr[i] == 0:
k -= 1
while k < 0:
if arr[j] == 0:
k += 1
j += 1
max_len = max(max_len, i-j+1)
print(max_len), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of size N consisting of only 0's and 1's, your task is to find the maximum number of consecutive's 1's you can get by flipping at most M 0'sFirst line of input contains two space separated integers denoting values of N and M, next line contains N space separated integer denoting the values of array.
Constraints:-
1 < = M < = N < = 100000
0 < = Arr[i] < = 1Print the maximum number of consecutive 1's.Sample Input:-
5 1
1 0 1 0 0
Sample Output:-
3
Sample Input:-
5 5
1 1 1 1 1
Sample Output:-
5, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int cnt=0;
int l=0;
int ans=0;
for(int i=0;i<n;i++){
if(a[i]==0){
cnt++;
}
if(cnt>m){
while(a[l]!=0){
l++;
}
l++;
cnt--;
}
ans=max(ans,i-l+1);
}
cout<<ans<<endl;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given two arrays - value and frequency both containing N elements.
There is also a third array C which is currently empty. Then you perform N insertion operation in the array. For ith operation you insert value[i] to the end of the array frequency[i] number of times.
Finally you have to tell the kth smallest element in the array C.First line of input contains N.
Second line contains N integers denoting array - value
Third line contains N integers denoting array - frequency
Fourth line contains single integer K.
Constraints
1 <= N, value[i], frequency[i] <= 100000
1 <= k <= frequency[1] + frequency[2] +frequency[3] +........ + frequency[N]
Output a single integer which is the kth smallest element of the array C.Sample input 1
5
1 2 3 4 5
1 1 1 2 2
3
Sample output 1
3
Explanation 1:
Array C constructed is 1 2 3 4 4 5 5
Third smallest element is 3
Sample input 2
3
2 1 3
3 3 2
2
sample output 2
1
Explanation 2:
Array C constructed is 2 2 2 1 1 1 3 3
Second smallest element is 1, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args)throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
int[] val = new int[n];
for(int i=0; i<n; i++){
val[i] = Integer.parseInt(st.nextToken());
}
st = new StringTokenizer(br.readLine());
int[] freq = new int[n];
for(int i=0; i<n; i++){
freq[i] = Integer.parseInt(st.nextToken());
}
int k = Integer.parseInt(br.readLine());
for (int i=0; i<n; i++) {
for (int j=i+1; j<n; j++) {
if (val[j] < val[i]) {
int temp = val[i];
val[i] = val[j];
val[j] = temp;
int temp1 = freq[i];
freq[i] = freq[j];
freq[j] = temp1;
}
}
}
int element=0;
for(int i=0; i<n; i++){
for(int j=0; j<freq[i]; j++){
element++;
int value = val[i];
if(element==k){
System.out.print(value);
break;
}
}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given two arrays - value and frequency both containing N elements.
There is also a third array C which is currently empty. Then you perform N insertion operation in the array. For ith operation you insert value[i] to the end of the array frequency[i] number of times.
Finally you have to tell the kth smallest element in the array C.First line of input contains N.
Second line contains N integers denoting array - value
Third line contains N integers denoting array - frequency
Fourth line contains single integer K.
Constraints
1 <= N, value[i], frequency[i] <= 100000
1 <= k <= frequency[1] + frequency[2] +frequency[3] +........ + frequency[N]
Output a single integer which is the kth smallest element of the array C.Sample input 1
5
1 2 3 4 5
1 1 1 2 2
3
Sample output 1
3
Explanation 1:
Array C constructed is 1 2 3 4 4 5 5
Third smallest element is 3
Sample input 2
3
2 1 3
3 3 2
2
sample output 2
1
Explanation 2:
Array C constructed is 2 2 2 1 1 1 3 3
Second smallest element is 1, I have written this Solution Code: def myFun():
n = int(input())
arr1 = list(map(int,input().strip().split()))
arr2 = list(map(int,input().strip().split()))
k = int(input())
arr = []
for i in range(n):
arr.append((arr1[i], arr2[i]))
arr.sort()
c = 0
for i in arr:
k -= i[1]
if k <= 0:
print(i[0])
return
myFun()
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given two arrays - value and frequency both containing N elements.
There is also a third array C which is currently empty. Then you perform N insertion operation in the array. For ith operation you insert value[i] to the end of the array frequency[i] number of times.
Finally you have to tell the kth smallest element in the array C.First line of input contains N.
Second line contains N integers denoting array - value
Third line contains N integers denoting array - frequency
Fourth line contains single integer K.
Constraints
1 <= N, value[i], frequency[i] <= 100000
1 <= k <= frequency[1] + frequency[2] +frequency[3] +........ + frequency[N]
Output a single integer which is the kth smallest element of the array C.Sample input 1
5
1 2 3 4 5
1 1 1 2 2
3
Sample output 1
3
Explanation 1:
Array C constructed is 1 2 3 4 4 5 5
Third smallest element is 3
Sample input 2
3
2 1 3
3 3 2
2
sample output 2
1
Explanation 2:
Array C constructed is 2 2 2 1 1 1 3 3
Second smallest element is 1, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define inf 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main()
{
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
int N;ll K;
cin>>N;
int c=0;
pair<int, ll> A[N];
for(int i=0;i<N;++i){
cin >> A[i].first ;
}
for(int i=0;i<N;++i){
cin >> A[i].second ;
}
cin>>K;
sort(A, A+N);
for(int i=0;i<N;++i){
K -= A[i].second;
if(K <= 0){
cout << A[i].first << endl;;
break;
}
}
#ifdef ANIKET_GOYAL
// cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, your task is to represent the given integer as a binary number.Input contains a single integer containing the value of N.
Constraints:-
0 <= N <= 1000000000Print a string containing the binary representation of the given integer.Sample Input:-
9
Sample Output:-
1001
Sample input:-
3
Sample Output:-
11, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
System.out.println(Integer.toBinaryString(N));
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, your task is to represent the given integer as a binary number.Input contains a single integer containing the value of N.
Constraints:-
0 <= N <= 1000000000Print a string containing the binary representation of the given integer.Sample Input:-
9
Sample Output:-
1001
Sample input:-
3
Sample Output:-
11, I have written this Solution Code: a=int(input())
print(bin(a)[2:]), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, your task is to represent the given integer as a binary number.Input contains a single integer containing the value of N.
Constraints:-
0 <= N <= 1000000000Print a string containing the binary representation of the given integer.Sample Input:-
9
Sample Output:-
1001
Sample input:-
3
Sample Output:-
11, I have written this Solution Code:
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define max1 101
#define MOD 1000000007
#define read(type) readInt<type>()
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}signed main(){
int t;
t=1;
while(t--){
int n;
cin>>n;
string s;
if(n==0){
s+='0';
}
while(n>0){
if(n&1){
s+='1';
}
else{
s+='0';
}
n/=2;
}
reverse(s.begin(),s.end());
out(s);
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: To enter Todo's amusement park, there are M counters. Total N people want to enter the amusement park, each of whom will line up in front of one of the counters. Any counter worker gets angry if the number of people lining up in front of him is at least 2 more than the number of people lining up in front of any of its neighbouring counters. The worker at the K-th counter works the fastest.
Find the maximum number of people that can line up in front of the K-th counter such that each counter gets at least one person and no counter worker is angry.Input contains three integers M, N and K.
Constraints:
1 <= N <= 1000000000
1 <= M <= N
1 <= K <= MPrint the maximum number of people that can line up in front of the Kth counter such that each counter gets at least one person and no counter worker is angry.Sample Input 1
3 3 1
Sample Output 1
1
Explanation: Optimal Arrangement is 1 1 1.
Sample Input 2
3 6 1
Sample Output
3
Explanation: Optimal Arrangement is 3 2 1., I have written this Solution Code: import java.io.*;
class Main {
public static void main (String[] args) throws NumberFormatException, IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] s = in.readLine().split(" ");
in.close();
int M = Integer.parseInt(s[0]);
int N = Integer.parseInt(s[1]);
int K = Integer.parseInt(s[2]);
if(M>=N)
System.out.println(1);
else if(M == 1)
System.out.println(N);
else
System.out.println(countersAndLines(M, N, K));
}
static int countersAndLines (int m, int n, int k){
int start = n/m, end = (n/2)+1;
while(start<=end){
int mid = start+(end-start)/2;
long minPeople = option(mid, k) + option(mid, m-k+1) - mid;
if(minPeople == n)
return mid;
else if(minPeople < n)
start = mid+1;
else
end = mid-1;
}
return end;
}
static long sum (int m, int k, int i){
long sum = i;
int temp = --i;
for(int j = k-1; j>=1; j--){
if(i <= 1)
sum += 1;
else{
sum += i;
i--;
}
}
for(int j = k+1; j<=m; j++){
if(temp <= 1)
sum += 1;
else{
sum += temp;
temp--;
}
}
return sum;
}
static long option(int i, int k){
long x = k;
if(x > i)
x = i;
k -= x;
long y = k + x * (2 * i - x + 1) / 2;
return y;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: To enter Todo's amusement park, there are M counters. Total N people want to enter the amusement park, each of whom will line up in front of one of the counters. Any counter worker gets angry if the number of people lining up in front of him is at least 2 more than the number of people lining up in front of any of its neighbouring counters. The worker at the K-th counter works the fastest.
Find the maximum number of people that can line up in front of the K-th counter such that each counter gets at least one person and no counter worker is angry.Input contains three integers M, N and K.
Constraints:
1 <= N <= 1000000000
1 <= M <= N
1 <= K <= MPrint the maximum number of people that can line up in front of the Kth counter such that each counter gets at least one person and no counter worker is angry.Sample Input 1
3 3 1
Sample Output 1
1
Explanation: Optimal Arrangement is 1 1 1.
Sample Input 2
3 6 1
Sample Output
3
Explanation: Optimal Arrangement is 3 2 1., I have written this Solution Code: def get(ed, cnt):
d=cnt
if d>ed:
d=ed
cnt -=d
return cnt+d*(2*ed-d+1)/2
n,p,k = map(int,input().split())
l=1
r=10**9+10
while l+1<r:
m = (l+r)//2
if get(m,k) + get(m,n-k+1)-m>p:
r=m
else:
l=m
print(l), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: To enter Todo's amusement park, there are M counters. Total N people want to enter the amusement park, each of whom will line up in front of one of the counters. Any counter worker gets angry if the number of people lining up in front of him is at least 2 more than the number of people lining up in front of any of its neighbouring counters. The worker at the K-th counter works the fastest.
Find the maximum number of people that can line up in front of the K-th counter such that each counter gets at least one person and no counter worker is angry.Input contains three integers M, N and K.
Constraints:
1 <= N <= 1000000000
1 <= M <= N
1 <= K <= MPrint the maximum number of people that can line up in front of the Kth counter such that each counter gets at least one person and no counter worker is angry.Sample Input 1
3 3 1
Sample Output 1
1
Explanation: Optimal Arrangement is 1 1 1.
Sample Input 2
3 6 1
Sample Output
3
Explanation: Optimal Arrangement is 3 2 1., I have written this Solution Code: #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
typedef unsigned long long ull;
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
ll get(ll ed, ll cnt){
ll d = cnt;
if (d > ed) d = ed;
cnt -= d;
return cnt + d * (2 * ed - d + 1) / 2;
}
signed main(){
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
ll n, p, k; cin >> n >> p >> k;
ll l = 1, r = 1e9 + 10;
while(l + 1 < r){
ll m = (l + r) / 2;
if ( ull(get(m, k)) + get(m, n - k + 1) - m > p)
r = m;
else l = m;
}
cout << l << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Rick has got a huge candy bag. The bag contains a total of O orange candies, A apple candies, and U candies with an unknown flavor (can be orange or apple as well).
Now Morty wants to know the maximum number of candies that can be drawn from the bag blindfolded such that no more than X orange and Y apple candies are drawn out.
Can you solve the problem for Morty?The first line of the input contains three integers O, A, and U, representing the number of orange, apple, and unknown flavored candies respectively.
The second line of the input contains two integers X and Y representing the maximum number of orange and apple candies that can be drawn of the bag.
Constraints
0 <= O, A, U <= 10<sup>9</sup>
0 <= X, Y <= 10<sup>9</sup>Output a single integer, the maximum number of candies that can be drawn out of Rick's bag.Sample Input 1
4 2 7
2 7
Sample Output 1
2
Explanation: If we draw out more than 2 candies, there is a possible chance for 3 candies to be orange.
Sample Input 2
1 2 3
8 4
Sample Output 2
4, I have written this Solution Code: [o,a,u]=[int(i) for i in input().split()]
s=o+a+u
[x,y]=[int(i) for i in input().split()]
o+=u
a+=u
if o<=x and a<=y:
print(s)
elif o<=x:
print(y)
elif a<=y:
print(x)
else:
print(min(x,y)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Rick has got a huge candy bag. The bag contains a total of O orange candies, A apple candies, and U candies with an unknown flavor (can be orange or apple as well).
Now Morty wants to know the maximum number of candies that can be drawn from the bag blindfolded such that no more than X orange and Y apple candies are drawn out.
Can you solve the problem for Morty?The first line of the input contains three integers O, A, and U, representing the number of orange, apple, and unknown flavored candies respectively.
The second line of the input contains two integers X and Y representing the maximum number of orange and apple candies that can be drawn of the bag.
Constraints
0 <= O, A, U <= 10<sup>9</sup>
0 <= X, Y <= 10<sup>9</sup>Output a single integer, the maximum number of candies that can be drawn out of Rick's bag.Sample Input 1
4 2 7
2 7
Sample Output 1
2
Explanation: If we draw out more than 2 candies, there is a possible chance for 3 candies to be orange.
Sample Input 2
1 2 3
8 4
Sample Output 2
4, I have written this Solution Code: import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main implements Runnable {
private boolean console=false;
private long MOD = 1000_000_007L;
private int MAX = 1000_001;
private void solve1(){
long a=in.nl(),b=in.nl(),c= in.nl();
long x=in.nl(),y=in.nl();
long ans =0;
if(x>y){
long t = x;
x=y;
y=t;
t = a;
a=b;
b=t;
}
if(x-a-c <0){
ans = x;
}else if(y-b-c<0) {
ans = y;
}else {
ans = a+b+c;
}
out.printLn(ans);
}
private void solve() {
int testCases = 1;
while (testCases-->0){
solve1();
}
}
private void add(TreeMap<Integer, Integer> map, int key){
map.put(key,map.getOrDefault(key,0)+1);
}
private void remove(TreeMap<Integer,Integer> map,int key){
if(!map.containsKey(key))
return;
map.put(key,map.getOrDefault(key,0)-1);
if(map.get(key)==0)
map.remove(key);
}
@Override
public void run() {
long time = System.currentTimeMillis();
try {
init();
} catch (FileNotFoundException e) {
e.printStackTrace();
}
try {
solve();
out.flush();
System.err.println(System.currentTimeMillis()-time);
System.exit(0);
}catch (Exception e){
e.printStackTrace(); System.exit(1);
}
}
private FastInput in;
private FastOutput out;
public static void main(String[] args) throws Exception {
new Main().run();
}
private void init() throws FileNotFoundException {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
try {
if (!console && System.getProperty("user.name").equals("puneetkumar")) {
outputStream = new FileOutputStream("/Users/puneetkumar/output.txt");
inputStream = new FileInputStream("/Users/puneetkumar/input.txt");
}
} catch (Exception ignored) {
}
out = new FastOutput(outputStream);
in = new FastInput(inputStream);
}
private void maualAssert(int a,int b,int c){
if(a<b || a>c) throw new RuntimeException();
}
private void maualAssert(long a,long b,long c){
if(a<b || a>c) throw new RuntimeException();
}
private void sort(int[] arr) {
List<Integer> list = new ArrayList<>();
for (int object : arr) list.add(object);
Collections.sort(list);
for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);
}
private void sort(long[] arr) {
List<Long> list = new ArrayList<>();
for (long object : arr) list.add(object);
Collections.sort(list);
for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);
}
private long ModPow(long x, long y, long MOD) {
long res = 1L;
x = x % MOD;
while (y >= 1L) {
if ((y & 1L) > 0) res = (res * x) % MOD;
x = (x * x) % MOD;
y >>= 1L;
}
return res;
}
private int gcd(int a, int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
private long gcd(long a, long b) {
if (a == 0) return b;
return gcd(b % a, a);
}
private int[] arrInt(int n){
int[] arr=new int[n];for(int i=0;i<n;++i)arr[i]=in.ni();
return arr;
}
private long[] arrLong(int n){
long[] arr=new long[n];for(int i=0;i<n;++i)arr[i]=in.nl();
return arr;
}
private int arrMax(int[] arr){
int ans = arr[0];
for(int i=1;i<arr.length;++i){
ans = max(ans,arr[i]);
}
return ans;
}
private long arrMax(long[] arr){
long ans = arr[0];
for(int i=1;i<arr.length;++i){
ans = max(ans,arr[i]);
}
return ans;
}
private int arrMin(int[] arr){
int ans = arr[0];
for(int i=1;i<arr.length;++i){
ans = max(ans,arr[i]);
}
return ans;
}
private long arrMin(long[] arr){
long ans = arr[0];
for(int i=1;i<arr.length;++i){
ans = max(ans,arr[i]);
}
return ans;
}
class FastInput { InputStream obj;
public FastInput(InputStream obj) {
this.obj = obj;
}
private byte inbuffer[] = new byte[1024];
private int lenbuffer = 0, ptrbuffer = 0;
private int readByte() { if (lenbuffer == -1) throw new InputMismatchException();
if (ptrbuffer >= lenbuffer) { ptrbuffer = 0;
try { lenbuffer = obj.read(inbuffer);
} catch (IOException e) { throw new InputMismatchException(); } }
if (lenbuffer <= 0) return -1;return inbuffer[ptrbuffer++]; }
String ns() { int b = skip();StringBuilder sb = new StringBuilder();
while (!(isSpaceChar(b)))
{ sb.appendCodePoint(b);b = readByte(); }return sb.toString();}
int ni() {
int num = 0, b;boolean minus = false;
while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
if (b == '-') { minus = true;b = readByte(); }
while (true) { if (b >= '0' && b <= '9') { num = num * 10 + (b - '0'); } else {
return minus ? -num : num; }b = readByte(); }}
long nl() { long num = 0;int b;boolean minus = false;
while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
if (b == '-') { minus = true;b = readByte(); }
while (true) { if (b >= '0' && b <= '9') { num = num * 10L + (b - '0'); } else {
return minus ? -num : num; }b = readByte(); } }
private boolean isSpaceChar(int c) {
return (!(c >= 33 && c <= 126));
}
int skip() { int b;while ((b = readByte()) != -1 && isSpaceChar(b)) ;return b; }
float nf() {return Float.parseFloat(ns());}
double nd() {return Double.parseDouble(ns());}
char nc() {return (char) skip();}
}
class FastOutput{
private final PrintWriter writer;
public FastOutput(OutputStream outputStream) {
writer = new PrintWriter(outputStream);
}
public PrintWriter getWriter(){
return writer;
}
public void print(Object obj){
writer.print(obj);
}
public void printLn(){
writer.println();
}
public void printLn(Object obj){
writer.print(obj);
printLn();
}
public void printSp(Object obj){
writer.print(obj+" ");
}
public void printArr(int[] arr){
for(int i:arr)
printSp(i);
printLn();
}
public void printArr(long[] arr){
for(long i:arr)
printSp(i);
printLn();
}
public void flush(){
writer.flush();
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Rick has got a huge candy bag. The bag contains a total of O orange candies, A apple candies, and U candies with an unknown flavor (can be orange or apple as well).
Now Morty wants to know the maximum number of candies that can be drawn from the bag blindfolded such that no more than X orange and Y apple candies are drawn out.
Can you solve the problem for Morty?The first line of the input contains three integers O, A, and U, representing the number of orange, apple, and unknown flavored candies respectively.
The second line of the input contains two integers X and Y representing the maximum number of orange and apple candies that can be drawn of the bag.
Constraints
0 <= O, A, U <= 10<sup>9</sup>
0 <= X, Y <= 10<sup>9</sup>Output a single integer, the maximum number of candies that can be drawn out of Rick's bag.Sample Input 1
4 2 7
2 7
Sample Output 1
2
Explanation: If we draw out more than 2 candies, there is a possible chance for 3 candies to be orange.
Sample Input 2
1 2 3
8 4
Sample Output 2
4, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(ll i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;
const int N = 2e5+5;
// it's swapnil07 ;)
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif
void solve(){
int a, b, c;
cin >> a >> b >> c;
int n, m;
cin >> n >> m;
int ans = a+b+c;
if (n < a + c) ans = min(n, ans);
if (m < b + c) ans = min(m, ans);
cout << ans;
}
signed main()
{
fast
#ifdef SWAPNIL07
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
// cin>>t;
while(t--){
solve();
cout<<"\n";
}
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Jerry has recently learned about BODMAS rule, so he is highly curious about brackets. He is currently aware of 3 kinds of brackets, "()", "{}", and "[]".
A correct bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()[]", "({})" are correct (the resulting expressions are: "(1)+[1]", "({1+1}+1)" ). while the bracket sequences ")(" and "[" are not correct.
Given a bracket sequence please tell Jerry whether the bracket sequence is correct or not.The first line of the input contains an integer N, the length of the bracket sequence. The next line of the input contains a string denoting the bracket sequence.
<b>Constraints</b>
4 ≤ N ≤ 10^5Print "YES" without quotes if the bracket sequence is correct, else print "NO".Sample Input 1
8
({}[])[]
Sample Output 1
YES
Sample Input 2
6
([][)]
Sample Output 2
NO, I have written this Solution Code:
import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws Exception{
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
long N = Long.parseLong(reader.readLine());
String str = reader.readLine();
if(areBracketsBalanced(str,N))
System.out.print("YES");
else
System.out.print("NO");
}
static boolean areBracketsBalanced(String expr,long N)
{
int i=0;
Stack<Character> st = new Stack<>();
while(i<expr.length())
{
char ch = expr.charAt(i);
if(ch=='('||ch=='{'||ch=='['){
st.push(ch);
}
if(ch==')'||ch=='}'||ch==']'){
if(st.isEmpty())
{
return false;
}
char c = st.pop();
if((ch==')'&& c!='(') || (ch=='}'&&c!='{') || (ch==']'&&c!='['))
return false;
}
i++;
}
return true;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Jerry has recently learned about BODMAS rule, so he is highly curious about brackets. He is currently aware of 3 kinds of brackets, "()", "{}", and "[]".
A correct bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()[]", "({})" are correct (the resulting expressions are: "(1)+[1]", "({1+1}+1)" ). while the bracket sequences ")(" and "[" are not correct.
Given a bracket sequence please tell Jerry whether the bracket sequence is correct or not.The first line of the input contains an integer N, the length of the bracket sequence. The next line of the input contains a string denoting the bracket sequence.
<b>Constraints</b>
4 ≤ N ≤ 10^5Print "YES" without quotes if the bracket sequence is correct, else print "NO".Sample Input 1
8
({}[])[]
Sample Output 1
YES
Sample Input 2
6
([][)]
Sample Output 2
NO, I have written this Solution Code: def check(ch, ch1):
if((ch == '}' and ch1 != '{') or (ch == ']' and ch1 != '[') or (ch == ')' and ch1 != '(')):
return False
return True
n = int(input())
s = input()
li = []
flag = True
for ch in s:
if(ch == '(' or ch == '[' or ch == '{'):
li.append(ch)
else:
if((len(li) > 0 and not check(ch, li[-1])) or len(li) == 0):
flag = False
break
if(len(li) > 0):
li.pop()
if(flag and len(li) == 0):
print("YES")
else:
print("NO"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Jerry has recently learned about BODMAS rule, so he is highly curious about brackets. He is currently aware of 3 kinds of brackets, "()", "{}", and "[]".
A correct bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()[]", "({})" are correct (the resulting expressions are: "(1)+[1]", "({1+1}+1)" ). while the bracket sequences ")(" and "[" are not correct.
Given a bracket sequence please tell Jerry whether the bracket sequence is correct or not.The first line of the input contains an integer N, the length of the bracket sequence. The next line of the input contains a string denoting the bracket sequence.
<b>Constraints</b>
4 ≤ N ≤ 10^5Print "YES" without quotes if the bracket sequence is correct, else print "NO".Sample Input 1
8
({}[])[]
Sample Output 1
YES
Sample Input 2
6
([][)]
Sample Output 2
NO, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
bool isBalanced(string expr) {
stack<char> s;
char ch;
for (int i=0; i<expr.length(); i++) {
if (expr[i]=='('||expr[i]=='['||expr[i]=='{') {
s.push(expr[i]);
continue;
}
if (s.empty())
return false;
switch (expr[i]) {
case ')':
ch = s.top();
s.pop();
if (ch=='{' || ch=='[')
return false;
break;
case '}':
ch = s.top();
s.pop();
if (ch=='(' || ch=='[')
return false;
break;
case ']':
ch = s.top();
s.pop();
if (ch =='(' || ch == '{')
return false;
break;
}
}
return (s.empty());
}
int main(){
int n;
cin>>n;
string str;
cin>>str;
if(isBalanced(str)){cout<<"YES";}
else{cout<<"NO";}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A[] of size N containing non-negative integers. You have to move all 0's to the end of array while maintaining the relative order of the non-zero elements.
Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.The first line of input line contains T, denoting the number of testcases. Each test cases contains 2 lines. First-line contains N, size of array. Second-line contains elements of array separated by space.
Constraints:
1 <= T <= 100
1 <= N <= 10^5
1 <= A[i] <= 10^5
<b>Sum of N over all testcases does not exceed 10^6</b>
For each testcase you need to print the updated array.Sample Input:
2
5
0 1 0 3 12
8
0 0 0 0 1 2 3 4
Sample Output:
1 3 12 0 0
1 2 3 4 0 0 0 0, I have written this Solution Code:
import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int t;
t=sc.nextInt();
while(t-->0){
int n=sc.nextInt();
int a[] = new int[n];
for(int i=0;i<n;i++){
a[i]=sc.nextInt();
}
int j=-1;
for(int i=0;i<n;i++){
if(a[i]==0 && j==-1){
j=i;
}
if(j!=-1 && a[i]!=0){
a[j]=a[i];
a[i]=0;
j++;
}
}
for(int i=0;i<n;i++){
System.out.print(a[i]+" ");
}
System.out.println();
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A[] of size N containing non-negative integers. You have to move all 0's to the end of array while maintaining the relative order of the non-zero elements.
Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.The first line of input line contains T, denoting the number of testcases. Each test cases contains 2 lines. First-line contains N, size of array. Second-line contains elements of array separated by space.
Constraints:
1 <= T <= 100
1 <= N <= 10^5
1 <= A[i] <= 10^5
<b>Sum of N over all testcases does not exceed 10^6</b>
For each testcase you need to print the updated array.Sample Input:
2
5
0 1 0 3 12
8
0 0 0 0 1 2 3 4
Sample Output:
1 3 12 0 0
1 2 3 4 0 0 0 0, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n,k;
cin>>n;
int a[n];
int cnt=0;
for(int i=0;i<n;i++){
cin>>a[i];\
if(a[i]==0){cnt++;}
}
for(int i=0;i<n;i++){
if(a[i]!=0){
cout<<a[i]<<" ";
}
}
while(cnt--){
cout<<0<<" ";
}
cout<<endl;
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of size 2*N in the form as [x1, x2.. xn, y1, y2,. yn], your task is to shuffle the array in the form given as [x1, y1, x2, y2,. xN, yN]First line of input contains a single integer N. Next line of input contains 2*N space separated integers depicting the values of the array.
Constraints:-
1 <= N <= 10000
1 <= Arr[i] <= 100000Print the shuffled array.Sample Input:-
3
1 2 3 4 5 6
Sample Output:-
1 4 2 5 3 6
Sample Input:-
2
2 4 6 8
Sample Output:-
2 6 4 8, I have written this Solution Code: a=input()
a=int(a)
arr=input().split()
i=0
j=int(len(arr)/2)
while(i<len(arr)/2):
print (arr[i], arr[j], end=' ')
i+=1
j+=1, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of size 2*N in the form as [x1, x2.. xn, y1, y2,. yn], your task is to shuffle the array in the form given as [x1, y1, x2, y2,. xN, yN]First line of input contains a single integer N. Next line of input contains 2*N space separated integers depicting the values of the array.
Constraints:-
1 <= N <= 10000
1 <= Arr[i] <= 100000Print the shuffled array.Sample Input:-
3
1 2 3 4 5 6
Sample Output:-
1 4 2 5 3 6
Sample Input:-
2
2 4 6 8
Sample Output:-
2 6 4 8, I have written this Solution Code:
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define max1 10001
#define MOD 1000000007
#define read(type) readInt<type>()
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
signed main()
{
int n;
cin>>n;
int a[2*n];
FOR(i,2*n){
cin>>a[i];}
FOR(i,n){
cout<<a[i]<<" "<<a[n+i]<<" ";
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of size 2*N in the form as [x1, x2.. xn, y1, y2,. yn], your task is to shuffle the array in the form given as [x1, y1, x2, y2,. xN, yN]First line of input contains a single integer N. Next line of input contains 2*N space separated integers depicting the values of the array.
Constraints:-
1 <= N <= 10000
1 <= Arr[i] <= 100000Print the shuffled array.Sample Input:-
3
1 2 3 4 5 6
Sample Output:-
1 4 2 5 3 6
Sample Input:-
2
2 4 6 8
Sample Output:-
2 6 4 8, I have written this Solution Code:
import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = new int[2*n];
int j=0;
for(int i=0;i<2*n;i++){
a[j]=sc.nextInt();
j+=2;
if(j>=2*n){
j=1;
}
}
for(int i=0;i<2*n;i++){
System.out.print(a[i]+" ");
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given N and K, find the lexicographically smallest string of length N using only the first K lowercase letters of the alphabet such that each letter is used at least once and no two adjacent characters are equal.
If such a string doesn't exist, print -1.The first line of input contains a single integer, T (1 <= T <= 100).
Then T lines follow, each containing two space-separated integers, N (1 <= N <= 10<sup>5</sup>) and K (1 <= K <= 26).
It is guaranteed that sum of N over all test cases does not exceed 10<sup>6</sup>For each test case, output its answer in a new line.Sample Input:
2
2 3
3 2
Sample Output:
-1
aba, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bo=new BufferedWriter(new OutputStreamWriter(System.out));
int t;
try{
t=Integer.parseInt(br.readLine());
}
catch(Exception e)
{
return;
}
while(t-->0)
{
String[] g=br.readLine().split(" ");
int n=Integer.parseInt(g[0]);
int k=Integer.parseInt(g[1]);
if(k>n || (k==1) || (k>26))
{
if(n==1 && k==1)
bo.write("a\n");
else
bo.write(-1+"\n");
}
else
{
int extra=k-2;
boolean check=true;
while(n>extra)
{
if(check==true)
bo.write("a");
else
bo.write("b");
if(check==true)
check=false;
else
check=true;
n--;
}
for(int i=0;i<extra;i++)
bo.write((char)(i+99));
bo.write("\n");
}
}
bo.close();
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given N and K, find the lexicographically smallest string of length N using only the first K lowercase letters of the alphabet such that each letter is used at least once and no two adjacent characters are equal.
If such a string doesn't exist, print -1.The first line of input contains a single integer, T (1 <= T <= 100).
Then T lines follow, each containing two space-separated integers, N (1 <= N <= 10<sup>5</sup>) and K (1 <= K <= 26).
It is guaranteed that sum of N over all test cases does not exceed 10<sup>6</sup>For each test case, output its answer in a new line.Sample Input:
2
2 3
3 2
Sample Output:
-1
aba, I have written this Solution Code: t=int(input())
for tt in range(t):
n,k=map(int,input().split())
if (k==1 and n>1) or (k>n):
print(-1)
continue
s="abcdefghijklmnopqrstuvwxyz"
ss="ab"
if (n-k)%2==0:
a=ss*((n-k)//2)+s[:k]
else:
a=ss*((n-k)//2)+s[:2]+"a"+s[2:k]
print(a), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given N and K, find the lexicographically smallest string of length N using only the first K lowercase letters of the alphabet such that each letter is used at least once and no two adjacent characters are equal.
If such a string doesn't exist, print -1.The first line of input contains a single integer, T (1 <= T <= 100).
Then T lines follow, each containing two space-separated integers, N (1 <= N <= 10<sup>5</sup>) and K (1 <= K <= 26).
It is guaranteed that sum of N over all test cases does not exceed 10<sup>6</sup>For each test case, output its answer in a new line.Sample Input:
2
2 3
3 2
Sample Output:
-1
aba, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long int ll;
typedef unsigned long long int ull;
const long double PI = acos(-1);
const ll mod=1e9+7;
const ll mod1=998244353;
const int inf = 1e9;
const ll INF=1e18;
void precompute(){
}
void TEST_CASE(){
int n,k;
cin >> n >> k;
if(k==1){
if(n>1){
cout << -1 << endl;
}else{
cout << 'a' << endl;
}
}else if(n<k){
cout << -1 << endl;
}else if(n==k){
string s="";
for(int i=0 ; i<k ; i++){
s+=('a'+i);
}
cout << s << endl;
}else{
string s="";
for(int i=0 ; i<(n-k+2) ; i++){
if(i%2){
s+="b";
}else{
s+="a";
}
}
for(int i=2 ; i<k ; i++){
s+=('a'+i);
}
cout << s << endl;
}
}
signed main(){
fast;
//freopen ("INPUT.txt","r",stdin);
//freopen ("OUTPUT.txt","w",stdout);
int test=1,TEST=1;
precompute();
cin >> test;
while(test--){
TEST_CASE();
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two arrays A and B. Given Q queries each having a positive integer i denoting an index of the array A. For each query, your task is to find number of elements less than or equal to A(i) in the array B.The first line of the input consists of an integer N.
The second and third line of each test case consists of N space separated integers representing array A and array B respectively.
The fourth line contains a positive integer Q, denoting the number of queries.
Next Q lines contain an integer corresponding to a query.
1 <= N <= 10^5
1 <= A(i), B(i) <= 10^7
1 <= Q <= 10^3For each test case, print the required answer in a new line.Sample Input:
6
1 2 3 4 7 9
0 1 2 1 1 4
2
5
4
Sample Output:
6
6
Explanation:
For 1st query, the given index is 5, A[5] is 9 and in B all the elements are smaller than 9.
For 2nd query, the given index is 4, A[4] is 7 and in B all the elements are smaller than 7., I have written this Solution Code: import java.io.*;import java.util.*;
class Main { static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}
public static void main (String[] args) {
FastReader scan = new FastReader( );
int testcase = 1;
for(int z=0;z<testcase;z++) {
int n = scan.nextInt();
int[] ar = new int[n];
int[] br = new int[n];
int count=0,m=0;
int c[] = new int[n];
for(int i=0;i<n;i++) {
ar[i] = scan.nextInt();
c[i] = ar[i];
}
for(int i=0;i<n;i++)
br[i] = scan.nextInt();
Arrays.sort(ar);
Arrays.sort(br);
int k = 0;
HashMap<Integer, Integer> hm = new HashMap<>();
for(int i=0;i<n;i++){
while( k<n && ar[i]>=br[k] ){
k++;
}
hm.put(ar[i], k);
}
ar = new int[n];
int q = scan.nextInt();
while(q-->0){
int index = scan.nextInt();
System.out.println(hm.get(c[index]));
}
System.out.println();
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two arrays A and B. Given Q queries each having a positive integer i denoting an index of the array A. For each query, your task is to find number of elements less than or equal to A(i) in the array B.The first line of the input consists of an integer N.
The second and third line of each test case consists of N space separated integers representing array A and array B respectively.
The fourth line contains a positive integer Q, denoting the number of queries.
Next Q lines contain an integer corresponding to a query.
1 <= N <= 10^5
1 <= A(i), B(i) <= 10^7
1 <= Q <= 10^3For each test case, print the required answer in a new line.Sample Input:
6
1 2 3 4 7 9
0 1 2 1 1 4
2
5
4
Sample Output:
6
6
Explanation:
For 1st query, the given index is 5, A[5] is 9 and in B all the elements are smaller than 9.
For 2nd query, the given index is 4, A[4] is 7 and in B all the elements are smaller than 7., I have written this Solution Code:
// author-Shivam gupta
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define max1 10000001
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
typedef long int li;
typedef unsigned long int uli;
typedef long long int ll;
typedef unsigned long long int ull;
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int a[max1];
int main(){
fast();
FOR(i,max1){
a[i]=0;}
int n;
cin>>n;
li x;
map<li,li> m;
for(int i=0;i<n;i++){
cin>>x;
m[i]=x;
}
for(int i=0;i<n;i++){
cin>>x;
a[x]++;
}
FOR1(i,1,max1){
a[i]+=a[i-1];
}
int t;
cin>>t;
while(t--){
cin>>x;
out(a[m[x]]);
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: The students of Newton School threw a grand party to celebrate their hard work and achievements. They danced and sang the night away, enjoying delicious food and creating memories that would last a lifetime.
There are N guests in the party and N-1 relationships are given. The guests are numbered 1, 2, N. The i<sub>th</sub> relationship depicts that guest a<sub>i</sub> and guest b<sub>i</sub> are friends.
Determine whether a guest exists or not who is a friend of all other guests.
Here, we only consider direct friendship.Input is given from Standard Input in the following format:
N
a1 b1
a2 b2
a3 b3
.
.
an-1 bn-1
<b>Constraints</b>
3 ≤ N ≤ 10<sup>5</sup>
1 ≤ ai, bi ≤ N
i≤NIf a guest exists or who is a friend of all other guests, print "Yes" else print "No".<b>Sample Input 1</b>
5
1 4
2 4
3 4
4 5
<b>Sample Output 1</b>
Yes
<b>Sample Input 2</b>
4
2 4
1 4
2 3
<b>Sample Output 2</b>
No
<b>Sample Input 3</b>
10
3 10
4 10
9 10
1 10
7 10
5 10
2 10
8 10
6 10
<b>Sample Output 3</b>
Yes
<b>Explanation</b>
In the first case,4 is a friend of everyone else's, while in the third case, 10 is a friend to all, while there is no such number in the second case., I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main()
{
ll n;
cin >> n;
vector<ll> guests(n + 1, 0); // Counts the number of friends of each guest
for (ll i = 1; i <= n - 1; i++)
{
ll a, b;
cin >> a >> b;
guests[a]++;
guests[b]++;
}
for (ll i = 1; i <= n; i++)
{
if (guests[i] == n - 1) // If any guest is friend with all other guests than we have to return YES
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find factorial of a given number N.
<b>Note: </b>
The Factorial of a number is the product of an integer and all the integers below it;
e.g. factorial four ( 4! ) is equal to 24 (4*3*2*1).<b>User Task</b>
Since this is a functional problem, you don't have to worry about the input. You just have to complete the function <i>Factorial()</i> which contains the given number N.
<b>Constraints:</b>
1 <= N <= 15
Return the factorial of the given number.Sample Input:-
5
Sample Output:-
120
Sample Input:-
3
Sample Output:-
6, I have written this Solution Code: def factorial(n):
if(n == 1):
return 1
return n * factorial(n-1)
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find factorial of a given number N.
<b>Note: </b>
The Factorial of a number is the product of an integer and all the integers below it;
e.g. factorial four ( 4! ) is equal to 24 (4*3*2*1).<b>User Task</b>
Since this is a functional problem, you don't have to worry about the input. You just have to complete the function <i>Factorial()</i> which contains the given number N.
<b>Constraints:</b>
1 <= N <= 15
Return the factorial of the given number.Sample Input:-
5
Sample Output:-
120
Sample Input:-
3
Sample Output:-
6, I have written this Solution Code: static int Factorial(int N)
{
if(N==0){
return 1;}
return N*Factorial(N-1);
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find factorial of a given number N.
<b>Note: </b>
The Factorial of a number is the product of an integer and all the integers below it;
e.g. factorial four ( 4! ) is equal to 24 (4*3*2*1).<b>User Task</b>
Since this is a functional problem, you don't have to worry about the input. You just have to complete the function <i>Factorial()</i> which contains the given number N.
<b>Constraints:</b>
1 <= N <= 15
Return the factorial of the given number.Sample Input:-
5
Sample Output:-
120
Sample Input:-
3
Sample Output:-
6, I have written this Solution Code: // n is the input number
function factorial(n) {
// write code here
// do not console.log
// return the answer as a number
if (n == 1 ) return 1;
return n * factorial(n-1)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Jerry has recently learned about BODMAS rule, so he is highly curious about brackets. He is currently aware of 3 kinds of brackets, "()", "{}", and "[]".
A correct bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()[]", "({})" are correct (the resulting expressions are: "(1)+[1]", "({1+1}+1)" ). while the bracket sequences ")(" and "[" are not correct.
Given a bracket sequence please tell Jerry whether the bracket sequence is correct or not.The first line of the input contains an integer N, the length of the bracket sequence. The next line of the input contains a string denoting the bracket sequence.
<b>Constraints</b>
4 ≤ N ≤ 10^5Print "YES" without quotes if the bracket sequence is correct, else print "NO".Sample Input 1
8
({}[])[]
Sample Output 1
YES
Sample Input 2
6
([][)]
Sample Output 2
NO, I have written this Solution Code:
import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws Exception{
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
long N = Long.parseLong(reader.readLine());
String str = reader.readLine();
if(areBracketsBalanced(str,N))
System.out.print("YES");
else
System.out.print("NO");
}
static boolean areBracketsBalanced(String expr,long N)
{
int i=0;
Stack<Character> st = new Stack<>();
while(i<expr.length())
{
char ch = expr.charAt(i);
if(ch=='('||ch=='{'||ch=='['){
st.push(ch);
}
if(ch==')'||ch=='}'||ch==']'){
if(st.isEmpty())
{
return false;
}
char c = st.pop();
if((ch==')'&& c!='(') || (ch=='}'&&c!='{') || (ch==']'&&c!='['))
return false;
}
i++;
}
return true;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Jerry has recently learned about BODMAS rule, so he is highly curious about brackets. He is currently aware of 3 kinds of brackets, "()", "{}", and "[]".
A correct bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()[]", "({})" are correct (the resulting expressions are: "(1)+[1]", "({1+1}+1)" ). while the bracket sequences ")(" and "[" are not correct.
Given a bracket sequence please tell Jerry whether the bracket sequence is correct or not.The first line of the input contains an integer N, the length of the bracket sequence. The next line of the input contains a string denoting the bracket sequence.
<b>Constraints</b>
4 ≤ N ≤ 10^5Print "YES" without quotes if the bracket sequence is correct, else print "NO".Sample Input 1
8
({}[])[]
Sample Output 1
YES
Sample Input 2
6
([][)]
Sample Output 2
NO, I have written this Solution Code: def check(ch, ch1):
if((ch == '}' and ch1 != '{') or (ch == ']' and ch1 != '[') or (ch == ')' and ch1 != '(')):
return False
return True
n = int(input())
s = input()
li = []
flag = True
for ch in s:
if(ch == '(' or ch == '[' or ch == '{'):
li.append(ch)
else:
if((len(li) > 0 and not check(ch, li[-1])) or len(li) == 0):
flag = False
break
if(len(li) > 0):
li.pop()
if(flag and len(li) == 0):
print("YES")
else:
print("NO"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Jerry has recently learned about BODMAS rule, so he is highly curious about brackets. He is currently aware of 3 kinds of brackets, "()", "{}", and "[]".
A correct bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()[]", "({})" are correct (the resulting expressions are: "(1)+[1]", "({1+1}+1)" ). while the bracket sequences ")(" and "[" are not correct.
Given a bracket sequence please tell Jerry whether the bracket sequence is correct or not.The first line of the input contains an integer N, the length of the bracket sequence. The next line of the input contains a string denoting the bracket sequence.
<b>Constraints</b>
4 ≤ N ≤ 10^5Print "YES" without quotes if the bracket sequence is correct, else print "NO".Sample Input 1
8
({}[])[]
Sample Output 1
YES
Sample Input 2
6
([][)]
Sample Output 2
NO, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
bool isBalanced(string expr) {
stack<char> s;
char ch;
for (int i=0; i<expr.length(); i++) {
if (expr[i]=='('||expr[i]=='['||expr[i]=='{') {
s.push(expr[i]);
continue;
}
if (s.empty())
return false;
switch (expr[i]) {
case ')':
ch = s.top();
s.pop();
if (ch=='{' || ch=='[')
return false;
break;
case '}':
ch = s.top();
s.pop();
if (ch=='(' || ch=='[')
return false;
break;
case ']':
ch = s.top();
s.pop();
if (ch =='(' || ch == '{')
return false;
break;
}
}
return (s.empty());
}
int main(){
int n;
cin>>n;
string str;
cin>>str;
if(isBalanced(str)){cout<<"YES";}
else{cout<<"NO";}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: They say friendship is greater than love. Why not play the famous game "FLAMES".
The rules are super simple. Given two strings (all lowercase), remove all the letters that are common to both the strings from both the strings. You cannot erase a character in first string whichever corresponding same character in other string not exist.
For example, in the case
String 1: saumya
String 2: ansh
You can remove only 1 'a' and 1 's' from both the strings.
Remaining strings are:
String 1: umya
String 2: nh
Now all you need to do is find the sum of the remaining strings length % 6.
Output:
If obtained value is 1, output "Friends"
If obtained value is 2, output "Love"
If obtained value is 3, output "Affection"
If obtained value is 4, output "Marriage"
If obtained value is 5, output "Enemy"
If obtained value is 0, output "Siblings"You will be given two strings on different lines.
Constraints
1 <= Length of both the strings <= 100000Output a single string, the result of FLAMES test.Sample Input:-
saumya
ansh
Sample Output:-
Siblings
Explanation:-
after deleting characters :-
str1 = umya
str2 = nh
sum = 4+2
sum%6=0
, I have written this Solution Code:
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str1 = br.readLine();
String str2 = br.readLine();
countCommonCharacters(str1, str2);
}
static void countCommonCharacters(String s1, String s2) {
int[] arr1 = new int[26];
int[] arr2 = new int[26];
for (int i = 0; i < s1.length(); i++)
arr1[s1.codePointAt(i) - 97]++;
for (int i = 0; i < s2.length(); i++)
arr2[s2.codePointAt(i) - 97]++;
int lenToCut = 0;
for (int i = 0; i < 26; i++) {
int leastOccurrence = Math.min(arr1[i], arr2[i]);
lenToCut += (2 * leastOccurrence);
}
System.out.println(findRelation((s1.length() + s2.length() - lenToCut) % 6));
}
static String findRelation(int value) {
switch (value) {
case 1:
return "Friends";
case 2:
return "Love";
case 3:
return "Affection";
case 4:
return "Marriage";
case 5:
return "Enemy";
default:
return "Siblings";
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: They say friendship is greater than love. Why not play the famous game "FLAMES".
The rules are super simple. Given two strings (all lowercase), remove all the letters that are common to both the strings from both the strings. You cannot erase a character in first string whichever corresponding same character in other string not exist.
For example, in the case
String 1: saumya
String 2: ansh
You can remove only 1 'a' and 1 's' from both the strings.
Remaining strings are:
String 1: umya
String 2: nh
Now all you need to do is find the sum of the remaining strings length % 6.
Output:
If obtained value is 1, output "Friends"
If obtained value is 2, output "Love"
If obtained value is 3, output "Affection"
If obtained value is 4, output "Marriage"
If obtained value is 5, output "Enemy"
If obtained value is 0, output "Siblings"You will be given two strings on different lines.
Constraints
1 <= Length of both the strings <= 100000Output a single string, the result of FLAMES test.Sample Input:-
saumya
ansh
Sample Output:-
Siblings
Explanation:-
after deleting characters :-
str1 = umya
str2 = nh
sum = 4+2
sum%6=0
, I have written this Solution Code: name1 = input().strip().lower()
name2 = input().strip().lower()
listA = [0]*26
listB = [0]*26
for i in name1:
listA[ord(i)-ord('a')] = listA[ord(i)-ord('a')] + 1
for i in name2:
listB[ord(i)-ord('a')] = listB[ord(i)-ord('a')] + 1
count = 0
for i in range(0,26):
count = count+abs(listA[i]-listB[i])
res = ["Siblings","Friends","Love","Affection", "Marriage", "Enemy"]
print(res[count%6]), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: They say friendship is greater than love. Why not play the famous game "FLAMES".
The rules are super simple. Given two strings (all lowercase), remove all the letters that are common to both the strings from both the strings. You cannot erase a character in first string whichever corresponding same character in other string not exist.
For example, in the case
String 1: saumya
String 2: ansh
You can remove only 1 'a' and 1 's' from both the strings.
Remaining strings are:
String 1: umya
String 2: nh
Now all you need to do is find the sum of the remaining strings length % 6.
Output:
If obtained value is 1, output "Friends"
If obtained value is 2, output "Love"
If obtained value is 3, output "Affection"
If obtained value is 4, output "Marriage"
If obtained value is 5, output "Enemy"
If obtained value is 0, output "Siblings"You will be given two strings on different lines.
Constraints
1 <= Length of both the strings <= 100000Output a single string, the result of FLAMES test.Sample Input:-
saumya
ansh
Sample Output:-
Siblings
Explanation:-
after deleting characters :-
str1 = umya
str2 = nh
sum = 4+2
sum%6=0
, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define max1 10000001
int main(){
string s1,s2;
cin>>s1>>s2;
string a[6];
a[1]= "Friends";
a[2]= "Love";
a[3]="Affection";
a[4]= "Marriage";
a[5]= "Enemy";
a[0]= "Siblings";
int b[26],c[26];
for(int i=0;i<26;i++){b[i]=0;c[i]=0;}
for(int i=0;i<s1.length();i++){
b[s1[i]-'a']++;
}
for(int i=0;i<s2.length();i++){
c[s2[i]-'a']++;
}
int sum=0;
for(int i=0;i<26;i++){
sum+=abs(b[i]-c[i]);
}
cout<<a[sum%6];
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an sorted array <b>Arr[]</b> of size <b>N</b>, containing both <b>negative</b> and <b>positive</b> integers, you need to print the squared sorted output.
<b>Note</b> Try using two pointer approachThe first line of input contains T, denoting the number of test cases. Each testcase contains 2 lines. The first line contains the N size of the array. The second line contains elements of an array separated by space.
Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 10000
-10000 ≤ A[i] ≤ 10000
The Sum of N over all test cases does not exceed 10^6For each test case you need to print the sorted squared output in new lineInput:
1
5
-7 -2 3 4 6
Output:
4 9 16 36 49, I have written this Solution Code: import java.util.*;
import java.io.*;
class Main
{
public static void main(String[] args)throws IOException {
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(read.readLine());
while (t-- > 0) {
int n = Integer.parseInt(read.readLine());
int[] arr = new int[n];
String str[] = read.readLine().trim().split(" ");
for(int i = 0; i < n; i++)
arr[i] = Integer.parseInt(str[i]);
arr = sortedSquares(arr);
for(int i = 0; i < n; i++)
System.out.print(arr[i] + " ");
System.out.println();
}
}
public static int[] sortedSquares(int[] A) {
int[] nums = new int[A.length];
int k=A.length-1;
int i=0, j=A.length-1;
while(i<=j){
if(Math.abs(A[i]) <= Math.abs(A[j])){
nums[k--] = A[j]*A[j];
j--;
}
else{
nums[k--] = A[i]*A[i];
i++;
}
}
return nums;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an sorted array <b>Arr[]</b> of size <b>N</b>, containing both <b>negative</b> and <b>positive</b> integers, you need to print the squared sorted output.
<b>Note</b> Try using two pointer approachThe first line of input contains T, denoting the number of test cases. Each testcase contains 2 lines. The first line contains the N size of the array. The second line contains elements of an array separated by space.
Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 10000
-10000 ≤ A[i] ≤ 10000
The Sum of N over all test cases does not exceed 10^6For each test case you need to print the sorted squared output in new lineInput:
1
5
-7 -2 3 4 6
Output:
4 9 16 36 49, I have written this Solution Code: t = int(input())
for i in range(t):
n = int(input())
for i in sorted(map(lambda j:int(j)**2,input().split())):
print(i,end=' ')
print(), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A 2n digits number is said to be lucky if sum of n most significant digits is equal to sum of n least significant digits.
Given a number find out if the number is lucky or not?First line contains n.
Next line contains a number of 2n digits.
<b>Constraints</b>
1 ≤ n ≤ 10<sup>5</sup>
Number contains digits only.Print "LUCKY" if the number is lucky otherwise print "UNLUCKY".Input:
3
213411
Output:
LUCKY
Explanation :
sum of 3 most significant digits = 2 + 1 + 3 = 6
sum of 3 least significant digits = 4 + 1 + 1 = 6
Input:
1
69
Output:
UNLUCKY, I have written this Solution Code: import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
OutputWriter out = new OutputWriter(outputStream);
int n=Integer.parseInt(in.next());
String s=in.next();
int sum=0;
for(int i=0;i<n;i++){
int d = s.charAt(i) - '0';
sum += d;
}
for(int i=n;i<2*n;i++){
int d = s.charAt(i) - '0';
sum -= d;
}
if(sum == 0)out.print("LUCKY");
else out.print("UNLUCKY");
out.close();
}
static class InputReader {
BufferedReader reader;
StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
static class OutputWriter {
private final PrintWriter writer;
public OutputWriter(OutputStream outputStream) {
writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
}
public OutputWriter(Writer writer) {
this.writer = new PrintWriter(writer);
}
public void print(Object... objects) {
for (int i = 0; i < objects.length; i++) {
if (i != 0) {
writer.print(' ');
}
writer.print(objects[i]);
}
}
public void println(Object... objects) {
print(objects);
writer.println();
}
public void close() {
writer.close();
}
public void println(int i) {
writer.println(i);
}
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara selects two different numbers from the range 1 to 50 and noted their sum as N. However later she Forgets which numbers she selected and now wants to know the total number of possible combinations she can have.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>forgottenNumbers()</b> that takes integer N argument.
Constraints:-
3 <= N <= 99Return the total number of choices Sara has.Sample Input:-
8
Sample Output:-
3
Explanation:-
(1, 7), (2, 6), (3, 5)
Sample Input:-
3
Sample Output:-
1, I have written this Solution Code: int forgottenNumbers(int N){
int ans=0;
for(int i=1;i<=50;i++){
for(int j=1;j<=50;j++){
if(i!=j && i+j==N){
ans++;
}
}
}
return ans/2;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara selects two different numbers from the range 1 to 50 and noted their sum as N. However later she Forgets which numbers she selected and now wants to know the total number of possible combinations she can have.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>forgottenNumbers()</b> that takes integer N argument.
Constraints:-
3 <= N <= 99Return the total number of choices Sara has.Sample Input:-
8
Sample Output:-
3
Explanation:-
(1, 7), (2, 6), (3, 5)
Sample Input:-
3
Sample Output:-
1, I have written this Solution Code: static int forgottenNumbers(int N){
int ans=0;
for(int i=1;i<=50;i++){
for(int j=1;j<=50;j++){
if(i!=j && i+j==N){
ans++;
}
}
}
return ans/2;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara selects two different numbers from the range 1 to 50 and noted their sum as N. However later she Forgets which numbers she selected and now wants to know the total number of possible combinations she can have.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>forgottenNumbers()</b> that takes integer N argument.
Constraints:-
3 <= N <= 99Return the total number of choices Sara has.Sample Input:-
8
Sample Output:-
3
Explanation:-
(1, 7), (2, 6), (3, 5)
Sample Input:-
3
Sample Output:-
1, I have written this Solution Code: int forgottenNumbers(int N){
int ans=0;
for(int i=1;i<=50;i++){
for(int j=1;j<=50;j++){
if(i!=j && i+j==N){
ans++;
}
}
}
return ans/2;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara selects two different numbers from the range 1 to 50 and noted their sum as N. However later she Forgets which numbers she selected and now wants to know the total number of possible combinations she can have.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>forgottenNumbers()</b> that takes integer N argument.
Constraints:-
3 <= N <= 99Return the total number of choices Sara has.Sample Input:-
8
Sample Output:-
3
Explanation:-
(1, 7), (2, 6), (3, 5)
Sample Input:-
3
Sample Output:-
1, I have written this Solution Code: def forgottenNumbers(N):
ans = 0
for i in range (1,51):
for j in range (1,51):
if i != j and i+j==N:
ans=ans+1
return ans//2
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Saurabh has a paper of size N*M and some horizontal and vertical lines in the form of arrays. Saurabh wants to know the maximum area which is trapped inside the lines.
Note:- Consider the boundary of the paper to be vertical and horizontal lines. Also consider 0 indexingThe first line of input contains 4 space separated integers depicting N, M, size of array contains horizontal lines(H), size of array containing vertical lines(V). The second line contains H space separated integers depicting horizontal lines. Last lines contains V space separated integers depicting vertical lines.
Constraints:-
1 <= N, M <= 10<sup>9</sup>
1 <= H, V <= 100000
0 <= horizontal lines <= N
0 <= vertical lines <= MPrint the maximum area trapped between the lines.
<b>Note:</b>Area to be printed might be large print area as (area%(10<sup>9</sup> +7)).Sample Input:-
5 4 3 2
1 2 4
1 3
Sample Output:-
4
Explanation:-
The area is- (2,1), (2,3) (4,1) (4,3)
Sample Input:-
5 4 2 1
3 1
1
Sample Output:-
6, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args)
{
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
int m = scn.nextInt();
int h = scn.nextInt();
int w = scn.nextInt();
int harr[] = new int[h];
int warr[] = new int[w];
for(int i=0; i<h; i++)
{
harr[i] = scn.nextInt();
}
for(int i=0; i<w; i++)
{
warr[i] = scn.nextInt();
}
System.out.println(maxArea( n, m, harr, warr));
}
public static int maxArea(int n, int m, int[] hc, int[] vc) {
Arrays.sort(hc);
Arrays.sort(vc);
int maxh = Math.max(hc[0], n - hc[hc.length-1]),
maxv = Math.max(vc[0], m - vc[vc.length-1]);
for (int i = 1; i < hc.length; i++)
maxh = Math.max(maxh, hc[i] - hc[i-1]);
for (int i = 1; i < vc.length; i++)
maxv = Math.max(maxv, vc[i] - vc[i-1]);
return (int)((long)maxh * maxv % 1000000007);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Saurabh has a paper of size N*M and some horizontal and vertical lines in the form of arrays. Saurabh wants to know the maximum area which is trapped inside the lines.
Note:- Consider the boundary of the paper to be vertical and horizontal lines. Also consider 0 indexingThe first line of input contains 4 space separated integers depicting N, M, size of array contains horizontal lines(H), size of array containing vertical lines(V). The second line contains H space separated integers depicting horizontal lines. Last lines contains V space separated integers depicting vertical lines.
Constraints:-
1 <= N, M <= 10<sup>9</sup>
1 <= H, V <= 100000
0 <= horizontal lines <= N
0 <= vertical lines <= MPrint the maximum area trapped between the lines.
<b>Note:</b>Area to be printed might be large print area as (area%(10<sup>9</sup> +7)).Sample Input:-
5 4 3 2
1 2 4
1 3
Sample Output:-
4
Explanation:-
The area is- (2,1), (2,3) (4,1) (4,3)
Sample Input:-
5 4 2 1
3 1
1
Sample Output:-
6, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define max1 101
#define MOD 1000000007
#define read(type) readInt<type>()
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int solve(int ha, int w, vector<int>h, vector<int> v){
sort(h.begin(),h.end());
sort(v.begin(),v.end());
h.push_back(ha);
v.push_back(w);
long long hh=h[0],vv=v[0];;
for(int i=1;i<h.size();i++){
hh=max(hh,(1LL)*(h[i]-h[i-1]));
}
for(int i=1;i<v.size();i++){
vv=max(vv,(1LL)*(v[i]-v[i-1]));
}
return (hh*vv*1LL)%(1000000007);
}
signed main(){
fast();
int n;
cin>>n;
int m;
cin>>m;
int x,y;
cin>>x>>y;
vector<int> h(x),v(y);
FOR(i,x){
cin>>h[i];}
FOR(i,y){
cin>>v[i];}
cout<<solve(n,m,h,v);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an unsorted array A of size N of non-negative integers, find a continuous sub-array which adds to a given number S.Each test case consists of two lines. The first line of each test case is N and S, where N is the size of the array and S is the sum. The second line of each test case contains N space-separated integers denoting the array elements.
<b>Constraints:-</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ Ai ≤ 10<sup>5</sup>Print the starting and ending positions (1 indexing) of first such occurring subarray from the left if sum equals to subarray, else print -1.Sample Input
5 12
1 2 3 7 5
Sample Output
2 4
Explanation:
subarray starting from index 2 and ending at index 4 => {2 , 3 , 7}
sum = 2 + 3 + 7 = 12
Sample Input
10 15
1 2 3 4 5 6 7 8 9 10
Sample Output
1 5, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException
{
try{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String StrInput[] = br.readLine().trim().split(" ");
int n = Integer.parseInt(StrInput[0]);
int s = Integer.parseInt(StrInput[1]);
int arr[] = new int[n];
String StrInput2[] = br.readLine().trim().split(" ");
for(int i=0;i<n;i++)
{
arr[i] = Integer.parseInt(StrInput2[i]);
}
int sum = arr[0];
int startingindex = 0;
int endingindex = 1;
int j = 0;
int i;
for(i=1;i<=n;i++)
{
if(sum < s && arr[i] != 0)
{
sum += arr[i];
}
while(sum > s && startingindex < i-1)
{
sum -= arr[startingindex];
startingindex++;
}
if(sum == s)
{
endingindex = i+1;
if(arr[0] == 0)
{
System.out.print(startingindex+2 + " " + endingindex);
}
else
{
System.out.print(startingindex+1 + " "+ endingindex);
}
break;
}
if(i == n && sum < s)
{
System.out.print(-1);
break;
}
}
}
catch(Exception e)
{
System.out.print(-1);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an unsorted array A of size N of non-negative integers, find a continuous sub-array which adds to a given number S.Each test case consists of two lines. The first line of each test case is N and S, where N is the size of the array and S is the sum. The second line of each test case contains N space-separated integers denoting the array elements.
<b>Constraints:-</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ Ai ≤ 10<sup>5</sup>Print the starting and ending positions (1 indexing) of first such occurring subarray from the left if sum equals to subarray, else print -1.Sample Input
5 12
1 2 3 7 5
Sample Output
2 4
Explanation:
subarray starting from index 2 and ending at index 4 => {2 , 3 , 7}
sum = 2 + 3 + 7 = 12
Sample Input
10 15
1 2 3 4 5 6 7 8 9 10
Sample Output
1 5, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int sum=0;
unordered_map<int,int> m;
for(int i=0;i<n;i++){
sum+=a[i];
if(sum==k){cout<<1<<" "<<i+1;return 0;}
if(m.find(sum-k)!=m.end()){
cout<<m[sum-k]+2<<" "<<i+1;
return 0;
}
m[sum]=i;
}
cout<<-1;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an unsorted array A of size N of non-negative integers, find a continuous sub-array which adds to a given number S.Each test case consists of two lines. The first line of each test case is N and S, where N is the size of the array and S is the sum. The second line of each test case contains N space-separated integers denoting the array elements.
<b>Constraints:-</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ Ai ≤ 10<sup>5</sup>Print the starting and ending positions (1 indexing) of first such occurring subarray from the left if sum equals to subarray, else print -1.Sample Input
5 12
1 2 3 7 5
Sample Output
2 4
Explanation:
subarray starting from index 2 and ending at index 4 => {2 , 3 , 7}
sum = 2 + 3 + 7 = 12
Sample Input
10 15
1 2 3 4 5 6 7 8 9 10
Sample Output
1 5, I have written this Solution Code: def sumFinder(N,S,a):
currentSum = a[0]
start = 0
i = 1
while i <= N:
while currentSum > S and start < i-1:
currentSum = currentSum - a[start]
start += 1
if currentSum == S:
return (start+1,i)
if i < N:
currentSum = currentSum + a[i]
i += 1
return(-1)
N, S = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
ans = sumFinder(N,S,a)
if(ans==-1):
print(ans)
else:
print(ans[0],ans[1]), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S. You can rearrange its letters in any way you want. You have to the find the maximum number of substrings in S which are equal to "abcda" after rearrangement.First line of input contains a single string S.
Constraints:
1 <= |S| <= 100000
String contains lowercase english letters.Output a single integer which is the maximum number of substrings in S which are equal to "abcda" after rearrangement.Sample Input
cbdaaabcda
Sample Output
2
Explanation : we can rearrange the given string as abcdaabcda, I have written this Solution Code:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s = br.readLine();
int a = -1 , b = 0, c= 0, d = 0;
for(int i = 0 ; i < s.length() ; i++){
if(s.charAt(i) == 'a')
a++;
else if(s.charAt(i) == 'b')
b++;
else if(s.charAt(i) == 'c')
c++;
else if(s.charAt(i) == 'd')
d++;
}
if(a==-1)
System.out.print(0);
else
System.out.print(findmin(a,b,c,d));
}
static int findmin(int a, int b, int c , int d){
int f , s ;
f = Math.min(a,b); s = Math.min(c, d);
return Math.min(f,s);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S. You can rearrange its letters in any way you want. You have to the find the maximum number of substrings in S which are equal to "abcda" after rearrangement.First line of input contains a single string S.
Constraints:
1 <= |S| <= 100000
String contains lowercase english letters.Output a single integer which is the maximum number of substrings in S which are equal to "abcda" after rearrangement.Sample Input
cbdaaabcda
Sample Output
2
Explanation : we can rearrange the given string as abcdaabcda, I have written this Solution Code: arr=input()
a=0
b=0
c=0
d=0
for i in range(0,len(arr)):
if(arr[i]=='a'):
a+=1
elif (arr[i]=='b'):
b+=1
elif (arr[i]=='c'):
c+=1
elif (arr[i]=='d'):
d+=1
ans=(min(int(a/2),b,c,d))
ans1=min(a-1,b,c,d)
print (max(ans,ans1)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S. You can rearrange its letters in any way you want. You have to the find the maximum number of substrings in S which are equal to "abcda" after rearrangement.First line of input contains a single string S.
Constraints:
1 <= |S| <= 100000
String contains lowercase english letters.Output a single integer which is the maximum number of substrings in S which are equal to "abcda" after rearrangement.Sample Input
cbdaaabcda
Sample Output
2
Explanation : we can rearrange the given string as abcdaabcda, I have written this Solution Code: #pragma GCC optimize ("O3")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main()
{
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
string s;
cin>>s;
int c[26]={};
for(auto r:s){
c[r-'a']++;
}
int ans=min(min(c[0]-1,c[1]),min(c[2],c[3]));
if(ans<0)
ans=0;
cout<<ans;
#ifdef ANIKET_GOYAL
// cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: On an infinite plane, a robot initially stands at (0, 0) and faces north. Note that:
:> The north direction is the positive direction of the y- axis.
:> The south direction is the negative direction of the y- axis.
:> The east direction is the positive direction of the x- axis.
:> The west direction is the negative direction of the x- axis.
The robot can receive one of three instructions:
:> "G": go straight 1 unit.
:> "L": turn 90 degrees to the left (i. e., anti- clockwise direction).
:> "R": turn 90 degrees to the right (i. e., clockwise direction).
The robot performs the instructions given in order, and repeats them forever.
Return true if and only if there exists a circle in the plane such that the robot never leaves the circle.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>isRobotBounded()</b> that takes string "instructions" as parameter.
<b>Constraints:</b>
1 ≤ instructions.length ≤ 100
instructions[i] is 'G', 'L' or, 'R'.
Return true if and only if there exists a circle in the plane such that the robot never leaves the circle.Sample 1:
Input: instructions = "GGLLGG"
Output: true
Explanation: The robot is initially at (0, 0) facing the north direction.
"G": move one step. Position: (0, 1). Direction: North.
"G": move one step. Position: (0, 2). Direction: North.
"L": turn 90 degrees anti-clockwise. Position: (0, 2). Direction: West.
"L": turn 90 degrees anti-clockwise. Position: (0, 2). Direction: South.
"G": move one step. Position: (0, 1). Direction: South.
"G": move one step. Position: (0, 0). Direction: South.
Repeating the instructions, the robot goes into the cycle: (0, 0) --> (0, 1) --> (0, 2) --> (0, 1) --> (0, 0).
Based on that, we return true.
Sample 2:
Input: instructions = "GG"
Output: false
Explanation: The robot is initially at (0, 0) facing the north direction.
"G": move one step. Position: (0, 1). Direction: North.
"G": move one step. Position: (0, 2). Direction: North.
Repeating the instructions, keeps advancing in the north direction and does not go into cycles.
Based on that, we return false.
Sample 3:
Input: instructions = "GL"
Output: true
Explanation: The robot is initially at (0, 0) facing the north direction.
"G": move one step. Position: (0, 1). Direction: North.
"L": turn 90 degrees anti-clockwise. Position: (0, 1). Direction: West.
"G": move one step. Position: (-1, 1). Direction: West.
"L": turn 90 degrees anti-clockwise. Position: (-1, 1). Direction: South.
"G": move one step. Position: (-1, 0). Direction: South.
"L": turn 90 degrees anti-clockwise. Position: (-1, 0). Direction: East.
"G": move one step. Position: (0, 0). Direction: East.
"L": turn 90 degrees anti-clockwise. Position: (0, 0). Direction: North.
Repeating the instructions, the robot goes into the cycle: (0, 0) --> (0, 1) --> (-1, 1) --> (-1, 0) --> (0, 0).
Based on that, we return true.
, I have written this Solution Code:
class Solution {
public boolean isRobotBounded(String instructions) {
if (instructions.length() == 0)
return false;
int x = 0;
int y = 0; // initial points of the robot
String directions = "North"; // initial direction of robot
/*
North
West East
South
*/
for (char ch: instructions.toCharArray()) {
if (ch == 'G') {
if (directions.equals("North"))
y += 1;
else if (directions.equals("South"))
y -= 1;
else if(directions.equals("East"))
x += 1;
else
x -= 1;
}
else if (ch == 'L') {
if (directions.equals("North"))
directions = "West";
else if (directions.equals("West"))
directions = "South";
else if (directions.equals("South"))
directions = "East";
else directions = "North";
}
else if (ch == 'R') {
if (directions.equals("North"))
directions = "East";
else if (directions.equals("East"))
directions = "South";
else if (directions.equals("South"))
directions = "West";
else directions = "North";
}
}
if (x == 0 && y == 0)
return true;
if (directions.equals("North"))
return false;
return true;
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer array <strong>arr[]</strong> of size <strong>N</strong> and an element <strong>X</strong>. The task is to find and print the indices of the given element if it is present in array if not then print “<strong>Not found</strong>” without quotes.
<strong>Note</strong>: The elements may be present more than once.The first line of input contains T, denoting the number of test cases.
The first line of each test case contains N and X, N is the size of array and X is an element. Second line contains elements of array space separated. If not present then print "Not found" without quotes
<strong>Constraints</strong>:
1 <= T <= 100
1 <= N, X <= 10000
1 <= arr[i] <= 100000For each test case in new line you need to print all the positions where you find the X separated by space.
Assume 0-indexingInput:
2
5 6
2 3 6 5 6
4 3
2 4 6 5
Output:
2 4
Not found, I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
signed main() {
IOS;
int t; cin >> t;
while(t--){
vector<int> v;
int n, x; cin >> n >> x;
for(int i = 1; i <= n; i++){
int p; cin >> p;
if(p == x)
v.push_back(i-1);
}
if(v.size() == 0)
cout << "Not found\n";
else{
for(auto i: v)
cout << i << " ";
cout << endl;
}
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer array <strong>arr[]</strong> of size <strong>N</strong> and an element <strong>X</strong>. The task is to find and print the indices of the given element if it is present in array if not then print “<strong>Not found</strong>” without quotes.
<strong>Note</strong>: The elements may be present more than once.The first line of input contains T, denoting the number of test cases.
The first line of each test case contains N and X, N is the size of array and X is an element. Second line contains elements of array space separated. If not present then print "Not found" without quotes
<strong>Constraints</strong>:
1 <= T <= 100
1 <= N, X <= 10000
1 <= arr[i] <= 100000For each test case in new line you need to print all the positions where you find the X separated by space.
Assume 0-indexingInput:
2
5 6
2 3 6 5 6
4 3
2 4 6 5
Output:
2 4
Not found, I have written this Solution Code: def position(n,arr,x):
res = []
cnt = 0
for i in arr:
if(i == x):
res.append(cnt)
cnt += 1
return res
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer array <strong>arr[]</strong> of size <strong>N</strong> and an element <strong>X</strong>. The task is to find and print the indices of the given element if it is present in array if not then print “<strong>Not found</strong>” without quotes.
<strong>Note</strong>: The elements may be present more than once.The first line of input contains T, denoting the number of test cases.
The first line of each test case contains N and X, N is the size of array and X is an element. Second line contains elements of array space separated. If not present then print "Not found" without quotes
<strong>Constraints</strong>:
1 <= T <= 100
1 <= N, X <= 10000
1 <= arr[i] <= 100000For each test case in new line you need to print all the positions where you find the X separated by space.
Assume 0-indexingInput:
2
5 6
2 3 6 5 6
4 3
2 4 6 5
Output:
2 4
Not found, I have written this Solution Code: import java.util.*;
import java.io.*;
import java.lang.*;
class Main
{
public static void main (String[] args)throws IOException {
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
int t =Integer.parseInt(read.readLine());
while(t-- > 0)
{
String str[] = read.readLine().trim().split(" ");
int n = Integer.parseInt(str[0]);
int x = Integer.parseInt(str[1]);
int arr[] = new int[n];
str = read.readLine().trim().split(" ");
for(int i = 0; i < n; i++)
arr[i] = Integer.parseInt(str[i]);
findPositions(arr, n, x);
}
}
static void findPositions(int arr[], int n, int x)
{
boolean flag = false;
StringBuffer sb = new StringBuffer();
for(int i = 0; i < n; i++)
{
if(arr[i] == x)
{
sb.append(i + " ");
flag = true;
}
}
if(flag ==true)
System.out.println(sb.toString());
else System.out.println("Not found");
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sansa has discovered Theon is at Winterfell. Ramsay is forcing him to apologize to her for supposedly killing her younger brothers. But Sansa will accept the apology string S if it satisfies the following conditions for a given value of N:
<li> String S should have exactly <b>N distinct substrings</b>.
<li> Length of the string should be minimum possible.
<li> Among all shortest strings, S should be lexicographically smallest one.The first and the only line of input contains an integer N.
Constraints
1 <= N <= 300Output the apology string S.Sample Input
3
Sample Output
ab
Explanation: Distinct substrings of ab are: "a", "b", "ab"
Sample Input
7
Sample Output
aaab
Explanation: Distinct substrings of aaab are: "a", "b", "aa", "ab", "aaa", "aab", "aaab", I have written this Solution Code: n = int(input())
sz = 1
s = "a"
while sz*(sz+1) < 2*n:
s += chr(97+sz)
sz += 1
s = list(s)
rem = sz*(sz+1)//2 - n
i,c = 1,1
while i < len(s):
k = 1
while k*(k+1) <= 2*rem:
k+=1
k-=1
rem -= k*(k+1)//2
for j in range(i,i+k):
s[j]='a'
i += k
s[i] = chr(97+c)
c+=1
i += 1
print("".join(s)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sansa has discovered Theon is at Winterfell. Ramsay is forcing him to apologize to her for supposedly killing her younger brothers. But Sansa will accept the apology string S if it satisfies the following conditions for a given value of N:
<li> String S should have exactly <b>N distinct substrings</b>.
<li> Length of the string should be minimum possible.
<li> Among all shortest strings, S should be lexicographically smallest one.The first and the only line of input contains an integer N.
Constraints
1 <= N <= 300Output the apology string S.Sample Input
3
Sample Output
ab
Explanation: Distinct substrings of ab are: "a", "b", "ab"
Sample Input
7
Sample Output
aaab
Explanation: Distinct substrings of aaab are: "a", "b", "aa", "ab", "aaa", "aab", "aaab", I have written this Solution Code: import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
public static void process() throws IOException {
int n = sc.nextInt();
int len = 1;
while ((len*(len+1))/2 < n)len++;
StringBuilder ans = new StringBuilder("");
for(int i = 0; i< len; i++){
for(char ch = 'a'; ch <= 'z'; ch++){
StringBuilder tmp = new StringBuilder(ans);
tmp.append(ch);
char cc = 'z';
for(int j = i+1; j< len; j++){
tmp.append(cc--);
}
if(count(tmp.toString()) >= n){
ans.append(ch);
break;
}
}
}
System.out.println(ans.toString());
}
static int count(String S){
TreeSet<String> set = new TreeSet<>();
for(int i = 0; i< S.length(); i++)
for(int j = i; j< S.length(); j++)
set.add(S.substring(i, j+1));
return set.size();
}
private static long INF = 2000000000000000000L, M = 1000000007, MM = 998244353;
private static void google(int tt) {
System.out.print("Case #" + (tt) + ": ");
}
static FastScanner sc;
static PrintWriter out;
public static void main(String[] args) throws IOException {
boolean oj = true;
if (oj) {
sc = new FastScanner();
out = new PrintWriter(System.out);
} else {
sc = new FastScanner(100);
out = new PrintWriter("output.txt");
}
int t = 1;
int TTT = 1;
while (t-- > 0) {
process();
}
out.flush();
out.close();
}
static class Pair implements Comparable<Pair> {
int x, y;
Pair(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public int compareTo(Pair o) {
return Integer.compare(this.x, o.x);
}
}
static void debug(Object o) {
System.out.println(o);
}
static void debug(Object x, Object y) {
System.out.println("(" + x + " , " + y + ")");
}
static void println(Object o) {
out.println(o);
}
static void println(int[] o) {
for (int e : o)
print(e + " ");
println();
}
static void println(long[] o) {
for (long e : o)
print(e + " ");
println();
}
static void println() {
out.println();
}
static void print(Object o) {
out.print(o);
}
static void pflush(Object o) {
out.println(o);
out.flush();
}
static int ceil(int x, int y) {
return (x % y == 0 ? x / y : (x / y + 1));
}
static long ceil(long x, long y) {
return (x % y == 0 ? x / y : (x / y + 1));
}
static int max(int x, int y) {
return Math.max(x, y);
}
static int min(int x, int y) {
return Math.min(x, y);
}
static int abs(int x) {
return Math.abs(x);
}
static long abs(long x) {
return Math.abs(x);
}
static long sqrt(long z) {
long sqz = (long) Math.sqrt(z);
while (sqz * 1L * sqz < z) {
sqz++;
}
while (sqz * 1L * sqz > z) {
sqz--;
}
return sqz;
}
static int log2(int N) {
int result = (int) (Math.log(N) / Math.log(2));
return result;
}
static long max(long x, long y) {
return Math.max(x, y);
}
static long min(long x, long y) {
return Math.min(x, y);
}
public static int gcd(int a, int b) {
BigInteger b1 = BigInteger.valueOf(a);
BigInteger b2 = BigInteger.valueOf(b);
BigInteger gcd = b1.gcd(b2);
return gcd.intValue();
}
public static long gcd(long a, long b) {
BigInteger b1 = BigInteger.valueOf(a);
BigInteger b2 = BigInteger.valueOf(b);
BigInteger gcd = b1.gcd(b2);
return gcd.longValue();
}
public static long lcm(long a, long b) {
return (a * b) / gcd(a, b);
}
public static int lcm(int a, int b) {
return (a * b) / gcd(a, b);
}
public static int lower_bound(int[] arr, int x) {
int low = 0, high = arr.length, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] >= x)
high = mid;
else
low = mid + 1;
}
return low;
}
public static int upper_bound(int[] arr, int x) {
int low = 0, high = arr.length, mid = -1;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] > x)
high = mid;
else
low = mid + 1;
}
return low;
}
static class FastScanner {
BufferedReader br;
StringTokenizer st;
FastScanner() throws FileNotFoundException {
br = new BufferedReader(new InputStreamReader(System.in));
}
FastScanner(int a) throws FileNotFoundException {
br = new BufferedReader(new FileReader("input.txt"));
}
String next() throws IOException {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() throws IOException {
return Integer.parseInt(next());
}
long nextLong() throws IOException {
return Long.parseLong(next());
}
double nextDouble() throws IOException {
return Double.parseDouble(next());
}
String nextLine() throws IOException {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
int[] readArray(int n) throws IOException {
int[] A = new int[n];
for (int i = 0; i != n; i++) {
A[i] = sc.nextInt();
}
return A;
}
long[] readArrayLong(int n) throws IOException {
long[] A = new long[n];
for (int i = 0; i != n; i++) {
A[i] = sc.nextLong();
}
return A;
}
}
static void ruffleSort(int[] a) {
Random get = new Random();
for (int i = 0; i < a.length; i++) {
int r = get.nextInt(a.length);
int temp = a[i];
a[i] = a[r];
a[r] = temp;
}
Arrays.sort(a);
}
static void ruffleSort(long[] a) {
Random get = new Random();
for (int i = 0; i < a.length; i++) {
int r = get.nextInt(a.length);
long temp = a[i];
a[i] = a[r];
a[r] = temp;
}
Arrays.sort(a);
}
static void reverseArray(int[] a) {
int n = a.length;
int arr[] = new int[n];
for (int i = 0; i < n; i++)
arr[i] = a[n - i - 1];
for (int i = 0; i < n; i++)
a[i] = arr[i];
}
static void reverseArray(long[] a) {
int n = a.length;
long arr[] = new long[n];
for (int i = 0; i < n; i++)
arr[i] = a[n - i - 1];
for (int i = 0; i < n; i++)
a[i] = arr[i];
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sansa has discovered Theon is at Winterfell. Ramsay is forcing him to apologize to her for supposedly killing her younger brothers. But Sansa will accept the apology string S if it satisfies the following conditions for a given value of N:
<li> String S should have exactly <b>N distinct substrings</b>.
<li> Length of the string should be minimum possible.
<li> Among all shortest strings, S should be lexicographically smallest one.The first and the only line of input contains an integer N.
Constraints
1 <= N <= 300Output the apology string S.Sample Input
3
Sample Output
ab
Explanation: Distinct substrings of ab are: "a", "b", "ab"
Sample Input
7
Sample Output
aaab
Explanation: Distinct substrings of aaab are: "a", "b", "aa", "ab", "aaa", "aab", "aaab", I have written this Solution Code: #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
typedef unsigned long long ull;
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
int n;
int get(string s) {
set<string> all;
for (int i=0; i<sz(s); i++)
for (int l=1; l<=sz(s)-i; l++)
all.insert(s.substr(i,l));
return sz(all);
}
int getMin(int len, string cur) {
while (sz(cur)!=len)
cur+="a";
return get(cur);
}
int getMax(int len, string cur) {
char ch='z';
while (sz(cur)!=len) {
cur+=ch;
ch--;
}
return get(cur);
}
string solve(int len, string cur) {
if (sz(cur)==len) {
if (get(cur)==n) return cur;
return "";
}
if (getMin(len,cur)>n) return "";
if (getMax(len,cur)<n) return "";
for (char ch='a'; ch<='z'; ch++) {
string tmp=cur+ch;
string next=solve(len,tmp);
if (next!="") return next;
}
return "";
}
signed main(){
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
cin>>n;
for (int len=1; len<=26; len++) {
string res=solve(len,"");
if (res!="") {
cout<<res;
return 0;
}
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara is fond of ice cream initially she had N ice creams with her. If Sara eats exactly half of the ice cream she has in a day and the remaining icecreams get tripled each night. How many ice creams does Sara have at the end of D-days?
<b>Note:- </b>
Take the floor value while dividing by 2.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Icecreams()</b> that takes integers N and D as parameters.
<b>Constraints:-</b>
1 <= N <= 100
1 <= D <= 20Print a single integer denoting the number of ice creams at the end of D days.Sample Input 1:-
5 1
Sample Output 1:-
9
</b>Explanation:-</b>
Sara will eat 2 ice creams and the remaining 3 will be tripled i. e 9.
Sample Input 2:-
5 3
Sample Output 2:-
24
<b>Explanation:-</b>
Day 1:- N=5, eaten = 2, rem = 3 => remaining = 3*3 = 9
Day 2:- N=9, eaten = 4, rem = 5 => remaining = 5*3 = 15
Day 3:- N=15, eaten = 7, rem = 8 => remaining = 8*3 = 24, I have written this Solution Code: static void Icecreams (int N, int D){
int x=N;
while(D-->0){
x-=x/2;
x*=3;
}
System.out.println(x);
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara is fond of ice cream initially she had N ice creams with her. If Sara eats exactly half of the ice cream she has in a day and the remaining icecreams get tripled each night. How many ice creams does Sara have at the end of D-days?
<b>Note:- </b>
Take the floor value while dividing by 2.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Icecreams()</b> that takes integers N and D as parameters.
<b>Constraints:-</b>
1 <= N <= 100
1 <= D <= 20Print a single integer denoting the number of ice creams at the end of D days.Sample Input 1:-
5 1
Sample Output 1:-
9
</b>Explanation:-</b>
Sara will eat 2 ice creams and the remaining 3 will be tripled i. e 9.
Sample Input 2:-
5 3
Sample Output 2:-
24
<b>Explanation:-</b>
Day 1:- N=5, eaten = 2, rem = 3 => remaining = 3*3 = 9
Day 2:- N=9, eaten = 4, rem = 5 => remaining = 5*3 = 15
Day 3:- N=15, eaten = 7, rem = 8 => remaining = 8*3 = 24, I have written this Solution Code: void Icecreams (int N, int D){
int x=N;
while(D--){
x-=x/2;
x*=3;
}
cout << x;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara is fond of ice cream initially she had N ice creams with her. If Sara eats exactly half of the ice cream she has in a day and the remaining icecreams get tripled each night. How many ice creams does Sara have at the end of D-days?
<b>Note:- </b>
Take the floor value while dividing by 2.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Icecreams()</b> that takes integers N and D as parameters.
<b>Constraints:-</b>
1 <= N <= 100
1 <= D <= 20Print a single integer denoting the number of ice creams at the end of D days.Sample Input 1:-
5 1
Sample Output 1:-
9
</b>Explanation:-</b>
Sara will eat 2 ice creams and the remaining 3 will be tripled i. e 9.
Sample Input 2:-
5 3
Sample Output 2:-
24
<b>Explanation:-</b>
Day 1:- N=5, eaten = 2, rem = 3 => remaining = 3*3 = 9
Day 2:- N=9, eaten = 4, rem = 5 => remaining = 5*3 = 15
Day 3:- N=15, eaten = 7, rem = 8 => remaining = 8*3 = 24, I have written this Solution Code: void Icecreams (int N, int D){
int x=N;
while(D--){
x-=x/2;
x*=3;
}
printf("%d", x);
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara is fond of ice cream initially she had N ice creams with her. If Sara eats exactly half of the ice cream she has in a day and the remaining icecreams get tripled each night. How many ice creams does Sara have at the end of D-days?
<b>Note:- </b>
Take the floor value while dividing by 2.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Icecreams()</b> that takes integers N and D as parameters.
<b>Constraints:-</b>
1 <= N <= 100
1 <= D <= 20Print a single integer denoting the number of ice creams at the end of D days.Sample Input 1:-
5 1
Sample Output 1:-
9
</b>Explanation:-</b>
Sara will eat 2 ice creams and the remaining 3 will be tripled i. e 9.
Sample Input 2:-
5 3
Sample Output 2:-
24
<b>Explanation:-</b>
Day 1:- N=5, eaten = 2, rem = 3 => remaining = 3*3 = 9
Day 2:- N=9, eaten = 4, rem = 5 => remaining = 5*3 = 15
Day 3:- N=15, eaten = 7, rem = 8 => remaining = 8*3 = 24, I have written this Solution Code: def Icecreams(N,D):
ans = N
while D > 0:
ans = ans - ans//2
ans = ans*3
D = D-1
return ans
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alice's power is currently known to be an integer X. It is also known that her power doubles every second. For example, if Alice's power was currently 20, then after 2 seconds her power would have grown to 80.
Your task is to find out Alice's power after N seconds.The input consists of a single line containing two space-separated integers X and N.
<b>Constraints:</b>
1 ≤ X ≤ 1000
1 ≤ N ≤ 10Print a single integer – the power of Alice after N seconds.Sample Input 1:
5 2
Sample Output 1:
20
Sample Explanation 1:
Alice's power after 1 second will be 5*2 = 10. After 2 seconds it will be 10*2 = 20.
Sample Input 2:
4 3
Sample Output 2:
32, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s = br.readLine();
if(s==null){
System.exit(0);
}
StringTokenizer st = new StringTokenizer(s, " ");
int power = Integer.parseInt(st.nextToken());
int multiple = Integer.parseInt(st.nextToken());
int res = power;
for(int i = 1;i<=multiple;i++){
res = res*2;
}
System.out.println(res);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alice's power is currently known to be an integer X. It is also known that her power doubles every second. For example, if Alice's power was currently 20, then after 2 seconds her power would have grown to 80.
Your task is to find out Alice's power after N seconds.The input consists of a single line containing two space-separated integers X and N.
<b>Constraints:</b>
1 ≤ X ≤ 1000
1 ≤ N ≤ 10Print a single integer – the power of Alice after N seconds.Sample Input 1:
5 2
Sample Output 1:
20
Sample Explanation 1:
Alice's power after 1 second will be 5*2 = 10. After 2 seconds it will be 10*2 = 20.
Sample Input 2:
4 3
Sample Output 2:
32, I have written this Solution Code: #include <iostream>
using namespace std;
int main()
{
int x, n;
cin >> x >> n;
cout << x*(1 << n);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alice's power is currently known to be an integer X. It is also known that her power doubles every second. For example, if Alice's power was currently 20, then after 2 seconds her power would have grown to 80.
Your task is to find out Alice's power after N seconds.The input consists of a single line containing two space-separated integers X and N.
<b>Constraints:</b>
1 ≤ X ≤ 1000
1 ≤ N ≤ 10Print a single integer – the power of Alice after N seconds.Sample Input 1:
5 2
Sample Output 1:
20
Sample Explanation 1:
Alice's power after 1 second will be 5*2 = 10. After 2 seconds it will be 10*2 = 20.
Sample Input 2:
4 3
Sample Output 2:
32, I have written this Solution Code: x,n = map(int,input().split())
print(x*(2**n)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a queue of integers and N queries. Your the task is to perform these operations:-
enqueue:-this operation will add an element to your current queue.
dequeue:-this operation will delete the element from the starting of the queue
displayfront:-this operation will print the element presented at front
Note:-if queue is empty than dequeue operation will do nothing, and 0 will be printed as a front element of queue if it is empty.User task:
Since this will be a functional problem, you don't have to take input. You just have to complete the functions:
<b>enqueue()</b>:- that takes integer to be added as a parameter.
<b>dequeue()</b>:- that takes no parameter.
<b>displayfront()</b> :- that takes no parameter.
Constraints:
1 <= N(Number of queries) <= 10<sup>3</sup>You don't need to print anything else other than in displayfront() in which you require to print the element at front of your queue in a new line, if the queue is empty you just need to print 0.Sample Input:-
7
displayfront
enqueue 2
displayfront
enqueue 4
displayfront
dequeue
displayfront
Sample Output:-
0
2
2
4
Sample input:
5
enqueue 4
enqueue 5
displayfront
dequeue
displayfront
Sample output:-
4
5, I have written this Solution Code: class Queue
{
private Node front, rear;
private int currentSize;
class Node {
Node next;
int val;
Node(int val) {
this.val = val;
next = null;
}
}
public Queue()
{
front = null;
rear = null;
currentSize = 0;
}
public boolean isEmpty()
{
return (currentSize <= 0);
}
public void dequeue()
{
if (isEmpty())
{
}
else{
front = front.next;
currentSize--;
}
}
//Add data to the end of the list.
public void enqueue(int data)
{
Node oldRear = rear;
rear = new Node(data);
if (isEmpty())
{
front = rear;
}
else
{
oldRear.next = rear;
}
currentSize++;
}
public void displayfront(){
if(isEmpty()){
System.out.println("0");
}
else{
System.out.println(front.val);
}
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an array A of size N. You have to print the maximum in every <b>K-sized subarray</b> from the left to the right in the array A.
More formally, you have to print N - K + 1 integers X<sub>1</sub>, X<sub>2</sub>, ..., X<sub>N-K+1</sub> such that X<sub>i</sub> (1 <= i <= N - K + 1) is the maximum element in the subarray A<sub>i</sub>, A<sub>i+1</sub>, ..., A<sub>i+K-1</sub>.1. The first line contains an integer N, denoting the size of the array.
2. The second line has N space-separated integers of the array A.
3. The third line contains integer K, denoting the size of the sliding window
<b>Constraints :</b>
1 ≤ N ≤ 10<sup>5</sup>
-10<sup>4</sup> ≤ A[i] ≤ 10<sup>4</sup>
1 ≤ K ≤ NPrint the max of K numbers for each position of sliding windowSample Input:-
8
1 3 -1 -3 5 3 6 7
3
Sample Output:-
3 3 5 5 6 7
Explanation:-
Window position Max
- - - -
[1 3 -1] -3 5 3 6 7 3
1 [3 -1 -3] 5 3 6 7 3
1 3 [-1 -3 5] 3 6 7 5
1 3 -1 [-3 5 3] 6 7 5
1 3 -1 -3 [5 3 6] 7 6
1 3 -1 -3 5 [3 6 7] 7
Sample Input:-
1
1
1
Sample Output:-
1 , I have written this Solution Code: import java.io.*;
import java.util.*;
class Main
{
public static void main(String args[])throws Exception
{
BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb=new StringBuilder();
int n=Integer.parseInt(bu.readLine());
String s[]=bu.readLine().split(" ");
int a[]=new int[n],i;
PriorityQueue<int[]> pq=new PriorityQueue<>(new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
if(o1[0]<o2[0]) return 1;
else return -1;
}});
for(i=0;i<n;i++) a[i]=Integer.parseInt(s[i]);
int k=Integer.parseInt(bu.readLine());
for(i=0;i<k;i++) pq.add(new int[]{a[i],i});
sb.append(pq.peek()[0]+" ");
for(i=k;i<n;i++)
{
pq.add(new int[]{a[i],i});
while(!pq.isEmpty() && pq.peek()[1]<=i-k) pq.poll();
sb.append(pq.peek()[0]+" ");
}
System.out.println(sb);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an array A of size N. You have to print the maximum in every <b>K-sized subarray</b> from the left to the right in the array A.
More formally, you have to print N - K + 1 integers X<sub>1</sub>, X<sub>2</sub>, ..., X<sub>N-K+1</sub> such that X<sub>i</sub> (1 <= i <= N - K + 1) is the maximum element in the subarray A<sub>i</sub>, A<sub>i+1</sub>, ..., A<sub>i+K-1</sub>.1. The first line contains an integer N, denoting the size of the array.
2. The second line has N space-separated integers of the array A.
3. The third line contains integer K, denoting the size of the sliding window
<b>Constraints :</b>
1 ≤ N ≤ 10<sup>5</sup>
-10<sup>4</sup> ≤ A[i] ≤ 10<sup>4</sup>
1 ≤ K ≤ NPrint the max of K numbers for each position of sliding windowSample Input:-
8
1 3 -1 -3 5 3 6 7
3
Sample Output:-
3 3 5 5 6 7
Explanation:-
Window position Max
- - - -
[1 3 -1] -3 5 3 6 7 3
1 [3 -1 -3] 5 3 6 7 3
1 3 [-1 -3 5] 3 6 7 5
1 3 -1 [-3 5 3] 6 7 5
1 3 -1 -3 [5 3 6] 7 6
1 3 -1 -3 5 [3 6 7] 7
Sample Input:-
1
1
1
Sample Output:-
1 , I have written this Solution Code: N = int(input())
A = [int(x) for x in input().split()]
K = int(input())
def print_max(a, n, k):
max_upto = [0 for i in range(n)]
s = []
s.append(0)
for i in range(1, n):
while (len(s) > 0 and a[s[-1]] < a[i]):
max_upto[s[-1]] = i - 1
del s[-1]
s.append(i)
while (len(s) > 0):
max_upto[s[-1]] = n - 1
del s[-1]
j = 0
for i in range(n - k + 1):
while (j < i or max_upto[j] < i + k - 1):
j += 1
print(a[j], end=" ")
print()
print_max(A, N, K), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an array A of size N. You have to print the maximum in every <b>K-sized subarray</b> from the left to the right in the array A.
More formally, you have to print N - K + 1 integers X<sub>1</sub>, X<sub>2</sub>, ..., X<sub>N-K+1</sub> such that X<sub>i</sub> (1 <= i <= N - K + 1) is the maximum element in the subarray A<sub>i</sub>, A<sub>i+1</sub>, ..., A<sub>i+K-1</sub>.1. The first line contains an integer N, denoting the size of the array.
2. The second line has N space-separated integers of the array A.
3. The third line contains integer K, denoting the size of the sliding window
<b>Constraints :</b>
1 ≤ N ≤ 10<sup>5</sup>
-10<sup>4</sup> ≤ A[i] ≤ 10<sup>4</sup>
1 ≤ K ≤ NPrint the max of K numbers for each position of sliding windowSample Input:-
8
1 3 -1 -3 5 3 6 7
3
Sample Output:-
3 3 5 5 6 7
Explanation:-
Window position Max
- - - -
[1 3 -1] -3 5 3 6 7 3
1 [3 -1 -3] 5 3 6 7 3
1 3 [-1 -3 5] 3 6 7 5
1 3 -1 [-3 5 3] 6 7 5
1 3 -1 -3 [5 3 6] 7 6
1 3 -1 -3 5 [3 6 7] 7
Sample Input:-
1
1
1
Sample Output:-
1 , I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
vector<int> maxSwindow(vector<int>& arr, int k) {
vector<int> result;
deque<int> Q(k); // store the indices
// process the first window
for(int i = 0; i < k; i++) {
while(!Q.empty() and arr[i] >= arr[Q.back()])
Q.pop_back();
Q.push_back(i);
}
// process the remaining elements
for(int i = k; i < arr.size(); i++) {
// add the max of the current window
result.push_back(arr[Q.front()]);
// remove the elements going out of the window
while(!Q.empty() and Q.front() <= i - k)
Q.pop_front();
// remove the useless elements
while(!Q.empty() and arr[i] >= arr[Q.back()])
Q.pop_back();
// add the current element in the deque
Q.push_back(i);
}
result.push_back(arr[Q.front()]);
return result;
}
int main()
{
int k, n, m;
cin >> n;
vector<int> nums, res;
for(int i =0; i < n; i++){
cin >> m;
nums.push_back(m);
}
cin >> k;
res = maxSwindow(nums,k);
for(auto i = res.begin(); i!=res.end(); i++)
cout << *i << " ";
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.