HDU2562（字符串逻辑题）

来源：互联网发布：java set和get的用法编辑：程序博客网时间：2024/06/03 09:43

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2562

解题思路：

相邻两位作交换即可。

完整代码：

#include <functional>#include <algorithm>#include <iostream>#include <fstream>#include <sstream>#include <iomanip>#include <numeric>#include <cstring>#include <climits>#include <cassert>#include <complex>#include <cstdio>#include <string>#include <vector>#include <bitset>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <list>#include <set>#include <map>using namespace std;#pragma comment(linker, "/STACK:102400000,102400000")typedef long long LL;typedef double DB;typedef unsigned uint;typedef unsigned long long uLL;/** Constant List .. **/ //{const int MOD = int(1e9)+7;const int INF = 0x3f3f3f3f;const LL INFF = 0x3f3f3f3f3f3f3f3fLL;const DB EPS = 1e-9;const DB OO = 1e20;const DB PI = acos(-1.0); //M_PI;string s;int main(){    #ifdef DoubleQ    freopen("in.txt","r",stdin);    #endif    std::ios::sync_with_stdio(false);    std::cin.tie(0);    int T;    cin >> T;    while(T--)    {        cin >> s;        int len = s.length();        for(int i = 0 ; i < len ; i += 2)        {            char ch = s[i];            s[i] = s[i+1];            s[i + 1] = ch;        }        cout << s << endl;    }}

0 0