Leimasin

input/code.cpp: In function 'int main()':
input/code.cpp:82:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(s1 != s && iList.size() < 10*n && ok){
                      ~~~~~~~~~~~~~^~~~~~
input/code.cpp:143:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < iList.size(); i++) {
                         ~~^~~~~~~~~~~~~~

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cstdlib>
 
 
using namespace std;
 
int main() {
    
    
    string s;
    string leima;
    string tayte;
    vector<int> iList;
    
    int n;
    int m;
    int random_number;
    bool ok = false;
    
    cin>>s>>leima;
    
    string s1;
    n = s.length();
    m = leima.length();
    
    
    for(int i=0; i < n; i++){
        s1 += "?";
    }
    
    if(m == n && leima == s){
        ok = true;
    }
    
    //SYÖTTEIDEN HYLKÄÄMINEN:
    
    //jos leima pidempi kuin tavoite, ei onnistu
    if(m > n){
        cout<<-1;
    }//jos tavoitteen 1. ja viimeinen merkki eivät täsmää, ei onnistu
    else if(s[0] != leima[0] || s[n-1] != leima[m-1])
    {
        cout<<-1;
    }//jos merkkijono ei sisällä leimaa, ei onnistu
    else if(s.find(leima) == std::string::npos){
        cout<<-1;//TÄMÄ
    }
    else if(m < 0 || n < 0){
        cout<<-1;
    }//jos tavoitteesta löytyy merkkejä, joita ei ole leimassa, ei onnistu
    else{
        for(int i=0; i < n-1; i++){
            
            if(leima.find(s[i]) == std::string::npos || (s[i] != 'A'&& s[i] != 'B'&& s[i] != 'C'&& s[i] != 'D'&& s[i] != 'E'&& s[i] != 'F'&& s[i] != 'G'&& s[i] != 'H'&& s[i] != 'I'&& s[i] != 'J'&& s[i] != 'K'&& s[i] != 'L'&& s[i] != 'M'&& s[i] != 'N'&& s[i] != 'O'&& s[i] != 'P'&& s[i] != 'Q'&& s[i] != 'R'&& s[i] != 'S'&& s[i] != 'T'&& s[i] != 'U'&& s[i] != 'V'&& s[i] != 'W'&& s[i] != 'X'&& s[i] != 'Y'&& s[i] != 'Z')){
                break;
            }
        }
        for(int i =0; i < m-1; i++){
            if(s.find(leima[i]) == std::string::npos || (s[i] != 'A'&& s[i] != 'B'&& s[i] != 'C'&& s[i] != 'D'&& s[i] != 'E'&& s[i] != 'F'&& s[i] != 'G'&& s[i] != 'H'&& s[i] != 'I'&& s[i] != 'J'&& s[i] != 'K'&& s[i] != 'L'&& s[i] != 'M'&& s[i] != 'N'&& s[i] != 'O'&& s[i] != 'P'&& s[i] != 'Q'&& s[i] != 'R'&& s[i] != 'S'&& s[i] != 'T'&& s[i] != 'U'&& s[i] != 'V'&& s[i] != 'W'&& s[i] != 'X'&& s[i] != 'Y'&& s[i] != 'Z')){
                break;
            }else if(i == m-2){
                ok = true;
            }
        }
        if(!ok){
            cout<<-1;
        }
    }
    
    s1.replace(0, m, leima);
    iList.push_back(0);
    //cout<<s1<<"\n";
    s1.replace(n-m, m, leima);
    iList.push_back(n-m);
    //cout<<s1<<"\n";
 
    
    while(s1 != s && iList.size() < 10*n && ok){
        random_number = rand() % (n-m+1);
        iList.push_back(random_number);
        s1.replace(random_number, m, leima);
        //cout<<s1<<"\n";
    }
    
    
    
    if(ok && s != s1){
        //TOINEN TAPA
        
        string tayte;//täyte
        s1 = s;
        for(int i=0; i < m; i++){
            tayte += "?";
        }
        iList.clear();
        int x = 0;
        
        //etsitään kaikki 1. kerroksen leimat
        while(s.find(leima, x) != std::string::npos){
            x = s.find(leima, x);
            s1.replace(x, m, tayte);
            iList.push_back(x);
            x += 1;
        }
        //täydennetään toisen kerroksen leimat
        for(int i=0; i < n; i++){
            if(s1[i] != '?'){
                if(leima.find(s[i]) != std::string::npos){
                    int b = leima.find(s[i]);
                    
                    s1.replace(i-b, m, leima);
                    
                    iList.push_back(i-b);
                    
                    s1.replace(i-b, m, tayte);
                }
                
            }
        }
        //täydennetään päällimmäiset leimat
        x = 0;
        while(s.find(leima, x) != std::string::npos){
            x = s.find(leima, x);
            s1.replace(x, m, leima);
            iList.push_back(x);
            x += 1;
        }
        
        reverse(iList.begin(), iList.end());
        
        
    }
    
    
    if(s1 != s && ok){
        cout<<-1;
    }else if(ok){
        cout<<iList.size()<<"\n";
        for (int i = 0; i < iList.size(); i++) {
            cout << iList[i]+1 << " ";
        }
    }
    
 
    
    return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: WRONG ANSWER

Test 7

Group: 1

Verdict: WRONG ANSWER

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: WRONG ANSWER

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: ACCEPTED

Test 20

Group: 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 2

Verdict: ACCEPTED

Test 29

Group: 3

Verdict: WRONG ANSWER

Test 30

Group: 3

Verdict: WRONG ANSWER

Test 31

Group: 3

Verdict: WRONG ANSWER

Test 32

Group: 3

Verdict: ACCEPTED

Test 33

Group: 3

Verdict: ACCEPTED

Test 34

Group: 3

Verdict: WRONG ANSWER

Test 35

Group: 3

Verdict: WRONG ANSWER

Test 36

Group: 3

Verdict: WRONG ANSWER

Test 37

Group: 3

Verdict: ACCEPTED

Test 38

Group: 3

Verdict: ACCEPTED

Test 39

Group: 3

Verdict: ACCEPTED

Test 40

Group: 3

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: ACCEPTED