I need help writing this code in C Problem: Given a list of noises generated by all pairs of animals, determine the least sum of noise that can be generated. Input will begin with a line containing 1 integer, n (1 ≤ n ≤ 11), representing the number of animal exhibits. The following n lines will each contain n space separated non-negative integers, representing the noises generated by animal pairs. The i-th value on the j-th line represents the noise level generated by animal j when antagonized by animal i. Each of the given individual noise levels generated will be at most 1,000,000. The i-th value of the i-th line will always be 0. Animals don’t generate noise from themselves. Output should contain 1 line of output, containing a single integer representing the least possible noise level sum.
I need help writing this code in C
Problem: Given a list of noises generated by all pairs of animals, determine the least sum of noise that can be generated.
Input will begin with a line containing 1 integer, n (1 ≤ n ≤ 11), representing the number of
animal exhibits. The following n lines will each contain n space separated non-negative
integers, representing the noises generated by animal pairs. The i-th value on the j-th line
represents the noise level generated by animal j when antagonized by animal i. Each of the
given individual noise levels generated will be at most 1,000,000. The i-th value of the i-th line will always be 0. Animals don’t generate noise from themselves.
Output should contain 1 line of output, containing a single integer representing the least
possible noise level sum.
Step by step
Solved in 3 steps with 1 images
