#include <stdio.h>
 
int main() {
  int num, result;
 
  // Input a 3-digit number
  printf("Enter old boring store number:\n ");
  scanf("%d", &num);
 
  // Apply transformations based on the given rules
  if (num < 10) {
    result = num + 50;
  } else if (num >= 10 && num <= 99) {
    result = num; // No change for numbers between 10 and 99
  } else if (num >= 300 && num <= 500) {
    result = num - 200; // For numbers between 300 and 500, subtract 200
  } else if (num > 500) {
    result = num - 300; // For numbers above 500, subtract 300
    // If result is greater than 255, subtract another 100
    if (result > 255) {
      result -= 100;
    }
  } else {
    result = num; // Default case (for numbers between 100 and 299)
  }
 
  // Print the final result
  printf("New super cool improved mega store number:\n %d\n", result);
 
  return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbigpIHsKICBpbnQgbnVtLCByZXN1bHQ7CgogIC8vIElucHV0IGEgMy1kaWdpdCBudW1iZXIKICBwcmludGYoIkVudGVyIG9sZCBib3Jpbmcgc3RvcmUgbnVtYmVyOlxuICIpOwogIHNjYW5mKCIlZCIsICZudW0pOwoKICAvLyBBcHBseSB0cmFuc2Zvcm1hdGlvbnMgYmFzZWQgb24gdGhlIGdpdmVuIHJ1bGVzCiAgaWYgKG51bSA8IDEwKSB7CiAgICByZXN1bHQgPSBudW0gKyA1MDsKICB9IGVsc2UgaWYgKG51bSA+PSAxMCAmJiBudW0gPD0gOTkpIHsKICAgIHJlc3VsdCA9IG51bTsgLy8gTm8gY2hhbmdlIGZvciBudW1iZXJzIGJldHdlZW4gMTAgYW5kIDk5CiAgfSBlbHNlIGlmIChudW0gPj0gMzAwICYmIG51bSA8PSA1MDApIHsKICAgIHJlc3VsdCA9IG51bSAtIDIwMDsgLy8gRm9yIG51bWJlcnMgYmV0d2VlbiAzMDAgYW5kIDUwMCwgc3VidHJhY3QgMjAwCiAgfSBlbHNlIGlmIChudW0gPiA1MDApIHsKICAgIHJlc3VsdCA9IG51bSAtIDMwMDsgLy8gRm9yIG51bWJlcnMgYWJvdmUgNTAwLCBzdWJ0cmFjdCAzMDAKICAgIC8vIElmIHJlc3VsdCBpcyBncmVhdGVyIHRoYW4gMjU1LCBzdWJ0cmFjdCBhbm90aGVyIDEwMAogICAgaWYgKHJlc3VsdCA+IDI1NSkgewogICAgICByZXN1bHQgLT0gMTAwOwogICAgfQogIH0gZWxzZSB7CiAgICByZXN1bHQgPSBudW07IC8vIERlZmF1bHQgY2FzZSAoZm9yIG51bWJlcnMgYmV0d2VlbiAxMDAgYW5kIDI5OSkKICB9CgogIC8vIFByaW50IHRoZSBmaW5hbCByZXN1bHQKICBwcmludGYoIk5ldyBzdXBlciBjb29sIGltcHJvdmVkIG1lZ2Egc3RvcmUgbnVtYmVyOlxuICVkXG4iLCByZXN1bHQpOwoKICByZXR1cm4gMDsKfQo=

LyogIEJlcmVjaG51bmcgZGVzIEhhbW1pbmctQWJzdGFuZGVzIHp3aXNjaGVuIHp3ZWkgMTI4LUJpdCBXZXJ0ZW4gaW4gCSovCi8qCWVpbmVyIFRleHRkYXRlaS4gCQkJCQkJCQkJCQkJCSovCi8qICBEaWUgV2VydGUgbSZ1dW1sO3NzZW4gYXVmIGVpbmVyIHNlcGFyYXRlbiBaZWlsZSBnZXNwZWljaGVydCBzZWluCQkJKi8KLyogCQkJCQkJCQkJCQkJCQkJCQkJKi8KLyoJRXJzdGVsbHQ6IDE3LjUuMjAxMAkJCQkJCQkJCQkJCQkqLwovKiAgQXV0b3I6IFRob21hcyBTY2hlZmZsZXIJCQkJCQkJCQkJCQkqLwoKI2luY2x1ZGUgJmx0O3N0ZGlvLmgmZ3Q7CiNpbmNsdWRlICZsdDtzdGRsaWIuaCZndDsKCiNkZWZpbmUgQVJSQVlfU0laRSAzMgoKdW5zaWduZWQgSGFtZGlzdCh1bnNpZ25lZCB4LCB1bnNpZ25lZCB5KQp7CiAgdW5zaWduZWQgZGlzdCA9IDAsIHZhbCA9IHggXiB5OwogCiAgLy8gQ291bnQgdGhlIG51bWJlciBvZiBzZXQgYml0cwogIHdoaWxlKHZhbCkKICB7CiAgICArK2Rpc3Q7IAogICAgdmFsICZhbXA7PSB2YWwgLSAxOwogIH0KIAogIHJldHVybiBkaXN0Owp9CgoKCmludCBtYWluICh2b2lkKQp7CgljaGFyIGhleDsKCWludCBpOwoJaW50IGFbQVJSQVlfU0laRV07CglpbnQgYltBUlJBWV9TSVpFXTsKCWludCBoYW1EaXN0ID0gMDsKCUZJTEUqIGZwOwoJCgkvL0FycmF5cyBtaXQgMCBpbml0aWFsaXNpZXJlbgoJZm9yIChpID0gMDsgaSAmbHQ7IEFSUkFZX1NJWkU7ICsraSkKCXsKICAJCWFbaV0gPSAwOwogIAkJYltpXSA9IDA7Cgl9CgoJCglmcCA9IGZvcGVuKCZxdW90O2hleC50eHQmcXVvdDssJnF1b3Q7ciZxdW90Oyk7CglpZiAoZnAgPT0gTlVMTCkgCgl7CgkJcHJpbnRmKCZxdW90O0RpZSBEYXRlaSBoZXgudHh0IHd1cmRlIG5pY2h0IGdlZnVuZGVuISZxdW90Oyk7CgkJZXhpdChFWElUX0ZBSUxVUkUpOwoJfQoKCWk9MDsKCXByaW50ZigmcXVvdDsxLlplaWxlIGVpbmxlc2VuLlxuJnF1b3Q7KTsKCiAJd2hpbGUoKGhleD1mZ2V0YyhmcCkpIT0nXG4nICZhbXA7JmFtcDsgaGV4ICE9IEVPRikKICAgIHsKICAgICAgICBhW2ldPXN0cnRvbCgmYW1wO2hleCwwLDE2KTsKCQlpKys7CiAgICB9CglpPTA7CglwcmludGYoJnF1b3Q7Mi5aZWlsZSBlaW5sZXNlbi5cbiZxdW90Oyk7CgogCXdoaWxlKChoZXg9ZmdldGMoZnApKSE9J1xuJyAmYW1wOyZhbXA7IGhleCAhPSBFT0YpCiAgICB7CiAgICAJYltpXT1zdHJ0b2woJmFtcDtoZXgsMCwxNik7CiAgICAgICAgaSsrOwogICAgfQoJZmNsb3NlKGZwKTsKCglwcmludGYoJnF1b3Q7SGFtbWluZy1BYndlaWNodW5nIHBybyBOaWJibGU6XG4mcXVvdDspOwoJZm9yIChpID0gMDsgaSAmbHQ7IEFSUkFZX1NJWkU7ICsraSkKCXsKCQlwcmludGYgKCZxdW90OyVpXHQlaVx0JWlcbiZxdW90OyxhW2ldLGJbaV0sSGFtZGlzdChhW2ldLGJbaV0pKTsKCQloYW1EaXN0ICs9IEhhbWRpc3QoYVtpXSxiW2ldKTsKCX0KCXByaW50ZiAoJnF1b3Q7XG5IYW1taW5nLUFid2VpY2h1bmcgZGVyIEhhc2gtV2VydGU6JWRcbiZxdW90OyxoYW1EaXN0KTsKfQoK

/*  Berechnung des Hamming-Abstandes zwischen zwei 128-Bit Werten in 	*/
/*	einer Textdatei. 													*/
/*  Die Werte müssen auf einer separaten Zeile gespeichert sein			*/
/* 																		*/
/*	Erstellt: 17.5.2010													*/
/*  Autor: Thomas Scheffler												*/

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

#define ARRAY_SIZE 32

unsigned Hamdist(unsigned x, unsigned y)
{
  unsigned dist = 0, val = x ^ y;
 
  // Count the number of set bits
  while(val)
  {
    ++dist; 
    val &= val - 1;
  }
 
  return dist;
}



int main (void)
{
	char hex;
	int i;
	int a[ARRAY_SIZE];
	int b[ARRAY_SIZE];
	int hamDist = 0;
	FILE* fp;
	
	//Arrays mit 0 initialisieren
	for (i = 0; i < ARRAY_SIZE; ++i)
	{
  		a[i] = 0;
  		b[i] = 0;
	}

	
	fp = fopen("hex.txt","r");
	if (fp == NULL) 
	{
		printf("Die Datei hex.txt wurde nicht gefunden!");
		exit(EXIT_FAILURE);
	}

	i=0;
	printf("1.Zeile einlesen.\n");

 	while((hex=fgetc(fp))!='\n' && hex != EOF)
    {
        a[i]=strtol(&hex,0,16);
		i++;
    }
	i=0;
	printf("2.Zeile einlesen.\n");

 	while((hex=fgetc(fp))!='\n' && hex != EOF)
    {
    	b[i]=strtol(&hex,0,16);
        i++;
    }
	fclose(fp);

	printf("Hamming-Abweichung pro Nibble:\n");
	for (i = 0; i < ARRAY_SIZE; ++i)
	{
		printf ("%i\t%i\t%i\n",a[i],b[i],Hamdist(a[i],b[i]));
		hamDist += Hamdist(a[i],b[i]);
	}
	printf ("\nHamming-Abweichung der Hash-Werte:%d\n",hamDist);
}