Instruction
stringlengths 261
35k
| Response
stringclasses 1
value |
|---|---|
For this Question: Given a circular linked list consisting of N nodes and an integer K, your task is to add the integer K at the end of the list.
<b>Note:
Sample Input and Output just show how a linked list will look depending on the questions. Do not copy-paste as it is in custom input</b><b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Insertion()</b> that takes head node of circular linked list and the integer K as parameter.
Constraints:
1 <=N <= 1000
1 <= Node.data, K<= 1000Return the head node of the modified circular linked list.Sample Input 1:-
3
1- >2- >3
4
Sample Output 1:-
1- >2- >3- >4
Sample Input 2:-
3
1- >3- >2
1
Sample Output 2:-
1- >3- >2- >1, I have written this Solution Code: public static Node Insertion(Node head, int K){
Node node=head;
while ( node.next != head)
{node = node.next; }
Node temp = new Node(K);
node.next=temp;
temp.next=head;
return head;}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There is a rule in ludo that a token can only be unlocked when either a 1 or 6 shown in the die. Given the die number N, Your task is to check whether the token can be unlocked 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>ludo()</b> that takes integers N as argument.
Constraints:-
1 <= N <= 6Return 1 if the token can be unlocked else return 0.Sample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
0, I have written this Solution Code: int ludo(int N){
return (N==1||N==6);
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There is a rule in ludo that a token can only be unlocked when either a 1 or 6 shown in the die. Given the die number N, Your task is to check whether the token can be unlocked 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>ludo()</b> that takes integers N as argument.
Constraints:-
1 <= N <= 6Return 1 if the token can be unlocked else return 0.Sample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
0, I have written this Solution Code: def ludo(N):
if N==1 or N==6:
return 1
return 0
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There is a rule in ludo that a token can only be unlocked when either a 1 or 6 shown in the die. Given the die number N, Your task is to check whether the token can be unlocked 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>ludo()</b> that takes integers N as argument.
Constraints:-
1 <= N <= 6Return 1 if the token can be unlocked else return 0.Sample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
0, I have written this Solution Code:
int ludo(int N){
return (N==1||N==6);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: There is a rule in ludo that a token can only be unlocked when either a 1 or 6 shown in the die. Given the die number N, Your task is to check whether the token can be unlocked 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>ludo()</b> that takes integers N as argument.
Constraints:-
1 <= N <= 6Return 1 if the token can be unlocked else return 0.Sample Input:-
1
Sample Output:-
1
Sample Input:-
2
Sample Output:-
0, I have written this Solution Code: static int ludo(int N){
if(N==1 || N==6){return 1;}
return 0;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given resistance value of N resistors. Find the net resistance of the system when all of these N resistors are connected in parallel.
If there are three resistors A1, A2, A3, when they are connected in parallel, the net resistance will be 1/((1/A1) + (1/A2) + (1/A3))
Since this number can also have a fraction part, you only have to print the floor of the result obtained.
For example, if value of 1/((1/A1) + (1/A2) + (1/A3)) if 7.54567, you only have to print 7.First line contains a single integer N denoting the number of resistors.
Next line contains N space separated integers containing the value of different resistors.
Constraints
1 ≤ N ≤ 10^5
1 ≤ Ai ≤ 10^9Print the integral part or floor of the value obtained from the formula 1/((1/A1) + (1/A2) + ..... + (1/AN)).Input
2
10 30
Output
7
1/((1/10) + (1/30)) = 30/4 = 7.5 and floor of 7.5 is 7, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args)throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
double arr[] = new double[N];
String str[] = br.readLine().trim().split(" ");
for(int i=0;i<N;i++)
arr[i]=Integer.parseInt(str[i]);
double resistance=0;
int equResistance=0;
for(int i=0;i<N;i++)
arr[i]=Integer.parseInt(str[i]);
for(int i=0;i<N;i++)
{
resistance=resistance+(1/arr[i]);
}
equResistance = (int)Math.floor((1/resistance));
System.out.println(equResistance);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given resistance value of N resistors. Find the net resistance of the system when all of these N resistors are connected in parallel.
If there are three resistors A1, A2, A3, when they are connected in parallel, the net resistance will be 1/((1/A1) + (1/A2) + (1/A3))
Since this number can also have a fraction part, you only have to print the floor of the result obtained.
For example, if value of 1/((1/A1) + (1/A2) + (1/A3)) if 7.54567, you only have to print 7.First line contains a single integer N denoting the number of resistors.
Next line contains N space separated integers containing the value of different resistors.
Constraints
1 ≤ N ≤ 10^5
1 ≤ Ai ≤ 10^9Print the integral part or floor of the value obtained from the formula 1/((1/A1) + (1/A2) + ..... + (1/AN)).Input
2
10 30
Output
7
1/((1/10) + (1/30)) = 30/4 = 7.5 and floor of 7.5 is 7, I have written this Solution Code: r = input("")
r = int(r)
n = input("").split()
resistance=0.0
for i in range(0,r):
resistor = float(n[i])
resistance = resistance + (1/resistor)
print(int(1/resistance)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given resistance value of N resistors. Find the net resistance of the system when all of these N resistors are connected in parallel.
If there are three resistors A1, A2, A3, when they are connected in parallel, the net resistance will be 1/((1/A1) + (1/A2) + (1/A3))
Since this number can also have a fraction part, you only have to print the floor of the result obtained.
For example, if value of 1/((1/A1) + (1/A2) + (1/A3)) if 7.54567, you only have to print 7.First line contains a single integer N denoting the number of resistors.
Next line contains N space separated integers containing the value of different resistors.
Constraints
1 ≤ N ≤ 10^5
1 ≤ Ai ≤ 10^9Print the integral part or floor of the value obtained from the formula 1/((1/A1) + (1/A2) + ..... + (1/AN)).Input
2
10 30
Output
7
1/((1/10) + (1/30)) = 30/4 = 7.5 and floor of 7.5 is 7, I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
signed main() {
IOS;
int n; cin >> n;
double s = 0;
for(int i = 1; i <= n; i++){
double p; cin >> p;
s = s + (1/p);
}
s = 1/s;
cout << floor(s);
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program to check whether character is an alphabet or not using conditional operator.The first line of the input contains a character ch.
<b>Constraints</b>
'a', 'A' <= ch <= 'z', 'Z'Print "YES" if it's alphabet otherwise "NO".Sample Input :
a
Sample Output
YES, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
char c = sc.next().charAt(0);
String output =(c>='a' && c<='z') || (c>='A' && c<='Z')
? "YES" : "NO";
System.out.println(output);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program to check whether character is an alphabet or not using conditional operator.The first line of the input contains a character ch.
<b>Constraints</b>
'a', 'A' <= ch <= 'z', 'Z'Print "YES" if it's alphabet otherwise "NO".Sample Input :
a
Sample Output
YES, I have written this Solution Code: c = input()
if(c.isalpha()):
print("YES")
else:
print("NO"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program to check whether character is an alphabet or not using conditional operator.The first line of the input contains a character ch.
<b>Constraints</b>
'a', 'A' <= ch <= 'z', 'Z'Print "YES" if it's alphabet otherwise "NO".Sample Input :
a
Sample Output
YES, I have written this Solution Code: #include <stdio.h>
int main()
{
char ch;
scanf("%c", &ch);
(ch>='a' && ch<='z') || (ch>='A' && ch<='Z')
? printf("YES")
: printf("NO");
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A[] and a range [a, b]. The task is to partition the array around the range such that array is divided into three parts.
1) All elements smaller than a come first.
2) All elements in range a to b come next.
3) All elements greater than b appear in the end.
The individual elements of three sets can appear in any order. You are required to return the modified arranged array.
<b>Note:-</b>
In the case of custom input, you will get 1 if your code is correct else get a 0.<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>threeWayPartition()</b> which contains following arguments.
A: input array list
low: starting integer of range
high: ending integer of range
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10<sup>4</sup>
1 <= A[i] <= 10<sup>5</sup>
1 <= low <= high <= 10<sup>5</sup>
The Sum of N over all test case doesn't exceed 10^5For each test case return the modified array.Sample Input:
2
5
1 8 3 3 4
3 5
3
1 2 3
1 3
Sample Output:
1 3 3 4 8
1 2 3
<b>Explanation:</b>
Testcase 1: First, the array has elements less than or equal to 3. Then, elements between 3 and 5. And, finally elements greater than 5. So, one of the possible outputs is 1 3 3 4 8.
Testcase 2: First, the array has elements less than or equal to 1. Then, elements between 1 and 3. And, finally elements greater than 3. So, the output is 1 2 3., I have written this Solution Code:
public static ArrayList<Integer> threeWayPartition(ArrayList<Integer> A, int lowVal, int highVal)
{
int n = A.size();
ArrayList<Integer> arr = A;
int start = 0, end = n-1;
for (int i=0; i<=end;)
{
// swapping the element with those at start
// if array element is less than lowVal
if (arr.get(i) < lowVal){
int temp=arr.get(i);
arr.add(i,arr.get(start));
arr.remove(i+1);
arr.add(start,temp);
arr.remove(start+1);
i++;
start++;
}
// swapping the element with those at end
// if array element is greater than highVal
else if (arr.get(i) > highVal){
int temp=arr.get(i);
arr.add(i,arr.get(end));
arr.remove(i+1);
arr.add(end,temp);
arr.remove(end+1);
end--;
}
// else just move ahead
else
i++;
}
return arr;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array A[] and a range [a, b]. The task is to partition the array around the range such that array is divided into three parts.
1) All elements smaller than a come first.
2) All elements in range a to b come next.
3) All elements greater than b appear in the end.
The individual elements of three sets can appear in any order. You are required to return the modified arranged array.
<b>Note:-</b>
In the case of custom input, you will get 1 if your code is correct else get a 0.<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>threeWayPartition()</b> which contains following arguments.
A: input array list
low: starting integer of range
high: ending integer of range
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10<sup>4</sup>
1 <= A[i] <= 10<sup>5</sup>
1 <= low <= high <= 10<sup>5</sup>
The Sum of N over all test case doesn't exceed 10^5For each test case return the modified array.Sample Input:
2
5
1 8 3 3 4
3 5
3
1 2 3
1 3
Sample Output:
1 3 3 4 8
1 2 3
<b>Explanation:</b>
Testcase 1: First, the array has elements less than or equal to 3. Then, elements between 3 and 5. And, finally elements greater than 5. So, one of the possible outputs is 1 3 3 4 8.
Testcase 2: First, the array has elements less than or equal to 1. Then, elements between 1 and 3. And, finally elements greater than 3. So, the output is 1 2 3., I have written this Solution Code: def threewayPartition(arr,low,high):
i=low-1
pivot = arr[high]
for j in range(low,high):
if arr[j]<=pivot:
i+=1
arr[i],arr[j]=arr[j],arr[i]
i+=1
arr[i],arr[high]=arr[high],arr[i]
return i
def quickSort(arr,low,high):
if low<high:
key=threewayPartition(arr,low,high)
quickSort(arr,low,key-1)
quickSort(arr,key+1,high)
return arr
t= int(input())
while t>0:
s = int(input())
arr = list(map(int,input().split()))
a,b = list(map(int,input().split()))
print(1)
t-=1, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string, the task is to remove duplicates from it. Expected time complexity O(n) where n is length of the input string and extra space O(1) under the assumption that there are total of 256 possible characters in a string.
Note: that original order of characters must be kept same.The first line of the input is the number of test cases T. And the first line of a test case contains a string.
Constraints:
1 <= T <= 15
1 <= |string|<= 15000Modified string without duplicates and the same order of characters.Input:
2
hello
helloworld
Output:
helo
helowrd, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int test = Integer.parseInt(br.readLine());
while(test-->0)
{
String line=br.readLine();
char str[] = line.toCharArray();
int n = str.length;
System.out.println(duplicates(str, n));
}
}
static String duplicates(char str[], int n)
{
int index = 0;
for (int i = 0; i < n; i++)
{
int j;
for (j = 0; j < i; j++)
if (str[i] == str[j])
break;
if (j == i)
str[index++] = str[i];
}
return String.valueOf(Arrays.copyOf(str, index));
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string, the task is to remove duplicates from it. Expected time complexity O(n) where n is length of the input string and extra space O(1) under the assumption that there are total of 256 possible characters in a string.
Note: that original order of characters must be kept same.The first line of the input is the number of test cases T. And the first line of a test case contains a string.
Constraints:
1 <= T <= 15
1 <= |string|<= 15000Modified string without duplicates and the same order of characters.Input:
2
hello
helloworld
Output:
helo
helowrd, I have written this Solution Code: for _ in range(int(input())):
s=input()
a=[]
for i in s:
if (i not in a):
print(i,end="")
a.append(i)
print(), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string, the task is to remove duplicates from it. Expected time complexity O(n) where n is length of the input string and extra space O(1) under the assumption that there are total of 256 possible characters in a string.
Note: that original order of characters must be kept same.The first line of the input is the number of test cases T. And the first line of a test case contains a string.
Constraints:
1 <= T <= 15
1 <= |string|<= 15000Modified string without duplicates and the same order of characters.Input:
2
hello
helloworld
Output:
helo
helowrd, I have written this Solution Code: // C++ implementation of above approach
#include <bits/stdc++.h>
#include <string>
using namespace std;
// Function to remove duplicates
string removeDuplicatesFromString(string str)
{
// keeps track of visited characters
int counter = 0;
int i = 0;
int size = str.size();
// gets character value
int x;
// keeps track of length of resultant string
int length = 0;
int table[500];
memset(table,0,sizeof(table));
while (i < size) {
x = str[i]-'a'+97;
// check if Xth bit of counter is unset
if (table[x] == 0) {
str[length] = 'a' + x -97;
// mark current character as visited
table[x]++;
length++;
}
i++;
}
return str.substr(0, length);
}
// Driver code
int main()
{
int t;
cin>>t;
while(t>0)
{ t--;
string str;
cin>>str;
cout << removeDuplicatesFromString(str)<<"\n";
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a group of A + B people, with A Indians and B Americans. Find number of ways to select a non-empty subset of these people, such that the subset has equal number of Indian and American people.Input contains two space separated integers A and B.
Constraints:
1 <= A, B <= 1000000Print the number of ways modulo 1000000007.Sample Input
2 2
Sample Output
5
Explanation: (I1, A1) (I2, A1) (I1, A2) (I2, A2) (I1, I2, A1, A2)
I denotes indian person. A denotes american person., I have written this Solution Code:
import java.io.*;
public class Main {
static long mod = 1000000007;
static long[] dp = new long[1000001];
static{
dp[0] = 1;
for(int i = 1 ; i < 1000001 ; i++){
dp[i] = (dp[i - 1] * i)%mod;
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] line = br.readLine().split(" ");
int ind = Integer.parseInt(line[0]);
int amer = Integer.parseInt(line[1]);
computemaxPossibilies(ind, amer);
}
static void computemaxPossibilies(int ind, int amer){
long result =0;
int min = Math.min(ind,amer);
for(int i = 1 ; i <= Math.min(ind,amer) ; i++){
result = (result + ((nCr(ind, i) * nCr(amer, i))%mod)%mod);
}
System.out.println(result%mod);
}
static long nCr(int n, int r){
long result = ((((dp[n] * Fermatexponent(dp[r]) % mod) * Fermatexponent(dp[n - r])) % mod));
return result;
}
static long Fermatexponent(long fact) {
long submod = mod -2;
long result = 1;
while (submod > 0) {
if (submod % 2 == 1)
result = (result * fact) % mod;
submod = submod / 2;
fact = (fact * fact) % mod;
}
return result;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a group of A + B people, with A Indians and B Americans. Find number of ways to select a non-empty subset of these people, such that the subset has equal number of Indian and American people.Input contains two space separated integers A and B.
Constraints:
1 <= A, B <= 1000000Print the number of ways modulo 1000000007.Sample Input
2 2
Sample Output
5
Explanation: (I1, A1) (I2, A1) (I1, A2) (I2, A2) (I1, I2, A1, A2)
I denotes indian person. A denotes american person., I have written this Solution Code: #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
long long powerm(long long x, unsigned long long y, long long p)
{
long long res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
int mo=1000000007;
int fa[1000001]={};
int ifa[1000001]={};
int ncr(int n,int r){
return (fa[n]*ifa[r]%mo)*ifa[n-r]%mo;
}
signed main()
{
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
int a,b;
cin>>a>>b;
int n=min(a,b);
fa[0]=1;
ifa[0]=1;
for(int i=1;i<=1000000;++i){
fa[i]=(fa[i-1]*i)%mo;
ifa[i]=powerm(fa[i],mo-2,mo);
}
int ans=0;
for(int i=1;i<=n;++i){
ans=(ans+(ncr(a,i)*ncr(b,i))%mo)%mo;
}
cout<<ans;
#ifdef ANIKET_GOYAL
// cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A group of contest writers have written n problems and want to use k of them in an upcoming
contest. Each problem has a difficulty level. A contest is valid if all of its k problems have different
difficulty levels.
Compute how many distinct valid contests the contest writers can produce. Two contests are
distinct if and only if there exists some problem present in one contest but not present in the other.
Print the result modulo 998244353.The first line of input contains two space-separated integers n and k (1 ≤ k ≤ n ≤ 1000).
The next line contains n space-separated integers representing the difficulty levels. The difficulty
levels are between 1 and 10^9
(inclusive).Print the number of distinct contests possible, modulo 998244353Sample input
5 2
1 2 3 4 5
Sample output
10
Sample input
5 2
1 1 1 2 2
Sample output
6, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner inputTaker = new Scanner(System.in);
int N = inputTaker.nextInt();
int K = inputTaker.nextInt();
HashMap<Long,Integer> map= new HashMap<>();
for(int i =0; i < N ; i++)
{
long temp = inputTaker.nextLong();
int count = 1;
if(map.containsKey(temp))
count += map.get(temp);
map.put(temp,count);
}
int a[] = new int[map.size()];
int i = 0;
for(Long k : map.keySet()) {
a[i] = map.get(k);
i++;
}
long dp[][] = new long[K+1][a.length + 1];
for(int j = 0; j < K+1; j++)
for(int k = 0; k < a.length + 1; k++) {
dp[j][k] = -1L;
}
System.out.print(f( a, K, 0,dp));
}
public static long f(int[] a, int k, int i,long[][] dp) {
int n = a.length;
if(k > n - i) {
return 0;
}
if(k == 0) {
return 1;
}
if(dp[k][i] != -1)
return dp[k][i];
return dp[k][i] = (a[i] * f(a, k - 1, i + 1,dp) % 998244353 + f(a, k, i + 1,dp)) % 998244353;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A group of contest writers have written n problems and want to use k of them in an upcoming
contest. Each problem has a difficulty level. A contest is valid if all of its k problems have different
difficulty levels.
Compute how many distinct valid contests the contest writers can produce. Two contests are
distinct if and only if there exists some problem present in one contest but not present in the other.
Print the result modulo 998244353.The first line of input contains two space-separated integers n and k (1 ≤ k ≤ n ≤ 1000).
The next line contains n space-separated integers representing the difficulty levels. The difficulty
levels are between 1 and 10^9
(inclusive).Print the number of distinct contests possible, modulo 998244353Sample input
5 2
1 2 3 4 5
Sample output
10
Sample input
5 2
1 1 1 2 2
Sample output
6, I have written this Solution Code: from collections import Counter
mod = 998244353
n,k = map(int, input().split())
c = Counter(map(int, input().split()))
if len(c)<k:
print('0')
else:
poly = [1]
for v in c.values():
npoly = poly[:]
npoly.append(0)
for i in range(len(poly)):
npoly[i+1] = (npoly[i+1] + v * poly[i]) % mod
poly = npoly[:k+1]
print(poly[k]), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A group of contest writers have written n problems and want to use k of them in an upcoming
contest. Each problem has a difficulty level. A contest is valid if all of its k problems have different
difficulty levels.
Compute how many distinct valid contests the contest writers can produce. Two contests are
distinct if and only if there exists some problem present in one contest but not present in the other.
Print the result modulo 998244353.The first line of input contains two space-separated integers n and k (1 ≤ k ≤ n ≤ 1000).
The next line contains n space-separated integers representing the difficulty levels. The difficulty
levels are between 1 and 10^9
(inclusive).Print the number of distinct contests possible, modulo 998244353Sample input
5 2
1 2 3 4 5
Sample output
10
Sample input
5 2
1 1 1 2 2
Sample output
6, I have written this Solution Code: #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int mod = 998244353;
int a[1010];
ll val[1010];
ll dp[1010][1010];
int main()
{
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; ++ i)
{
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n);
int cnt = 1;
int top = 1;
for(int i = 2; i <= n; ++ i)
{
if(a[i] == a[i - 1])
cnt++;
else
{
val[top++] = cnt;
cnt = 1;
}
}
val[top++] = cnt;
memset(dp, 0, sizeof(dp));
for(int i = 0; i <= 1000; ++ i)
dp[i][0] = 1;
for(int i = 1; i < top; ++ i)
{
for(int j = 1; j <= k; ++ j)
{
dp[i][j] = (dp[i - 1][j - 1] * val[i] % mod + dp[i - 1][j]) % mod;
}
}
cout << dp[top - 1][k] << endl;
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an array and Q queries. Your task is to perform these operations:-
enqueue: this operation will add an element to your current queue.
dequeue: this operation will delete the element from the starting of the queue
displayfront: this operation will print the element presented at the frontUser task:
Since this will be a functional problem, you don't have to take input. You just have to complete the functions:
<b>enqueue()</b>:- that takes the integer to be added and the maximum size of array as parameter.
<b>dequeue()</b>:- that takes the queue as parameter.
<b>displayfront()</b> :- that takes the queue as parameter.
Constraints:
1 <= Q(Number of queries) <= 10<sup>3</sup>
<b> Custom Input:</b>
First line of input should contains two integer number of queries Q and the size of the array N. Next Q lines contains any of the given three operations:-
enqueue x
dequeue
displayfrontDuring a dequeue operation if queue is empty you need to print "Queue is empty", during enqueue operation if the maximum size of array is reached you need to print "Queue is full" and during displayfront operation you need to print the element which is at the front and if the queue is empty you need to print "Queue is empty".
Note:-Each msg or element is to be printed on a new line
Sample Input:-
8 2
displayfront
enqueue 2
displayfront
enqueue 4
displayfront
dequeue
displayfront
enqueue 5
Sample Output:-
Queue is empty
2
2
4
Queue is full
Explanation:-here size of given array is 2 so when last enqueue operation perfomed the array was already full so we display the msg "Queue is full".
Sample input:
5 5
enqueue 4
enqueue 5
displayfront
dequeue
displayfront
Sample output:-
4
5, I have written this Solution Code: public static void enqueue(int x,int k)
{
if (rear >= k) {
System.out.println("Queue is full");
}
else {
a[rear] = x;
rear++;
}
}
public static void dequeue()
{
if (rear <= front) {
System.out.println("Queue is empty");
}
else {
front++;
}
}
public static void displayfront()
{
if (rear<=front) {
System.out.println("Queue is empty");
}
else {
int x = a[front];
System.out.println(x);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S you have to remove all pairs of identical letters, which are consecutive. If after the removal there appear new pairs, remove them as well. Repeat this untill no adjacent letter in the string is same.
Note that deleting of the consecutive identical letters can be done in any order, as any order leads to the same result.The input data consists of a single string S.
Constraints:
1 <= |S| <= 100000
S contains lowercase english letters only.Print the given string after it is processed. It is guaranteed that the result will contain at least one character.Sample Input
hhoowaaaareyyoouu
Sample Output
wre
Explanation:
First we remove "hh" then "oo" then "aa" then "yy" then "oo" then "uu" and we are left with "wre".
Now we cannot remove anything.
Sample Input:-
abcde
Sample Output:-
abcde
Sample Input:-
abcddcb
Sample Output:-
a, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
BufferedReader in =new BufferedReader(new InputStreamReader(System.in));
StringBuilder s = new StringBuilder();
String text=null;
while ((text = in.readLine ()) != null)
{
s.append(text);
}
int len=s.length();
for(int i=0;i<len-1;i++){
if(s.charAt(i)==s.charAt(i+1)){
int flag=0;
s.delete(i,i+2);
int left=i-1;
len=len-2;
i=i-2;
if(i<0){
i=-1;
}
}
}
System.out.println(s);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S you have to remove all pairs of identical letters, which are consecutive. If after the removal there appear new pairs, remove them as well. Repeat this untill no adjacent letter in the string is same.
Note that deleting of the consecutive identical letters can be done in any order, as any order leads to the same result.The input data consists of a single string S.
Constraints:
1 <= |S| <= 100000
S contains lowercase english letters only.Print the given string after it is processed. It is guaranteed that the result will contain at least one character.Sample Input
hhoowaaaareyyoouu
Sample Output
wre
Explanation:
First we remove "hh" then "oo" then "aa" then "yy" then "oo" then "uu" and we are left with "wre".
Now we cannot remove anything.
Sample Input:-
abcde
Sample Output:-
abcde
Sample Input:-
abcddcb
Sample Output:-
a, I have written this Solution Code: s=input()
l=["aa","bb","cc","dd","ee","ff","gg","hh","ii","jj","kk","ll","mm","nn","oo","pp","qq","rr","ss","tt","uu","vv","ww","xx","yy","zz"]
while True:
do=False
for i in range(len(l)):
if l[i] in s:
do=True
while l[i] in s:
s=s.replace(l[i],"")
if do==False:
break
print(s), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string S you have to remove all pairs of identical letters, which are consecutive. If after the removal there appear new pairs, remove them as well. Repeat this untill no adjacent letter in the string is same.
Note that deleting of the consecutive identical letters can be done in any order, as any order leads to the same result.The input data consists of a single string S.
Constraints:
1 <= |S| <= 100000
S contains lowercase english letters only.Print the given string after it is processed. It is guaranteed that the result will contain at least one character.Sample Input
hhoowaaaareyyoouu
Sample Output
wre
Explanation:
First we remove "hh" then "oo" then "aa" then "yy" then "oo" then "uu" and we are left with "wre".
Now we cannot remove anything.
Sample Input:-
abcde
Sample Output:-
abcde
Sample Input:-
abcddcb
Sample Output:-
a, I have written this Solution Code: #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main(){
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
string s;
cin>>s;
int len=s.length();
char stk[410000];
int k = 0;
for (int i = 0; i < len; i++)
{
stk[k++] = s[i];
while (k > 1 && stk[k - 1] == stk[k - 2])
k -= 2;
}
for (int i = 0; i < k; i++)
cout << stk[i];
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given a 2X2 square matrix. You need to find the determinant of the matrix.The input contains two-line, each line contain two integers separated by spaces.
Each element of the matrix is from 1 to 100.Output a single integer, the determinant of the matrix.Sample Input
4 5
2 3
Sample Output
2
Sample Input
2 10
10 40
Sample Output
-20, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner sc=new Scanner(System.in);
int[][]arr=new int[2][2];
for(int i=0;i<2;i++){
for(int j=0;j<2;j++){
arr[i][j]=sc.nextInt();
}
}
int determinent=(arr[0][0]*arr[1][1])-(arr[1][0]*arr[0][1]);
System.out.print(determinent);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given a 2X2 square matrix. You need to find the determinant of the matrix.The input contains two-line, each line contain two integers separated by spaces.
Each element of the matrix is from 1 to 100.Output a single integer, the determinant of the matrix.Sample Input
4 5
2 3
Sample Output
2
Sample Input
2 10
10 40
Sample Output
-20, I have written this Solution Code: arr1=list(map(int,input().split()))
arr2=list(map(int,input().split()))
lis=[]
a11=arr1[0]
a12=arr1[1]
a21=arr2[0]
a22=arr2[1]
det=(a11*a22)-(a12*a21)
print(det), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given a 2X2 square matrix. You need to find the determinant of the matrix.The input contains two-line, each line contain two integers separated by spaces.
Each element of the matrix is from 1 to 100.Output a single integer, the determinant of the matrix.Sample Input
4 5
2 3
Sample Output
2
Sample Input
2 10
10 40
Sample Output
-20, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<a*d-b*c;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a matrix of size N*N, your task is to find the sum of the primary and secondary diagonal of the matrix.
For Matrix:-
M<sub>00</sub> M<sub>01</sub> M<sub>02</sub>
M<sub>10</sub> M<sub>11</sub> M<sub>12</sub>
M<sub>20</sub> M<sub>21</sub> M<sub>22</sub>
Primary diagonal:- M<sub>00</sub> M<sub>11</sub> M<sub>22</sub>
Secondary diagonal:- M<sub>02</sub> M<sub>11</sub> M<sub>20</sub>The first line of input contains a single integer N, The next N lines of input contains N space-separated integers depicting the values of the matrix.
Constraints:-
1 <= N <= 500
1 <= Matrix[][] <= 100000Print the sum of primary and secondary diagonal separated by a space.Sample Input:-
2
1 4
2 6
Sample Output:-
7 6
Sample Input:-
3
1 4 2
1 5 7
3 8 1
Sample Output:-
7 10, I have written this Solution Code:
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define max1 1000001
#define MOD 1000000007
#define read(type) readInt<type>()
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
signed main(){
int n;
cin>>n;
int a[n][n];
FOR(i,n){
FOR(j,n){
cin>>a[i][j];}}
int sum=0,sum1=0;;
FOR(i,n){
sum+=a[i][i];
sum1+=a[n-i-1][i];
}
out1(sum);out(sum1);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a matrix of size N*N, your task is to find the sum of the primary and secondary diagonal of the matrix.
For Matrix:-
M<sub>00</sub> M<sub>01</sub> M<sub>02</sub>
M<sub>10</sub> M<sub>11</sub> M<sub>12</sub>
M<sub>20</sub> M<sub>21</sub> M<sub>22</sub>
Primary diagonal:- M<sub>00</sub> M<sub>11</sub> M<sub>22</sub>
Secondary diagonal:- M<sub>02</sub> M<sub>11</sub> M<sub>20</sub>The first line of input contains a single integer N, The next N lines of input contains N space-separated integers depicting the values of the matrix.
Constraints:-
1 <= N <= 500
1 <= Matrix[][] <= 100000Print the sum of primary and secondary diagonal separated by a space.Sample Input:-
2
1 4
2 6
Sample Output:-
7 6
Sample Input:-
3
1 4 2
1 5 7
3 8 1
Sample Output:-
7 10, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String args[])throws Exception {
InputStreamReader inr= new InputStreamReader(System.in);
BufferedReader br= new BufferedReader(inr);
String str=br.readLine();
int row = Integer.parseInt(str);
int col=row;
int [][] arr=new int [row][col];
for(int i=0;i<row;i++){
String line =br.readLine();
String[] elements = line.split(" ");
for(int j=0;j<col;j++){
arr[i][j]= Integer.parseInt(elements[j]);
}
}
int sumPrimary=0;
int sumSecondary=0;
for(int i=0;i<row;i++){
sumPrimary=sumPrimary + arr[i][i];
sumSecondary= sumSecondary + arr[i][row-1-i];
}
System.out.println(sumPrimary+ " " +sumSecondary);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a matrix of size N*N, your task is to find the sum of the primary and secondary diagonal of the matrix.
For Matrix:-
M<sub>00</sub> M<sub>01</sub> M<sub>02</sub>
M<sub>10</sub> M<sub>11</sub> M<sub>12</sub>
M<sub>20</sub> M<sub>21</sub> M<sub>22</sub>
Primary diagonal:- M<sub>00</sub> M<sub>11</sub> M<sub>22</sub>
Secondary diagonal:- M<sub>02</sub> M<sub>11</sub> M<sub>20</sub>The first line of input contains a single integer N, The next N lines of input contains N space-separated integers depicting the values of the matrix.
Constraints:-
1 <= N <= 500
1 <= Matrix[][] <= 100000Print the sum of primary and secondary diagonal separated by a space.Sample Input:-
2
1 4
2 6
Sample Output:-
7 6
Sample Input:-
3
1 4 2
1 5 7
3 8 1
Sample Output:-
7 10, I have written this Solution Code: // mat is the matrix/ 2d array
// the dimensions of array are n * n
function diagonalSum(mat, n) {
// write code here
// console.log the answer as in example
let principal = 0, secondary = 0;
for (let i = 0; i < n; i++) {
principal += mat[i][i];
secondary += mat[i][n - i - 1];
}
console.log(`${principal} ${secondary}`);
}
, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a matrix of size N*N, your task is to find the sum of the primary and secondary diagonal of the matrix.
For Matrix:-
M<sub>00</sub> M<sub>01</sub> M<sub>02</sub>
M<sub>10</sub> M<sub>11</sub> M<sub>12</sub>
M<sub>20</sub> M<sub>21</sub> M<sub>22</sub>
Primary diagonal:- M<sub>00</sub> M<sub>11</sub> M<sub>22</sub>
Secondary diagonal:- M<sub>02</sub> M<sub>11</sub> M<sub>20</sub>The first line of input contains a single integer N, The next N lines of input contains N space-separated integers depicting the values of the matrix.
Constraints:-
1 <= N <= 500
1 <= Matrix[][] <= 100000Print the sum of primary and secondary diagonal separated by a space.Sample Input:-
2
1 4
2 6
Sample Output:-
7 6
Sample Input:-
3
1 4 2
1 5 7
3 8 1
Sample Output:-
7 10, I have written this Solution Code: n = int(input())
sum1 = 0
sum2 = 0
for i in range(n):
a = [int(j) for j in input().split()]
sum1 = sum1+a[i]
sum2 = sum2+a[n-1-i]
print(sum1,sum2), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: For a number N we have N! unique permutations. <b>A permutation is a sequence of integers from 1 to N of length N containing each number exactly once.</b>
For a positive integer X, <b>X! = 1 * 2 * 3 *...* X-1 * X</b>
Your task is to find the Kth smallest permutation when all possible permutations of size N are arranged in sorted order.Input contains only two integers, the value of N and K.
Constraints:-
1 <= N <= 10000
1 <= K <= min(N!,100000000)Print the Kth permutation in form of a string. i. e don't print spaces between two numbers.Sample Input:-
3 5
Sample Output:-
312
Explanation:-
All permutations of length 3 are:-
123
132
213
231
312
321
Sample Input:-
11 2
Sample Output:-
1234567891110, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s[]=br.readLine().split(" ");
int n=Integer.parseInt(s[0]);
int k=Integer.parseInt(s[1]);
Main m=new Main();
System.out.print(m.getPermutation(n,k));
}
public String getPermutation(int n, int k) {
int idx = 1;
for ( idx = 1; idx <= n;idx++) {
if (fact(idx) >= k) break;
}
StringBuilder ans = new StringBuilder();
for( int i = 1; i <=n-idx;i++) {
ans.append(i);
}
ArrayList<Integer> dat = new ArrayList<>(n);
for( int i = 1; i <= idx;i++) {
dat.add(i);
}
for( int i = 1; i <= idx;i++) {
int t = (int) ((k-1)/fact(idx-i));
ans.append(dat.get(t)+(n-idx));
dat.remove(t);
k = (int)(k-t*(fact(idx-i)));
}
return ans.toString();
}
public String getPermutation0(int n, int k) {
int idx = k;
StringBuilder ans = new StringBuilder();
ArrayList<Integer> dat = new ArrayList<>(n);
for( int i = 1; i <= n;i++) {
dat.add(i);
}
for(int i = 1; i <= n;i++) {
idx = (int)((k-1)/fact(n-i));
ans.append(dat.get(idx));
dat.remove(idx);
k = (int)(k - idx*fact(n-i));
}
return ans.toString();
}
public long fact(int n) {
int f = 1;
for( int i = 1; i <= n;i++) {
f *= i;
}
return f;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: For a number N we have N! unique permutations. <b>A permutation is a sequence of integers from 1 to N of length N containing each number exactly once.</b>
For a positive integer X, <b>X! = 1 * 2 * 3 *...* X-1 * X</b>
Your task is to find the Kth smallest permutation when all possible permutations of size N are arranged in sorted order.Input contains only two integers, the value of N and K.
Constraints:-
1 <= N <= 10000
1 <= K <= min(N!,100000000)Print the Kth permutation in form of a string. i. e don't print spaces between two numbers.Sample Input:-
3 5
Sample Output:-
312
Explanation:-
All permutations of length 3 are:-
123
132
213
231
312
321
Sample Input:-
11 2
Sample Output:-
1234567891110, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int factorial(int n) {
if (n > 12) {
// this overflows in int. So, its definitely greater than k
// which is all we care about. So, we return INT_MAX which
// is also greater than k.
return INT_MAX;
}
// Can also store these values. But this is just < 12 iteration, so meh!
int fact = 1;
for (int i = 2; i <= n; i++) fact *= i;
return fact;
}
string getPermutationi(int k, vector<int> &candidateSet) {
int n = candidateSet.size();
if (n == 0) {
return "";
}
if (k > factorial(n)) return ""; // invalid. Should never reach here.
int f = factorial(n - 1);
int pos = k / f;
k %= f;
string ch = to_string(candidateSet[pos]);
// now remove the character ch from candidateSet.
candidateSet.erase(candidateSet.begin() + pos);
return ch + getPermutationi(k, candidateSet);
}
string solve(int n, int k) {
vector<int> candidateSet;
for (int i = 1; i <= n; i++) candidateSet.push_back(i);
return getPermutationi(k - 1, candidateSet);
}
int main(){
int n,k;
cin>>n>>k;
cout<<solve(n,k);
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array arr[] of N integers arranged in a circular fashion. Your task is to find the maximum contiguous subarray sum containing at least 1 element.The first line of input contains a single integer T which denotes the number of test cases. The first line of each test case contains a single integer N which denotes the total number of elements. The second line of each test case contains N space-separated integers denoting the elements of the array.
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^5
-10^6 <= Arr[i] <= 10^6
The Sum of N over all test cases is less than equal to 10^6.For each test case print the maximum sum obtained by adding the consecutive elements.<b>Input:</b>
4
7
8 -8 9 -9 10 -11 12
8
10 -3 -4 7 6 5 -4 -1
8
-1 40 -14 7 6 5 -4 -1
4
-1 -2 -3 -4
<b>Output:</b>
22
23
52
-1
Explanation:
Testcase 1: Starting from the last element of the array, i.e, 12, and moving in a circular fashion, we have max subarray as 12, 8, -8, 9, -9, 10, which gives the maximum sum as 22., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}
public static long maxSubarraySumCircular(long[] array) {
long currentSum = 0, maxSum = Long.MIN_VALUE;
for(int i = 0; i < array.length; i++) {
currentSum = Math.max(currentSum + array[i], array[i]);
maxSum = Math.max(maxSum, currentSum);
}
if(maxSum < 0) return maxSum;
currentSum = 0;
long minSum = Long.MAX_VALUE;
for(int i = 0; i < array.length; i++) {
currentSum = Math.min(currentSum + array[i], array[i]);
minSum = Math.min(minSum, currentSum);
}
long totalSum = 0;
for(long element : array) totalSum += element;
return Math.max(maxSum, totalSum - minSum);
}
public static void main (String[] args) {
FastReader sc = new FastReader();
int t = sc.nextInt();
while(t-->0){
int n = sc.nextInt();
long a[] = new long[n];
long sum = 0l;
for(int i=0;i<n;i++){
a[i] = sc.nextLong();
}
System.out.println(maxSubarraySumCircular(a));
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array arr[] of N integers arranged in a circular fashion. Your task is to find the maximum contiguous subarray sum containing at least 1 element.The first line of input contains a single integer T which denotes the number of test cases. The first line of each test case contains a single integer N which denotes the total number of elements. The second line of each test case contains N space-separated integers denoting the elements of the array.
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^5
-10^6 <= Arr[i] <= 10^6
The Sum of N over all test cases is less than equal to 10^6.For each test case print the maximum sum obtained by adding the consecutive elements.<b>Input:</b>
4
7
8 -8 9 -9 10 -11 12
8
10 -3 -4 7 6 5 -4 -1
8
-1 40 -14 7 6 5 -4 -1
4
-1 -2 -3 -4
<b>Output:</b>
22
23
52
-1
Explanation:
Testcase 1: Starting from the last element of the array, i.e, 12, and moving in a circular fashion, we have max subarray as 12, 8, -8, 9, -9, 10, which gives the maximum sum as 22., I have written this Solution Code: def kadane(a):
Max = a[0]
temp = Max
for i in range(1,len(a)):
temp += a[i]
if temp < a[i]:
temp = a[i]
Max = max(Max,temp)
return Max
def maxCircularSum(a):
n = len(a)
max_kadane = kadane(a)
neg_a = [-1*x for x in a]
max_neg_kadane = kadane(neg_a)
max_wrap = -(sum(neg_a)-max_neg_kadane)
res = max(max_wrap,max_kadane)
return res if res != 0 else max_kadane
for _ in range(int(input())):
s=int(input())
a=list(map(int,input().split()))
print(maxCircularSum(a)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array arr[] of N integers arranged in a circular fashion. Your task is to find the maximum contiguous subarray sum containing at least 1 element.The first line of input contains a single integer T which denotes the number of test cases. The first line of each test case contains a single integer N which denotes the total number of elements. The second line of each test case contains N space-separated integers denoting the elements of the array.
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^5
-10^6 <= Arr[i] <= 10^6
The Sum of N over all test cases is less than equal to 10^6.For each test case print the maximum sum obtained by adding the consecutive elements.<b>Input:</b>
4
7
8 -8 9 -9 10 -11 12
8
10 -3 -4 7 6 5 -4 -1
8
-1 40 -14 7 6 5 -4 -1
4
-1 -2 -3 -4
<b>Output:</b>
22
23
52
-1
Explanation:
Testcase 1: Starting from the last element of the array, i.e, 12, and moving in a circular fashion, we have max subarray as 12, 8, -8, 9, -9, 10, which gives the maximum sum as 22., I have written this Solution Code:
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define max1 10001
#define MOD 1000000007
#define read(type) readInt<type>()
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int INF = 4557430888798830399ll;
signed main()
{
fast();
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<int> A(n);
FOR(i,n){
cin>>A[i];
}
int maxTillNow = -INF;
int maxEndingHere = -INF;
int start = 0;
while (start < A.size()) {
maxEndingHere = max(maxEndingHere + A[start], (int)A[start]);
maxTillNow = max(maxTillNow, maxEndingHere);
start++;
}
vector<int> prefix(n, 0), suffix(n, 0), maxSuffTill(n, 0);
for (int i = 0; i < n; ++i) {
prefix[i] = A[i];
if (i != 0) prefix[i] += prefix[i - 1];
}
for (int i = n - 1; i >= 0; --i) {
suffix[i] = A[i];
maxSuffTill[i] = max(A[i],(int) 0);
if (i != n - 1) {
suffix[i] += suffix[i + 1];
maxSuffTill[i] = max(suffix[i], maxSuffTill[i + 1]);
}
}
for (int i = 0; i < n; ++i) {
int sum = prefix[i];
if (i != n - 1) sum += maxSuffTill[i + 1];
maxTillNow = max(maxTillNow, sum);
}
out(maxTillNow);
}}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: A polygon is a closed figure with 3 or more sides. Say, we have a class called Polygon.
This class has data attributes to store the number of sides n and magnitude of each side as a list called sides.
The inputSides() method takes in the magnitude of each side
The dispSides() method displays these side lengths
A triangle is a polygon with 3 sides. So, we can create a class called Triangle which inherits from Polygon. This makes all the attributes of Polygon class available to the Triangle class.
However, the Triangle class has a new method findArea() to find and print the area of the triangle.Three IntegersA Decimal ValueInput: 3 5 4
Output : 6.00, I have written this Solution Code: import math
class Polygon:
# Initializing the number of sides
def __init__(self, no_of_sides):
self.n = no_of_sides
self.sides = [0 for i in range(no_of_sides)]
def inputSides(self):
self.sides = [float(input("")) for i in range(self.n)]
# method to display the length of each side of the polygon
def dispSides(self):
for i in range(self.n):
print(self.sides[i])
class Triangle(Polygon):
# Initializing the number of sides of the triangle to 3 by
# calling the __init__ method of the Polygon class
def __init__(self):
Polygon.__init__(self,3)
def findArea(self):
a, b, c = self.sides
# calculate the semi-perimeter
s = (a + b + c) / 2
# Using Heron's formula to calculate the area of the triangle
area = (s*(s-a)*(s-b)*(s-c)) ** 0.5
print(round(area,2))
# Creating an instance of the Triangle class
t = Triangle()
# Prompting the user to enter the sides of the triangle
t.inputSides()
# Calculating and printing the area of the triangle
t.findArea(), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N integers, give the number with maximum frequency. If multiple numbers have maximum frequency print the maximum number among them.The first line of the input contains an integer N, and the Second line contains N space-separated integers of the array.
<b>Constraints:</b>
3 <= N <= 1000
1 <= Arr[i] <= 100The output should contain single integer, the number with maximum frequency.If multiple numbers have maximum frequency print the maximum number among them.Sample Input
5
1 4 2 4 5
Sample Output
4
<b>Explanation:-</b>
4 has max frequency=2, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args)throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
String [] str=br.readLine().trim().split(" ");
int a[]=new int[n];
for(int i=0;i<n;i++){
a[i]=Integer.parseInt(str[i]);
}
Arrays.sort(a);
int size=a[n-1]+1;
int c[]=new int[size];
for(int i=0;i<size;i++) c[i]=0;
for(int i=0;i<n;i++) c[a[i]]++;
int max=0,freq=c[1];
for(int i=2;i<size;i++){
if(freq<=c[i]){
freq=c[i];
max=i;
}
}
System.out.println(max);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N integers, give the number with maximum frequency. If multiple numbers have maximum frequency print the maximum number among them.The first line of the input contains an integer N, and the Second line contains N space-separated integers of the array.
<b>Constraints:</b>
3 <= N <= 1000
1 <= Arr[i] <= 100The output should contain single integer, the number with maximum frequency.If multiple numbers have maximum frequency print the maximum number among them.Sample Input
5
1 4 2 4 5
Sample Output
4
<b>Explanation:-</b>
4 has max frequency=2, I have written this Solution Code: n = int(input())
a = [int(x) for x in input().split()]
freq = {}
for x in a:
if x not in freq:
freq[x] = 1
else:
freq[x] += 1
mx = max(freq.values())
rf = sorted(freq)
for i in range(len(rf) - 1, -1, -1):
if freq[rf[i]] == mx:
print(rf[i])
break, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N integers, give the number with maximum frequency. If multiple numbers have maximum frequency print the maximum number among them.The first line of the input contains an integer N, and the Second line contains N space-separated integers of the array.
<b>Constraints:</b>
3 <= N <= 1000
1 <= Arr[i] <= 100The output should contain single integer, the number with maximum frequency.If multiple numbers have maximum frequency print the maximum number among them.Sample Input
5
1 4 2 4 5
Sample Output
4
<b>Explanation:-</b>
4 has max frequency=2, I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
int a[N];
signed main() {
IOS;
int n; cin >> n;
for(int i = 1; i <= n; i++){
int p; cin >> p;
a[p]++;
}
int mx = 0, id = -1;
for(int i = 1; i <= 100; i++){
if(a[i] >= mx)
mx = a[i], id = i;
}
cout << id;
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a positive integer N. You need to print the sum of the first N natural numbers.The first line of input contains a single integer T, the next T lines contains a single integer N.
Constraints:
1 < = T < = 100
1 < = N < = 100Print the sum of first N natural numbers for each test case in a new line.Sample Input:
2
5
10
Sample Output:
15
55, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args)throws IOException {
BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(br.readLine());
while(t-->0){
int n=Integer.parseInt(br.readLine());
System.out.println(n*(n+1)/2);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a positive integer N. You need to print the sum of the first N natural numbers.The first line of input contains a single integer T, the next T lines contains a single integer N.
Constraints:
1 < = T < = 100
1 < = N < = 100Print the sum of first N natural numbers for each test case in a new line.Sample Input:
2
5
10
Sample Output:
15
55, I have written this Solution Code: for t in range(int(input())):
n = int(input())
print(n*(n+1)//2), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a positive integer N. You need to print the sum of the first N natural numbers.The first line of input contains a single integer T, the next T lines contains a single integer N.
Constraints:
1 < = T < = 100
1 < = N < = 100Print the sum of first N natural numbers for each test case in a new line.Sample Input:
2
5
10
Sample Output:
15
55, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
cout<<(n*(n+1))/2<<endl;
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a binary square matrix of size N*N and an integer K, your task is to print the maximum side of sub square matrix containing at most K 1's.The first line of input contains two integers N and K, Next N lines contain N space-separated integers depicting the values of the matrix.
<b>Constraints:</b>
1 < = N < = 500
1 < = K < = 100000
0 < = Matrix[][] < = 1Print the maximum side.Sample Input:-
3 2
1 1 1
1 0 1
1 1 0
Sample Output:-
2
Explanation:-
0 1
1 0
is the required sub matrix.
Sample Input:-
2 1
1 0
0 1
Sample Output:-
1, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args)throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String ar[] = br.readLine().split(" ");
int n = Integer.parseInt(ar[0]);
int k = Integer.parseInt(ar[1]);
int a[][] = new int[n][n];
int sum=0,one_c=0;
for(int i=0;i<n;i++)
{
String arr[] = br.readLine().split(" ");
sum=0;
for(int j=0;j<n;j++)
{
int value=Integer.parseInt(arr[j]);
if(value==1)
one_c++;
sum=sum+value;
a[i][j]=sum;
}
}
for(int j=0;j<n;j++)
{
sum=0;
for(int i=0;i<n;i++)
{
sum=sum+a[i][j];
a[i][j]=sum;
}
}
if(k>=one_c)
{
System.out.println(n);
}
else {
int ans = 1;
for(int len=1;len<=n;len++)
{
boolean flag= false;
for(int i=len;i<n;i++)
{
for(int j=len;j<n;j++)
{
if(j-i==0)
{
if(a[i][j]<=k)
{
ans = Math.max(ans,ans+1);
flag=true;
break;
}
}
else if(j>i)
{
if(i==ans)
{
if(a[i][j]-a[i][j-ans-1]<=k)
{
ans=Math.max(ans,ans+1);
flag = true;
break;
}
}
else {
if(a[i][j]-a[i][j-ans-1]-a[i-ans-1][j]+a[i-ans-1][j-ans-1] <=k)
{
ans = Math.max(ans,ans+1);
flag=true;
break;
}
}
}
if(i>ans) {
if(j==ans)
{
if(a[i][j]-a[i-ans-1][j]<=k)
{
ans=Math.max(ans,ans+1);
flag = true;
break;
}
}
else {
if(a[i][j]-a[i-ans-1][j]-a[i][j-ans-1]+a[i-ans-1][j-ans-1] <=k)
{
ans = Math.max(ans,ans+1);
flag=true;
break;
}
}
}
}
if(flag==true) break;
}
if(flag==false) break;
}
System.out.println(ans);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a binary square matrix of size N*N and an integer K, your task is to print the maximum side of sub square matrix containing at most K 1's.The first line of input contains two integers N and K, Next N lines contain N space-separated integers depicting the values of the matrix.
<b>Constraints:</b>
1 < = N < = 500
1 < = K < = 100000
0 < = Matrix[][] < = 1Print the maximum side.Sample Input:-
3 2
1 1 1
1 0 1
1 1 0
Sample Output:-
2
Explanation:-
0 1
1 0
is the required sub matrix.
Sample Input:-
2 1
1 0
0 1
Sample Output:-
1, I have written this Solution Code:
// author-Shivam gupta
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define max1 1001
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int a[max1][max1],b[max1][max1];
signed main(){
fast();
int n,k;
cin>>n>>k;
for(int i=0;i<=n;i++){
a[i][0]=0;
a[0][i]=0;
}
FOR(i,n){
FOR(j,n){
cin>>b[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
a[i][j]=a[i][j-1]+b[i-1][j-1];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
a[i][j]=a[i-1][j]+a[i][j];
// out1(a[i][j]);
}
//END;
}
int ans=0;
int cnt=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int l=0;l<=min(n-i,n-j);l++){
cnt=a[i-1][j-1]+a[i+l][j+l]-a[i+l][j-1]-a[i-1][j+l];
if(cnt<=k){
ans=max(ans,l+1);
}
}
}
}
out(ans);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given the first 2 terms A and B of an Arithmetic Series, tell the Nth term of the series.<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>nthAP()</b> that takes the integer A, B, and N as a parameter.
<b>Constraints:</b>
-10^3 <= A <= 10^3
-10^3 <= B <= 10^3
1 <= N <= 10^4Print the Nth term of AP series.Sample Input:
2 3 4
Sample Output:
5
Sample Input:
1 2 10
Sample output:
10, I have written this Solution Code: def nthAP(x, y, z):
res = x + (y-x) * (z-1)
print(res), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an integer A and a floating point number B, upto exactly two decimal places. Compute their product, truncate its fractional part, and print the result as an integer.Since this will be a functional problem, you don't have to take input. You just have to complete the function solve() that takes an integer and a float as arguments.
<b>Constraints</b>
0<=A<=2 x 10<sup>15</sup>
0<=B<sub>i</sub><=10Return the product after truncating the fractional part.Sample Input:
155
2.41
Sample Output:
373
The result is 373.55, after truncating the fractional part, we get 373., I have written this Solution Code: class Solution {
long solve(long a, double b) {
b = b*100 ;
return (a*(long)b)/100 ;
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program to check whether a number is even or odd using switch case.First Line of the input contains the number n.
<b>Constraints</b>
1 <= n <= 1e9If the number is even print "Even" otherwise "Odd"Sample Input :
23
Sample Output :
Odd
Sample Input :
24
Sample Output :
Even, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
try{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t= Integer.parseInt(br.readLine());
if(t%2==0)
System.out.println("Even");
else
System.out.println("Odd");
}
catch (Exception e){
return;
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program to check whether a number is even or odd using switch case.First Line of the input contains the number n.
<b>Constraints</b>
1 <= n <= 1e9If the number is even print "Even" otherwise "Odd"Sample Input :
23
Sample Output :
Odd
Sample Input :
24
Sample Output :
Even, I have written this Solution Code: n = int(input())
if n % 2 == 0:
print("Even")
else:
print("Odd"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program to check whether a number is even or odd using switch case.First Line of the input contains the number n.
<b>Constraints</b>
1 <= n <= 1e9If the number is even print "Even" otherwise "Odd"Sample Input :
23
Sample Output :
Odd
Sample Input :
24
Sample Output :
Even, I have written this Solution Code: #include <stdio.h>
int main()
{
int num;
scanf("%d", &num);
switch(num % 2)
{
case 0:
printf("Even");
break;
/* Else if n%2 == 1 */
case 1:
printf("Odd");
break;
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a singly linked list and an element K, your task is to insert the element at the tail of the linked list.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>addElement()</b> that takes head node and the integer K as a parameter.
Constraints:
1 <=N<= 1000
1 <=K, value<= 1000Return the head of the modified linked listSample Input:-
5 2
1 2 3 4 5
Sample Output:
1 2 3 4 5 2
, I have written this Solution Code: a,b=[int(x) for x in input().split()]
c=[int(x) for x in input().split()]
for i in c:
print(i,end=" ")
print(b), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a singly linked list and an element K, your task is to insert the element at the tail of the linked list.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>addElement()</b> that takes head node and the integer K as a parameter.
Constraints:
1 <=N<= 1000
1 <=K, value<= 1000Return the head of the modified linked listSample Input:-
5 2
1 2 3 4 5
Sample Output:
1 2 3 4 5 2
, I have written this Solution Code: public static Node addElement(Node head,int k) {
Node temp=head;
while(temp.next!=null){
temp=temp.next;}
Node x= new Node(k);
temp.next = x;
return head;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given an integer array nums representing the amount of money in each house, return the maximum amount of money you can rob tonight without alerting the police.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You have to complete the function <b>rob()</b> that takes the array nums as a parameter.
<b>Constraints:</b>
1 ≤ nums.length ≤ 100
0 ≤ nums[i] ≤ 1000Return the maximum amount of money you can rob tonight without alerting the police.Sample Input:
3
2 3 2
Sample Output:
3
<b>Explanation:</b>
You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses., I have written this Solution Code: class Solution {
public int rob(int[] nums) {
int n = nums.length;
if (n == 1) {
return nums[0];
}
return Math.max(robFrom(nums, 0, n - 2), robFrom(nums, 1, n - 1));
}
public int robFrom(int[] nums, int lo, int hi) {
int currMax = 0;
int prevMax = 0;
for (int i = lo; i <= hi; i++) {
int temp = currMax;
currMax = Math.max(currMax, prevMax + nums[i]);
prevMax = temp;
}
return currMax;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Ready for a super simple challenge!
You are given two integers A and B. You will create a line of boys and girls in the following manner:
First A girls, then B boys, then A girls, then B boys, and so on.
You will also be given an integer N. Find the number of girls in the first N people of the row.The first and the only line of input contains 3 integers N, A, B.
Constraints
1 < N, A, B <= 10^18 (1000000000000000000)
A+B <= 10^18Output a singer integer, the number of girls in the first N people in the queue.Sample Input
8 3 4
Sample Output
4
Explanation
The arrangement will look like GGGBBBBG, where G represents girl and B represents boy., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException{
BufferedReader rd = new BufferedReader(new InputStreamReader(System.in));
String[] nab = rd.readLine().split(" ");
long n = Long.parseLong(nab[0]);
long girl = Long.parseLong(nab[1]);
long boy = Long.parseLong(nab[2]);
long total = 0;
if(n>1 && girl>1 && boy>1){
long temp = n/(girl+boy);
total = (girl*temp);
if(n%(girl+boy)<girl)
total+=n%(girl+boy);
else
total+=girl;
System.out.print(total);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Ready for a super simple challenge!
You are given two integers A and B. You will create a line of boys and girls in the following manner:
First A girls, then B boys, then A girls, then B boys, and so on.
You will also be given an integer N. Find the number of girls in the first N people of the row.The first and the only line of input contains 3 integers N, A, B.
Constraints
1 < N, A, B <= 10^18 (1000000000000000000)
A+B <= 10^18Output a singer integer, the number of girls in the first N people in the queue.Sample Input
8 3 4
Sample Output
4
Explanation
The arrangement will look like GGGBBBBG, where G represents girl and B represents boy., I have written this Solution Code: n,a,b=map(int,input().split())
if n%(a+b)== 0:
print(n//(a+b)*a)
else:
k=n-(n//(a+b))*(a+b)
if k >= a:
print((n//(a+b))*a+a)
else:
print((n//(a+b))*a+k), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Ready for a super simple challenge!
You are given two integers A and B. You will create a line of boys and girls in the following manner:
First A girls, then B boys, then A girls, then B boys, and so on.
You will also be given an integer N. Find the number of girls in the first N people of the row.The first and the only line of input contains 3 integers N, A, B.
Constraints
1 < N, A, B <= 10^18 (1000000000000000000)
A+B <= 10^18Output a singer integer, the number of girls in the first N people in the queue.Sample Input
8 3 4
Sample Output
4
Explanation
The arrangement will look like GGGBBBBG, where G represents girl and B represents boy., 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 int long long
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define MOD 1000000007
#define INF 1000000000000000007LL
const int N = 100005;
// it's swapnil07 ;)
#ifdef SWAPNIL07
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define end_routine()
#endif
signed main()
{
fast
int n, a, b; cin>>n>>a>>b;
int x = a+b;
int y = (n/x);
n -= (y*x);
int ans = y*a;
if(n > a)
ans += a;
else
ans += n;
cout<<ans;
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an array Arr of N integers. A subarray is good if the sum of elements of that subarray is greater than or equal to K. Print the length of good subarray of minimum length.First line of input contains N and K.
Second line of input contains N integers representing the elements of the array Arr.
Constraints
1 <= N <= 100000
1 <= Arr[i] <= 100000
1 <= K <= 1000000000000Print the length of good subarray of minimum length.Sample input
5 12
2 3 2 5 5
Sample output
3
Explanation :
Subarray from index 3 to 5 has sum 12 and is therefore good and its length(3) is minimum among all possible good subarray., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main()
{
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
int n;
cin>>n;
int k;
cin>>k;
int a[n+1];
int to=0;
for(int i=1;i<=n;++i)
{
cin>>a[i];
}
int j=1;
int s=0;
int ans=n;
for(int i=1;i<=n;++i)
{
while(s<k&&j<=n)
{
s+=a[j];
++j;
}
if(s>=k)
{
ans=min(ans,j-i);
}
s-=a[i];
}
cout<<ans;
#ifdef ANIKET_GOYAL
// cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an array Arr of N integers. A subarray is good if the sum of elements of that subarray is greater than or equal to K. Print the length of good subarray of minimum length.First line of input contains N and K.
Second line of input contains N integers representing the elements of the array Arr.
Constraints
1 <= N <= 100000
1 <= Arr[i] <= 100000
1 <= K <= 1000000000000Print the length of good subarray of minimum length.Sample input
5 12
2 3 2 5 5
Sample output
3
Explanation :
Subarray from index 3 to 5 has sum 12 and is therefore good and its length(3) is minimum among all possible good subarray., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s[]=br.readLine().split(" ");
int n=Integer.parseInt(s[0]);
long k=Long.parseLong(s[1]);
int a[]=new int[n];
s=br.readLine().split(" ");
for(int i=0;i<n;i++)
{
a[i]=Integer.parseInt(s[i]);
}
int length=Integer.MAX_VALUE,i=0,j=0;
long currSum=0;
for(j=0;j<n;j++)
{
currSum+=a[j];
while(currSum>=k)
{
length=Math.min(length,j-i+1);
currSum-=a[i];
i++;
}
}
System.out.println(length);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given an array Arr of N integers. A subarray is good if the sum of elements of that subarray is greater than or equal to K. Print the length of good subarray of minimum length.First line of input contains N and K.
Second line of input contains N integers representing the elements of the array Arr.
Constraints
1 <= N <= 100000
1 <= Arr[i] <= 100000
1 <= K <= 1000000000000Print the length of good subarray of minimum length.Sample input
5 12
2 3 2 5 5
Sample output
3
Explanation :
Subarray from index 3 to 5 has sum 12 and is therefore good and its length(3) is minimum among all possible good subarray., I have written this Solution Code: def result(arr,n,k):
minnumber = n + 1
start = 0
end = 0
curr_sum = 0
while(end < n):
while(curr_sum < k and end < n):
curr_sum += arr[end]
end += 1
while( curr_sum >= k and start < n):
if (end - start < minnumber):
minnumber = end - start
curr_sum -= arr[start]
start += 1
return minnumber
n = list(map(int, input().split()))
arr = list(map(int, input().split()))
print(result(arr, n[0], n[1])), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program to print a butterfly pattern of row size 2n, where the value of n is given by the user.Integer n represents half the row size of the pattern
<b>User Task:</b>
Since this is a functional problem you don't have to worry about taking input, you just have to complete the function <b>butterflyPattern()</b> and print the output.
<b>Constraint</b>
n<=100
Output is a butterfly pattern in 2n rows.<b>Input</b>
4
<b>Output</b>
<pre>* *
** **
*** ***
********
********
*** ***
** **
* * </Pre>, I have written this Solution Code: class Solution {
public void butterflyPattern(int N) {
for(int i=1;i<=N;i++)
{
for(int j=1 ;j<=i;j++)
{
System.out.print("*");
}
for(int j=1 ;j<=2*(N-i);j++)
{
System.out.print(" ");
}
for(int j=1 ;j<=i;j++)
{
System.out.print("*");
}
System.out.println();
}
for(int i=N;i>0;i--)
{
for(int j=1 ;j<=i;j++)
{
System.out.print("*");
}
for(int j=1 ;j<=2*(N-i);j++)
{
System.out.print(" ");
}
for(int j=1 ;j<=i;j++)
{
System.out.print("*");
}
System.out.println();
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given the first 2 terms A and B of an Arithmetic Series, tell the Nth term of the series.<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>NthAP()</b> that takes the integer A, B, and N as a parameter.
<b>Constraints:</b>
-10<sup>3</sup> ≤ A ≤ 10<sup>3</sup>
-10<sup>3</sup> ≤ B ≤ 10<sup>3</sup>
1 ≤ N ≤ 10<sup>4</sup>Return the Nth term of AP series.Sample Input 1:
2 3 4
Sample Output 1:
5
Sample Input 2:
1 2 10
Sample output 2:
10, I have written this Solution Code: class Solution {
public static int NthAP(int a, int b, int n){
return a+(n-1)*(b-a);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara is trying a new type of game in which she can jump in either the left direction or in the right direction. Also after each jump the range of her jump increases by 1 unit. i.e if starts from 1 in the next jump she has to jump 2 units then 3 units and so on.
Given the number of jumps as N, the range of the first jump to be 1. What will be the minimum distance Sara can be at from the starting point.<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>minDistanceCoveredBySara()</b> that takes integer N as an argument.
Constraints:-
1 <= N <= 1000Return the minimum distance Sara can be at from the starting point.Sample Input:-
3
Sample Output:-
0
Explanation:-
First jump:- right
Second jump:- right
Third jump:- left
Total distance covered = 1+2-3 = 0
Sample Input:-
5
Sample Output:-
1, I have written this Solution Code: int minDistanceCoveredBySara(int N){
if(N%4==1 || N%4==2){return 1;}
return 0;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara is trying a new type of game in which she can jump in either the left direction or in the right direction. Also after each jump the range of her jump increases by 1 unit. i.e if starts from 1 in the next jump she has to jump 2 units then 3 units and so on.
Given the number of jumps as N, the range of the first jump to be 1. What will be the minimum distance Sara can be at from the starting point.<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>minDistanceCoveredBySara()</b> that takes integer N as an argument.
Constraints:-
1 <= N <= 1000Return the minimum distance Sara can be at from the starting point.Sample Input:-
3
Sample Output:-
0
Explanation:-
First jump:- right
Second jump:- right
Third jump:- left
Total distance covered = 1+2-3 = 0
Sample Input:-
5
Sample Output:-
1, I have written this Solution Code: int minDistanceCoveredBySara(int N){
if(N%4==1 || N%4==2){return 1;}
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara is trying a new type of game in which she can jump in either the left direction or in the right direction. Also after each jump the range of her jump increases by 1 unit. i.e if starts from 1 in the next jump she has to jump 2 units then 3 units and so on.
Given the number of jumps as N, the range of the first jump to be 1. What will be the minimum distance Sara can be at from the starting point.<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>minDistanceCoveredBySara()</b> that takes integer N as an argument.
Constraints:-
1 <= N <= 1000Return the minimum distance Sara can be at from the starting point.Sample Input:-
3
Sample Output:-
0
Explanation:-
First jump:- right
Second jump:- right
Third jump:- left
Total distance covered = 1+2-3 = 0
Sample Input:-
5
Sample Output:-
1, I have written this Solution Code: def minDistanceCoveredBySara(N):
if N%4==1 or N%4==2:
return 1
return 0
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Sara is trying a new type of game in which she can jump in either the left direction or in the right direction. Also after each jump the range of her jump increases by 1 unit. i.e if starts from 1 in the next jump she has to jump 2 units then 3 units and so on.
Given the number of jumps as N, the range of the first jump to be 1. What will be the minimum distance Sara can be at from the starting point.<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>minDistanceCoveredBySara()</b> that takes integer N as an argument.
Constraints:-
1 <= N <= 1000Return the minimum distance Sara can be at from the starting point.Sample Input:-
3
Sample Output:-
0
Explanation:-
First jump:- right
Second jump:- right
Third jump:- left
Total distance covered = 1+2-3 = 0
Sample Input:-
5
Sample Output:-
1, I have written this Solution Code: static int minDistanceCoveredBySara(int N){
if(N%4==1 || N%4==2){return 1;}
return 0;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Jane's football team has earned A points so far in her school's sports fest. To qualify for the semi-finals they have to earn at least B points. They have X more games left. For each game, they will earn 2 points for a win and 1 point for a draw and they don't earn any points if they lose. Can Jane's team qualify for the semi-finals?The first line will contain T, the number of test cases. Then the test cases follow. Each test case contains of a single line of input, three integers A, B, X.
<b>Constraints</b>
1 ≤ T ≤ 5000
0 ≤ A, B, X ≤ 1000For each test case, output in one line "Yes" if it is possible for their team to qualify for semi-finals, or "No" if it is not possible to do so.<b>Sample Input</b>
3
4 10 8
3 6 1
4 8 2
<b>Sample Output</b>
Yes
No
Yes
<b>Explanation</b>
Test case 1: The team has scored 4 points and they need 6 more points to qualify, there are 8 games remaining, so if they draw all their 8 games they can qualify hence the answer is yes.
Test case 2: The team has scored 3 points and they need 3 more points to qualify, there is 1 game left if they even win in that game still they can't qualify thereby the answer is no., I have written this Solution Code: import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = 0; i < n; i++) {
int x = sc.nextInt();
int y = sc.nextInt();
int z = sc.nextInt();
//possibilties of qualification
int to_qualify1 = z*2; //if wins
int to_qualify2 = z*1; //if draws
if((x + to_qualify1) >= y || (x + to_qualify2) >=y ) {
System.out.println("Yes");
}
else {
System.out.println("No");
}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Jane's football team has earned A points so far in her school's sports fest. To qualify for the semi-finals they have to earn at least B points. They have X more games left. For each game, they will earn 2 points for a win and 1 point for a draw and they don't earn any points if they lose. Can Jane's team qualify for the semi-finals?The first line will contain T, the number of test cases. Then the test cases follow. Each test case contains of a single line of input, three integers A, B, X.
<b>Constraints</b>
1 ≤ T ≤ 5000
0 ≤ A, B, X ≤ 1000For each test case, output in one line "Yes" if it is possible for their team to qualify for semi-finals, or "No" if it is not possible to do so.<b>Sample Input</b>
3
4 10 8
3 6 1
4 8 2
<b>Sample Output</b>
Yes
No
Yes
<b>Explanation</b>
Test case 1: The team has scored 4 points and they need 6 more points to qualify, there are 8 games remaining, so if they draw all their 8 games they can qualify hence the answer is yes.
Test case 2: The team has scored 3 points and they need 3 more points to qualify, there is 1 game left if they even win in that game still they can't qualify thereby the answer is no., I have written this Solution Code: #include <iostream>
using namespace std;
int main() {
// your code goes here
int t, x, y, z;
std::cin >> t;
while (t--) {
std::cin >> x >> y >> z;
if (x + z * 2 >= y || x + z >= y || x >= y)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers x and y, check if x can be converted to y by adding F(n) to x where F(n){n>=1} is defined as:- 1+3+9+27+81+. .3^n.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Ifpossible()</b> that takes the integer x and y as parameter.
Constraints:-
1<= x < y <= 10^9Return 1 if it is possible to convert x into y else return 0.Sample Input:-
5 7
Sample Output:-
0
Sample Input:-
3 16
Sample Output:-
1
Explanation:-
F(3) = 1 + 3 + 9 = 13
3 + 13 = 16, I have written this Solution Code:
public static int Ifpossible(long x, long y){
long sum=y-x;
long ans=0;
long ch = 1;
while(ans<sum){
ans+=ch;
if(ans==sum){return 1;}
ch*=3;
}
return 0;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers x and y, check if x can be converted to y by adding F(n) to x where F(n){n>=1} is defined as:- 1+3+9+27+81+. .3^n.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Ifpossible()</b> that takes the integer x and y as parameter.
Constraints:-
1<= x < y <= 10^9Return 1 if it is possible to convert x into y else return 0.Sample Input:-
5 7
Sample Output:-
0
Sample Input:-
3 16
Sample Output:-
1
Explanation:-
F(3) = 1 + 3 + 9 = 13
3 + 13 = 16, I have written this Solution Code:
int Ifpossible(long x, long y){
long sum=y-x;
long ans=0;
long ch = 1;
while(ans<sum){
ans+=ch;
if(ans==sum){return 1;break;}
ch*=(long)3;
}
return 0;
}
, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers x and y, check if x can be converted to y by adding F(n) to x where F(n){n>=1} is defined as:- 1+3+9+27+81+. .3^n.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Ifpossible()</b> that takes the integer x and y as parameter.
Constraints:-
1<= x < y <= 10^9Return 1 if it is possible to convert x into y else return 0.Sample Input:-
5 7
Sample Output:-
0
Sample Input:-
3 16
Sample Output:-
1
Explanation:-
F(3) = 1 + 3 + 9 = 13
3 + 13 = 16, I have written this Solution Code:
int Ifpossible(long x, long y){
long sum=y-x;
long ans=0;
long ch = 1;
while(ans<sum){
ans+=ch;
if(ans==sum){return 1;}
ch*=3;
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two integers x and y, check if x can be converted to y by adding F(n) to x where F(n){n>=1} is defined as:- 1+3+9+27+81+. .3^n.<b>User Task:</b>
Since this will be a functional problem, you don't have to take input. You just have to complete the function <b>Ifpossible()</b> that takes the integer x and y as parameter.
Constraints:-
1<= x < y <= 10^9Return 1 if it is possible to convert x into y else return 0.Sample Input:-
5 7
Sample Output:-
0
Sample Input:-
3 16
Sample Output:-
1
Explanation:-
F(3) = 1 + 3 + 9 = 13
3 + 13 = 16, I have written this Solution Code:
def Ifpossible(x,y) :
result = y-x
ans = 0
ch = 1
while ans<result :
ans+=ch
if ans==result:
return 1;
ch*=3
return 0;
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Remove duplicates of an array and return an array of only unique elements.An array containing numbers.Space separated unique elements from the array.Sample Input:-
1 2 3 5 1 5 9 1 2 8
Sample Output:-
1 2 3 5 9 8
<b>Explanation:-</b>
Extra 1, 2, and 5 were removed since they were occurring multiple times.
Note: You only have to remove the extra occurrences i.e. each element in the final array should have a frequency equal to one., I have written this Solution Code: nan, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Remove duplicates of an array and return an array of only unique elements.An array containing numbers.Space separated unique elements from the array.Sample Input:-
1 2 3 5 1 5 9 1 2 8
Sample Output:-
1 2 3 5 9 8
<b>Explanation:-</b>
Extra 1, 2, and 5 were removed since they were occurring multiple times.
Note: You only have to remove the extra occurrences i.e. each element in the final array should have a frequency equal to one., I have written this Solution Code:
inp = eval(input(""))
new_set = []
for i in inp:
if(str(i) not in new_set):
new_set.append(str(i))
print(" ".join(new_set)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find factorial of a given number N.
<b>Note: </b>
The Factorial of a number is the product of an integer and all the integers below it;
e.g. factorial four ( 4! ) is equal to 24 (4*3*2*1).<b>User Task</b>
Since this is a functional problem, you don't have to worry about the input. You just have to complete the function <i>Factorial()</i> which contains the given number N.
<b>Constraints:</b>
1 <= N <= 15
Return the factorial of the given number.Sample Input:-
5
Sample Output:-
120
Sample Input:-
3
Sample Output:-
6, I have written this Solution Code: def factorial(n):
if(n == 1):
return 1
return n * factorial(n-1)
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find factorial of a given number N.
<b>Note: </b>
The Factorial of a number is the product of an integer and all the integers below it;
e.g. factorial four ( 4! ) is equal to 24 (4*3*2*1).<b>User Task</b>
Since this is a functional problem, you don't have to worry about the input. You just have to complete the function <i>Factorial()</i> which contains the given number N.
<b>Constraints:</b>
1 <= N <= 15
Return the factorial of the given number.Sample Input:-
5
Sample Output:-
120
Sample Input:-
3
Sample Output:-
6, I have written this Solution Code: static int Factorial(int N)
{
if(N==0){
return 1;}
return N*Factorial(N-1);
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find factorial of a given number N.
<b>Note: </b>
The Factorial of a number is the product of an integer and all the integers below it;
e.g. factorial four ( 4! ) is equal to 24 (4*3*2*1).<b>User Task</b>
Since this is a functional problem, you don't have to worry about the input. You just have to complete the function <i>Factorial()</i> which contains the given number N.
<b>Constraints:</b>
1 <= N <= 15
Return the factorial of the given number.Sample Input:-
5
Sample Output:-
120
Sample Input:-
3
Sample Output:-
6, I have written this Solution Code: // n is the input number
function factorial(n) {
// write code here
// do not console.log
// return the answer as a number
if (n == 1 ) return 1;
return n * factorial(n-1)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: In this season of love, everyone wants to surprise each other.
You are also super excited and you wish to buy roses of 3 different colors. You always buy roses in order, white, yellow, red.
So if you buy 7 roses, they will be "white, yellow, red, white, yellow, red, white".
You need to find the number of yellow roses that you will buy?The only line of input contains a single integer, N, the number of roses that you will buy.
Constraints
1 <= N <= 1000Output a single integer, the number of yellow roses.Sample Input 1
2
Sample Output 1
1
Sample Input 2
8
Sample Ouput 2
3
Explanation;-
testcase1;- 2 flower will be white,yellow
so number of yellow flower is 1, I have written this Solution Code: n=int(input())
x=n/3
if n%3==2:
x+=1
print(int(x)), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: In this season of love, everyone wants to surprise each other.
You are also super excited and you wish to buy roses of 3 different colors. You always buy roses in order, white, yellow, red.
So if you buy 7 roses, they will be "white, yellow, red, white, yellow, red, white".
You need to find the number of yellow roses that you will buy?The only line of input contains a single integer, N, the number of roses that you will buy.
Constraints
1 <= N <= 1000Output a single integer, the number of yellow roses.Sample Input 1
2
Sample Output 1
1
Sample Input 2
8
Sample Ouput 2
3
Explanation;-
testcase1;- 2 flower will be white,yellow
so number of yellow flower is 1, I have written this Solution Code:
import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int ans = n/3;
if(n%3==2){ans++;}
System.out.print(ans);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: In this season of love, everyone wants to surprise each other.
You are also super excited and you wish to buy roses of 3 different colors. You always buy roses in order, white, yellow, red.
So if you buy 7 roses, they will be "white, yellow, red, white, yellow, red, white".
You need to find the number of yellow roses that you will buy?The only line of input contains a single integer, N, the number of roses that you will buy.
Constraints
1 <= N <= 1000Output a single integer, the number of yellow roses.Sample Input 1
2
Sample Output 1
1
Sample Input 2
8
Sample Ouput 2
3
Explanation;-
testcase1;- 2 flower will be white,yellow
so number of yellow flower is 1, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x=n/3;
if(n%3==2){
x++;}
cout<<x;}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Numbers are awesome, larger numbers are more awesome!
Given an array A of size N, you need to find the maximum sum that can be obtained from the elements of the array (the selected elements need not be contiguous). You may even decide to take no element to get a sum of 0.The first line of the input contains the size of the array.
The next line contains N (white-space separated) integers denoting the elements of the array.
<b>Constraints:</b>
1 ≤ N ≤ 10<sup>4</sup>
-10<sup>7</sup> ≤ A[i] ≤10<sup>7</sup>For each test case, output one integer representing the maximum value of the sum that can be obtained using the various elements of the array.Input 1:
5
1 2 1 -1 1
output 1:
5
input 2:
5
0 0 -1 0 0
output 2:
0
<b>Explanation 1:</b>
In order to maximize the sum among [ 1 2 1 -1 1], we need to only consider [ 1 2 1 1] and neglect the [-1]., I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
signed main() {
IOS;
int n; cin >> n;
int sum = 0;
for(int i = 1; i <= n; i++){
int p; cin >> p;
if(p > 0)
sum += p;
}
cout << sum;
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Numbers are awesome, larger numbers are more awesome!
Given an array A of size N, you need to find the maximum sum that can be obtained from the elements of the array (the selected elements need not be contiguous). You may even decide to take no element to get a sum of 0.The first line of the input contains the size of the array.
The next line contains N (white-space separated) integers denoting the elements of the array.
<b>Constraints:</b>
1 ≤ N ≤ 10<sup>4</sup>
-10<sup>7</sup> ≤ A[i] ≤10<sup>7</sup>For each test case, output one integer representing the maximum value of the sum that can be obtained using the various elements of the array.Input 1:
5
1 2 1 -1 1
output 1:
5
input 2:
5
0 0 -1 0 0
output 2:
0
<b>Explanation 1:</b>
In order to maximize the sum among [ 1 2 1 -1 1], we need to only consider [ 1 2 1 1] and neglect the [-1]., I have written this Solution Code: n=int(input())
li = list(map(int,input().strip().split()))
sum=0
for i in li:
if i>0:
sum+=i
print(sum), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Numbers are awesome, larger numbers are more awesome!
Given an array A of size N, you need to find the maximum sum that can be obtained from the elements of the array (the selected elements need not be contiguous). You may even decide to take no element to get a sum of 0.The first line of the input contains the size of the array.
The next line contains N (white-space separated) integers denoting the elements of the array.
<b>Constraints:</b>
1 ≤ N ≤ 10<sup>4</sup>
-10<sup>7</sup> ≤ A[i] ≤10<sup>7</sup>For each test case, output one integer representing the maximum value of the sum that can be obtained using the various elements of the array.Input 1:
5
1 2 1 -1 1
output 1:
5
input 2:
5
0 0 -1 0 0
output 2:
0
<b>Explanation 1:</b>
In order to maximize the sum among [ 1 2 1 -1 1], we need to only consider [ 1 2 1 1] and neglect the [-1]., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException {
InputStreamReader ir = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(ir);
int n = Integer.parseInt(br.readLine());
String str[] = br.readLine().split(" ");
long arr[] = new long[n];
long sum=0;
for(int i=0;i<n;i++){
arr[i] = Integer.parseInt(str[i]);
if(arr[i]>0){
sum+=arr[i];
}
}
System.out.print(sum);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Abhas likes to play with numbers. He is given integers N and K. Find the number of triples (a, b, c) of positive integers not greater than N such that a+b, b+c, and c+a are all multiples of K. The order of a, b, and c does matter, and some of them can be the same.The input line contains N and K separated by space.
<b>Constraints</b>
1≤N, K≤2×10^5
N and K are integers.Print the number of triples (a, b, c) of positive integers not greater than N such that a+b, b+c, and c+a are all multiples of K.<b>Sample Input 1</b>
3 2
<b>Sample Output 1</b>
9
<b>Sample Input 2</b>
5 3
<b>Sample Output 2</b>
1
<b>Sample Input 3</b>
35897 932
<b>Sample Output 3</b>
114191, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll get(ll x) {
return x*x*x;
}
int main() {
ll n,k,ans=0;
cin>>n>>k;
if (k&1) {
cout<<get(n/k);
}
else {
cout<<get(n/k)+get(2*n/k-n/k);
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer K and an array height[] of size N, where height[i] denotes the height of the ith tree in a forest. The task is to make a cut of height X from the ground such that at max K units wood is collected. Find the minimum value of X
<b>If you make a cut of height X from the ground then every tree with a height greater than X will be reduced to X and the remaining part of the wood can be collected</b>The first line contains two integers N and K.
The next line contains N integers denoting the elements of the array height[]
<b>Constraints</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ arr[i] ≤ 10<sup>5</sup>
1 ≤ K ≤ 10<sup>7</sup>Print a single integer with the value of X.Sample Input:
4 2
1 2 1 2
Sample Output:
1
<b>Explanation:</b>
Make a cut at height 1, the updated array will be {1, 1, 1, 1} and
the collected wood will be {0, 1, 0, 1} i. e. 0 + 1 + 0 + 1 = 2., I have written this Solution Code: import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework
// don't change the name of this class
// you can add inner classes if needed
class Main {
public static void main (String[] args) {
// Your code here
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
int arr[] = new int[n];
for(int i = 0; i < n; i++)
arr[i] = sc.nextInt();
System.out.println(minValue(arr, n, k));
}
static int minValue(int arr[], int N, int k)
{
int l = 0, h = N;
while(l+1 < h){
int m = (l + h) >> 1;
if(f(arr, m, N) <= k)
h = m;
else
l = m;
}
return h;
}
static int f(int a[], int x, int n)
{
int sum = 0;
for(int i = 0; i < n; i++)
sum += Math.max(a[i]-x, 0);
return sum;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer K and an array height[] of size N, where height[i] denotes the height of the ith tree in a forest. The task is to make a cut of height X from the ground such that at max K units wood is collected. Find the minimum value of X
<b>If you make a cut of height X from the ground then every tree with a height greater than X will be reduced to X and the remaining part of the wood can be collected</b>The first line contains two integers N and K.
The next line contains N integers denoting the elements of the array height[]
<b>Constraints</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ arr[i] ≤ 10<sup>5</sup>
1 ≤ K ≤ 10<sup>7</sup>Print a single integer with the value of X.Sample Input:
4 2
1 2 1 2
Sample Output:
1
<b>Explanation:</b>
Make a cut at height 1, the updated array will be {1, 1, 1, 1} and
the collected wood will be {0, 1, 0, 1} i. e. 0 + 1 + 0 + 1 = 2., I have written this Solution Code: def minCut(arr,k):
mini = 1
maxi = k
mid = 0
while mini<=maxi:
mid = mini + int((maxi - mini)/2)
wood = 0
for j in range(n):
if(arr[j]-mid>=0):
wood += arr[j] - mid
if wood == k:
break;
elif wood > k:
mini = mid+1
else:
maxi = mid-1
print(mini)
n,k = list(map(int, input().split()))
arr = list(map(int, input().split()))
minCut(arr,k), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer K and an array height[] of size N, where height[i] denotes the height of the ith tree in a forest. The task is to make a cut of height X from the ground such that at max K units wood is collected. Find the minimum value of X
<b>If you make a cut of height X from the ground then every tree with a height greater than X will be reduced to X and the remaining part of the wood can be collected</b>The first line contains two integers N and K.
The next line contains N integers denoting the elements of the array height[]
<b>Constraints</b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ arr[i] ≤ 10<sup>5</sup>
1 ≤ K ≤ 10<sup>7</sup>Print a single integer with the value of X.Sample Input:
4 2
1 2 1 2
Sample Output:
1
<b>Explanation:</b>
Make a cut at height 1, the updated array will be {1, 1, 1, 1} and
the collected wood will be {0, 1, 0, 1} i. e. 0 + 1 + 0 + 1 = 2., I have written this Solution Code: #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
int a[N], n, k;
int f(int x){
int sum = 0;
for(int i = 1; i <= n; i++)
sum += max(a[i]-x, 0);
return sum;
}
void solve(){
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
int l = 0, h = N;
while(l+1 < h){
int m = (l + h) >> 1;
if(f(m) <= k)
h = m;
else
l = m;
}
cout << h;
}
void testcases(){
int tt = 1;
//cin >> tt;
while(tt--){
solve();
}
}
signed main() {
IOS;
testcases();
return 0;
} , In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array, Arr of N integers. Find the number of non- empty subarrays such that xor of all the elements of that subarray is divisible by 8.First line of input contains a single integer N.
Second line of input contains N integers denoting the elements of Arr.
Constraints:
1 <= N <= 100000
1 <= Arr[i] <= 1000000000Print a single integer, the number of non- empty subarrays such that xor of all the elements of that subarray is divisible by 8.Sample Input
3
6 6 8
Sample Output
3
Explanation:
(1-2) xor = 0
(1-3) xor = 8
(3-3) xor = 8, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static int subCountXor(int arr[], int n)
{
int xorArr[] = new int[8];
Arrays.fill(xorArr, 0);
int cumSum = 0;
for (int i = 0; i < n; i++) {
cumSum ^= arr[i];
xorArr[cumSum % 8]++;
}
int ans = 0;
for (int i = 0; i < 8; i++)
if (xorArr[i] > 1)
ans += (xorArr[i] * (xorArr[i] - 1)) / 2;
ans += xorArr[0];
return ans;
}
public static void main (String[] args)throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(br.readLine());
String str=br.readLine();
String strArr[]=str.split(" ");
int arr[]=new int[n];
for(int i=0;i<n;i++)
arr[i]=Integer.parseInt(strArr[i]);
System.out.println(subCountXor(arr,n));
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array, Arr of N integers. Find the number of non- empty subarrays such that xor of all the elements of that subarray is divisible by 8.First line of input contains a single integer N.
Second line of input contains N integers denoting the elements of Arr.
Constraints:
1 <= N <= 100000
1 <= Arr[i] <= 1000000000Print a single integer, the number of non- empty subarrays such that xor of all the elements of that subarray is divisible by 8.Sample Input
3
6 6 8
Sample Output
3
Explanation:
(1-2) xor = 0
(1-3) xor = 8
(3-3) xor = 8, I have written this Solution Code: #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main()
{
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
int n;
cin>>n;
int m[8]={};
m[0]=1;
int ans=0;
int v=0;
for(int i=0;i<n;++i){
int d;
cin>>d;
d=d%8;
v^=d;
ans+=m[v];
m[v]++;
}
cout<<ans;
#ifdef ANIKET_GOYAL
// cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a one-dimensional sorted array A containing N integers.
You are also given an integer target, find if there exists a pair of elements in the array whose difference is equal to the target.
Approach this problem in O(n).The first line contains a single integer N.
The second line contains N space- separated integer A[i].
The third line contains an integer target.
Constraints
1<=N<=10^5
0<=A[i]<=10^9
0<=target<=10^9Print Yes if pair with given difference exists in our array otherwise print No.Sample Input 1:
5
1 2 7 9 11
5
Sample Output 1:
Yes
Sample Input 2:
5
1 1 8 8 25
0
Sample Output 2:
Yes, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
try{
int n = sc.nextInt();
int arr[] = new int[n];
HashMap<Integer, Integer> map =new HashMap<>();
for(int i=0; i<n; i++){
arr[i]=sc.nextInt();
map.put(arr[i], 1);
}
int target = sc.nextInt();
boolean found = false;
for(int i =0; i<n; i++){
if(map.containsKey(arr[i]+target)){
found=true;
break;
}
}
if(found)
System.out.println("Yes");
else
System.out.println("No");
}
catch(Exception e){
System.out.println("No");
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a one-dimensional sorted array A containing N integers.
You are also given an integer target, find if there exists a pair of elements in the array whose difference is equal to the target.
Approach this problem in O(n).The first line contains a single integer N.
The second line contains N space- separated integer A[i].
The third line contains an integer target.
Constraints
1<=N<=10^5
0<=A[i]<=10^9
0<=target<=10^9Print Yes if pair with given difference exists in our array otherwise print No.Sample Input 1:
5
1 2 7 9 11
5
Sample Output 1:
Yes
Sample Input 2:
5
1 1 8 8 25
0
Sample Output 2:
Yes, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
bool check(vector<int> A,int target,int n) {
int i=0,j=1,x=0;
while(i<=n && j<=n)
{
x=A[j]-A[i];
if(x==target && i!=j)return 1;
else if(x<target)j++;
else i++;
}
return 0;
}
int main() {
int n,target;
cin>>n;
vector<int>arr(n);
for(int i=0;i<n;i++)cin>>arr[i];
cin>>target;
cout<<(check(arr,target,n)==1 ? "Yes" : "No");
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, you need to check whether the given number is <b>Palindrome</b> or not. A number is said to be Palindrome when it reads the same from backward as forward.User task:
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>isPalindrome()</b> which contains N as a parameter.
<b>Constraints:</b>
1 <= N <= 9999You need to return "true" is the number is palindrome otherwise "false".Sample Input:
5
Sample Output:
true
Sample Input:
121
Sample Output:
true, I have written this Solution Code: static boolean isPalindrome(int N)
{
int sum = 0;
int rev = N;
while(N > 0)
{
int digit = N%10;
sum = sum*10+digit;
N = N/10;
}
if(rev == sum)
return true;
else return false;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a number N, you need to check whether the given number is <b>Palindrome</b> or not. A number is said to be Palindrome when it reads the same from backward as forward.User task:
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>isPalindrome()</b> which contains N as a parameter.
<b>Constraints:</b>
1 <= N <= 9999You need to return "true" is the number is palindrome otherwise "false".Sample Input:
5
Sample Output:
true
Sample Input:
121
Sample Output:
true, I have written this Solution Code: def isPalindrome(N):
sum1 = 0
rev = N
while(N > 0):
digit = N%10
sum1 = sum1*10+digit
N = N//10
if(rev == sum1):
return True
return False, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given the first 2 terms A and B of an Arithmetic Series, tell the Nth term of the series.<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>NthAP()</b> that takes the integer A, B, and N as a parameter.
<b>Constraints:</b>
-10<sup>3</sup> ≤ A ≤ 10<sup>3</sup>
-10<sup>3</sup> ≤ B ≤ 10<sup>3</sup>
1 ≤ N ≤ 10<sup>4</sup>Return the Nth term of AP series.Sample Input 1:
2 3 4
Sample Output 1:
5
Sample Input 2:
1 2 10
Sample output 2:
10, I have written this Solution Code: class Solution {
public static int NthAP(int a, int b, int n){
return a+(n-1)*(b-a);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You think that integers divisible by K are nice. Given L and R (L<=R), find the number of nice integers from L to R (both inclusive).First Line of input contains three integers L R K
Constraints :
0 <= L <= R <= 1000000000000000000(10^18)
1 <= K <= 1000000000000000000(10^18)Output a single integer which is the number of nice integers from L to R (both inclusive).Sample input 1
1 10 2
Sample output 1
5
Sample intput 2
4 5 3
Sample output 2
0
Explanation:-
Required divisors = 2 4 6 8 10, 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().split(" ");
long l=Long.parseLong(str[0]);
long r=Long.parseLong(str[1]);
long k=Long.parseLong(str[2]);
long count=(r/k)-((l-1)/k);
System.out.print(count);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You think that integers divisible by K are nice. Given L and R (L<=R), find the number of nice integers from L to R (both inclusive).First Line of input contains three integers L R K
Constraints :
0 <= L <= R <= 1000000000000000000(10^18)
1 <= K <= 1000000000000000000(10^18)Output a single integer which is the number of nice integers from L to R (both inclusive).Sample input 1
1 10 2
Sample output 1
5
Sample intput 2
4 5 3
Sample output 2
0
Explanation:-
Required divisors = 2 4 6 8 10, I have written this Solution Code: l,r,k=[int(x)for x in input().split()]
print(r//k - (l-1)//k), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You think that integers divisible by K are nice. Given L and R (L<=R), find the number of nice integers from L to R (both inclusive).First Line of input contains three integers L R K
Constraints :
0 <= L <= R <= 1000000000000000000(10^18)
1 <= K <= 1000000000000000000(10^18)Output a single integer which is the number of nice integers from L to R (both inclusive).Sample input 1
1 10 2
Sample output 1
5
Sample intput 2
4 5 3
Sample output 2
0
Explanation:-
Required divisors = 2 4 6 8 10, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
unsigned long long x,l,r,k;
cin>>l>>r>>k;
x=l/k;
if(l%k==0){x--;}
cout<<r/k-x;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Negi is fascinated with the binary representation of the number. Tell him the number of set bits (ones) in the binary representation of an integer N.The first line of the input contains single integer N.
Constraints
1 <= N <= 1000000000000The output should contain a single integer, the number of set bits (ones) in the binary representation of an integer N.Sample Input
7
Sample Output
3
Sample Input
16
Sample Output
1, 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));
long n = Long.parseLong(br.readLine());
int count = 0;
try{
while (n > 0) {
count += n & 1;
n >>= 1;
}
}catch(Exception e){
return ;
}
System.out.println(count);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Negi is fascinated with the binary representation of the number. Tell him the number of set bits (ones) in the binary representation of an integer N.The first line of the input contains single integer N.
Constraints
1 <= N <= 1000000000000The output should contain a single integer, the number of set bits (ones) in the binary representation of an integer N.Sample Input
7
Sample Output
3
Sample Input
16
Sample Output
1, I have written this Solution Code: a=int(input())
l=bin(a)
print(l.count('1')), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Negi is fascinated with the binary representation of the number. Tell him the number of set bits (ones) in the binary representation of an integer N.The first line of the input contains single integer N.
Constraints
1 <= N <= 1000000000000The output should contain a single integer, the number of set bits (ones) in the binary representation of an integer N.Sample Input
7
Sample Output
3
Sample Input
16
Sample Output
1, 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
#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()
{
int n;
cin>>n;
int cnt=0;
while(n>0)
{
int p=n%2LL;
cnt+=p;
n/=2LL;
}
cout<<cnt<<endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |