Instruction
stringlengths 261
35k
| Response
stringclasses 1
value |
|---|---|
For this Question: There are N people in a line queuing to buy tickets, where the 0th person is at the front of the line and the (N - 1)<sup>th</sup> person is at the back of the line. You are given a 0- indexed integer array tickets of length N where the number of tickets that the i<sup>th</sup> person would like to buy is tickets[i]. Each person takes exactly 1 second to buy a ticket. A person can only buy 1 ticket at a time and has to go back to the end of the line (which happens instantaneously) in order to buy more tickets. If a person does not have any tickets left to buy, the person will leave the line. Find the time taken for the person at position K (0- indexed) to finish buying tickets.First line contains two integers N and K.
Next line contains N space separated integers.
Constraints
1 <= N <= 1000
0 <= K < N
1 <= tickets[i] <= 100
Print the time taken for the person at position K (0- indexed) to finish buying tickets.Sample Input 1:
3 2
2 3 2
Output
6
Explanation:
In the first pass, everyone in the line buys a ticket and the line becomes [1, 2, 1].
In the second pass, everyone in the line buys a ticket and the line becomes [0, 1, 0].
The person at position 2 has successfully bought 2 tickets and it took 3 + 3 = 6 seconds.
Sample Input 2:
4 0
5 1 1 1
Output
8
Explanation
In the first pass, everyone in the line buys a ticket and the line becomes [4, 0, 0, 0].
In the next 4 passes, only the person in position 0 is buying tickets.
The person at position 0 has successfully bought 5 tickets and it took 4 + 1 + 1 + 1 + 1 = 8 seconds., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main{
static class Solution {
class pair{//To store the index and the value
int index;
int value;
pair(int index, int value )//Parameterised Constructor
{
this.index= index;
this.value= value;
}
}
public int timeRequiredToBuy(int[] tickets, int k) {
Queue<pair> q= new ArrayDeque<>();
for ( int i= 0; i< tickets.length; i++){//Adding all the element
q.offer( new pair( i, tickets[i] ) );
}
int time= 0;
while (!q.isEmpty())
{
pair temp= q.poll();//removing element from the front of the Queue
time+= 1;//Increasing the timer
if ( temp.value > 1 ){
q.offer( new pair( temp.index, temp.value-1 ) );//adding the element into the queue
continue;
}
if ( temp.value == 1 ){//all tickets collected scineraio
if ( temp.index == k )//desired index
return time;
continue;
}
}
return time;
}
}
public static void main (String[] args)throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n,k;
String line = br.readLine();
String[] strs = line.trim().split("\\s+");
n=Integer.parseInt(strs[0]);
k=Integer.parseInt(strs[1]);
line = br.readLine();
strs = line.trim().split("\\s+");
int[] tickets=new int[n];
for(int i=0;i<n;i++){
tickets[i]=Integer.parseInt(strs[i]);
}
Solution obj=new Solution();
System.out.print(obj.timeRequiredToBuy(tickets,k));
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alice is rearranging her library. She takes the innermost shelf and reverses the order of books. She breaks the walls of the shelf. In the end, there will be only books and no shelf walls. Print the order of books.
Opening and closing walls of shelves are shown by '/' and '\' respectively whereas books are represented by lower case alphabets.The first line contains string s displaying her library.
<b>Constraints</b>
2 ≤ |s| ≤ 10<sup>3</sup>Print only one string displaying Alice's library after rearrangement.Sample input
/u/love\i\
Sample Output
iloveu
Explanation
/u/love\i\
Here Alice breaks the inner most shelf and reverse the order. So the library will be /uevoli\.
Now she breaks the outermost wall and reverses the order. So the library will be iloveu., I have written this Solution Code: import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
class Main {
private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) throws IOException {
char[] a = br.readLine().toCharArray();
int len = a.length;
while (true) {
int firstClosing = 0;
while (firstClosing < len && a[firstClosing] != '\\')
firstClosing++;
if (firstClosing == len) break;
int opening = firstClosing - 1;
while (a[opening] != '/') opening--;
for (int i = opening + 1, j = firstClosing - 1; i < j; i++, j--) {
char temp = a[i];
a[i] = a[j];
a[j] = temp;
}
len -= 2;
System.arraycopy(a, opening + 1, a, opening, firstClosing - opening - 1);
System.arraycopy(a, firstClosing + 1,
a, firstClosing - 1, a.length - firstClosing - 1);
}
System.out.println(new String(a, 0, len));
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alice is rearranging her library. She takes the innermost shelf and reverses the order of books. She breaks the walls of the shelf. In the end, there will be only books and no shelf walls. Print the order of books.
Opening and closing walls of shelves are shown by '/' and '\' respectively whereas books are represented by lower case alphabets.The first line contains string s displaying her library.
<b>Constraints</b>
2 ≤ |s| ≤ 10<sup>3</sup>Print only one string displaying Alice's library after rearrangement.Sample input
/u/love\i\
Sample Output
iloveu
Explanation
/u/love\i\
Here Alice breaks the inner most shelf and reverse the order. So the library will be /uevoli\.
Now she breaks the outermost wall and reverses the order. So the library will be iloveu., I have written this Solution Code: /**
* author: tourist1256
* created: 2022-07-02 00:18:09
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class key, class value, class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif
#define int long long
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int64_t random_long(long long l = LLONG_MIN, long long r = LLONG_MAX) {
uniform_int_distribution<int64_t> generator(l, r);
return generator(rng);
}
class Solution {
public:
void solve() {
string s;
cin >> s;
stack<char> st;
string ans = "";
for (int i = 0; i < s.size(); i++) {
if (s[i] == '\\') {
string temp = "";
while (st.top() != '/') {
temp += st.top();
st.pop();
}
st.pop();
if (st.empty()) {
ans = temp;
}
for (int j = 0; j < temp.size(); j++) {
st.push(temp[j]);
}
debug(temp);
continue;
}
st.push(s[i]);
}
cout << ans << "\n";
}
};
int32_t main() {
auto start = std::chrono::high_resolution_clock::now();
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
Solution solve = Solution();
solve.solve();
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\n";
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find all the numbers less than N which contains only digits 3, 4, and 5. Each digit should be present at least one time.The input contains a single integer N.
Constraints:-
1 <= N <= 1000000000Print the count of such numbers which contains only digits 3, 4, and 5.Sample Input:-
500
Sample Output:-
4
Explanation:-
345. 435. 453, 354
Sample Input:-
1000
Sample Output:-
6, 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);
long n = sc.nextLong();
int count = recursive(n, 0, false, false, false);
System.out.println(count);
}
private static int recursive(long n, long num, boolean three, boolean four, boolean five) {
if(num > n){
return 0;
}
int count = 0;
if(three && four && five){
count ++;
}
count += recursive(n, num*10 + 3, true, four, five);
count += recursive(n, num*10 + 4, three, true, five);
count += recursive(n, num*10 + 5, three, four, true);
return count;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find all the numbers less than N which contains only digits 3, 4, and 5. Each digit should be present at least one time.The input contains a single integer N.
Constraints:-
1 <= N <= 1000000000Print the count of such numbers which contains only digits 3, 4, and 5.Sample Input:-
500
Sample Output:-
4
Explanation:-
345. 435. 453, 354
Sample Input:-
1000
Sample Output:-
6, I have written this Solution Code: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
int ans = 0;
int n = 0;
int ok;
void dfs(ll x,int ok){
if(x > n) return;
if(ok==7) ans++;
dfs(x * 10 + 3,ok|1);
dfs(x * 10 + 4,ok|2);
dfs(x * 10 + 5,ok|4);
return;
}
int main(){
cin >> n;
int x = 0;
dfs(x,0);
cout << ans << 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 n, your task is to print a right-angle triangle pattern of consecutive numbers of height n.<b>User Task:</b>
Take only one user input <b>n</b> the height of right angle triangle.
Constraint:
1 ≤ n ≤100
Print a right angle triangle of numbers of height n.Sample Input:
5
Sample Output:
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5
Sample Input:
2
Sample Output:
1
1 2, I have written this Solution Code: import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int num = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
System.out.print(num + " ");
num++;
}
num=1;
System.out.println();
}
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers a and b, your task is to check following conditions:-
1. If a <= 10 and b >= 10 (Logical AND).
2. Atleast one from a or b will be even (Logical OR).
3. if a is not equal to b (Logical NOT).The first line of the input contains 2 integers a and b.
<b>Constraints:</b>
1 <= a, b <= 100Print the string <b>"true"</b> if the condition holds in each function else <b>"false"</b> .
Sample Input:-
3 12
Sample Output:-
true true true
Explanation
So a = 3 and b = 12, so a<=10 and b>=10 hence first condition true, a is not even but b is even so atleast one of them is even hence true, third a != b which is also true hence the final output comes true true true.
Sample Input:-
10 10
Sample Output:-
true true false
, I have written this Solution Code: a, b = list(map(int, input().split(" ")))
print(str(a <= 10 and b >= 10).lower(), end=' ')
print(str(a % 2 == 0 or b % 2 == 0).lower(), end=' ')
print(str(not a == b).lower()), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers a and b, your task is to check following conditions:-
1. If a <= 10 and b >= 10 (Logical AND).
2. Atleast one from a or b will be even (Logical OR).
3. if a is not equal to b (Logical NOT).The first line of the input contains 2 integers a and b.
<b>Constraints:</b>
1 <= a, b <= 100Print the string <b>"true"</b> if the condition holds in each function else <b>"false"</b> .
Sample Input:-
3 12
Sample Output:-
true true true
Explanation
So a = 3 and b = 12, so a<=10 and b>=10 hence first condition true, a is not even but b is even so atleast one of them is even hence true, third a != b which is also true hence the final output comes true true true.
Sample Input:-
10 10
Sample Output:-
true true false
, I have written this Solution Code: import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
class Main {
static boolean Logical_AND(int a, int b){
if(a<=10 && b>=10){
return true;}
return false;}
static boolean Logical_OR(int a, int b){
if(a%2==0 || b%2==0){
return true;}
return false;}
static boolean Logical_NOT(int a, int b){
if(a!=b){
return true;}
return false;}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a=in.nextInt();
int b=in.nextInt();
System.out.print(Logical_AND(a, b)+" ");
System.out.print(Logical_OR(a,b)+" ");
System.out.print(Logical_NOT(a,b)+" ");
}
}, 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 all the odd integers present in the array.First line of input contains a single integer N. The next line contains the N space separated integers.
Constraints:-
1 < = N < = 1000
1 < = Arr[i] < = 10000Print the sum of all the odd integers present in the array.Sample Input:-
4
1 2 3 4
Sample Output:-
4
Sample Input:-
2 4 6 8
Sample Output:-
0, I have written this Solution Code: n = int(input())
num = input().split(" ")
sums=0
for i in range(0,n):
if int(num[i])%2 != 0:
sums = sums + int(num[i])
print(sums), 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 all the odd integers present in the array.First line of input contains a single integer N. The next line contains the N space separated integers.
Constraints:-
1 < = N < = 1000
1 < = Arr[i] < = 10000Print the sum of all the odd integers present in the array.Sample Input:-
4
1 2 3 4
Sample Output:-
4
Sample Input:-
2 4 6 8
Sample Output:-
0, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a;
int sum=0;
for(int i=0;i<n;i++){
cin>>a;
if(a&1){sum+=a;}}
cout<<sum;
}
, In this Programming Language: C++, 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 all the odd integers present in the array.First line of input contains a single integer N. The next line contains the N space separated integers.
Constraints:-
1 < = N < = 1000
1 < = Arr[i] < = 10000Print the sum of all the odd integers present in the array.Sample Input:-
4
1 2 3 4
Sample Output:-
4
Sample Input:-
2 4 6 8
Sample Output:-
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 n = sc.nextInt();
int a[] = new int[n];
for(int i=0;i<n;i++){
a[i]=sc.nextInt();
}
int sum=0;
for(int i=0;i<n;i++){
if(a[i]%2==1){
sum+=a[i];
}
}
System.out.print(sum);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers ‘a’ and ‘m’. The task is to find modular multiplicative inverse of ‘a’ under modulo ‘m’.
Note: Print the smallest modular multiplicative inverse.First line of input contains a single integer T denoting number of test cases, next T lines contains two space separated integers depicting value of a and m.
Constraints :-
1 < = T < = 100
1 < = m < = 100
1 < = a < = mFor each test case, in a new line print the modular multiplicative inverse if exist else print -1.Sample Input:-
2
3 11
10 17
Sample Output:-
4
12, 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 t=Integer.parseInt(br.readLine().trim());
while(t-->0){
String str[]=br.readLine().trim().split(" ");
int a=Integer.parseInt(str[0]);
int m=Integer.parseInt(str[1]);
int b;
int flag=0;
for(b=1; b<m; b++){
if(((a%m)*(b%m))%m == 1){
flag=1;
break;
}
}
if(flag==0){
System.out.println(-1);
}else{
System.out.println(b);
}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers ‘a’ and ‘m’. The task is to find modular multiplicative inverse of ‘a’ under modulo ‘m’.
Note: Print the smallest modular multiplicative inverse.First line of input contains a single integer T denoting number of test cases, next T lines contains two space separated integers depicting value of a and m.
Constraints :-
1 < = T < = 100
1 < = m < = 100
1 < = a < = mFor each test case, in a new line print the modular multiplicative inverse if exist else print -1.Sample Input:-
2
3 11
10 17
Sample Output:-
4
12, I have written this Solution Code: def modInverse(a, m):
for x in range(1, m):
if (((a%m)*(x%m) % m )== 1):
return x
return -1
t = int(input())
for i in range(t):
a ,m = map(int , input().split())
print(modInverse(a, m)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers ‘a’ and ‘m’. The task is to find modular multiplicative inverse of ‘a’ under modulo ‘m’.
Note: Print the smallest modular multiplicative inverse.First line of input contains a single integer T denoting number of test cases, next T lines contains two space separated integers depicting value of a and m.
Constraints :-
1 < = T < = 100
1 < = m < = 100
1 < = a < = mFor each test case, in a new line print the modular multiplicative inverse if exist else print -1.Sample Input:-
2
3 11
10 17
Sample Output:-
4
12, 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 100001
#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);
}
int modInverseNaive(int a, int m) {
a %= m;
for (int x = 1; x < m; x++) {
if ((a*x) % m == 1) return x;
}
return -1;
}
signed main() {
int t;
cin >> t;
while (t-- > 0) {
int a,m;
cin >> a >> m;
cout << modInverseNaive(a, m) << '\n';
}
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Ram is studying in Class V and has four subjects, each subject carry 100 marks. He passed with flying colors in his exam, but when his neighbour asked how much percentage did he got in exam, he got stuck in calculation. Ram is a good student but he forgot how to calculate percentage. Help Ram to get him out of this problem.
Given four numbers a , b , c and d denoting the marks in four subjects . Calculate the overall percentage (floor value ) Ram got in exam .First line contains four variables a, b, c and d.
<b>Constraints</b>
1<= a, b, c, d <= 100
Print single line containing the percentage.Sample Input 1:
25 25 25 25
Sample Output 1:
25
Sample Input 2:
75 25 75 25
Sample Output 2:
50, 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));
String str[]=br.readLine().split(" ");
int a[]=new int[str.length];
int sum=0;
for(int i=0;i<str.length;i++)
{
a[i]=Integer.parseInt(str[i]);
sum=sum+a[i];
}
System.out.println(sum/4);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Ram is studying in Class V and has four subjects, each subject carry 100 marks. He passed with flying colors in his exam, but when his neighbour asked how much percentage did he got in exam, he got stuck in calculation. Ram is a good student but he forgot how to calculate percentage. Help Ram to get him out of this problem.
Given four numbers a , b , c and d denoting the marks in four subjects . Calculate the overall percentage (floor value ) Ram got in exam .First line contains four variables a, b, c and d.
<b>Constraints</b>
1<= a, b, c, d <= 100
Print single line containing the percentage.Sample Input 1:
25 25 25 25
Sample Output 1:
25
Sample Input 2:
75 25 75 25
Sample Output 2:
50, I have written this Solution Code: a,b,c,d = map(int,input().split())
print((a+b+c+d)*100//400), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Yash has a class test. There's a question that is worth X points. Yash finds that the question has 10 test cases for it. It is given that, every test case carries the same number of points. N of the test cases are passed by Yash. Find the marks he will get.The first line will contain T, the number of test cases. Then the test cases follow. Each test case contains of a single line of input, two integers X and N, the total points for the problem, and the number of test cases which pass for Yash's solution.
<b>Constraints</b>
1 ≤ T ≤ 100
10 ≤ X ≤ 200
0 ≤ N ≤ 10
X is a multiple of 10.For each test case, output the points scored by Yash.Sample Input :
4
10 3
100 10
130 4
70 0
Sample Output :
3
100
52
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
{
// your code goes here
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while (t-- > 0)
System.out.println(sc.nextInt()/10 * sc.nextInt());
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Yash has a class test. There's a question that is worth X points. Yash finds that the question has 10 test cases for it. It is given that, every test case carries the same number of points. N of the test cases are passed by Yash. Find the marks he will get.The first line will contain T, the number of test cases. Then the test cases follow. Each test case contains of a single line of input, two integers X and N, the total points for the problem, and the number of test cases which pass for Yash's solution.
<b>Constraints</b>
1 ≤ T ≤ 100
10 ≤ X ≤ 200
0 ≤ N ≤ 10
X is a multiple of 10.For each test case, output the points scored by Yash.Sample Input :
4
10 3
100 10
130 4
70 0
Sample Output :
3
100
52
0, I have written this Solution Code: #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class key, class value, class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif
#define int long long
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int64_t random_long(long long l = LLONG_MIN, long long r = LLONG_MAX) {
uniform_int_distribution<int64_t> generator(l, r);
return generator(rng);
}
// operator overload of << for vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (const auto &x : v)
os << x << " ";
return os;
}
int32_t main() {
ios_base::sync_with_stdio(true);
cin.tie(nullptr);
cout.tie(nullptr);
auto start = std::chrono::high_resolution_clock::now();
int tt;
cin >> tt;
while (tt--) {
int x, n;
cin >> x >> n;
cout << (n * x) / 10 << "\n";
}
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\n";
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Shreya has two integers A and B (A ≤ B). Shreya can choose any non- negative integer X and add them to both A and B. Find whether it is possible to make A a divisor of B.The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of two integers A and B.
<b>Constraints</b>
1 ≤ T ≤ 10<sup>5</sup>
1 ≤ A ≤ B ≤ 10<sup>9</sup>For each test case, output YES if it is possible to make A a factor of B, NO otherwise.Sample Input :
3
3 6
4 14
9 10
Sample Output :
YES
YES
NO
Explanation :
<ul><li>We can choose X = 0 and add them to 3 and 6. Thus, 3 is a factor of 6. </li><li>We can choose X = 1 and add them to 4 and 14. Thus, 4 + 1 = 5 is a factor of 14 + 1 = 15. </li><li>There is no possible value of X to add such that A becomes a factor of B. </li>, I have written this Solution Code: #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class key, class value, class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif
#define int long long
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int64_t random_long(long long l = LLONG_MIN, long long r = LLONG_MAX) {
uniform_int_distribution<int64_t> generator(l, r);
return generator(rng);
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
auto start = std::chrono::high_resolution_clock::now();
int tt;
cin >> tt;
while (tt--) {
int x, y;
cin >> x >> y;
if (y % x == 0)
cout << "YES\n";
else if ((y - x) >= x)
cout << "YES\n";
else
cout << "NO\n";
}
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\n";
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each I (1 < = I < = N), you have to print the number except:-
For each multiple of 3, print "Fizz" instead of the number.
For each multiple of 5, print "Buzz" instead of the number.
For numbers that are multiples of both 3 and 5, print "FizzBuzz" instead of the number.The input contains a single integer N.
<b>Constraints:-</b>
1 ≤ N ≤ 1000Print N space separated number or Fizz buzz according to the condition.Sample Input:-
3
Sample Output:-
1 2 Fizz
Sample Input:-
5
Sample Output:-
1 2 Fizz 4 Buzz, I have written this Solution Code: void fizzbuzz(int n){
for(int i=1;i<=n;i++){
if(i%3==0 && i%5==0){cout<<"FizzBuzz"<<" ";}
else if(i%5==0){cout<<"Buzz ";}
else if(i%3==0){cout<<"Fizz ";}
else{cout<<i<<" ";}
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each I (1 < = I < = N), you have to print the number except:-
For each multiple of 3, print "Fizz" instead of the number.
For each multiple of 5, print "Buzz" instead of the number.
For numbers that are multiples of both 3 and 5, print "FizzBuzz" instead of the number.The input contains a single integer N.
<b>Constraints:-</b>
1 ≤ N ≤ 1000Print N space separated number or Fizz buzz according to the condition.Sample Input:-
3
Sample Output:-
1 2 Fizz
Sample Input:-
5
Sample Output:-
1 2 Fizz 4 Buzz, 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 x= sc.nextInt();
fizzbuzz(x);
}
static void fizzbuzz(int n){
for(int i=1;i<=n;i++){
if(i%3==0 && i%5==0){System.out.print("FizzBuzz ");}
else if(i%5==0){System.out.print("Buzz ");}
else if(i%3==0){System.out.print("Fizz ");}
else{System.out.print(i+" ");}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each I (1 < = I < = N), you have to print the number except:-
For each multiple of 3, print "Fizz" instead of the number.
For each multiple of 5, print "Buzz" instead of the number.
For numbers that are multiples of both 3 and 5, print "FizzBuzz" instead of the number.The input contains a single integer N.
<b>Constraints:-</b>
1 ≤ N ≤ 1000Print N space separated number or Fizz buzz according to the condition.Sample Input:-
3
Sample Output:-
1 2 Fizz
Sample Input:-
5
Sample Output:-
1 2 Fizz 4 Buzz, I have written this Solution Code: def fizzbuzz(n):
for i in range (1,n+1):
if (i%3==0 and i%5==0):
print("FizzBuzz",end=' ')
elif i%3==0:
print("Fizz",end=' ')
elif i%5==0:
print("Buzz",end=' ')
else:
print(i,end=' '), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each I (1 < = I < = N), you have to print the number except:-
For each multiple of 3, print "Fizz" instead of the number.
For each multiple of 5, print "Buzz" instead of the number.
For numbers that are multiples of both 3 and 5, print "FizzBuzz" instead of the number.The input contains a single integer N.
<b>Constraints:-</b>
1 ≤ N ≤ 1000Print N space separated number or Fizz buzz according to the condition.Sample Input:-
3
Sample Output:-
1 2 Fizz
Sample Input:-
5
Sample Output:-
1 2 Fizz 4 Buzz, I have written this Solution Code: void fizzbuzz(int n){
for(int i=1;i<=n;i++){
if(i%3==0 && i%5==0){printf("FizzBuzz ");}
else if(i%5==0){printf("Buzz ");}
else if(i%3==0){printf("Fizz ");}
else{printf("%d ",i);}
}
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a side of a square, your task is to calculate its area.<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>Area()</b> that takes the side of the square as a parameter.Return the area of the squareSample Input:-
3
Sample Output:-
9
Sample Input:-
6
Sample Output:-
36
, I have written this Solution Code: static int Area(int side){
return side*side;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array Arr of N elements. Find the maximum value of GCD(Arr[i], Arr[j]) where i != j.First line of input contains a single integer N.
Second line of input contains N space separated integers, denoting array Arr.
Constraints:
2 <= N <= 100000
1 <= Arr[i] <= 100000Print the maximum value of GCD(Arr[i], Arr[j]) where i != j.Sample Input 1
5
2 4 5 2 2
Sample Output 1
2
Explanation: We can select index 1 and index 4, GCD(2, 2) = 2
Sample Input 2
6
4 3 4 1 6 5
Sample Output 2
4, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static int result(int a[],int n)
{
int maxe =0;
for(int i=0;i<n;i++)
maxe = Math.max(maxe,a[i]);
int count[]=new int[maxe+1];
for(int i=0;i<n;i++)
{
for(int j=1;j<Math.sqrt(a[i]);j++)
{
if(a[i]%j==0)
{
count[j]++;
if (j != a[i] / j)
count[a[i] / j]++;
}
}
}
for(int i=maxe;i>0;i--)
{
if(count[i]>1)
return i;
}
return 1;
}
public static void main (String[] args) throws IOException{
InputStreamReader i = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(i);
int n = Integer.parseInt(br.readLine());
int a[] = new int[n];
String str = br.readLine();
String[] strs = str.trim().split(" ");
for (int j = 0; j < n; j++)
{
a[j] = Integer.parseInt(strs[j]);
}
System.out.println(result(a,n));
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array Arr of N elements. Find the maximum value of GCD(Arr[i], Arr[j]) where i != j.First line of input contains a single integer N.
Second line of input contains N space separated integers, denoting array Arr.
Constraints:
2 <= N <= 100000
1 <= Arr[i] <= 100000Print the maximum value of GCD(Arr[i], Arr[j]) where i != j.Sample Input 1
5
2 4 5 2 2
Sample Output 1
2
Explanation: We can select index 1 and index 4, GCD(2, 2) = 2
Sample Input 2
6
4 3 4 1 6 5
Sample Output 2
4, 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();
//////////////
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 v[100001]={};
int n;
cin>>n;
for(int i=1;i<=n;++i){
int d;
cin>>d;
for(int j=1;j*j<=d;++j){
if(d%j==0){
v[j]++;
if(j!=d/j)
v[d/j]++;
}
}
}
for(int i=100000;i>=1;--i)
if(v[i]>1){
cout<<i;
return 0;
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: English Team has now adopted a rotation policy for two of their players: Dom and Leach.
On the first day, both of them played but, from the second day onwards, Dom plays every second day, while Leach plays every third day.
For example, on:
Day 1 - Both players play,
Day 2 - Neither of them plays,
Day 3 - Only Dom plays,
Day 4 - Only Leach plays,
Day 5 - Only Dom plays,
Day 6 - Neither of them plays,
Day 7 - Both the players play.. and so on.
Find the number of days in the interval [A, B] (A and B, both inclusive) when neither Dom nor Leach plays.<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>RotationPolicy()</b> that takes integers A, and B as arguments.
Constraints:-
1 <= A, B <=100000Return the number of days when neither of the two players played the game.Sample Input:-
3 8
Sample Output:-
2
Sample Input:-
1 4
Sample Output:-
1, I have written this Solution Code:
int RotationPolicy(int A, int B){
int cnt=0;
for(int i=A;i<=B;i++){
if((i-1)%2!=0 && (i-1)%3!=0){cnt++;}
}
return cnt;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: English Team has now adopted a rotation policy for two of their players: Dom and Leach.
On the first day, both of them played but, from the second day onwards, Dom plays every second day, while Leach plays every third day.
For example, on:
Day 1 - Both players play,
Day 2 - Neither of them plays,
Day 3 - Only Dom plays,
Day 4 - Only Leach plays,
Day 5 - Only Dom plays,
Day 6 - Neither of them plays,
Day 7 - Both the players play.. and so on.
Find the number of days in the interval [A, B] (A and B, both inclusive) when neither Dom nor Leach plays.<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>RotationPolicy()</b> that takes integers A, and B as arguments.
Constraints:-
1 <= A, B <=100000Return the number of days when neither of the two players played the game.Sample Input:-
3 8
Sample Output:-
2
Sample Input:-
1 4
Sample Output:-
1, I have written this Solution Code:
int RotationPolicy(int A, int B){
int cnt=0;
for(int i=A;i<=B;i++){
if((i-1)%2!=0 && (i-1)%3!=0){cnt++;}
}
return cnt;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: English Team has now adopted a rotation policy for two of their players: Dom and Leach.
On the first day, both of them played but, from the second day onwards, Dom plays every second day, while Leach plays every third day.
For example, on:
Day 1 - Both players play,
Day 2 - Neither of them plays,
Day 3 - Only Dom plays,
Day 4 - Only Leach plays,
Day 5 - Only Dom plays,
Day 6 - Neither of them plays,
Day 7 - Both the players play.. and so on.
Find the number of days in the interval [A, B] (A and B, both inclusive) when neither Dom nor Leach plays.<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>RotationPolicy()</b> that takes integers A, and B as arguments.
Constraints:-
1 <= A, B <=100000Return the number of days when neither of the two players played the game.Sample Input:-
3 8
Sample Output:-
2
Sample Input:-
1 4
Sample Output:-
1, I have written this Solution Code: static int RotationPolicy(int A, int B){
int cnt=0;
for(int i=A;i<=B;i++){
if((i-1)%2!=0 && (i-1)%3!=0){cnt++;}
}
return cnt;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: English Team has now adopted a rotation policy for two of their players: Dom and Leach.
On the first day, both of them played but, from the second day onwards, Dom plays every second day, while Leach plays every third day.
For example, on:
Day 1 - Both players play,
Day 2 - Neither of them plays,
Day 3 - Only Dom plays,
Day 4 - Only Leach plays,
Day 5 - Only Dom plays,
Day 6 - Neither of them plays,
Day 7 - Both the players play.. and so on.
Find the number of days in the interval [A, B] (A and B, both inclusive) when neither Dom nor Leach plays.<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>RotationPolicy()</b> that takes integers A, and B as arguments.
Constraints:-
1 <= A, B <=100000Return the number of days when neither of the two players played the game.Sample Input:-
3 8
Sample Output:-
2
Sample Input:-
1 4
Sample Output:-
1, I have written this Solution Code:
def RotationPolicy(A, B):
cnt=0
for i in range (A,B+1):
if(i-1)%2!=0 and (i-1)%3!=0:
cnt=cnt+1
return cnt
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: English Team has now adopted a rotation policy for two of their players: Dom and Leach.
On the first day, both of them played but, from the second day onwards, Dom plays every second day, while Leach plays every third day.
For example, on:
Day 1 - Both players play,
Day 2 - Neither of them plays,
Day 3 - Only Dom plays,
Day 4 - Only Leach plays,
Day 5 - Only Dom plays,
Day 6 - Neither of them plays,
Day 7 - Both the players play.. and so on.
Find the number of days in the interval [A, B] (A and B, both inclusive) when neither Dom nor Leach plays.<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>RotationPolicy()</b> that takes integers A, and B as arguments.
Constraints:-
1 <= A, B <=100000Return the number of days when neither of the two players played the game.Sample Input:-
3 8
Sample Output:-
2
Sample Input:-
1 4
Sample Output:-
1, I have written this Solution Code: function RotationPolicy(a, b) {
// write code here
// do no console.log the answer
// return the output using return keyword
let count = 0
for (let i = a; i <= b; i++) {
if((i-1)%2 !== 0 && (i-1)%3 !==0){
count++
}
}
return count
}
, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a singly linked list consisting of N Nodes, your task is to convert it into a circular linked list.
Note:- For custom input you will get 1 if your code is correct else you get a 0.
<b>Note:</b>Examples in Sample Input and Output just shows how a linked list will look like depending on the questions. Do not copy-paste as it is in <b>custom input</b><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>MakeCircular()</b> that takes head node of singly linked list as parameter.
Constraints:
1 <=N <= 1000
1 <= Node. data<= 1000Return the head node of the circular linked list.Sample Input 1:-
1- >2- >3
Sample Output 1:-
1- >2- >3- >1
Sample Input 2:-
1- >3- >2
Sample Output 2:-
1- >3- >2- >1, I have written this Solution Code: public static Node MakeCircular(Node head) {
Node temp=head;
while(temp.next!=null){
temp=temp.next;}
temp.next=head;
return head;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara's brother gives her a string representing chocolates and candies in a row. Sara loves eating candies before chocolates so she wants to rearrange the given string so that all the candies come before chocolates. Help her to rearrange the string.
You are allowed only 1 type of operation as many times as you want. You can swap all existing pair of candy and chocolate in a second if they are consecutive and chocolate is before candy, that means in one second you can swap all the i-th value with i+1 if and only if the i-th position has chocolate and the i+1 has candy.
Given the String S, find the minimum time needed to rearrange the given string.Input contains a single line containing the string S.
Constraints:-
1 <= |S| <= 1000000
Note:- String will contain only characters 'M' and 'F' where M represents chocolate while F represents candy.Print the minimum time needed to rearrange the given string such that all candies come before chocolates.Sample Input:-
MMFF
Sample Output:-
3
Explanation:-
MMFF - > MFMF - > FMFM - > FFMM
Sample Input:-
MFMFMF
Sample Output:-
3
Explanation:-
MFMFMF -> FMFMFM -> FFMFMM -> FFFMMM, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
String s;
InputStreamReader r=new InputStreamReader(System.in);
BufferedReader br=new BufferedReader(r);
s = br.readLine();
int c=0, t=0;
for(int i=0;i<s.length();i++) {
if(s.charAt(i) == 'F'){
if(i-c<=t && t!=0)
t++;
else
t=i-c;
c++;
}
}
System.out.println(t);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara's brother gives her a string representing chocolates and candies in a row. Sara loves eating candies before chocolates so she wants to rearrange the given string so that all the candies come before chocolates. Help her to rearrange the string.
You are allowed only 1 type of operation as many times as you want. You can swap all existing pair of candy and chocolate in a second if they are consecutive and chocolate is before candy, that means in one second you can swap all the i-th value with i+1 if and only if the i-th position has chocolate and the i+1 has candy.
Given the String S, find the minimum time needed to rearrange the given string.Input contains a single line containing the string S.
Constraints:-
1 <= |S| <= 1000000
Note:- String will contain only characters 'M' and 'F' where M represents chocolate while F represents candy.Print the minimum time needed to rearrange the given string such that all candies come before chocolates.Sample Input:-
MMFF
Sample Output:-
3
Explanation:-
MMFF - > MFMF - > FMFM - > FFMM
Sample Input:-
MFMFMF
Sample Output:-
3
Explanation:-
MFMFMF -> FMFMFM -> FFMFMM -> FFFMMM, I have written this Solution Code: n = input()
t = 0
c = 0
for i in range(len(n)):
if(n[i]=='F'):
if((i-c)<=t and t!=0):
t +=1
else:
t=i-c
c +=1
print(t), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara's brother gives her a string representing chocolates and candies in a row. Sara loves eating candies before chocolates so she wants to rearrange the given string so that all the candies come before chocolates. Help her to rearrange the string.
You are allowed only 1 type of operation as many times as you want. You can swap all existing pair of candy and chocolate in a second if they are consecutive and chocolate is before candy, that means in one second you can swap all the i-th value with i+1 if and only if the i-th position has chocolate and the i+1 has candy.
Given the String S, find the minimum time needed to rearrange the given string.Input contains a single line containing the string S.
Constraints:-
1 <= |S| <= 1000000
Note:- String will contain only characters 'M' and 'F' where M represents chocolate while F represents candy.Print the minimum time needed to rearrange the given string such that all candies come before chocolates.Sample Input:-
MMFF
Sample Output:-
3
Explanation:-
MMFF - > MFMF - > FMFM - > FFMM
Sample Input:-
MFMFMF
Sample Output:-
3
Explanation:-
MFMFMF -> FMFMFM -> FFMFMM -> FFFMMM, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int c=0,t=0;
for(int i=0;i<s.length();i++){
if(s[i]=='F'){
if(i-c<=t&&t) t++;
else t=i-c;
c++;
}
}
cout<<t;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Swapnil is challenged to build a tower of a height greater than or equal to N. To build the tower he is given blocks of heights which are powers of 3. He can only use one type of block only once and is given infinite types of blocks. Help him make a tower of minimum height just greater than or equal to N.The first line of the input contains one integer T the number of tests. Then T test cases follow.
Each test case contains a single integer N.
<b>Constraints:-</b>
1 ≤ t ≤ 100
0 ≤ N ≤ 10<sup>18</sup>For each test case, print the height of the minimum possible tower greater than or equal to N.Sample Input
5
1
8
4
6
5
Sample Output
1
9
4
9
9
<b>Explanation:</b>
N=1 => use one brick of height 3<sup>0</sup>
N=8 => use one brick of height 3<sup>2</sup>
N=4 => use two bricks of heights 3<sup>0</sup> and 3<sup>1</sup>
N=6 => use one brick of height 3<sup>2</sup>. We can not use 2 bricks of the same type so can't use two bricks of height 3<sup>1</sup>., I have written this Solution Code: import math as m
def closestNum(n):
val = m.log(n, 3)
low = int(pow(3,int(val)))
high = int(pow(3,int(val)+1))
sumn = int((pow(3,int(val)+1)-1)//2)
if(n > sumn):
return high
elif(n - low == 0):
return low
else:
return low + closestNum(n-low);
t = int(input())
while(t > 0):
n = int(input())
print(closestNum(n))
t = t-1, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Swapnil is challenged to build a tower of a height greater than or equal to N. To build the tower he is given blocks of heights which are powers of 3. He can only use one type of block only once and is given infinite types of blocks. Help him make a tower of minimum height just greater than or equal to N.The first line of the input contains one integer T the number of tests. Then T test cases follow.
Each test case contains a single integer N.
<b>Constraints:-</b>
1 ≤ t ≤ 100
0 ≤ N ≤ 10<sup>18</sup>For each test case, print the height of the minimum possible tower greater than or equal to N.Sample Input
5
1
8
4
6
5
Sample Output
1
9
4
9
9
<b>Explanation:</b>
N=1 => use one brick of height 3<sup>0</sup>
N=8 => use one brick of height 3<sup>2</sup>
N=4 => use two bricks of heights 3<sup>0</sup> and 3<sup>1</sup>
N=6 => use one brick of height 3<sup>2</sup>. We can not use 2 bricks of the same type so can't use two bricks of height 3<sup>1</sup>., 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;
int p[N], s[N];
int f(int x){
if(x <= 0)
return 0;
int ans = 0;
for(int i = 0; i <= 39; i++){
if(s[i] >= x){
ans = p[i] + f(x-p[i]);
break;
}
}
return ans;
}
signed main() {
IOS;
int t; cin >> t;
p[0] = s[0] = 1;
for(int i = 1; i <= 39; i++){
p[i] = 3*p[i-1];
s[i] = s[i-1] + p[i];
}
while(t--){
int n; cin >> n;
cout << f(n) << endl;
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Swapnil is challenged to build a tower of a height greater than or equal to N. To build the tower he is given blocks of heights which are powers of 3. He can only use one type of block only once and is given infinite types of blocks. Help him make a tower of minimum height just greater than or equal to N.The first line of the input contains one integer T the number of tests. Then T test cases follow.
Each test case contains a single integer N.
<b>Constraints:-</b>
1 ≤ t ≤ 100
0 ≤ N ≤ 10<sup>18</sup>For each test case, print the height of the minimum possible tower greater than or equal to N.Sample Input
5
1
8
4
6
5
Sample Output
1
9
4
9
9
<b>Explanation:</b>
N=1 => use one brick of height 3<sup>0</sup>
N=8 => use one brick of height 3<sup>2</sup>
N=4 => use two bricks of heights 3<sup>0</sup> and 3<sup>1</sup>
N=6 => use one brick of height 3<sup>2</sup>. We can not use 2 bricks of the same type so can't use two bricks of height 3<sup>1</sup>., I have written this Solution Code: import java.io.*;
import java.lang.*;
class Main
{
public static void main(String args[])throws IOException
{
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
int t = Integer.parseInt(br.readLine());
while(t-- >0)
{
long n = Long.parseLong(br.readLine());
if(n == 0)
{
System.out.println(1);
continue;
}
System.out.println(powerOfThree(n));
}
}
public static long powerOfThree(long n)
{
if(n<=0)
return 0;
long p = (long)(Math.log(n)/Math.log(3));
if(gpSum(p)>=n)
return power(3,p) + powerOfThree(n - power(3,p));
else
return power(3,p+1);
}
public static long gpSum(long p)
{
return (power(3,p+1)-1)/2;
}
public static long power(long base, long p)
{
if(p==0)
return 1;
else
return(base*power(base,p-1));
}
}, 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, you need to find its maximum, 2<sup>nd</sup> maximum and 3<sup>rd</sup> maximum element.
Try solving it in O(N) per test caseThe first line of the input contains the number of test cases T.
For each test case, the first line of the input contains an integer N denoting the number of elements in the array A. The following line contains N (space-separated) elements of A.
<b>Constraints:</b>
1 <= T <= 100
3 <= N <= 10<sup>6</sup>
1 <= A[i] <= 10<sup>9</sup>
<b>Note</b>:-It is guaranteed that the sum of N over all text cases does not exceed 10<sup>6</sup>For each test case, output the first, second and third maximum elements in the array.Sample Input:
3
5
1 4 2 4 5
6
1 3 5 7 9 8
7
11 22 33 44 55 66 77
Sample Output:
5 4 4
9 8 7
77 66 55
<b>Explanation:</b>
Testcase 1:
[1 4 2 4 5]
First max = 5
Second max = 4
Third max = 4, 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 T= sc.nextInt();
for(int i=0;i<T;i++){
int arrsize=sc.nextInt();
int max=0,secmax=0,thirdmax=0,j;
for(int k=0;k<arrsize;k++){
j=sc.nextInt();
if(j>max){
thirdmax=secmax;
secmax=max;
max=j;
}
else if(j>secmax){
thirdmax=secmax;
secmax=j;
}
else if(j>thirdmax){
thirdmax=j;
}
if(k%10000==0){
System.gc();
}
}
System.out.println(max+" "+secmax+" "+thirdmax+" ");
}
}
}, 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, you need to find its maximum, 2<sup>nd</sup> maximum and 3<sup>rd</sup> maximum element.
Try solving it in O(N) per test caseThe first line of the input contains the number of test cases T.
For each test case, the first line of the input contains an integer N denoting the number of elements in the array A. The following line contains N (space-separated) elements of A.
<b>Constraints:</b>
1 <= T <= 100
3 <= N <= 10<sup>6</sup>
1 <= A[i] <= 10<sup>9</sup>
<b>Note</b>:-It is guaranteed that the sum of N over all text cases does not exceed 10<sup>6</sup>For each test case, output the first, second and third maximum elements in the array.Sample Input:
3
5
1 4 2 4 5
6
1 3 5 7 9 8
7
11 22 33 44 55 66 77
Sample Output:
5 4 4
9 8 7
77 66 55
<b>Explanation:</b>
Testcase 1:
[1 4 2 4 5]
First max = 5
Second max = 4
Third max = 4, I have written this Solution Code: t=int(input())
while t>0:
t-=1
n=int(input())
l=list(map(int,input().strip().split()))
li=[0,0,0]
for i in l:
x=i
for j in range(0,3):
y=min(x,li[j])
li[j]=max(x,li[j])
x=y
print(li[0],end=" ")
print(li[1],end=" ")
print(li[2]), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of size N, you need to find its maximum, 2<sup>nd</sup> maximum and 3<sup>rd</sup> maximum element.
Try solving it in O(N) per test caseThe first line of the input contains the number of test cases T.
For each test case, the first line of the input contains an integer N denoting the number of elements in the array A. The following line contains N (space-separated) elements of A.
<b>Constraints:</b>
1 <= T <= 100
3 <= N <= 10<sup>6</sup>
1 <= A[i] <= 10<sup>9</sup>
<b>Note</b>:-It is guaranteed that the sum of N over all text cases does not exceed 10<sup>6</sup>For each test case, output the first, second and third maximum elements in the array.Sample Input:
3
5
1 4 2 4 5
6
1 3 5 7 9 8
7
11 22 33 44 55 66 77
Sample Output:
5 4 4
9 8 7
77 66 55
<b>Explanation:</b>
Testcase 1:
[1 4 2 4 5]
First max = 5
Second max = 4
Third max = 4, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
long long n;
cin>>n;
vector<long> a(n);
long ans[3]={0};
long x,y;
for(int i=0;i<n;i++){
cin>>a[i];
x=a[i];
for(int j=0;j<3;j++){
y=min(x,ans[j]);
ans[j]=max(x,ans[j]);
// cout<<ans[j]<<" ";
x=y;
}
}
if(ans[1]<ans[0]){
swap(ans[1],ans[0]);
}
if(ans[2]<ans[1]){
swap(ans[1],ans[2]);
}
if(ans[1]<ans[0]){
swap(ans[1],ans[0]);
}
cout<<ans[2]<<" "<<ans[1]<<" "<<ans[0]<<endl;
}
}
, 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, you need to find its maximum, 2<sup>nd</sup> maximum and 3<sup>rd</sup> maximum element.
Try solving it in O(N) per test caseThe first line of the input contains the number of test cases T.
For each test case, the first line of the input contains an integer N denoting the number of elements in the array A. The following line contains N (space-separated) elements of A.
<b>Constraints:</b>
1 <= T <= 100
3 <= N <= 10<sup>6</sup>
1 <= A[i] <= 10<sup>9</sup>
<b>Note</b>:-It is guaranteed that the sum of N over all text cases does not exceed 10<sup>6</sup>For each test case, output the first, second and third maximum elements in the array.Sample Input:
3
5
1 4 2 4 5
6
1 3 5 7 9 8
7
11 22 33 44 55 66 77
Sample Output:
5 4 4
9 8 7
77 66 55
<b>Explanation:</b>
Testcase 1:
[1 4 2 4 5]
First max = 5
Second max = 4
Third max = 4, I have written this Solution Code: function maxNumbers(arr,n) {
// write code here
// do not console.log the answer
// return the answer as an array of 3 numbers
return arr.sort((a,b)=>b-a).slice(0,3)
};
, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tono has two integer intervals [A, B] and [C, D] (the intervals are inclusive of both numbers). She wonders if Solo will be able to solve the following simple problem:
Choose an integer X from first interval and an integer Y from second interval. Now for all combinations of X and Y, what is the maximum value of X*Y.
As Solo is small, please help her solve the problem.The first and the only line of input contains 4 integers A, B, C, and D.
Constraints
-10<sup>9</sup> <= A <= B <= 10<sup>9</sup>
-10<sup>9</sup> <= C <= D <= 10<sup>9</sup>Output a single integer, the maximum value of the product.Sample Input
1 2 1 1
Sample Output
2
Explanation: Choose 2 from [1, 2] and 1 from [1, 1].
Sample Input
3 5 -4 -2
Sample Output
-6
Sample Input
-1000000000 0 -1000000000 0
Sample Output
1000000000000000000, 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[] arr=br.readLine().split(" ");
int a = Integer.parseInt(arr[0]);
int b = Integer.parseInt(arr[1]);
int c = Integer.parseInt(arr[2]);
int d= Integer.parseInt(arr[3]);
int secondMax = Math.max(a,b) < 0 ? Math.min(c,d) : Math.max(c,d);
int firstMax = Math.max(c,d) < 0 ? Math.min(a,b) : Math.max(a,b);
if(Math.abs(Math.min(a,b)) > Math.max(a,b) && Math.abs(Math.min(c,d)) > Math.max(c,d)){
long num= (long)Math.min(a,b) * Math.min(c,d);
System.out.println(num);
return;
}
long prod = (long)firstMax*secondMax;
System.out.println(prod);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tono has two integer intervals [A, B] and [C, D] (the intervals are inclusive of both numbers). She wonders if Solo will be able to solve the following simple problem:
Choose an integer X from first interval and an integer Y from second interval. Now for all combinations of X and Y, what is the maximum value of X*Y.
As Solo is small, please help her solve the problem.The first and the only line of input contains 4 integers A, B, C, and D.
Constraints
-10<sup>9</sup> <= A <= B <= 10<sup>9</sup>
-10<sup>9</sup> <= C <= D <= 10<sup>9</sup>Output a single integer, the maximum value of the product.Sample Input
1 2 1 1
Sample Output
2
Explanation: Choose 2 from [1, 2] and 1 from [1, 1].
Sample Input
3 5 -4 -2
Sample Output
-6
Sample Input
-1000000000 0 -1000000000 0
Sample Output
1000000000000000000, I have written this Solution Code: A,B,C,D=list(map(int,input().split()))
p=[A*C,A*D,B*C,B*D]
print(max(p)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tono has two integer intervals [A, B] and [C, D] (the intervals are inclusive of both numbers). She wonders if Solo will be able to solve the following simple problem:
Choose an integer X from first interval and an integer Y from second interval. Now for all combinations of X and Y, what is the maximum value of X*Y.
As Solo is small, please help her solve the problem.The first and the only line of input contains 4 integers A, B, C, and D.
Constraints
-10<sup>9</sup> <= A <= B <= 10<sup>9</sup>
-10<sup>9</sup> <= C <= D <= 10<sup>9</sup>Output a single integer, the maximum value of the product.Sample Input
1 2 1 1
Sample Output
2
Explanation: Choose 2 from [1, 2] and 1 from [1, 1].
Sample Input
3 5 -4 -2
Sample Output
-6
Sample Input
-1000000000 0 -1000000000 0
Sample Output
1000000000000000000, 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 a, b, c, d; cin>>a>>b>>c>>d;
int a1 = max(a*c, b*d);
int a2 = max(a*d, b*c);
cout<<max(a1, a2);
}
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: Given a Binary Tree, find diameter of it. The <b>diameter</b> of a tree is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two trees each with diameter nine, the leaves that form the ends of a longest path are shaded (note that there is more than one path in each tree of length nine, but no path longer than nine nodes).<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 getDiameter() that takes "root" node as parameter.
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^4
1 <= node values <= 10^3
<b>Sum of "N" over all testcases does not exceed 10^5</b>
For <b>Custom Input:</b>
First line of input should contains the number of test cases T. For each test case, there will be two lines of input.
First line contains number of nodes N. Second line will be a string representing the tree as described below:
The values in the string are in the order of level order traversal of the tree where, numbers denote node values, and a character “N” denotes NULL child.
<b>Note:</b> If a node has been declared Null using 'N', no information about its children will be given further in the array.Return the diameter of the tree.Sample Input:
2
3
1 2 3
5
10 20 30 40 60
Sample Output:
3
4
Explanation:
Test Case1: The tree is
1
/ \
2 3
The diameter is of 3 length.
Test Case2: The tree is
10
/ \
20 30
/ \
40 60
The diameter is of 4 length., I have written this Solution Code: static int dia = 0;
public static int util(Node root) {
if (root == null) return 0;
int l = util(root.left); // height of left subtree
int r = util(root.right); // height of right subtree
if (l + r + 1 > dia) dia = l + r + 1; // l+r+1 is a possible max dia
return 1 + Math.max(l, r); // returning height of subtree
}
public static int getDiameter(Node root) {
dia = 0;
util(root);
return dia;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Your task is to implement a stack using a linked list and perform given queries
Note:-if stack is already empty than pop operation will do nothing and 0 will be printed as a top element of stack 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()</b>:- that takes the integer to be added as a parameter.
<b>pop()</b>:- that takes no parameter.
<b>top()</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 top function in which you require to print the top most element of your stack in a new line, if the stack is empty you just need to print 0.Input:
7
push 1
push 2
top
pop
top
pop
top
Output:
2
1
0
, I have written this Solution Code:
Node top = null;
public void push(int x)
{
Node temp = new Node(x);
temp.next = top;
top = temp;
}
public void pop()
{
if (top == null) {
}
else {
top = (top).next;}
}
public void top()
{
// check for stack underflow
if (top == null) {
System.out.println("0");
}
else {
Node temp = top;
System.out.println(temp.val);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Calculate inversion count of array of integers.
Inversion count of an array is quantisation of how much unsorted an array is. A sorted array has inversion count 0, while an unsorted array has maximum inversion count.
Formally speaking inversion count = number of pairs i, j such that i < j and a[i] > a[j].The first line contain integers N.
The second line of the input contains N singly spaces integers.
1 <= N <= 100000
1 <= A[i] <= 1000000000Output one integer the inversion count.Sample Input
5
1 1 3 2 2
Sample Output
2
Sample Input
5
5 4 3 2 1
Sample Output
10, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static long count(int[] arr, int l, int h, int[] aux) {
if (l >= h) return 0;
int mid = (l +h) / 2;
long count = 0;
count += count(aux, l, mid, arr);
count += count(aux, mid + 1, h, arr);
count += merge(arr, l, mid, h, aux);
return count;
}
static long merge(int[] arr, int l, int mid, int h, int[] aux) {
long count = 0;
int i = l, j = mid + 1, k = l;
while (i <= mid || j <= h) {
if (i > mid) {
arr[k++] = aux[j++];
} else if (j > h) {
arr[k++] = aux[i++];
} else if (aux[i] <= aux[j]) {
arr[k++] = aux[i++];
} else {
arr[k++] = aux[j++];
count += mid + 1 - i;
}
}
return count;
}
public static void main (String[] args)throws IOException {
BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
String str[];
str = br.readLine().split(" ");
int n = Integer.parseInt(str[0]);
str = br.readLine().split(" ");
int arr[] =new int[n];
for (int j = 0; j < n; j++) {
arr[j] = Integer.parseInt(str[j]);
}
int[] aux = arr.clone();
System.out.print(count(arr, 0, n - 1, aux));
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Calculate inversion count of array of integers.
Inversion count of an array is quantisation of how much unsorted an array is. A sorted array has inversion count 0, while an unsorted array has maximum inversion count.
Formally speaking inversion count = number of pairs i, j such that i < j and a[i] > a[j].The first line contain integers N.
The second line of the input contains N singly spaces integers.
1 <= N <= 100000
1 <= A[i] <= 1000000000Output one integer the inversion count.Sample Input
5
1 1 3 2 2
Sample Output
2
Sample Input
5
5 4 3 2 1
Sample Output
10, I have written this Solution Code: count=0
def implementMergeSort(arr,s,e):
global count
if e-s==1:
return
mid=(s+e)//2
implementMergeSort(arr,s,mid)
implementMergeSort(arr,mid,e)
count+=merge_sort_place(arr,s,mid,e)
return count
def merge_sort_place(arr,s,mid,e):
arr3=[]
i=s
j=mid
count=0
while i<mid and j<e:
if arr[i]>arr[j]:
arr3.append(arr[j])
j+=1
count+=(mid-i)
else:
arr3.append(arr[i])
i+=1
while (i<mid):
arr3.append(arr[i])
i+=1
while (j<e):
arr3.append(arr[j])
j+=1
for x in range(len(arr3)):
arr[s+x]=arr3[x]
return count
n=int(input())
arr=list(map(int,input().split()[:n]))
c=implementMergeSort(arr,0,len(arr))
print(c), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Calculate inversion count of array of integers.
Inversion count of an array is quantisation of how much unsorted an array is. A sorted array has inversion count 0, while an unsorted array has maximum inversion count.
Formally speaking inversion count = number of pairs i, j such that i < j and a[i] > a[j].The first line contain integers N.
The second line of the input contains N singly spaces integers.
1 <= N <= 100000
1 <= A[i] <= 1000000000Output one integer the inversion count.Sample Input
5
1 1 3 2 2
Sample Output
2
Sample Input
5
5 4 3 2 1
Sample Output
10, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
long long _mergeSort(long long arr[], int temp[], int left, int right);
long long merge(long long arr[], int temp[], int left, int mid, int right);
/* This function sorts the input array and returns the
number of inversions in the array */
long long mergeSort(long long arr[], int array_size)
{
int temp[array_size];
return _mergeSort(arr, temp, 0, array_size - 1);
}
/* An auxiliary recursive function that sorts the input array and
returns the number of inversions in the array. */
long long _mergeSort(long long arr[], int temp[], int left, int right)
{
long long mid, inv_count = 0;
if (right > left) {
/* Divide the array into two parts and
call _mergeSortAndCountInv()
for each of the parts */
mid = (right + left) / 2;
/* Inversion count will be sum of
inversions in left-part, right-part
and number of inversions in merging */
inv_count += _mergeSort(arr, temp, left, mid);
inv_count += _mergeSort(arr, temp, mid + 1, right);
/*Merge the two parts*/
inv_count += merge(arr, temp, left, mid + 1, right);
}
return inv_count;
}
/* This funt merges two sorted arrays
and returns inversion count in the arrays.*/
long long merge(long long arr[], int temp[], int left,
int mid, int right)
{
int i, j, k;
long long inv_count = 0;
i = left; /* i is index for left subarray*/
j = mid; /* j is index for right subarray*/
k = left; /* k is index for resultant merged subarray*/
while ((i <= mid - 1) && (j <= right)) {
if (arr[i] <= arr[j]) {
temp[k++] = arr[i++];
}
else {
temp[k++] = arr[j++];
/* this is tricky -- see above
explanation/diagram for merge()*/
inv_count = inv_count + (mid - i);
}
}
/* Copy the remaining elements of left subarray
(if there are any) to temp*/
while (i <= mid - 1)
temp[k++] = arr[i++];
/* Copy the remaining elements of right subarray
(if there are any) to temp*/
while (j <= right)
temp[k++] = arr[j++];
/*Copy back the merged elements to original array*/
for (i = left; i <= right; i++)
arr[i] = temp[i];
return inv_count;}
int main(){
int n;
cin>>n;
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];}
long long ans = mergeSort(a, n);
cout << ans; }
, 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 opening and closing parenthesis '(' and ')'. Find length of the longest valid parenthesis substring.Each test case have one line string S of character '(' and ')' of length N.
Constraints:
1 <= N <= 10^5Print the length of the longest valid parenthesis substring.Input
((()
Output
2
Input
)()())
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 s = br.readLine();
int n = s.length();
int left = 0, right = 0;
int maxlength = 0;
for(int i = 0; i < n; i++)
{
if (s.charAt(i) == '(')
left++;
else
right++;
if (left == right)
maxlength = Math.max(maxlength, 2 * right);
else if (right > left)
left = right = 0;
}
left = right = 0;
for(int i = n - 1; i >= 0; i--)
{
if (s.charAt(i) == '(')
left++;
else
right++;
if (left == right)
maxlength = Math.max(maxlength, 2 * left);
else if (left > right)
left = right = 0;
}
System.out.println(maxlength);
}
}, 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 opening and closing parenthesis '(' and ')'. Find length of the longest valid parenthesis substring.Each test case have one line string S of character '(' and ')' of length N.
Constraints:
1 <= N <= 10^5Print the length of the longest valid parenthesis substring.Input
((()
Output
2
Input
)()())
Output
4, I have written this Solution Code: def longestValidParentheses( S):
stack, ans = [-1], 0
for i in range(len(S)):
if S[i] == '(': stack.append(i)
elif len(stack) == 1: stack[0] = i
else:
stack.pop()
ans = max(ans, i - stack[-1])
return ans
n=input()
print(longestValidParentheses(n)), 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 opening and closing parenthesis '(' and ')'. Find length of the longest valid parenthesis substring.Each test case have one line string S of character '(' and ')' of length N.
Constraints:
1 <= N <= 10^5Print the length of the longest valid parenthesis substring.Input
((()
Output
2
Input
)()())
Output
4, 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;
int a[N];
signed main() {
IOS;
string s;
cin >> s;
int n = s.length();
s = "#" + s;
stack<int> st;
st.push(0);
int ans = 0;
for(int i = 1; i <= n; i++){
if(s[i] == '(')
st.push(i);
else{
if(s[st.top()] == '('){
int x = st.top();
a[i] = i-x+1 + a[x-1];
ans = max(ans, a[i]);
st.pop();
}
else
st.push(i);
}
}
cout << ans;
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Your friend and you took a true/false exam of n questions. You know your answers, your friend’s
answers, and that your friend got k questions correct.
Compute the maximum number of questions you could have gotten correctly.The first line of input contains a single integer k.
The second line contains a string of n (1 ≤ n ≤ 1000) characters, the answers you wrote down.
Each letter is either a ‘T’ or an ‘F’.
The third line contains a string of n characters, the answers your friend wrote down. Each letter
is either a ‘T’ or an ‘F’.
The input will satisfy 0 ≤ k ≤ n.Print, on one line, the maximum number of questions you could have gotten correctly.Sample Input
3
FTFFF
TFTTT
Sample Output
2, 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 k = Integer.parseInt(br.readLine());
String me = br.readLine();
String myFriend = br.readLine();
int N = me.length();
int commonAns = 0;
for(int i=0; i<N; i++) {
if(me.charAt(i) == myFriend.charAt(i) ) commonAns++;
}
int ans = Math.min(k, commonAns) + Math.min(N - k, N - commonAns);
System.out.println(ans);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Your friend and you took a true/false exam of n questions. You know your answers, your friend’s
answers, and that your friend got k questions correct.
Compute the maximum number of questions you could have gotten correctly.The first line of input contains a single integer k.
The second line contains a string of n (1 ≤ n ≤ 1000) characters, the answers you wrote down.
Each letter is either a ‘T’ or an ‘F’.
The third line contains a string of n characters, the answers your friend wrote down. Each letter
is either a ‘T’ or an ‘F’.
The input will satisfy 0 ≤ k ≤ n.Print, on one line, the maximum number of questions you could have gotten correctly.Sample Input
3
FTFFF
TFTTT
Sample Output
2, I have written this Solution Code: k = int(input())
m = 0
a = list(map(str,input()))
b = list(map(str,input()))
#print(a,b)
n = len(b)
for i in range(n):
if a[i] == b[i]:
m += 1
if k >= m :
print(n-k+m)
else:
print(n-m+k), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Shinchan and Kazama are standing in a horizontal line, Shinchan is standing at point A and Kazama is standing at point B. Kazama is very intelligent and recently he learned how to calculate the speed if the distance and time are given and now he wants to check if the formula he learned is correct or not So he starts running at a speed of S unit/s towards Shinhan and noted the time he reaches to Shinhan. Since Kazama is disturbed by Shinchan, can you calculate the time for him?The input contains three integers A, B, and S separated by spaces.
Constraints:-
1 <= A, B, V <= 1000
Note:- It is guaranteed that the calculated distance will always be divisible by V.Print the Time taken in seconds by Kazama to reach Shinchan.
Note:- Remember Distance can not be negativeSample Input:-
5 2 3
Sample Output:-
1
Explanation:-
Distance = 5-2 = 3, Speed = 3
Time = Distance/Speed
Sample Input:-
9 1 2
Sample Output:-
4, I have written this Solution Code: a, b, v = map(int, input().strip().split(" "))
c = abs(a-b)
t = c//v
print(t), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Shinchan and Kazama are standing in a horizontal line, Shinchan is standing at point A and Kazama is standing at point B. Kazama is very intelligent and recently he learned how to calculate the speed if the distance and time are given and now he wants to check if the formula he learned is correct or not So he starts running at a speed of S unit/s towards Shinhan and noted the time he reaches to Shinhan. Since Kazama is disturbed by Shinchan, can you calculate the time for him?The input contains three integers A, B, and S separated by spaces.
Constraints:-
1 <= A, B, V <= 1000
Note:- It is guaranteed that the calculated distance will always be divisible by V.Print the Time taken in seconds by Kazama to reach Shinchan.
Note:- Remember Distance can not be negativeSample Input:-
5 2 3
Sample Output:-
1
Explanation:-
Distance = 5-2 = 3, Speed = 3
Time = Distance/Speed
Sample Input:-
9 1 2
Sample Output:-
4, I have written this Solution Code: /* package codechef; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
System.out.print(Time(n,m,k));
}
static int Time(int A, int B, int S){
if(B>A){
return (B-A)/S;
}
return (A-B)/S;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Nobita wants to become rich so he came up with an idea, So, he buys some gadgets from the future at a price of C and sells them at a price of S to his friends. Now Nobita wants to know how much he gains by selling all gadget. As we all know Nobita is weak in maths help him to find the profit he getsYou don't have to worry about the input, you just have to complete the function <b>Profit()</b>
<b>Constraints:-</b>
1 <= C <= S <= 1000Print the profit Nobita gets from selling one gadget.Sample Input:-
3 5
Sample Output:-
2
Sample Input:-
9 16
Sample Output:-
7, I have written this Solution Code: def profit(C, S):
print(S - C), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Nobita wants to become rich so he came up with an idea, So, he buys some gadgets from the future at a price of C and sells them at a price of S to his friends. Now Nobita wants to know how much he gains by selling all gadget. As we all know Nobita is weak in maths help him to find the profit he getsYou don't have to worry about the input, you just have to complete the function <b>Profit()</b>
<b>Constraints:-</b>
1 <= C <= S <= 1000Print the profit Nobita gets from selling one gadget.Sample Input:-
3 5
Sample Output:-
2
Sample Input:-
9 16
Sample Output:-
7, I have written this Solution Code: static void Profit(int C, int S){
System.out.println(S-C);
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Today is Newton School's first class of this year. Nutan, a student at Newton School, has received his first assignment. He will be given a string as input. His task is to print "Gravity'' if the input is "Apple''; otherwise, he will have to print "Space''.
Can you help Nutan in solving his first assignment? Note that the quotation marks are just for clarity. They are not part of the input string, and should not be a part of your output string.The input consists of a single line that contains a string S (1 ≤ length of S ≤ 10). The string only consists of lowercase and uppercase letters.Print "Gravity'' or "Space'' according to the input.Sample Input 1:
Apple
Sample Output 1:
Gravity
Sample Input 2:
Mango
Sample Output 2:
Space
Sample Input 3:
AppLE
Sample Output 3:
Space, 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 sc= new FastReader();
String str= sc.nextLine();
String a="Apple";
if(a.equals(str)){
System.out.println("Gravity");
}
else{
System.out.println("Space");
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Today is Newton School's first class of this year. Nutan, a student at Newton School, has received his first assignment. He will be given a string as input. His task is to print "Gravity'' if the input is "Apple''; otherwise, he will have to print "Space''.
Can you help Nutan in solving his first assignment? Note that the quotation marks are just for clarity. They are not part of the input string, and should not be a part of your output string.The input consists of a single line that contains a string S (1 ≤ length of S ≤ 10). The string only consists of lowercase and uppercase letters.Print "Gravity'' or "Space'' according to the input.Sample Input 1:
Apple
Sample Output 1:
Gravity
Sample Input 2:
Mango
Sample Output 2:
Space
Sample Input 3:
AppLE
Sample Output 3:
Space, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
//Work
int main()
{
#ifndef ONLINE_JUDGE
if (fopen("INPUT.txt", "r"))
{
freopen ("INPUT.txt" , "r" , stdin);
//freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
//-----------------------------------------------------------------------------------------------------------//
string S;
cin>>S;
if(S=="Apple")
{
cout<<"Gravity"<<endl;
}
else
{
cout<<"Space"<<endl;
}
//-----------------------------------------------------------------------------------------------------------//
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Today is Newton School's first class of this year. Nutan, a student at Newton School, has received his first assignment. He will be given a string as input. His task is to print "Gravity'' if the input is "Apple''; otherwise, he will have to print "Space''.
Can you help Nutan in solving his first assignment? Note that the quotation marks are just for clarity. They are not part of the input string, and should not be a part of your output string.The input consists of a single line that contains a string S (1 ≤ length of S ≤ 10). The string only consists of lowercase and uppercase letters.Print "Gravity'' or "Space'' according to the input.Sample Input 1:
Apple
Sample Output 1:
Gravity
Sample Input 2:
Mango
Sample Output 2:
Space
Sample Input 3:
AppLE
Sample Output 3:
Space, I have written this Solution Code: n=input()
if n=='Apple':print('Gravity')
else:print('Space'), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: As Hodor keeps holding the door to give Meera time to escape with unconscious Bran, the mighty Tono offers Hodor the support in holding the door. But for that, Hodor must answer the following question on Game Theory.
Pino and Tongu are playing a game with three numbers A, B, and C. The game is played turn wise and being the elder sister, Pino starts the game. In each turn, the player with the turn must reduce one of the numbers by some value V (1 <= V <= X). The player who cannot reduce a number in their turn (since all have turned 0) loses.
As Pino and Tongu are well versed with Grundy numbers, there is one more catch. The number B cannot be turned 0 unless A has been turned 0, and the number C cannot be turned 0, unless both A and B have turned 0.
For helping Hodor, you need to tell him who'll win the game!The first and the only line of input contains four integers X, A, B, and C.
Constraints
1 <= X, A, B, C <= 10<sup>18</sup>Output "Pino" (without quotes) if Pino wins the game, else output "Tongu" (without quotes).Sample Input
10 1 1 1
Sample Output
Pino
Explanation: The only way the game can proceed is:
- Pino reduces A by 1 to 0.
- Tongu reduces B by 1 to 0.
- Pino reduces C by 1 to 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(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 x, a, b, c;
cin>>x>>a>>b>>c;
x++;
b--;
c--;
a = a % x;
b = b % x;
c = c % x;
int ans = a ^ b ^ c;
cout << (ans ? "Pino" : "Tongu");
}
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: Given the number of the month, your task is to calculate the number of days present in the particular month.
<b>Note:-</b>
Consider non-leap yearUser task:
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>numberofdays()</b> which contains M as a parameter.
<b>Constraints:-</b>
1 <= M <= 12Print the number of days in the particular month.Sample Input 1:-
1
Sample Output 1:
31
Sample Input 2:-
2
Sample Output 2:-
28, I have written this Solution Code: function numberOfDays(n)
{
let ans;
switch(n)
{
case 1:
case 3:
case 5:
case 7:
case 8:
case 10:
case 12:
ans = Number(31);
break;
case 2:
ans = Number(28);
break;
default:
ans = Number(30);
break;
}
return ans;
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given the number of the month, your task is to calculate the number of days present in the particular month.
<b>Note:-</b>
Consider non-leap yearUser task:
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>numberofdays()</b> which contains M as a parameter.
<b>Constraints:-</b>
1 <= M <= 12Print the number of days in the particular month.Sample Input 1:-
1
Sample Output 1:
31
Sample Input 2:-
2
Sample Output 2:-
28, I have written this Solution Code:
static void numberofdays(int M){
if(M==4 || M ==6 || M==9 || M==11){System.out.print(30);}
else if(M==2){System.out.print(28);}
else{
System.out.print(31);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number <b>N</b>, find the count of pairs(x, y) such that the absolute value of sum of x<sup>3</sup> and y<sup>3</sup> is equal to N, i. e |x<sup>3</sup> + y<sup>3</sup>|=N<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>Pairs()</b> that takes the integer N as parameter
<b>Constraints</b>
1 <= N <= 10<sup>8</sup>Return the <b>count of pairs</b> which satisfies the given condition.Sample Input:-
8
Sample Output:-
2
Explanation:-
The required pairs are (0, -2), (0, 2)
Sample Input:-
3
Sample Output:-
0, I have written this Solution Code: def Pairs(N):
cnt=0
for i in range(-1000, 1001):
for j in range (i,1001):
a=i*i*i
b=j*j*j
if abs(a+b)==N:
cnt=cnt+1
return cnt, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number <b>N</b>, find the count of pairs(x, y) such that the absolute value of sum of x<sup>3</sup> and y<sup>3</sup> is equal to N, i. e |x<sup>3</sup> + y<sup>3</sup>|=N<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>Pairs()</b> that takes the integer N as parameter
<b>Constraints</b>
1 <= N <= 10<sup>8</sup>Return the <b>count of pairs</b> which satisfies the given condition.Sample Input:-
8
Sample Output:-
2
Explanation:-
The required pairs are (0, -2), (0, 2)
Sample Input:-
3
Sample Output:-
0, I have written this Solution Code: int Pairs(long N){
int cnt=0;
long int sum=0,a,b,i,j;
for(i=-6000 ;i<=6000;i++){
for(j=i; j<=6000;j++){
a=i*i*i;
b=j*j*j;
if((a+b)>0 && (a+b)==N){
cnt++;}
else if((a+b)<0 && (a+b) ==(-N)){cnt++;}
}}
return cnt;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number <b>N</b>, find the count of pairs(x, y) such that the absolute value of sum of x<sup>3</sup> and y<sup>3</sup> is equal to N, i. e |x<sup>3</sup> + y<sup>3</sup>|=N<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>Pairs()</b> that takes the integer N as parameter
<b>Constraints</b>
1 <= N <= 10<sup>8</sup>Return the <b>count of pairs</b> which satisfies the given condition.Sample Input:-
8
Sample Output:-
2
Explanation:-
The required pairs are (0, -2), (0, 2)
Sample Input:-
3
Sample Output:-
0, I have written this Solution Code: public static int Pairs(int N){
int cnt=0;
long sum=0,a,b,i;
for(i=-6000 ;i<=6000;i++){
for(long j=i; j<=6000;j++){
a=i*i*i;
b=j*j*j;
if(Math.abs(a+b)==N){
cnt++;}
}
}
return cnt;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number <b>N</b>, find the count of pairs(x, y) such that the absolute value of sum of x<sup>3</sup> and y<sup>3</sup> is equal to N, i. e |x<sup>3</sup> + y<sup>3</sup>|=N<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>Pairs()</b> that takes the integer N as parameter
<b>Constraints</b>
1 <= N <= 10<sup>8</sup>Return the <b>count of pairs</b> which satisfies the given condition.Sample Input:-
8
Sample Output:-
2
Explanation:-
The required pairs are (0, -2), (0, 2)
Sample Input:-
3
Sample Output:-
0, I have written this Solution Code:
int Pairs(long N){
int cnt=0;
long int sum=0,a,b,i,j;
for(i=-6000 ;i<=6000;i++){
for(j=i; j<=6000;j++){
a=i*i*i;
b=j*j*j;
if(abs(a+b)==N){
cnt++;}
}
}
return cnt;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A containing a permutation of N numbers. Find the number of indices i such that <b>A[i] <= A[j] satisfies for all the values of j satisfying 1 <= j <= i </b>.The first line of the input contains an input N, the size of the permutation.
The second line of the input contains N singly spaced integers, the elements of the permutation P.
<b>Constraints</b>
1 <= N <= 200000
1 <= P[i] <= N
P is a permutation of the first N natural numbers.Output a single integer, the answer to the problem.Sample Input
6
3 2 5 6 1 4
Sample Output
3
Sample Input
3
1 2 3
Sample Output
1
<b>Explanation 1:</b>
The indices i=1, i=2, and i=5 satisfy the condition., 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));
int N = Integer.parseInt(reader.readLine());
int min = N + 1;
StringTokenizer tokens = new StringTokenizer(reader.readLine());
int c = 0;
for(int i = 0; i < N; i++) {
int x = Integer.parseInt(tokens.nextToken());
if(x < min) {
c++;
min = x;
}
}
System.out.println(c);
reader.close();
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A containing a permutation of N numbers. Find the number of indices i such that <b>A[i] <= A[j] satisfies for all the values of j satisfying 1 <= j <= i </b>.The first line of the input contains an input N, the size of the permutation.
The second line of the input contains N singly spaced integers, the elements of the permutation P.
<b>Constraints</b>
1 <= N <= 200000
1 <= P[i] <= N
P is a permutation of the first N natural numbers.Output a single integer, the answer to the problem.Sample Input
6
3 2 5 6 1 4
Sample Output
3
Sample Input
3
1 2 3
Sample Output
1
<b>Explanation 1:</b>
The indices i=1, i=2, and i=5 satisfy the condition., I have written this Solution Code: n=int(input())
a=map(int,input().split())
c=200001
v=0
for i in a:
if i<c:
c=i
v+=1
print(v), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A containing a permutation of N numbers. Find the number of indices i such that <b>A[i] <= A[j] satisfies for all the values of j satisfying 1 <= j <= i </b>.The first line of the input contains an input N, the size of the permutation.
The second line of the input contains N singly spaced integers, the elements of the permutation P.
<b>Constraints</b>
1 <= N <= 200000
1 <= P[i] <= N
P is a permutation of the first N natural numbers.Output a single integer, the answer to the problem.Sample Input
6
3 2 5 6 1 4
Sample Output
3
Sample Input
3
1 2 3
Sample Output
1
<b>Explanation 1:</b>
The indices i=1, i=2, and i=5 satisfy the condition., 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; cin>>n;
int mn = INF;
int ans = 0;
For(i, 0, n){
int a; cin>>a;
if(a > mn){
continue;
}
ans++;
mn = a;
}
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: Given a positive integer n. The task is to find the sum of product of all possible pairs of (x, y) where x and y will be represented as such y = floor(n/x), x varies from 1 to n.The first line of input contains an integer T. Each test case contains an integer N.
Constraints:
1 <= T <= 100
1 <= N <= 10^6For each test case in a new line print the required output.Input:
2
5
10
Output:
21
87
Explanation:
Testcase 1:
Following are the possible pairs of (x, y): (1, 5), (2, 2), (3, 1), (4, 1), (5, 1).
So, 1*5 + 2*2 + 3*1 + 4*1 + 5*1
= 5 + 4 + 3 + 4 + 5
= 21., I have written this Solution Code: import math
def sumOfRange(a, b):
i = (a * (a + 1)) >> 1;
j = (b * (b + 1)) >> 1;
return (i - j);
def sumofproduct(n):
sum = 0;
root = int(math.sqrt(n));
for i in range(1, root + 1):
up = int(n / i);
low = max(int(n / (i + 1)), root);
sum += (i * sumOfRange(up, low));
sum += (i * int(n / i));
return sum;
T = int(input())
for i in range(T):
n = int(input())
print(sumofproduct(n)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a positive integer n. The task is to find the sum of product of all possible pairs of (x, y) where x and y will be represented as such y = floor(n/x), x varies from 1 to n.The first line of input contains an integer T. Each test case contains an integer N.
Constraints:
1 <= T <= 100
1 <= N <= 10^6For each test case in a new line print the required output.Input:
2
5
10
Output:
21
87
Explanation:
Testcase 1:
Following are the possible pairs of (x, y): (1, 5), (2, 2), (3, 1), (4, 1), (5, 1).
So, 1*5 + 2*2 + 3*1 + 4*1 + 5*1
= 5 + 4 + 3 + 4 + 5
= 21., 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 = 1e6 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
int p[N];
signed main() {
IOS;
int t; cin >> t;
while(t--){
int ans = 0;
int n; cin >> n;
for(int i = 1; i <= n; i++){
ans += i*(n/i);
}
cout << ans << endl;
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a positive integer n. The task is to find the sum of product of all possible pairs of (x, y) where x and y will be represented as such y = floor(n/x), x varies from 1 to n.The first line of input contains an integer T. Each test case contains an integer N.
Constraints:
1 <= T <= 100
1 <= N <= 10^6For each test case in a new line print the required output.Input:
2
5
10
Output:
21
87
Explanation:
Testcase 1:
Following are the possible pairs of (x, y): (1, 5), (2, 2), (3, 1), (4, 1), (5, 1).
So, 1*5 + 2*2 + 3*1 + 4*1 + 5*1
= 5 + 4 + 3 + 4 + 5
= 21., I have written this Solution Code: import java.io.*;
import java.util.*;
import java.math.*;
class Main {
public static void main (String[] args)throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(br.readLine());
while(t!=0){
int n=Integer.parseInt(br.readLine());
long res=0;
for(int i=1;i<=n;i++){
res=res+(i*(int)Math.floor(n/i));
}
System.out.println(res);
t--;
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Newton has N baskets containing apples. There are A<sub>i</sub> apples in ith basket. Newton wants to gift one apple to each of his M friends.
To do that he will select some baskets and gift all apples in these baskets to his friends. <b>Note</b> that he will gift apples if and only if there are exactly M apples in these subset of baskets.
Help him determine if it is possible to gift apple or not.The first line contains two space-separated integers – N and M.
The second line contains N space-separated integers A<sub>1</sub>, A<sub>2</sub>, ... A<sub>N</sub>.
<b> Constraints: </b>
1 ≤ N ≤ 100
1 ≤ M ≤ 10<sup>11</sup>
1 ≤ A<sub>i</sub> ≤ 10<sup>9</sup>
1 <= ∏ A<sub>i</sub> <= 10<sup>100</sup>Output "Yes" (without quotes) if Newton can distribute apples among his friends else "No" (without quotes).INPUT:
4 8
1 3 3 4
OUTPUT:
Yes
EXPLANATION:
Newton can use 1st, 2nd, 4th basket to give one apple to all his friends., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll b = 10000;
ll pre[1000000];
int main(){
ll n,x;
cin >> n >> x;
vector<ll> a(n);
for(ll i=0 ; i<n ; i++){
cin >> a[i];
}
fill(pre, pre + 1000000, -1);
pre[0] = 0;
vector<pair<ll,ll>> v;
for(ll i=0 ; i<n ; i++){
if (a[i]>=b) v.push_back({ a[i],i });
else{
for(ll j=1000000-1 ; j>=0 ; j--) {
if (pre[j] < 0) continue;
if (j + a[i] < 1000000 && pre[j+a[i]] < 0) {
pre[j + a[i]] = j;
}
}
}
}
ll len = v.size();
for(ll i=0 ; i<(1 << len) ; i++){
ll sum = 0;
for(ll j=0 ; j<len ; j++) {
if (i & (1 << j)) sum += v[j].first;
}
ll d = x - sum;
if (d >= 0 && d < 1000000) {
if (pre[d] >= 0) {
cout << "Yes\n";
return 0;
}
}
}
cout << "No" << "\n";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Hi, it's Monica!
Monica looks at her FRIENDS circle and wonders if her circle is bigger than yours. Please let her know if her friends' circle is bigger than yours, given she has a friends' circle of size 6.The first and the only line of input contains a single integer N, the size of your friends' circle.
Constraints
1 <= N <= 10Output "Yes" if the size of Monica's friends circle has more friends than yours, else output "No".Sample Input
3
Sample Output
Yes
Sample Input
10
Sample Output
No, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Cf cf = new Cf();
cf.solve();
}
static class Cf {
InputReader in = new InputReader(System.in);
OutputWriter out = new OutputWriter(System.out);
int mod = (int)1e9+7;
public void solve() {
int t = in.readInt();
if(t>=6) {
out.printLine("No");
}else {
out.printLine("Yes");
}
}
public long findPower(long x,long n) {
long ans = 1;
long nn = n;
while(nn>0) {
if(nn%2==1) {
ans = (ans*x) % mod;
nn-=1;
}else {
x = (x*x)%mod;
nn/=2;
}
}
return ans%mod;
}
public static int log2(int x) {
return (int) (Math.log(x) / Math.log(2));
}
private static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars == -1) {
throw new InputMismatchException();
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public int readInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public String readString() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public double readDouble() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
double res = 0;
while (!isSpaceChar(c) && c != '.') {
if (c == 'e' || c == 'E') {
return res * Math.pow(10, readInt());
}
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
}
if (c == '.') {
c = read();
double m = 1;
while (!isSpaceChar(c)) {
if (c == 'e' || c == 'E') {
return res * Math.pow(10, readInt());
}
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public long readLong() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
if (filter != null) {
return filter.isSpaceChar(c);
}
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public String next() {
return readString();
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
private 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]);
}
writer.flush();
}
public void printLine(Object... objects) {
print(objects);
writer.println();
writer.flush();
}
public void close() {
writer.close();
}
public void flush() {
writer.flush();
}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Hi, it's Monica!
Monica looks at her FRIENDS circle and wonders if her circle is bigger than yours. Please let her know if her friends' circle is bigger than yours, given she has a friends' circle of size 6.The first and the only line of input contains a single integer N, the size of your friends' circle.
Constraints
1 <= N <= 10Output "Yes" if the size of Monica's friends circle has more friends than yours, else output "No".Sample Input
3
Sample Output
Yes
Sample Input
10
Sample Output
No, 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();
//////////////
template<class C> void mini(C&a4, C b4){a4=min(a4,b4);}
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 mod 1000000007ll
#define pii pair<int,int>
/////////////
signed main(){
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
int n;
cin>>n;
if(n<6)
cout<<"Yes";
else
cout<<"No";
#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: Hi, it's Monica!
Monica looks at her FRIENDS circle and wonders if her circle is bigger than yours. Please let her know if her friends' circle is bigger than yours, given she has a friends' circle of size 6.The first and the only line of input contains a single integer N, the size of your friends' circle.
Constraints
1 <= N <= 10Output "Yes" if the size of Monica's friends circle has more friends than yours, else output "No".Sample Input
3
Sample Output
Yes
Sample Input
10
Sample Output
No, I have written this Solution Code: n=int(input())
if(n>=6):
print("No")
else:
print("Yes"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of N integers, find whether there exists three consecutive same integers in the array.The first line of the input contains an integer N.
The second line contains N space separated integers of the array A.
Constraints
3 <= N <= 1000
1 <= A[i] <= 100Output "Yes" if there exists three consecutive equal integers in the array, else output "No" (without quotes).Sample Input
5
1 2 2 2 4
Sample Output
Yes
Explanation: The segment [2, 2, 2] follows the criterion.
Sample Input
5
1 2 2 3 4
Sample Output
No, I have written this Solution Code: n=int(input())
li = list(map(int,input().strip().split()))
for i in range(0,n-2):
if li[i]==li[i+1] and li[i+1]==li[i+2]:
print("Yes",end="")
exit()
print("No",end=""), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of N integers, find whether there exists three consecutive same integers in the array.The first line of the input contains an integer N.
The second line contains N space separated integers of the array A.
Constraints
3 <= N <= 1000
1 <= A[i] <= 100Output "Yes" if there exists three consecutive equal integers in the array, else output "No" (without quotes).Sample Input
5
1 2 2 2 4
Sample Output
Yes
Explanation: The segment [2, 2, 2] follows the criterion.
Sample Input
5
1 2 2 3 4
Sample Output
No, 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; cin>>n;
vector<int> a(n);
bool fl = false;
For(i, 0, n){
cin>>a[i];
if(i>=2){
if(a[i]==a[i-1] && a[i]==a[i-2]){
fl = true;
}
}
}
if(fl){
cout<<"Yes";
}
else
cout<<"No";
}
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: Given an array A of N integers, find whether there exists three consecutive same integers in the array.The first line of the input contains an integer N.
The second line contains N space separated integers of the array A.
Constraints
3 <= N <= 1000
1 <= A[i] <= 100Output "Yes" if there exists three consecutive equal integers in the array, else output "No" (without quotes).Sample Input
5
1 2 2 2 4
Sample Output
Yes
Explanation: The segment [2, 2, 2] follows the criterion.
Sample Input
5
1 2 2 3 4
Sample Output
No, 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[n];
for(int i=0;i<n;i++){
a[i]=sc.nextInt();
}
for(int i=0;i<n-2;i++){
if(a[i]==a[i+1] && a[i+1]==a[i+2]){
System.out.print("Yes");
return;
}
}
System.out.print("No");
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each I (1 < = I < = N), you have to print the number except:-
For each multiple of 3, print "Fizz" instead of the number.
For each multiple of 5, print "Buzz" instead of the number.
For numbers that are multiples of both 3 and 5, print "FizzBuzz" instead of the number.The input contains a single integer N.
<b>Constraints:-</b>
1 ≤ N ≤ 1000Print N space separated number or Fizz buzz according to the condition.Sample Input:-
3
Sample Output:-
1 2 Fizz
Sample Input:-
5
Sample Output:-
1 2 Fizz 4 Buzz, I have written this Solution Code: void fizzbuzz(int n){
for(int i=1;i<=n;i++){
if(i%3==0 && i%5==0){cout<<"FizzBuzz"<<" ";}
else if(i%5==0){cout<<"Buzz ";}
else if(i%3==0){cout<<"Fizz ";}
else{cout<<i<<" ";}
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each I (1 < = I < = N), you have to print the number except:-
For each multiple of 3, print "Fizz" instead of the number.
For each multiple of 5, print "Buzz" instead of the number.
For numbers that are multiples of both 3 and 5, print "FizzBuzz" instead of the number.The input contains a single integer N.
<b>Constraints:-</b>
1 ≤ N ≤ 1000Print N space separated number or Fizz buzz according to the condition.Sample Input:-
3
Sample Output:-
1 2 Fizz
Sample Input:-
5
Sample Output:-
1 2 Fizz 4 Buzz, 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 x= sc.nextInt();
fizzbuzz(x);
}
static void fizzbuzz(int n){
for(int i=1;i<=n;i++){
if(i%3==0 && i%5==0){System.out.print("FizzBuzz ");}
else if(i%5==0){System.out.print("Buzz ");}
else if(i%3==0){System.out.print("Fizz ");}
else{System.out.print(i+" ");}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each I (1 < = I < = N), you have to print the number except:-
For each multiple of 3, print "Fizz" instead of the number.
For each multiple of 5, print "Buzz" instead of the number.
For numbers that are multiples of both 3 and 5, print "FizzBuzz" instead of the number.The input contains a single integer N.
<b>Constraints:-</b>
1 ≤ N ≤ 1000Print N space separated number or Fizz buzz according to the condition.Sample Input:-
3
Sample Output:-
1 2 Fizz
Sample Input:-
5
Sample Output:-
1 2 Fizz 4 Buzz, I have written this Solution Code: def fizzbuzz(n):
for i in range (1,n+1):
if (i%3==0 and i%5==0):
print("FizzBuzz",end=' ')
elif i%3==0:
print("Fizz",end=' ')
elif i%5==0:
print("Buzz",end=' ')
else:
print(i,end=' '), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each I (1 < = I < = N), you have to print the number except:-
For each multiple of 3, print "Fizz" instead of the number.
For each multiple of 5, print "Buzz" instead of the number.
For numbers that are multiples of both 3 and 5, print "FizzBuzz" instead of the number.The input contains a single integer N.
<b>Constraints:-</b>
1 ≤ N ≤ 1000Print N space separated number or Fizz buzz according to the condition.Sample Input:-
3
Sample Output:-
1 2 Fizz
Sample Input:-
5
Sample Output:-
1 2 Fizz 4 Buzz, I have written this Solution Code: void fizzbuzz(int n){
for(int i=1;i<=n;i++){
if(i%3==0 && i%5==0){printf("FizzBuzz ");}
else if(i%5==0){printf("Buzz ");}
else if(i%3==0){printf("Fizz ");}
else{printf("%d ",i);}
}
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given a sequence of numbers of size N. You have to find if there is a way to insert + or - operator in between the numbers so that the result equals K.The first line of input contains two integers N and K. The next line of input contains N space- separated integers depicting the values of the sequence.
Constraints:-
1 <= N <= 20
-10^15 <= K <= 10^15
0 <= Numbers <=10^13Print YES if possible else print NO.Sample Input:-
4 4
1 2 3 4
Sample Output:-
YES
Sample Input:-
4 1
1 2 3 4
Sample Output:-
NO, I have written this Solution Code:
import java.io.*;
import java.util.*;
class Main {
public static boolean isArrangementPossible(long arr[],int n,long sum){
if(n==1){
if(arr[0]==sum)
return true;
else
return false;
}
return(isArrangementPossible(arr,n-1,sum-arr[n-1]) || isArrangementPossible(arr,n-1,sum+arr[n-1]));
}
public static void main (String[] args) throws IOException {
BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
String str1[]=br.readLine().trim().split(" ");
int n=Integer.parseInt(str1[0]);
long sum=Long.parseLong(str1[1]);
String str[]=br.readLine().trim().split(" ");
long arr[]=new long[n];
for(int i=0;i<n;i++){
arr[i]=Long.parseLong(str[i]);
}
if(isArrangementPossible(arr,n,sum)){
System.out.println("YES");
}else{
System.out.println("NO");
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given a sequence of numbers of size N. You have to find if there is a way to insert + or - operator in between the numbers so that the result equals K.The first line of input contains two integers N and K. The next line of input contains N space- separated integers depicting the values of the sequence.
Constraints:-
1 <= N <= 20
-10^15 <= K <= 10^15
0 <= Numbers <=10^13Print YES if possible else print NO.Sample Input:-
4 4
1 2 3 4
Sample Output:-
YES
Sample Input:-
4 1
1 2 3 4
Sample Output:-
NO, I have written this Solution Code: def checkIfGivenTargetIsPossible(nums,currSum,i,targetSum):
if i == len(nums):
if currSum == targetSum:
return 1
return 0
if(checkIfGivenTargetIsPossible(nums,currSum + nums[i],i+1,targetSum)):
return 1
return checkIfGivenTargetIsPossible(nums,currSum - nums[i], i+1,targetSum)
n,k = map(int,input().split())
nums = list(map(int,input().split()))
if(checkIfGivenTargetIsPossible(nums,0,0,k)):
print("YES")
else:
print("NO"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given a sequence of numbers of size N. You have to find if there is a way to insert + or - operator in between the numbers so that the result equals K.The first line of input contains two integers N and K. The next line of input contains N space- separated integers depicting the values of the sequence.
Constraints:-
1 <= N <= 20
-10^15 <= K <= 10^15
0 <= Numbers <=10^13Print YES if possible else print NO.Sample Input:-
4 4
1 2 3 4
Sample Output:-
YES
Sample Input:-
4 1
1 2 3 4
Sample Output:-
NO, I have written this Solution Code: #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define int long long
int k;
using namespace std;
int solve(int n, int a[], int i, int curr ){
if(i==n){
if(curr==k){return 1;}
return 0;
}
if(solve(n,a,i+1,curr+a[i])==1){return 1;}
return solve(n,a,i+1,curr-a[i]);
}
signed main() {
int n;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
if(solve(n,a,1,a[0])){
cout<<"YES";}
else{
cout<<"NO";}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given strings S and T consisting of lowercase English letters. Determine whether T is a (contiguous) substring of S.
A string Y is said to be a (contiguous) substring of X if and only if Y can be obtained by performing the operation below on X zero or more times.
Do one of the following.
i) Delete the first character in X.
ii) Delete the last character in X.
For instance, the tag is a (contiguous) substring of voltage, while ace is not a (contiguous) substring of atcoder.The input is given from Standard Input in the following format:
S
T
<b>Constraints</b>
S and T consist of lowercase English letters.
1≤∣S∣, ∣T∣≤100 (∣X∣ denotes the length of a string X. )If T is a (contiguous) substring of S, print Yes; otherwise, print No.<b>Sample Input 1</b>
voltage
tag
<b>Sample Output 1</b>
Yes
<b>Sample Input 2</b>
gorilla
gorillagorillagorilla
<b>Sample Output 2</b>
No, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
using pii = pair<int, int>;
// <<<
int32_t main()
{
string s, t;
cin >> s >> t;
for (int i = 0; i < s.size(); i++)
if (s.substr(i, t.size()) == t)
{
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a 2-D array of binary integers of size NXM. The cell at i<sup>th</sup> row and j<sup>th</sup> column is denoted by (i, j).
The array is called Balanced if every cell of the array having 4 elements has a balanced neighborhood. A neighborhood is balanced if 4 neighbors can be divided into 2 groups with equal size and equal sum.
A cell at (i, j) has 4 neighbors (i-1, j), (i+1, j), (i, j-1), (i, j+1).The first line contains N and M.
Next N lines contain M integers each.
<b>Constraints</b>
2 ≤ N, M ≤ 1000
0 ≤ arr[i][j] ≤ 1Print "YES" if the given array is balanced, otherwise print "NO".Input:
3 4
0 1 0 0
1 1 0 1
0 0 1 1
Output:
NO
Explanation:
neighbors of (1, 1) => {1, 1, 0, 0} => 1+0 = 0+1 => balanced neighborhood
neighbors of (1, 2) => {0, 1, 1, 1} => no way to divide into two groups with equal sum and equal size => unbalanced
No other cell has 4 neighbors., 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());
int m=Integer.parseInt(in.next());
int a[][] = new int[n][m];
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++){
a[i][j] = Integer.parseInt(in.next());
}
}
int f=1;
for(int i=1;i+1<n;i++){
for(int j=1;j+1<m;j++){
int sum=a[i+1][j] + a[i-1][j] + a[i][j+1] + a[i][j-1];
if(sum%2 != 0){
f=-1;
break;
}
}
if(f==-1)break;
}
if(f==1)out.print("YES");
else out.print("NO");
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: Given a number N for each i (1 < = i < = N), you have to print the number except :-
For each multiple of 3, print "Newton" instead of the number.
For each multiple of 5, print "School" instead of the number.
For numbers that are multiples of both 3 and 5, print "NewtonSchool" instead of the number.The first line of the input contains N.
<b>Constraints</b>
1 < = N < = 1000
Print N space separated number or Newton School according to the condition.Sample Input:-
3
Sample Output:-
1 2 Newton
Sample Input:-
5
Sample Output:-
1 2 Newton 4 School, I have written this Solution Code: n=int(input())
for i in range(1,n+1):
if i%3==0 and i%5==0:
print("NewtonSchool",end=" ")
elif i%3==0:
print("Newton",end=" ")
elif i%5==0:
print("School",end=" ")
else:
print(i,end=" "), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N for each i (1 < = i < = N), you have to print the number except :-
For each multiple of 3, print "Newton" instead of the number.
For each multiple of 5, print "School" instead of the number.
For numbers that are multiples of both 3 and 5, print "NewtonSchool" instead of the number.The first line of the input contains N.
<b>Constraints</b>
1 < = N < = 1000
Print N space separated number or Newton School according to the condition.Sample Input:-
3
Sample Output:-
1 2 Newton
Sample Input:-
5
Sample Output:-
1 2 Newton 4 School, I have written this Solution Code: import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
static void NewtonSchool(int n){
for(int i=1;i<=n;i++){
if(i%3==0 && i%5==0){System.out.print("NewtonSchool ");}
else if(i%5==0){System.out.print("School ");}
else if(i%3==0){System.out.print("Newton ");}
else{System.out.print(i+" ");}
}
}
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int x= sc.nextInt();
NewtonSchool(x);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Nobita wants to become rich so he came up with an idea, So, he buys some gadgets from the future at a price of C and sells them at a price of S to his friends. Now Nobita wants to know how much he gains by selling all gadget. As we all know Nobita is weak in maths help him to find the profit he getsYou don't have to worry about the input, you just have to complete the function <b>Profit()</b>
<b>Constraints:-</b>
1 <= C <= S <= 1000Print the profit Nobita gets from selling one gadget.Sample Input:-
3 5
Sample Output:-
2
Sample Input:-
9 16
Sample Output:-
7, I have written this Solution Code: def profit(C, S):
print(S - C), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Nobita wants to become rich so he came up with an idea, So, he buys some gadgets from the future at a price of C and sells them at a price of S to his friends. Now Nobita wants to know how much he gains by selling all gadget. As we all know Nobita is weak in maths help him to find the profit he getsYou don't have to worry about the input, you just have to complete the function <b>Profit()</b>
<b>Constraints:-</b>
1 <= C <= S <= 1000Print the profit Nobita gets from selling one gadget.Sample Input:-
3 5
Sample Output:-
2
Sample Input:-
9 16
Sample Output:-
7, I have written this Solution Code: static void Profit(int C, int S){
System.out.println(S-C);
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of N integers. You can perform only one type of operation. Take two integers at positions i and j such that abs(i - j) > M and exchange them. You need to find the lexicographically minimum array formed using this operation any number of times.The first line of input contains two integers N and M as mentioned in the problem statement. The next line contains N space-separated integers denoting the elements of array A
<b>Constraints/b>
1 <= M <= N <= 10<sup>5</sup>
1 <= A[i] <= 10<sup>9</sup>Print a single line containing N integers denoting the lexicographically minimum array formed after applying the given operation any number of times.Sample Input 1:
4 1
1 2 4 3
Sample Output 1:
1 2 3 4
</b>Explanation:<b>
Since, M = 1 you cannot any two consecutive elements, other than that you can exchange any other pair
Step 1: Exchange elements at positions 1 and 3. New array - 4 2 1 3
Step 2: Exchange elements at positions 1 and 4. New array - 3 2 1 4
Step 3: Exchange elements at positions 1 and 3. New array - 1 2 3 4
This is the lexicographically minimum array formed., I have written this Solution Code: #include "bits/stdc++.h"
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 = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
int a[N];
vector<int> v;
void solve(){
int n, m;
cin >> n >> m;
for(int i = 0; i < n; i++)
cin >> a[i];
if(m < n/2){
sort(a, a + n);
for(int i = 0; i < n; i++)
cout<< a[i] << " ";
return;
}
for(int i = 0; i < n; i++){
if(i >= n-m-1 && i <= m) continue;
v.push_back(a[i]);
}
sort(v.begin(), v.end());
int j = 0;
for(int i = 0; i < n; i++){
if(i >= n-m-1 && i <= m)
cout<< a[i] <<" ";
else
cout<< v[j++] <<" ";
}
}
void testcases(){
int tt = 1;
//cin >> tt;
while(tt--){
solve();
}
}
signed main() {
IOS;
clock_t start = clock();
testcases();
cerr << (double)(clock() - start)*1000/CLOCKS_PER_SEC << " ms" << endl;
return 0;
} , In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of N integers. You can perform only one type of operation. Take two integers at positions i and j such that abs(i - j) > M and exchange them. You need to find the lexicographically minimum array formed using this operation any number of times.The first line of input contains two integers N and M as mentioned in the problem statement. The next line contains N space-separated integers denoting the elements of array A
<b>Constraints/b>
1 <= M <= N <= 10<sup>5</sup>
1 <= A[i] <= 10<sup>9</sup>Print a single line containing N integers denoting the lexicographically minimum array formed after applying the given operation any number of times.Sample Input 1:
4 1
1 2 4 3
Sample Output 1:
1 2 3 4
</b>Explanation:<b>
Since, M = 1 you cannot any two consecutive elements, other than that you can exchange any other pair
Step 1: Exchange elements at positions 1 and 3. New array - 4 2 1 3
Step 2: Exchange elements at positions 1 and 4. New array - 3 2 1 4
Step 3: Exchange elements at positions 1 and 3. New array - 1 2 3 4
This is the lexicographically minimum array formed., I have written this Solution Code: import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.pow;
class InputReader {
private boolean finished = false;
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
public InputReader(InputStream stream) {
this.stream = stream;
}
public static InputReader getInputReader(boolean readFromTextFile) throws FileNotFoundException {
return ((readFromTextFile) ? new InputReader(new FileInputStream("src/input.txt"))
: new InputReader(System.in));
}
public int read() {
if (numChars == -1) {
throw new InputMismatchException();
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public int peek() {
if (numChars == -1) {
return -1;
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
return -1;
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public long nextLong() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public String nextString() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
if (Character.isValidCodePoint(c)) {
res.appendCodePoint(c);
}
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c) {
if (filter != null) {
return filter.isSpaceChar(c);
}
return isWhitespace(c);
}
public static boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
private String readLine0() {
StringBuilder buf = new StringBuilder();
int c = read();
while (c != '\n' && c != -1) {
if (c != '\r') {
buf.appendCodePoint(c);
}
c = read();
}
return buf.toString();
}
public String readLine() {
String s = readLine0();
while (s.trim().length() == 0) {
s = readLine0();
}
return s;
}
public String readLine(boolean ignoreEmptyLines) {
if (ignoreEmptyLines) {
return readLine();
} else {
return readLine0();
}
}
public BigInteger readBigInteger() {
try {
return new BigInteger(nextString());
} catch (NumberFormatException e) {
throw new InputMismatchException();
}
}
public char nextCharacter() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
return (char) c;
}
public double nextDouble() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
double res = 0;
while (!isSpaceChar(c) && c != '.') {
if (c == 'e' || c == 'E') {
return res * pow(10, nextInt());
}
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
}
if (c == '.') {
c = read();
double m = 1;
while (!isSpaceChar(c)) {
if (c == 'e' || c == 'E') {
return res * pow(10, nextInt());
}
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public boolean isExhausted() {
int value;
while (isSpaceChar(value = peek()) && value != -1) {
read();
}
return value == -1;
}
public String next() {
return nextString();
}
public SpaceCharFilter getFilter() {
return filter;
}
public void setFilter(SpaceCharFilter filter) {
this.filter = filter;
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
public int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; ++i) array[i] = nextInt();
return array;
}
public int[] nextSortedIntArray(int n) {
int array[] = nextIntArray(n);
Arrays.sort(array);
return array;
}
public int[] nextSumIntArray(int n) {
int[] array = new int[n];
array[0] = nextInt();
for (int i = 1; i < n; ++i) array[i] = array[i - 1] + nextInt();
return array;
}
public long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; ++i) array[i] = nextLong();
return array;
}
public long[] nextSumLongArray(int n) {
long[] array = new long[n];
array[0] = nextInt();
for (int i = 1; i < n; ++i) array[i] = array[i - 1] + nextInt();
return array;
}
public long[] nextSortedLongArray(int n) {
long array[] = nextLongArray(n);
Arrays.sort(array);
return array;
}
}
class Main {
public static void main(String[] args) throws FileNotFoundException {
InputReader sc = InputReader.getInputReader(false);
int n = sc.nextInt();
int m = sc.nextInt();
long[] arr = new long[n];
for(int i=0;i<n;i++){
arr[i] = sc.nextLong();
}
if(m < n-1-Math.ceil(Double.valueOf(n)/2)){
Arrays.sort(arr);
}
else{
List<Long> list = new ArrayList<>();
int len = n-1-m;
int idx = 0 , elementsFromBeg = 0;
while(elementsFromBeg < len){
list.add(arr[idx++]);
elementsFromBeg++;
}
int elementsFromEnd = 0;
idx = n-1;
while(elementsFromEnd < len){
list.add(arr[idx--]);
elementsFromEnd++;
}
Collections.sort(list);
idx = 0;
elementsFromBeg = 0;
int listidx = 0;
while(elementsFromBeg < len){
arr[idx++] = list.get(listidx++);
elementsFromBeg++;
}
elementsFromEnd = 0;
idx = n-len;
while(elementsFromEnd < len){
arr[idx++] = list.get(listidx++);
elementsFromEnd++;
}
}
for (int i = 0; i < n; i++) {
System.out.print(arr[i]+" ");
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A number is called tricky if it does not contain two adjacent 1's in its binary representation like 5 (101) 8 (100) etc. Given an integer X, your task is to print the smallest tricky number which is greater than or equal to X.The first line of input contains a single integer T denoting the number of test cases. Next T lines contain a single integer, the value of X.
Constraints:-
1 <= T <= 100000
1 <= X <= 1000000000For each test case print the smallest tricky number which is greater than or equal to X.Sample Input:-
2
6
12
Sample Output:-
8
16, 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 t = Integer.parseInt(br.readLine());
while(t-->0) {
int x = Integer.parseInt(br.readLine());
ArrayList<Integer> arrli = new ArrayList<>();
while(x != 0) {
arrli.add(x & 1);
x >>= 1;
}
arrli.add(0);
int lastBit = 0;
for(int i=1; i<arrli.size()-1; ++i) {
if(arrli.get(i) == 1 && arrli.get(i-1) == 1 && arrli.get(i+1) != 1) {
arrli.remove(i+1);
arrli.add(i+1, 1);
for(int j=i; j>=lastBit; --j){
arrli.remove(j);
arrli.add(j, 0);
}
lastBit = i+1;
}
}
long ans = 0;
for(int i=0; i<arrli.size(); ++i)
ans += (arrli.get(i))*(1<<i);
System.out.println(ans);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A number is called tricky if it does not contain two adjacent 1's in its binary representation like 5 (101) 8 (100) etc. Given an integer X, your task is to print the smallest tricky number which is greater than or equal to X.The first line of input contains a single integer T denoting the number of test cases. Next T lines contain a single integer, the value of X.
Constraints:-
1 <= T <= 100000
1 <= X <= 1000000000For each test case print the smallest tricky number which is greater than or equal to X.Sample Input:-
2
6
12
Sample Output:-
8
16, 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 1001
#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 n){
int cnt=0;
int p=sqrt(n);
for(int i=1;i<=p;i++){
if(n%i==0){
cnt++;
if(i*i!=n){cnt++;}
}
}
return cnt;
}
int dp[max1][max1];
vector<int> v;
signed main(){
int t;
cin>>t;
while(t--){
int x;
cin>>x;
vector<bool> bin;
while (x != 0)
{
bin.push_back(x&1);
x >>= 1;
}
bin.push_back(0);
int n = bin.size();
int last_final = 0;
for (int i=1; i<n-1; i++)
{
if (bin[i] == 1 && bin[i-1] == 1 && bin[i+1] != 1)
{
bin[i+1] = 1;
for (int j=i; j>=last_final; j--)
bin[j] = 0;
last_final = i+1;
}
}
int ans = 0;
for (int i =0; i<n; i++)
ans += bin[i]*(1<<i);
out(ans);
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, you need to check whether the given number is <b>Palindrome</b> or not. A number is said to be Palindrome when it reads the same from backward as forward.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>isPalindrome()</b> which contains N as a parameter.
<b>Constraints:</b>
1 <= N <= 9999You need to return "True" is the number is palindrome otherwise "False".Sample Input:
5
Sample Output:
True
Sample Input:
121
Sample Output:
True, I have written this Solution Code: static void isPalindrome(int N)
{
int digit = 0, sum = 0, temp = N;
while(N > 0)
{
digit = N %10;
sum = sum*10 + digit;
N = N/10;
}
if(sum == temp)
System.out.println("True");
else System.out.println("False");
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.