{"lang": "Go", "source_code": "package main\n\nimport (\n)\nimport \"fmt\"\n\nfunc main() {\n\tvar n, prev, now int64\n\tfmt.Scan(&n)\n\tprev = 1\n\tnow = 2\n\tans := 0\n\tfor now <= n {\n\t\tprev, now = now, prev + now\n\t\tans += 1;\n\t}\n\tfmt.Println(ans)\n}\n\n", "lang_cluster": "Go", "tags": ["math", "greedy", "constructive algorithms", "combinatorics"], "code_uid": "ded39b17005941b1fb27d8704766e06e", "src_uid": "3d3432b4f7c6a3b901161fa24b415b14", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n)\n\nfunc solve() {\n\tl := readInt64()\n\tr := readInt64()\n\tx := readInt64()\n\ty := readInt64()\n\tk := readInt64()\n\tfor j := x; j <= y; j++ {\n\t\tt := j * k\n\t\tif t > r {\n\t\t\tbreak\n\t\t}\n\t\tif t >= l && t <= r {\n\t\t\tfmt.Println(\"YES\")\n\t\t\treturn\n\t\t}\n\t}\n\t// for i := l; i <= r; i++ {\n\t// \tfor j := x; j <= y; j++ {\n\t// \t\tif i%j == 0 && i/j == k {\n\t// \t\t\tfmt.Println(\"YES\")\n\t// \t\t\treturn\n\t// \t\t}\n\t// \t}\n\t// }\n\tfmt.Println(\"NO\")\n}\n\nvar scanner *bufio.Scanner\n\nfunc main() {\n\tscanner = bufio.NewScanner(os.Stdin)\n\tconst MaxTokenLength = 1024 * 1024\n\tscanner.Buffer(make([]byte, 0, MaxTokenLength), MaxTokenLength)\n\tscanner.Split(bufio.ScanWords)\n\tsolve()\n}\n\nfunc abs(a int) int {\n\tif a < 0 {\n\t\treturn -a\n\t}\n\treturn a\n}\n\nfunc min(a int, b int) int {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}\n\n// IO\n\nfunc readString() string {\n\tscanner.Scan()\n\treturn scanner.Text()\n}\n\nfunc readInt() int {\n\tval, _ := strconv.Atoi(readString())\n\treturn val\n}\n\nfunc readInt64() int64 {\n\tv, _ := strconv.ParseInt(readString(), 10, 64)\n\treturn v\n}\n\nfunc readIntArray(sz int) []int {\n\ta := make([]int, sz)\n\tfor i := 0; i < sz; i++ {\n\t\ta[i] = readInt()\n\t}\n\treturn a\n}\n\nfunc readInt64Array(n int) []int64 {\n\tres := make([]int64, n)\n\tfor i := 0; i < n; i++ {\n\t\tres[i] = readInt64()\n\t}\n\treturn res\n}\n", "lang_cluster": "Go", "tags": ["two pointers", "brute force"], "code_uid": "74e106c856469dcb92d587d00e4782ae", "src_uid": "1110d3671e9f77fd8d66dca6e74d2048", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n\t\"log\"\n)\n\nvar (\n\thi = []string{\"h\", \"e\", \"l\", \"l\", \"o\"}\n)\n\nfunc main() {\n\tvar (\n\t\ts       string\n\t\tcounter int\n\t\tlength  = len(hi)\n\t)\n\tif _, err := fmt.Scanf(\"%s\\n\", &s); err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tfor i := range s {\n\t\tif s[i:i+1] == hi[counter] {\n\t\t\tcounter++\n\t\t\tif counter == length {\n\t\t\t\tfmt.Println(\"YES\")\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\tfmt.Println(\"NO\")\n}\n", "lang_cluster": "Go", "tags": ["greedy", "strings"], "code_uid": "33ec15418e31fb1f26e884904b7c0d92", "src_uid": "c5d19dc8f2478ee8d9cba8cc2e4cd838", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n \nimport (\n    \"fmt\"\n    s \"strings\"\n)\n func main() {\n    var l int\n    var str string\n    fmt.Scan(&l, &str)\n    fs := s.Count(str, \"FS\")\n    sf := s.Count(str, \"SF\")\n    if sf > fs {\n        fmt.Println(\"YES\")\n    } else {\n        fmt.Println(\"NO\")\n    }\n}", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "2becc8fa1acbeafe1beeba73932b1549", "src_uid": "ab8a2070ea758d118b3c09ee165d9517", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n\t// \"sort\"\n\t// \"strings\"\n)\n\nvar (\n\twriter  = bufio.NewWriter(os.Stdout)\n\tscanner = bufio.NewScanner(os.Stdin)\n)\n\n//Wrong\nfunc main() {\n\tdefer writer.Flush()\n\tscanner.Split(bufio.ScanWords)\n\n\tn := nextInt64()\n\tvar sum, i int64 = 0, 0\n\n\tfor sum+i+1 <= n {\n\t\tsum += i\n\t\ti++\n\t}\n\t// println(sum)\n\tprintln(n - sum)\n}\n\nfunc next() string {\n\tif !scanner.Scan() {\n\t\tpanic(scanner.Err())\n\t}\n\treturn scanner.Text()\n}\n\nfunc nextInt64() int64 {\n\tn, _ := strconv.ParseInt(next(), 0, 64)\n\treturn n\n}\n\nfunc nextInt() int {\n\tn, _ := strconv.Atoi(next())\n\treturn n\n}\n\nfunc nextFloat() float64 {\n\tn, _ := strconv.ParseFloat(next(), 64)\n\treturn n\n}\n\nfunc println(a ...interface{})               { fmt.Fprintln(writer, a...) }\nfunc print(a ...interface{})                 { fmt.Fprint(writer, a...) }\nfunc printf(format string, a ...interface{}) { fmt.Fprintf(writer, format, a...) }\n", "lang_cluster": "Go", "tags": ["math", "implementation"], "code_uid": "29fdcad8508bb6ead4ee977e61e0ba29", "src_uid": "1db5631847085815461c617854b08ee5", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "// https://codeforces.com/problemset/problem/731/A\npackage main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n)\n\nfunc diff(x int, y int) int {\n\tz := x - y\n\tif z >= 0 {\n\t\treturn z\n\t}\n\n\treturn z * (-1)\n}\n\nfunc main() {\n\tin := bufio.NewReader(os.Stdin)\n\tout := bufio.NewWriter(os.Stdout)\n\tdefer out.Flush()\n\n\tvar m, mRev map[rune]int\n\tm = make(map[rune]int)\n\tmRev = make(map[rune]int)\n\tchar := 'a'\n\tfor i := 1; i <= 26; i++ {\n\t\tm[rune(char)] = i\n\t\tchar++\n\t}\n\tcharRev := 'z'\n\tfor i := 26; i >= 1; i-- {\n\t\tmRev[rune(charRev)] = i\n\t\tcharRev--\n\t}\n\n\tvar s string\n\tvar ans int\n\tfmt.Fscanf(in, \"%s\\n\", &s)\n\tfor i := 0; i < len(s); i++ {\n\t\tvar a, b int\n\t\tif i == 0 {\n\t\t\ta = diff(m[rune(s[i])], m['a'])\n\t\t\tb = diff(a, 26)\n\t\t} else {\n\t\t\ta = diff(m[rune(s[i])], m[rune(s[i-1])])\n\t\t\tb = diff(a, 26)\n\t\t}\n\t\tif a < b {\n\t\t\tans += a\n\t\t} else {\n\t\t\tans += b\n\t\t}\n\t}\n\n\tfmt.Fprintln(out, ans)\n}\n", "lang_cluster": "Go", "tags": ["strings", "implementation"], "code_uid": "afd765be3cdcc8d7a0d49979825eb39b", "src_uid": "ecc890b3bdb9456441a2a265c60722dd", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport \"fmt\"\n\nfunc min(a, b int) int {\n\tif a < b {\n\t\treturn a\n\t} else {\n\t\treturn b\n\t}\n}\n\nfunc main() {\n\tvar y, b, r int\n\tfmt.Scan(&y, &b, &r)\n\tans_r := min(y + 2, min(b + 1, r))\n\tfmt.Println((ans_r - 1) * 3)\n}\n\n", "lang_cluster": "Go", "tags": ["brute force", "math", "implementation"], "code_uid": "3d9e67f986bf70f29ce29e837cd82fc7", "src_uid": "03ac8efe10de17590e1ae151a7bae1a5", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n    \"fmt\"\n    )\n\nfunc main() {\n    var n int\n    fmt.Scanf(\"%d\",&n)\n    \n    if n%4==0 || n%4==3 {\n        fmt.Println(\"0\")\n    } else {\n        fmt.Println(\"1\")\n    }\n}", "lang_cluster": "Go", "tags": ["math"], "code_uid": "ca8f1c302fc2d88934f317be69e77e64", "src_uid": "fa163c5b619d3892e33e1fb9c22043a9", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n)\n\nfunc gcd(a, b int) int {\n\tif a > b {\n\t\ta, b = b, a\n\t}\n\n\t// Special case for zero\n\tif a == 0 || b == 0 {\n\t\treturn a + b\n\t}\n\n\t// Calculate GCD using Euclidean algorithm\n\tresult := 1\n\n\tfor {\n\t\tremain := b % a\n\n\t\tif remain == 0 {\n\t\t\tresult *= a\n\t\t\tbreak\n\t\t} else {\n\t\t\tb = a\n\t\t\ta = remain\n\t\t}\n\t}\n\treturn result\n}\n\nfunc main() {\n\tvar simon, antisimon, stones int\n\n\tfmt.Scanf(\"%d %d %d\", &simon, &antisimon, &stones)\n\n\tfor {\n\t\t// Simon plays\n\t\tvar simonQuota = gcd(simon, stones)\n\n\t\tif simonQuota <= stones {\n\t\t\tstones -= simonQuota\n\t\t} else {\n\t\t\tfmt.Println(1)\n\t\t\treturn\n\t\t}\n\n\t\t// Antisimon plays\n\t\tvar antiQuota = gcd(antisimon, stones)\n\n\t\tif antiQuota <= stones {\n\t\t\tstones -= antiQuota\n\t\t} else {\n\t\t\tfmt.Println(0)\n\t\t\treturn\n\t\t}\n\n\t\t// fmt.Println(simon, antisimon, stones, simonQuota, antiQuota)\n\t}\n}", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "26612b5f110131282e66b32ee62fa375", "src_uid": "0bd6fbb6b0a2e7e5f080a70553149ac2", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport \"fmt\"\n\nfunc main() {\n\tvar n, m int\n\tfmt.Scan(&n)\n\tfmt.Scan(&m)\n\n\tgrid := make([][]bool, n)\n\tfor i := 0; i < n; i++ {\n\t\tgrid[i] = make([]bool, m)\n\t}\n\n\tvar ret bool = false\n\n\tfor {\n\t\tvar found bool = false\n\n\t\tfor i := 0; i < n && !found; i++ {\n\t\t\tfor j := 0; j < m && !found; j++ {\n\t\t\t\tif !grid[i][j] {\n\t\t\t\t\tfor k := 0; k < n; k++ {\n\t\t\t\t\t\tgrid[k][j] = true\n\t\t\t\t\t}\n\t\t\t\t\tfor k := 0; k < m; k++ {\n\t\t\t\t\t\tgrid[i][k] = true\n\t\t\t\t\t}\n\t\t\t\t\tfound = true\n\t\t\t\t\tbreak\n\t\t\t\t} \n\t\t\t}\n\t\t}\n\n\t\tif !found {\n\t\t\tbreak\n\t\t}\n\n\t\tret = !ret\n\t}\n\n\tif !ret {\n\t\tfmt.Println(\"Malvika\")\n\t} else {\n\t\tfmt.Println(\"Akshat\")\n\t}\n}", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "1df3470b0c4f9a90b523211fbe4972d7", "src_uid": "a4b9ce9c9f170a729a97af13e81b5fe4", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"math\"\n\t\"os\"\n\t\"strconv\"\n)\n\nvar res []int\n\nfunc main() {\n\tscanner := bufio.NewScanner(os.Stdin)\n\tscanner.Split(bufio.ScanWords)\n\tscanner.Scan()\n\tn, _ := strconv.Atoi(scanner.Text())\n\tscanner.Scan()\n\tk, _ := strconv.Atoi(scanner.Text())\n\n\tsolve(n, k)\n\tif len(res) == 0 || len(res) != k {\n\t\tfmt.Println(-1)\n\t\tos.Exit(0)\n\t}\n\tcheck := 1\n\tfor _, el := range res {\n\t\tcheck *= el\n\t}\n\tif check != n {\n\t\tfmt.Println(-1)\n\t\tos.Exit(0)\n\t}\n\tfor i, el := range res {\n\t\tif i == len(res)-1 {\n\t\t\tfmt.Printf(\"%d\\n\", el)\n\t\t\tcontinue\n\t\t}\n\t\tfmt.Printf(\"%d \", el)\n\t}\n}\n\nfunc solve(n, k int) {\n\tif n == 1 {\n\t\treturn\n\t}\n\tif k == 1 {\n\t\tres = append(res, n)\n\t\treturn\n\t}\n\tfor i := 2; i <= int(math.Sqrt(float64(n)))+1; i++ {\n\t\tif n%i == 0 {\n\t\t\tres = append(res, i)\n\t\t\tsolve(n/i, k-1)\n\t\t\treturn\n\t\t}\n\t}\n}\n", "lang_cluster": "Go", "tags": ["math", "implementation", "number theory"], "code_uid": "37427a1863ff3849ffdb1f1175a97439", "src_uid": "bd0bc809d52e0a17da07ccfd450a4d79", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n)\n\nvar (\n\tn      int\n\tm      int\n\tresult int\n)\n\nfunc in() {\n\tfmt.Scanf(\"%d %d\\n\", &n, &m)\n}\n\nfunc out() {\n\tfmt.Println(result)\n}\n\nfunc run() {\n\tvar remain int = n\n\tvar d int = 1\n\tfor ; remain > 0; d++ {\n\t\tif d%m != 0 {\n\t\t\tremain--\n\t\t}\n\t}\n\tresult = d - 1\n}\n\nfunc main() {\n\tin()\n\trun()\n\tout()\n}\n", "lang_cluster": "Go", "tags": ["brute force", "math", "implementation"], "code_uid": "16c9d4b2b39bca59cfaaf20f87bec487", "src_uid": "42b25b7335ec01794fbb1d4086aa9dd0", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport \"fmt\"\n\nfunc main() {\n    var x,t,a,b,da,db int\n    fmt.Scan(&x,&t,&a,&b,&da,&db)\n    m := make(map[int]bool)\n    m[0] = true\n    for i := 0; i < t; i++ {\n        m[a-(da*i)] = true\n    }\n    ans := false\n    for i := 0; i <= t; i++ {\n        if i == t {\n            if m[x] {\n                ans = true\n                break\n            }\n        } else if m[x-(b-(db*i))] {\n            ans = true\n            break\n        }\n    }\n    if ans { fmt.Println(\"YES\") } else { fmt.Println(\"NO\") }\n}\n", "lang_cluster": "Go", "tags": ["brute force", "implementation"], "code_uid": "bf7aea708fbdc2db10116353c0b4758d", "src_uid": "f98168cdd72369303b82b5a7ac45c3af", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport \"os\"\nimport \"bufio\"\nimport \"strconv\"\n\nfunc main(){\n\tvar a, c int64\n\tr := bufio.NewScanner(os.Stdin)\n\tr.Split(bufio.ScanWords)\n\tw := bufio.NewWriter(os.Stdout)\n\tr.Scan()\n\ta, _ = strconv.ParseInt(r.Text(), 0, 64)\n\tr.Scan()\n\tc, _ = strconv.ParseInt(r.Text(), 0, 64)\n\tvar b int64\n\ti := 0\n\tvar x [105]int64\n\tvar y [105]int64\n\tfor i=1; a+c>0; i++ {\n\t\tx[i] = a%3\n\t\ta /= 3\n\t\ty[i] = c%3\n\t\tc /= 3\n\t}\n\tfor i > 1 {\n\t\ti -= 1\n\t\tb = b*3 + ((y[i]-x[i]+3)%3)\n\t}\n\tw.WriteString(strconv.FormatInt(b, 10)+\"\\n\")\n\tw.Flush()\t\n}\n", "lang_cluster": "Go", "tags": ["math", "implementation"], "code_uid": "9a63fbcea49644413429275b70c5359e", "src_uid": "5fb635d52ddccf6a4d5103805da02a88", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\nimport \"fmt\"\n\nfunc main() {\n\tvar x, x1 int\n\tvar ts string\n\tvar t string\n\tvar t1 string\n\tfmt.Scan(&ts)\n\tfmt.Scan(&t, &t1)\n\t\n\tif string(t[0])==\"T\" {\n\t\tx=11\n\t} else if string(t[0])==\"A\" {\n\t\tx=15\n\t} else if string(t[0])==\"K\" {\n\t\tx=14\n\t} else if string(t[0])==\"Q\" {\n\t\tx=13\n\t} else if string(t[0])==\"J\" {\n\t\tx=12\n\t} else if string(t[0])==\"9\" {\n\t\tx=9\n\t} else if string(t[0])==\"8\" {\n\t\tx=8\n\t} else if string(t[0])==\"7\" {\n\t\tx=7\n\t} else if string(t[0])==\"6\" {\n\t\tx=6\n\t}\n\tif string(t1[0])==\"T\" {\n\t\tx1=11\n\t} else if string(t1[0])==\"A\" {\n\t\tx1=15\n\t} else if string(t1[0])==\"K\" {\n\t\tx1=14\n\t} else if string(t1[0])==\"Q\" {\n\t\tx1=13\n\t} else if string(t1[0])==\"J\" {\n\t\tx1=12\n\t} else if string(t1[0])==\"9\" {\n\t\tx1=9\n\t} else if string(t1[0])==\"8\" {\n\t\tx1=8\n\t} else if string(t1[0])==\"7\" {\n\t\tx1=7\n\t} else if string(t1[0])==\"6\" {\n\t\tx1=6\n\t}\n\n\tif string(t[1]) == string(ts) && string(t1[1])!=string(ts) {\n\t\tfmt.Println(\"YES\")\n\t} else if string(t[1])!=string(ts) && string(t1[1])==string(ts) {\n\t\tfmt.Println(\"NO\")\n\t} else if string(t[1])!=string(ts) && string(t1[1])!=string(ts) {\n\t\tif string(t[1])!=string(t1[1]) {\n\t\t\tfmt.Println(\"NO\")\n\t\t} else {\n\t\t\tif x<=x1 {\n\t\t\t\tfmt.Println(\"NO\")\n\t\t\t} else {\n\t\t\t\tfmt.Println(\"YES\")\n\t\t\t}\n\t\t}\n\t} else if string(t[1])==string(ts) && string(t1[1])==string(ts) {\n\t\tif x<=x1 {\n\t\t\tfmt.Println(\"NO\")\n\t\t} else {\n\t\t\tfmt.Println(\"YES\")\n\t\t}\n\t}\n}\n", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "657ae2912bd32b4fd39340468372e002", "src_uid": "da13bd5a335c7f81c5a963b030655c26", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "// 121A\npackage main\n\nimport (\n\t\"fmt\"\n)\n\nfunc min(a, b int64) int64 {\n\tif a > b {\n\t\treturn b\n\t}\n\treturn a\n}\n\nfunc main() {\n\tvar a [15]int64\n\tvar i, l, r, x, j, n1, n2 int64\n\tx, j = 0, 1\n\tfmt.Scan(&l, &r)\n\tfor i = 0; i <= 10; i++ {\n\t\ta[i] = 0\n\t}\n\tfor j <= r {\n\t\ti = 10\n\t\ta[i]++\n\t\tfor a[i] > 2 {\n\t\t\ta[i] = 0\n\t\t\ti--\n\t\t\ta[i]++\n\t\t}\n\t\tj = 0\n\t\tfor i = 1; i <= 10; i++ {\n\t\t\tif j > 0 && a[i] == 0 {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif a[i] == 1 {\n\t\t\t\tn1 = 4\n\t\t\t} else {\n\t\t\t\tn1 = 0\n\t\t\t}\n\t\t\tif a[i] == 2 {\n\t\t\t\tn2 = 7\n\t\t\t} else {\n\t\t\t\tn2 = 0\n\t\t\t}\n\t\t\tj = j*10 + n1 + n2\n\t\t}\n\t\tif x == 0 && j >= l {\n\t\t\tx += j\n\t\t}\n\t\tif i <= 10 {\n\t\t\tcontinue\n\t\t}\n\t\tif j >= l {\n\t\t\tx += (min(j, r) - l) * j\n\t\t\tl = j\n\t\t}\n\t}\n\tfmt.Print(x)\n}\n", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "8b578f2775736dc6390c70e551c0ef0b", "src_uid": "8a45fe8956d3ac9d501f4a13b55638dd", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n\t\"sort\"\n)\n\nfunc main() {\n\tvar n int\n\tfmt.Scanf(\"%d\\n\", &n)\n\tvar array [200]int\n\tfor i := 0; i < n; i++ {\n\t\tfmt.Scanf(\"%d\", &array[i])\n\t}\n\tsort.Ints(array[:n])\n\tvar sum float64 = float64(4.5 * float64(n))\n\n\tfor i := 0; i < n; i++ {\n\t\tsum -= float64(array[i])\n\t\t//\tfmt.Printf(\"%d \", array[i])\n\t}\n\t//\tfmt.Printf(\"%f\\n\", sum)\n\tif sum <= 0 {\n\t\tfmt.Printf(\"0\\n\")\n\t\treturn\n\t} else {\n\t\t//\tfmt.Printf(\"%f\\n\", sum)\n\t\tsum = -sum\n\t\tvar result int = 0\n\t\tfor i := 0; i < n; i++ {\n\t\t\tsum += float64(5 - array[i])\n\t\t\tresult++\n\t\t\t//\tfmt.Printf(\"%f\", sum)\n\t\t\tif sum >= 0 {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tfmt.Printf(\"%d\\n\", result)\n\t}\n\n}\n", "lang_cluster": "Go", "tags": ["sortings", "greedy"], "code_uid": "5366ee5494396bdc04bc2d727c4d4d84", "src_uid": "715608282b27a0a25b66f08574a6d5bd", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"os\"\n\t\"fmt\"\n)\n\nfunc main() {\n\ts := bufio.NewScanner(os.Stdin)\n\ts.Split(bufio.ScanWords)\n\ts.Scan()\n\ta := s.Text()\n\tvar c int\n\tfor i:=0; i<len(a) ; i++ {\n\t\tb := a[i] - '0'\n\t\tif 9 -b < b {\n\t\t\tif i==0 && b==9 {\n\t\t\t\tc=9\n\t\t\t} else {\n\t\t\t\tc = int(9 - b)\n\t\t\t}\n\t\t} else {\n\t\t\tc=int(b)\n\t\t}\n\t\tfmt.Print(c)\n\t}\n}\n", "lang_cluster": "Go", "tags": ["greedy", "implementation"], "code_uid": "e746afbdc1a2b9ce0e6c749e6e2940f1", "src_uid": "d5de5052b4e9bbdb5359ac6e05a18b61", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n)\n\nfunc main() {\n\tvar table[3][3]int\n\n\tfor i := 0; i < 3; i++ {\n\t\tfmt.Scanf(\"%d %d %d\\n\", &table[i][0], &table[i][1], &table[i][2])\n\t}\n\t\n\tvar sum int = 0\n\tfor i := 0; i < 3; i++ {\n\t\tfor j := 0; j < 3; j++ {\n\t\t\tsum = 0\n\t\t\tif i-1 >= 0 {\n\t\t\t\tsum += table[i-1][j]\n\t\t\t}\n\t\t\tif i+1 < 3 {\n\t\t\t\tsum += table[i+1][j]\n\t\t\t}\n\t\t\tif j-1 >= 0 {\n\t\t\t\tsum += table[i][j-1]\n\t\t\t}\n\t\t\tif j+1 < 3 {\n\t\t\t\tsum += table[i][j+1]\n\t\t\t}\n\t\t\tsum += table[i][j]+1\n\t\t\tfmt.Printf(\"%d\", sum%2)\n\t\t}\n\t\tfmt.Printf(\"\\n\")\n\t}\n}\n", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "0c01b30102476e37d20927aab1dc5b27", "src_uid": "b045abf40c75bb66a80fd6148ecc5bd6", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "//13A\npackage main\nimport \"fmt\"\n\nfunc main() {\n\tvar aa, k, l, ttl int\n\tfmt.Scan(&aa)\n\tfor i:=2; i<aa; i++ {\n\t\tk=aa\n\t\tfor k>0 {\n\t\t\tttl=ttl+(k%i)\n\t\t\tk/=i\n\t\t\tif k<i {\n\t\t\t\tttl=ttl+k\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\tl=aa-2\n\tfor i:=l; i>1; i-- {\n\t\tif ttl%i==0 && l%i==0 {\n\t\t\tttl/=i\n\t\t\tl/=i\n\t\t\tbreak\n\t\t}\n\t}\n\tfmt.Print(ttl,\"/\",l)\n\tfmt.Println()\n}", "lang_cluster": "Go", "tags": ["math", "implementation"], "code_uid": "8105203ababb22baff1f9057916f8f11", "src_uid": "1366732dddecba26db232d6ca8f35fdc", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "\npackage main\n\nimport (\n\t\"bufio\"\n\t\"os\"\n\t\"strconv\"\n\t\"fmt\"\n)\n\nvar a [9]int64\nvar helper SHelper\n\nfunc main() {\n\thelper.Init()\n\n\tfor k := uint64(1); k <= 8; k++ {\n\t\tl := (1 << k) - 1 // shift count type int64, must be unsigned integer\t\t\n\t\tr := 1 << (k - 1)\n\t\tv := l * r\n\t\ta[k] = int64(v)\n\t}\n\n\tn := helper.ReadInt64()\n\tfor k := int64(8); k >= 1; k-- {\n\t\tif n >= a[k] && n % a[k] == 0 {\n\t\t\tfmt.Println(a[k])\n\t\t\treturn\n\t\t}\n\t}\n}\n\ntype SHelper struct {\n\tfile *os.File\n\tscanner *bufio.Scanner\n}\n\nfunc (this *SHelper) Init() {\n\tthis.file = os.Stdin\n\tthis.scanner = bufio.NewScanner(this.file)\n\tthis.scanner.Split(bufio.ScanWords)\n}\n\nfunc (this *SHelper) ReadInt64() int64 {\n\tthis.scanner.Scan()\n\tn, err:= strconv.ParseInt(this.scanner.Text(), 10, 64)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn n\n}\n", "lang_cluster": "Go", "tags": ["brute force", "implementation"], "code_uid": "b5046d8ef0c0549f7b7ac8407d673b7d", "src_uid": "339246a1be81aefe19290de0d1aead84", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n\t\"bufio\"\n\t\"os\"\n\t\"strconv\"\n\t\"sort\"\n)\n\nvar scanner = bufio.NewScanner(os.Stdin)\nvar writer = bufio.NewWriter(os.Stdout)\n\n//Wrong\nfunc main() {\n\tdefer writer.Flush()\n\tscanner.Split(bufio.ScanWords)\n\n\tn := nextInt()\n\n\ta := make([]int, n)\n\n\tfor i := range a {\n\t\ta[i] = nextInt()\n\t}\n\n\tsort.Ints(a)\n\t\n\tfor i := range a{\n\t\tprint(a[i], \" \")\n\t}\n}\n\nfunc next() string {\n\tif !scanner.Scan() {\n\t\tpanic(\"Scan error\")\n\t}\n\treturn scanner.Text()\n}\n\nfunc nextInt() int {\n\tn, err := strconv.Atoi(next())\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn n\n}\n\nfunc nextFloat() float64 {\n\tn, err := strconv.ParseFloat(next(), 64)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn n\n}\n\nfunc println(a ...interface{}) {\n\tfmt.Fprintln(writer, a...)\n}\n\nfunc print(a ...interface{}) {\n\tfmt.Fprint(writer, a...)\n}", "lang_cluster": "Go", "tags": ["sortings", "implementation", "greedy"], "code_uid": "1bb70dad2b03e6c2e3710c758a855f7b", "src_uid": "ae20712265d4adf293e75d016b4b82d8", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n\t\"math\"\n)\n\nvar allLuckNumber[] int64\n\nfunc dfs(dep int, number int64, num4, num7 int){\n\tif num4 == num7{\n\t\tallLuckNumber = append(allLuckNumber, number)\n\t}\n\tif dep > 10{\n\t\treturn;\n\t}\n\tdfs(dep + 1, number * 10 + 4, num4 + 1, num7)\n\tdfs(dep + 1, number * 10 + 7, num4, num7 + 1)\n}\n\nfunc main(){\n\tvar n, ans int64\n\tans = math.MaxInt64\n\tdfs(0, 4, 1, 0)\n\tdfs(0, 7, 0 ,1)\n\tfmt.Scan(&n)\n\tfor _,each := range allLuckNumber{\n\t\tif each >= n && each < ans{\n\t\t\tans = each\n\t\t}\n\t}\n\tfmt.Println(ans)\n\n}\n", "lang_cluster": "Go", "tags": ["brute force", "binary search", "bitmasks"], "code_uid": "14bb1ebc80e266b19b8fe0047be76d91", "src_uid": "77b5f83cdadf4b0743618a46b646a849", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n)\n\ntype pair struct {\n\tlocation int\n\tdist     int\n}\n\nfunc main() {\n\tvar n, m int\n\tfmt.Scanf(\"%d%d\", &n, &m)\n\n\tif n >= m {\n\t\tfmt.Println(n - m)\n\t} else {\n\t\tvisited := make([]bool, m+2)\n\n\t\tqueue := make([]pair, 1)\n\t\tqueue[0] = pair{n, 0}\n\n\t\tans := 0\n\t\tvisited[n] = true\n\t\tfor {\n\t\t\t// pop front element\n\t\t\ttmp := queue[0]\n\t\t\tqueue = queue[1:]\n\t\t\t// copy(queue[0:len(queue)-1], queue[1:])\n\n\t\t\tif tmp.location == m { // reached destination\n\t\t\t\tans = tmp.dist\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\t// adist neighbors to the queue\n\t\t\tif tmp.location*2 <= m+1 && visited[tmp.location*2] == false {\n\t\t\t\tqueue = append(queue, pair{tmp.location * 2, tmp.dist + 1})\n\t\t\t\tvisited[tmp.location*2] = true\n\t\t\t}\n\t\t\tif tmp.location-1 >= 0 && visited[tmp.location-1] == false {\n\t\t\t\tqueue = append(queue, pair{tmp.location - 1, tmp.dist + 1})\n\t\t\t\tvisited[tmp.location-1] = true\n\t\t\t}\n\t\t}\n\n\t\tfmt.Println(ans)\n\t}\n}\n", "lang_cluster": "Go", "tags": ["dfs and similar", "shortest paths", "math", "graphs", "greedy", "implementation"], "code_uid": "a44e8f5bc133bbb25a1255f7d6aaab92", "src_uid": "861f8edd2813d6d3a5ff7193a804486f", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n)\n\nvar (\n\tbufin  = bufio.NewReader(os.Stdin)\n\tbufout = bufio.NewWriter(os.Stdout)\n)\n\nfunc printf(f string, a ...interface{}) { fmt.Fprintf(bufout, f, a...) }\nfunc scanf(f string, a ...interface{})  { fmt.Fscanf(bufin, f, a...) }\n\n/*\nf(x) = 2*x - .5\n4*x - 1.5\n2^(n+1) x - (2^n - 1)\n*/\n\nconst M = 1000000007\n\nfunc main() {\n\tdefer bufout.Flush()\n\tvar N, K uint64\n\tscanf(\"%d%d\", &N, &K)\n\tif N == 0 {\n\t\tprintf(\"0\\n\")\n\t\treturn\n\t}\n\tN = (2*N - 1) % M\n\tz := getx(K)\n\tprintf(\"%d\\n\", (int64(z)*int64(N)+1)%M)\n}\n\nfunc getx(N uint64) int {\n\tif N < 30 {\n\t\treturn 1 << N\n\t}\n\tif N%2 == 0 {\n\t\tY := getx(N >> 1)\n\t\treturn int(int64(Y) * int64(Y) % M)\n\t}\n\treturn getx(N-1) * 2 % M\n}\n", "lang_cluster": "Go", "tags": ["math"], "code_uid": "e37d1419de134f39c1d1671bbd11bbb9", "src_uid": "e0e017e8c8872fc1957242ace739464d", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n)\n\nconst Mod = 998244353\n\nfunc main() {\n\tdefer _w.Flush()\n\tsolve()\n}\nfunc solve() {\n\tn, x := ReadInt(), ReadInt()\n\n\tvar pow [501][501]int64\n\tfor i := int64(0); i < 501; i++ {\n\t\tpow[i][0] = 1\n\t\tfor j := 0; j < 500; j++ {\n\t\t\tpow[i][j+1] = pow[i][j] * i % Mod\n\t\t}\n\t}\n\n\tvar dp [501][501]int64\n\tfor i := 2; i <= n; i++ {\n\t\tjj := Min(x, i-1)\n\t\tfor j := 1; j <= jj; j++ {\n\t\t\t// dp[i][j] = j^i - (j-1)^i\n\t\t\tdp[i][j] = pow[j][i] - pow[j-1][i]\n\t\t\tdp[i][j] %= Mod\n\t\t}\n\t}\n\n\tfor i := 2; i <= n; i++ {\n\t\tfor j := 1; j <= x; j++ {\n\t\t\tif dp[i][j] == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfor k := 0; k <= n-i; k++ {\n\t\t\t\tnj := j + i + k - 1\n\t\t\t\tif nj > x {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tdp[i+k][nj] += dp[i][j] * pow[i+k-1][k] % Mod * ModCombination(i+k, k)\n\t\t\t\tdp[i+k][nj] %= Mod\n\t\t\t}\n\t\t}\n\t}\n\n\tans := int64(0)\n\tfor j := 1; j <= x; j++ {\n\t\tans += dp[n][j]\n\t\tans %= Mod\n\t}\n\tprintln(((ans % Mod) + Mod) % Mod)\n}\n\nfunc ModCombination(n, k int) (ret int64) {\n\tif n < k {\n\t\treturn 0\n\t}\n\tfor ret = 1; n > 0 || k > 0; n, k = n/Mod, k/Mod {\n\t\tret = ret * fac[n%Mod] % Mod * finv[k%Mod] % Mod * finv[(n-k)%Mod] % Mod\n\t}\n\treturn\n}\n\nconst MAX = 500\n\nvar fac, finv, inv [MAX + 1]int64\n\nfunc init() {\n\tfac[int64(0)], fac[int64(1)], finv[int64(0)], finv[int64(1)], inv[int64(1)] = int64(1), int64(1), int64(1), int64(1), int64(1)\n\tfor i := int64(2); i <= MAX; i++ {\n\t\tfac[i], inv[i] = fac[i-int64(1)]*i%Mod, Mod-inv[Mod%i]*(Mod/i)%Mod\n\t\tfinv[i] = finv[i-int64(1)] * inv[i] % Mod\n\t}\n}\n\nfunc Min(a, b int) int {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}\n\nvar _r, _w = bufio.NewReader(os.Stdin), bufio.NewWriter(os.Stdout)\n\nfunc ReadString() (s string)   { fmt.Fscan(_r, &s); return }\nfunc ReadInt() (i int)         { fmt.Fscan(_r, &i); return }\nfunc print(a ...interface{})   { fmt.Fprint(_w, a...) }\nfunc println(a ...interface{}) { fmt.Fprintln(_w, a...) }\nfunc prints(s []int64)         { v := fmt.Sprint(s); println(v[int64(1) : int64(len(v))-int64(1)]) }\n", "lang_cluster": "Go", "tags": ["math", "dp", "combinatorics"], "code_uid": "c341700583183bbaa01403d25a6731bd", "src_uid": "1908d1c8c6b122a4c6633a7af094f17f", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n\t\"sort\"\n)\n\nfunc next_permutation(idx []int) bool {\n\tn := len(idx)\n\tfor i := n - 1; i >= 1; i-- {\n\t\tif idx[i] > idx[i-1] {\n\t\t\tidx[i], idx[i-1] = idx[i-1], idx[i]\n\t\t\tsort.Ints(idx[i:])\n\t\t\treturn true\n\t\t}\n\t}\n\n\treturn false\n}\n\nfunc main() {\n\tvar n, a, b int\n\tfmt.Scanf(\"%d\\n%d\\n%d\", &n, &a, &b)\n\tframes := make([]int, 6)\n\tidxs := make([]int, 6)\n\tfor i := 0; i < 6; i++ {\n\t\tif i < 4 {\n\t\t\tframes[i] = a\n\t\t} else {\n\t\t\tframes[i] = b\n\t\t}\n\t\tidxs[i] = i\n\t}\n\n\tbestAnswer := 6\n\tfor {\n\t\tcount, leftover := 0, 0\n\t\tfor i := 0; i < 6; i++ {\n\t\t\tif leftover < frames[idxs[i]] {\n\t\t\t\tcount++\n\t\t\t\tleftover = n\n\t\t\t}\n\t\t\tleftover -= frames[idxs[i]]\n\t\t}\n\t\tif count < bestAnswer {\n\t\t\tbestAnswer = count\n\t\t}\n\t\tif !next_permutation(idxs) {\n\t\t\tbreak\n\t\t}\n\t}\n\n\tfmt.Println(bestAnswer)\n}\n", "lang_cluster": "Go", "tags": ["greedy", "implementation"], "code_uid": "d8060a1cb3f10e9350605d905151a3bc", "src_uid": "1a50fe39e18f86adac790093e195979a", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "// 219B\npackage main\n\nimport (\n\t\"fmt\"\n)\n\nfunc main() {\n\tvar p, d, t, ans int64\n\tfmt.Scan(&p, &d)\n\tp++\n\tans = p\n\tfor t = 10; ; t *= 10 {\n\t\tif p%t > d {\n\t\t\tbreak\n\t\t}\n\t\tans = p - p%t\n\t}\n\tfmt.Print(ans - 1)\n}\n", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "8ef7499785a122414e59dc2206ea1ec6", "src_uid": "c706cfcd4c37fbc1b1631aeeb2c02b6a", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n)\n\nfunc main() {\n\tin := bufio.NewReader(os.Stdin)\n\tout := bufio.NewWriter(os.Stdout)\n\tdefer out.Flush()\n\tn, m, h := 0, 0, 0\n\tfmt.Fscanf(in, \"%d %d %d\\n\", &n, &h, &m)\n\ta := make([]int, n)\n\tfor i := 0; i < n; i++ {\n\t\ta[i] = h\n\t}\n\tfor i := 0; i < m; i++ {\n\t\tl, r, res := 0, 0, 0\n\t\tfmt.Fscanf(in, \"%d %d %d\\n\", &l, &r, &res)\n\t\tl--\n\t\tr--\n\t\tfor j := l; j <= r; j++ {\n\t\t\t//fmt.Println(j)\n\t\t\tif a[j] > res {\n\t\t\t\ta[j] = res\n\t\t\t}\n\t\t}\n\t}\n\tans := 0\n\tfor i := 0; i < n; i++ {\n\t\tans += a[i] * a[i]\n\t}\n\t//fmt.Println(odd1, odd2, even1, even2)\n\tfmt.Fprintf(out, \"%d\\n\", ans)\n\treturn\n}\nfunc minstep(a, b byte) int {\n\treturn min(int(a-b+26)%26, int(b-a+26)%26)\n}\n\nfunc min(a, b int) int {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}\n", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "fbd04bc8cf4f70f6e7f268cc14ca68b1", "src_uid": "f22b6dab443f63fb8d2d288b702f20ad", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"math\"\n\t\"math/big\"\n\t\"os\"\n)\n\n/*\n1\n1 1\n1 2\n2 1\n2 3\n---\n0\n0\n2 [0,1], [1,0]\nX [0,7], [7,0],\n\n*/\n\n//goland:noinspection GoUnhandledErrorResult\nfunc main() {\n\tdefer writer.Flush()\n\n\tt := 1\n\tscanf(\"%d\\n\", &t)\n\n\tfor ; t > 0; t-- {\n\t\tvar n, k int64\n\t\tscanf(\"%d %d\\n\", &n, &k)\n\n\t\tans := big.NewInt(0).Exp(big.NewInt(n), big.NewInt(k), big.NewInt(1e9+7)).Int64()\n\n\t\tfmt.Fprintln(writer, ans)\n\t}\n}\n\nconst maxUint = ^uint(0)\n\n//goland:noinspection GoUnusedConst\nconst minUint = 0\nconst maxInt = int(maxUint >> 1)\n\n//goland:noinspection GoUnusedConst\nconst minInt = -maxInt - 1\n\nvar reader = bufio.NewReader(os.Stdin)\nvar writer = bufio.NewWriter(os.Stdout)\n\nfunc scanf(f string, a ...interface{}) {\n\tif _, err := fmt.Fscanf(reader, f, a...); err != nil {\n\t\tpanic(err)\n\t}\n}\n\n//goland:noinspection GoUnusedFunction\nfunc reversed(s string) string {\n\tinput := []rune(s)\n\tli := len(input)\n\tret := make([]rune, li)\n\tfor i, r := range input {\n\t\tret[li-i-1] = r\n\t}\n\treturn string(ret)\n}\n\n//goland:noinspection GoUnusedFunction\nfunc divCeil(num, div int) int {\n\tquot := num / div\n\tif num%div != 0 {\n\t\tquot++\n\t}\n\treturn quot\n}\n\n//goland:noinspection GoUnusedFunction\nfunc min(nums ...int) int {\n\tminimum := nums[0]\n\tfor _, num := range nums {\n\t\tif num < minimum {\n\t\t\tminimum = num\n\t\t}\n\t}\n\treturn minimum\n}\n\n//goland:noinspection GoUnusedFunction\nfunc max(nums ...int) int {\n\tmaximum := nums[0]\n\tfor _, num := range nums {\n\t\tif num > maximum {\n\t\t\tmaximum = num\n\t\t}\n\t}\n\treturn maximum\n}\n\n//goland:noinspection GoUnusedFunction\nfunc abs(num int) int {\n\tif num < 0 {\n\t\treturn -num\n\t}\n\treturn num\n}\n\n//goland:noinspection GoUnusedFunction\nfunc isPrime(num int) bool {\n\tif num == 2 || num == 3 {\n\t\treturn true\n\t}\n\n\tif num <= 1 || num%2 == 0 || num%3 == 0 {\n\t\treturn false\n\t}\n\n\tfor i := 5; i*i <= num; i += 6 {\n\t\tif num%i == 0 || num%(i+2) == 0 {\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\n\n//goland:noinspection GoUnusedFunction\nfunc gcd(a, b int) int {\n\tfor b != 0 {\n\t\ta, b = b, a%b\n\t}\n\treturn a\n}\n\n//goland:noinspection GoUnusedFunction\nfunc lcm(a, b int) int {\n\treturn abs(a) / gcd(a, b) * abs(b)\n}\n\n// Examples:\n//\tdigitAt(1234, -1) -> panic!\n//\tdigitAt(1234, 0) -> 4\n//\tdigitAt(1234, 1) -> 3\n//\tdigitAt(1234, 2) -> 2\n//\tdigitAt(1234, 3) -> 1\n//\tdigitAt(1234, 4) -> panic!\n//goland:noinspection GoUnusedFunction\nfunc digitAt(num, pos int) int {\n\tif num == 0 {\n\t\treturn 0\n\t}\n\n\tnum = abs(num)\n\n\tlenNum := int(math.Log10(float64(num))) + 1\n\tif pos < 0 || pos >= lenNum {\n\t\terr := fmt.Sprintf(\"Out of bound access for digit. Position passed %d, number %d\", pos, num)\n\t\tpanic(err)\n\t}\n\n\trem := num % int(math.Pow10(pos+1))\n\treturn rem / int(math.Pow10(pos))\n}\n", "lang_cluster": "Go", "tags": ["math", "combinatorics", "bitmasks"], "code_uid": "e91976b59ce4d49a774bc305e02f9641", "src_uid": "2e7a9f3a97938e4a7e036520d812b97a", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"sort\"\n\t\"strconv\"\n)\n\nfunc cube(x int) int64 {\n\treturn int64(x) * int64(x) * int64(x)\n}\n\nfunc foo(n int64) int64 {\n\tvar ans int64\n\tfor k := 2; ; k++ {\n\t\tx := n / cube(k)\n\t\tif x == 0 {\n\t\t\tbreak\n\t\t}\n\t\tans += x\n\t}\n\treturn ans\n}\n\n// najmniejszy argument, dla ktorego f(arg) zwraca prawde\n// funkcja logiczna powinna byc niemalejaca\nfunc bin_search(f func(int64) bool, lo, up, eps int64) int64 {\n\tup++\n\tcnt := up - lo\n\tvar mid, step int64\n\tfor cnt >= eps {\n\t\tstep = cnt / 2\n\t\tmid = lo + step\n\t\tif !f(mid) {\n\t\t\tlo = mid + eps\n\t\t\tcnt -= step + eps\n\t\t} else {\n\t\t\tcnt = step\n\t\t}\n\t}\n\treturn lo\n}\n\nfunc main() {\n\tm := getInt64()\n\tmx := int64(4949100894494448)\n\tx := func(n int64) bool {\n\t\treturn foo(n) >= m\n\t}\n\n\tp := bin_search(x, 1, mx, 1)\n\n\tif foo(p) != m {\n\t\tp = -1\n\t}\n\n\tfmt.Println(p)\n}\n\ntype Input struct {\n\t*bufio.Scanner\n}\n\nvar globalInput = wrapStdin()\n\nfunc wrapStdin() Input {\n\tsc := bufio.NewScanner(os.Stdin)\n\tsc.Split(bufio.ScanWords)\n\treturn Input{Scanner: sc}\n}\nfunc getInt64() int64 {\n\tglobalInput.Scan()\n\tx, _ := strconv.ParseInt(globalInput.Text(), 10, 64)\n\treturn x\n}\nfunc getInt() int {\n\tglobalInput.Scan()\n\tx, _ := strconv.Atoi(globalInput.Text())\n\treturn x\n}\nfunc getIntOk() (int, bool) {\n\tok := globalInput.Scan()\n\tx, _ := strconv.Atoi(globalInput.Text())\n\treturn x, ok\n}\nfunc getNint(n int) []int {\n\tv := make([]int, n)\n\tfor i := 0; i < n; i++ {\n\t\tv[i] = getInt()\n\t}\n\treturn v\n}\nfunc getVint(v []int) bool {\n\tvar ok bool\n\tfor i := 0; i < len(v); i++ {\n\t\tv[i], ok = getIntOk()\n\t}\n\treturn ok\n}\nfunc getWord() string {\n\tglobalInput.Scan()\n\treturn globalInput.Text()\n}\nfunc getWordOk() (string, bool) {\n\tok := globalInput.Scan()\n\treturn globalInput.Text(), ok\n}\n\nfunc min(a, b int) int {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}\nfunc max(a, b int) int {\n\tif a < b {\n\t\treturn b\n\t}\n\treturn a\n}\nfunc min64(a, b int64) int64 {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}\nfunc max64(a, b int64) int64 {\n\tif a < b {\n\t\treturn b\n\t}\n\treturn a\n}\nfunc minStr(a, b string) string {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}\nfunc maxStr(a, b string) string {\n\tif a < b {\n\t\treturn b\n\t}\n\treturn a\n}\nfunc remin(a *int, b int) bool {\n\tif b < *a {\n\t\t*a = b\n\t\treturn true\n\t}\n\treturn false\n}\nfunc remax(a *int, b int) bool {\n\tif b > *a {\n\t\t*a = b\n\t\treturn true\n\t}\n\treturn false\n}\nfunc remin64(a *int64, b int64) bool {\n\tif b < *a {\n\t\t*a = b\n\t\treturn true\n\t}\n\treturn false\n}\nfunc remax64(a *int64, b int64) bool {\n\tif b > *a {\n\t\t*a = b\n\t\treturn true\n\t}\n\treturn false\n}\nfunc reminStr(a *string, b string) bool {\n\tif b < *a {\n\t\t*a = b\n\t\treturn true\n\t}\n\treturn false\n}\nfunc remaxStr(a *string, b string) bool {\n\tif b > *a {\n\t\t*a = b\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc abs(x int) int {\n\tif x < 0 {\n\t\treturn -x\n\t}\n\treturn x\n}\nfunc abs64(x int64) int64 {\n\tif x < 0 {\n\t\treturn -x\n\t}\n\treturn x\n}\n\ntype (\n\tFLess    func(i, j int) bool\n\tFSwap    func(i, j int)\n\twrapSort struct {\n\t\tLength int\n\t\tFLess\n\t\tFSwap\n\t}\n)\n\nfunc (w *wrapSort) Len() int           { return w.Length }\nfunc (w *wrapSort) Less(i, j int) bool { return w.FLess(i, j) }\nfunc (w *wrapSort) Swap(i, j int)      { w.FSwap(i, j) }\nfunc wsort(length int, fless func(i, j int) bool, fswap func(i, j int)) {\n\tsort.Sort(&wrapSort{length, fless, fswap})\n}\n", "lang_cluster": "Go", "tags": ["math", "binary search", "combinatorics"], "code_uid": "c8abb2181675fdc9cc780cd8413f1910", "src_uid": "602deaad5c66e264997249457d555129", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n\t\"sort\"\n)\n\nconst mod = 998244353\nconst N = 5000\n\nvar factor = [N + 1][]int{}\nvar primes = []int64{}\n\nfunc comb(m int, n int) int64 {\n\tres := int64(1)\n\tfnm := make([]int, len(primes))\n\tcopy(fnm, factor[n])\n\tfor i, x := range factor[m] {\n\t\tfnm[i] += x\n\t}\n\tfor w := 1; w <= m; w++ {\n\t\tr := int64(1)\n\t\tfor i, p := range primes {\n\t\t\tfor pw := fnm[i] - factor[w][i] - factor[n-w][i] -\n\t\t\t\tfactor[m-w][i]; pw > 0; pw >>= 1 {\n\t\t\t\tif pw&1 == 1 {\n\t\t\t\t\tr = r * p % mod\n\t\t\t\t}\n\t\t\t\tp = p * p % mod\n\t\t\t}\n\t\t}\n\t\tres += r\n\t}\n\treturn res % mod\n}\n\nfunc main() {\n\tabc := []int{0, 0, 0}\n\tfmt.Scan(&abc[0], &abc[1], &abc[2])\n\tsort.Ints(abc)\n\tsieve := [N + 1]bool{true, true}\n\tfor p := range sieve {\n\t\tif !sieve[p] {\n\t\t\tprimes = append(primes, int64(p))\n\t\t\tfor q := p * p; q <= N; q += p {\n\t\t\t\tsieve[q] = true\n\t\t\t}\n\t\t}\n\t}\n\tfor j := range factor {\n\t\tfactor[j] = make([]int, len(primes))\n\t}\n\tfor i, p := range primes {\n\t\tfor pp := p; pp <= N; pp *= p {\n\t\t\tfor j := pp; j <= N; j += pp {\n\t\t\t\tfactor[j][i]++\n\t\t\t}\n\t\t}\n\t}\n\ta := factor[0]\n\tfor _, b := range factor {\n\t\tfor i, x := range a {\n\t\t\tb[i] += x\n\t\t}\n\t\ta = b\n\t}\n\tfmt.Println(comb(abc[0], abc[1]) * comb(abc[0], abc[2]) % mod * comb(abc[1], abc[2]) % mod)\n}\n", "lang_cluster": "Go", "tags": ["math", "dp", "combinatorics"], "code_uid": "4664325d2a1b16d09549adca4b502deb", "src_uid": "b6dc5533fbf285d5ef4cf60ef6300383", "difficulty": 1800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n)\n\nconst INF  = 1000000001\n\ntype Pair struct {\n\tfirst, second int\n}\n\nfunc sort(arr []int) []int {\n\tif len(arr) < 2 {\n\t\treturn arr\n\t}\n\tleft := 0\n\tright := len(arr) - 1\n\tpivot := len(arr) / 2\n\n\tarr[pivot], arr[right] = arr[right], arr[pivot]\n\n\tfor i := 0; i < len(arr); i++ {\n\t\tif arr[i] < arr[right] {\n\t\t\tarr[i], arr[left] = arr[left], arr[i]\n\t\t\tleft++\n\t\t}\n\t}\n\n\tarr[left], arr[right] = arr[right], arr[left]\n\n\tsort(arr[:left])\n\tsort(arr[left+1:])\n\treturn arr\n}\n\nfunc check(n int) bool {\n\tvar s int\n\tfor n > 0 {\n\t\ts += n % 10\n\t\tn /= 10\n\t}\n\treturn s == 10\n}\n\nfunc solution(reader io.Reader, writer io.Writer) {\n\tvar k int\n\tfmt.Fscanf(reader, \"%d\\n\", &k)\n\tfor i := 19; k > 0; i++ {\n\t\tif check(i) {\n\t\t\tk--\n\t\t}\n\t\tif k == 0 {\n\t\t\tfmt.Println(i)\n\t\t\treturn\n\t\t}\n\t}\n}\n\nfunc main() {\n\n\t//stdin, err := os.Open(\"file.in\")\n\t//if err != nil {\n\t//\tpanic(err)\n\t//}\n\t//defer stdin.Close()\n\tstdin := os.Stdin\n\treader := bufio.NewReaderSize(stdin, 1024*1024)\n\n\t//stdout, err := os.Create(\"file.out\")\n\t//if err != nil {\n\t//\tpanic(err)\n\t//}\n\t//defer stdout.Close()\n\tstdout := os.Stdout\n\twriter := bufio.NewWriterSize(stdout, 1024*1024)\n\tdefer writer.Flush()\n\n\tsolution(reader, writer)\n}", "lang_cluster": "Go", "tags": ["brute force", "dp", "binary search", "implementation", "number theory"], "code_uid": "f10ab01b556823a67707fa55248d3fbd", "src_uid": "0a98a6a15e553ce11cb468d3330fc86a", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n)\n\nvar (\n\treader  = bufio.NewReader(os.Stdin)\n\twriter  = bufio.NewWriter(os.Stdout)\n\tscanner = bufio.NewScanner(os.Stdin)\n)\n\n//Wrong\nfunc main() {\n\tdefer writer.Flush()\n\tscanner.Split(bufio.ScanWords)\n\n\tv1, v2, t, d := nextInt(), nextInt(), nextInt(), nextInt()\n\tpath, maxSpeed := 0, 0\n\n\tfor ; t > 0; t-- {\n\t\tpath += v1\n\t\tmaxSpeed = v2+d*(t-2)\n\t\t// println(path, v1, maxSpeed)\n\n\t\tif maxSpeed > v1 {\n\t\t\tif v1+d > maxSpeed {\n\t\t\t\tv1 = maxSpeed\n\t\t\t} else {\n\t\t\t\tv1 += d\n\t\t\t}\n\t\t} else if maxSpeed < v1 {\n\t\t\tif v1-d < maxSpeed {\n\t\t\t\tv1 = maxSpeed\n\t\t\t} else {\n\t\t\t\tv1 -= d\n\t\t\t}\n\t\t}\n\t}\n\n\tprintln(path)\n}\n\nfunc scan(a ...interface{}) {\n\tfmt.Fscan(reader, a...)\n}\n\nfunc next() string {\n\tif !scanner.Scan() {\n\t\tpanic(\"Scan error\")\n\t}\n\treturn scanner.Text()\n}\n\nfunc nextInt64() int64 {\n\tn, _ := strconv.ParseInt(next(), 0, 64)\n\treturn n\n}\n\nfunc nextInt() int {\n\tn, _ := strconv.Atoi(next())\n\treturn n\n}\n\nfunc nextFloat() float64 {\n\tn, _ := strconv.ParseFloat(next(), 64)\n\treturn n\n}\n\nfunc println(a ...interface{}) {\n\tfmt.Fprintln(writer, a...)\n}\n\nfunc printf(format string, a ...interface{}) {\n\tfmt.Fprintf(writer, format, a...)\n}\n", "lang_cluster": "Go", "tags": ["math", "greedy", "dp"], "code_uid": "7b8c78097f55389f32df016f77dc79be", "src_uid": "9246aa2f506fcbcb47ad24793d09f2cf", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n)\n\nfunc main() {\n\tvar n int\n\tvar x, y int64\n\tfmt.Scan(&n, &x, &y)\n\tdp := make([]int64, 2*n+1)\n\tdp[1] = x;\n\tfor i := 2; i <= n; i++ {\n\t\tdp[i] = min(dp[i-1]+x, dp[(i+1)/2]+y+int64(i%2)*x)\n\t\tdp[i-1] = min(dp[i-1], dp[i]+x)\n\t}\n\n\tfmt.Println(dp[n])\n}\n\nfunc min(a, b int64) int64 {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}\n", "lang_cluster": "Go", "tags": ["dfs and similar", "dp"], "code_uid": "5b3efa1df6a51a89da7999189c390740", "src_uid": "0f270af00be2a523515d5e7bd66800f6", "difficulty": 2000.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n)\n\nfunc main() {\n\tvar n, ans int\n\tfmt.Scanln(&n)\n\n\ta := make([]int, n)\n\tx := make([]interface{}, n)\n\tfor i := range a {\n\t\tx[i] = &a[i]\n\t}\n\tfmt.Scanln(x...)\n\n\tfor i := 0; i < n; i++ {\n\t\tans += a[i]\n\t}\n\tans /= n\n\tfmt.Println(ans)\n}\n", "lang_cluster": "Go", "tags": ["sortings", "implementation"], "code_uid": "fe165ccf7f06a4b0a549e67357748204", "src_uid": "f03773118cca29ff8d5b4281d39e7c63", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"os\"\n\t\"strconv\"\n\t\"strings\"\n\t\"fmt\"\n)\n\nfunc main() {\n\tvar line string\n\tvar max int64\n\tvar start [14]int64\n\tvar end [14]int64\n\treader := bufio.NewReader(os.Stdin)\n\tline, _ = reader.ReadString('\\n')\n\tarrStartStrings := strings.Split(strings.TrimSpace(line), \" \")\n\tfor i, v := range arrStartStrings {\n\t\tstart[i], _ = strconv.ParseInt(v, 10, 0)\n\t}\n\tfor i := 0; i < 14; i++ {\n\t\tend[i] = igra(start, i)\n\t}\n\tfor i := 0; i < 14; i++ {\n\t\tif max < end[i]{\n\t\t\tmax=end[i]\n\t\t}\n\t}\n\tfmt.Println(max)\n}\n\nfunc igra(start [14]int64, i int) int64 {\n\tvar n, addToAll, result int64\n\tn = start[i]\n\tstart[i] = 0\n\tif n == 0 {\n\t\treturn 0\n\t}\n\taddToAll = n / 14\n\tn = n % 14\n\tfor i := 0; i < 14; i++ {\n\t\tstart[i] += addToAll\n\t}\n\tfor n != 0 {\n\t\tif i+1 == 14 {\n\t\t\ti = 0\n\t\t} else {\n\t\t\ti++\n\t\t}\n\t\tstart[i]++\n\t\tn--\n\t}\n\tfor i := 0; i < 14; i++ {\n\t\tif start[i]%2==0{\n\t\t\tresult+=start[i]\n\t\t}\n\t}\n\treturn result\n}", "lang_cluster": "Go", "tags": ["brute force", "implementation"], "code_uid": "a62c2cfde03a7d017d48d54b134943f3", "src_uid": "1ac11153e35509e755ea15f1d57d156b", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\nimport (\n\t\"fmt\"\n)\n\nfunc main() {\n\tvar n int\n\tfmt.Scan(&n)\n\td:=n%10\n\tif d>=5 {\n\t\tfmt.Print(\"-O|\")\n\t} else {\n\t\tfmt.Print(\"O-|\")\n\t}\n\td%=5\n\tfor i:=0;i<d;i++ {\n\t\tfmt.Print(\"O\")\n\t}\n\tfmt.Print(\"-\")\n\tfor i:=4-d;i>0;i-- {\n\t\tfmt.Print(\"O\")\n\t}\n\tfmt.Println()\n\tn/=10\n\n\tfor ;n>0; {\n\t\td:=n%10\n\tif d>=5 {\n\t\tfmt.Print(\"-O|\")\n\t} else {\n\t\tfmt.Print(\"O-|\")\n\t}\n\td%=5\n\tfor i:=0;i<d;i++ {\n\t\tfmt.Print(\"O\")\n\t}\n\tfmt.Print(\"-\")\n\tfor i:=4-d;i>0;i-- {\n\t\tfmt.Print(\"O\")\n\t}\n\tfmt.Println()\n\tn/=10\n\t}\n}\n\n\n", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "7174112b786d0857f1ef90629c166305", "src_uid": "c2e3aced0bc76b6484360563355d23a7", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"os\"\n)\n\nvar reader *bufio.Reader = bufio.NewReader(os.Stdin)\nvar writer *bufio.Writer = bufio.NewWriter(os.Stdout)\n\nfunc printf(f string, a ...interface{}) { fmt.Fprintf(writer, f, a...) }\nfunc scanf(f string, a ...interface{})  { fmt.Fscanf(reader, f, a...) }\n\nvar n, m, mod int64\nvar matrix [][]int\n\nfunc multiply(one, two [][]int) [][]int {\n\tres := make([][]int, m)\n\tfor i := 0; i < int(m); i++ {\n\t\tres[i] = make([]int, m)\n\t}\n\tfor i := 0; i < int(m); i++ {\n\t\tfor j := 0; j < int(m); j++ {\n\t\t\tfor k := 0; k < int(m); k++ {\n\t\t\t\tres[i][j] += int(int64(one[i][k]) * int64(two[k][j]) % mod)\n\t\t\t\tres[i][j] %= int(mod)\n\t\t\t}\n\t\t}\n\t}\n\treturn res\n}\n\nfunc power(exp int64, base [][]int) [][]int {\n\n\tif exp == 1 {\n\t\treturn base\n\t}\n\n\tres := power(exp/2, base)\n\tres = multiply(res, res)\n\tif exp&1 == 1 {\n\t\tres = multiply(res, base)\n\t}\n\treturn res\n}\n\nfunc main() {\n\tdefer writer.Flush()\n\tmod = 1000000007\n\tscanf(\"%d %d\\n\", &n, &m)\n\tif n < m {\n\t\tprintf(\"1\")\n\t\treturn\n\t}\n\tif n == m {\n\t\tprintf(\"2\")\n\t\treturn\n\t}\n\tmatrix = make([][]int, m)\n\tfor i := 0; i < int(m); i++ {\n\t\tmatrix[i] = make([]int, m)\n\t}\n\tmatrix[0][0] = 1\n\tmatrix[0][m-1] = 1\n\tfor i := 1; i < int(m); i++ {\n\t\tmatrix[i][i-1] = 1\n\t}\n\n\tfmt.Println(power(n, matrix)[0][0])\n\n}\n", "lang_cluster": "Go", "tags": ["math", "matrices", "dp"], "code_uid": "bdd2d91b854ec023cc1b682eace3a693", "src_uid": "e7b9eec21d950f5d963ff50619c6f119", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Go", "source_code": "package main\n\nimport (\n\t\"fmt\"\n)\n\nfunc main() {\n\t// Read input.\n\tvar N int\n\tfmt.Scan(&N)\n\ta := make([]int, N)\n\tfor i := 0; i < N; i++ {\n\t\tvar tmp int\n\t\tfmt.Scan(&tmp)\n\t\ta[i] = tmp\n\t}\n\t// Start solving.\n\tif N == 1 && a[0] == 0 {\n\t\tfmt.Println(\"UP\")\n\t\treturn\n\t}\n\tif N == 1 && a[0] == 15 {\n\t\tfmt.Println(\"DOWN\")\n\t\treturn\n\t}\n\tif N == 1 && a[0] != 0 && a[0] != 15 {\n\t\tfmt.Println(-1)\n\t\treturn\n\t}\n\t// From here I assume a has more than two elements.\n\tif a[N-2] > a[N-1] && a[N-1] != 0 {\n\t\tfmt.Println(\"DOWN\")\n\t\treturn\n\t}\n\tif a[N-2] < a[N-1] && a[N-1] != 15 {\n\t\tfmt.Println(\"UP\")\n\t\treturn\n\t}\n\tif a[N-1] == 0 {\n\t\tfmt.Println(\"UP\")\n\t\treturn\n\t}\n\tif a[N-1] == 15 {\n\t\tfmt.Println(\"DOWN\")\n\t\treturn\n\t}\n}\n", "lang_cluster": "Go", "tags": ["implementation"], "code_uid": "3d0fa198a078e2e8b7737163cb377a39", "src_uid": "8330d9fea8d50a79741507b878da0a75", "difficulty": 1100.0, "exec_outcome": "PASSED"}