zoukankan      html  css  js  c++  java
  • poj-1782 Run Length Encoding

    http://poj.org/problem?id=1782

    Run Length Encoding
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 3907   Accepted: 1282

    Description

    Your task is to write a program that performs a simple form of run-length encoding, as described by the rules below. 
    Any sequence of between 2 to 9 identical characters is encoded by two characters. The first character is the length of the sequence, represented by one of the characters 2 through 9. The second character is the value of the repeated character. A sequence of more than 9 identical characters is dealt with by first encoding 9 characters, then the remaining ones. 
    Any sequence of characters that does not contain consecutive repetitions of any characters is represented by a 1 character followed by the sequence of characters, terminated with another 1. If a 1 appears as part of the sequence, it is escaped with a 1, thus two 1 characters are output. 

    Input

    The input consists of letters (both upper- and lower-case), digits, spaces, and punctuation. Every line is terminated with a newline character and no other characters appear in the input.

    Output

    Each line in the input is encoded separately as described above. The newline at the end of each line is not encoded, but is passed directly to the output.

    Sample Input

    AAAAAABCCCC
    12344
    

    Sample Output

    6A1B14C
    11123124
    #include<stdio.h>
    #include<string.h>
    int main()
    {
    	char str[200];
    	int i,j,cnt,l;
    	while(gets(str))
    	{
    		 if (!str[0])
            {
                putchar(10);
                continue;
            }
    			 cnt=1;
    		for(i=0;str[i];i++)
    		{
    		     if (str[i] == str[i+1])
                {
                    for ( j = i ; str[i] == str[i+1] && (i-j) < 8 ; i++ );
                    printf("%d%c", i-j+1, str[i]);
                }
    		     else
    			 {
    			    printf("1");
    				  for(j=i;str[j];j++)
    				  {
    					  if(str[j]!=str[j+1])
    					  {
    						  if(str[j]=='1')
    							  printf("1");
    						  printf("%c",str[j]);
    					  }
    					  else
    						  break;
    				  }
    				  printf("1");
    				  i=j-1;
    			  }
    		}
    		
    		  printf("
    ");
    		  memset(str, 0, sizeof(str));
    	}
    		return 0;
    	}
    
  • 相关阅读:
    vs2010 + .net3.5 MSCharts使用介绍与例子
    TFS服务连接TF31002 出错
    SharePoint CAML 通过时间查询
    SharePoint2010项目总结汇总
    jquery 获取和设置 select下拉框的值
    How to Create Multilingual Webpart in SharePoint 2010 (C# 方式)
    sharepoint母版页固定宽度与纵向滚动条靠右边(修改版)
    JavaScript进行GET和POST请求
    端口简介大全
    程序员学习能力提升三要素
  • 原文地址:https://www.cnblogs.com/cancangood/p/3454616.html
Copyright © 2011-2022 走看看