package main import ( "bufio" "os" "strconv" "fmt" ) func main() { sc := NewScanner() N := sc.NextInt() M := sc.NextInt() data := make([][]int, M * 3) for i := 0; i < M; i++ { data[i] = make([]int, 3) for j := 0; j < 3; j++ { data[i][j] = sc.NextInt() } } nums := xrange(N) mx := 0 for { total := 0 for i := 0; i < M; i++ { index1 := -1 index2 := -1 for j := 0; j < N; j++ { if nums[j] == data[i][0] { index1 = j } if nums[j] == data[i][1] { index2 = j } } if index1 < index2 { total += data[i][2] } } mx = max(mx, total) if !next_permutation(nums) { break } } fmt.Println(mx) } type Scanner struct { r *bufio.Reader buf []byte p int } func NewScanner() *Scanner { rdr := bufio.NewReaderSize(os.Stdin, 1000) return &Scanner{r:rdr} } func (s *Scanner) Next() string { s.pre() start := s.p for ; s.p < len(s.buf); s.p++ { if s.buf[s.p] == ' ' { break } } result := string(s.buf[start:s.p]) s.p++ return result } func (s *Scanner) NextLine() string { s.pre() start := s.p s.p = len(s.buf) return string(s.buf[start:]) } func (s *Scanner) NextInt() int { v, _ := strconv.Atoi(s.Next()) return v } func (s *Scanner) NextInt64() int64 { v, _ := strconv.ParseInt(s.Next(), 10, 64) return v } func (s *Scanner) NextIntArray() []int { s.pre() start := s.p result := []int{} for ; s.p < len(s.buf) + 1; s.p++ { if s.p == len(s.buf) || s.buf[s.p] == ' ' { v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 0) result = append(result, int(v)) start = s.p + 1 } } return result } func (s *Scanner) NextInt64Array() []int64 { s.pre() start := s.p result := []int64{} for ; s.p < len(s.buf) + 1; s.p++ { if s.p == len(s.buf) || s.buf[s.p] == ' ' { v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 64) result = append(result, v) start = s.p + 1 } } return result } func (s *Scanner) NextMap() map[int]bool { s.pre() start := s.p mp := map[int]bool{} for ; s.p < len(s.buf); s.p++ { if s.buf[s.p] == ' ' { v, _ := strconv.Atoi(string(s.buf[start:s.p])) mp[v] = true start = s.p + 1 } } v, _ := strconv.Atoi(string(s.buf[start:s.p])) mp[v] = true return mp } func (s *Scanner) pre() { if s.p >= len(s.buf) { s.readLine() s.p = 0 } } func (s *Scanner) readLine() { s.buf = make([]byte, 0) for { l, p, e := s.r.ReadLine() if e != nil { panic(e) } s.buf = append(s.buf, l...) if !p { break } } } func next_permutation(a []int) bool { for i := len(a) - 2; i >= 0; i-- { if a[i] < a[i + 1] { for j := len(a) - 1; j >= 0; j-- { if a[j] >= a[i] { a[i], a[j] = a[j], a[i] reverse(a, i + 1, len(a) - (i + 1)) return true } } } } reverse(a, 0, len(a)) return false } func reverse(a []int, start int, length int) { var end = start + length - 1 for start < end { a[start], a[end] = a[end], a[start] start++ end-- } } func xrange(N int) []int { data := make([]int, N) for i := 0; i < N; i++ { data[i] = i } return data } func max(a int, b int) int { if a < b { return b } return a }