if(len(args) != 2):
print 'Wrong arguments, require parameters: start_num, max_num'
sys.exit(0)
start_num = int(args[0])
if(start_num <8):
print 'start_num needs larger than or equal to 8'
sys.exit(0)
max_num = int(args[1])
fare_gbc_test__results_file = "fare_gbc_test_results.txt"
i_j_last = 0
smallest_largest_pair_only = False
for max in range(start_num, max_num + 1):
fare_vare_list, fare_fraction_list = fare(max, False, asc=True )
# print_fare_fraction_list(fare_fraction_list)
# print " "
write_fare_data_list_to_file(fare_gbc_test__results_file, fare_fraction_list )
# print_fare_fraction_list(fare_fraction_list)
if(max%2 == 0):
i_j = detect_gbc_pair_in_fare_sequence(max, fare_fraction_list, smallest_largest_pair_only)
# print 'i_j - last: ', (i_j - i_j_last), (i_j - i_j_last)%4
i_j_last = i_j
def unit_test_detect_gbc_pair_for_level_12_tree():
n = 12
list_at_level = ster_broc_tree(n)
half_list = list_at_level[:len(list_at_level)/2 + 1]
# print "n = ", n, " half length: ", len(half_list)
write_fare_data_list_to_file("ster_tree_12.txt", half_list)
smallest_largest_pair_only = True
# try to detect GBC pair for even number 8, 12, 14, 16, 18, 20
for m in range(8, 21):
if(m%2 == 0):
print "detect m:", m
detect_gbc_pair_in_fare_sequence(m, half_list, smallest_largest_pair_only)
