Instruction
stringlengths 261
35k
| Response
stringclasses 1
value |
|---|---|
For this Question: Given an integer N, find all possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: int AllPair(int N){
return N-1;
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers N and K. Construct a max diversity string of length N and period K. Among all possible strings, find the lexographically minimum string.
A max diverse string is a string with maximum number of different characters.
A string with period K is a string made by a string of length K repeated multiple times.
Note: You can use only lowercase characters from 'a' to 'z'.The first and the only line of input contains two integers N and K.
Constraints:
1 <= N <= 100000
1 <= K <= min(N,100)
N is divisible by K.Print the required string.Sample Input 1
4 2
Sample Output 1
abab
Sample Input 2
4 1
Sample Output 2
aaaa, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt(), k = s.nextInt();
int a = 0, b = k;
if(k > 26){
a = k - 26;
b = 26;
}
while(n != 0){
for(int i=0 ; i<a ; i++){
System.out.print((char)(97));
n--;
}
for(int i=0 ; i<b ; i++){
System.out.print((char)(i%26+97));
n--;
}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers N and K. Construct a max diversity string of length N and period K. Among all possible strings, find the lexographically minimum string.
A max diverse string is a string with maximum number of different characters.
A string with period K is a string made by a string of length K repeated multiple times.
Note: You can use only lowercase characters from 'a' to 'z'.The first and the only line of input contains two integers N and K.
Constraints:
1 <= N <= 100000
1 <= K <= min(N,100)
N is divisible by K.Print the required string.Sample Input 1
4 2
Sample Output 1
abab
Sample Input 2
4 1
Sample Output 2
aaaa, I have written this Solution Code: import copy,math
x,y = input().split()
x = int(x)
y = int(y)
s = ""
if y>26:
s = ('a'*(y-26))+("".join(chr(97+i) for i in range(26)))
else:
s = "".join(chr(97+i) for i in range(y))
print(s*(x//y)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers N and K. Construct a max diversity string of length N and period K. Among all possible strings, find the lexographically minimum string.
A max diverse string is a string with maximum number of different characters.
A string with period K is a string made by a string of length K repeated multiple times.
Note: You can use only lowercase characters from 'a' to 'z'.The first and the only line of input contains two integers N and K.
Constraints:
1 <= N <= 100000
1 <= K <= min(N,100)
N is divisible by K.Print the required string.Sample Input 1
4 2
Sample Output 1
abab
Sample Input 2
4 1
Sample Output 2
aaaa, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main()
{
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
int n,k;
cin>>n>>k;
string s(n,'a');
for(int i=0;i<n/k;++i){
for(int j=0;j<k;++j){
if(j<k-26)
s[i*k+j]='a';
else
s[i*k+j]='a'+j-max(0ll,(k-26));
}
}
cout<<s;
#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: Rick's family and Jerry are playing Tic Tac Toe. Rules are simple:
<li> Game is played in pairs.
<li> If Rick plays against anyone, Rick wins.
<li> If Jerry plays against anyone, Jerry Loses.
<li> A game between any other players is a draw.
Given a pair of players, find who wins the game or if the game is draw.Input Contains two space separated characters denoting the players that will have the match.
R denotes Rick.
J denotes Jerry.
B denotes Beth.
M denotes Morty.
S denotes Summer.If the game is draw print 'D', else print the first letter of the name of the player who wins in capital.Sample Input 1
R S
Sample Output 1
R
Sample Input 2
B J
Sample Output 2
B
Sample Input 3
M S
Sample Output 3
D, 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
char p1,p2;
cin>>p1>>p2;
if(p1=='R'||p2=='R')
cout<<"R";
else{
if(p1=='J')
cout<<p2;
else{
if(p2=='J')
cout<<p1;
else
cout<<"D";
}
}
#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: Rick's family and Jerry are playing Tic Tac Toe. Rules are simple:
<li> Game is played in pairs.
<li> If Rick plays against anyone, Rick wins.
<li> If Jerry plays against anyone, Jerry Loses.
<li> A game between any other players is a draw.
Given a pair of players, find who wins the game or if the game is draw.Input Contains two space separated characters denoting the players that will have the match.
R denotes Rick.
J denotes Jerry.
B denotes Beth.
M denotes Morty.
S denotes Summer.If the game is draw print 'D', else print the first letter of the name of the player who wins in capital.Sample Input 1
R S
Sample Output 1
R
Sample Input 2
B J
Sample Output 2
B
Sample Input 3
M S
Sample Output 3
D, I have written this Solution Code: a,b=input().split()
if(a=="R" or b=="R"):
print("R")
elif(a=="J" or b=="J"):
if(a=="J"):
print(b)
else:
print(a)
else:
print("D"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Rick's family and Jerry are playing Tic Tac Toe. Rules are simple:
<li> Game is played in pairs.
<li> If Rick plays against anyone, Rick wins.
<li> If Jerry plays against anyone, Jerry Loses.
<li> A game between any other players is a draw.
Given a pair of players, find who wins the game or if the game is draw.Input Contains two space separated characters denoting the players that will have the match.
R denotes Rick.
J denotes Jerry.
B denotes Beth.
M denotes Morty.
S denotes Summer.If the game is draw print 'D', else print the first letter of the name of the player who wins in capital.Sample Input 1
R S
Sample Output 1
R
Sample Input 2
B J
Sample Output 2
B
Sample Input 3
M S
Sample Output 3
D, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader rd = new BufferedReader(new InputStreamReader(System.in));
String[] rowcol = rd.readLine().split(" ");
String name = rowcol[0];
String name2 = rowcol[1];
if(name.equals("R")|| name2.equals("R")){
System.out.print('R');
return;
}
else if(name.equals("J")){
System.out.print(name2);
return;
}else if(name2.equals("J")){
System.out.print(name);
return;
}
else if(!name.equals("R") && !name.equals("J")){
System.out.print('D');
return;
}
else if(!name2.equals("J") && !name2.equals("R")){
System.out.print('D');
return;
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer, your task is to check whether the given integer is even or odd.
If the integer is even print 0 else if it is odd print 1.The input contains a single integer N.
Constraint:
1 ≤ N ≤10000If the integer is even print 0 else if it is odd print 1.Sample Input:-
15
Sample Output:-
1
Sample Input:-
16
Sample Output:-
0, I have written this Solution Code: import java.util.Scanner;
class Main {
public static void main (String[] args)
{
//Capture the user's input
Scanner scanner = new Scanner(System.in);
//Storing the captured value in a variable
int side = scanner.nextInt();
int area = EvenOrOdd(side);
System.out.println(area);
}
static int EvenOrOdd(int N){
return N%2;
}}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer, your task is to check whether the given integer is even or odd.
If the integer is even print 0 else if it is odd print 1.The input contains a single integer N.
Constraint:
1 ≤ N ≤10000If the integer is even print 0 else if it is odd print 1.Sample Input:-
15
Sample Output:-
1
Sample Input:-
16
Sample Output:-
0, I have written this Solution Code: inp = int(input())
if inp % 2 == 0 :
print(0)
else:
print(1), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Check if the given string is a palindrome or not?
Palindromes are a numbers, phrases or words that reads same both the ways, backward as well as forward. For example, 1331 is a palindrome because on reversing the digits the number remains the same. But 123 is not a palindrome, as on reversing the digits it becomes 321. So given a number n you have to output whether the number is a palindrome or not.
Print 1 if True and 0 if false.input contains a single string s.
Constraints:-
1<=|s|<=100000
Note:- String will only contains characters from '0' to '9'.1 or 0. where 1 means the number is palindrome and zero indicates it's not.Sample Input-1
1235321
Sample Output-1
1
Sample Input-2
6547
Sample Output-2
0
Sample Input-3
3443
Sample Output-3
1
Sample Input-4
3434
Sample Output-4
0
Explanation:-
Testcase1:-
On reversing the string it becomes 1235321 which is same as original string hence It is a palindrome, I have written this Solution Code: // str is input
function isPalindrome(str) {
// write code here
// do not console.log
// return the 1 or 0
const ans = str.split('').reverse().join('') === str ? 1 : 0
return ans
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Check if the given string is a palindrome or not?
Palindromes are a numbers, phrases or words that reads same both the ways, backward as well as forward. For example, 1331 is a palindrome because on reversing the digits the number remains the same. But 123 is not a palindrome, as on reversing the digits it becomes 321. So given a number n you have to output whether the number is a palindrome or not.
Print 1 if True and 0 if false.input contains a single string s.
Constraints:-
1<=|s|<=100000
Note:- String will only contains characters from '0' to '9'.1 or 0. where 1 means the number is palindrome and zero indicates it's not.Sample Input-1
1235321
Sample Output-1
1
Sample Input-2
6547
Sample Output-2
0
Sample Input-3
3443
Sample Output-3
1
Sample Input-4
3434
Sample Output-4
0
Explanation:-
Testcase1:-
On reversing the string it becomes 1235321 which is same as original string hence It is a palindrome, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pii pair<int,int>
#define mm (s+e)/2
#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 sz 200000
int A[2000][2000];
int vis[200][200];
int dist[200][200];
int xa[8]={1,1,-1,-1,2,2,-2,-2};
int ya[8]={2,-2,2,-2,1,-1,1,-1};
int n,m;
int val,hh;
int check(int x,int y)
{
if (x>=0 && y>=0 && x<n && y<m )return 1;
else return 0;
}
#define qw1 freopen("input1.txt", "r", stdin); freopen("output1.txt", "w", stdout);
#define qw2 freopen("input2.txt", "r", stdin); freopen("output2.txt", "w", stdout);
#define qw3 freopen("input3.txt", "r", stdin); freopen("output3.txt", "w", stdout);
#define qw4 freopen("input4.txt", "r", stdin); freopen("output4.txt", "w", stdout);
#define qw5 freopen("input5.txt", "r", stdin); freopen("output5.txt", "w", stdout);
#define qw6 freopen("input6.txt", "r", stdin); freopen("output6.txt", "w", stdout);
#define qw freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
signed main()
{
string s;
cin>>s;
int n=s.size();
int ch=1;
for(int j=0;j<=n-1;j++)
{
if(s[j]!=s[n-1-j]) ch=0;
}
cout<<ch;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Check if the given string is a palindrome or not?
Palindromes are a numbers, phrases or words that reads same both the ways, backward as well as forward. For example, 1331 is a palindrome because on reversing the digits the number remains the same. But 123 is not a palindrome, as on reversing the digits it becomes 321. So given a number n you have to output whether the number is a palindrome or not.
Print 1 if True and 0 if false.input contains a single string s.
Constraints:-
1<=|s|<=100000
Note:- String will only contains characters from '0' to '9'.1 or 0. where 1 means the number is palindrome and zero indicates it's not.Sample Input-1
1235321
Sample Output-1
1
Sample Input-2
6547
Sample Output-2
0
Sample Input-3
3443
Sample Output-3
1
Sample Input-4
3434
Sample Output-4
0
Explanation:-
Testcase1:-
On reversing the string it becomes 1235321 which is same as original string hence It is a palindrome, I have written this Solution Code: num=input()
rev=num[::-1]
if rev==num:
print("1")
else:
print("0"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Check if the given string is a palindrome or not?
Palindromes are a numbers, phrases or words that reads same both the ways, backward as well as forward. For example, 1331 is a palindrome because on reversing the digits the number remains the same. But 123 is not a palindrome, as on reversing the digits it becomes 321. So given a number n you have to output whether the number is a palindrome or not.
Print 1 if True and 0 if false.input contains a single string s.
Constraints:-
1<=|s|<=100000
Note:- String will only contains characters from '0' to '9'.1 or 0. where 1 means the number is palindrome and zero indicates it's not.Sample Input-1
1235321
Sample Output-1
1
Sample Input-2
6547
Sample Output-2
0
Sample Input-3
3443
Sample Output-3
1
Sample Input-4
3434
Sample Output-4
0
Explanation:-
Testcase1:-
On reversing the string it becomes 1235321 which is same as original string hence It is a palindrome, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str=br.readLine();
int len=str.length();
boolean temp=true;
int i=0,j=len-1;
for(i=0;i<len/2;i++){
if(str.charAt(i)!=str.charAt(j--)) temp=false;
}
if(temp) System.out.println(1);
else System.out.println(0);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a singly linked list, delete middle node of the linked list. For example, if given linked list is 1->2->3->4->5 then linked list should be modified to 1->2->4->5.
If there are even nodes, then there would be two middle nodes, we need to delete the second middle element. For example, if given linked list is 1->2->3->4->5->6 then it should be modified to 1->2->3->5->6.
In case of a single node return the head of a linked list containing only 1 node which has value -1<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>deleteMiddleElement()</b> that takes head node of the linked list as parameter.
Constraints:
1 <=N<= 1000
1 <=value<= 1000
Return the head of the modified linked listSample Input 1:
5
1 2 3 4 5
Sample Output:
1 2 4 5
Explanation: After deleting middle of the linked list, 3 will be deleted and the list will be as 1, 2, 4, 5.
Sample Input 2:
6
1 2 3 4 5 6
Sample Output:-
1 2 3 5 6
, I have written this Solution Code: public static Node deleteMiddleElement(Node head) {
int cnt=0;
Node temp=head;
while(temp!=null){
cnt++;
temp=temp.next;
}
if(cnt==1){
head.val=-1;
return head;
}
if(cnt==2){
head.next=null;
return head;
}
temp=head;
int I=1;
cnt=cnt/2;
while(I!=cnt){
temp=temp.next;
I++;
}
temp.next=temp.next.next;
return head;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Hawkeye has been assigned to eliminate n monsters, the i<sup>th</sup> of which is of type a<sub>i</sub>. In one move, he can do either of the following:
i. Shoot down atmost any k monsters. In other words, he can shoot down any set of monsters such that the size of that set is smaller than or equal to k.
ii. Shoot down all monsters of any one type.
Find the minimum number of moves it will take him to shoot down all the monsters.The first line contains one integer t — the number of test cases. Each test case consists of two lines.
The first line contains two space-separated integers n and k.
The second line contains n space-separated integers a<sub>1</sub>, a<sub>2</sub> . . . a<sub>n</sub>.
<b>Constraints:</b>
1 ≤ t ≤ 10<sup>5</sup>
1 ≤ k ≤ n ≤ 10<sup>5</sup>
1 ≤ a<sub>i</sub> ≤ n
The sum of n over all test cases does not exceed 10<sup>5</sup>. For each test case, print a single value - the minimum number of moves required.Sample input
3
7 2
1 2 3 4 4 4 4
5 3
1 2 3 1 2
5 3
5 5 5 5 5
Sample output
3
2
1
Explanation:
For the first test case, the minimum moves required is 3. One way to do so is that Hawkeye can first shoot monsters 1 and 2 in one move using the second operation.
Then he can shoot down all monsters of type 4 using the first operation, followed by shooting monster 3 by either method., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int t;
cin>>t;
while(t--)
{
int n, k;
cin>>n>>k;
vector<int> a(n);
for(auto &i:a)
cin>>i;
map<int, int> type;
int sm = 0;
int cnt = 0;
for(auto i:a)
type[i]++;
for(auto i:type)
if(i.second >= k)
cnt++;
else
sm+=i.second;
cnt += (sm + k-1)/k;
cout<<cnt<<endl;
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cerr.tie(NULL);
#ifndef ONLINE_JUDGE
if (fopen("INPUT.txt", "r"))
{
freopen("INPUT.txt", "r", stdin);
freopen("OUTPUT.txt", "w", stdout);
}
#endif
solve();
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Hawkeye has been assigned to eliminate n monsters, the i<sup>th</sup> of which is of type a<sub>i</sub>. In one move, he can do either of the following:
i. Shoot down atmost any k monsters. In other words, he can shoot down any set of monsters such that the size of that set is smaller than or equal to k.
ii. Shoot down all monsters of any one type.
Find the minimum number of moves it will take him to shoot down all the monsters.The first line contains one integer t — the number of test cases. Each test case consists of two lines.
The first line contains two space-separated integers n and k.
The second line contains n space-separated integers a<sub>1</sub>, a<sub>2</sub> . . . a<sub>n</sub>.
<b>Constraints:</b>
1 ≤ t ≤ 10<sup>5</sup>
1 ≤ k ≤ n ≤ 10<sup>5</sup>
1 ≤ a<sub>i</sub> ≤ n
The sum of n over all test cases does not exceed 10<sup>5</sup>. For each test case, print a single value - the minimum number of moves required.Sample input
3
7 2
1 2 3 4 4 4 4
5 3
1 2 3 1 2
5 3
5 5 5 5 5
Sample output
3
2
1
Explanation:
For the first test case, the minimum moves required is 3. One way to do so is that Hawkeye can first shoot monsters 1 and 2 in one move using the second operation.
Then he can shoot down all monsters of type 4 using the first operation, followed by shooting monster 3 by either method., I have written this Solution Code: #include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;}
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define setprec cout << fixed << showpoint << setprecision(20);
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int power (int a, int b = mod - 2)
{
int res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
read(t);
int lim = 3e5;
assert(1 <= t && t <= 3e5);
int nsum = 0;
while (t--)
{
readb(n, k);
readarr(a, n);
assert(1 <= n && n <= lim);
assert(1 <= k && k <= n);
FOR (i, 1, n) assert(1 <= a[i] && a[i] <= n);
int freq[n + 1] = {};
FOR (i, 1, n) freq[a[i]]++;
int cnt = 0, sum = 0;
FOR (i, 1, n)
{
if (freq[i] < k) sum += freq[i];
else cnt++;
}
int ans = cnt + (sum + k - 1)/k;
print(ans);
nsum += n;
}
assert(nsum <= lim);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Hawkeye has been assigned to eliminate n monsters, the i<sup>th</sup> of which is of type a<sub>i</sub>. In one move, he can do either of the following:
i. Shoot down atmost any k monsters. In other words, he can shoot down any set of monsters such that the size of that set is smaller than or equal to k.
ii. Shoot down all monsters of any one type.
Find the minimum number of moves it will take him to shoot down all the monsters.The first line contains one integer t — the number of test cases. Each test case consists of two lines.
The first line contains two space-separated integers n and k.
The second line contains n space-separated integers a<sub>1</sub>, a<sub>2</sub> . . . a<sub>n</sub>.
<b>Constraints:</b>
1 ≤ t ≤ 10<sup>5</sup>
1 ≤ k ≤ n ≤ 10<sup>5</sup>
1 ≤ a<sub>i</sub> ≤ n
The sum of n over all test cases does not exceed 10<sup>5</sup>. For each test case, print a single value - the minimum number of moves required.Sample input
3
7 2
1 2 3 4 4 4 4
5 3
1 2 3 1 2
5 3
5 5 5 5 5
Sample output
3
2
1
Explanation:
For the first test case, the minimum moves required is 3. One way to do so is that Hawkeye can first shoot monsters 1 and 2 in one move using the second operation.
Then he can shoot down all monsters of type 4 using the first operation, followed by shooting monster 3 by either method., I have written this Solution Code: import math
from collections import defaultdict
n = int(input())
def utility(n,k,arr):
hm = defaultdict(int)
for i in range(n):
hm[arr[i]]+=1
arr1 = []
for key in hm.keys():
arr1.append([key,hm[key]])
arr1 = sorted(arr1,key = lambda x : x[1],reverse = True)
count = 0
s = 0
for ele in arr1:
if(ele[1] > k ):
count+=1
else:
s+=ele[1]
ans = count + math.ceil(s/k)
return(ans )
for i in range(n):
arr = [int(x) for x in input().split()]
n,k = arr[0],arr[1]
arr = [int(x) for x in input().split()]
print(utility(n,k,arr)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Hawkeye has been assigned to eliminate n monsters, the i<sup>th</sup> of which is of type a<sub>i</sub>. In one move, he can do either of the following:
i. Shoot down atmost any k monsters. In other words, he can shoot down any set of monsters such that the size of that set is smaller than or equal to k.
ii. Shoot down all monsters of any one type.
Find the minimum number of moves it will take him to shoot down all the monsters.The first line contains one integer t — the number of test cases. Each test case consists of two lines.
The first line contains two space-separated integers n and k.
The second line contains n space-separated integers a<sub>1</sub>, a<sub>2</sub> . . . a<sub>n</sub>.
<b>Constraints:</b>
1 ≤ t ≤ 10<sup>5</sup>
1 ≤ k ≤ n ≤ 10<sup>5</sup>
1 ≤ a<sub>i</sub> ≤ n
The sum of n over all test cases does not exceed 10<sup>5</sup>. For each test case, print a single value - the minimum number of moves required.Sample input
3
7 2
1 2 3 4 4 4 4
5 3
1 2 3 1 2
5 3
5 5 5 5 5
Sample output
3
2
1
Explanation:
For the first test case, the minimum moves required is 3. One way to do so is that Hawkeye can first shoot monsters 1 and 2 in one move using the second operation.
Then he can shoot down all monsters of type 4 using the first operation, followed by shooting monster 3 by either method., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
try {
System.setIn(new FileInputStream("input.txt"));
System.setOut(new PrintStream(new FileOutputStream("output.txt")));
} catch (Exception e) {
System.err.println("Error");
}
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();
while(t--!=0) {
int n = in.readInt();
int k = in.readInt();
int max = 0;
int arr1[] = new int[n];
for(int i=0;i<n;i++) {
int x = in.readInt();
arr1[i]=x;
if(x>max) {
max = x;
}
}
int arr[] = new int[max+2];
for(int i=0;i<n;i++) {
int x = arr1[i];
arr[x]++;
}
int killedwithsame = 0;
int tobekilledwithk = 0;
for(int i=0;i<max+1;i++) {
if(arr[i]>=k) {
killedwithsame++;
}else {
tobekilledwithk+=arr[i];
}
}
int ans = killedwithsame;
if(tobekilledwithk%k==0) {
ans+=(tobekilledwithk/k);
}else {
ans+=(tobekilledwithk/k);
ans+=1;
}
out.printLine(ans);
}
}
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: Given an integer N, find the Nth number in the fibonacci series. Consider 0 and 1 to be the seed values.
In the fibonacci series, each number (Fibonacci number) is the sum of the two preceding numbers. The series with 0 and 1 as seed values will go like -
0, 1, 1, 2, 3, 5 and so on..<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>Fibonacci()</b> that takes the integer N as a parameter.
Constraints:
1 ≤ T ≤ 10
1 ≤ N ≤ 30Return the Nth Fibonacci number.Sample Input
2
3
5
Sample Output
2
5
Explaination:
Test case 1-> N = 2
Seed values are 0 and 1
So, F<sub>1</sub> = 0 + 1 = 1
F<sub>2</sub> = 1 + F<sub>1</sub> = 1 + 1 = 2, I have written this Solution Code: static long Fibonacci(long n)
{
if (n == 0)
{ return 0;}
else if(n==1){
return 1;
}
return Fibonacci(n-1) + Fibonacci(n-2);
} , In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find the Nth number in the fibonacci series. Consider 0 and 1 to be the seed values.
In the fibonacci series, each number (Fibonacci number) is the sum of the two preceding numbers. The series with 0 and 1 as seed values will go like -
0, 1, 1, 2, 3, 5 and so on..<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>Fibonacci()</b> that takes the integer N as a parameter.
Constraints:
1 ≤ T ≤ 10
1 ≤ N ≤ 30Return the Nth Fibonacci number.Sample Input
2
3
5
Sample Output
2
5
Explaination:
Test case 1-> N = 2
Seed values are 0 and 1
So, F<sub>1</sub> = 0 + 1 = 1
F<sub>2</sub> = 1 + F<sub>1</sub> = 1 + 1 = 2, I have written this Solution Code: // n is the input number
function fibonacci(n) {
// write code here
// do not console.log
// return the answer as a number
if (n == 1 || n == 0) return n;
return fibonacci(n-2) + fibonacci(n-1)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find all possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: int AllPair(int N){
return N-1;
}, 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 possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: static int AllPair(int N){
return N-1;
}, 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 possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: def AllPair(N):
return N-1;, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find all possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: int AllPair(int N){
return N-1;
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code:
def distributingMoney(x,y,z,k) :
# Final result of summation of divisors
result = x+y+z+k;
if result%3!=0:
return 0
result =result/3
if result<x or result<y or result<z:
return 0
return 1;
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: int distributingMoney(long x, long y, long z,long k){
long long sum=x+y+z+k;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: public static int distributingMoney(long x, long y, long z, long K){
long sum=0;
sum+=x+y+z+K;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: int distributingMoney(long x, long y, long z,long k){
long int sum=x+y+z+k;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Check if the given string is a palindrome or not?
Palindromes are a numbers, phrases or words that reads same both the ways, backward as well as forward. For example, 1331 is a palindrome because on reversing the digits the number remains the same. But 123 is not a palindrome, as on reversing the digits it becomes 321. So given a number n you have to output whether the number is a palindrome or not.
Print 1 if True and 0 if false.input contains a single string s.
Constraints:-
1<=|s|<=100000
Note:- String will only contains characters from '0' to '9'.1 or 0. where 1 means the number is palindrome and zero indicates it's not.Sample Input-1
1235321
Sample Output-1
1
Sample Input-2
6547
Sample Output-2
0
Sample Input-3
3443
Sample Output-3
1
Sample Input-4
3434
Sample Output-4
0
Explanation:-
Testcase1:-
On reversing the string it becomes 1235321 which is same as original string hence It is a palindrome, I have written this Solution Code: // str is input
function isPalindrome(str) {
// write code here
// do not console.log
// return the 1 or 0
const ans = str.split('').reverse().join('') === str ? 1 : 0
return ans
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Check if the given string is a palindrome or not?
Palindromes are a numbers, phrases or words that reads same both the ways, backward as well as forward. For example, 1331 is a palindrome because on reversing the digits the number remains the same. But 123 is not a palindrome, as on reversing the digits it becomes 321. So given a number n you have to output whether the number is a palindrome or not.
Print 1 if True and 0 if false.input contains a single string s.
Constraints:-
1<=|s|<=100000
Note:- String will only contains characters from '0' to '9'.1 or 0. where 1 means the number is palindrome and zero indicates it's not.Sample Input-1
1235321
Sample Output-1
1
Sample Input-2
6547
Sample Output-2
0
Sample Input-3
3443
Sample Output-3
1
Sample Input-4
3434
Sample Output-4
0
Explanation:-
Testcase1:-
On reversing the string it becomes 1235321 which is same as original string hence It is a palindrome, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pii pair<int,int>
#define mm (s+e)/2
#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 sz 200000
int A[2000][2000];
int vis[200][200];
int dist[200][200];
int xa[8]={1,1,-1,-1,2,2,-2,-2};
int ya[8]={2,-2,2,-2,1,-1,1,-1};
int n,m;
int val,hh;
int check(int x,int y)
{
if (x>=0 && y>=0 && x<n && y<m )return 1;
else return 0;
}
#define qw1 freopen("input1.txt", "r", stdin); freopen("output1.txt", "w", stdout);
#define qw2 freopen("input2.txt", "r", stdin); freopen("output2.txt", "w", stdout);
#define qw3 freopen("input3.txt", "r", stdin); freopen("output3.txt", "w", stdout);
#define qw4 freopen("input4.txt", "r", stdin); freopen("output4.txt", "w", stdout);
#define qw5 freopen("input5.txt", "r", stdin); freopen("output5.txt", "w", stdout);
#define qw6 freopen("input6.txt", "r", stdin); freopen("output6.txt", "w", stdout);
#define qw freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
signed main()
{
string s;
cin>>s;
int n=s.size();
int ch=1;
for(int j=0;j<=n-1;j++)
{
if(s[j]!=s[n-1-j]) ch=0;
}
cout<<ch;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Check if the given string is a palindrome or not?
Palindromes are a numbers, phrases or words that reads same both the ways, backward as well as forward. For example, 1331 is a palindrome because on reversing the digits the number remains the same. But 123 is not a palindrome, as on reversing the digits it becomes 321. So given a number n you have to output whether the number is a palindrome or not.
Print 1 if True and 0 if false.input contains a single string s.
Constraints:-
1<=|s|<=100000
Note:- String will only contains characters from '0' to '9'.1 or 0. where 1 means the number is palindrome and zero indicates it's not.Sample Input-1
1235321
Sample Output-1
1
Sample Input-2
6547
Sample Output-2
0
Sample Input-3
3443
Sample Output-3
1
Sample Input-4
3434
Sample Output-4
0
Explanation:-
Testcase1:-
On reversing the string it becomes 1235321 which is same as original string hence It is a palindrome, I have written this Solution Code: num=input()
rev=num[::-1]
if rev==num:
print("1")
else:
print("0"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Check if the given string is a palindrome or not?
Palindromes are a numbers, phrases or words that reads same both the ways, backward as well as forward. For example, 1331 is a palindrome because on reversing the digits the number remains the same. But 123 is not a palindrome, as on reversing the digits it becomes 321. So given a number n you have to output whether the number is a palindrome or not.
Print 1 if True and 0 if false.input contains a single string s.
Constraints:-
1<=|s|<=100000
Note:- String will only contains characters from '0' to '9'.1 or 0. where 1 means the number is palindrome and zero indicates it's not.Sample Input-1
1235321
Sample Output-1
1
Sample Input-2
6547
Sample Output-2
0
Sample Input-3
3443
Sample Output-3
1
Sample Input-4
3434
Sample Output-4
0
Explanation:-
Testcase1:-
On reversing the string it becomes 1235321 which is same as original string hence It is a palindrome, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str=br.readLine();
int len=str.length();
boolean temp=true;
int i=0,j=len-1;
for(i=0;i<len/2;i++){
if(str.charAt(i)!=str.charAt(j--)) temp=false;
}
if(temp) System.out.println(1);
else System.out.println(0);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given the radius of the circle, your task is to calculate its area.
<b>Note:- </b>
(i) take π as 3.14.
(ii) Print the area up to 2 decimal places.<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 radius of the circle as the parameter.
<b>Constraints:</b>
1 <= radius <=98Return the area of circle.Sample Input:
7
Sample Output:
153.86
Sample Input:
14
Sample Output:
615.44, I have written this Solution Code: def Area(side):
return round(3.14*side*side,2), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given the radius of the circle, your task is to calculate its area.
<b>Note:- </b>
(i) take π as 3.14.
(ii) Print the area up to 2 decimal places.<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 radius of the circle as the parameter.
<b>Constraints:</b>
1 <= radius <=98Return the area of circle.Sample Input:
7
Sample Output:
153.86
Sample Input:
14
Sample Output:
615.44, I have written this Solution Code: static float Area(int radius){
return (float)(3.14*radius*radius);
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a singly linked list, delete middle node of the linked list. For example, if given linked list is 1->2->3->4->5 then linked list should be modified to 1->2->4->5.
If there are even nodes, then there would be two middle nodes, we need to delete the second middle element. For example, if given linked list is 1->2->3->4->5->6 then it should be modified to 1->2->3->5->6.
In case of a single node return the head of a linked list containing only 1 node which has value -1<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>deleteMiddleElement()</b> that takes head node of the linked list as parameter.
Constraints:
1 <=N<= 1000
1 <=value<= 1000
Return the head of the modified linked listSample Input 1:
5
1 2 3 4 5
Sample Output:
1 2 4 5
Explanation: After deleting middle of the linked list, 3 will be deleted and the list will be as 1, 2, 4, 5.
Sample Input 2:
6
1 2 3 4 5 6
Sample Output:-
1 2 3 5 6
, I have written this Solution Code: public static Node deleteMiddleElement(Node head) {
int cnt=0;
Node temp=head;
while(temp!=null){
cnt++;
temp=temp.next;
}
if(cnt==1){
head.val=-1;
return head;
}
if(cnt==2){
head.next=null;
return head;
}
temp=head;
int I=1;
cnt=cnt/2;
while(I!=cnt){
temp=temp.next;
I++;
}
temp.next=temp.next.next;
return head;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, subtract the first digit of the number N from it i. e if n is 245 then subtract 2 from it making it 245-2 = 243. Keep on doing this operation until the number becomes 0.
Your task is to calculate the number of operation required to make this number N zero.<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>Operations()</b> that takes the integer N as parameter.
<b>Constraints:</b>
1 <= N <= 1000000000Return the number of operationsSample Input:-
21
Sample Output:-
12
Explanation:-
21, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 0
Sample Input:-
5
Sample Output:-
1, I have written this Solution Code: int Operations(int n){
int ans=0;
int cnt=0;
int p=n;
int res=n;
while(res/10>0){
cnt=0;
p=res;
n=res;
while(n/10>0){
cnt++;
n=n/10;}
int x=1;
while(cnt--){
x*=10;
}
int t=p/x;
int y=p%x;
ans+=(y/t+1);
res=res-t*(y/t+1);
}
ans++;
return ans;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, subtract the first digit of the number N from it i. e if n is 245 then subtract 2 from it making it 245-2 = 243. Keep on doing this operation until the number becomes 0.
Your task is to calculate the number of operation required to make this number N zero.<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>Operations()</b> that takes the integer N as parameter.
<b>Constraints:</b>
1 <= N <= 1000000000Return the number of operationsSample Input:-
21
Sample Output:-
12
Explanation:-
21, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 0
Sample Input:-
5
Sample Output:-
1, I have written this Solution Code: public static int Operations(int n){
int ans=0;
int cnt=0;
int p=n;
int res=n;
while(res/10>0){
cnt=0;
p=res;
n=res;
while(n/10>0){
cnt++;
n=n/10;}
int x=1;
while(cnt-->0){
x*=10;
}
int t=p/x;
int y=p%x;
ans+=(y/t+1);
res=res-t*(y/t+1);
}
ans++;
return ans;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, subtract the first digit of the number N from it i. e if n is 245 then subtract 2 from it making it 245-2 = 243. Keep on doing this operation until the number becomes 0.
Your task is to calculate the number of operation required to make this number N zero.<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>Operations()</b> that takes the integer N as parameter.
<b>Constraints:</b>
1 <= N <= 1000000000Return the number of operationsSample Input:-
21
Sample Output:-
12
Explanation:-
21, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 0
Sample Input:-
5
Sample Output:-
1, I have written this Solution Code: def Operations(N) :
ans=0
cnt=0
p=N
res=N
while(res//10>0):
cnt=0
p=res
n=res
while(n//10>0):
cnt=cnt+1
n=n/10
x=pow(10,cnt)
t=p//x
y=p%x
ans=ans+(y//t+1)
res=res-t*(y//t+1)
ans=ans+1
return ans
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, subtract the first digit of the number N from it i. e if n is 245 then subtract 2 from it making it 245-2 = 243. Keep on doing this operation until the number becomes 0.
Your task is to calculate the number of operation required to make this number N zero.<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>Operations()</b> that takes the integer N as parameter.
<b>Constraints:</b>
1 <= N <= 1000000000Return the number of operationsSample Input:-
21
Sample Output:-
12
Explanation:-
21, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 0
Sample Input:-
5
Sample Output:-
1, I have written this Solution Code: int Operations(int n){
int ans=0;
int cnt=0;
int p=n;
int res=n;
while(res/10>0){
cnt=0;
p=res;
n=res;
while(n/10>0){
cnt++;
n=n/10;}
int x=1;
while(cnt--){
x*=10;
}
int t=p/x;
int y=p%x;
ans+=(y/t+1);
res=res-t*(y/t+1);
}
ans++;
return ans;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, 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;
void print(int dn, int from, int to){
cout << dn << ":" << (char)('A'+from-1) << "->" << (char)('A'+to-1) << endl;
}
void rec(int n, int src, int des, int aux){
if(n == 0)
return;
rec(n-1, src, aux, des);
print(n, src, des);
rec(n-1, aux, des, src);
}
signed main() {
IOS;
int n; cin >> n;
rec(n, 1, 3, 2);
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: # Recursive Python function to solve the tower of hanoi
def TowerOfHanoi(n , source, destination, auxiliary):
if n==1:
#print ("1:",source,"->",destination)
print("1:%s->%s"%(source,destination))
return
TowerOfHanoi(n-1, source, auxiliary, destination)
#print (n,"%d:",source,"->",destination)
print("%d:%s->%s"%(n,source,destination))
TowerOfHanoi(n-1, auxiliary, destination, source)
# Driver code
n = int(input())
TowerOfHanoi(n,'A','C','B'), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: // n is the number of disks
function towerOfHanoiSequence(n) {
// write code here
// console.log the seqence steps
function towerOfHanoi(n, from_rod, to_rod, aux_rod) {
if (n == 0) {
return;
}
towerOfHanoi(n - 1, from_rod, aux_rod, to_rod);
console.log(`${n}:${from_rod}->${to_rod}`)
towerOfHanoi(n - 1, aux_rod, to_rod, from_rod);
}
towerOfHanoi(n,'A','C','B')
}
, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod)
{
if (n == 1)
{
System.out.println("1:" + from_rod + "->" + to_rod);
return;
}
towerOfHanoi(n-1, from_rod, aux_rod, to_rod);
System.out.println(n + ":" + from_rod + "->" + to_rod);
towerOfHanoi(n-1, aux_rod, to_rod, from_rod);
}
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
towerOfHanoi(n, 'A', 'C', 'B');
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhijit has an Array <b>Arr</b> which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e <b> he changes an element X to M if X%M=0.</b>
Your task is to tell whether the given array can be transformed to <b>strictly increasing</b> by performing the operation given above.First line of input contains the size of the array N. Next line of input contains N space- separated integers depicting the values of the array Arr.
Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print "YES" if the array can be transformed in the strictly increasing order else print "NO".Sample Input:-
5
1 2 16 16 16
Sample Output:-
YES
Sample Input:-
4
1 3 8 4
Sample Output:-
NO, I have written this Solution Code: // arr is the array of numbers, n is the number fo elements
function increaseArray(arr, n) {
// write code here
// do not console.log
// return "YES" or "NO"
let cnt = 2;
for (let i = 1; i < n; i++) {
while (cnt <= arr[i] && arr[i] % cnt != 0) {
cnt++;
}
if (cnt > arr[i]) { return "NO" }
cnt++;
}
return "YES"
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhijit has an Array <b>Arr</b> which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e <b> he changes an element X to M if X%M=0.</b>
Your task is to tell whether the given array can be transformed to <b>strictly increasing</b> by performing the operation given above.First line of input contains the size of the array N. Next line of input contains N space- separated integers depicting the values of the array Arr.
Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print "YES" if the array can be transformed in the strictly increasing order else print "NO".Sample Input:-
5
1 2 16 16 16
Sample Output:-
YES
Sample Input:-
4
1 3 8 4
Sample Output:-
NO, I have written this Solution Code: #include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];}
int cnt=2;
for(int i=1;i<n;i++){
while(cnt<=a[i] && a[i]%cnt!=0){
cnt++;}
if(cnt>a[i]){cout<<"NO";return 0;}
cnt++;
}
cout<<"YES";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhijit has an Array <b>Arr</b> which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e <b> he changes an element X to M if X%M=0.</b>
Your task is to tell whether the given array can be transformed to <b>strictly increasing</b> by performing the operation given above.First line of input contains the size of the array N. Next line of input contains N space- separated integers depicting the values of the array Arr.
Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print "YES" if the array can be transformed in the strictly increasing order else print "NO".Sample Input:-
5
1 2 16 16 16
Sample Output:-
YES
Sample Input:-
4
1 3 8 4
Sample Output:-
NO, I have written this Solution Code: n = int(input())
lst = list(map(int, input().split()))
count = 1
ls = []
for i in range(n):
if (lst[i]%count == 0):
lst[i] = count
ls.append(lst[i])
count += 1
change = 0
while( count > lst[i-1] and count <= lst[i]):
if (lst[i]%count == 0) :
lst[i] = count
change = 1
ls.append(lst[i])
count += 1
break
else:
count += 1
if len(ls) == n:
print("YES")
else:
print("NO"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhijit has an Array <b>Arr</b> which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e <b> he changes an element X to M if X%M=0.</b>
Your task is to tell whether the given array can be transformed to <b>strictly increasing</b> by performing the operation given above.First line of input contains the size of the array N. Next line of input contains N space- separated integers depicting the values of the array Arr.
Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print "YES" if the array can be transformed in the strictly increasing order else print "NO".Sample Input:-
5
1 2 16 16 16
Sample Output:-
YES
Sample Input:-
4
1 3 8 4
Sample Output:-
NO, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args)throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String str[] = br.readLine().split(" ");
boolean flag=true;
int arr[] = new int[n];
for(int i=0;i<n;i++)
arr[i]=Integer.parseInt(str[i]);
arr[0]=1;
int j=2;
for(int i=1;i<n;i++){
if(arr[i]%j==0)
j=j+1;
else if((arr[i]%j)!=0 && (arr[i]/j)>=1){
int fight=1;
while(fight==1){
for(int x=j+1;x<=arr[i];x++){
if(arr[i]%x==0){
j=x+1;
fight=0;
break;
}
else
fight=1;
}
}
}
else
flag=false;
}
if(flag)
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: Given an array A[] of size N, containing positive integers. You need to print the sum and mean (floor value) of given numbers.<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>SumAndMean()</b> that takes the Array and the integer N as parameters.
<b>Constraints:-</b>
1 ≤ N ≤ 100
1 ≤ A[i] ≤ 100Print the Sum and the Mean of the array separated by a space.Sample Input:
5
1 2 19 28 5
Sample Output:
55 11
Sample Input:-
4
2 8 3 4
Sample Output:-
17 4
<b>Explanation:</b>
Test case 1: For an array of 5 elements, the sum is (1 + 2 + 19 + 28 + 5) = 55, mean is (1 + 2 + 19 + 28 + 5)/5 = 11. The mean is 11.
Test case 2: For an array of 4 elements, the sum is (2 + 8 + 3 + 4) = 17, and the mean is floor((2 + 8 + 3 + 4)/4) = 4. Mean is floor(17/4) = 4, I have written this Solution Code: // arr is the array of numbers, n is the number of elements
function sumAndMean(arr, n) {
// write code here
// do not console.log
// return the an array of two element where first element is sum and other is mean
const sum = arr.reduce((a, b) => a + b, 0)
return [sum, Math.floor(sum / n)]
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A[] of size N, containing positive integers. You need to print the sum and mean (floor value) of given numbers.<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>SumAndMean()</b> that takes the Array and the integer N as parameters.
<b>Constraints:-</b>
1 ≤ N ≤ 100
1 ≤ A[i] ≤ 100Print the Sum and the Mean of the array separated by a space.Sample Input:
5
1 2 19 28 5
Sample Output:
55 11
Sample Input:-
4
2 8 3 4
Sample Output:-
17 4
<b>Explanation:</b>
Test case 1: For an array of 5 elements, the sum is (1 + 2 + 19 + 28 + 5) = 55, mean is (1 + 2 + 19 + 28 + 5)/5 = 11. The mean is 11.
Test case 2: For an array of 4 elements, the sum is (2 + 8 + 3 + 4) = 17, and the mean is floor((2 + 8 + 3 + 4)/4) = 4. Mean is floor(17/4) = 4, I have written this Solution Code: class Solution {
public static void SumAndMean(int arr[],int N){
int sum=0;
for(int i=0;i<N;i++){
sum+=arr[i];
}
System.out.print(sum + " " + sum/N);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A[] of size N, containing positive integers. You need to print the sum and mean (floor value) of given numbers.<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>SumAndMean()</b> that takes the Array and the integer N as parameters.
<b>Constraints:-</b>
1 ≤ N ≤ 100
1 ≤ A[i] ≤ 100Print the Sum and the Mean of the array separated by a space.Sample Input:
5
1 2 19 28 5
Sample Output:
55 11
Sample Input:-
4
2 8 3 4
Sample Output:-
17 4
<b>Explanation:</b>
Test case 1: For an array of 5 elements, the sum is (1 + 2 + 19 + 28 + 5) = 55, mean is (1 + 2 + 19 + 28 + 5)/5 = 11. The mean is 11.
Test case 2: For an array of 4 elements, the sum is (2 + 8 + 3 + 4) = 17, and the mean is floor((2 + 8 + 3 + 4)/4) = 4. Mean is floor(17/4) = 4, I have written this Solution Code: N = int(input())
inputString = input()
integerArr = inputString.split()
computedintegerArr = []
totalcomputedinteger = 0
for integer in integerArr:
computedintegerArr.append(int(integer))
for computedvalue in computedintegerArr:
totalcomputedinteger += computedvalue
print(totalcomputedinteger, totalcomputedinteger//N)
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code:
def distributingMoney(x,y,z,k) :
# Final result of summation of divisors
result = x+y+z+k;
if result%3!=0:
return 0
result =result/3
if result<x or result<y or result<z:
return 0
return 1;
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: int distributingMoney(long x, long y, long z,long k){
long long sum=x+y+z+k;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: public static int distributingMoney(long x, long y, long z, long K){
long sum=0;
sum+=x+y+z+K;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: int distributingMoney(long x, long y, long z,long k){
long int sum=x+y+z+k;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: def two_way_sort(arr, arr_len):
l, r = 0, arr_len - 1
k = 0
while(l < r):
while(arr[l] % 2 != 0):
l += 1
k += 1
while(arr[r] % 2 == 0 and l < r):
r -= 1
if(l < r):
arr[l], arr[r] = arr[r], arr[l]
odd = arr[:k]
even = arr[k:]
odd.sort(reverse = True)
even.sort()
odd.extend(even)
return odd
n = int(input())
lst = input()
arr = lst.split()
for i in range(len(arr)):
arr[i] = int(arr[i])
result = two_way_sort(arr, n)
for i in result:
print(str(i), 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 positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> odd,even;
int a;
for(int i=0;i<n;i++){
cin>>a;
if(a&1){odd.emplace_back(a);}
else{
even.emplace_back(a);
}
}
sort(odd.begin(),odd.end());
sort(even.begin(),even.end());
for(int i=odd.size()-1;i>=0;i--){
cout<<odd[i]<<" ";
}
for(int i=0;i<even.size();i++){
cout<<even[i]<<" ";
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: function sortEvenOdd(arr, arrSize)
{
var even = [];
var odd = [];
for(let i = 0; i < arrSize; ++i)
{
if((arr[i]) % 2 === 0)
even.push(arr[i]);
else
odd.push(arr[i]);
}
even.sort((x, y) => (x - y));
odd.sort((x, y) => (x - y));
let res = [];
for(let i = odd.length - 1; i >= 0; i--)
res.push(odd[i]);
for(let i = 0; i < even.length; i++)
res.push(even[i]);
return res;
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 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));
PrintWriter pw = new PrintWriter(System.out);
int n = Integer.parseInt(br.readLine());
long[] arr = new long[n];
String[] raw = br.readLine().split("\\s+");
int eCount = 0;
for (int i = 0; i < n; i++) {
long tmp = Long.parseLong(raw[i]);
if (tmp % 2 == 0) arr[i] = tmp;
else arr[i] = -tmp;
}
Arrays.sort(arr);
int k = 0;
while (arr[k] % 2 != 0) {
arr[k] = -arr[k];
k++;
}
for (int i = 0; i < n; i++)
pw.print(arr[i] + " ");
pw.println();
pw.close();
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a linked list consisting of N nodes and two integers M and K. Your task is to add element K at the Mth position from the start of the linked list<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>addElement()</b> that takes head node, M(position of element to be inserted) and K(the element to be inserted) as parameter.
Constraints:
1 <= M <=N <= 1000
1 <=K, Node.data<= 1000Return the head of the modified linked listSample Input:-
5 3 2
1 3 2 4 5
Sample Output:-
1 3 2 2 4 5
Explanation:-
here M is 3 and K is 2
so we insert 2 at the 3rd position, resulting list will be 1 3 2 2 4 5
Sample Input 2:-
5 2 6
1 2 3 4 5
Sample Output 2:-
1 6 2 3 4 5
, I have written this Solution Code: public static Node addElement(Node head,int k,int pos) {
int cnt=1;
if(pos==1){Node temp=new Node(k);
temp.next=head;return temp;}
Node temp=head;
while(cnt!=pos-1){
temp=temp.next;
cnt++;
}
Node x= new Node(k);
x.next=temp.next;
temp.next=x;
return head;}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Calculators are widely used devices nowadays. It makes calculations easier and faster. A simple calculator consists of the following operators:
1. '+': adding two numbers
2. '- ': subtraction
3. '*': multiplying numbers
4. '/': division
You will be given operator '+' or '- ' or '*' or '/' followed by two operands(integers), you need to perform a mathematical operation based on a given operator.
If '/' operator is used, print the integer value after divisionUser task:
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>calculator()</b> which contains operator(any one of given in the constraints), and two operands i.e. two integers.
<b>Constraints:</b>
operators - {+, - , *, /}
1 <= integers <= 10^4You need to return the result. If '/' operator is used, return the integer value after division.Sample Input
*
10 15
Sample Output
150
Explanation:
10*15 = 150
Sample Input:
/
15 4
Sample output:
3
Explanation:
15/4 = 3.75; floor(3.75) = 3, I have written this Solution Code: function calculate(op,num1,num2) {
// write code here
// return the output using return keyword
// do not use console.log here
switch (op) {
case '+':return num1 + num2
case '-' : return num1 - num2
case '*' : return num1 * num2
case '/' : return Math.floor(num1/num2)
default:
break;
}
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Calculators are widely used devices nowadays. It makes calculations easier and faster. A simple calculator consists of the following operators:
1. '+': adding two numbers
2. '- ': subtraction
3. '*': multiplying numbers
4. '/': division
You will be given operator '+' or '- ' or '*' or '/' followed by two operands(integers), you need to perform a mathematical operation based on a given operator.
If '/' operator is used, print the integer value after divisionUser task:
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>calculator()</b> which contains operator(any one of given in the constraints), and two operands i.e. two integers.
<b>Constraints:</b>
operators - {+, - , *, /}
1 <= integers <= 10^4You need to return the result. If '/' operator is used, return the integer value after division.Sample Input
*
10 15
Sample Output
150
Explanation:
10*15 = 150
Sample Input:
/
15 4
Sample output:
3
Explanation:
15/4 = 3.75; floor(3.75) = 3, I have written this Solution Code: def calculator(operator,a,b):
if(operator == '/'):
print(a//b)
if(operator == '*'):
print(a*b)
if(operator == '+'):
print(a+b)
if(operator == '-'):
print(a-b), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Calculators are widely used devices nowadays. It makes calculations easier and faster. A simple calculator consists of the following operators:
1. '+': adding two numbers
2. '- ': subtraction
3. '*': multiplying numbers
4. '/': division
You will be given operator '+' or '- ' or '*' or '/' followed by two operands(integers), you need to perform a mathematical operation based on a given operator.
If '/' operator is used, print the integer value after divisionUser task:
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>calculator()</b> which contains operator(any one of given in the constraints), and two operands i.e. two integers.
<b>Constraints:</b>
operators - {+, - , *, /}
1 <= integers <= 10^4You need to return the result. If '/' operator is used, return the integer value after division.Sample Input
*
10 15
Sample Output
150
Explanation:
10*15 = 150
Sample Input:
/
15 4
Sample output:
3
Explanation:
15/4 = 3.75; floor(3.75) = 3, I have written this Solution Code: static int calculator(char ch, int a, int b)
{
if(ch == '+')
return a+b;
else if(ch == '-')
return a-b;
else if(ch == '*')
return a*b;
else return a/b;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: def two_way_sort(arr, arr_len):
l, r = 0, arr_len - 1
k = 0
while(l < r):
while(arr[l] % 2 != 0):
l += 1
k += 1
while(arr[r] % 2 == 0 and l < r):
r -= 1
if(l < r):
arr[l], arr[r] = arr[r], arr[l]
odd = arr[:k]
even = arr[k:]
odd.sort(reverse = True)
even.sort()
odd.extend(even)
return odd
n = int(input())
lst = input()
arr = lst.split()
for i in range(len(arr)):
arr[i] = int(arr[i])
result = two_way_sort(arr, n)
for i in result:
print(str(i), 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 positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> odd,even;
int a;
for(int i=0;i<n;i++){
cin>>a;
if(a&1){odd.emplace_back(a);}
else{
even.emplace_back(a);
}
}
sort(odd.begin(),odd.end());
sort(even.begin(),even.end());
for(int i=odd.size()-1;i>=0;i--){
cout<<odd[i]<<" ";
}
for(int i=0;i<even.size();i++){
cout<<even[i]<<" ";
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: function sortEvenOdd(arr, arrSize)
{
var even = [];
var odd = [];
for(let i = 0; i < arrSize; ++i)
{
if((arr[i]) % 2 === 0)
even.push(arr[i]);
else
odd.push(arr[i]);
}
even.sort((x, y) => (x - y));
odd.sort((x, y) => (x - y));
let res = [];
for(let i = odd.length - 1; i >= 0; i--)
res.push(odd[i]);
for(let i = 0; i < even.length; i++)
res.push(even[i]);
return res;
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 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));
PrintWriter pw = new PrintWriter(System.out);
int n = Integer.parseInt(br.readLine());
long[] arr = new long[n];
String[] raw = br.readLine().split("\\s+");
int eCount = 0;
for (int i = 0; i < n; i++) {
long tmp = Long.parseLong(raw[i]);
if (tmp % 2 == 0) arr[i] = tmp;
else arr[i] = -tmp;
}
Arrays.sort(arr);
int k = 0;
while (arr[k] % 2 != 0) {
arr[k] = -arr[k];
k++;
}
for (int i = 0; i < n; i++)
pw.print(arr[i] + " ");
pw.println();
pw.close();
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: def two_way_sort(arr, arr_len):
l, r = 0, arr_len - 1
k = 0
while(l < r):
while(arr[l] % 2 != 0):
l += 1
k += 1
while(arr[r] % 2 == 0 and l < r):
r -= 1
if(l < r):
arr[l], arr[r] = arr[r], arr[l]
odd = arr[:k]
even = arr[k:]
odd.sort(reverse = True)
even.sort()
odd.extend(even)
return odd
n = int(input())
lst = input()
arr = lst.split()
for i in range(len(arr)):
arr[i] = int(arr[i])
result = two_way_sort(arr, n)
for i in result:
print(str(i), 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 positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> odd,even;
int a;
for(int i=0;i<n;i++){
cin>>a;
if(a&1){odd.emplace_back(a);}
else{
even.emplace_back(a);
}
}
sort(odd.begin(),odd.end());
sort(even.begin(),even.end());
for(int i=odd.size()-1;i>=0;i--){
cout<<odd[i]<<" ";
}
for(int i=0;i<even.size();i++){
cout<<even[i]<<" ";
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: function sortEvenOdd(arr, arrSize)
{
var even = [];
var odd = [];
for(let i = 0; i < arrSize; ++i)
{
if((arr[i]) % 2 === 0)
even.push(arr[i]);
else
odd.push(arr[i]);
}
even.sort((x, y) => (x - y));
odd.sort((x, y) => (x - y));
let res = [];
for(let i = odd.length - 1; i >= 0; i--)
res.push(odd[i]);
for(let i = 0; i < even.length; i++)
res.push(even[i]);
return res;
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 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));
PrintWriter pw = new PrintWriter(System.out);
int n = Integer.parseInt(br.readLine());
long[] arr = new long[n];
String[] raw = br.readLine().split("\\s+");
int eCount = 0;
for (int i = 0; i < n; i++) {
long tmp = Long.parseLong(raw[i]);
if (tmp % 2 == 0) arr[i] = tmp;
else arr[i] = -tmp;
}
Arrays.sort(arr);
int k = 0;
while (arr[k] % 2 != 0) {
arr[k] = -arr[k];
k++;
}
for (int i = 0; i < n; i++)
pw.print(arr[i] + " ");
pw.println();
pw.close();
}
}, 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 integers, your task is to print the sum of elements present at even places and print the product of elements present at the odd places.
Note:- Consider the first element to start from 1.The first line of input contains a single integer N, the next line of input contains N space- separated integers depicting the values of the array.
Constraints:-
1 <= N <= 50
1 <= Arr[i] <= 5Print the sum of elements present at even places and print the product of elements present at the odd places separated by a space.Sample Input:-
5
1 2 3 4 5
Sample Output:-
6 15
Explanation:-
Sum = 2 + 4
Product = 1*3*5
Sample Input:-
2
4 6
Sample Output:-
6 4, I have written this Solution Code: function altSumProduct(arr, n) {
let sum = 0;
let prod = 1;
arr.forEach((el, idx) => {
if (idx % 2 !== 0) {
sum += el
} else {
prod *= el
}
})
console.log(`${sum} ${prod}`)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array Arr of N integers, your task is to print the sum of elements present at even places and print the product of elements present at the odd places.
Note:- Consider the first element to start from 1.The first line of input contains a single integer N, the next line of input contains N space- separated integers depicting the values of the array.
Constraints:-
1 <= N <= 50
1 <= Arr[i] <= 5Print the sum of elements present at even places and print the product of elements present at the odd places separated by a space.Sample Input:-
5
1 2 3 4 5
Sample Output:-
6 15
Explanation:-
Sum = 2 + 4
Product = 1*3*5
Sample Input:-
2
4 6
Sample Output:-
6 4, 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 Arr[] = new int[n];
for(int i=0;i<n;i++){
Arr[i] = sc.nextInt();
}
int sum=0;
int product=1;
for(int i=0;i<n;i++){
if(i%2==0){
product*=Arr[i];
}
else{
sum+=Arr[i];
}
}
System.out.print(sum+" "+product);
}
}
, 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 integers, your task is to print the sum of elements present at even places and print the product of elements present at the odd places.
Note:- Consider the first element to start from 1.The first line of input contains a single integer N, the next line of input contains N space- separated integers depicting the values of the array.
Constraints:-
1 <= N <= 50
1 <= Arr[i] <= 5Print the sum of elements present at even places and print the product of elements present at the odd places separated by a space.Sample Input:-
5
1 2 3 4 5
Sample Output:-
6 15
Explanation:-
Sum = 2 + 4
Product = 1*3*5
Sample Input:-
2
4 6
Sample Output:-
6 4, I have written this Solution Code: def EvenOddSum(a, n):
even = 0
odd = 1
for i in range(0,n):
if i % 2 == 0:
odd *= a[i]
else:
even += a[i]
print (even,odd)
n = input()
n=int(n)
arr = [int(i) for i in input().split()]
EvenOddSum(arr, n), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhijit has an Array <b>Arr</b> which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e <b> he changes an element X to M if X%M=0.</b>
Your task is to tell whether the given array can be transformed to <b>strictly increasing</b> by performing the operation given above.First line of input contains the size of the array N. Next line of input contains N space- separated integers depicting the values of the array Arr.
Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print "YES" if the array can be transformed in the strictly increasing order else print "NO".Sample Input:-
5
1 2 16 16 16
Sample Output:-
YES
Sample Input:-
4
1 3 8 4
Sample Output:-
NO, I have written this Solution Code: // arr is the array of numbers, n is the number fo elements
function increaseArray(arr, n) {
// write code here
// do not console.log
// return "YES" or "NO"
let cnt = 2;
for (let i = 1; i < n; i++) {
while (cnt <= arr[i] && arr[i] % cnt != 0) {
cnt++;
}
if (cnt > arr[i]) { return "NO" }
cnt++;
}
return "YES"
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhijit has an Array <b>Arr</b> which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e <b> he changes an element X to M if X%M=0.</b>
Your task is to tell whether the given array can be transformed to <b>strictly increasing</b> by performing the operation given above.First line of input contains the size of the array N. Next line of input contains N space- separated integers depicting the values of the array Arr.
Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print "YES" if the array can be transformed in the strictly increasing order else print "NO".Sample Input:-
5
1 2 16 16 16
Sample Output:-
YES
Sample Input:-
4
1 3 8 4
Sample Output:-
NO, I have written this Solution Code: #include <iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];}
int cnt=2;
for(int i=1;i<n;i++){
while(cnt<=a[i] && a[i]%cnt!=0){
cnt++;}
if(cnt>a[i]){cout<<"NO";return 0;}
cnt++;
}
cout<<"YES";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhijit has an Array <b>Arr</b> which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e <b> he changes an element X to M if X%M=0.</b>
Your task is to tell whether the given array can be transformed to <b>strictly increasing</b> by performing the operation given above.First line of input contains the size of the array N. Next line of input contains N space- separated integers depicting the values of the array Arr.
Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print "YES" if the array can be transformed in the strictly increasing order else print "NO".Sample Input:-
5
1 2 16 16 16
Sample Output:-
YES
Sample Input:-
4
1 3 8 4
Sample Output:-
NO, I have written this Solution Code: n = int(input())
lst = list(map(int, input().split()))
count = 1
ls = []
for i in range(n):
if (lst[i]%count == 0):
lst[i] = count
ls.append(lst[i])
count += 1
change = 0
while( count > lst[i-1] and count <= lst[i]):
if (lst[i]%count == 0) :
lst[i] = count
change = 1
ls.append(lst[i])
count += 1
break
else:
count += 1
if len(ls) == n:
print("YES")
else:
print("NO"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhijit has an Array <b>Arr</b> which may or may not be in strictly increasing order. He wants to make this array increasing but does not wish to change the position of any element so he came with an idea that he will replace an element with any of its divisors i.e <b> he changes an element X to M if X%M=0.</b>
Your task is to tell whether the given array can be transformed to <b>strictly increasing</b> by performing the operation given above.First line of input contains the size of the array N. Next line of input contains N space- separated integers depicting the values of the array Arr.
Constraints:-
1 <= N <= 100000
1 <= Arr[i] <= 100000Print "YES" if the array can be transformed in the strictly increasing order else print "NO".Sample Input:-
5
1 2 16 16 16
Sample Output:-
YES
Sample Input:-
4
1 3 8 4
Sample Output:-
NO, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args)throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String str[] = br.readLine().split(" ");
boolean flag=true;
int arr[] = new int[n];
for(int i=0;i<n;i++)
arr[i]=Integer.parseInt(str[i]);
arr[0]=1;
int j=2;
for(int i=1;i<n;i++){
if(arr[i]%j==0)
j=j+1;
else if((arr[i]%j)!=0 && (arr[i]/j)>=1){
int fight=1;
while(fight==1){
for(int x=j+1;x<=arr[i];x++){
if(arr[i]%x==0){
j=x+1;
fight=0;
break;
}
else
fight=1;
}
}
}
else
flag=false;
}
if(flag)
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: We need a problem on xor again. Given an array A of N integers (1- indexed), you need to find the sum of (N- i) xor A[i] for all i from 1 to N.The first line of the input contains an integer N, the number of elements of the array.
The second line of the input contains N singly spaced integers of the array A[i].
<b>Constraints:</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ A[i] ≤ 10<sup>9</sup>Output a single integer, the answer to the problem.Sample Input
5
1 2 3 4 5
Sample Output
17
Explanation
(5-1)xor1 = 5, (5-2)xor2 = 1, (5-3)xor3 = 1, (5-4)xor4 = 5, (5-5)xor5 = 5.
Sample Input
5
1 1 0 4 6
Sample Output
20, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
void xorOps(int n, long[] input){
long res=0;
for(int i=0;i<n;i++){
long temp = (n-(i+1))^(input[i]);
res=res+temp;
}
System.out.print(res);
}
public static void main (String[] args)throws java.lang.Exception {
Main obj = new Main();
BufferedReader br = new BufferedReader(new InputStreamReader
(System.in));
int n = Integer.parseInt(br.readLine());
String[] raw_input= br.readLine().split(" ");
long[] input = new long[n];
for(int i=0; i<n;i++){
input[i]=Long.parseLong(raw_input[i]);
}
obj.xorOps(n,input);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: We need a problem on xor again. Given an array A of N integers (1- indexed), you need to find the sum of (N- i) xor A[i] for all i from 1 to N.The first line of the input contains an integer N, the number of elements of the array.
The second line of the input contains N singly spaced integers of the array A[i].
<b>Constraints:</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ A[i] ≤ 10<sup>9</sup>Output a single integer, the answer to the problem.Sample Input
5
1 2 3 4 5
Sample Output
17
Explanation
(5-1)xor1 = 5, (5-2)xor2 = 1, (5-3)xor3 = 1, (5-4)xor4 = 5, (5-5)xor5 = 5.
Sample Input
5
1 1 0 4 6
Sample Output
20, I have written this Solution Code: n=int(input())
g=map(int,input().split())
count=0
i=0
while i<n:
for j in (g):
i=i+1
t=((n-i)^j)
count=count+t
print(count), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: We need a problem on xor again. Given an array A of N integers (1- indexed), you need to find the sum of (N- i) xor A[i] for all i from 1 to N.The first line of the input contains an integer N, the number of elements of the array.
The second line of the input contains N singly spaced integers of the array A[i].
<b>Constraints:</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ A[i] ≤ 10<sup>9</sup>Output a single integer, the answer to the problem.Sample Input
5
1 2 3 4 5
Sample Output
17
Explanation
(5-1)xor1 = 5, (5-2)xor2 = 1, (5-3)xor3 = 1, (5-4)xor4 = 5, (5-5)xor5 = 5.
Sample Input
5
1 1 0 4 6
Sample Output
20, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(ll i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;
const int N = 2e5+5;
// it's swapnil07 ;)
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif
void solve(){
int n; cin>>n;
int ans = 0;
For(i, 1, n+1){
int a; cin>>a;
ans += (a^(n-i));
}
cout<<ans;
}
signed main()
{
fast
#ifdef SWAPNIL07
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
// cin>>t;
while(t--){
solve();
cout<<"\n";
}
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, 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;
void print(int dn, int from, int to){
cout << dn << ":" << (char)('A'+from-1) << "->" << (char)('A'+to-1) << endl;
}
void rec(int n, int src, int des, int aux){
if(n == 0)
return;
rec(n-1, src, aux, des);
print(n, src, des);
rec(n-1, aux, des, src);
}
signed main() {
IOS;
int n; cin >> n;
rec(n, 1, 3, 2);
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: # Recursive Python function to solve the tower of hanoi
def TowerOfHanoi(n , source, destination, auxiliary):
if n==1:
#print ("1:",source,"->",destination)
print("1:%s->%s"%(source,destination))
return
TowerOfHanoi(n-1, source, auxiliary, destination)
#print (n,"%d:",source,"->",destination)
print("%d:%s->%s"%(n,source,destination))
TowerOfHanoi(n-1, auxiliary, destination, source)
# Driver code
n = int(input())
TowerOfHanoi(n,'A','C','B'), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: // n is the number of disks
function towerOfHanoiSequence(n) {
// write code here
// console.log the seqence steps
function towerOfHanoi(n, from_rod, to_rod, aux_rod) {
if (n == 0) {
return;
}
towerOfHanoi(n - 1, from_rod, aux_rod, to_rod);
console.log(`${n}:${from_rod}->${to_rod}`)
towerOfHanoi(n - 1, aux_rod, to_rod, from_rod);
}
towerOfHanoi(n,'A','C','B')
}
, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod)
{
if (n == 1)
{
System.out.println("1:" + from_rod + "->" + to_rod);
return;
}
towerOfHanoi(n-1, from_rod, aux_rod, to_rod);
System.out.println(n + ":" + from_rod + "->" + to_rod);
towerOfHanoi(n-1, aux_rod, to_rod, from_rod);
}
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
towerOfHanoi(n, 'A', 'C', 'B');
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, 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;
void print(int dn, int from, int to){
cout << dn << ":" << (char)('A'+from-1) << "->" << (char)('A'+to-1) << endl;
}
void rec(int n, int src, int des, int aux){
if(n == 0)
return;
rec(n-1, src, aux, des);
print(n, src, des);
rec(n-1, aux, des, src);
}
signed main() {
IOS;
int n; cin >> n;
rec(n, 1, 3, 2);
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: # Recursive Python function to solve the tower of hanoi
def TowerOfHanoi(n , source, destination, auxiliary):
if n==1:
#print ("1:",source,"->",destination)
print("1:%s->%s"%(source,destination))
return
TowerOfHanoi(n-1, source, auxiliary, destination)
#print (n,"%d:",source,"->",destination)
print("%d:%s->%s"%(n,source,destination))
TowerOfHanoi(n-1, auxiliary, destination, source)
# Driver code
n = int(input())
TowerOfHanoi(n,'A','C','B'), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: // n is the number of disks
function towerOfHanoiSequence(n) {
// write code here
// console.log the seqence steps
function towerOfHanoi(n, from_rod, to_rod, aux_rod) {
if (n == 0) {
return;
}
towerOfHanoi(n - 1, from_rod, aux_rod, to_rod);
console.log(`${n}:${from_rod}->${to_rod}`)
towerOfHanoi(n - 1, aux_rod, to_rod, from_rod);
}
towerOfHanoi(n,'A','C','B')
}
, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------
Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks
Constraints:
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2
Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod)
{
if (n == 1)
{
System.out.println("1:" + from_rod + "->" + to_rod);
return;
}
towerOfHanoi(n-1, from_rod, aux_rod, to_rod);
System.out.println(n + ":" + from_rod + "->" + to_rod);
towerOfHanoi(n-1, aux_rod, to_rod, from_rod);
}
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
towerOfHanoi(n, 'A', 'C', 'B');
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find the Nth number in the fibonacci series. Consider 0 and 1 to be the seed values.
In the fibonacci series, each number (Fibonacci number) is the sum of the two preceding numbers. The series with 0 and 1 as seed values will go like -
0, 1, 1, 2, 3, 5 and so on..<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>Fibonacci()</b> that takes the integer N as a parameter.
Constraints:
1 ≤ T ≤ 10
1 ≤ N ≤ 30Return the Nth Fibonacci number.Sample Input
2
3
5
Sample Output
2
5
Explaination:
Test case 1-> N = 2
Seed values are 0 and 1
So, F<sub>1</sub> = 0 + 1 = 1
F<sub>2</sub> = 1 + F<sub>1</sub> = 1 + 1 = 2, I have written this Solution Code: static long Fibonacci(long n)
{
if (n == 0)
{ return 0;}
else if(n==1){
return 1;
}
return Fibonacci(n-1) + Fibonacci(n-2);
} , In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find the Nth number in the fibonacci series. Consider 0 and 1 to be the seed values.
In the fibonacci series, each number (Fibonacci number) is the sum of the two preceding numbers. The series with 0 and 1 as seed values will go like -
0, 1, 1, 2, 3, 5 and so on..<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>Fibonacci()</b> that takes the integer N as a parameter.
Constraints:
1 ≤ T ≤ 10
1 ≤ N ≤ 30Return the Nth Fibonacci number.Sample Input
2
3
5
Sample Output
2
5
Explaination:
Test case 1-> N = 2
Seed values are 0 and 1
So, F<sub>1</sub> = 0 + 1 = 1
F<sub>2</sub> = 1 + F<sub>1</sub> = 1 + 1 = 2, I have written this Solution Code: // n is the input number
function fibonacci(n) {
// write code here
// do not console.log
// return the answer as a number
if (n == 1 || n == 0) return n;
return fibonacci(n-2) + fibonacci(n-1)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code:
def distributingMoney(x,y,z,k) :
# Final result of summation of divisors
result = x+y+z+k;
if result%3!=0:
return 0
result =result/3
if result<x or result<y or result<z:
return 0
return 1;
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: int distributingMoney(long x, long y, long z,long k){
long long sum=x+y+z+k;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: public static int distributingMoney(long x, long y, long z, long K){
long sum=0;
sum+=x+y+z+K;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Mahesh has won some money K from a lottery, he wants to distribute the money among his three sisters. His sisters already have some money with them. Let's say they have x, y, z amount of money. Now mahesh wants to distribute his money such that all the sisters have the same amount of total money left with them. Your task is to check if it is possible to distribute the money as Mahesh wants.<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>distributingMoney()</b> that takes the integers x, y, z, and K as parameters.
<b>Constraints:-</b>
0 <= x, y, z, K <= 10^7Return 1 if possible else return 0.Sample Input:-
1 2 3 3
Sample Output:-
1
Explanation:-
initial :- 1 2 3
Final :- 3 3 3
Sample Input:-
1 2 3 4
Sample Output:-
0, I have written this Solution Code: int distributingMoney(long x, long y, long z,long k){
long int sum=x+y+z+k;
if(sum%3!=0){return 0;}
sum=sum/3;
if(x>sum || y>sum || z>sum){return 0;}
return 1;
}
, 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 possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: int AllPair(int N){
return N-1;
}, 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 possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: static int AllPair(int N){
return N-1;
}, 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 possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: def AllPair(N):
return N-1;, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find all possible pairs of A, and B such that A + B = N and A and B both are natural numbers.<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>Allpair()</b> that takes integer N as a parameter.
Constraints:-
1 ≤ N ≤ 10<sup>8</sup>Return the number of possible pairs of A and B.Sample Input:-
5
Sample Output:-
4
Explanation:-
(1, 4), (2, 3), (3, 2), (4, 1) are the only possible pairs.
Sample Input:-
2
Sample Output:-
1, I have written this Solution Code: int AllPair(int N){
return N-1;
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: def two_way_sort(arr, arr_len):
l, r = 0, arr_len - 1
k = 0
while(l < r):
while(arr[l] % 2 != 0):
l += 1
k += 1
while(arr[r] % 2 == 0 and l < r):
r -= 1
if(l < r):
arr[l], arr[r] = arr[r], arr[l]
odd = arr[:k]
even = arr[k:]
odd.sort(reverse = True)
even.sort()
odd.extend(even)
return odd
n = int(input())
lst = input()
arr = lst.split()
for i in range(len(arr)):
arr[i] = int(arr[i])
result = two_way_sort(arr, n)
for i in result:
print(str(i), 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 positive integers. Your task is to sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.First line of each test case contains an integer N denoting the size of the array. The next line contains N space separated values of the array.
<b>Constraints:</b>
1 <b>≤</b> N <b>≤</b> 10<sup>5</sup>
0 <b>≤</b> A[i] <b>≤</b> 10<sup>6</sup>Print the space separated values of the modified array.Sample Input
7
1 2 3 5 4 7 10
Sample Output
7 5 3 1 2 4 10
Sample Input
7
0 4 5 3 7 2 1
Sample Output
7 5 3 1 0 2 4, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> odd,even;
int a;
for(int i=0;i<n;i++){
cin>>a;
if(a&1){odd.emplace_back(a);}
else{
even.emplace_back(a);
}
}
sort(odd.begin(),odd.end());
sort(even.begin(),even.end());
for(int i=odd.size()-1;i>=0;i--){
cout<<odd[i]<<" ";
}
for(int i=0;i<even.size();i++){
cout<<even[i]<<" ";
}
}, In this Programming Language: C++, 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.