/* HDU5924 Mr. Frog’s Problem http://acm.hdu.edu.cn/showproblem.php?pid=5924 数论 * */ #include <cstdio> int main() { long long a,b; int t; scanf("%d",&t); ;k<=t;k++) { scanf("%lld%lld",&a,&b); printf("Case #%d:…
Mr. Frog's Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 312 Accepted Submission(s): 219 Problem Description One day, you, a clever boy, feel bored in your math class, and then fall…
Mr. Frog's Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1337 Accepted Submission(s): 765 Problem Description One day, you, a clever boy, feel bored in your math class, and then fa…
Mr. Frog's Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 277 Accepted Submission(s): 192 Problem Description One day, Mr. Frog is playing Link Game (Lian Lian Kan in Chinese).In this g…
Mr. Frog’s Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 312 Accepted Submission(s): 209 Problem Description One day, Mr. Frog is playing Link Game (Lian Lian Kan in Chinese). In this…
Description One day, Mr. Frog is playing Link Game (Lian Lian Kan in Chinese). In this game, if you can draw at most three horizontal or vertical head-and-tail-connected lines over the empty grids(the lines can be out of the whole board) to connect t…
/* HDU5926 Mr. Frog’s Game http://acm.hdu.edu.cn/showproblem.php?pid=5926 杂题水题 * */ #include <cstdio> #include <algorithm> using namespace std; ; int t,n,m; int mapp[Nmax][Nmax]; ,,-,,}; ,,,,-}; int is() { ;i<=m;i++) ;j<=m;j++) ][i]==map…
Mr. Ant has 3 boxes and the infinite number of marbles. Now he wants to know the number of ways he can put marbles in these three boxes when the following conditions hold. 1) Each box must contain at least 1 marble. 2) The summation of marble…
A.Minimum’s Revenge There is a graph of n vertices which are indexed from 1 to n. For any pair of different vertices, the weight of the edge between them is the least common multiple of their indexes. Mr. Frog is wondering about the total weight of t…
