2019-3-3 损坏的RAID5

#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
int n, s, l, len, m;//n硬盘数，s每个条带s块，l可用硬盘数, m操作次数
string str[1001];
char f(char c1){
    if(c1<10)
        return c1+'0';
    if(c1<16)
        return c1+'A'-10;
    if(c1<'9')
        return c1-'0';
    if(c1<'F')
        return c1-'A'+10;
}
string func(string &ss, string s1){
    for(int i = 0; i < 8; i++){
        ss[i] = f(f(ss[i])^f(s1[i]));
    }
}
void read(int tmp){
    int disk = (tmp/s)%n;//该块位于哪个硬盘
    int depth = (tmp/s)/(n-1);//改块位于硬盘的第几条,0为第一条
    int ranknum = depth*s+tmp%s;//该块位于硬盘第几块，0为第一块
    int currentlen = str[disk].length();
    if(tmp>len/8*(n-1)){
        cout << "-" << endl;
        return;
    }
    if(currentlen > 0){
        cout << str[disk].substr(ranknum*8,8) << endl;
        return;
    }
    if(l==n-1){
        string ss = "00000000";

        for(int i = 0; i < n; i++){
            if(i!=disk){
                func(ss,str[i].substr(ranknum*8,8));
            }
        }
        cout << ss << endl;
        return;
    }
    cout << "-" << endl;

}
int main()
{
    ios::sync_with_stdio(false);//避免c++中cin操作超时。
    cin>>n>>s>>l;
    int tmp;
    for(int i = 0; i < l; i++){
        cin>>tmp;
        cin>>str[tmp];//将数据放入第tmp块硬盘
    }
    if(l==0)
        len = 0;
    else
        len = str[tmp].length();
    cin >> m;
    for(int i = 0; i < m; i++){
        cin>>tmp;
        read(tmp);//读取tmp块数据
    }
    return 0;
}

运行错误，是由于输入的查询块数可能非法