UVa 11044 - Searching for Nessy

求n*m的网格中有多少九宫格，公式：（n/3）*（m/3）。

代码：

 1 #include<iostream>
 2
 3 using namespace std;
 4
 5 int main()
 6 {
 7     int n, m;
 8     int t;
 9     cin >> t;
10     while(t--)
11     {
12         cin >> n >> m;
13         cout << (n/3)*(m/3) << endl;
14     }
15     return 0;
16 }

转载于:https://www.cnblogs.com/zrq495/archive/2012/07/27/2611908.html

UVa 11044 - Searching for Nessy相关推荐

STL --- UVA 123 Searching Quickly
UVA - 123 Searching Quickly Problem's Link: http://acm.hust.edu.cn/vjudge/problem/viewProblem.acti ...
湖南省第八届大学生程序设计大赛原题 D - 平方根大搜索 UVA 12505 - Searching in sqrt(n)...
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=30746#problem/D D - 平方根大搜索 UVA12505 - Searchin ...
uva - 123 - Searching Quickly
题目大意: 输入一系列要被忽视的单词和题目,题目中除了要被忽视的单词外其他的都是关键字.把关键字忽略大小写按字典序排序.再把题目按照关键字的字典序输出.有几个关键字输出几次(看题目中样例).输出的时候 ...
π-Algorithmist分类题目（3）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(3) Probability ...
提取了下刘汝佳推荐的题号...
今天闲来没事上uva oj提取了下刘汝佳推荐的acm题号,原始数据如下: Volume 0. Getting Started 10055 - Hashmat the Brave Warrior ...
初学者acm的练习题指南
上机练习题参考题忘了在哪找的啦~~希望对大家有帮助呦 1. Programming Bas ...
Competitive Programming 3题解
题目一览: Competitive Programming 3: The New Lower Bound of Programming Contests(1) Competitive Programm ...
Competitive Programming专题题解(1)
Competitive Programming题解 AOAPC I: Beginning Algorithm Contests 题解 CP2-1.1.1 Easy(Ad Hoc Problems) P ...
AOAPC I: Beginning Algorithm Contests 题解
AOAPC I: Beginning Algorithm Contests 题解 AOAPC I: Beginning Algorithm Contests (Rujia Liu) - Virtual ...

UVa 11044 - Searching for Nessy

UVa 11044 - Searching for Nessy相关推荐

最新文章

热门文章