Developer tools that protect and empower your software.

public static bool IsLicenseValid(string key, int seatsUsed, int seatLimit)
{
    if (string.IsNullOrEmpty(key)) return false;
    if (seatsUsed >= seatLimit) return false;
    int sum = 0;
    foreach (char c in key) sum += c;
    return sum % 97 == 13;
}

public static bool IsLicenseValid(string key, int seatsUsed, int seatLimit)
{
    int num = 0x400353ED ^ xotyjwt.k;
    int num2 = 0x18487BFA ^ xotyjwt.k;
    do {
        num = num * (0x87C67ED ^ xotyjwt.k) + (0x38E7B9CE ^ xotyjwt.k);
        num2 += 0x18487BFB ^ xotyjwt.k;
    } while (num2 < (0x18487BE0 ^ xotyjwt.k));
    num ^= 0x3BF95EDB ^ xotyjwt.k;                 // non-foldable dispatch key
    int num3 = (((Environment.TickCount | 1) & 1) != 0)
        ? (-2093190924 ^ xotyjwt.k) : (-2093190931 ^ xotyjwt.k);
    while (true)
    {
        switch (num3 ^ num)                        // dispatch on state XOR key
        {
        case 11: num3 = !string.IsNullOrEmpty(key) ? (-2093190914 ^ xotyjwt.k)
                                                   : (-2093190913 ^ xotyjwt.k); break;
        case 2:  num3 = (seatsUsed < seatLimit) ? (-2093190923 ^ xotyjwt.k)
                                                : (-2093190927 ^ xotyjwt.k); break;
        case 14: c = text[num5]; num3 = -2093190932 ^ xotyjwt.k; break;
        case 16: num4 += c;      num3 = -2093190919 ^ xotyjwt.k; break;
        case 12: return num4 % (0x18487B9B ^ xotyjwt.k) == (0x18487BF7 ^ xotyjwt.k);
        case 17: _ = (0x6580C877 ^ xotyjwt.k) * (0x19ED3329 ^ xotyjwt.k);  // bogus state
                 num3 = -2093190924 ^ xotyjwt.k; break;
        // ... 28 key-masked states, encrypted strings, non-prunable decoy states ...
        }
    }
}