Merkkijonot

input/code.cpp: In function 'int* muutanumeroiksi(char*)':
input/code.cpp:23:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<strlen(sana); i++){
                  ~^~~~~~~~~~~~~
input/code.cpp:27:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int a=i+1;a<strlen(sana2);a++){
                           ~^~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:143:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&maara);
     ~~~~~^~~~~~~~~~~~~
input/code.cpp:154:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s",read);
         ~~~~~^~~~~~~~~~~

//
//  main.c
//  datatahti
//
//  Created by aapo haavisto on 10/11/19.
//  Copyright © 2019 Aapo Haavisto. All rights reserved.
//

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

/*struct x{
    int* lista;
    int pituus;
};*/


int * muutanumeroiksi(char* sana){
    int* lista=(int*)malloc((strlen(sana)+1)*sizeof(int));
    char* sana2=(char*)malloc((strlen(sana)+1)*sizeof(char));
    strcpy(sana2, sana);
    for (int i=0;i<strlen(sana); i++){
        
        if(sana2[i]!=0){
            lista[i]=i;
            for(int a=i+1;a<strlen(sana2);a++){
                if (sana2[a]==sana2[i]){
                lista[a]=i;
                    sana2[a]=0;
                }
                
            }
        }
        //printf("%i",lista[i]);
    }
    free(sana2);
    lista[strlen(sana)]=-1;
    return lista;
}


/*struct x etsisamat(char* sana,char merkki){
   
    struct x palautettava;
    palautettava.lista=(int*)malloc(51*sizeof(int));
    palautettava.pituus=0;
    for (int i=0; i<strlen(sana); i++) {
        if (sana[i]==merkki){
            palautettava.lista[palautettava.pituus]=i;
            palautettava.pituus++;
        }
    }
    return palautettava;
}

int onkoharmoniset(char* a,char* b){
    if (strlen(a)!=strlen(b))
        return 0;
    char* c=a;
    char* d=b;
    
    for (int i=0; i<strlen(a); i++){
        struct x cee=etsisamat(c, c[i]);
        struct x dee=etsisamat(d, d[i]);
        
        if(c[i]!=0){
            if (memcmp(cee.lista, dee.lista, cee.pituus*sizeof(int))) {
                return 0;
            }
        }
    }
    
    
    
    return 1;
}

int main(void){
   
    
    int maara;
    scanf("%i",&maara);
    int parit=0;
    
    char** kokolista=(char**)malloc(maara*sizeof(char*));
    
    
    //luetaan merkkijonot
    for (int i=0; i<maara; i++){
        kokolista[i]=(char*)malloc(51*sizeof(char));
        scanf("%s",kokolista[i]);
    }
    
    for (int i= 0; i<maara; i++) {
        for (int a=i+1; a<maara; a++) {
            //if (((kokolista[i][0]!=kokolista[i][1])&&(kokolista[a][0]!=kokolista[a][1]))||((kokolista[i][0]==kokolista[i][1])&&(kokolista[a][0]==kokolista[a][1]))) {
                
            
            if(strlen(kokolista[i])==strlen(kokolista[a])){
                if (onkoharmoniset(kokolista[i], kokolista[a])){
                parit++;
                }
        }
        //}
        }
    printf("%i",parit);
    for (int i=0; i<maara; i++)
        free(kokolista[i]);
    free(kokolista);
}*/

int onkosama(int* a,int* b){
    int nyt=0;
    while(a[nyt]!=-1){
        if(a[nyt]!=b[nyt])
            return 0;
        nyt++;
    }
    if(b[nyt]==-1)
        return 1;
    else
        return 0;
}

int main(void){
    //test onkosama
    /*int* test=malloc(5*sizeof(int));
    test[0]=0;
    test[1]=0;
    test[2]=2;
    test[3]=3;
    test[4]=-1;
    printf("%i",onkosama(test, test));*/
    /*char* moi=malloc(7*sizeof(char));
    moi="abcdef";
    int* oo=muutanumeroiksi(moi);
    for (int i=0; i<7; i++) {
        printf("%i o",oo[i]);
    }*/
    
    int maara;
    scanf("%i",&maara);
    int parit=0;
    
    int** numerolista=(int**)malloc(maara*sizeof(int*));
    
    
    //luetaan merkkijonot
    for (int i=0; i<maara; i++){
        char* read=(char*)malloc(51*sizeof(char));
        numerolista[i]=(int*)malloc(51*sizeof(int));
        //printf("testi");
        scanf("%s",read);
        numerolista[i]=muutanumeroiksi(read);
        free(read);
    }
    for (int i=0; i<maara-1; i++) {
        int loytyi=0;
        if (numerolista[i][0]!=-1) {
        for (int a=i+1; a<maara; a++) {
            if (onkosama(numerolista[i], numerolista[a])){
                loytyi++;
                numerolista[a][0]=-1;
            }
        }
            
    }
        //printf("loytyi %i ",loytyi);
        if (loytyi>0)
            parit=parit+((loytyi+1)*loytyi)/2;
        //printf("parit %i ",parit);
}
    for (int i=0; i<maara; i++){
        free(numerolista[i]);
    }
    free(numerolista);
    printf("%i",parit);
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 3

Verdict: WRONG ANSWER

Test 5

Group: 3

Verdict: WRONG ANSWER

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

Test 11

Group: 2, 3

Verdict: WRONG ANSWER

Test 12

Group: 2, 3

Verdict: WRONG ANSWER

Test 13

Group: 2, 3

Verdict: WRONG ANSWER

Test 14

Group: 2, 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 21

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 22

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 23

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 24

Group: 1, 2, 3

Verdict: WRONG ANSWER