zoukankan      html  css  js  c++  java
  • 数学--数论--HDU 1792 A New Change Problem (GCD+打表找规律)

    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 3 3 4

    Sample Output
    1 1 5 3

    因为数据太大了就打表找规律。

    import java.util.Scanner;
    
    
    public class Main {
    	public static void main(String[] args) {
    
    		Scanner in = new Scanner(System.in);
    		int a,b;
    		while(in.hasNext())
    		{
    			a=in.nextInt();
    			b=in.nextInt();
    			 System.out.println(a*b-a-b+" "+(a-1)*(b-1)/2);
    		}
    		in.close();
    	}
    
    }
    
  • 相关阅读:
    SNOI 2019 字符串
    1068: [SCOI2007]压缩
    POJ 1848 Tree 树形DP
    BZOJ bzoj1396 识别子串
    BZOJ 4503: 两个串
    BZOJ 2302: [HAOI2011]Problem c(数学+DP)
    BZOJ 3157: 国王奇遇记 (数学)
    CF_528D
    BZOJ 3000: Big Number (数学)
    新の开始
  • 原文地址:https://www.cnblogs.com/lunatic-talent/p/12798502.html
Copyright © 2011-2022 走看看