创建一个大小为 N 且总和为 S 的数组，使得不存在总和为 S 或 SK 的子数组

给定一个数字N和一个整数S ，任务是创建一个由N 个整数组成的数组，使得所有元素的总和等于S并打印一个元素K ，其中 0 ≤ K ≤ S，这样就不存在总和等于的子数组K或(S – K) 。
如果没有这样的数组，则打印“-1” 。
注意： K可以有多个值。您可以打印其中任何一个。
例子：

Input: N = 1, S = 4 
Output: {4} 
K = 2 
Explanation: 
There exists an array {4} whose sum is 4. 
From all possible value of K i.e., 0 ≤ K ≤ 4, K = 1, 2, and 3 satisfy the given conditions. 
For K = 2, there is no subarray whose sum is 2 or S – K i.e., 4 – 2 = 2.
Input: N = 3, S = 8 
Output: {2, 2, 4} 
K = 1 
Explanation: 
There exists an array {2, 2, 4} and there exists K as 1 such that there is no subarray whose sum is 1 and S – K i.e., 8 – 1 = 7. 
 

方法：要解决上面提到的问题，我们必须观察：

1. 如果2 * N > S那么就不可能有数组。
   例如：

   For N = 3 and S = 4, then the possible arrays are {1, 2, 1}, {1, 1, 2}, {2, 1, 1}. 
   The possible values for K are 0, 1, 2, 3 (0 < = k < = S). 
   But there is no value for K which satisfy the condition. 
   So the solution to this is not possible. 

2. 只有当2 * N <= S并且可以使用元素(N-1) 乘以 2并且最后一个元素为S – (2 * (N – 1))并且 K 始终为 1 时，才能创建数组。

下面是上述方法的实现：

C++

// C++ for the above approach
#include
using namespace std;
      
// Function to create an array with
// N elements with sum as S such that
// the given conditions satisfy
void createArray(int n, int s)
{
      
    // Check if the solution exists
    if (2 * n <= s)
    {
  
        // Print the array as
        // print (n-1) elements
        // of array as 2
        for(int i = 0; i < n - 1; i++) 
        {
           cout << "2" << " ";
           s -= 2;
        }
  
        // Print the last element
        // of the array
        cout << s << endl;
  
        // Print the value of k
        cout << "1" << endl;
    }
    else
      
        // If solution doesnot exists
        cout << "-1" << endl;
}
  
// Driver Code
int main()
{
      
    // Given N and sum S
    int N = 1;
    int S = 4;
  
    // Function call
    createArray(N, S);
}
  
// This code is contributed by Ritik Bansal

Java

// Java for the above approach
class GFG{
      
// Function to create an array with
// N elements with sum as S such that
// the given conditions satisfy
static void createArray(int n, int s)
{
  
    // Check if the solution exists
    if (2 * n <= s)
    {
  
        // Print the array as
        // print (n-1) elements
        // of array as 2
        for (int i = 0; i < n - 1; i++) 
        {
            System.out.print(2 + " ");
            s -= 2;
        }
  
        // Print the last element
        // of the array
        System.out.println(s);
  
        // Print the value of k
        System.out.println(1);
    }
    else
      
        // If solution doesnot exists
        System.out.print("-1");
}
  
// Driver Code
public static void main(String[] args) 
{
  
    // Given N and sum S
    int N = 1;
    int S = 4;
  
    // Function call
    createArray(N, S);
}
}
  
// This code is contributed by 29AjayKumar

Python3

# Python3 for the above approach
  
# Function to create an array with
# N elements with sum as S such that
# the given conditions satisfy
def createArray(n, s):
   
    # Check if the solution exists
    if (2 * n<= s):             
          
        # Print the array as
        # print (n-1) elements 
        # of array as 2
        for i in range(n-1):
            print(2, end =" ")
            s-= 2
              
        # Print the last element
        # of the array 
        print(s) 
          
        # Print the value of k 
        print(1)
    else:
        # If solution doesnot exists
        print('-1')
  
  
# Driver Code 
  
# Given N and sum S  
N = 1
S = 4
  
# Function call
createArray(N, S)

C#

// C# program for the above approach
using System;
class GFG{
      
// Function to create an array with
// N elements with sum as S such that
// the given conditions satisfy
static void createArray(int n, int s)
{
      
    // Check if the solution exists
    if (2 * n <= s)
    {
  
        // Print the array as
        // print (n-1) elements
        // of array as 2
        for(int i = 0; i < n - 1; i++) 
        {
           Console.Write(2 + " ");
           s -= 2;
        }
  
        // Print the last element
        // of the array
        Console.WriteLine(s);
  
        // Print the value of k
        Console.WriteLine(1);
    }
    else
      
        // If solution doesnot exists
        Console.Write("-1");
}
  
// Driver Code
public static void Main() 
{
  
    // Given N and sum S
    int N = 1;
    int S = 4;
  
    // Function call
    createArray(N, S);
}
}
  
// This code is contributed by Code_Mech

Javascript

  
// JavaScript program to implement
// the above approach
  
// Function to create an array with
// N elements with sum as S such that
// the given conditions satisfy
function createArray(n, s)
{
    
    // Check if the solution exists
    if (2 * n <= s)
    {
    
        // Prlet the array as
        // prlet (n-1) elements
        // of array as 2
        for (let i = 0; i < n - 1; i++) 
        {
             document.write(2 + " ");
            s -= 2;
        }
    
        // Print the last element
        // of the array
         document.write(s + "<br/>");
    
        // Print the value of k
         document.write(1);
    }
    else
        
        // If solution doesnot exists
         document.write("-1");
}
  
// Driver code
  
   // Given N and sum S
    let N = 1;
    let S = 4;
    
    // Function call
    createArray(N, S);
  
// This code is contributed by sanjoy_62.

输出：

4
1

时间复杂度： O(N)
辅助空间： O(1)