Problem(AB plus C)
Chef has an integer and wants to find out any triplet such that:
- ;
If no such triplet exists, print instead.
Input Format
- The first line of input will contain a single integer , denoting the number of test cases.
- Each test case consists of a single integer , as mentioned in the statement.
Output Format
For each test case, output the values of such that and .
If multiple such triplets exist, you may print any.
If no such triplet exists, print instead.
Constraints
Sample 1:
Input
Output
4 1 15 2 100
-1 2 7 1 1 1 1 9 9 19
Explanation:
Test case : It can be proven that no such triplet exists.
Test case : Consider and , where:
Test case : Consider and , where:
Solution:-
#include <stdio.h> // Include the stdio library for input and output
int main() {
int t; // Number of test cases
scanf("%d", &t); // Read the number of test cases from standard input
// Loop over each test case
while (t--) {
long long int n; // Declare variable 'n' to store the input number for each test case
long long num = 1000000; // Set 'num' to 1,000,000, which is used for calculations later
// Read the input number for the current test case
scanf("%lld", &n);
// Case when 'n' is 1: output -1
if (n == 1) {
printf("-1\n");
}
// Case when 'n' is less than or equal to 'num': output 1, 1, and (n-1)
else if (n <= num) {
printf("1 1 %lld\n", n - 1);
}
// Case when 'n' is a multiple ofnum': output (n/num - 1), 'num', and 'num'
else if (n % num == 0) {
printf("%lld %lld %lld\n", (n / num) - 1, num, num);
}
// Case when 'n' is not a multiple of 'num': output (n/num), 'num', and (n%num)
else {
printf("%lld %lld %lld\n", n / num, num, n % num);
}
}
// Return 0 to indicate successful completion
return 0;
}
#include <iostream> // Include the iostream library for input and output
using namespace std; // Use the standard namespace to avoid typing 'std::' before cin and cout
int main() {
int t; // Number of test cases
cin >> t; // Read the number of test cases from standard input
// Loop over each test case
while (t--) {
long long int n; // Declare variable 'n' to store the input number for each test case
long long num = 1000000; // Set 'num' to 1,000,000, which is used for calculations later
// Read the input number for the current test case
cin >> n;
// Case when 'n' is 1: output -1
if (n == 1) {
cout << -1 << endl;
}
// Case when 'n' is less than or equal to 'num': output 1, 1, and (n-1)
else if (n <= num) {
cout << 1 << " " << 1 << " " << n - 1 << endl;
}
// Case when 'n' is a multiple of 'num': output (n/num - 1), 'num', and 'num'
else if (n % num == 0) {
cout << (n / num) - 1 << " " << num << " " << num << endl;
}
// Case when 'n' is not a multiple of 'num': output (n/num), 'num', and (n%num)
else {
cout << (n / num) << " " << num << " " << n % num << endl;
}
}
// Return 0 to indicate successful completion
return 0;
}
# Loop over each test case
for _ in range(t):
# Read the input number for the current test case
n = int(input())
num = 1000000 # Set 'num' to 1,000,000, which is used for calculations later
# Case when 'n' is 1: output -1
if n == 1:
print(-1)
# Case when 'n' is less than or equal to 'num': output 1, 1, and (n-1)
elif n <= num:
print(1, 1, n - 1)
# Case when 'n' is a multiple of 'num': output (n//num - 1), 'num', and 'num'
elif n % num == 0:
print((n // num) - 1, num, num)
# Case when 'n' is not a multiple of 'num': output (n//num), 'num', and (n%num)
else:
print(n // num, num, n % num)
Text Copied!
Recommended Post :-
HCL Coding Questions:-
Capgemini Coding Questions:-
iMocha coding Questions:-
Tech Mahindra coding questions:-
Unthinkable Solutions coding questions:-
- Swap the adjacent characters of the string
- Double the vowel characters in the string
- Character with their frequency
- Program to find the closest value
Must check this:-
Companies interview:-
- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.
Full C course:-
Key points:-
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.
Cracking the coding interview:-
Array and string:-
Tree and graph:-
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
MCQs:-
0 Comments