Instruction
stringlengths 261
35k
| Response
stringclasses 1
value |
|---|---|
For this Question: Given two positive integers N and M. Your task is to print first <b>M Special GCD numbers</b> which are greater than N.
<b>M Special GCD numbers</b> : First M numbers which are greater than N and whose GCD with N is equal to the smallest prime factor of N.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>printM_SpecialGCD()</b>, where you will get N and M as a parameter.
Constraints:
2 <= N <= 10^6
1 <= M <= 10^5Print the required answers separated by space.Sample Input:-
10 2
Sample Output:-
12 14
Explanation:-least prime divisor of 10 is 2.
Numbers greater than 10 whose gcd with 10 is equal to 2 are :- 12 14 16 18 22 . . . .
First two numbers of this series are:- 12 and 14
Sample Input:-
9 3
Sample Output:-
12 15 21, I have written this Solution Code:
int gcd(int a,int b){
int temp = 0;
while (b != 0) {
temp = b;
b = a % b;
a = temp;
}
return a;
}
int primeFactors(int n)
{
int m=0;
// Print the number of 2s that divide n
if (n%2==0)
{
m= 2;
return m;
}
for (int i = 3; i <= sqrt(n); i+= 2)
{
// While i divides n, print i and divide n
if (n%i == 0)
{
m=i;
return m;
}
}
if(n>2) {
m=n;
}
return m;
}
void printM_SpecialGCD(int N, int M)
{
int prime = primeFactors(N);
int count =0;
int i=prime;
while(count!=M){
int res = gcd(N,N+i);
if(res==prime){
cout<<N+i<<" ";
count++;
}
i+=prime;
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two positive integers N and M. Your task is to print first <b>M Special GCD numbers</b> which are greater than N.
<b>M Special GCD numbers</b> : First M numbers which are greater than N and whose GCD with N is equal to the smallest prime factor of N.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>printM_SpecialGCD()</b>, where you will get N and M as a parameter.
Constraints:
2 <= N <= 10^6
1 <= M <= 10^5Print the required answers separated by space.Sample Input:-
10 2
Sample Output:-
12 14
Explanation:-least prime divisor of 10 is 2.
Numbers greater than 10 whose gcd with 10 is equal to 2 are :- 12 14 16 18 22 . . . .
First two numbers of this series are:- 12 and 14
Sample Input:-
9 3
Sample Output:-
12 15 21, I have written this Solution Code:
static void printM_SpecialGCD(int N, int M)
{
int prime = primeFactors(N);
int count =0;
int i=prime;
while(count!=M){
int res = gcd(N,N+i);
if(res==prime){
System.out.print(N+i + " ");
count++;
}
i+=prime;
}
}
public static int primeFactors(int n)
{
int m=0;
// Print the number of 2s that divide n
if (n%2==0)
{
m= 2;
return m;
}
for (int i = 3; i <= Math.sqrt(n); i+= 2)
{
// While i divides n, print i and divide n
if (n%i == 0)
{
m=i;
return m;
}
}
if(n>2) {
m=n;
}
return m;
}
public static int gcd(int a,int b){
int temp = 0;
while (b != 0) {
temp = b;
b = a % b;
a = temp;
}
return a;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two positive integers N and M. Your task is to print first <b>M Special GCD numbers</b> which are greater than N.
<b>M Special GCD numbers</b> : First M numbers which are greater than N and whose GCD with N is equal to the smallest prime factor of N.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>printM_SpecialGCD()</b>, where you will get N and M as a parameter.
Constraints:
2 <= N <= 10^6
1 <= M <= 10^5Print the required answers separated by space.Sample Input:-
10 2
Sample Output:-
12 14
Explanation:-least prime divisor of 10 is 2.
Numbers greater than 10 whose gcd with 10 is equal to 2 are :- 12 14 16 18 22 . . . .
First two numbers of this series are:- 12 and 14
Sample Input:-
9 3
Sample Output:-
12 15 21, I have written this Solution Code: int gcd(int a,int b){
int temp = 0;
while (b != 0) {
temp = b;
b = a % b;
a = temp;
}
return a;
}
int primeFactors(int n)
{
int m=0;
// Print the number of 2s that divide n
if (n%2==0)
{
m= 2;
return m;
}
int c =sqrt(n);
for (int i = 3; i <= c; i+= 2)
{
// While i divides n, print i and divide n
if (n%i == 0)
{
m=i;
return m;
}
}
if(n>2) {
m=n;
}
return m;
}
void printM_SpecialGCD(int N, int M)
{
int prime = primeFactors(N);
int count =0;
int i=prime;
while(count!=M){
int res = gcd(N,N+i);
if(res==prime){
printf("%d ",N+i);
count++;
}
i+=prime;
}
}, In this Programming Language: C, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find the number of prime numbers before N (Including that number too).The first line of the input contains the number of test cases T.
Next T lines contain the value N.
<b>Constraints</b>
1 <= T <= 1e5
1 <= N <= 1e5Print the number of primes number before that number.Sample Input 1:
2
3
11
Sample Output 1:
2
5, I have written this Solution Code: import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
class Main
{
static int [] booleanArray(int num)
{
boolean [] bool = new boolean[num+1];
int [] count = new int [num+1];
bool[0] = true;
bool[1] = true;
for(int i=2; i*i<=num; i++)
{
if(bool[i]==false)
{
for(int j=i*i; j<=num; j+=i)
bool[j] = true;
}
}
int counter = 0;
for(int i=1; i<=num; i++)
{
if(bool[i]==false)
{
counter = counter+1;
count[i] = counter;
}
else
{
count[i] = counter;
}
}
return count;
}
public static void main (String[] args) throws IOException {
InputStreamReader ak = new InputStreamReader(System.in);
BufferedReader hk = new BufferedReader(ak);
int[] v = booleanArray(100000);
int t = Integer.parseInt(hk.readLine());
for (int i = 1; i <= t; i++) {
int a = Integer.parseInt(hk.readLine());
System.out.println(v[a]);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find the number of prime numbers before N (Including that number too).The first line of the input contains the number of test cases T.
Next T lines contain the value N.
<b>Constraints</b>
1 <= T <= 1e5
1 <= N <= 1e5Print the number of primes number before that number.Sample Input 1:
2
3
11
Sample Output 1:
2
5, I have written this Solution Code: m=100001
prime=[True for i in range(m)]
p=2
while(p*p<=m):
if prime[p]:
for i in range(p*p,m,p):
prime[i]=False
p+=1
c=[0 for i in range(m)]
c[2]=1
for i in range(3,m):
if prime[i]:
c[i]=c[i-1]+1
else:
c[i]=c[i-1]
t=int(input())
while t>0:
n=int(input())
print(c[n])
t-=1, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Find the number of prime numbers before N (Including that number too).The first line of the input contains the number of test cases T.
Next T lines contain the value N.
<b>Constraints</b>
1 <= T <= 1e5
1 <= N <= 1e5Print the number of primes number before that number.Sample Input 1:
2
3
11
Sample Output 1:
2
5, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif
vector<bool> sieve(int n) {
vector<bool> is_prime(n + 1, true);
is_prime[0] = is_prime[1] = false;
for (int i = 2; i * i <= n; i++) {
if (is_prime[i]) {
for (int j = i * i; j <= n; j += i)
is_prime[j] = false;
}
}
return is_prime;
}
int main() {
vector<bool> prime = sieve(1e5 + 1);
vector<int> prefix(1e5 + 1, 0);
for (int i = 1; i <= 1e5; i++) {
if (prime[i]) {
prefix[i] = prefix[i - 1] + 1;
} else {
prefix[i] = prefix[i - 1];
}
}
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
cout << prefix[n] << "\n";
}
return 0;
}, In this Programming Language: C++, 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: Andrew is now bored with usual prime numbers and decides to find prime numbers which has exactly three factors. He sits back and keeps on thinking random numbers, and asks you to tell him if the number he has chosen had exactly 3 factors. Now he has given <b>N</b> random numbers, you need to tell him "<b>Yes</b>" if those numbers had exactly 3 factors otherwise "<b>No</b>".
<b>Note:</b> You can consider the number to be factor of its own.First-line contains N, the number of random numbers he thinks of. Second-line contains the N numbers separated by space.
<b>Constraints:</b>
1 <= N <= 10^5
1 <= numbers <= 10^12Print N lines containing "Yes" or "No".Sample Input 1
3
2 4 6
Sample Output 1
No
Yes
No
Explanation:
2 has 2 factors: 1, 2
4 has 3 factors: 1,2,4
6 has 4 factors: 1,2,3,6
Sample Input 2
3
3 5 7
Sample Output 2
No
No
No, I have written this Solution Code: from math import sqrt
def isPrime(n):
if (n <= 1):
return False
if (n <= 3):
return True
if (n % 2 == 0 or n % 3 == 0):
return False
k= int(sqrt(n))+1
for i in range(5,k,6):
if (n % i == 0 or n % (i + 2) == 0):
return False
return True
def isThreeDisctFactors(n):
sq = int(sqrt(n))
if (1 * sq * sq != n):
return False
if (isPrime(sq)):
return True
else:
return False
N = int(input())
numbers = input().split()
for x in numbers:
if isThreeDisctFactors(int(x)):
print("Yes")
else:
print("No"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Andrew is now bored with usual prime numbers and decides to find prime numbers which has exactly three factors. He sits back and keeps on thinking random numbers, and asks you to tell him if the number he has chosen had exactly 3 factors. Now he has given <b>N</b> random numbers, you need to tell him "<b>Yes</b>" if those numbers had exactly 3 factors otherwise "<b>No</b>".
<b>Note:</b> You can consider the number to be factor of its own.First-line contains N, the number of random numbers he thinks of. Second-line contains the N numbers separated by space.
<b>Constraints:</b>
1 <= N <= 10^5
1 <= numbers <= 10^12Print N lines containing "Yes" or "No".Sample Input 1
3
2 4 6
Sample Output 1
No
Yes
No
Explanation:
2 has 2 factors: 1, 2
4 has 3 factors: 1,2,4
6 has 4 factors: 1,2,3,6
Sample Input 2
3
3 5 7
Sample Output 2
No
No
No, I have written this Solution Code: import java.util.*;
import java.io.*;
import java.lang.*;
class Main
{
static int MAX = 1000005;
static long spf[] = new long[MAX+5];
public static void main (String[] args)throws IOException {
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(read.readLine());
SOF();
String str[] = read.readLine().trim().split(" ");
for(int i = 0; i < N; i++)
{
long x = Long.parseLong(str[i]);
long g = (long)Math.sqrt(x);
if((g*g)!=x)
{
System.out.println("No");
}
else
{
if(spf[(int)g]==g)
{
System.out.println("Yes");
}
else
System.out.println("No");
}
}
}
public static void SOF()
{
spf[1] = 0;
for (int i=2; i<MAX; i++)
// marking smallest prime factor for every
// number to be itself.
spf[i] = i;
// separately marking spf for every even
// number as 2
for (int i=4; i<MAX; i+=2)
spf[i] = 2;
for (int i=3; i*i<MAX; i++)
{
// checking if i is prime
if (spf[i] == i)
{
// marking SPF for all numbers divisitedible by i
for (int j=i*i; j<MAX; j+=i)
// marking spf[j] if it is not
// previously marked
if (spf[j]==j)
spf[j] = i;
}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Andrew is now bored with usual prime numbers and decides to find prime numbers which has exactly three factors. He sits back and keeps on thinking random numbers, and asks you to tell him if the number he has chosen had exactly 3 factors. Now he has given <b>N</b> random numbers, you need to tell him "<b>Yes</b>" if those numbers had exactly 3 factors otherwise "<b>No</b>".
<b>Note:</b> You can consider the number to be factor of its own.First-line contains N, the number of random numbers he thinks of. Second-line contains the N numbers separated by space.
<b>Constraints:</b>
1 <= N <= 10^5
1 <= numbers <= 10^12Print N lines containing "Yes" or "No".Sample Input 1
3
2 4 6
Sample Output 1
No
Yes
No
Explanation:
2 has 2 factors: 1, 2
4 has 3 factors: 1,2,4
6 has 4 factors: 1,2,3,6
Sample Input 2
3
3 5 7
Sample Output 2
No
No
No, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define max1 1000001
bool a[max1];
signed main()
{
string s="abcdefghijklmnopqrstuvwxyz";
for(int i=0;i<=1000000;i++){
a[i]=false;
}
for(int i=2;i<1000000;i++){
if(a[i]==false){
for(int j=i+i;j<=1000000;j+=i){
a[j]=true;
}
}
}
int n;
cin>>n;
long long x;
long long y;
for(int i=0;i<n;i++){
cin>>x;
long long y=sqrt(x);
if(y*y==x){
if(a[y]==false){cout<<"Yes"<<endl;}
else{cout<<"No"<<endl;}
}
else{
cout<<"No"<<endl;
}
}}
, 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: Given four integers a, b, c, and d. Find the value of a<sup>(b<sup>(c<sup>d</sup>)</sup>)</sup> modulo 1000000007.
(Fact: 0<sup>0</sup> = 1)The first and the only line of input contains 4 integers a, b, c, and d.
Constraints
1 <= a, b, c, d <= 12Output a single integer, the answer modulo 1000000007.Sample Input
2 2 2 2
Sample Output
65536
Explanation
2^(2^(2^2)) = 2^(2^4) = 2^16 = 65536.
Sample Input
0 7 11 1
Sample Output
0, I have written this Solution Code: import java.io.*;
import java.util.*;
import java.math.*;
class Main {
public static void main (String[] args)throws IOException {
BufferedReader sc= new BufferedReader(new InputStreamReader(System.in));
int a=0, b=0, c=0, d=0;
long z=0;
String[] str;
str = sc.readLine().split(" ");
a= Integer.parseInt(str[0]);
b= Integer.parseInt(str[1]);
c= Integer.parseInt(str[2]);
d= Integer.parseInt(str[3]);
BigInteger m = new BigInteger("1000000007");
BigInteger n = new BigInteger("1000000006");
BigInteger zero = new BigInteger("0");
BigInteger ans, y;
if(d==0){
z =1;
}else{
z = (long)Math.pow(c, d);
}
if(b==0){
y= zero;
}else{
y = (BigInteger.valueOf(b)).modPow((BigInteger.valueOf(z)), n);
}
if(y == zero){
System.out.println("1");
}else if(a==0){
System.out.println("0");
}else{
ans = (BigInteger.valueOf(a)).modPow(y, m);
System.out.println(ans);
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given four integers a, b, c, and d. Find the value of a<sup>(b<sup>(c<sup>d</sup>)</sup>)</sup> modulo 1000000007.
(Fact: 0<sup>0</sup> = 1)The first and the only line of input contains 4 integers a, b, c, and d.
Constraints
1 <= a, b, c, d <= 12Output a single integer, the answer modulo 1000000007.Sample Input
2 2 2 2
Sample Output
65536
Explanation
2^(2^(2^2)) = 2^(2^4) = 2^16 = 65536.
Sample Input
0 7 11 1
Sample Output
0, I have written this Solution Code: nan, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given four integers a, b, c, and d. Find the value of a<sup>(b<sup>(c<sup>d</sup>)</sup>)</sup> modulo 1000000007.
(Fact: 0<sup>0</sup> = 1)The first and the only line of input contains 4 integers a, b, c, and d.
Constraints
1 <= a, b, c, d <= 12Output a single integer, the answer modulo 1000000007.Sample Input
2 2 2 2
Sample Output
65536
Explanation
2^(2^(2^2)) = 2^(2^4) = 2^16 = 65536.
Sample Input
0 7 11 1
Sample Output
0, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(ll i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long
#define ld long double
#define int long long
#define double long double
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pi 3.141592653589793238
const int MOD = 1e9+7;
const int INF = 1LL<<60;
const int N = 2e5+5;
// it's swapnil07 ;)
#ifdef SWAPNIL07
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#define end_routine() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
#else
#define endl '\n'
#define trace(...)
#define end_routine()
#endif
int powmod(int a, int b, int c = MOD){
int ans = 1;
while(b){
if(b&1){
ans = (ans*a)%c;
}
a = (a*a)%c;
b >>= 1;
}
return ans;
}
void solve(){
int a, b, c, d; cin>>a>>b>>c>>d;
int x = pow(c, d);
int y = powmod(b, x, MOD-1);
int ans = powmod(a, y, MOD);
cout<<ans;
}
signed main()
{
fast
#ifdef SWAPNIL07
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t=1;
// cin>>t;
while(t--){
solve();
cout<<"\n";
}
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N strings, find the longest common prefix among all strings present in the array.The fist line of each test contains a single integer N. Next line has space-separated N strings.
Constraints:-
1 <= N <= 10^3
1 <= |S| <= 10^3
Print the longest common prefix as a string in the given array. If no such prefix exists print "-1"(without quotes).Sample Input:
4
geeksforgeeks geeks geek geezer
Sample Output:
gee
Sampel Input:-
3
a b c
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));
int n = Integer.parseInt(br.readLine());
String[] str = br.readLine().split(" ");
String ref = str[0];
for(String s: str){
if(s.length()<ref.length()){
ref = s;
}
}
for(int i=0; i<n; i++){
if(str[i].contains(ref) == false){
ref = ref.substring(0, ref.length()-1);
}
}
if(ref.length()>0)
System.out.println(ref);
else
System.out.println(-1);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N strings, find the longest common prefix among all strings present in the array.The fist line of each test contains a single integer N. Next line has space-separated N strings.
Constraints:-
1 <= N <= 10^3
1 <= |S| <= 10^3
Print the longest common prefix as a string in the given array. If no such prefix exists print "-1"(without quotes).Sample Input:
4
geeksforgeeks geeks geek geezer
Sample Output:
gee
Sampel Input:-
3
a b c
Sample Output:-
-1, I have written this Solution Code: def longestPrefix( strings ):
size = len(strings)
if (size == 0):
return -1
if (size == 1):
return strings[0]
strings.sort()
end = min(len(strings[0]), len(strings[size - 1]))
i = 0
while (i < end and
strings[0][i] == strings[size - 1][i]):
i += 1
pre = strings[0][0: i]
if len(pre) > 1:
return pre
else:
return -1
N=int(input())
strings=input().split()
print( longestPrefix(strings) ), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N strings, find the longest common prefix among all strings present in the array.The fist line of each test contains a single integer N. Next line has space-separated N strings.
Constraints:-
1 <= N <= 10^3
1 <= |S| <= 10^3
Print the longest common prefix as a string in the given array. If no such prefix exists print "-1"(without quotes).Sample Input:
4
geeksforgeeks geeks geek geezer
Sample Output:
gee
Sampel Input:-
3
a b c
Sample Output:-
-1, I have written this Solution Code: function commonPrefixUtil(str1,str2)
{
let result = "";
let n1 = str1.length, n2 = str2.length;
// Compare str1 and str2
for (let i = 0, j = 0; i <= n1 - 1 && j <= n2 - 1; i++, j++) {
if (str1[i] != str2[j]) {
break;
}
result += str1[i];
}
return (result);
}
// n is number of individual space seperated strings inside strings variable,
// strings is the string which contains space seperated words.
function longestCommonPrefix(strings,n){
// write code here
// do not console,log answer
// return the answer as string
if(n===1) return strings;
const arr= strings.split(" ")
let prefix = arr[0];
for (let i = 1; i <= n - 1; i++) {
prefix = commonPrefixUtil(prefix, arr[i]);
}
if(!prefix) return -1;
return (prefix);
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N strings, find the longest common prefix among all strings present in the array.The fist line of each test contains a single integer N. Next line has space-separated N strings.
Constraints:-
1 <= N <= 10^3
1 <= |S| <= 10^3
Print the longest common prefix as a string in the given array. If no such prefix exists print "-1"(without quotes).Sample Input:
4
geeksforgeeks geeks geek geezer
Sample Output:
gee
Sampel Input:-
3
a b c
Sample Output:-
-1, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
string a[n];
int x=INT_MAX;
for(int i=0;i<n;i++){
cin>>a[i];
x=min(x,(int)a[i].length());
}
string ans="";
for(int i=0;i<x;i++){
for(int j=1;j<n;j++){
if(a[j][i]==a[0][i]){continue;}
goto f;
}
ans+=a[0][i];
}
f:;
if(ans==""){cout<<-1;return 0;}
cout<<(ans);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a binary sorted non-increasing array arr of size <b>N</b>. You need to print the count of <b>1's</b> in the binary array.
Try to solve the problem using binary searchThe input line contains T, denotes the number of testcases.
Each test case contains two lines. The first line contains N (size of binary array). The second line contains N elements of binary array separated by space.
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^6
arr[i] = 0,1
<b>Sum of N over all testcases does not exceed 10^6</b>For each testcase in new line, print the count 1's in binary array.Input:
2
8
1 1 1 1 1 0 0 0
8
1 1 0 0 0 0 0 0
Output:
5
2
Explanation:
Testcase 1: Number of 1's in given binary array : 1 1 1 1 1 0 0 0 is 5.
Testcase 2: Number of 1's in given binary array : 1 1 0 0 0 0 0 0 is 2., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()
{
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public Reader(String file_name) throws IOException
{
din = new DataInputStream(new FileInputStream(file_name));
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public String readLine() throws IOException
{
byte[] buf = new byte[64];
int cnt = 0, c;
while ((c = read()) != -1)
{
if (c == '\n')
break;
buf[cnt++] = (byte) c;
}
return new String(buf, 0, cnt);
}
public int nextInt() throws IOException
{
int ret = 0;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do
{
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
if (neg)
return -ret;
return ret;
}
public long nextLong() throws IOException
{
long ret = 0;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (neg)
return -ret;
return ret;
}
public double nextDouble() throws IOException
{
double ret = 0, div = 1;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (c == '.')
{
while ((c = read()) >= '0' && c <= '9')
{
ret += (c - '0') / (div *= 10);
}
}
if (neg)
return -ret;
return ret;
}
private void fillBuffer() throws IOException
{
bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
if (bytesRead == -1)
buffer[0] = -1;
}
private byte read() throws IOException
{
if (bufferPointer == bytesRead)
fillBuffer();
return buffer[bufferPointer++];
}
public void close() throws IOException
{
if (din == null)
return;
din.close();
}
}
public static void main (String[] args) throws IOException {
Reader sc=new Reader();
int t=sc.nextInt();
while(t-->0){
int n=sc.nextInt();
int[] a=new int[n];
for(int i=0;i<n;i++){
a[i]=sc.nextInt();
}
int count=search(a,0,n-1);
System.out.println(count);
}
}
public static int search(int[] a,int l,int h){
while(l<=h){
int mid=l+(h-l)/2;
if ((mid==h||a[mid+1]==0)&&(a[mid]==1))
return mid+1;
if (a[mid]==1)
l=mid+1;
else h=mid-1;
}
return 0;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a binary sorted non-increasing array arr of size <b>N</b>. You need to print the count of <b>1's</b> in the binary array.
Try to solve the problem using binary searchThe input line contains T, denotes the number of testcases.
Each test case contains two lines. The first line contains N (size of binary array). The second line contains N elements of binary array separated by space.
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^6
arr[i] = 0,1
<b>Sum of N over all testcases does not exceed 10^6</b>For each testcase in new line, print the count 1's in binary array.Input:
2
8
1 1 1 1 1 0 0 0
8
1 1 0 0 0 0 0 0
Output:
5
2
Explanation:
Testcase 1: Number of 1's in given binary array : 1 1 1 1 1 0 0 0 is 5.
Testcase 2: Number of 1's in given binary array : 1 1 0 0 0 0 0 0 is 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 = 1e6 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
int a[N];
signed main() {
IOS;
int t; cin >> t;
while(t--){
int n; cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
int l = 0, h = n+1;
while(l+1 < h){
int m = (l + h) >> 1;
if(a[m] == 1)
l = m;
else
h = m;
}
cout << l << endl;
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a binary sorted non-increasing array arr of size <b>N</b>. You need to print the count of <b>1's</b> in the binary array.
Try to solve the problem using binary searchThe input line contains T, denotes the number of testcases.
Each test case contains two lines. The first line contains N (size of binary array). The second line contains N elements of binary array separated by space.
<b>Constraints:</b>
1 <= T <= 100
1 <= N <= 10^6
arr[i] = 0,1
<b>Sum of N over all testcases does not exceed 10^6</b>For each testcase in new line, print the count 1's in binary array.Input:
2
8
1 1 1 1 1 0 0 0
8
1 1 0 0 0 0 0 0
Output:
5
2
Explanation:
Testcase 1: Number of 1's in given binary array : 1 1 1 1 1 0 0 0 is 5.
Testcase 2: Number of 1's in given binary array : 1 1 0 0 0 0 0 0 is 2., I have written this Solution Code: c=int(input())
for x in range(c):
size=int(input())
s=input()
print(s.count('1')), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of integers A and a number K, find maximum sum of a subarray of size K.The first line of input contains two integers N and K, denoting the number of elements in the array and the subarray size respectively.
The next line contains N integers denoting the elements of the array respectively.
1 <= K <= N <= 200000
-200000 <= A[i] <= 200000Print a single integer denoting the maximum sum of subarray of size K.Sample Input:
4 2
-1 5 2 -3
Sample Output:
7
Explanation:
Three subarrays of size 2, their sum are 4, 7, -1, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner sc=new Scanner(System.in);
String s[]=sc.nextLine().split(" ");
int n=Integer.parseInt(s[0]);
int k=Integer.parseInt(s[1]);
s=sc.nextLine().split(" ");
int ar[]=new int[n];
for(int i=0;i<n;i++){
ar[i]=Integer.parseInt(s[i]);
}
int max=0;
for(int i=0;i<=n-k;i++){
int t=0;
for(int j=0;j<k;j++){
t+=ar[i+j];
}
if(t>max)
max=t;
}
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 integers A and a number K, find maximum sum of a subarray of size K.The first line of input contains two integers N and K, denoting the number of elements in the array and the subarray size respectively.
The next line contains N integers denoting the elements of the array respectively.
1 <= K <= N <= 200000
-200000 <= A[i] <= 200000Print a single integer denoting the maximum sum of subarray of size K.Sample Input:
4 2
-1 5 2 -3
Sample Output:
7
Explanation:
Three subarrays of size 2, their sum are 4, 7, -1, I have written this Solution Code: n1,k1=input().split()
n,k=int(n1),int(k1)
l=list(map(int,input().strip().split()))
curr_sum=0
for x in range(k):
curr_sum=curr_sum+l[x]
max_sum=curr_sum
i=0
j=k
while i<len(l)-k:
curr_sum=curr_sum-l[i]+l[j]
max_sum=max(max_sum,curr_sum)
i+=1
j+=1
print(max_sum), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of integers A and a number K, find maximum sum of a subarray of size K.The first line of input contains two integers N and K, denoting the number of elements in the array and the subarray size respectively.
The next line contains N integers denoting the elements of the array respectively.
1 <= K <= N <= 200000
-200000 <= A[i] <= 200000Print a single integer denoting the maximum sum of subarray of size K.Sample Input:
4 2
-1 5 2 -3
Sample Output:
7
Explanation:
Three subarrays of size 2, their sum are 4, 7, -1, I have written this Solution Code: #include "bits/stdc++.h"
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
int a[N];
void solve(){
int n, k, ans = 0;
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> a[i];
int sum = 0;
for(int i = 1; i <= k; i++)
sum += a[i];
ans = sum;
for(int i = k+1; i <= n; i++){
sum += a[i] - a[i-k];
ans = max(ans, sum);
}
cout << ans;
}
void testcases(){
int tt = 1;
//cin >> tt;
while(tt--){
solve();
}
}
signed main() {
IOS;
clock_t start = clock();
testcases();
cerr << (double)(clock() - start)*1000/CLOCKS_PER_SEC << " ms" << endl;
return 0;
} , In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of N integers and an integer K, your task is to calculate the count of pairs whose sum is divisible by K.The first line of input contains two integers N and K, the next line contains N space-separated integers depicting values of an array.
Constraints:-
1 < = N < = 100000
1 < = Arr[i] <= 100000
1 <= K <= 100000Print the count of required pairs.Sample Input
5 4
1 2 3 4 5
Sample Output
2
Sample Input
5 3
1 2 3 4 5
Sample Output
4
Explanation:-
In Sample 2,
(1 5), (1 2), (2 4), and (4 5) are the required pairs, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static long subarraysDivByK(int[] A, int k)
{
long ans =0 ;
int rem;
int[] freq = new int[k];
for(int i=0;i<A.length;i++)
{
rem = A[i]%k;
ans += freq[(k - rem)% k] ;
freq[rem]++;
}
return ans;
}
public static void main (String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] str = br.readLine().split(" ");
String[] input = br.readLine().split(" ");
int n = Integer.parseInt(str[0]);
int k = Integer.parseInt(str[1]);
int [] a = new int [n];
for(int i=0; i<n; i++)
a[i] = Integer.parseInt(input[i]);
System.out.println(subarraysDivByK(a, k));
}
}, 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 and an integer K, your task is to calculate the count of pairs whose sum is divisible by K.The first line of input contains two integers N and K, the next line contains N space-separated integers depicting values of an array.
Constraints:-
1 < = N < = 100000
1 < = Arr[i] <= 100000
1 <= K <= 100000Print the count of required pairs.Sample Input
5 4
1 2 3 4 5
Sample Output
2
Sample Input
5 3
1 2 3 4 5
Sample Output
4
Explanation:-
In Sample 2,
(1 5), (1 2), (2 4), and (4 5) are the required pairs, I have written this Solution Code: def countKdivPairs(A, n, K):
freq = [0] * K
for i in range(n):
freq[A[i] % K]+= 1
sum = freq[0] * (freq[0] - 1) / 2;
i = 1
while(i <= K//2 and i != (K - i) ):
sum += freq[i] * freq[K-i]
i+= 1
if( K % 2 == 0 ):
sum += (freq[K//2] * (freq[K//2]-1)/2);
return int(sum)
a,b=input().split()
a=int(a)
b=int(b)
arr=input().split()
for i in range(0,a):
arr[i]=int(arr[i])
print (countKdivPairs(arr,a, b)), 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 and an integer K, your task is to calculate the count of pairs whose sum is divisible by K.The first line of input contains two integers N and K, the next line contains N space-separated integers depicting values of an array.
Constraints:-
1 < = N < = 100000
1 < = Arr[i] <= 100000
1 <= K <= 100000Print the count of required pairs.Sample Input
5 4
1 2 3 4 5
Sample Output
2
Sample Input
5 3
1 2 3 4 5
Sample Output
4
Explanation:-
In Sample 2,
(1 5), (1 2), (2 4), and (4 5) are the required pairs, 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 MOD 1000000007
#define read(type) readInt<type>()
#define max1 100001
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
signed main(){
fast();
int n;
cin>>n;
int a;
int k;
cin>>k;
int fre[k];
FOR(i,k){
fre[i]=0;}
FOR(i,n){
cin>>a;
fre[a%k]++;
}
int ans=(fre[0]*(fre[0]-1))/2;
for(int i=1;i<=(k-1)/2;i++){
ans+=fre[i]*fre[k-i];
}
if(k%2==0){
ans+=(fre[k/2]*(fre[k/2]-1))/2;
}
out(ans);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two positive integers N and M. The task is to check whether N is a <b>Special-M-visor</b> or not.
<b>Special-M-visor</b>: A number is called Special-m-visor if it has exactly M even divisors for a given N.<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>checkSpecial_M_Visor()</b>. Where you will get N and M as a parameter.
Constraints:
1 <= N <= 10^6
0 <= M <= 10^6Return "Yes" without quotes if the number N is a <b>Special- M- visor</b> else return "No"Sample Input:-
4 2
Sample Output:-
Yes
Explanation:- 2 and 4 are the only even divisors of 4
Sample Input:-
8 5
Sample Output:-
No, I have written this Solution Code:
def checkSpecial_M_Visor(N,M) :
# Final result of summation of divisors
i=2;
count=0
while i<=N :
if(N%i==0):
count=count+1
i=i+2
if(count == M):
return "Yes"
return "No"
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two positive integers N and M. The task is to check whether N is a <b>Special-M-visor</b> or not.
<b>Special-M-visor</b>: A number is called Special-m-visor if it has exactly M even divisors for a given N.<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>checkSpecial_M_Visor()</b>. Where you will get N and M as a parameter.
Constraints:
1 <= N <= 10^6
0 <= M <= 10^6Return "Yes" without quotes if the number N is a <b>Special- M- visor</b> else return "No"Sample Input:-
4 2
Sample Output:-
Yes
Explanation:- 2 and 4 are the only even divisors of 4
Sample Input:-
8 5
Sample Output:-
No, I have written this Solution Code:
static String checkSpecial_M_Visor(int N, int M)
{
int temp=0;
for(int i = 2; i <=N; i+=2)
{
if(N%i==0)
temp++;
}
if(temp==M)
return "Yes";
else return "No";
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two positive integers N and M. The task is to check whether N is a <b>Special-M-visor</b> or not.
<b>Special-M-visor</b>: A number is called Special-m-visor if it has exactly M even divisors for a given N.<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>checkSpecial_M_Visor()</b>. Where you will get N and M as a parameter.
Constraints:
1 <= N <= 10^6
0 <= M <= 10^6Return "Yes" without quotes if the number N is a <b>Special- M- visor</b> else return "No"Sample Input:-
4 2
Sample Output:-
Yes
Explanation:- 2 and 4 are the only even divisors of 4
Sample Input:-
8 5
Sample Output:-
No, I have written this Solution Code:
string checkSpecial_M_Visor(int N,int M){
int count=0;
for(int i=2;i<=N;i+=2){
if(N%i==0){
count++;
}
}
if(count==M){return "Yes";}
return "No";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given two positive integers N and M. The task is to check whether N is a <b>Special-M-visor</b> or not.
<b>Special-M-visor</b>: A number is called Special-m-visor if it has exactly M even divisors for a given N.<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>checkSpecial_M_Visor()</b>. Where you will get N and M as a parameter.
Constraints:
1 <= N <= 10^6
0 <= M <= 10^6Return "Yes" without quotes if the number N is a <b>Special- M- visor</b> else return "No"Sample Input:-
4 2
Sample Output:-
Yes
Explanation:- 2 and 4 are the only even divisors of 4
Sample Input:-
8 5
Sample Output:-
No, I have written this Solution Code: const char* checkSpecial_M_Visor(int N,int M){
int count=0;
for(int i=2;i<=N;i+=2){
if(N%i==0){
count++;
}
}
char* ans;
if(count==M){return "Yes";}
return "No";
}
, 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: Given three integers your task is to calculate the maximum integer among the given integers.<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>maxInteger()</b> that takes three integers a, b and c as a parameter.
<b>Constraint:</b>
1<=integers<=10000Print the maximum integer among the given integers.Sample Input:-
2 6 3
Sample Output:-
6
Sample Input:-
48 100 100
Sample Output:
100, I have written this Solution Code: def maxIntegers(x, y, z):
if(x >= y and x >= z):
print(x)
elif(y >= z and y >= x):
print(y)
else:
print(z), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: <b><em>Array List In Java</em></b>
There is a list, having n integers that may have duplicates, is given. Print all unique elements in sorted order.There is an integer n is given in first line of input.
In Second line, n space separated integers are given.
<b>Constraints</b>
1 <= n <= 10<sup>4</sup>Print all unique elements in sorted order.Sample Input:
7
1 2 4 3 5 4 3
Sample Output:
1 2 3 4 5, I have written this Solution Code: // Java program for the above approach
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
public class Main {
public static void main(String[] args)
{
TreeSet<Integer> st=new TreeSet<>();
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
for(int i=0;i<n;i++){
int a=sc.nextInt();
st.add(a);
}
for(Integer x:st){
System.out.print(x);
System.out.print(" ");
}
System.out.println("");
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: 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 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 an array of positive element having size N and an integer C. Check if there exists a pair (A,B) such that A xor B = C.First line of input contains number of testcases T.
The First line of each testcase contains two integers N and C.
The 2nd line of each testcase, contains N space separated integers denoting the elements of the array A.
Constraints:
1 <= T <= 50
1 <= N <= 10000
1 <= C <= 10000
0 <= arr[i] <= 10000Print "Yes" is the pair exists else print "No" without quotes.(Change line after every answer).Input:
2
7 7
2 1 10 3 4 9 5
5 1
9 9 10 10 3
Output:
Yes
No
Explanation :
In first case, pair (2,5) give 7. Hence answer is "Yes". In second case no pair exist such that satisfies the condition hance the answer is "No"., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while (t>0){
boolean flag = false;
int n = sc.nextInt();
int c = sc.nextInt();
HashMap<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < n; i++){
int num = sc.nextInt();
int required_num = c^num;
if (map.containsKey(required_num)){
System.out.println("Yes");
sc.nextLine();
flag = true;
break;
}
map.put(num, i);
}
if (flag == false){
System.out.println("No");
}
t--;
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of positive element having size N and an integer C. Check if there exists a pair (A,B) such that A xor B = C.First line of input contains number of testcases T.
The First line of each testcase contains two integers N and C.
The 2nd line of each testcase, contains N space separated integers denoting the elements of the array A.
Constraints:
1 <= T <= 50
1 <= N <= 10000
1 <= C <= 10000
0 <= arr[i] <= 10000Print "Yes" is the pair exists else print "No" without quotes.(Change line after every answer).Input:
2
7 7
2 1 10 3 4 9 5
5 1
9 9 10 10 3
Output:
Yes
No
Explanation :
In first case, pair (2,5) give 7. Hence answer is "Yes". In second case no pair exist such that satisfies the condition hance the answer is "No"., I have written this Solution Code: def xorPair(N,C,array):
from itertools import combinations
for i in combinations(array,r=2):
if i[0]^i[1]==C :
return "Yes"
return "No"
test_case = int(input())
while test_case>0:
N,C = list(map(int,input().split()))
print(xorPair(N,C,list(map(int,input().split()))))
test_case -=1, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of positive element having size N and an integer C. Check if there exists a pair (A,B) such that A xor B = C.First line of input contains number of testcases T.
The First line of each testcase contains two integers N and C.
The 2nd line of each testcase, contains N space separated integers denoting the elements of the array A.
Constraints:
1 <= T <= 50
1 <= N <= 10000
1 <= C <= 10000
0 <= arr[i] <= 10000Print "Yes" is the pair exists else print "No" without quotes.(Change line after every answer).Input:
2
7 7
2 1 10 3 4 9 5
5 1
9 9 10 10 3
Output:
Yes
No
Explanation :
In first case, pair (2,5) give 7. Hence answer is "Yes". In second case no pair exist such that satisfies the condition hance the answer is "No"., 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
signed main()
{
int t;
cin>>t;
while(t>0)
{
t--;
int n,C;
cin>>n>>C;
set<int> ss;
int ch=0;
for(int i=0;i<n;i++)
{
int a;
cin>>a;
int p=a^C;
if(ss.find(p)!=ss.end()) ch=1;
ss.insert(a);
}
if(ch==1) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You need to make an order counter to keep track of the total number of orders received.
Complete the function <code> generateOrder() </code> which returns a <code>function func()</code>. This function <code>func</code> should maintain a <code> count (initially 0)</code>. Every time <code>func</code> is called, <code> count</code> must be incremented by 1 and the string <code>"Total orders = " + count</code> must be returned.
<b>Note:</b> The function generateOrder() will be called internally. You do not need to call it yourself. The generateOrder() takes no argument. It is called internally.The generateOrder() function returns a function that returns the string <code>"Total orders = " + count</code>, where <code>count</code> is the number of times the function is called.
const initC = generateOrder(starting);
console.log(initC()) //prints "Total orders = 1"
console.log(initC()) //prints "Total orders = 2"
console.log(initC()) //prints "Total orders = 3"
, I have written this Solution Code: let generateOrder = function() {
let prefix = "Total orders = ";
let count = 0;
let totalOrders = function(){
count++
return prefix + count;
}
return totalOrders;
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a sorted array of N integers a[], and Q queries. For each query, you will be given one element K your task is to print the maximum element from the array which is less than or equal to the given element(Floor), and the minimum element from the array which is greater than or equal to the given element(Ceil).<b>In case of Java only</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>floorAndCeil()</b> that takes the array a[], integer N and integer k as arguments.
<b>Custom Input</b>
The first line of input contains a single integer N. The Second line of input contains N space-separated integers depicting the values of the array. The third line of input contains a single integer Q. The next Q line of input contains a single integer the value of K.
Constraints:-
1 <= N <= 100000
1 <= K, Arr[i] <= 1000000000000
1 <= Q <= 10000In a new line Print two space-separated integers depicting the values of Floor and Ceil of the given number. If the floor or ceil of the element does not exist print -1.Sample Input:-
5
2 5 6 11 15
5
2
4
8
1
16
Sample Output:-
2 2
2 5
6 11
-1 2
15 -1, I have written this Solution Code: n = int(input())
arr = list(map(int,input().split()))
t = int(input())
def findFloor(arr, l, h, x, res):
if(l<=h):
m = l+(h-l)//2
if(arr[m] == x):
return m
if(arr[m] > x):
return findFloor(arr, l, m-1, x, res)
if(arr[m] < x):
res = m
return findFloor(arr, m+1, h, x, res)
else:
return res
def findCeil(arr, l, h, x, res):
if(l<=h):
m = l+(h-l)//2
if(arr[m] == x):
return m
if(arr[m] < x):
return findCeil(arr, m+1, h, x, res)
res = m
return findCeil(arr, l, m-1, x, res)
else:
return res
for _ in range(t):
x = int(input())
f = findFloor(arr, 0, n-1, x, -1)
c = findCeil(arr, 0, n-1, x, -1)
floor = -1
ceil = -1
if(f!=-1):
floor = arr[f]
if(c!=-1):
ceil = arr[c]
print(floor,ceil), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a sorted array of N integers a[], and Q queries. For each query, you will be given one element K your task is to print the maximum element from the array which is less than or equal to the given element(Floor), and the minimum element from the array which is greater than or equal to the given element(Ceil).<b>In case of Java only</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>floorAndCeil()</b> that takes the array a[], integer N and integer k as arguments.
<b>Custom Input</b>
The first line of input contains a single integer N. The Second line of input contains N space-separated integers depicting the values of the array. The third line of input contains a single integer Q. The next Q line of input contains a single integer the value of K.
Constraints:-
1 <= N <= 100000
1 <= K, Arr[i] <= 1000000000000
1 <= Q <= 10000In a new line Print two space-separated integers depicting the values of Floor and Ceil of the given number. If the floor or ceil of the element does not exist print -1.Sample Input:-
5
2 5 6 11 15
5
2
4
8
1
16
Sample Output:-
2 2
2 5
6 11
-1 2
15 -1, I have written this Solution Code: static void floorAndCeil(int a[], int n, int x){
int it = lower(a,n,x);
if(it==0){
if(a[it]==x){
System.out.println(x+" "+x);
}
else{
System.out.println("-1 "+a[it]);
}
}
else if (it==n){
it--;
System.out.println(a[it]+" -1");
}
else{
if(a[it]==x){
System.out.println(x+" "+x);
}
else{
it--;
System.out.println(a[it]+" "+a[it+1]);
}
}
}
static int lower(int a[], int n,int k){
int l=0;
int h=n-1;
int m;
int ans=n;
while(l<=h){
m=l+h;
m/=2;
if(a[m]<k){
l=m+1;
}
else{
h=m-1;
ans=m;
}
}
return ans;
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a sorted array of N integers a[], and Q queries. For each query, you will be given one element K your task is to print the maximum element from the array which is less than or equal to the given element(Floor), and the minimum element from the array which is greater than or equal to the given element(Ceil).<b>In case of Java only</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>floorAndCeil()</b> that takes the array a[], integer N and integer k as arguments.
<b>Custom Input</b>
The first line of input contains a single integer N. The Second line of input contains N space-separated integers depicting the values of the array. The third line of input contains a single integer Q. The next Q line of input contains a single integer the value of K.
Constraints:-
1 <= N <= 100000
1 <= K, Arr[i] <= 1000000000000
1 <= Q <= 10000In a new line Print two space-separated integers depicting the values of Floor and Ceil of the given number. If the floor or ceil of the element does not exist print -1.Sample Input:-
5
2 5 6 11 15
5
2
4
8
1
16
Sample Output:-
2 2
2 5
6 11
-1 2
15 -1, I have written this Solution Code:
#include <bits/stdc++.h>
using namespace std;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define FOR(i,a) for(int i=0;i<a;i++)
#define FOR1(i,j,a) for(int i=j;i<a;i++)
#define EB emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define max1 1001
#define MOD 1000000007
#define read(type) readInt<type>()
#define out(x) cout<<x<<'\n'
#define out1(x) cout<<x<<" "
#define END cout<<'\n'
#define int long long
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
void fast(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
signed main(){
int n;
cin>>n;
vector<int> v;
int x;
FOR(i,n){
cin>>x;
v.EB(x);}
int q;
cin>>q;
while(q--){
cin>>x;
auto it = lower_bound(v.begin(),v.end(),x);
if(it==v.begin()){
if(*it==x){
cout<<x<<" "<<x;
}
else{
cout<<-1<<" "<<*it;
}
}
else if (it==v.end()){
it--;
cout<<*it<<" -1";
}
else{
if(*it==x){
cout<<x<<" "<<x;
}
else{
it--;
cout<<*it<<" ";
it++;
cout<<*it;}
}
END;
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a boolean Matrix of size N*M, A cell of the matrix is called "Good" if it is completely surrounded by the cells containing '1' i.e. each adjacent cell (which shares a common edge) contains '1'. Your task is to find the number of such cells.
See the below example for a better understandingFirst line of input contains two space- separated integers N and M. Next N lines of input contain M space- separated integers depicting the values of the matrix.
Constraints:-
3 <= N, M <= 500
0 <= Matrix[][] <= 1Print the number of good cells.Sample Input:-
3 3
1 1 0
1 1 1
1 1 1
Sample Output:-
1
Explanation:-
Only cell at position 1, 1 is good
Sample Input:-
5 4
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
Sample Output:-
3
Explanation:-
(1, 2), (2, 1) and (3, 2) are good cells, I have written this Solution Code: // mat is the matrix/ 2d array
// n,m are dimensions
function goodCell(mat, n, m) {
// write code here
// do not console.log
// return the answer as a number
let cnt = 0;
for (let i = 1; i < n - 1; i++) {
for (let j = 1; j < m - 1; j++) {
if (mat[i - 1][j] == 1 && mat[i + 1][j] == 1 && mat[i][j - 1] == 1 && mat[i][j + 1] == 1) {
cnt++;
}
}
}
return cnt
}
, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a boolean Matrix of size N*M, A cell of the matrix is called "Good" if it is completely surrounded by the cells containing '1' i.e. each adjacent cell (which shares a common edge) contains '1'. Your task is to find the number of such cells.
See the below example for a better understandingFirst line of input contains two space- separated integers N and M. Next N lines of input contain M space- separated integers depicting the values of the matrix.
Constraints:-
3 <= N, M <= 500
0 <= Matrix[][] <= 1Print the number of good cells.Sample Input:-
3 3
1 1 0
1 1 1
1 1 1
Sample Output:-
1
Explanation:-
Only cell at position 1, 1 is good
Sample Input:-
5 4
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
Sample Output:-
3
Explanation:-
(1, 2), (2, 1) and (3, 2) are good cells, I have written this Solution Code: N, M= list(map(int,input().split()))
mat =[]
for i in range(N):
List =list(map(int,input().split()))[:M]
mat.append(List)
count =0
for i in range(1,N-1):
for j in range(1,M-1):
if (mat[i][j-1] == 1 and mat[i][j+1] == 1 and mat[i-1][j] == 1 and mat[i+1][j] == 1):
count +=1
print(count), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a boolean Matrix of size N*M, A cell of the matrix is called "Good" if it is completely surrounded by the cells containing '1' i.e. each adjacent cell (which shares a common edge) contains '1'. Your task is to find the number of such cells.
See the below example for a better understandingFirst line of input contains two space- separated integers N and M. Next N lines of input contain M space- separated integers depicting the values of the matrix.
Constraints:-
3 <= N, M <= 500
0 <= Matrix[][] <= 1Print the number of good cells.Sample Input:-
3 3
1 1 0
1 1 1
1 1 1
Sample Output:-
1
Explanation:-
Only cell at position 1, 1 is good
Sample Input:-
5 4
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
Sample Output:-
3
Explanation:-
(1, 2), (2, 1) and (3, 2) are good cells, 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,m;
cin>>n>>m;
int a[n][m];
FOR(i,n){
FOR(j,m){
cin>>a[i][j];}}
int sum=0,sum1=0;;
FOR1(i,1,n-1){
FOR1(j,1,m-1){
if(a[i-1][j]==1 && a[i+1][j]==1 && a[i][j-1]==1 && a[i][j+1]==1){
sum++;
}
}
}
out1(sum);
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a boolean Matrix of size N*M, A cell of the matrix is called "Good" if it is completely surrounded by the cells containing '1' i.e. each adjacent cell (which shares a common edge) contains '1'. Your task is to find the number of such cells.
See the below example for a better understandingFirst line of input contains two space- separated integers N and M. Next N lines of input contain M space- separated integers depicting the values of the matrix.
Constraints:-
3 <= N, M <= 500
0 <= Matrix[][] <= 1Print the number of good cells.Sample Input:-
3 3
1 1 0
1 1 1
1 1 1
Sample Output:-
1
Explanation:-
Only cell at position 1, 1 is good
Sample Input:-
5 4
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
Sample Output:-
3
Explanation:-
(1, 2), (2, 1) and (3, 2) are good cells, 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 m= sc.nextInt();
int a[][]= new int[n][m];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
a[i][j]=sc.nextInt();}}
int cnt=0;
for(int i=1;i<n-1;i++){
for(int j=1;j<m-1;j++){
if(a[i-1][j]==1 && a[i+1][j]==1 && a[i][j-1]==1 && a[i][j+1]==1){
cnt++;
}
}
}
System.out.print(cnt);
}
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a class with the name SumCalculator. The class needs two fields (public variables) with names num1 and num2 both of type int.
Write the following methods (instance methods):
<b>*Method named sum without any parameters, it needs to return the value of num1 + num2.</b>
<b>*Method named sum2 with two parameters a, b, it needs to return the value of a + b.</b>
<b>*Method named fromObject with two parameters of type sumCalculator object named obj1 and obj2, and you have to call sum function for respective object and return sum of both</b>
NOTE: All methods should be defined as public, NOT public static.
NOTE: In total, you have to write 3 methods.
NOTE: Do not add the main method to the solution code.You don't have to take any input, You only have to write class <b>SumCalculator</b>.Output will be printed by tester, "Correct" if your code is perfectly fine otherwise "Wrong".Sample Input:
1
Sample Output:
Correct, I have written this Solution Code: class SumCalculator():
def __init__(self,a,b):
self.a=a
self.b=b
def sum(self):
return self.a+self.b
def sum2(self,a,b):
return a+b
def fromObject(self,ob1,ob2):
return ob1.sum+ob2.sum, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a class with the name SumCalculator. The class needs two fields (public variables) with names num1 and num2 both of type int.
Write the following methods (instance methods):
<b>*Method named sum without any parameters, it needs to return the value of num1 + num2.</b>
<b>*Method named sum2 with two parameters a, b, it needs to return the value of a + b.</b>
<b>*Method named fromObject with two parameters of type sumCalculator object named obj1 and obj2, and you have to call sum function for respective object and return sum of both</b>
NOTE: All methods should be defined as public, NOT public static.
NOTE: In total, you have to write 3 methods.
NOTE: Do not add the main method to the solution code.You don't have to take any input, You only have to write class <b>SumCalculator</b>.Output will be printed by tester, "Correct" if your code is perfectly fine otherwise "Wrong".Sample Input:
1
Sample Output:
Correct, I have written this Solution Code: class SumCalculator{
public int num1,num2;
SumCalculator(int _num1,int _num2){
num1=_num1;
num2=_num2;
}
public int sum() {
return num1+num2;
}
public int sum2(int a,int b){
return a+b;
}
public int fromObject(SumCalculator obj1,SumCalculator obj2){
return obj1.sum() + obj2.sum();
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Take input from standard input while you do not get 0 as an input. Print all the inputs separated by space. It is guaranteed that the number of integers are less than 100000.The input will contain a series of integers in one line each. Input should be taken while you have not get a 0 as an input.
0 <= input <= 10Print the input integers seperated by space.Sample Input
6
5
5
0
Sample Output
6 5 5 0
Sample Input
9
3
5
7
6
9
8
3
2
7
7
3
5
0
Sample Output
9 3 5 7 6 9 8 3 2 7 7 3 5 0, I have written this Solution Code: n=1
index=0
li=[]
while n!=0:
n=int(input())
li.append(n)
index=index+1
#li = list(map(int,input().strip().split()))
for i in range(0,len(li)-1):
print(li[i],end=" ")
print(li[len(li)-1]), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Take input from standard input while you do not get 0 as an input. Print all the inputs separated by space. It is guaranteed that the number of integers are less than 100000.The input will contain a series of integers in one line each. Input should be taken while you have not get a 0 as an input.
0 <= input <= 10Print the input integers seperated by space.Sample Input
6
5
5
0
Sample Output
6 5 5 0
Sample Input
9
3
5
7
6
9
8
3
2
7
7
3
5
0
Sample Output
9 3 5 7 6 9 8 3 2 7 7 3 5 0, I have written this Solution Code:
import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int n=100001;
int a;
for(int i=0;i<n;i++){
a=sc.nextInt();
System.out.print(a+" ");
if(a==0){break;}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Take input from standard input while you do not get 0 as an input. Print all the inputs separated by space. It is guaranteed that the number of integers are less than 100000.The input will contain a series of integers in one line each. Input should be taken while you have not get a 0 as an input.
0 <= input <= 10Print the input integers seperated by space.Sample Input
6
5
5
0
Sample Output
6 5 5 0
Sample Input
9
3
5
7
6
9
8
3
2
7
7
3
5
0
Sample Output
9 3 5 7 6 9 8 3 2 7 7 3 5 0, 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;
while(cin >> n){
cout << n << " ";
if(n == 0) break;
}
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You must be familiar with various types of operators. One of the most commonly used operators in any language are increment and decrement operators. Given two numbers X and Y. Your task is to print the value of X decremented by 1 and value of Y after incremented by 1.The first line of the input contains two integers X and Y.
<b>Constraints:</b>
1 ≤ X, Y ≤ 10000You need to perform the task as mentioned in the question, and finally, print the result separated by a space.Sample Input 1:
4 5
Sample Output 1:
3 6
Sample Input 2:
5 6
Sample Output 2:
4 7, 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 x = sc.nextInt();
int y = sc.nextInt();
x--;
y++;
System.out.print(x);
System.out.print(" ");
System.out.print(y);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You must be familiar with various types of operators. One of the most commonly used operators in any language are increment and decrement operators. Given two numbers X and Y. Your task is to print the value of X decremented by 1 and value of Y after incremented by 1.The first line of the input contains two integers X and Y.
<b>Constraints:</b>
1 ≤ X, Y ≤ 10000You need to perform the task as mentioned in the question, and finally, print the result separated by a space.Sample Input 1:
4 5
Sample Output 1:
3 6
Sample Input 2:
5 6
Sample Output 2:
4 7, I have written this Solution Code: def incremental_decremental(x, y):
x -= 1
y += 1
print(x, y, end =' ')
def main():
input1 = input().split()
x = int(input1[0])
y = int(input1[1])
#z = int(input1[2])
incremental_decremental(x, y)
if __name__ == '__main__':
main(), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer <b>N</b>, you need to typecast this integer to String. If the typecasting is done successfully then we will print "<b>Nice Job</b>" otherwise "<b>Wrong answer</b>".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>checkConvertion()</b>, which contains N as a parameter.You need to return the typecasted string value. The driver code will print "<b>Nice Job</b>" otherwise "<b>Wrong answer</b>".Sample Input:
5
Sample Output:
Nice Job
Sample Input:
6
Sample Output:
Nice Job, I have written this Solution Code: def checkConevrtion(a):
return str(a)
, In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer <b>N</b>, you need to typecast this integer to String. If the typecasting is done successfully then we will print "<b>Nice Job</b>" otherwise "<b>Wrong answer</b>".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>checkConvertion()</b>, which contains N as a parameter.You need to return the typecasted string value. The driver code will print "<b>Nice Job</b>" otherwise "<b>Wrong answer</b>".Sample Input:
5
Sample Output:
Nice Job
Sample Input:
6
Sample Output:
Nice Job, I have written this Solution Code: static String checkConevrtion(int a)
{
return String.valueOf(a);
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Harry is very confused after knowing all about Sirius. To lighten Harry's mood Sirius asks a fun problem to him. Sirius puts K talking skulls equally spaced on the circumference of a circle. Now he enumerates them from 1 to K in clockwise order. Now given skull X and skull Z, he asks Harry to find number of possible Y such that angle XYZ is obtuse(more than 90 degrees).
Note:- X Y and Z must be different.The first line of the input contains single integer T, denoting number of test cases.
Each test case contains three integers K, X and Z.
Constraints
1 <= T <= 10
1 <= K <= 1000000000
1 <= X, Y <= KFor each testcase print number of possible Y in a new line.Sample Input
2
6 1 3
10 1 5
Sample Output
1
3
Explanation:
For first case, 2 is the suitable skull.
For second case, 2, 3 and 4 are the suitable skulls., 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));
int t = Integer.parseInt(in.readLine());
while(t-- > 0){
String str[] = in.readLine().trim().split(" ");
int k = Integer.parseInt(str[0]);
int x = Integer.parseInt(str[1]);
int z = Integer.parseInt(str[2]);
int cnt = Math.abs(x-z);
int rem = k - cnt;
if(cnt < rem){
if(cnt != 0){
System.out.println(cnt-1);
}
else{
System.out.println(0);
}
}
else if(rem < cnt){
if(rem != 0){
System.out.println(rem-1);
}
else{
System.out.println(0);
}
}
else{
System.out.println(0);
}
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Harry is very confused after knowing all about Sirius. To lighten Harry's mood Sirius asks a fun problem to him. Sirius puts K talking skulls equally spaced on the circumference of a circle. Now he enumerates them from 1 to K in clockwise order. Now given skull X and skull Z, he asks Harry to find number of possible Y such that angle XYZ is obtuse(more than 90 degrees).
Note:- X Y and Z must be different.The first line of the input contains single integer T, denoting number of test cases.
Each test case contains three integers K, X and Z.
Constraints
1 <= T <= 10
1 <= K <= 1000000000
1 <= X, Y <= KFor each testcase print number of possible Y in a new line.Sample Input
2
6 1 3
10 1 5
Sample Output
1
3
Explanation:
For first case, 2 is the suitable skull.
For second case, 2, 3 and 4 are the suitable skulls., I have written this Solution Code: k = int(input())
for i in range(k):
z = 0
a = input().split()
a = [int(i) for i in a]
rad = 360/a[0]
dia = abs(a[2]-a[1])
ang = rad*dia
if(ang/2 > 90):
z = a[0]- dia - 1
elif(ang/2 < 90):
z = dia - 1
else:
z = 0
print(z)
a.clear(), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Harry is very confused after knowing all about Sirius. To lighten Harry's mood Sirius asks a fun problem to him. Sirius puts K talking skulls equally spaced on the circumference of a circle. Now he enumerates them from 1 to K in clockwise order. Now given skull X and skull Z, he asks Harry to find number of possible Y such that angle XYZ is obtuse(more than 90 degrees).
Note:- X Y and Z must be different.The first line of the input contains single integer T, denoting number of test cases.
Each test case contains three integers K, X and Z.
Constraints
1 <= T <= 10
1 <= K <= 1000000000
1 <= X, Y <= KFor each testcase print number of possible Y in a new line.Sample Input
2
6 1 3
10 1 5
Sample Output
1
3
Explanation:
For first case, 2 is the suitable skull.
For second case, 2, 3 and 4 are the suitable skulls., I have written this Solution Code: #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main()
{
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in","r",stdin);
freopen("outputf.in","w",stdout);
#endif
int t,k,r,s,a,b;
cin>>t;
while(t--)
{
cin>>k>>r>>s;
b=max(r,s);
a=min(r,s);
if(k%2==0&&(b-a)==k/2)
cout<<0;
else
if((k%2!=0&&(b-a)<=k/2)||(k%2==0&&(b-a)<k/2))
cout<<b-a-1;
else if((b-a)>k/2)
cout<<k-(b-a)-1;
cout<<endl;
}
#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 a chessboard of size N x N, where the top left square is black. Each square contains a value. Find the sum of the values of all black squares and all white squares.
Remember that in a chessboard black and white squares are alternate.The first line of input will be the N size of the matrix. Then next N lines will consist of elements of the matrix. Each row will contain N elements since it is a square matrix.
<b>Constraints:-</b>
1 ≤ N ≤ 800
1 ≤ Matrix[i][j] ≤ 100000
Print two lines, the first line containing the sum of black squares and the second line containing the sum of white squares.Input 1:
3
1 2 3
4 5 6
7 8 9
Output 1:
25
20
Sample Input 2:
4
1 2 3 4
6 8 9 10
11 12 13 14
15 16 17 18
Sample Output 2:
80
79
<b>Explanation 1</b>
The black square contains 1, 3, 5, 7, 9; sum = 25
The white square contains 2, 4, 6, 8; sum = 20, I have written this Solution Code: n=int(input())
bSum=0
wSum=0
for i in range(n):
c=(input().split())
for j in range(len(c)):
if(i%2==0):
if(j%2==0):
bSum+=int(c[j])
else:
wSum+=int(c[j])
else:
if(j%2==0):
wSum+=int(c[j])
else:
bSum+=int(c[j])
print(bSum)
print(wSum), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given a chessboard of size N x N, where the top left square is black. Each square contains a value. Find the sum of the values of all black squares and all white squares.
Remember that in a chessboard black and white squares are alternate.The first line of input will be the N size of the matrix. Then next N lines will consist of elements of the matrix. Each row will contain N elements since it is a square matrix.
<b>Constraints:-</b>
1 ≤ N ≤ 800
1 ≤ Matrix[i][j] ≤ 100000
Print two lines, the first line containing the sum of black squares and the second line containing the sum of white squares.Input 1:
3
1 2 3
4 5 6
7 8 9
Output 1:
25
20
Sample Input 2:
4
1 2 3 4
6 8 9 10
11 12 13 14
15 16 17 18
Sample Output 2:
80
79
<b>Explanation 1</b>
The black square contains 1, 3, 5, 7, 9; sum = 25
The white square contains 2, 4, 6, 8; sum = 20, I have written this Solution Code: import java.util.*;
import java.io.*;
import java.lang.*;
class Main
{
public static void main (String[] args)throws IOException {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int mat[][] = new int[N][N];
for(int i = 0; i < N; i++)
{
for(int j = 0; j < N; j++)
mat[i][j] = sc.nextInt();
}
alternate_Matrix_Sum(mat,N);
}
static void alternate_Matrix_Sum(int mat[][], int N)
{
long sum =0, sum1 = 0;
for(int i = 0; i < N; i++)
{
for(int j = 0; j < N; j++)
{
if((i+j)%2 == 0)
sum += mat[i][j];
else sum1 += mat[i][j];
}
}
System.out.println(sum);
System.out.print(sum1);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Newton got a string as a gift on Christmas. Newton likes palindromes so he decides to make this string into a palindrome. He can kick the string and after every kick, he can change any one of its characters to any other character of his choice.
Find the minimum number of times that Newton has to kick the string.The first and the only line of the input contains a single string S
<b>Constraints:</b>
<ul>
<li>1 ≤ |S| ≤ 1000</li>
<li>All characters in S are in lowercase and are English letters</li>
</ul>Output the answer<b>Sample Input 1:</b>
newton
<b>Sample Output 1:</b>
2
<b>Sample Input 2:</b>
abbcbba
<b>Sample Output 2:</b>
0
<b>Sample Explanation 1:</b>
In the first kick, Newton changes the 2nd character to 'o'
In the second kick, Newton changes the 4th character to 'w'.
Thus, the final word is "nowwon" which is a palindrome., I have written this Solution Code: #include<iostream>
#include<string>
using namespace std;
int main(){
string S;
cin >> S;
int ans = 0;
for(int i = 0;i<S.size()/2;++i){
if(S[i]!=S[S.size()-1-i])
{
++ans;
}
}
cout << ans << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string s, find the first non-repeating character in the string and return its index. If it does not exist, return -1.First line of the input contains the string s.
<b>Constraints</b>
1<= s. length <= 100000Print the index of the first non- repeating character in a stringInput
s = "newtonschool"
Output
1
Explanation
"e" is the first non- repeating character in a string, 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();
System.out.print(nonRepeatChar(s));
}
static int nonRepeatChar(String s){
char count[] = new char[256];
for(int i=0; i< s.length(); i++){
count[s.charAt(i)]++;
}
for (int i=0; i<s.length(); i++) {
if (count[s.charAt(i)]==1){
return i;
}
}
return -1;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string s, find the first non-repeating character in the string and return its index. If it does not exist, return -1.First line of the input contains the string s.
<b>Constraints</b>
1<= s. length <= 100000Print the index of the first non- repeating character in a stringInput
s = "newtonschool"
Output
1
Explanation
"e" is the first non- repeating character in a string, I have written this Solution Code: from collections import defaultdict
s=input()
d=defaultdict(int)
for i in s:
d[i]+=1
ans=-1
for i in range(len(s)):
if(d[s[i]]==1):
ans=i
break
print(ans), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a string s, find the first non-repeating character in the string and return its index. If it does not exist, return -1.First line of the input contains the string s.
<b>Constraints</b>
1<= s. length <= 100000Print the index of the first non- repeating character in a stringInput
s = "newtonschool"
Output
1
Explanation
"e" is the first non- repeating character in a string, I have written this Solution Code: /**
* Author : tourist1256
* Time : 2022-01-10 12:51:16
**/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif
int firstUniqChar(string s) {
map<char, int> charCount;
int len = s.length();
for (int i = 0; i < len; i++) {
charCount[s[i]]++;
}
for (int i = 0; i < len; i++) {
if (charCount[s[i]] == 1)
return i;
}
return -1;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string str;
cin>>str;
cout<<firstUniqChar(str)<<"\n";
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: This is a time of conflict in Westeros as Viserys Targaryen, the king of all seven kingdoms, rejected the hand of Lady Laena Velaryon. So, the Velaryon soldiers are not deemed trustworthy anymore. The Targaryen soldiers have to keep an eye on them.
You are given a sequential order of N soldiers standing in a line. The order is provided as a binary string, with 0 representing Velaryon soldiers, and 1 representing the Targaryen soldiers. Viserys wants each contiguous segment of N/2 soldiers to contain an even number of Targaryen soldiers.
Formally you are given a binary string of length N, where N is an even natural number. Each character of the string is either '0' or '1'. You want to rearrange the elements of the string in such a way that the final string contains an even number of 1s in each contiguous subsegment of length N/2.
Your task is to find out whether there exists a rearrangement of the soldiers that satisfies the above conditions.The first line contains an integer T, the number of test cases. Then, T test cases follow.
The first line of each test case contains an even positive integer N, the length of the line.
The second line of each test case contains a binary string of length N, representing the current arrangement of soldiers.
<b> Constraints: </b>
1 ≤ T ≤ 10
2 ≤ N ≤ 10<sup>4</sup>
N is evenPrint a single character in a new line for each test case. Print '1' (without quotes) if a required rearrangement exists, and '0' (without quotes) otherwise.Sample Input:
3
2
10
2
00
4
0011
Sample Output:
0
1
0
(In the last case, no matter how you rearrange the string, there will always be a single one in at least one subsegment of length 2 of the string), I have written this Solution Code: import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args)throws IOException
{
StringBuilder out=new StringBuilder();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int test=Integer.parseInt(br.readLine());
while(test-->0)
{
int n=Integer.parseInt(br.readLine());
String s=br.readLine();
int c1=0;
for(int i=0;i<s.length();i++)
{
if(s.charAt(i)=='1') c1++;
}
if(c1%4==0) out.append("1\n");
else if(c1==s.length() && (c1/2)%2==0) out.append("1\n");
else
out.append("0\n");
}
System.out.print(out);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: This is a time of conflict in Westeros as Viserys Targaryen, the king of all seven kingdoms, rejected the hand of Lady Laena Velaryon. So, the Velaryon soldiers are not deemed trustworthy anymore. The Targaryen soldiers have to keep an eye on them.
You are given a sequential order of N soldiers standing in a line. The order is provided as a binary string, with 0 representing Velaryon soldiers, and 1 representing the Targaryen soldiers. Viserys wants each contiguous segment of N/2 soldiers to contain an even number of Targaryen soldiers.
Formally you are given a binary string of length N, where N is an even natural number. Each character of the string is either '0' or '1'. You want to rearrange the elements of the string in such a way that the final string contains an even number of 1s in each contiguous subsegment of length N/2.
Your task is to find out whether there exists a rearrangement of the soldiers that satisfies the above conditions.The first line contains an integer T, the number of test cases. Then, T test cases follow.
The first line of each test case contains an even positive integer N, the length of the line.
The second line of each test case contains a binary string of length N, representing the current arrangement of soldiers.
<b> Constraints: </b>
1 ≤ T ≤ 10
2 ≤ N ≤ 10<sup>4</sup>
N is evenPrint a single character in a new line for each test case. Print '1' (without quotes) if a required rearrangement exists, and '0' (without quotes) otherwise.Sample Input:
3
2
10
2
00
4
0011
Sample Output:
0
1
0
(In the last case, no matter how you rearrange the string, there will always be a single one in at least one subsegment of length 2 of the string), I have written this Solution Code: T=int(input())
for i in range(T):
n=int(input())
a=input()
count_1=0
for i in a:
if i=='1':
count_1+=1
if count_1%2==0 and ((count_1)//2)%2==0:
print('1')
else:
print('0'), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: This is a time of conflict in Westeros as Viserys Targaryen, the king of all seven kingdoms, rejected the hand of Lady Laena Velaryon. So, the Velaryon soldiers are not deemed trustworthy anymore. The Targaryen soldiers have to keep an eye on them.
You are given a sequential order of N soldiers standing in a line. The order is provided as a binary string, with 0 representing Velaryon soldiers, and 1 representing the Targaryen soldiers. Viserys wants each contiguous segment of N/2 soldiers to contain an even number of Targaryen soldiers.
Formally you are given a binary string of length N, where N is an even natural number. Each character of the string is either '0' or '1'. You want to rearrange the elements of the string in such a way that the final string contains an even number of 1s in each contiguous subsegment of length N/2.
Your task is to find out whether there exists a rearrangement of the soldiers that satisfies the above conditions.The first line contains an integer T, the number of test cases. Then, T test cases follow.
The first line of each test case contains an even positive integer N, the length of the line.
The second line of each test case contains a binary string of length N, representing the current arrangement of soldiers.
<b> Constraints: </b>
1 ≤ T ≤ 10
2 ≤ N ≤ 10<sup>4</sup>
N is evenPrint a single character in a new line for each test case. Print '1' (without quotes) if a required rearrangement exists, and '0' (without quotes) otherwise.Sample Input:
3
2
10
2
00
4
0011
Sample Output:
0
1
0
(In the last case, no matter how you rearrange the string, there will always be a single one in at least one subsegment of length 2 of the string), I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
signed main() {
int t;
cin >> t;
for(int i=0; i<t; i++) {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
for(int j=0; j<n; j++) {
if(s[j] == '1') cnt++;
}
if(cnt % 4 == 0) cout << 1 << "\n";
else cout << 0 << "\n";
}
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 chessboard of size N x N, where the top left square is black. Each square contains a value. Find the sum of the values of all black squares and all white squares.
Remember that in a chessboard black and white squares are alternate.The first line of input will be the N size of the matrix. Then next N lines will consist of elements of the matrix. Each row will contain N elements since it is a square matrix.
<b>Constraints:-</b>
1 ≤ N ≤ 800
1 ≤ Matrix[i][j] ≤ 100000
Print two lines, the first line containing the sum of black squares and the second line containing the sum of white squares.Input 1:
3
1 2 3
4 5 6
7 8 9
Output 1:
25
20
Sample Input 2:
4
1 2 3 4
6 8 9 10
11 12 13 14
15 16 17 18
Sample Output 2:
80
79
<b>Explanation 1</b>
The black square contains 1, 3, 5, 7, 9; sum = 25
The white square contains 2, 4, 6, 8; sum = 20, I have written this Solution Code: n=int(input())
bSum=0
wSum=0
for i in range(n):
c=(input().split())
for j in range(len(c)):
if(i%2==0):
if(j%2==0):
bSum+=int(c[j])
else:
wSum+=int(c[j])
else:
if(j%2==0):
wSum+=int(c[j])
else:
bSum+=int(c[j])
print(bSum)
print(wSum), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given a chessboard of size N x N, where the top left square is black. Each square contains a value. Find the sum of the values of all black squares and all white squares.
Remember that in a chessboard black and white squares are alternate.The first line of input will be the N size of the matrix. Then next N lines will consist of elements of the matrix. Each row will contain N elements since it is a square matrix.
<b>Constraints:-</b>
1 ≤ N ≤ 800
1 ≤ Matrix[i][j] ≤ 100000
Print two lines, the first line containing the sum of black squares and the second line containing the sum of white squares.Input 1:
3
1 2 3
4 5 6
7 8 9
Output 1:
25
20
Sample Input 2:
4
1 2 3 4
6 8 9 10
11 12 13 14
15 16 17 18
Sample Output 2:
80
79
<b>Explanation 1</b>
The black square contains 1, 3, 5, 7, 9; sum = 25
The white square contains 2, 4, 6, 8; sum = 20, I have written this Solution Code: import java.util.*;
import java.io.*;
import java.lang.*;
class Main
{
public static void main (String[] args)throws IOException {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int mat[][] = new int[N][N];
for(int i = 0; i < N; i++)
{
for(int j = 0; j < N; j++)
mat[i][j] = sc.nextInt();
}
alternate_Matrix_Sum(mat,N);
}
static void alternate_Matrix_Sum(int mat[][], int N)
{
long sum =0, sum1 = 0;
for(int i = 0; i < N; i++)
{
for(int j = 0; j < N; j++)
{
if((i+j)%2 == 0)
sum += mat[i][j];
else sum1 += mat[i][j];
}
}
System.out.println(sum);
System.out.print(sum1);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an integer K and a queue of integers, your task is to reverse the order of the first K elements of the queue, leaving the other elements in the same relative order.User task:
Since this will be a functional problem, you don't have to take input. You just have to complete the functions:
<b>ReverseK()</b>:- that takes the Queue and the integer K as parameters.
Constraints:
1 ≤ K ≤ N ≤ 10000
1 ≤ elements ≤ 10000
You need to return the modified Queue.Input 1:
5 3
1 2 3 4 5
Output 1:
3 2 1 4 5
Input 2:
5 5
1 2 3 4 5
Output 2:
5 4 3 2 1, I have written this Solution Code: static Queue<Integer> ReverseK(Queue<Integer> queue, int k) {
Stack<Integer> stack = new Stack<Integer>();
// Push the first K elements into a Stack
for (int i = 0; i < k; i++) {
stack.push(queue.peek());
queue.remove();
}
// Enqueue the contents of stack at the back
// of the queue
while (!stack.empty()) {
queue.add(stack.peek());
stack.pop();
}
// Remove the remaining elements and enqueue
// them at the end of the Queue
for (int i = 0; i < queue.size() - k; i++) {
queue.add(queue.peek());
queue.remove();
}
return queue;
}
, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Walter white is considered very intelligent person. He has a problem to solve. As he is suffering from cancer, can you help him solve it?
Given two integer arrays C and S of length c and s respectively. Index i of array S can be considered good if a subarray of length c can be formed starting from index i which is complimentary to array C.
Two arrays A, B of same length are considered complimentary if any cyclic permutation of A satisfies the property (A[i]- A[i-1]=B[i]-B[i-1]) for all i from 2 to length of A (1 indexing).
Calculate number of good positions in S .
<a href="https://mathworld.wolfram.com/CyclicPermutation.html">Cyclic Permutation</a>
1 2 3 4 has 4 cyclic permutations 2 3 4 1, 3 4 1 2, 4 1 2 3,1 2 3 4First line contains integer s (length of array S).
Second line contains s space separated integers of array S.
Third line contain integer c (length of array C).
Forth line contains c space separated integers of array C.
Constraints:
1 <= s <=1000000
1 <= c <=1000000
1 <= S[i], C[i] <= 10^9
Print the answer.
Input :
9
1 2 3 1 2 4 1 2 3
3
1 2 3
Output :
4
Explanation :
index 1- 1 2 3 matches with 1 2 3
index 2- 2 3 1 matches with 2 3 1(2 3 1 is cyclic permutation of 1 2 3)
index 3- 3 1 2 matches with 3 1 2(3 1 2 is cyclic permutation of 1 2 3)
index 7- 1 2 3 matches with 1 2 3
Input :
4
3 4 3 4
2
1 2
Output :
3
, 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 2000015
#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);
int A[sz],B[sz],C[sz],D[sz],E[sz],F[sz],G[sz];
int n,m;
signed main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>A[i];
F[i]=A[i];
}
cin>>m;
for(int i=0;i<m;i++)
{
cin>>B[i];
G[i]=B[i];
C[m-i-1]=B[i];
}
C[m]=-500000000;
for(int i=0;i<n;i++)
{
C[i+m+1]=A[n-i-1];
}
int l=0,r=0;
for(int i=1;i<=n+m;i++)
{
if(i<=r)
{
E[i]=min(r-i+1,E[i-l]);
}
while(i+E[i]<=n+m && C[E[i]]-C[0]==C[i+E[i]]-C[i])
E[i]++;
if(i+E[i]-1>r) {
l=i;r=i+E[i]-1;
}
}
for(int i=0;i<m;i++)
{
C[i]=B[i];
}
for(int i=0;i<n;i++)
{
C[i+m+1]=A[i];
}
for(int i=0;i<n;i++)
{
A[i]=E[n+m-i];
}
l=0;
r=0;
for(int i=1;i<=n+m;i++)
{
if(i<=r)
{
D[i]=min(r-i+1,D[i-l]);
}
while(i+D[i]<=n+m && C[D[i]]-C[0]==C[i+D[i]]-C[i])
D[i]++;
if(i+D[i]-1>r) {
l=i;r=i+D[i]-1;
}
}
// cout<<0<<" ";
for(int i=0;i<n;i++)
{
B[i]=D[i+m+1];
// cout<<A[i]<<" ";
}
// cout<<endl;
// for(int i=0;i<n;i++)
// {
// cout<<B[i]<<" ";
// }cout<<endl;
// for(int i=0;i<=n;i++)
// {
// cout<<i<<" ";
// }
// cout<<endl;
int cnt=0;
vector<pii> xx,yy;
for(int i=0;i<=n;i++){
int a=0;
int b=0;
if(i>0) a=A[i-1];
if(i<n) b=B[i];
// cout<<i<<" "<<a<<" "<<b<<endl;
if(a+b>=m && (a==0 || b==0 ||(F[i]-F[i-1]==G[0]-G[m-1])))
{xx.pu(mp(i-a,i+b-m)); }
if(a==m) xx.pu(mp(i-a,i-a));
if(b==m ) xx.pu(mp(i,i));
}
sort(xx.begin(),xx.end());
for(int i=0;i<xx.size();i++)
{ // cout<<xx[i].fi<<" "<<xx[i].se<<endl;
if(yy.size()==0) yy.pu(mp(xx[i].fi,xx[i].se));
else{
int p=yy.size()-1;
// cout<<i<<" "<<xx[i].fi<<" "<<xx[i].se<<" " <<yy[p].se<<endl;
if(yy[p].se>=xx[i].se) continue;
if(yy[p].se>=xx[i].fi) yy[p].se=xx[i].se;
else yy.pu(mp(xx[i].fi,xx[i].se));
}
}
for(int i=0;i<yy.size();i++)
{ // cout<<yy[i].fi<<" "<<yy[i].se<<endl;
cnt+=yy[i].se-yy[i].fi+1;
}
cout<<cnt<<endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an unsorted integer array having distinct integers, find a pair with the given sum in it.
First element of pair > second element of pairFirst line of input contains a single integer N, next line contains N space separated integers depicting the values of array and third line consist target sum.
Constraints:
2<=N<=5*(10^5)
1<=A[i], target<=2*(10^9)
TargetPrint the pair of integers which sum is target.
Sample Input1:-
6
8 7 4 5 3 1
10
Sample Output:-
Pair found (7, 3)
Sample Input2:
6
5 2 6 8 1 9
12
Sample Output:
Pair not found, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main{
public static void swap(int[] arr,int i, int j){
int temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
public static int partition(int[] arr,int l,int r){
int pivot=arr[r];
int i=l-1;
for(int j=l;j<r;j++){
if(arr[j]>pivot){
i++;
swap(arr,i,j);
}
}
swap(arr,i+1,r);
return i+1;
}
public static void quickSort(int[] arr,int l,int r){
if(l<r){
int pivot=partition(arr,l,r);
quickSort(arr,l,pivot-1);
quickSort(arr,pivot+1,r);
}
}
public static void main (String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++){
arr[i]=sc.nextInt();
}
int target=sc.nextInt();
quickSort(arr,0,n-1);
int i=0,j=n-1;
while(i<j){
if((arr[i]+arr[j])==target){
System.out.print("Pair found ("+arr[i]+", "+arr[j]+")");
return;
}
else if((arr[i]+arr[j])<target){
j--;
}
else{
i++;
}
}
System.out.print("Pair not found");
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an unsorted integer array having distinct integers, find a pair with the given sum in it.
First element of pair > second element of pairFirst line of input contains a single integer N, next line contains N space separated integers depicting the values of array and third line consist target sum.
Constraints:
2<=N<=5*(10^5)
1<=A[i], target<=2*(10^9)
TargetPrint the pair of integers which sum is target.
Sample Input1:-
6
8 7 4 5 3 1
10
Sample Output:-
Pair found (7, 3)
Sample Input2:
6
5 2 6 8 1 9
12
Sample Output:
Pair not found, I have written this Solution Code:
N=int(input())
arr=list(map(int,input().split()))
target=int(input())
arr.sort(reverse=True)
'''
ans='Pair not found'
for i in range(N):
for j in range(i+1,N):
if arr[i]+arr[j]==target:
ans='Pair found ({}, {})'.format(arr[i],arr[j])
print(ans)
'''
i=0
j=N-1
ans='Pair not found'
while i<j:
if arr[i]+arr[j]<target:
j-=1
elif arr[i]+arr[j]>target:
i+=1
j+=1
else:
ans='Pair found ({}, {})'.format(arr[i],arr[j])
break
print(ans), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an unsorted integer array having distinct integers, find a pair with the given sum in it.
First element of pair > second element of pairFirst line of input contains a single integer N, next line contains N space separated integers depicting the values of array and third line consist target sum.
Constraints:
2<=N<=5*(10^5)
1<=A[i], target<=2*(10^9)
TargetPrint the pair of integers which sum is target.
Sample Input1:-
6
8 7 4 5 3 1
10
Sample Output:-
Pair found (7, 3)
Sample Input2:
6
5 2 6 8 1 9
12
Sample Output:
Pair not found, I have written this Solution Code: #include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
// Function to find a pair in an array with a given sum using sorting
void findPair(vector<int> &nums, int n, int target)
{
// sort the array in ascending order
sort(nums.begin(), nums.end());
// maintain two indices pointing to endpoints of the array
int low = 0;
int high = n - 1;
// reduce the search space `nums[low…high]` at each iteration of the loop
// loop till the search space is exhausted
while (low < high)
{
// sum found
if (nums[low] + nums[high] == target)
{
if (nums[low] < nums[high])
swap(nums[low], nums[high]);
cout << "Pair found (" << nums[low] << ", " << nums[high] << ")\n";
return;
}
// increment `low` index if the total is less than the desired sum;
// decrement `high` index if the total is more than the desired sum
(nums[low] + nums[high] < target) ? low++ : high--;
}
// we reach here if the pair is not found
cout << "Pair not found";
}
int main()
{
int n;
cin >> n;
vector<int> nums(n);
for (int i = 0; i < n; i++)
cin >> nums[i];
int target;
cin >> target;
findPair(nums, n, target);
return 0;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You have bought N cakes and the ith cake has A[i] level of sweetness. Now you want to display the cakes in exhibition but there is a condition that you cannot display two cakes with same sweetness level. Find the maximum number of cakes that you can display.The first line of input contains a single integer N.
Second line contains N space seperated integers A[1], A[2] ..... A[N]
Constraints :
1 <= N <= 100000
1 <= A[i] <= 100000Output a single integer denoting the maximum number of cakes you can display.Sample input 1
5
1 2 3 4 5
Sample output 1
5
Sample input 2
4
1 2 2 3
Sample output 2
3
Explanation:-
Test Case 2:- There are 2 cakes with sweetness level 2 as per rule only one of them can be displayed so the ans is 3, 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());
int a[]=new int[100001];
String str[]=br.readLine().split(" ");
for(int i=0;i<str.length;i++){
a[Integer.parseInt(str[i])]++;
}
long cnt=0;
for(int i=0;i<100001;i++){
if(a[i]>0)
cnt++;
}
System.out.println(cnt);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You have bought N cakes and the ith cake has A[i] level of sweetness. Now you want to display the cakes in exhibition but there is a condition that you cannot display two cakes with same sweetness level. Find the maximum number of cakes that you can display.The first line of input contains a single integer N.
Second line contains N space seperated integers A[1], A[2] ..... A[N]
Constraints :
1 <= N <= 100000
1 <= A[i] <= 100000Output a single integer denoting the maximum number of cakes you can display.Sample input 1
5
1 2 3 4 5
Sample output 1
5
Sample input 2
4
1 2 2 3
Sample output 2
3
Explanation:-
Test Case 2:- There are 2 cakes with sweetness level 2 as per rule only one of them can be displayed so the ans is 3, I have written this Solution Code: a = int(input())
arr = input().split()
print(len(set(arr))), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You have bought N cakes and the ith cake has A[i] level of sweetness. Now you want to display the cakes in exhibition but there is a condition that you cannot display two cakes with same sweetness level. Find the maximum number of cakes that you can display.The first line of input contains a single integer N.
Second line contains N space seperated integers A[1], A[2] ..... A[N]
Constraints :
1 <= N <= 100000
1 <= A[i] <= 100000Output a single integer denoting the maximum number of cakes you can display.Sample input 1
5
1 2 3 4 5
Sample output 1
5
Sample input 2
4
1 2 2 3
Sample output 2
3
Explanation:-
Test Case 2:- There are 2 cakes with sweetness level 2 as per rule only one of them can be displayed so the ans is 3, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a;
unordered_map<int,int> m;
for(int i=0;i<n;i++){
cin>>a;
m[a]++;
}
cout<<m.size();
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given two arrays A and B of size N each. You can perform any of the following operation any number of times:
<ul>
<li>Choose any index i (1 <= i <= N) and increase A<sub>i</sub> by 1 and decrease B<sub>i</sub> by 1</li>
<li>Choose any index i (1 <= i <= N) and decrease A<sub>i</sub> by 1 and increase B<sub>i</sub> by 1</li>
</ul>
Find out whether you can make the corresponding elements of both arrays equal.The first line of the input contains a single integer N.
The second line of the input contains N space seperated integers A<sub>i</sub>
The third line of the input contains N space seperated integers B<sub>i</sub>
Constraints:
1 <= N <= 10<sup>5</sup>
1 <= A<sub>i</sub>, B<sub>i</sub> <= 10<sup>9</sup>Print "YES" if you can make the corresponding elements of both arrays equal in any number of moves, else print "NO"Sample Input:
5
3 7 6 4 2
5 7 4 4 2
Sample Output:
YES
Explaination:
First, we apply the second type of move on index i = 3 and then we apply the first type of move on index i = 1., I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws Exception{
InputStreamReader reader = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(reader);
int size = Integer.parseInt(br.readLine());
int[] arr1 = new int[size];
int[] arr2 = new int[size];
String[] str1 = br.readLine().trim().split(" ");
for(int i=0; i<arr1.length; i++){
arr1[i] = Integer.parseInt(str1[i]);
}
String[] str2 = br.readLine().trim().split(" ");
for(int i=0; i<arr2.length; i++){
arr2[i] = Integer.parseInt(str2[i]);
}
boolean bl = true;
for(int i=0; i<size; i++){
if(arr1[i] != arr2[i]){
if((Math.abs(arr1[i]-arr2[i])&1)==1){
bl = false;
break;
}
}
}
if(bl==true){
System.out.println("YES");
}else{
System.out.println("NO");
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: You are given two arrays A and B of size N each. You can perform any of the following operation any number of times:
<ul>
<li>Choose any index i (1 <= i <= N) and increase A<sub>i</sub> by 1 and decrease B<sub>i</sub> by 1</li>
<li>Choose any index i (1 <= i <= N) and decrease A<sub>i</sub> by 1 and increase B<sub>i</sub> by 1</li>
</ul>
Find out whether you can make the corresponding elements of both arrays equal.The first line of the input contains a single integer N.
The second line of the input contains N space seperated integers A<sub>i</sub>
The third line of the input contains N space seperated integers B<sub>i</sub>
Constraints:
1 <= N <= 10<sup>5</sup>
1 <= A<sub>i</sub>, B<sub>i</sub> <= 10<sup>9</sup>Print "YES" if you can make the corresponding elements of both arrays equal in any number of moves, else print "NO"Sample Input:
5
3 7 6 4 2
5 7 4 4 2
Sample Output:
YES
Explaination:
First, we apply the second type of move on index i = 3 and then we apply the first type of move on index i = 1., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> a(n), b(n);
for(auto &i : a) cin >> i;
for(auto &i : b) cin >> i;
for(int i = 0; i < n; i++){
if(abs(a[i] - b[i]) % 2){
cout << "NO";
return 0;
}
}
cout << "YES";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program that takes in a string and prints a new string with all vowels removed.
(Vowels : aeiou)Enter a string in the first line Print the string without vowels.Sample :
Input:
"Hello World"
Output:
"Hll Wrld", I have written this Solution Code: text = str(input())
vowels = "aeiouAEIOU"
new_text = ""
for char in text:
if char not in vowels:
new_text += char
print(new_text), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program that creates an N*N matrix. Fill each cell with the sum of row number and column number (based on 0 indexes, ie indices begin from base 0), take its transpose and print it.
Where the transpose of a matrix is a new matrix whose rows and the columns are interchanged to that of original matrix.Input contains a single integer N.
Constraints:-
1<=N<=500Print the NxN matrix.Sample input
2
Sample output
0 1
1 2
Explanation:-
0+0 0+1
1+0 1+1
Sample Input:-
3
Sample Output:-
0 1 2
1 2 3
2 3 4
, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[][] a=new int[n][n];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
System.out.print(i+j + " ");
}
System.out.println();
}
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program that creates an N*N matrix. Fill each cell with the sum of row number and column number (based on 0 indexes, ie indices begin from base 0), take its transpose and print it.
Where the transpose of a matrix is a new matrix whose rows and the columns are interchanged to that of original matrix.Input contains a single integer N.
Constraints:-
1<=N<=500Print the NxN matrix.Sample input
2
Sample output
0 1
1 2
Explanation:-
0+0 0+1
1+0 1+1
Sample Input:-
3
Sample Output:-
0 1 2
1 2 3
2 3 4
, I have written this Solution Code: n=int(input())
for i in range(n):
for j in range(n):
print(i+ j,end=' ')
print(), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Write a program that creates an N*N matrix. Fill each cell with the sum of row number and column number (based on 0 indexes, ie indices begin from base 0), take its transpose and print it.
Where the transpose of a matrix is a new matrix whose rows and the columns are interchanged to that of original matrix.Input contains a single integer N.
Constraints:-
1<=N<=500Print the NxN matrix.Sample input
2
Sample output
0 1
1 2
Explanation:-
0+0 0+1
1+0 1+1
Sample Input:-
3
Sample Output:-
0 1 2
1 2 3
2 3 4
, I have written this Solution Code:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
arr[i][j]=i+j;
}}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<arr[i][j]<<" ";
}
cout<<endl;}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of strings words (without duplicates), return all the concatenated words in the given list of words.
A concatenated word is defined as a string that is comprised entirely of at least two shorter words in the
given array.The first line contains integer N denoting the length of the array
Second- line contains N space-separated strings (words)
Constraints:-
1 <= N <= 15
1 <= words[i]. length <= 20
words[i] consists of only lowercase English letters.
0 <= sum(words[i]. length) <= 105Print the concatenated words ;
Note:- If there are no concatenating words then print -1Sample Input:-
8
cat cats catsdogcats dog dogcatsdog hippopotamuses rat ratcatdogcat
Sample Output:-
catsdogcats dogcatsdog ratcatdogcat
Explanation :
catsdogcats can be concatenated by cats, dog and cats.
dogcatsdog can be concatenated by dog, cats and dog.
ratcatdogcat can be concatenated by rat, cat, dog and cat.
Sample Input:-
3
cat dog catdog
Sample Output:
catdog, I have written this Solution Code:
import java.io.*;
import java.util.*;
class Main
{
public static void main(String args[])throws Exception
{
BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb=new StringBuilder();
int n=Integer.parseInt(bu.readLine());
String s[]=bu.readLine().split(" ");
Set<String> set=new HashSet(Arrays.asList(s));
ArrayList<String> ans=new ArrayList<>();
for(String x:s)
{
set.remove(x);
if(dfs(x,set,"")) ans.add(x);
set.add(x);
}
if(ans.size()==0) sb.append("-1");
else
for(String x:ans) sb.append(x+" ");
System.out.println(sb);
}
static boolean dfs(String w, Set<String> set, String p)
{
if(!p.equals("")) set.add(p);
if(set.contains(w)) return true;
for(int i=1; i<w.length(); i++)
{
String pre=w.substring(0,i);
if(set.contains(pre) && dfs(w.substring(i,w.length()), set, p+pre)) return true;
}
return false;
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given an array of strings words (without duplicates), return all the concatenated words in the given list of words.
A concatenated word is defined as a string that is comprised entirely of at least two shorter words in the
given array.The first line contains integer N denoting the length of the array
Second- line contains N space-separated strings (words)
Constraints:-
1 <= N <= 15
1 <= words[i]. length <= 20
words[i] consists of only lowercase English letters.
0 <= sum(words[i]. length) <= 105Print the concatenated words ;
Note:- If there are no concatenating words then print -1Sample Input:-
8
cat cats catsdogcats dog dogcatsdog hippopotamuses rat ratcatdogcat
Sample Output:-
catsdogcats dogcatsdog ratcatdogcat
Explanation :
catsdogcats can be concatenated by cats, dog and cats.
dogcatsdog can be concatenated by dog, cats and dog.
ratcatdogcat can be concatenated by rat, cat, dog and cat.
Sample Input:-
3
cat dog catdog
Sample Output:
catdog, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
unordered_set<string>s;
vector<string>res;
bool dfs(int start,int end,string word)
{
if(start==end)
{
return true;
}
for(int i=start+1;i<=end;i++)
{
string subword=word.substr(start,i-start);
if(s.find(subword)!=s.end())
{
if(dfs(i,end,word))
{
return true;
}
}
}
return false;
}
vector<string>
findAllConcatenatedWords(vector<string>& words) {
for(int i=0;i<words.size();i++)
{
s.insert(words[i]);
}
for(int i=0;i<words.size();i++)
{
for(int j=1;j<words[i].length();j++)
{
if(s.find(words[i].substr(0,j))!=s.end())
{
if(dfs(j,words[i].length(),words[i]))
{
res.push_back(words[i]);
break;
}
}
}
}
return res;
}
int main()
{
int l;
cin >> l;
string k;
vector<string> words;
for(int i=0; i < l; i++){
cin >> k;
words.push_back(k);
}
res = findAllConcatenatedWords(words);
if(res.empty()){
cout << -1 ;
return 0;
}
for(auto i = res.begin(); i != res.end(); i++){
cout << *i << " ";
}
cout << "\n";
return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Given a 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: Santa has been trying to solve the following task. Would you please help him so that he can go back to distributing gifts?
Given an integer N, print "AC" if N is 1. Otherwise, print "WA".
Note: You are supposed to print "AC" and "WA" without the quotes.The input consists of a single line containing the integer N.
<b> Constraints: </b>
0 ≤ N ≤ 1000Print the required answer.Sample Input 1
1
Sample Output 1
AC
Sample Input 2
0
Sample Output 2
WA
, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main {
public static void main (String[] args) throws IOException{
InputStreamReader r = new InputStreamReader(System.in);
BufferedReader br=new BufferedReader(r);
String num = br.readLine();
int N = Integer.parseInt(num);
String result = "";
if(N < 1000 && N > 0 && N == 1){
result = "AC";
} else {
result = "WA";
}
System.out.println(result);
}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not? | Compilable |
For this Question: Santa has been trying to solve the following task. Would you please help him so that he can go back to distributing gifts?
Given an integer N, print "AC" if N is 1. Otherwise, print "WA".
Note: You are supposed to print "AC" and "WA" without the quotes.The input consists of a single line containing the integer N.
<b> Constraints: </b>
0 ≤ N ≤ 1000Print the required answer.Sample Input 1
1
Sample Output 1
AC
Sample Input 2
0
Sample Output 2
WA
, I have written this Solution Code: N=int(input())
if N==1:
print("AC")
else:
print("WA"), In this Programming Language: Python, Now tell me if this Code is compilable or not? | Compilable |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.