poj 3980 取模运算

取模运算
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 10931   Accepted: 6618

Description

编写一个C函数mod(int n, int m),实现取模运算%

Input

输入包含多行数据 

每行数据是两个整数a, b (1 <= a, b <= 32767) 
数据以EOF结束

Output

于输入的每一行输出a%b

Sample Input

5 3
100 2

Sample Output

2
0

 1 #include <stdio.h>
 2 
 3 int mod(int n, int m){
 4 //    if(n >= m)
 5 //        n = n - n / m * m;
 6 //    return n;
 7     return n % m; 
 8 }
 9 
10 int main(){
11     int m, n;
12     while(scanf("%d %d", &m, &n) != EOF){
13         printf("%d
", mod(m, n));
14     }
15     return 0;
16 }
 
原文地址:https://www.cnblogs.com/qinduanyinghua/p/5796936.html