Link http://acm.hust.edu.cn/vjudge/contest/121539#problem/C Description standard input/output After a long ACM training day, Master Hasan invited his trainees for a light dinner in the cafeteria. The cafeteria has N tables, each with a number of chai…
Link http://acm.hust.edu.cn/vjudge/contest/121539#problem/B Description standard input/output Although Haneen was able to solve the LCS problem, Dr. Ibrahim is suspicious about whether she really understands the LCS problem or not. He believes that s…
Link http://acm.hust.edu.cn/vjudge/contest/121539#problem/A Description standard input/output Haneen is trying to solve an easy problem given by Dr. Ibrahim in the Algorithms course. The problem is to find the lexicographically smallest Longest Commo…
#include <iostream> #include <cstdio> #include <vector> using namespace std; typedef long long LL; ]; vector<]; void dfs(int u, int k) { int d = num[u].size(), v; ; i < d; i++){ v = num[u][i]; ; j < k; j++) printf(" ")…
2016 Multi-University Training Contest 1 2016 Multi-University Training Contest 2 2016 Multi-University Training Contest 3 2016 Multi-University Training Contest 4 2016 Multi-University Training Contest 5 2016 Multi-University Training Contest 6…
Differencia Time Limit: 10000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 601 Accepted Submission(s): 173 Problem Description Professor Zhang has two sequences a1,a2,...,an and b1,b2,...,bn. He wants to…
Rigid Frameworks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 337 Accepted Submission(s): 273 Problem Description Erik Demaine is a Professor in Computer Science at the Massachusetts Insti…
