O(1) is the most efficient, then O(n) and O(xn) is least efficient..
pawn Код:
new Skins[284] =
{
20,21,22,23,24,25,67,26,27,28,29,30,31,32,33,
34,35,36,37,38,39,40,41,43,44,45,46,47,48,49,
50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,
68,69,70,71,72,73,75,76,77,78,79,80,81,82,83,
84,85,87,88,89,90,91,92,93,94,95,96,97,98,99,
101,102,103,104,105,106,107,108,109,110,111,
112,113,114,115,116,117,118,120,121,122,123,
124,125,126,127,128,129,130,131,132,133,134,
135,136,137,138,139,140,141,142,143,144,145,
146,147,148,150,151,152,153,154,155,156,157,
158,159,160,161,162,163,164,165,166,167,168,
169,170,171,172,173,174,175,176,177,178,179,
180,181,182,183,184,185,186,187,188,189,190,
191,192,193,194,195,196,197,198,199,200,201,
202,203,204,205,206,207,209,210,211,212,213,
214,215,216,217,218,219,220,221,222,223,224,
225,226,227,228,229,230,231,232,233,234,235,
236,237,238,239,240,241,242,243,244,245,246,
247,248,249,250,251,252,253,254,255,255,257,
258,259,260,261,262,263,264,265,266,267,268,
269,270,271,272,274,275,276,277,278,279,280,
281,282,283,284,285,286,287,288,290,291,292,
293,294,295,296,297,298,299,0,1,2,7,9,10,11,
12,13,14,15,16,17,18,19
};
main()
{
GenerateList("Gamemode.pwn", "IsValidSkin", Skins, true);
}
stock IsValidSkin(skinid)
{
if(skinid >= 0 && skinid <= 2 || skinid == 7 || skinid >= 9 && skinid <= 41 || skinid >= 43 && skinid <= 64 || skinid >= 66 && skinid <= 73 || skinid >= 75 && skinid <= 85 || skinid >= 87 &&
skinid <= 118 || skinid >= 120 && skinid <= 148 || skinid >= 150 && skinid <= 207 || skinid >= 209 && skinid <= 264 || skinid >= 274 && skinid <= 288 || skinid >= 290 && skinid <= 299) return 1;
return 0;
}
from line 11194, so I dont know why theres bool.. :\