HDU1792(数论)
来源:互联网 发布:常州 软件企业排名 编辑:程序博客网 时间:2024/05/18 20:13
A New Change Problem
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 668 Accepted Submission(s): 337
Problem Description
Now given two kinds of coins A and B,which satisfy that GCD(A,B)=1.Here you can assume that there are enough coins for both kinds.Please calculate the maximal value that you cannot pay and the total number that you cannot pay.
Input
The input will consist of a series of pairs of integers A and B, separated by a space, one pair of integers per line.
Output
For each pair of input integers A and B you should output the the maximal value that you cannot pay and the total number that you cannot pay, and with one line of output for each line in input.
Sample Input
2 33 4
Sample Output
1 15 3数论题,不知道的同学可以找规律最大不能表示:n*m-n-m所有不能表示的个数:(m-1)*(n-1)/2#include<iostream>#include<cstdio>using namespace std;__int64 n,m;int main(){while(~scanf("%I64d%I64d",&n,&m)){printf("%I64d %I64d\n",n*m-n-m,(n-1)*(m-1)/2);}return 0;}
- HDU1792(数论)
- hdu1792
- 数学规律题,数论知识:hdu1792
- HDU1792(公式)
- 【HDU1792】A New Change Problem
- 数论
- 数论
- 数论
- 数论
- 数论
- 数论
- 数论
- 数论
- 数论
- 数论
- 数论
- 数论 ?
- 数论
- ANDROID NDK环境搭建
- Python快速教程总结
- IO流缓冲区的清空(flush方法)
- 项目管理师-挣值分析总结
- Python标准库——走马观花
- HDU1792(数论)
- Linux服务器问题排查常用指令
- [OOAD]OOD设计各个任务流程
- IOS第三十一天——在IOS开发中操作sqlite3
- git repo使用心得
- 10115 - Automatic Editing
- android 底层讲解
- 初始化列表的执行顺序
- 红黑树