Submission

Score: 100

User: theem1502

Problemset: อะนาแกรม 2

Language: c

Time: 0.002 second

Submitted On: 2025-09-20 14:59:05

#include <stdio.h>


int abs(int n) {
    if (n > 0) {
        return n;
    }
    else {
        return -1 * n;
    }
}
int main() {
    char str1[10001], str2[10001];
    scanf("%s %s", str1, str2);

    int length1 = 0;
    while (str1[length1] != '\0') {
        length1++;
    }

    int length2 = 0;
    while (str2[length2] != '\0') {
        length2++;
    }

    int mapping1[8] = {0}, mapping2[8] = {0};

 
    
    for (int i = 0; i < length1; i++) {
        mapping1[str1[i] - 'A']++;
    }
 
    for (int i = 0; i < length2; i++) {
        mapping2[str2[i]- 'A']++;
    }


    int diff[8] = {0};
    for (int i = 0;i<8; i++) {
        diff[i] = abs(mapping1[i] - mapping2[i]);
    }

    int sumdiff = 0;
    for (int i = 0; i < 8; i++) {
        sumdiff+= diff[i];
    }

    for (int i = 0; i < 8; i++) {
        printf("%d ", mapping1[i]);
    }
    printf("\n");

    for (int i = 0; i < 8; i++) {
        printf("%d ", mapping2[i]);
    }
    printf("\n");

    for (int i = 0; i < 8; i++) {
        printf("%d ", diff[i]);
    }
    printf("\n");
    if (sumdiff > 3) {
        printf("%s", "no");
    }
    else {
        printf("%s", "anagram");
    }
}