poj 2945-关于字符串的排序
来源:互联网 发布:无声告白 知乎 编辑:程序博客网 时间:2024/06/07 23:01
Find the Clones
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions:6265 Accepted: 2328
Description
Doubleville, a small town in Texas, was attacked by the aliens. They have abducted some of the residents and taken them to the a spaceship orbiting around earth. After some (quite unpleasant) human experiments, the aliens cloned the victims, and released multiple copies of them back in Doubleville. So now it might happen that there are 6 identical person named Hugh F. Bumblebee: the original person and its 5 copies. The Federal Bureau of Unauthorized Cloning (FBUC) charged you with the task of determining how many copies were made from each person. To help you in your task, FBUC have collected a DNA sample from each person. All copies of the same person have the same DNA sequence, and different people have different sequences (we know that there are no identical twins in the town, this is not an issue).
Input
The input contains several blocks of test cases. Each case begins with a line containing two integers: the number 1 ≤ n ≤ 20000 people, and the length 1 ≤ m ≤ 20 of the DNA sequences. The next n lines contain the DNA sequences: each line contains a sequence of m characters, where each character is either `A', `C', `G' or `T'.
The input is terminated by a block with n = m = 0 .
The input is terminated by a block with n = m = 0 .
Output
For each test case, you have to output n lines, each line containing a single integer. The first line contains the number of different people that were not copied. The second line contains the number of people that were copied only once (i.e., there are two identical copies for each such person.) The third line contains the number of people that are present in three identical copies, and so on: the i -th line contains the number of persons that are present in i identical copies. For example, if there are 11 samples, one of them is from John Smith, and all the others are from copies of Joe Foobar, then you have to print `1' in the first andthe tenth lines, and `0' in all the other lines.
Sample Input
9 6AAAAAAACACACGTTTTGACACACGTTTTGACACACACACACTCCCCCTCCCCC0 0
Sample Output
120100000
用结构体来表示字符串的序列,用strcmp(),和sort函数排序
代码:
#include<cstdio>#include<cstdlib>#include<iostream>#include<algorithm>#include<string>#include<cstring> #include<cmath>#include<queue>using namespace std;#define sf scanf#define pf printf#define INF 1<<29#define eps 1e-6const double PI=acos(-1.0);#define lint __int64#define LL long long #define ULLint unsigned long long //2^64-1>1.8*10^19#define clr(x) memset(x,0,sizeof(x))#define Clr(x) memset(x,-1,sizeof(x))struct node{char x[22];}p[20002];int a[20002];int cmp(node str1,node str2){return strcmp(str1.x,str2.x)<=0?1:0;//判断字符串的大小}int main(){int n,m,i,j;while(sf("%d%d",&n,&m)&&n!=0&&m!=0){for(i=0; i<n; i++){sf("%s",p[i].x);a[i]=0;}sort(p,p+n,cmp);//排序字符传int sum=1;for(i=0; i<n; i++){if(strcmp(p[i].x,p[i+1].x)==0)sum++;else{a[sum]++;sum=1;}}for(i=1; i<=n; i++)pf("%d\n",a[i]);}return 0;}
- poj 2945-关于字符串的排序
- POJ-1002(字符串+排序)
- 关于字符串排序
- poj 1002 方便记忆的电话号码 字符串处理+排序
- poj之3671 字符串排序
- POJ 1731 字符串全排序
- POJ 3193 字符串排序+比较
- 关于字符串的剔除重复重新排序的C程序
- 关于mysql对字符串的数字的排序
- 关于mysql对字符串的数字的排序
- 关于将字符串数字排序的面试问题
- 关于c++字符串的 sort排序(字典序)
- POJ 1007 DNA Sorting - 字符串比较 - 排序
- POJ 1002(不用排序的方法)(简单的字符串处理程序)
- Java的字符串排序
- 字符串的排序
- 字符串的排序
- 字符串的排序
- Linux_2.6内核配置说明
- jquery的几种JavaScript处理
- 面试
- Java之泛型编程
- Mac OS X 10.8.2终端切换root用户
- poj 2945-关于字符串的排序
- 面试
- 拷贝构造函数和赋值构造函数的区别
- linux dup()\dup2()函数
- Sas常用过程
- Ext进度条
- 视频通讯僵局已由思科打破
- JS获取Cookie值
- HttpClient4之模拟http请求