Problem:


Score : 400 points

Problem Statement

Given are integers A, B, and N.

Find the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.

Here floor(t) denotes the greatest integer not greater than the real number t.

Constraints

1 ≤ A ≤ 10^{6}

1 ≤ B ≤ 10^{12}

1 ≤ N ≤ 10^{12}

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B N

Output

Print the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.

Sample Input 1

5 7 4

Sample Output 1

2

When x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.

Sample Input 2

11 10 9

Sample Output 2

9



Sample input:
5 7 4


Sample output:
2

Submission status: Accepted

Solution code:
A, B, N = map(int, input().split())

x = B-1
if B > N:
    x = N
ans = int(A*x/B) - A*int(x/B)
print(ans)

Submission status: Accepted

Solution code:
a,b,n= list(map(int, input().split()))
if b==1:
    print(0)
    exit(0)
ma=(a*n/b)//1-a*((n/b)//1)
for i in range(b-1,n+1,b):
    tmp=(a*i/b)//1-a*((i/b)//1)
    ma=max(tmp,ma)
print(int(ma))

Submission status: Accepted

Solution code:
a, b, n = map(int, input().split())


def fl(n):
    global a, b
    return (a * n) // b


def fr(n):
    global a, b
    return a * (n // b)


def f(n):
    return fl(n)-fr(n)


target = n - ((n+1) % b)

print(f(target) if target > 0 else f(n))

Submission status: Accepted

Solution code:
def floor(t):
    return int(t)

a,b,n = map(int,input().split())
if n<b:
    ans = floor((a*n)/b) - a*floor(n/b)
else:
    ans = floor((a*(b-1))/b) - a*floor((b-1)/b)
print(ans)

Submission status: Accepted

Solution code:
a,b,n=map(int, input().split())
if n < b:
    print((a*n)//b - a*(n//b))
else:
    print((a*(b-1))//b - a*((b-1)//b))

Submission status: Accepted

Solution code:
import sys
from itertools import combinations_with_replacement
def input(): return sys.stdin.readline().strip()


def main():
    A, B, N = map(int, input().split())
    if N >= B:
        r = (B - 1) / B
    else:
        r = min(N, (B - 1)) / B
    print(int(A * r))



    


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

A,B,N=list(map(int,input().split()))

x=min(B-1,N)

print(int(np.floor(A*(x%B)/B)))

Submission status: Accepted

Solution code:
a,b,n=map(int,input().split())
ans=0

def f(x):
    return (a*x)//b - a*(x//b)

if b>=n:
    ans=max(f(n),f(n-1))
elif a<b:
    ans = f(b-1)
print(ans)

Submission status: Accepted

Solution code:
import numpy as np
import math
import pprint

a,b,n=map(int,input().split())

if(b<=n):
  print(int(a*(b-1)/b))
else:
  print(int(a*n/b))

Submission status: Accepted

Solution code:
A, B, N = map(int, input().split())
if N >= B:
    ans = (A*(B-1))//B
else:
    ans = (A*N)//B

print(ans)

Submission status: Accepted

Solution code:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
#import sympy as syp(素因数分解とか)
Mod = 1000000007
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main():  #startline-------------------------------------------
    a, b, n = map(int, input().split())
    if b == 1:
        print(0)
    elif b > n:
        print(a * n // b - a * (n  // b))
    else:
        x = (b - 1) * (n // (b - 1))
        print(a*x // b - a*(x//b))
if __name__ == "__main__":
    main() #endline===============================================

Submission status: Accepted

Solution code:
A,B,N = map(int, input().split())

if B - 1 > N:
    print((A * N) // B - A * (N // B))
    exit()

print(A - (A + B - 1) // B)

Submission status: Accepted

Solution code:
import sys
import math
from collections import deque
import heapq
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

def tami(a,b,i):
  num = (a*i)//b - a*(i//b)
  return num

a,b,N = IL()

l = [0,b-1,N,(N//b)*b-1]
ans = 0
for i in l:
  if 0 <= i <= N:
    ans = max(ans, tami(a,b,i))
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


a, b, c= map(int, input().split())


#f_table = [a*t//b for t in range(b)]

if c >= b:
    print((a * (b-1)) // b)

else:
    x = c
    c_amari = c%b
    c_sho = c//b
    ans =(a * c_amari) //b
    print(ans)

Submission status: Accepted

Solution code:
import math
A,B,N = map(int,input().split())
looked = min(B-1,N)
ans = (A*looked)//B - A*(looked//B)
print(ans)

Submission status: Accepted

Solution code:
a,b,n= map(int, input().split())

ans=(min(b-1,n)*a)//b
print(ans)

Submission status: Accepted

Solution code:
from math import floor
a, b, n = map(int, input().split())
if n >= b:
    x = b-1
else:
    x = n
ansx = floor(a*x/b) - a*floor(x/b)
print(ansx)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import math

def main():
     a, b, n = map(int, input().split())
     # floor(A * x/B) - A * floor(x/B)
     # 前者も後者も単調増加関数

     # ans = 0
     # for i in range(n+1):
     #      first = math.floor((a * i) / b)
     #      second = a * math.floor(i / b)
     #      check = first - second
     #      print('x = {}, first = {}, second = {}, ans = {}'.format(i, first, second, check))
     #      if ans < check:
     #           ans = check

     # 上記チェックでの仮説
     # x が Bの倍数ごとに、first と second の 値が一致する
     # n が b より小さい場合 と b 以上の場合を調べる

     if n < b:
          ans = math.floor((a * n / b)) - a * math.floor(n / b)
     else:
          ans = math.floor((a * (b - 1) / b)) - a * math.floor((b - 1) / b)

     print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b, n = map(int, input().split())
if b == 1:
  print(0)
else:
  if n >= b-1:
    print(a-1-a//b)
  else:
    print((a*n)//b - a*(n//b))

Submission status: Accepted

Solution code:
a,b,n = map(int,input().split())
p = (n+1)//b
c = p*b-1
if c < 0:
  print(a*n//b-a*(n//b))
  exit()
ans = max(a*n//b-a*(n//b),a*c//b-a*(c//b))
print(ans)

Submission status: Accepted

Solution code:
def resolve():
    import math
    a, b, n = map(int, input().split())
    if b<= n:
        x = b-1
    else:
        x = n
    print(math.floor(a*x/b) - a*math.floor(x/b))
resolve()

Submission status: Accepted

Solution code:
def main():
    ans = 0
    a,b,n = map(int, input().split())
    if b > n:
        ans = (a*n)//b - a*(n//b)
    else:
        ans = (a*(b-1))//b - a*((b-1)//b)
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
mod = 10**9 + 7 
sys.setrecursionlimit(1000010)

A,B,N = nm()
q = min(B-1,N)
print(A*q // B)

Submission status: Accepted

Solution code:
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
    if(a%b==0):return(b)
    return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()

A,B,N=map(int,input().split())
def main2(x):
    #print(x,int(A*x/B),A*int(x/B))
    return(int(A*x/B)-A*int(x/B))
def main(x):
    #print(x,int(A*x/B),A*int(x/B))
    return(A*x//B-A*(x//B))

if N>=B-1:
    Z=B-1
else:
    Z=N
print((main2(Z)))

#print(C)

Submission status: Accepted

Solution code:
#n=int(input())
#n,m=list(map(int,input().split()))
#a=list(map(int,input().split()))
import math
import itertools
from collections import defaultdict
from collections import Counter
import numpy as np

import heapq
a,b,n=list(map(int,input().split()))
if n<b:
    print(math.floor(a*n/b))
    exit()

print(math.floor(a*(b-1)/b))

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main
    #%%
    A, B, N = R()
    if N >= B:
        print(floor(A*(B-1)/B) - A * floor((B-1)/B))
    else:
        print(floor(A*(N)/B) - A * floor((N)/B))
    #%%
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, n = map(int, input().split())
if n < b:
    print(a * n // b)
else:
    print(a * (b-1) // b)

Submission status: Accepted

Solution code:
import math
a, b, n = map(int, input().split())
if b - 1 <= n:
    print(math.floor(a/b*(b-1)) - a * math.floor((b-1)/b))
else:
    print(math.floor(a/b*n) - a * math.floor(n/b))

Submission status: Accepted

Solution code:
from sys import stdin
a,b,n = [int(x) for x in stdin.readline().rstrip().split()]
if n >= b-1:
    x = b-1
else:
    x = n
ans =int(a*x/b)-a*int(x/b)
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b, n = map(int, input().split())
max_score = 0
if n < b:
    max_score = int(a * n / b) - a * (n // b)
elif n == b:
    max_score = max(int(a * n / b) - a * (n // b), int(a * (n-1) / b) - a * ((n-1) // b))
elif a <= b:
    max_score = a - 1
elif a >= b:
    max_score = int(a * (b-1) / b) - a * ((b-1) // b)
else:
    for x in range(1, n + 1):
        score = int(a * x / b) - a * (x // b)
        if max_score < score:
            max_score = score
print(max_score)

Submission status: Accepted

Solution code:
abn = [int(i) for i in input().split()]
a = abn[0]
b = abn[1]
n = abn[2]
x = min(b-1, n)
print(int((a*x)/b)-a*int(x/b))

Submission status: Accepted

Solution code:
import math
A, B, N = map(int, input().split())

def fnc(x):
    return math.floor(A*x*1.0/B) - A*math.floor(x*1.0/B)

if B == 1:
    print(0)
elif N < B:
    print(fnc(N))
else:
    ans = 0
    for i in range(B-1, N+1, B):
        s = fnc(i)
        if s > ans:
            ans = s
    print(ans)

Submission status: Accepted

Solution code:
import sys


a,b,n = (int(i) for i in input().split())


if n < b-1:
    ans = (a*n//b)

else:
    ans = ((b-1)*a)//b



print(ans)

Submission status: Accepted

Solution code:
import math
A,B,N = map(int,input().split())

if(N <= B-1):
  ans = math.floor(A*N/B)-A*math.floor(N/B)
else:
  ans = math.floor(A*(B-1)/B)-A*math.floor((B-1)/B)

print(ans)

Submission status: Accepted

Solution code:
A,B,N=map(int,input().split())
if B!=1:
	p=(N+1)//B
	result=0
	if p!=0:
		for a in range(1,p+1):
			x=a*B-1
			s=(A*x)//B - A*(a-1)
			if result < s:
				result=s
	else:
		result=A*N//B -A*(N//B)
	print(result)
else:
	print(0)

Submission status: Accepted

Solution code:
import math

A,B,N = map(int, input().split())

if B <= N:
    print(math.floor( (A*(B-1))/B ))
else:
    print(math.floor( (A*N)/B ))

Submission status: Accepted

Solution code:
def calc(x):
    return A*x//B - A*(x//B)

A, B, N = map(int, input().split())
q = N//B
val = q*B
if val == 0:
    ans = calc(N)
else:
    ans = max(calc(val-1), calc(N))
print(ans)

Submission status: Accepted

Solution code:
def solve(a, b, n):
    return a * min(b - 1, n) / b

assert solve(5, 7, 4) == 2
assert solve(1, 1, 1) == 0
assert solve(11, 10, 9) == 9

(a, b, n) = map(int, raw_input().split())

print solve(a, b, n)

Submission status: Accepted

Solution code:
from math import floor
A,B,N = map(int, input().split())
m = A//B
a = A%B
x = min(N,B-1)
print(m*x+floor(a*x/B))

Submission status: Accepted

Solution code:
#D - Floor Function
A,B,N = map(int, input().split())

if B>N:
    a = (A*N)//B
    b = N//B
    print(a-A*b)
    exit()
else:
    N = B-1
    a = (A*N)//B
    b = N//B
    print(a-A*b)

Submission status: Accepted

Solution code:
A, B, N = map(int, input().split())
i = (N // B) * B
  
i = i - 1
if i < 0:
  ans = (A * N) // B - A * (N // B)
else:
  ans = (A * i) // B - A * (i // B)
  
print(ans)

Submission status: Accepted

Solution code:
a,b,n=map(int,input().split())

if b-1<=n:
  x=b-1
else:
  x=n
  
print(str((a*x)//b-a*(x//b)))

Submission status: Accepted

Solution code:
a,b,n = map(int,input().split())
def floor(x):
    return (a*x)//b - a*(x//b)
ans = 0
if b <= n: 
    '''
    for i in range(b-1,n+1):
        ans = max(ans,floor(i))
        #print(floor(i))
    print(ans)
    '''
    print(floor(b-1))
else:
    print(floor(n))

Submission status: Accepted

Solution code:
A, B, N = map(int, input().split())

if N >= B-1:
    print(A * (B-1) // B)
else:
    ans = A * N // B - A * (N//B)
    print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# sys.stdin.readline()
import sys
input = sys.stdin.readline
import math
a,b,N = map(int,input().split())
ans = 0
if b <= N :
    ans = math.floor(a*(b-1)/b)-a*math.floor((b-1)/b)
elif b > N:
    ans = math.floor(a*N/b)-a*math.floor(N/b)


print(ans)

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""


a,b,n = m()

if a > b:
    print((a*n)//b - a*(n//b))
else:
    po = min(b-1,n)
    print((a*po)//b - a*(po//b))

"""


a,b,n = m()


po = min(b-1,n)
print((a*po)//b - a*(po//b))