codeforces 145 div2 A

这道题我比赛的时候懵了，那么简单一道题，我还想成了网络流相关。。。sb了，，，

#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
using namespace std ;

ifstream fin  ( "input.txt"  ) ;
ofstream fout ( "output.txt" ) ;

int   n ;
char  student[105] ;
int   map[205][205] , p[205] ;

int  main()
{
    int  i , j ;

    fin >> n ;
    fin >> student ;
    for( i = 0 ; i < n / 2 ; i ++ )
    {
        if( student[i] == 'R' && student[i+n/2] == 'L' ) fout << i+1+n/2 << " " << i+1<< endl ;
        else fout << i+1 << " " << i+1+n/2 << endl ;
    }
    return 0 ;
}