如何在一步中获得商和余数？

Question

可能重复:同时
划分和获取剩余？

是否可以在一个步骤中同时得到整数除法的商和余数,即不进行两次整数除法？

Answer 1

div会这样做.参见参考和示例:

/* div example */
#include <stdio.h>
#include <stdlib.h>

int main ()
{
  div_t divresult;
  divresult = div (38,5);
  printf ("38 div 5 => %d, remainder %d.\n", divresult.quot, divresult.rem);
  return 0;
}

输出:

38 div 5 => 7, remainder 3.

编辑:

C规范说:

7.20一般公用事业

The types declared are size_t and wchar_t (both described in 7.17),
div_t
which is a structure type that is the type of the value returned by the div function,
ldiv_t
which is a structure type that is the type of the value returned by the ldiv function, and
lldiv_t
which is a structure type that is the type of the value returned by the lldiv function.

......但它没有说出定义div_t是什么.

Answer 2

是的,有一个称为div()(和ldiv,甚至可能lldiv)的标准函数可以做到这一点.