Keep On Movin Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 76    Accepted Submission(s): 68 Problem Description Professor Zhang has kinds of characters and the quantity of the i-th character…

Keep On Movin 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5744 Description Professor Zhang has kinds of characters and the quantity of the i-th character is ai. Professor Zhang wants to use all the characters build several palindromic strings. He…

Keep On Movin 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5744 Description Professor Zhang has kinds of characters and the quantity of the i-th character is ai. Professor Zhang wants to use all the characters build several palindromic strings. He…

题目链接: Keep On Movin Time Limit: 4000/2000 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others) Problem Description   Professor Zhang has kinds of characters and the quantity of the i-th character is ai. Professor Zhang wants to use all the…

Keep On Movin Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 275    Accepted Submission(s): 204 Problem Description Professor Zhang has kinds of characters and the quantity of the i-th characte…

找出奇数个的数有几个,就分几组. #include<cstdio> #include<cstring> #include<algorithm> #include<queue> #define N 100005 using namespace std; int n,a[N],k,t,sum; int main(){ scanf("%d",&t); while(t--){ scanf("%d",&n); s…

题目:传送门. 如果每个字符出现次数都是偶数, 那么答案显然就是所有数的和. 对于奇数部分, 显然需要把其他字符均匀分配给这写奇数字符. 随便计算下就好了. #include <iostream> #include <algorithm> #include <cstdio> #include <cstring> using namespace std; int main() { int T,n,a; scanf("%d",&T);…

题意: 给出t组测试数据,每组给出正整数n表示有n种字符,接下来给出n个数表示该种字符的数目,操作一下,使得可以构造的最小回文串字符数目最大且输出. 分析: 如果每个字符出现次数都是偶数, 那么答案显然就是所有数的和. 对于奇数部分, 显然需要把其他字符均匀分配给这写奇数字符. 随便计算下就好了. 即统计所有的字符的数目,奇数则-1再加上去,并且计数器count++,完成之后就输出数目,公式为字符数目=(sum/2)/count*2+1,其实就是平均了一下. 代码: #include<cstdi…

Problem Description Professor Zhang has kinds of characters and the quantity of the i-th character is ai. Professor Zhang wants to use all the characters build several palindromic strings. He also wants to maximize the length of the shortest palindro…

#include<bits/stdc++.h> using namespace std; int main(){ int T, n, a;scanf("%d",&T); while(T --){ scanf("%d",&n); , even = ; ; i < n; i ++){ scanf("%d",&a); odd += a % ; even += a - (a & ); } ){ print…