Problem Description Give you the width and height of the rectangle,darw it. Input Input contains a number of test cases.For each case ,there are two numbers n and m (0 < n,m < 75)indicate the width and height of the rectangle.Iuput ends of EOF. Outp…

问题: 開始直接用输入的数作为宽和高,但实际上要多出两行边框,所以要加一个2. 还有题目要求最后要输出一个空行没有注意到. Picture Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19789    Accepted Submission(s): 10178 Problem Description Give you the wid…

Picture Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16038    Accepted Submission(s): 8303 Problem Description Give you the width and height of the rectangle,darw it.   Input Input contains…

http://acm.hdu.edu.cn/showproblem.php?pid=2052 Problem Description Give you the width and height of the rectangle,darw it.   Input Input contains a number of test cases.For each case ,there are two numbers n and m (0 < n,m < 75)indicate the width an…

Picture Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15932    Accepted Submission(s): 8240 Problem Description Give you the width and height of the rectangle,darw it.   Input Input contains…

2047  阿牛的EOF牛肉串 #include<stdio.h> int main(){ int n,i; _int64 s[]; while(~scanf("%d",&n)){ s[]=;s[]=; ;i<=n;i++){ s[i] = s[i-]* + s[i-]*; } printf("%I64d\n",s[n]); } } 2048  神.上帝以及老天爷 #include<stdio.h> int main(){ in…

并查集+最小生成树 Eddy's picture Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7669    Accepted Submission(s): 3882 Problem Description Eddy begins to like painting pictures recently ,he is sure of hi…

#include <iostream> #include <string> using namespace std; int main() { int n, m; while (cin >> m >> n) { ; i <= n+; i++) { || i == n+) { cout << "+"; ; j <= m; j++) cout << "-"; cout <<…

Box Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2374    Accepted Submission(s): 718 Problem Description There are N boxes on the ground, which are labeled by numbers from 1 to N. The boxes…

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 56784    Accepted Submission(s): 19009 Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats g…