zoukankan      html  css  js  c++  java
  • poj2039

    To and Fro
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 8052   Accepted: 5367

    Description

    Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with extra random letters so as to make a rectangular array of letters. For example, if the message is "There’s no place like home on a snowy night" and there are five columns, Mo would write down 
    t o i o y
    
    h p k n n
    
    e l e a i
    
    r a h s g
    
    e c o n h
    
    s e m o t
    
    n l e w x

    Note that Mo includes only letters and writes them all in lower case. In this example, Mo used the character "x" to pad the message out to make a rectangle, although he could have used any letter. 

    Mo then sends the message to Larry by writing the letters in each row, alternating left-to-right and right-to-left. So, the above would be encrypted as 

    toioynnkpheleaigshareconhtomesnlewx 

    Your job is to recover for Larry the original message (along with any extra padding letters) from the encrypted one. 

    Input

    There will be multiple input sets. Input for each set will consist of two lines. The first line will contain an integer in the range 2. . . 20 indicating the number of columns used. The next line is a string of up to 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end of input.

    Output

    Each input set should generate one line of output, giving the original plaintext message, with no spaces.

    Sample Input

    5
    toioynnkpheleaigshareconhtomesnlewx
    3
    ttyohhieneesiaabss
    0

    Sample Output

    theresnoplacelikehomeonasnowynightx
    thisistheeasyoneab

    #include<stdio.h>

    #include<string.h>

    int main()

    {
     
    char a[200];
     
    int n,i,j,l,t,p;

     while(scanf("%d",&n)!=EOF&&n!=0)

     {
        
    getchar();
     
     gets(a);
     
     l=strlen(a);
      
    t=l/n;
      
    for(i=0;i<n;i++)
     
     {
        
      for(j=1;j<=t;j++)
      
        if(j%2==0)
       
       printf("%c",a[j*n-i-1]);
       
       else
         
         printf("%c",a[(j-1)*n+i]);
     
     }
     
     printf(" ");

     }

     return 0;

    }
  • 相关阅读:
    数据库三大范式
    idea连接sqlite
    Javascript中==和===的区别
    手机商城项目(修饰技术)
    FastJSON、Gson、Jackson(简单了解使用)
    SiteMesh配置下载使用(简单介绍)
    html5中event获取data和class
    jsp的4个作用域区别( pageScope、requestScope、sessionScope、applicationScope)
    <jsp:include>和<%@include file=""%>的区别(简单了解)
    Check-Point-Security-Gateway-BYOL-R77.30-041.161
  • 原文地址:https://www.cnblogs.com/lxm940130740/p/3268154.html
Copyright © 2011-2022 走看看