OJ Board

I also got WA but don't know why. Here is my code:

#include <iostream>

int main() {
int pos, x, num, sum, result, avg, arr[1000], rem;
double temp;
cin>>num;

while (num!=0) {
pos = 0; sum = 0; result = 0;
for (x = 0; x<num; x++) {
cin>>temp; temp*=100;
arr[pos] = (int)temp;
sum += arr ...

Hi,
I used DP to solve this problem but I got Runtime Error. Would anyone give some test cases for me to debug? Thank you.

Hi, my code give the same output as yours.

I believe I have considered this because when there are more than one way to go to a point(have the same weight), I always choose the one with minimum Lexicographical order by tracking back. May be this procedure is wrong but I still can not find where.
Thank you for your reply.

I have read through 13 pages about pb 116 and tried many test cases but I still can not figure out what's wrong with my code. Would anyone give me some test cases so that I can find what's wrong. Here is my source code. Thank you very much.

#include <stdio.h>

int arr[11][101], cost[11][101], path ...