Blue Bridge Cup Java algorithm improve old granny Cross Street

A total of 5 red scarves, numbered A, B, C, D, E, the grandmother was one of them to help cross the road.

Five red scarves speak each other:

A: Neither I nor e have helped granny

B: Granny is a C and E, one of them helped me through the street.

C: Granny's been helped by me and D.

D:b and C are not helping granny across the street.

E: I didn't help grandma.


It is known that there are five red scarves and only 2 people are telling the truth, who helped the old lady through the street?

If there are multiple answers, output in one line, separated by a space between the numbers.


For example
A B C D E (which is obviously not the correct answer)

public class Main {public      static void Main (string[] args) {          int k, sum;          for (k = 1; k <= 5; k++) {              sum = 0;              if (k! = 1 && k! = 5)                  sum++;              if (k = = 3 | | k = = 5)                  sum++;              if (k = = 3 | | k = = 4)                  sum++;              if (k! = 2 && k! = 3)                  sum++;              if (k! = 5)                  sum++;              if (sum = = 2)                  System.out.print ((char) (k-1 + ' A ') + "");}}      

　　

Blue Bridge Cup Java algorithm improve old granny Cross Street