c++ - 如何一步获得商和余数？

Question

这个问题在这里已经有了答案:

关闭 10年前.

Possible Duplicate:
Divide and Get Remainder at the same time?

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

Answer 1

div 会这样做。见 reference和例子:

/* 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的定义是什么。