Mr_Treeeee的博客

过山车 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 22983    Accepted Submission(s): 9931 Problem Description RPG girls今天和大家一起去游乐场玩

方格取数(2) Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6704    Accepted Submission(s): 2152 Problem Description 给你一个m*n的格子的棋盘，每个格

Kindergarten Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 7291   Accepted: 3590 Description In a kindergarten, there are a lot of kids. All girls of the

Wrestling Match Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1833    Accepted Submission(s): 663 Problem Description Nowadays, a

D. 唐纳德和他的数学老师 Time limit per test: 1.0 seconds Memory limit: 256 megabytes 唐纳德是一个数学天才。有一天，他的数学老师决定为难一下他。他跟唐纳德说：「现在我们来玩一个游戏。这个游戏总共 n轮，每一轮我都会给你一个数（第 i 轮给出的数是 ai）。你每次要回答一个数，是我给出的这个数的质因数，并且

时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 32768K，其他语言65536K 64bit IO Format: %lld 题目描述  A mod-dot product between two arrays with length n produce a new array with length n. If array A is a1,a2,..

  http://acm.hdu.edu.cn/showproblem.php?pid=6346       #include <stdio.h> #include <iostream> #include <algorithm> using namespace std; #define LL long long const LL N = 222...