LumberUolevi

warning: unused import: `std::cmp::min`
 --> input/code.rs:1:5
  |
1 | use std::cmp::min;
  |     ^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unnecessary parentheses around `if` condition
  --> input/code.rs:36:7
   |
36 |     if(n == k) {
   |       ^      ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
36 -     if(n == k) {
36 +     if n == k {
   |

warning: unnecessary parentheses around `while` condition
  --> input/code.rs:37:15
   |
37 |         while (k>0) {
   |               ^   ^
   |
help: remove these parentheses
   |
37 -         while (k>0) {
37 +         while k>0 {
   |

warning: unnecessary parentheses around `if` condition
  --> input/code.rs:42:12
   |
42 |         if (k % 2 == 1) {
   |            ^          ^
   |
help: remove these parentheses
   |
42 -         if (k % 2 == 1) {
42 +         if k % 2 == 1 {
   |

warning: unnecessary parentheses around `while` condition
  --> input/cod...

use std::cmp::min;
use std::io::{self, Read};

macro_rules! input {
    ($it: expr) => {
        $it.next().unwrap().parse().unwrap()
    };
    ($it: expr, $T: ty) => {
        $it.next().unwrap().parse::<$T>().unwrap()
    };
}
/*
mod classes;
fn main() {
    // println!("{}", "-".repeat(20));
    classes::c02::task2();
    // println!("{}", "-".repeat(20));
}
// */

fn main() {
    task();
}

#[allow(dead_code)]
fn task() {
    let mut buf = String::new();
    io::stdin().read_to_string(&mut buf).unwrap();

    let mut it = buf.split_whitespace();

    let mut n: i64 = input!(it);
    let mut k: i64 = input!(it);
    let mut v: Vec<i64> = vec![];

    if(n == k) {
        while (k>0) {
            v.push(k);
            k-=1;
        }
    } else {
        if (k % 2 == 1) {
            v.push(n);
            k -= 1;
            n -= 1;
        } else {
            n -= 1;
        }
        let mut i = 1;
        while (k > 0) {
            v.push(i);
            v.push(n);
            i += 1;
            n -= 1;
            k -= 2;
        }


    }
    v.sort();
    for x in v {
        print!("{} ", x)
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED