結果
問題 | No.276 連続する整数の和(1) |
ユーザー |
|
提出日時 | 2016-02-22 00:21:09 |
言語 | Go (1.23.4) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 2,779 bytes |
コンパイル時間 | 12,131 ms |
コンパイル使用メモリ | 238,428 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-10 22:13:11 |
合計ジャッジ時間 | 12,653 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
package mainimport ("bufio""fmt""math""os""strconv")var sc = bufio.NewScanner(os.Stdin)var rdr = bufio.NewReaderSize(os.Stdin, 1000000)func main() {sc.Split(bufio.ScanWords)n := nextInt()total := (n*(n+1))/2 - nfmt.Println(gcd(uint64(n), uint64(total)))}func nextLine() string {sc.Scan()return sc.Text()}func nextInt() int {i, _ := strconv.Atoi(nextLine())return i}func nextInt64() int64 {i, _ := strconv.ParseInt(nextLine(), 10, 64)return i}func nextUint64() uint64 {i, _ := strconv.ParseUint(nextLine(), 10, 64)return i}func nextFloat() float64 {f, _ := strconv.ParseFloat(nextLine(), 64)return f}func readLine() string {buf := make([]byte, 0, 1000000)for {l, p, e := rdr.ReadLine()if e != nil {panic(e)}buf = append(buf, l...)if !p {break}}return string(buf)}func factor(n uint64) []uint64 {if n <= 1 {return []uint64{n}}ps := make([]uint64, 0, 100)for i := uint64(2); i*i <= n; i++ {for n%i == 0 {n /= ips = append(ps, i)}}if n > 1 {ps = append(ps, n)}return ps}func gcd(a, b uint64) uint64 {for ; b != 0; b, a = a%b, b {}return a}func exGcd(x, y int64) (a, b, c int64) {if x <= 0 || y <= 0 {return}r0, r1 := x, ya0, a1 := int64(1), int64(0)b0, b1 := int64(0), int64(1)for r1 > 0 {q1, r2 := r0/r1, r0%r1a2, b2 := a0-q1*a1, b0-q1*b1r0, r1 = r1, r2a0, a1 = a1, a2b0, b1 = b1, b2}a, b, c = a0, b0, r0return}func chinese(a1, m1, a2, m2 int64) int64 {a, _, c := exGcd(m1, m2)if c != 1 {return -1}x := a1 + (a2-a1)*a*m1for x < 0 {x += m1 * m2}return x}func lcm(a, b uint64) uint64 {return (a * b) / gcd(a, b)}func round(f float64, place int) float64 {shift := math.Pow10(place)return math.Floor(f*shift+.5) / shift}func round1(f float64) float64 {return math.Floor(f + .5)}func bitCount(n int64) int64 {c := int64(0)for i := uint(0); i < 64; i++ {if n>>i&1 == 1 {c++}}return c}func powExp(n, e uint64) uint64 {a := uint64(1)for e > 0 {if e&1 == 1 {a *= n}n *= ne >>= 1}return a}func powMod(n, e, mod uint64) uint64 {a := uint64(1)for e > 0 {if e&1 == 1 {a *= na %= mod}n *= nn %= mode >>= 1}return a % mod}func eratosthenes(n int) []int {if n < 2 {return []int{}}r := int(math.Floor(math.Sqrt(float64(n))))list := make([]bool, n+1)list[0], list[1] = true, truefor i := 2; i <= r; i++ {if !list[i] {for j := i * i; j <= n; j += i {list[j] = true}}}l := n / int(math.Floor(math.Log(float64(n))))primes := make([]int, 0, l)for i, v := range list {if v {continue}primes = append(primes, i)}return primes}