UVA - 11044 Searching for Nessy
来源:互联网 发布:python统计字符串个数 编辑:程序博客网 时间:2024/05/16 19:18
题目大意:问n*m的地图最多放多少个3*3的矩形。
解题思路:水题
#include<iostream> #include<cstdio>#include<string.h>#include<stdlib.h>#include<cmath>using namespace std;int main() { int T; scanf("%d", &T); while(T--) { int n, m; scanf("%d%d", &n, &m); printf("%d\n", n / 3 * (m / 3)); }return 0;}
0 0
- 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
- 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
- UVA - 11044 Searching for Nessy
- UVa:11044 - Searching for Nessy
- 面向对象
- dp 最佳加法表达式
- 2016.07.18【初中部 NOIP普及组 】模拟赛题解
- 基本opencv2处理方法
- IOS-内存管理
- UVA - 11044 Searching for Nessy
- POJ2109 高精度(含大数开方)+二分
- LLVM与Clang的概述及关系
- 揭示java序列化算法
- UVA - 10719 Quotient Polynomial
- 字串
- UVA - 10970 Big Chocolate
- hdoj 1715 (+基础练习一) 大菲波数 【大数 + 斐波那契】
- poj 2288Islands and Bridges