[acm]HDOJ 1200 To and Fro

题目连接：

http://acm.hdu.edu.cn/showproblem.php?pid=1200

简单字符串处理，找规律

---

 /*
 11509672    2014-08-21 11:32:55    Accepted
 1200    0MS    380K    442 B    G++    空信高手
 */
 #include<iostream>
 #include<string>
 #include<cstdio>
 using namespace std;
 int main()
 {
     //freopen("input.txt","r",stdin);
     string str;
     int n,flag=;
     while(cin>>n && n!=)
     {
         cin>>str;
         int pnt;
         for(int i=;i<=n;i++)
         {
             flag=;//重置左右
             pnt=i;
             while(pnt<=str.length())
             {
                 cout<<str[pnt-];
                 //左右分别讨论
                 if(flag){pnt+=(*n-*i+);flag=;}
                 else {pnt+=(*i-);flag=;}
             }
         }
         cout<<endl;
     }
     return 0;
 }