浙工大姗姗杯round1 G
来源:互联网 发布:卫生间防水 知乎 编辑:程序博客网 时间:2024/04/28 20:11
A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41840 Accepted Submission(s): 13449
Problem Description
Given two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a^2+b^2 +m)/(ab) is an integer.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Input
You will be given a number of cases in the input. Each case is specified by a line containing the integers n and m. The end of input is indicated by a case in which n = m = 0. You may assume that 0 < n <= 100.
Output
For each case, print the case number as well as the number of pairs (a,b) satisfying the given property. Print the output for each case on one line in the format as shown below.
Sample Input
110 120 330 40 0
Sample Output
Case 1: 2Case 2: 4Case 3: 5
水题。暴力即可
#include <iostream>#include <stdio.h>using namespace std;int main(){ int N, n, m; cin >> N; while(N--){ int tt = 1; while(cin >> n >> m){ if(n == 0 && m == 0){ break; } int num = 0; for(int b = n - 1; b >= 2; b--) for(int a = 1; a < b; a++){ if((a*a+b*b+m)%(a*b) == 0) num++; } cout << "Case " << tt << ": " << num << endl; tt++; } if(N != 0)cout << endl; } return 0;}
阅读全文
0 0
- 浙工大姗姗杯round1 G
- 浙工大姗姗杯round1 A
- 浙工大姗姗杯round1 C
- 浙工大姗姗杯round1 D
- 浙工大姗姗杯round1 E
- 浙工大姗姗杯round1 F
- 浙工大姗姗杯round2 G
- 浙工大姗姗杯round3 A
- 浙工大姗姗杯round2 CodeForces 103BCthulhu
- 浙工大姗姗杯round2 CodeForces 116BLittle Pigs and Wolves
- 暑假训练Round1——G: Hkhv的水题之二(字符串的最小表示)
- SRM 454 Round1 500
- SDOI2014 Round1 day0
- SDOI2014 Round1 day1
- SDOI2014 Round1 day2
- codeforces round1 p1
- SDOI2015 Round1总结
- 校赛Round1 1009 死胡同
- Nginx 服务器安装目录介绍
- POJ3737UmBasketella
- 【转】找出游戏的必胜策略——Nim与Grundy数小记
- 订单漏单问题分析及解决方案
- 安卓开发关于图片保存到本地相册并显示功能
- 浙工大姗姗杯round1 G
- 【博览网】面向对象高级编程(上)——第一周课程笔记
- c++ primer(六)
- linux下安装tensorflow
- maven安装
- 【php中的curl】php中curl的详细解说
- 关于JAVA字节输入流与输出流以及与字符区别
- 资源分享
- 有图有真相带你理解C++中虚函数调用机制