Searching for Nessy
来源:互联网 发布:网络赚钱棋牌游戏 编辑:程序博客网 时间:2024/06/05 15:04
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29592#problem/L
// File Name: bo_jwolf12.cpp// Author: rudolf// Created Time: 2013年08月19日 星期一 21:44:53#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>using namespace std;int main(){int Case , n , m ;while( cin >> Case ){while( Case-- ){cin >> n >> m ;n -= 2 ;m -= 2 ;if( n % 3 != 0 ){n = n / 3 + 1 ;}else{n = n / 3 ;}if( m % 3 != 0 ){m = m / 3 + 1 ;}else{m = m / 3 ;}cout << n * m << endl ;}}return 0;}
- 11044 - Searching for Nessy
- 11044 - Searching for Nessy
- 11044 - Searching for Nessy
- UVA11044 - Searching for Nessy
- Searching for Nessy
- Searching for Nessy
- 11044 - Searching for Nessy
- UVA11044 Searching for Nessy
- uva11044 Searching for Nessy
- Searching for Nessy
- UVa 11044 - Searching for Nessy
- uva 11044 Searching for Nessy
- uva 11044 - Searching for Nessy
- uva-11044 - Searching for Nessy
- UVa 11044 - Searching for Nessy
- UVa 11044 - Searching for Nessy
- UVa 11044 - Searching for Nessy
- UVA 11044 Searching for Nessy
- 猴子吃桃问题
- The Land of Justice
- 后缀数组论文题目
- How Many Points of Intersection?
- disassambe c++ source code
- Searching for Nessy
- [leetcode] Populating Next Right Pointers in Each Node
- Quotient Polynomial
- 编程原则
- Android 之 下拉框(Spinner)的使用
- VB.net学习笔记(十五)继承与多接口练习
- (2/3/4)-D Sqr/Rects/Cubes/Boxes?
- 黑马程序员 集合学习笔记二
- 几种古典密码学算法