402A - Nuts - CodeForces Solution

import collections
import heapq
import sys
import math
import itertools
import bisect
from io import BytesIO, IOBase
import os


def values(): return tuple(map(int, sys.stdin.readline().split()))


def inlst(): return [int(i) for i in sys.stdin.readline().split()]



def inp(): return int(sys.stdin.readline())


def inpstr(): return sys.stdin.readline().strip()


def words(): return [i for i in sys.stdin.readline().split()]


def chars(): return list(sys.stdin.readline().strip())


def solve():
    k,nut,b,v=values()
    req=math.ceil(nut/v)
    now=0
    tot=0
    while b>0 and now <req:
        m=min(k,b+1)
        now+=m
        b-=m-1
        tot+=1
            if now>=req:print(tot)
    else:
        print(tot+req-now)

if __name__ == "__main__":
                solve()