Instruction
stringlengths 261
35k
| Response
stringclasses 1
value |
|---|---|
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: Alexa is a very kind girl. She has 'x' red gems and 'y' blue gems. She wants to distribute them among her two friends (Alice and Julia).
But she will only distribute them if she can give equal number of each colour of gems to Alice and Julia. Further, she must distribute all available gems in this way. So, can you help her make a decision?First line contains two space- separated integers 'x' and 'y' (0 <= x,y <= 100) i. e. number of red and blue gems.In the first line, output "YES" is she can distribute gems else "NO" (without double quotes).Sample Input:
2 3
Sample Output:
NO
Explanation:
Alexa has 3 blue gems, so she can not distribute blue gems., I have written this Solution Code: import java.io.*;import java.util.*;
class Main{
static InputReader fr = new InputReader(System.in);
public static void main(String[] args) throws IOException {
PrintWriter w = new PrintWriter(System.out);
int tt=1;
while(tt-->0) {
int x=fr.ni();
int y=fr.ni();
if(x%2==0 && y%2==0) {
System.out.println("YES");
}
else {
System.out.println("NO");
}
}
w.close();
}
static void opil(List<Integer> al) {StringBuilder sb= new StringBuilder();for(int x:al)sb.append(x+" ");System.out.println(sb.toString());}
static void opll(List<Long> al) {StringBuilder sb= new StringBuilder();for(long x:al)sb.append(x+" ");System.out.println(sb.toString());}
static int[] iarr(int n) {int a[]=new int[n];for(int i=0;i<n;i++)a[i]=fr.ni();return a;}
static long[] larr(int n) {long a[]=new long[n];for(int i=0;i<n;i++)a[i]=fr.nl();return a;}
static void op(int a[]) {StringBuilder sb= new StringBuilder();for(int x:a)sb.append(x+" ");System.out.println(sb.toString());}
static void op(long a[]) {StringBuilder sb= new StringBuilder();for(long x:a)sb.append(x+" ");System.out.println(sb.toString());}
static void sort(int[] a) {ArrayList<Integer>l=new ArrayList<>();for(int i:a) l.add(i);Collections.sort(l);for (int i=0; i<a.length; i++) a[i]=l.get(i);}
static void sort(long[] a) {ArrayList<Long>l=new ArrayList<>();for(long i:a) l.add(i);Collections.sort(l);for (int i=0; i<a.length; i++) a[i]=l.get(i);}
static int gcd(int a,int b) {if(a<b) return gcd(b,a);if(b==0) return a;return gcd(b,a%b);}
static String rev(String s) {StringBuilder sb= new StringBuilder();sb.append(s);return sb.reverse().toString();}
static class InputReader {
private final InputStream stream;
private final byte[] buf = new byte[8192];
private int curChar, snumChars;
private SpaceCharFilter filter;
public InputReader(InputStream stream) {
this.stream = stream;
}
public int snext() {
if (snumChars == -1)
throw new InputMismatchException();
if (curChar >= snumChars) {
curChar = 0;
try {
snumChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (snumChars <= 0)
return -1;
}
return buf[curChar++];
}
public int ni() {
int c = snext();
while (isSpaceChar(c)) {
c = snext();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = snext();
}
int res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = snext();
} while (!isSpaceChar(c));
return res * sgn;
}
public long nl() {
int c = snext();
while (isSpaceChar(c)) {
c = snext();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = snext();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = snext();
} while (!isSpaceChar(c));
return res * sgn;
}
public int[] nextIntArray(int n) {
int a[] = new int[n];
for (int i = 0; i < n; i++) {
a[i] = ni();
}
return a;
}
public String readString() {
int c = snext();
while (isSpaceChar(c)) {
c = snext();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = snext();
} while (!isSpaceChar(c));
return res.toString();
}
public String nextLine() {
int c = snext();
while (isSpaceChar(c))
c = snext();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = snext();
} while (!isEndOfLine(c));
return res.toString();
}
public boolean isSpaceChar(int c) {
if (filter != null)
return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
private boolean isEndOfLine(int c) {
return c == '\n' || c == '\r' || c == -1;
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alexa is a very kind girl. She has 'x' red gems and 'y' blue gems. She wants to distribute them among her two friends (Alice and Julia).
But she will only distribute them if she can give equal number of each colour of gems to Alice and Julia. Further, she must distribute all available gems in this way. So, can you help her make a decision?First line contains two space- separated integers 'x' and 'y' (0 <= x,y <= 100) i. e. number of red and blue gems.In the first line, output "YES" is she can distribute gems else "NO" (without double quotes).Sample Input:
2 3
Sample Output:
NO
Explanation:
Alexa has 3 blue gems, so she can not distribute blue gems., I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long int ll;
typedef unsigned long long int ull;
const long double PI = acos(-1);
const ll mod=1e9+7;
const ll mod1=998244353;
const int inf = 1e9;
const ll INF=1e18;
void precompute(){
}
void TEST_CASE(){
int x1,x2;
cin >> x1 >> x2;
if((x1&1) || (x2&1)){
cout << "NO\n";
}else{
cout << "YES\n";
}
}
signed main(){
fast;
//freopen ("INPUT.txt","r",stdin);
//freopen ("OUTPUT.txt","w",stdout);
int test=1,TEST=1;
precompute();
// cin >> test;
while(test--){
TEST_CASE();
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Alexa is a very kind girl. She has 'x' red gems and 'y' blue gems. She wants to distribute them among her two friends (Alice and Julia).
But she will only distribute them if she can give equal number of each colour of gems to Alice and Julia. Further, she must distribute all available gems in this way. So, can you help her make a decision?First line contains two space- separated integers 'x' and 'y' (0 <= x,y <= 100) i. e. number of red and blue gems.In the first line, output "YES" is she can distribute gems else "NO" (without double quotes).Sample Input:
2 3
Sample Output:
NO
Explanation:
Alexa has 3 blue gems, so she can not distribute blue gems., I have written this Solution Code: x,y=map(int,input().split(" "))
if x%2==0 and y%2==0:
print("YES")
else:
print("NO"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: 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: 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: 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 a number N, find the value of the below equation for the given number.
Equation: -
N
∑ {(X + 1)<sup>2</sup> - (3X + 1) + X}
X = 1<b>User task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>equationSum()</b>, where you will get N as a parameter.
<b>Constraints:</b>
1 <= N <= 10^5You need to return the sum of the equationSample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
5
Explanation:-
For test 2:- (1+1)^2 - (3*1+1) + (1) + (2+1)^2 - (3*2+1) +2
= 4 - 4 +1 + 9 -7 +2
= 5, I have written this Solution Code: def equationSum(N) :
re=N*(N+1)
re=re*(2*N+1)
re=re//6
return re, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, find the value of the below equation for the given number.
Equation: -
N
∑ {(X + 1)<sup>2</sup> - (3X + 1) + X}
X = 1<b>User task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>equationSum()</b>, where you will get N as a parameter.
<b>Constraints:</b>
1 <= N <= 10^5You need to return the sum of the equationSample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
5
Explanation:-
For test 2:- (1+1)^2 - (3*1+1) + (1) + (2+1)^2 - (3*2+1) +2
= 4 - 4 +1 + 9 -7 +2
= 5, I have written this Solution Code: long long equationSum(long long N){
long long ans = (N*(N+1)*(2*N+1))/6;
return ans;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, find the value of the below equation for the given number.
Equation: -
N
∑ {(X + 1)<sup>2</sup> - (3X + 1) + X}
X = 1<b>User task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>equationSum()</b>, where you will get N as a parameter.
<b>Constraints:</b>
1 <= N <= 10^5You need to return the sum of the equationSample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
5
Explanation:-
For test 2:- (1+1)^2 - (3*1+1) + (1) + (2+1)^2 - (3*2+1) +2
= 4 - 4 +1 + 9 -7 +2
= 5, I have written this Solution Code: long long int equationSum(long long N){
long long ans = (N*(N+1)*(2*N+1))/6;
return ans;
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, find the value of the below equation for the given number.
Equation: -
N
∑ {(X + 1)<sup>2</sup> - (3X + 1) + X}
X = 1<b>User task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>equationSum()</b>, where you will get N as a parameter.
<b>Constraints:</b>
1 <= N <= 10^5You need to return the sum of the equationSample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
5
Explanation:-
For test 2:- (1+1)^2 - (3*1+1) + (1) + (2+1)^2 - (3*2+1) +2
= 4 - 4 +1 + 9 -7 +2
= 5, I have written this Solution Code: static long equationSum(long N)
{
return (N*(N+1)*(2*N + 1))/6;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A magic number is a natural number that contains both the digits 7 and 9 in it. For eg:- 79, 879, 53729 etc.
Given a number N, your task is to find the closest Magic number from the given number N.
Note:- If more than one answer exists return the minimum one<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>MagicNumber()</b> that takes integer N as argument.
Constraints:-
1 <= N <= 100000Return a magic number closest to the given number N.Sample Input:-
8
Sample Output:-
79
Sample Input:-
900
Sample Output:-
897, I have written this Solution Code: def check(N):
if(N<0):
return 1
a=0
b=0
while(N):
if(N%10==7):
a=1
if(N%10==9):
b=1
N=N//10
if( a==1 and b==1):
return 0
return 1
def MagicNumber(N):
i=0
while(check(N-i)==1 and check(N+i)==1):
i=i+1
if(check(N-i)==0):
return N-i
return N+i
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A magic number is a natural number that contains both the digits 7 and 9 in it. For eg:- 79, 879, 53729 etc.
Given a number N, your task is to find the closest Magic number from the given number N.
Note:- If more than one answer exists return the minimum one<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>MagicNumber()</b> that takes integer N as argument.
Constraints:-
1 <= N <= 100000Return a magic number closest to the given number N.Sample Input:-
8
Sample Output:-
79
Sample Input:-
900
Sample Output:-
897, I have written this Solution Code: int check(int n){
int s=0;
int p=0;
while(n){
if(n%10==7){s=1;}
if(n%10==9){p=1;}
n/=10;
}
if(s && p){return 0;}
return 1;
}
int MagicNumber(int n){
int i=0;
while(check(n-i) && check(n+i)){
i++;
}
if(check(n-i)==0){return n-i;}
else{
return n+i;}
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A magic number is a natural number that contains both the digits 7 and 9 in it. For eg:- 79, 879, 53729 etc.
Given a number N, your task is to find the closest Magic number from the given number N.
Note:- If more than one answer exists return the minimum one<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>MagicNumber()</b> that takes integer N as argument.
Constraints:-
1 <= N <= 100000Return a magic number closest to the given number N.Sample Input:-
8
Sample Output:-
79
Sample Input:-
900
Sample Output:-
897, I have written this Solution Code: int check(int n){
int s=0;
int p=0;
while(n){
if(n%10==7){s=1;}
if(n%10==9){p=1;}
n/=10;
}
if(s && p){return 0;}
return 1;
}
int MagicNumber(int n){
int i=0;
while(check(n-i) && check(n+i)){
i++;
}
if(check(n-i)==0){return n-i;}
else{
return n+i;}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A magic number is a natural number that contains both the digits 7 and 9 in it. For eg:- 79, 879, 53729 etc.
Given a number N, your task is to find the closest Magic number from the given number N.
Note:- If more than one answer exists return the minimum one<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>MagicNumber()</b> that takes integer N as argument.
Constraints:-
1 <= N <= 100000Return a magic number closest to the given number N.Sample Input:-
8
Sample Output:-
79
Sample Input:-
900
Sample Output:-
897, I have written this Solution Code: static boolean check(int n){
boolean s=false;
boolean p=false;
while(n>0){
if(n%10==7){s=true;}
if(n%10==9){p=true;}
n/=10;
}
if(s && p){return false;}
return true;
}
static int MagicNumber(int n){
int i=0;
while(check(n-i)==true && check(n+i)==true){
i++;
}
if(check(n-i)==false){return n-i;}
else{
return n+i;}
}, 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: Tom loves Chess boards. He admires its symmetry and how the black and white colors are placed adjacently along both axis.
More formally, a chessboard-like coloring implies that no two adjacent cells have the same color and all the cells are painted either white or black.
On his birthday, Tom has been gifted a board which is in the form of an N*N grid. Every cell is painted either black or white. Since Tom loves the placement of colors in a chessboard, he will try to convert the board that has been gifted to him, identical to a chessboard. He has both black and white colors available to him. Help him find out the minimum number of cells he will have to recolor to paint his board similar to a chessboard.The first line contains an integer N, denoting the size of the board
Each of the next N lines contains N space-separated integers and each integer being either '0' or '1'
'1' represent black cell
'0' represents white cell
Constraints
1 ≤ N ≤ 1000A single integer that is the minimum number of cells that Tom will have to re-color in his board to convert the given board to a chess board like coloring.Input:
3
1 1 1
1 1 1
1 1 1
Output:
4
<b>Explanation:</b>
Convert to
1 0 1
0 1 0
1 0 1
Thus he has to color 4 cells., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(sc.readLine());
String[] arr = new String[n];
for(int i = 0 ; i < n ; i++){
arr[i] = sc.readLine();
}
int initial =1, paintWhenStartWithOne = 0;
for(int i = 0 ; i < n ;i++){
int current = initial;
for(int j = 0 ; j < arr[i].length() ; j+=2){
int val = arr[i].charAt(j) -48;
if(current != val)
paintWhenStartWithOne++;
current = 1-current;
}
initial = 1-initial;
}
initial =0;
int paintWhenStartWithZero = 0;
for(int i = 0 ; i < n ;i++){
int current = initial;
for(int j = 0 ; j < arr[i].length() ; j+=2){
int val =arr[i].charAt(j)-48;
if(current != val)
paintWhenStartWithZero++;
current = 1-current;
}
initial = 1-initial;
}
int ans = Math.min(paintWhenStartWithOne, paintWhenStartWithZero);
System.out.println(ans);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tom loves Chess boards. He admires its symmetry and how the black and white colors are placed adjacently along both axis.
More formally, a chessboard-like coloring implies that no two adjacent cells have the same color and all the cells are painted either white or black.
On his birthday, Tom has been gifted a board which is in the form of an N*N grid. Every cell is painted either black or white. Since Tom loves the placement of colors in a chessboard, he will try to convert the board that has been gifted to him, identical to a chessboard. He has both black and white colors available to him. Help him find out the minimum number of cells he will have to recolor to paint his board similar to a chessboard.The first line contains an integer N, denoting the size of the board
Each of the next N lines contains N space-separated integers and each integer being either '0' or '1'
'1' represent black cell
'0' represents white cell
Constraints
1 ≤ N ≤ 1000A single integer that is the minimum number of cells that Tom will have to re-color in his board to convert the given board to a chess board like coloring.Input:
3
1 1 1
1 1 1
1 1 1
Output:
4
<b>Explanation:</b>
Convert to
1 0 1
0 1 0
1 0 1
Thus he has to color 4 cells., I have written this Solution Code: n=int(input())
c1,c2 = 0,0
for i in range(0,n):
arr=list(map(int,input().strip().split()))
for j in range(0,n):
p=arr[j]
x=(i+j)&1
c1 += (bool)(p == x)
c2 += (bool)(p != x)
print(min(c1, c2)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tom loves Chess boards. He admires its symmetry and how the black and white colors are placed adjacently along both axis.
More formally, a chessboard-like coloring implies that no two adjacent cells have the same color and all the cells are painted either white or black.
On his birthday, Tom has been gifted a board which is in the form of an N*N grid. Every cell is painted either black or white. Since Tom loves the placement of colors in a chessboard, he will try to convert the board that has been gifted to him, identical to a chessboard. He has both black and white colors available to him. Help him find out the minimum number of cells he will have to recolor to paint his board similar to a chessboard.The first line contains an integer N, denoting the size of the board
Each of the next N lines contains N space-separated integers and each integer being either '0' or '1'
'1' represent black cell
'0' represents white cell
Constraints
1 ≤ N ≤ 1000A single integer that is the minimum number of cells that Tom will have to re-color in his board to convert the given board to a chess board like coloring.Input:
3
1 1 1
1 1 1
1 1 1
Output:
4
<b>Explanation:</b>
Convert to
1 0 1
0 1 0
1 0 1
Thus he has to color 4 cells., 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 = 2e3 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
int a[N][N];
signed main() {
IOS;
int n;
cin >> n;
int c1 = 0, c2 = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
int p; cin >> p;
int x = (i+j)&1;
c1 += (bool)(p == x);
c2 += (bool)(p != x);
}
}
cout << min(c1, c2);
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, add 8 to it and then divide it by 3, take the modulus of the resulting value with 5 and then finally multiply it by 5. Display the final value of NYou don't have to worry about the input, you just have to complete the function <b>stepsExecute</b>
<b>Constraints</b>
1000 <= number <= 9999Print the final resultSample Input :
2345
Sample Output :
20, I have written this Solution Code: static void stepsExecute(int N){
System.out.println(((((N+8)/3)%5)*5));
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, add 8 to it and then divide it by 3, take the modulus of the resulting value with 5 and then finally multiply it by 5. Display the final value of NYou don't have to worry about the input, you just have to complete the function <b>stepsExecute</b>
<b>Constraints</b>
1000 <= number <= 9999Print the final resultSample Input :
2345
Sample Output :
20, I have written this Solution Code: a = int(input())
print((((a+8)//3)%5)*5), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tom loves Chess boards. He admires its symmetry and how the black and white colors are placed adjacently along both axis.
More formally, a chessboard-like coloring implies that no two adjacent cells have the same color and all the cells are painted either white or black.
On his birthday, Tom has been gifted a board which is in the form of an N*N grid. Every cell is painted either black or white. Since Tom loves the placement of colors in a chessboard, he will try to convert the board that has been gifted to him, identical to a chessboard. He has both black and white colors available to him. Help him find out the minimum number of cells he will have to recolor to paint his board similar to a chessboard.The first line contains an integer N, denoting the size of the board
Each of the next N lines contains N space-separated integers and each integer being either '0' or '1'
'1' represent black cell
'0' represents white cell
Constraints
1 ≤ N ≤ 1000A single integer that is the minimum number of cells that Tom will have to re-color in his board to convert the given board to a chess board like coloring.Input:
3
1 1 1
1 1 1
1 1 1
Output:
4
<b>Explanation:</b>
Convert to
1 0 1
0 1 0
1 0 1
Thus he has to color 4 cells., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(sc.readLine());
String[] arr = new String[n];
for(int i = 0 ; i < n ; i++){
arr[i] = sc.readLine();
}
int initial =1, paintWhenStartWithOne = 0;
for(int i = 0 ; i < n ;i++){
int current = initial;
for(int j = 0 ; j < arr[i].length() ; j+=2){
int val = arr[i].charAt(j) -48;
if(current != val)
paintWhenStartWithOne++;
current = 1-current;
}
initial = 1-initial;
}
initial =0;
int paintWhenStartWithZero = 0;
for(int i = 0 ; i < n ;i++){
int current = initial;
for(int j = 0 ; j < arr[i].length() ; j+=2){
int val =arr[i].charAt(j)-48;
if(current != val)
paintWhenStartWithZero++;
current = 1-current;
}
initial = 1-initial;
}
int ans = Math.min(paintWhenStartWithOne, paintWhenStartWithZero);
System.out.println(ans);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tom loves Chess boards. He admires its symmetry and how the black and white colors are placed adjacently along both axis.
More formally, a chessboard-like coloring implies that no two adjacent cells have the same color and all the cells are painted either white or black.
On his birthday, Tom has been gifted a board which is in the form of an N*N grid. Every cell is painted either black or white. Since Tom loves the placement of colors in a chessboard, he will try to convert the board that has been gifted to him, identical to a chessboard. He has both black and white colors available to him. Help him find out the minimum number of cells he will have to recolor to paint his board similar to a chessboard.The first line contains an integer N, denoting the size of the board
Each of the next N lines contains N space-separated integers and each integer being either '0' or '1'
'1' represent black cell
'0' represents white cell
Constraints
1 ≤ N ≤ 1000A single integer that is the minimum number of cells that Tom will have to re-color in his board to convert the given board to a chess board like coloring.Input:
3
1 1 1
1 1 1
1 1 1
Output:
4
<b>Explanation:</b>
Convert to
1 0 1
0 1 0
1 0 1
Thus he has to color 4 cells., I have written this Solution Code: n=int(input())
c1,c2 = 0,0
for i in range(0,n):
arr=list(map(int,input().strip().split()))
for j in range(0,n):
p=arr[j]
x=(i+j)&1
c1 += (bool)(p == x)
c2 += (bool)(p != x)
print(min(c1, c2)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Tom loves Chess boards. He admires its symmetry and how the black and white colors are placed adjacently along both axis.
More formally, a chessboard-like coloring implies that no two adjacent cells have the same color and all the cells are painted either white or black.
On his birthday, Tom has been gifted a board which is in the form of an N*N grid. Every cell is painted either black or white. Since Tom loves the placement of colors in a chessboard, he will try to convert the board that has been gifted to him, identical to a chessboard. He has both black and white colors available to him. Help him find out the minimum number of cells he will have to recolor to paint his board similar to a chessboard.The first line contains an integer N, denoting the size of the board
Each of the next N lines contains N space-separated integers and each integer being either '0' or '1'
'1' represent black cell
'0' represents white cell
Constraints
1 ≤ N ≤ 1000A single integer that is the minimum number of cells that Tom will have to re-color in his board to convert the given board to a chess board like coloring.Input:
3
1 1 1
1 1 1
1 1 1
Output:
4
<b>Explanation:</b>
Convert to
1 0 1
0 1 0
1 0 1
Thus he has to color 4 cells., 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 = 2e3 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
int a[N][N];
signed main() {
IOS;
int n;
cin >> n;
int c1 = 0, c2 = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
int p; cin >> p;
int x = (i+j)&1;
c1 += (bool)(p == x);
c2 += (bool)(p != x);
}
}
cout << min(c1, c2);
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: Given a number N, find the value of the below equation for the given number.
Equation: -
N
∑ {(X + 1)<sup>2</sup> - (3X + 1) + X}
X = 1<b>User task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>equationSum()</b>, where you will get N as a parameter.
<b>Constraints:</b>
1 <= N <= 10^5You need to return the sum of the equationSample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
5
Explanation:-
For test 2:- (1+1)^2 - (3*1+1) + (1) + (2+1)^2 - (3*2+1) +2
= 4 - 4 +1 + 9 -7 +2
= 5, I have written this Solution Code: def equationSum(N) :
re=N*(N+1)
re=re*(2*N+1)
re=re//6
return re, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, find the value of the below equation for the given number.
Equation: -
N
∑ {(X + 1)<sup>2</sup> - (3X + 1) + X}
X = 1<b>User task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>equationSum()</b>, where you will get N as a parameter.
<b>Constraints:</b>
1 <= N <= 10^5You need to return the sum of the equationSample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
5
Explanation:-
For test 2:- (1+1)^2 - (3*1+1) + (1) + (2+1)^2 - (3*2+1) +2
= 4 - 4 +1 + 9 -7 +2
= 5, I have written this Solution Code: long long equationSum(long long N){
long long ans = (N*(N+1)*(2*N+1))/6;
return ans;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, find the value of the below equation for the given number.
Equation: -
N
∑ {(X + 1)<sup>2</sup> - (3X + 1) + X}
X = 1<b>User task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>equationSum()</b>, where you will get N as a parameter.
<b>Constraints:</b>
1 <= N <= 10^5You need to return the sum of the equationSample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
5
Explanation:-
For test 2:- (1+1)^2 - (3*1+1) + (1) + (2+1)^2 - (3*2+1) +2
= 4 - 4 +1 + 9 -7 +2
= 5, I have written this Solution Code: long long int equationSum(long long N){
long long ans = (N*(N+1)*(2*N+1))/6;
return ans;
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, find the value of the below equation for the given number.
Equation: -
N
∑ {(X + 1)<sup>2</sup> - (3X + 1) + X}
X = 1<b>User task:</b>
Since this is a functional problem, you don’t have to worry about the input, you just have to complete the function <b>equationSum()</b>, where you will get N as a parameter.
<b>Constraints:</b>
1 <= N <= 10^5You need to return the sum of the equationSample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
5
Explanation:-
For test 2:- (1+1)^2 - (3*1+1) + (1) + (2+1)^2 - (3*2+1) +2
= 4 - 4 +1 + 9 -7 +2
= 5, I have written this Solution Code: static long equationSum(long N)
{
return (N*(N+1)*(2*N + 1))/6;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara has 2 brothers which initially have X and Y candies with them. Sara has also N candies with her. Sara wants to distribute her candies to his brothers such that both the brother have an equal amount of candies at last. Given the values of X, Y, and N, your task is to tell Sara whether she can distribute in such a way or not.<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>distributeCandies()</b> that takes integers X, Y and N as arguments.
Constraints:-
0 <= N <= 1000
0 <= X <= 1000
0 <= Y <= 1000Return 1 if it is possible else return 0.Sample Input:-
N = 5, X = 3, Y = 2
Sample Output:-
1
Explanation:-
Both brothers can have 5 candies at the end. i. e Sara will give 2 candies to the first brother and 3 candies to the second.
Sample Input:-
N = 3, X = 2, Y = 2
Sample output:-
0, I have written this Solution Code: static int distributeCandies(int N, int X, int Y){
int x = N+X+Y;
if(x%2==1){return 0;}
x=x/2;
if(x<X || x<Y){
return 0;
}
return 1;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara has 2 brothers which initially have X and Y candies with them. Sara has also N candies with her. Sara wants to distribute her candies to his brothers such that both the brother have an equal amount of candies at last. Given the values of X, Y, and N, your task is to tell Sara whether she can distribute in such a way or not.<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>distributeCandies()</b> that takes integers X, Y and N as arguments.
Constraints:-
0 <= N <= 1000
0 <= X <= 1000
0 <= Y <= 1000Return 1 if it is possible else return 0.Sample Input:-
N = 5, X = 3, Y = 2
Sample Output:-
1
Explanation:-
Both brothers can have 5 candies at the end. i. e Sara will give 2 candies to the first brother and 3 candies to the second.
Sample Input:-
N = 3, X = 2, Y = 2
Sample output:-
0, I have written this Solution Code: def distributeCandies(N,X,Y):
x=N+X+Y
if(x%2==1):
return 0
x=x/2
if(x< X or x < Y):
return 0
return 1
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara has 2 brothers which initially have X and Y candies with them. Sara has also N candies with her. Sara wants to distribute her candies to his brothers such that both the brother have an equal amount of candies at last. Given the values of X, Y, and N, your task is to tell Sara whether she can distribute in such a way or not.<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>distributeCandies()</b> that takes integers X, Y and N as arguments.
Constraints:-
0 <= N <= 1000
0 <= X <= 1000
0 <= Y <= 1000Return 1 if it is possible else return 0.Sample Input:-
N = 5, X = 3, Y = 2
Sample Output:-
1
Explanation:-
Both brothers can have 5 candies at the end. i. e Sara will give 2 candies to the first brother and 3 candies to the second.
Sample Input:-
N = 3, X = 2, Y = 2
Sample output:-
0, I have written this Solution Code: int distributeCandies(int N, int X, int Y){
int x = N+X+Y;
if(x%2==1){return 0;}
x=x/2;
if(x<X || x<Y){
return 0;
}
return 1;
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara has 2 brothers which initially have X and Y candies with them. Sara has also N candies with her. Sara wants to distribute her candies to his brothers such that both the brother have an equal amount of candies at last. Given the values of X, Y, and N, your task is to tell Sara whether she can distribute in such a way or not.<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>distributeCandies()</b> that takes integers X, Y and N as arguments.
Constraints:-
0 <= N <= 1000
0 <= X <= 1000
0 <= Y <= 1000Return 1 if it is possible else return 0.Sample Input:-
N = 5, X = 3, Y = 2
Sample Output:-
1
Explanation:-
Both brothers can have 5 candies at the end. i. e Sara will give 2 candies to the first brother and 3 candies to the second.
Sample Input:-
N = 3, X = 2, Y = 2
Sample output:-
0, I have written this Solution Code: int distributeCandies(int N, int X, int Y){
int x = N+X+Y;
if(x%2==1){return 0;}
x=x/2;
if(x<X || x<Y){
return 0;
}
return 1;
}, In this Programming Language: C++, 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: There are N trees in Terry's front yard. He is supposed to measures the height of each tree and find the average height of trees in his yard. What is the average height of a tree in Terry's front yard?
Note:- Print your answer as floor value (average height)The first line contains N: numbers of tree.
Then follows N lines represents the height of each tree.
Constraint:-
1 <= n <= 100000
1 <= a[i] <= 100000Print the average height of all the trees in the yardInput
5
6
8
34
9
3
Output
12
Explanation:-
Sum of heights =60
Average of heights =60/5
Sample Input:
3
1
2
3
, I have written this Solution Code: function averageMe(sizeOfArray, array) {
// write code here
// do no console.log the answer
// return the output using return keyword
const sum = array.reduce((a,b)=> a+b,0)
return Math.floor(sum/sizeOfArray)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There are N trees in Terry's front yard. He is supposed to measures the height of each tree and find the average height of trees in his yard. What is the average height of a tree in Terry's front yard?
Note:- Print your answer as floor value (average height)The first line contains N: numbers of tree.
Then follows N lines represents the height of each tree.
Constraint:-
1 <= n <= 100000
1 <= a[i] <= 100000Print the average height of all the trees in the yardInput
5
6
8
34
9
3
Output
12
Explanation:-
Sum of heights =60
Average of heights =60/5
Sample Input:
3
1
2
3
, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k;
cin>>n;
int a[n];
long long sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
cout<<sum/n;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There are N trees in Terry's front yard. He is supposed to measures the height of each tree and find the average height of trees in his yard. What is the average height of a tree in Terry's front yard?
Note:- Print your answer as floor value (average height)The first line contains N: numbers of tree.
Then follows N lines represents the height of each tree.
Constraint:-
1 <= n <= 100000
1 <= a[i] <= 100000Print the average height of all the trees in the yardInput
5
6
8
34
9
3
Output
12
Explanation:-
Sum of heights =60
Average of heights =60/5
Sample Input:
3
1
2
3
, 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();
long A[] = new long[n];
for(int i=0;i<n;i++){
A[i]=sc.nextLong();
}
long sum=0;
for(int i=0;i<n;i++){
sum+=A[i];
}
long average = sum/n;
System.out.print(average);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There are N trees in Terry's front yard. He is supposed to measures the height of each tree and find the average height of trees in his yard. What is the average height of a tree in Terry's front yard?
Note:- Print your answer as floor value (average height)The first line contains N: numbers of tree.
Then follows N lines represents the height of each tree.
Constraint:-
1 <= n <= 100000
1 <= a[i] <= 100000Print the average height of all the trees in the yardInput
5
6
8
34
9
3
Output
12
Explanation:-
Sum of heights =60
Average of heights =60/5
Sample Input:
3
1
2
3
, I have written this Solution Code: n = int(input())
total_sum = 0
for i in range (n):
num =int(input())
total_sum +=(num)
avg = total_sum / n
print(int(avg)), 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: 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: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: static int Help(int N, int M){
if(N%M==0){return 1;}
return 0;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: function Help(n,m) {
// write code here
// do no console.log the answer
// return the output using return keyword
const ans = (n % m === 0) ? 1 : 0
return ans
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: def Help(N,M):
if N%M==0:
return 1
return 0
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code:
int Help(int N, int M){
return N%M==0;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code:
int Help(int N, int M){
return N%M==0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of size N. You need to find the root mean square (RMS) of the array i. e you first need to square all values of array and take its mean. Then you need to return the square root of mean. Print the answer with precision upto 6 decimal places.The first line contains an integer N - the size of the array
The next line contains N space-separated integers - the elements of the array.
<b>Constraints:</b>
1 <= N <= 100
1 <= Ai <= 100Print the RMS value of the array.Sample Input 1:
4
1 2 3 4
Output:
2.738613
Sample Input 2:
2
7 13
Output:
10.440307
<b>Explanation 1:</b>
Sum of squares = 1 + 4 + 9 + 16 = 30
Mean = 30 / 4 = 7.5
Taking a square root of 7.5 gives 2.738613
</b>Explanation 2:</b>
Sum of squares = 49 + 169 = 218
Mean = 218 / 2 = 109
Taking the square root of 109 gives 10.440307, I have written this Solution Code: try:
n=int(input())
a=[int(x)**2 for x in input().split()]
s=sum(a)/n
r=s**(1/2)
print('%.6f' % r)
except EOFError as e:
pass, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A of size N. You need to find the root mean square (RMS) of the array i. e you first need to square all values of array and take its mean. Then you need to return the square root of mean. Print the answer with precision upto 6 decimal places.The first line contains an integer N - the size of the array
The next line contains N space-separated integers - the elements of the array.
<b>Constraints:</b>
1 <= N <= 100
1 <= Ai <= 100Print the RMS value of the array.Sample Input 1:
4
1 2 3 4
Output:
2.738613
Sample Input 2:
2
7 13
Output:
10.440307
<b>Explanation 1:</b>
Sum of squares = 1 + 4 + 9 + 16 = 30
Mean = 30 / 4 = 7.5
Taking a square root of 7.5 gives 2.738613
</b>Explanation 2:</b>
Sum of squares = 49 + 169 = 218
Mean = 218 / 2 = 109
Taking the square root of 109 gives 10.440307, I have written this Solution Code: /*package whatever //do not write package name here */
import java.io.*;
import java.util.Scanner;
import java.lang.Math;
class Main {
public static void main (String[] args) {
int n;
Scanner s = new Scanner(System.in);
n = s.nextInt();
double x=0;
double sum=0;
for(int i=0;i<n;i++){
x=s.nextDouble();
sum+=x*x;
}
sum/=n;
sum=Math.sqrt(sum);
System.out.printf("%.6f",sum);
}
}, 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: 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: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: static int Help(int N, int M){
if(N%M==0){return 1;}
return 0;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: function Help(n,m) {
// write code here
// do no console.log the answer
// return the output using return keyword
const ans = (n % m === 0) ? 1 : 0
return ans
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: def Help(N,M):
if N%M==0:
return 1
return 0
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code:
int Help(int N, int M){
return N%M==0;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code:
int Help(int N, int M){
return N%M==0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find 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: There are N trees in Terry's front yard. He is supposed to measures the height of each tree and find the average height of trees in his yard. What is the average height of a tree in Terry's front yard?
Note:- Print your answer as floor value (average height)The first line contains N: numbers of tree.
Then follows N lines represents the height of each tree.
Constraint:-
1 <= n <= 100000
1 <= a[i] <= 100000Print the average height of all the trees in the yardInput
5
6
8
34
9
3
Output
12
Explanation:-
Sum of heights =60
Average of heights =60/5
Sample Input:
3
1
2
3
, I have written this Solution Code: function averageMe(sizeOfArray, array) {
// write code here
// do no console.log the answer
// return the output using return keyword
const sum = array.reduce((a,b)=> a+b,0)
return Math.floor(sum/sizeOfArray)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There are N trees in Terry's front yard. He is supposed to measures the height of each tree and find the average height of trees in his yard. What is the average height of a tree in Terry's front yard?
Note:- Print your answer as floor value (average height)The first line contains N: numbers of tree.
Then follows N lines represents the height of each tree.
Constraint:-
1 <= n <= 100000
1 <= a[i] <= 100000Print the average height of all the trees in the yardInput
5
6
8
34
9
3
Output
12
Explanation:-
Sum of heights =60
Average of heights =60/5
Sample Input:
3
1
2
3
, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k;
cin>>n;
int a[n];
long long sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
cout<<sum/n;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There are N trees in Terry's front yard. He is supposed to measures the height of each tree and find the average height of trees in his yard. What is the average height of a tree in Terry's front yard?
Note:- Print your answer as floor value (average height)The first line contains N: numbers of tree.
Then follows N lines represents the height of each tree.
Constraint:-
1 <= n <= 100000
1 <= a[i] <= 100000Print the average height of all the trees in the yardInput
5
6
8
34
9
3
Output
12
Explanation:-
Sum of heights =60
Average of heights =60/5
Sample Input:
3
1
2
3
, 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();
long A[] = new long[n];
for(int i=0;i<n;i++){
A[i]=sc.nextLong();
}
long sum=0;
for(int i=0;i<n;i++){
sum+=A[i];
}
long average = sum/n;
System.out.print(average);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There are N trees in Terry's front yard. He is supposed to measures the height of each tree and find the average height of trees in his yard. What is the average height of a tree in Terry's front yard?
Note:- Print your answer as floor value (average height)The first line contains N: numbers of tree.
Then follows N lines represents the height of each tree.
Constraint:-
1 <= n <= 100000
1 <= a[i] <= 100000Print the average height of all the trees in the yardInput
5
6
8
34
9
3
Output
12
Explanation:-
Sum of heights =60
Average of heights =60/5
Sample Input:
3
1
2
3
, I have written this Solution Code: n = int(input())
total_sum = 0
for i in range (n):
num =int(input())
total_sum +=(num)
avg = total_sum / n
print(int(avg)), 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 number N, add 8 to it and then divide it by 3, take the modulus of the resulting value with 5 and then finally multiply it by 5. Display the final value of NYou don't have to worry about the input, you just have to complete the function <b>stepsExecute</b>
<b>Constraints</b>
1000 <= number <= 9999Print the final resultSample Input :
2345
Sample Output :
20, I have written this Solution Code: static void stepsExecute(int N){
System.out.println(((((N+8)/3)%5)*5));
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, add 8 to it and then divide it by 3, take the modulus of the resulting value with 5 and then finally multiply it by 5. Display the final value of NYou don't have to worry about the input, you just have to complete the function <b>stepsExecute</b>
<b>Constraints</b>
1000 <= number <= 9999Print the final resultSample Input :
2345
Sample Output :
20, I have written this Solution Code: a = int(input())
print((((a+8)//3)%5)*5), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: static int Help(int N, int M){
if(N%M==0){return 1;}
return 0;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: function Help(n,m) {
// write code here
// do no console.log the answer
// return the output using return keyword
const ans = (n % m === 0) ? 1 : 0
return ans
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code: def Help(N,M):
if N%M==0:
return 1
return 0
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code:
int Help(int N, int M){
return N%M==0;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sherlock is a great detective but he is weak in maths. On one day Sherlock wants to divide N apples into M people but he is not sure whether he can divide them equally or not. Your task is to help Sherlock to solve the problem.<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>Help()</b> that takes integers N and M as arguments.
Constraints:-
1 <= N M <= 1000Return 1 if it is possible to divide N apple among M people else return 0.Sample Input:-
6 2
Sample Output:-
1
Explanation:-
both people will get 3 apples each.
Sample Input:-
3 4
Sample Output:-
0, I have written this Solution Code:
int Help(int N, int M){
return N%M==0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer N, find 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 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: 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: A magic number is a natural number that contains both the digits 7 and 9 in it. For eg:- 79, 879, 53729 etc.
Given a number N, your task is to find the closest Magic number from the given number N.
Note:- If more than one answer exists return the minimum one<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>MagicNumber()</b> that takes integer N as argument.
Constraints:-
1 <= N <= 100000Return a magic number closest to the given number N.Sample Input:-
8
Sample Output:-
79
Sample Input:-
900
Sample Output:-
897, I have written this Solution Code: def check(N):
if(N<0):
return 1
a=0
b=0
while(N):
if(N%10==7):
a=1
if(N%10==9):
b=1
N=N//10
if( a==1 and b==1):
return 0
return 1
def MagicNumber(N):
i=0
while(check(N-i)==1 and check(N+i)==1):
i=i+1
if(check(N-i)==0):
return N-i
return N+i
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A magic number is a natural number that contains both the digits 7 and 9 in it. For eg:- 79, 879, 53729 etc.
Given a number N, your task is to find the closest Magic number from the given number N.
Note:- If more than one answer exists return the minimum one<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>MagicNumber()</b> that takes integer N as argument.
Constraints:-
1 <= N <= 100000Return a magic number closest to the given number N.Sample Input:-
8
Sample Output:-
79
Sample Input:-
900
Sample Output:-
897, I have written this Solution Code: int check(int n){
int s=0;
int p=0;
while(n){
if(n%10==7){s=1;}
if(n%10==9){p=1;}
n/=10;
}
if(s && p){return 0;}
return 1;
}
int MagicNumber(int n){
int i=0;
while(check(n-i) && check(n+i)){
i++;
}
if(check(n-i)==0){return n-i;}
else{
return n+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.