Thursday, 23 January 2014

UVa Problem ID 612 (DNA Sorting)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) throws IOException 
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String input;
        StringBuffer sb=new StringBuffer("");
        int M=Integer.parseInt(br.readLine());
        boolean blank = false;
       
        for (int i = 0; i 50 || m<=0 || m>100)
				break;
			
			String in[]=new String[m];
			int value[]=new int[m];
			
			
			for (int j = 0; j input.charAt(j2))
						{
							total+=1;
						}
					}
				}
				
				in[j]=input;
				value[j]=total;
			}
			
			for(int j=1;j0 && value[j2-1]>value[j2])
	            {
	                int temp=value[j2-1];
	                value[j2-1]=value[j2];
	                value[j2]=temp;
	                String s1=in[j2-1];
					in[j2-1]=in[j2];
					in[j2]=s1;
	                j2--;
	            }
	            
	        }
			
			if ( blank ) sb.append("\n");
	        blank = true;
			for (int j = 0; j < m; j++) {
//				if(in[j]==null)
//					in[j]="";
				sb.append(in[j]+"\n");
				
			}
			
		}
        System.out.print(sb);
    }
	
}

Previous Post
Next Post

0 comments:

Advertisement