#include <iostream>
using namespace std;
int main() {
int a, b;
while(cin>>a>>b){
int ans1 = a*b-a-b;
int ans2 = (a-1)*(b-1)/2;
cout<<ans1<<" "<<ans2<<endl;
}
return 0;
}
【数论+a与b互质求最大不能组成的数字以及不能组成的数字的个数】HDU-1792 A New Change Problem
注解1、a与b互质,最大不能组合数为ab-a-b,不能组合出的数字个数为(a-1)(b-1)/2代码#include <iostream>using namespace std;int main() { int a, b; while(cin>>a>>b){ int ans1 = a*b-a-b; ...