int main()
{
int p[8], i, j;
while (gets(buf)) {
memset(p, 0, sizeof(p));
p[1] = check1();
if (p[1]) {
p[2] = ispal(s2);
p[3] = check3();
p[4] = check4();
p[5] = check5();
p[6] = check6();
p[7] = check7();
}
for (i = 1, j = 1; i <= 7; i++) {
putchar(p[i] ? 'T' : 'F');
j &= p[i];
}
printf(" The solution is %s\n", j ? "accepted" : "not accepted");
}
return 0;
}
void State::updateLine(const Test & test)
{
size_t i = 0;
Block old = SPACE;
while (i < test->line.size()) {
if (old != test->line[i] && test->line[i] != SPACE) {
bool win = check5(test, i);
if (win) {
_winner = get(test->position[i]);
}
else {
auto attackable = check4(test, i);
if (attackable->rank != NONE) {
_attackables.push_back(attackable);
} else {
auto attackable = check3(test, i);
if (attackable->rank != NONE) {
_attackables.push_back(attackable);
} else {
auto attackable = check(test, i);
if (attackable->rank != NONE) {
_attackables.push_back(attackable);
}
}
}
}
}
old = test->line[i];
++i;
}
}
bool Control::check(std::vector<int> &n)
{
getOutCard(n);
bool result=false;
switch (n.size())
{
case 1:
result=check1();
break;
case 2:
result=check2();
break;
case 3:
result=check3();
break;
case 4:
result=check4();
break;
case 5:
result=check5();
break;
case 6:
result=check6();
break;
case 7:
case 11:
case 13:
result=check7();
break;
case 8:
result=check8();
break;
case 9:
result=check9();
break;
case 10:
result=check10();
break;
case 12:
result=check12();
break;
case 14:
result=check14();
break;
case 15:
result=check15();
break;
case 16:
result=check16();
break;
}
return result;
}
int main()
{
int t;
long int len;
char str[65536];
scanf("%d", &t);
while (t--) {
scanf("%s", str);
len = strlen(str);
if (len < 3) {
printf("No No\n");
continue; }
check2(str);
printf(" ");
check5(str);
printf("\n");
}
return 0;
}
int check(int length1, float *number3, int *oper3){
if (length1 == 1)
return check1(number3,oper3);
if (length1 == 2)
return check2(number3,oper3);
if (length1 == 3)
return check3(number3,oper3);
if (length1 == 4)
return check4(number3,oper3);
if (length1 == 5)
return check5(number3,oper3);
if (length1 == 6)
return check6(number3,oper3);
if (length1 == 7)
return check7(number3,oper3);
if (length1 == 8)
return check8(number3,oper3);
if (length1 == 9)
return check9(number3,oper3);
if (length1 == 10)
return check10(number3,oper3);
return 0;
}
int
main (int argc, char** argv)
{
double x = 2.0;
double y = -5.0;
double epsilon = 0.00001;
double expected = -2.0;
if (fabs (check (x, y) - expected) >= epsilon)
__builtin_abort ();
expected = 2.0;
if (fabs (check1 (x) - expected) >= epsilon)
__builtin_abort ();
expected = 1.0;
if (fabs (check2 (x) - expected) >= epsilon)
__builtin_abort ();
expected = -2.0;
if (fabs (check3 (x) - expected) >= epsilon)
__builtin_abort ();
expected = -4.0;
if (fabs (check4 (x, y) - expected) >= epsilon)
__builtin_abort ();
expected = 2.0;
if (fabs (check5 (x, y) - expected) >= epsilon)
__builtin_abort ();
}
int main(){
freopen("transform.in", "r", stdin);
freopen("transform.out", "w", stdout);
scanf("%d", &total_length);
for(int i = 0; i < total_length; ++i)
scanf("%s", before[i]);
for(int i = 0; i < total_length; ++i)
scanf("%s", after[i]);
if(check1())
printf("1\n");
else if(check2())
printf("2\n");
else if(check3())
printf("3\n");
else if(check4())
printf("4\n");
else if(check5())
printf("5\n");
else if(check6())
printf("6\n");
else
printf("7\n");
return 0;
}
int
main (int argc, char *argv[])
{
#ifdef MPFR_HAVE_FESETROUND
int prec, rnd_mode;
int rnd;
double y;
#endif
double x;
int i;
mpfr_test_init ();
check_inexact ();
check_case_1b ();
check_case_2 ();
check64();
check(293607738.0, 1.9967571564050541e-5, GMP_RNDU, 64, 53, 53,
2.9360773800002003e8);
check(880524.0, -2.0769715792901673e-5, GMP_RNDN, 64, 53, 53,
8.8052399997923023e5);
check(1196426492.0, -1.4218093058435347e-3, GMP_RNDN, 64, 53, 53,
1.1964264919985781e9);
check(982013018.0, -8.941829477291838e-7, GMP_RNDN, 64, 53, 53,
9.8201301799999905e8);
check(1092583421.0, 1.0880649218158844e9, GMP_RNDN, 64, 53, 53,
2.1806483428158846e9);
check(1.8476886419022969e-6, 961494401.0, GMP_RNDN, 53, 64, 53,
9.6149440100000179e8);
check(-2.3222118418069868e5, 1229318102.0, GMP_RNDN, 53, 64, 53,
1.2290858808158193e9);
check(-3.0399171300395734e-6, 874924868.0, GMP_RNDN, 53, 64, 53,
8.749248679999969e8);
check(9.064246624706179e1, 663787413.0, GMP_RNDN, 53, 64, 53,
6.6378750364246619e8);
check(-1.0954322421551264e2, 281806592.0, GMP_RNDD, 53, 64, 53,
2.8180648245677572e8);
check(5.9836930386056659e-8, 1016217213.0, GMP_RNDN, 53, 64, 53,
1.0162172130000001e9);
check(-1.2772161928500301e-7, 1237734238.0, GMP_RNDN, 53, 64, 53,
1.2377342379999998e9);
check(-4.567291988483277e8, 1262857194.0, GMP_RNDN, 53, 64, 53,
8.0612799515167236e8);
check(4.7719471752925262e7, 196089880.0, GMP_RNDN, 53, 53, 53,
2.4380935175292528e8);
check(4.7719471752925262e7, 196089880.0, GMP_RNDN, 53, 64, 53,
2.4380935175292528e8);
check(-1.716113812768534e-140, 1271212614.0, GMP_RNDZ, 53, 64, 53,
1.2712126139999998e9);
check(-1.2927455200185474e-50, 1675676122.0, GMP_RNDD, 53, 64, 53,
1.6756761219999998e9);
check53(1.22191250737771397120e+20, 948002822.0, GMP_RNDN,
122191250738719408128.0);
check53(9966027674114492.0, 1780341389094537.0, GMP_RNDN,
11746369063209028.0);
check53(2.99280481918991653800e+272, 5.34637717585790933424e+271, GMP_RNDN,
3.5274425367757071711e272);
check_same();
check53(6.14384195492641560499e-02, -6.14384195401037683237e-02, GMP_RNDU,
9.1603877261370314499e-12);
check53(1.16809465359248765399e+196, 7.92883212101990665259e+196, GMP_RNDU,
9.0969267746123943065e196);
check53(3.14553393112021279444e-67, 3.14553401015952024126e-67, GMP_RNDU,
6.2910679412797336946e-67);
SEED_RAND (time(NULL));
check53(5.43885304644369509058e+185,-1.87427265794105342763e-57,GMP_RNDN,
5.4388530464436950905e185);
check53(5.43885304644369509058e+185,-1.87427265794105342763e-57, GMP_RNDZ,
5.4388530464436944867e185);
check53(5.43885304644369509058e+185,-1.87427265794105342763e-57, GMP_RNDU,
5.4388530464436950905e185);
check53(5.43885304644369509058e+185,-1.87427265794105342763e-57, GMP_RNDD,
5.4388530464436944867e185);
check2a(6.85523243386777784171e+107,187,-2.78148588123699111146e+48,87,178,
GMP_RNDD, "4.ab980a5cb9407ffffffffffffffffffffffffffffffe@89");
check2a(-1.21510626304662318398e+145,70,1.21367733647758957118e+145,65,61,
GMP_RNDD, "-1.2bfad031d94@118");
check2a(2.73028857032080744543e+155,83,-1.16446121423113355603e+163,59,125,
GMP_RNDZ, "-3.3c42dee09703d0639a6@135");
check2a(-4.38589520019641698848e+78,155,-1.09923643769309483415e+72,15,159,
GMP_RNDD, "-2.5e09955c663d@65");
check2a(-1.49963910666191123860e+265,76,-2.30915090591874527520e-191,8,75,
GMP_RNDZ, "-1.dc3ec027da54e@220");
check2a(3.25471707846623300604e-160,81,-7.93846654265839958715e-274,58,54,
GMP_RNDN, "4.936a52bc17254@-133");
check2a(5.17945380930936917508e+112,119,1.11369077158813567738e+108,15,150,
GMP_RNDZ, "5.62661692498ec@93");
check2a(-2.66910493504493276454e-52,117,1.61188644159592323415e-52,61,68,
GMP_RNDZ, "-a.204acdd25d788@-44");
check2a(-1.87427265794105342764e-57,175,1.76570844587489516446e+190,2,115,
GMP_RNDZ, "b.fffffffffffffffffffffffffffe@157");
check2a(-1.15706375390780417299e-135,94,-1.07455137477117851576e-129,66,111,
GMP_RNDU, "-b.eae2643497ff6286b@-108");
check2a(-1.15706375390780417299e-135,94,-1.07455137477117851576e-129,66,111,
GMP_RNDD, "-b.eae2643497ff6286b@-108");
check2a(-3.31624349995221499866e-22,107,-8.20150212714204839621e+156,79,99,
GMP_RNDD, "-2.63b22b55697e8000000000008@130");
x = -5943982715394951.0; for (i=0; i<446; i++) x *= 2.0;
check2a(x, 63, 1.77607317509426332389e+73, 64, 64, GMP_RNDN,
"-5.4781549356e1c@124");
check2a(4.49465557237618783128e+53,108,-2.45103927353799477871e+48,60,105,
GMP_RNDN, "4.b14f230f909dc803e@44");
check2a(2.26531902208967707071e+168,99,-2.67795218510613988524e+168,67,94,
GMP_RNDU, "-1.bfd7ff2647098@139");
check2a(-8.88471912490080158206e+253,79,-7.84488427404526918825e+124,95,53,
GMP_RNDD, "-c.1e533b8d835@210");
check2a(-2.18548638152863831959e-125,61,-1.22788940592412363564e+226,71,54,
GMP_RNDN, "-8.4b0f99ffa3b58@187");
check2a(-7.94156823309993162569e+77,74,-5.26820160805275124882e+80,99,101,
GMP_RNDD, "-1.1cc90f11d6af26f4@67");
check2a(-3.85170653452493859064e+189,62,2.18827389706660314090e+158,94,106,
GMP_RNDD, "-3.753ac0935b701ffffffffffffd@157");
check2a(1.07966151149311101950e+46,88,1.13198076934147457400e+46,67,53,
GMP_RNDN, "3.dfbc152dd4368@38");
check2a(3.36768223223409657622e+209,55,-9.61624007357265441884e+219,113,53,
GMP_RNDN, "-6.cf7217a451388@182");
check2a(-6.47376909368979326475e+159,111,5.11127211034490340501e+159,99,62,
GMP_RNDD, "-1.8cf3aadf537c@132");
check2a(-4.95229483271607845549e+220,110,-6.06992115033276044773e+213,109,55,
GMP_RNDN, "-2.3129f1f63b31b@183");
check2a(-6.47376909368979326475e+159,74,5.11127211034490340501e+159,111,75,
GMP_RNDU, "-1.8cf3aadf537c@132");
check2a(2.26531902208967707070e+168,99,-2.67795218510613988525e+168,67,94,
GMP_RNDU, "-1.bfd7ff2647098@139");
check2a(-2.28886326552077479586e-188,67,3.41419438647157839320e-177,60,110,
GMP_RNDU, "3.75740b4fe8f17f90258907@-147");
check2a(-2.66910493504493276454e-52,117,1.61188644159592323415e-52,61,68,
GMP_RNDZ, "-a.204acdd25d788@-44");
check2a(2.90983392714730768886e+50,101,2.31299792168440591870e+50,74,105,
GMP_RNDZ, "1.655c53ff5719c8@42");
check2a(2.72046257722708717791e+243,97,-1.62158447436486437113e+243,83,96,
GMP_RNDN, "a.4cc63e002d2e8@201");
/* Checking double precision (53 bits) */
check53(-8.22183238641455905806e-19, 7.42227178769761587878e-19, GMP_RNDD,
-7.9956059871694317927e-20);
check53(5.82106394662028628236e+234, -5.21514064202368477230e+89, GMP_RNDD,
5.8210639466202855763e234);
check53(5.72931679569871602371e+122, -5.72886070363264321230e+122, GMP_RNDN,
4.5609206607281141508e118);
check53(-5.09937369394650450820e+238, 2.70203299854862982387e+250, GMP_RNDD,
2.7020329985435301323e250);
check53(-2.96695924472363684394e+27, 1.22842938251111500000e+16, GMP_RNDD,
-2.96695924471135255027e27);
check53(1.74693641655743793422e-227, -7.71776956366861843469e-229, GMP_RNDN,
1.669758720920751867e-227);
x = -7883040437021647.0; for (i=0; i<468; i++) x = x / 2.0;
check53(-1.03432206392780011159e-125, 1.30127034799251347548e-133, GMP_RNDN,
x);
check53(1.05824655795525779205e+71, -1.06022698059744327881e+71, GMP_RNDZ,
-1.9804226421854867632e68);
check53(-5.84204911040921732219e+240, 7.26658169050749590763e+240, GMP_RNDD,
1.4245325800982785854e240);
check53(1.00944884131046636376e+221, 2.33809162651471520268e+215, GMP_RNDN,
1.0094511794020929787e221);
x = 7045852550057985.0; for (i=0; i<986; i++) x = x / 2.0;
check53(4.29232078932667367325e-278, x, GMP_RNDU,
4.2933981418314132787e-278);
check53(5.27584773801377058681e-80, 8.91207657803547196421e-91, GMP_RNDN,
5.2758477381028917269e-80);
check53(2.99280481918991653800e+272, 5.34637717585790933424e+271, GMP_RNDN,
3.5274425367757071711e272);
check53(4.67302514390488041733e-184, 2.18321376145645689945e-190, GMP_RNDN,
4.6730273271186420541e-184);
check53(5.57294120336300389254e+71, 2.60596167942024924040e+65, GMP_RNDZ,
5.5729438093246831053e71);
check53(6.6052588496951015469e24, 4938448004894539.0, GMP_RNDU,
6.6052588546335505068e24);
check53(1.23056185051606761523e-190, 1.64589756643433857138e-181, GMP_RNDU,
1.6458975676649006598e-181);
check53(2.93231171510175981584e-280, 3.26266919161341483877e-273, GMP_RNDU,
3.2626694848445867288e-273);
check53(5.76707395945001907217e-58, 4.74752971449827687074e-51, GMP_RNDD,
4.747530291205672325e-51);
check53(277363943109.0, 11.0, GMP_RNDN, 277363943120.0);
#if 0 /* disabled since it seems silly to use denorms *
/* test denormalized numbers too */
check53(8.06294740693074521573e-310, 6.95250701071929654575e-310, GMP_RNDU,
1.5015454417650041761e-309);
#endif
#ifdef HAVE_INFS
/* the following check double overflow */
check53(6.27557402141211962228e+307, 1.32141396570101687757e+308,
GMP_RNDZ, DBL_POS_INF);
check53(DBL_POS_INF, 6.95250701071929654575e-310, GMP_RNDU, DBL_POS_INF);
check53(DBL_NEG_INF, 6.95250701071929654575e-310, GMP_RNDU, DBL_NEG_INF);
check53(6.95250701071929654575e-310, DBL_POS_INF, GMP_RNDU, DBL_POS_INF);
check53(6.95250701071929654575e-310, DBL_NEG_INF, GMP_RNDU, DBL_NEG_INF);
check53nan (DBL_POS_INF, DBL_NEG_INF, GMP_RNDN);
#endif
check53(1.44791789689198883921e-140, -1.90982880222349071284e-121,
GMP_RNDN, -1.90982880222349071e-121);
/* tests for particular cases (Vincent Lefevre, 22 Aug 2001) */
check53(9007199254740992.0, 1.0, GMP_RNDN, 9007199254740992.0);
check53(9007199254740994.0, 1.0, GMP_RNDN, 9007199254740996.0);
check53(9007199254740992.0, -1.0, GMP_RNDN, 9007199254740991.0);
check53(9007199254740994.0, -1.0, GMP_RNDN, 9007199254740992.0);
check53(9007199254740996.0, -1.0, GMP_RNDN, 9007199254740996.0);
#ifdef MPFR_HAVE_FESETROUND
prec = (argc<2) ? 53 : atoi(argv[1]);
rnd_mode = (argc<3) ? -1 : atoi(argv[2]);
/* Comparing to double precision using machine arithmetic */
for (i=0;i<N;i++) {
x = drand();
y = drand();
if (ABS(x)>2.2e-307 && ABS(y)>2.2e-307 && x+y<1.7e+308 && x+y>-1.7e308) {
/* avoid denormalized numbers and overflows */
rnd = (rnd_mode==-1) ? LONG_RAND()%4 : rnd_mode;
check(x, y, rnd, prec, prec, prec, 0.0);
}
}
/* tests with random precisions */
for (i=0;i<N;i++) {
int px, py, pz;
px = 53 + (LONG_RAND() % 64);
py = 53 + (LONG_RAND() % 64);
pz = 53 + (LONG_RAND() % 64);
rnd_mode = LONG_RAND() % 4;
do { x = drand(); } while (isnan(x));
do { y = drand(); } while (isnan(y));
check2 (x, px, y, py, pz, rnd_mode);
}
/* Checking mpfr_add(x, x, y) with prec=53 */
for (i=0;i<N;i++) {
x = drand();
y = drand();
if (ABS(x)>2.2e-307 && ABS(y)>2.2e-307 && x+y<1.7e+308 && x+y>-1.7e308) {
/* avoid denormalized numbers and overflows */
rnd = (rnd_mode==-1) ? LONG_RAND()%4 : rnd_mode;
check3(x, y, rnd);
}
}
/* Checking mpfr_add(x, y, x) with prec=53 */
for (i=0;i<N;i++) {
x = drand();
y = drand();
if (ABS(x)>2.2e-307 && ABS(y)>2.2e-307 && x+y<1.7e+308 && x+y>-1.7e308) {
/* avoid denormalized numbers and overflows */
rnd = (rnd_mode==-1) ? LONG_RAND()%4 : rnd_mode;
check4(x, y, rnd);
}
}
/* Checking mpfr_add(x, x, x) with prec=53 */
for (i=0;i<N;i++) {
do { x = drand(); } while ((ABS(x)<2.2e-307) || (ABS(x)>0.8e308));
/* avoid denormalized numbers and overflows */
rnd = (rnd_mode==-1) ? LONG_RAND()%4 : rnd_mode;
check5(x, rnd);
}
#endif
return 0;
}
std::shared_ptr<State::Attackable> State::check4(const Test &test, std::size_t start) const
{
assert(test->line.size() == test->position.size());
assert(start < test->line.size());
Block b = test->line[start];
assert(b == WHITE || b == BLACK);
std::shared_ptr<State::Attackable> attackable = std::make_shared<Attackable>();
auto testFunc = [&](size_t space, size_t start) {
Test t = std::make_shared<Tst>();
t->line = test->line;
t->position = test->position;
t->line[space] = b;
if (check5(t, start) && !isForbidden(test->position[space], b, t)) {
attackable->chances.push_back(test->position[space]);
}
};
if (start + 4 < test->line.size() && test->line[start + 4] == b) {
size_t count = 0;
std::vector<size_t> blank;
for (size_t i = start + 1; i < start + 4; ++i) {
Block t = test->line[i];
if (t == b) {
++count;
} else if (t == SPACE) {
blank.push_back(i);
} else {
break;
}
}
if (blank.size() == 1 && count == 2) {
testFunc(blank[0], start);
}
} else {
size_t count = 0;
for (size_t i = start; i < start + 4; ++i) {
if (test->line[i] == b) {
++count;
}
else {
break;
}
}
if (count == 4) {
if (start > 0 && test->line[start - 1] == SPACE) {
testFunc(start - 1, start - 1);
}
if (start + 4 < test->line.size() && test->line[start + 4] == SPACE) {
testFunc(start + 4, start);
}
}
}
attackable->player = b;
switch (attackable->chances.size()) {
case 0:
attackable->rank = NONE;
break;
case 1:
attackable->rank = FOUR;
break;
case 2:
attackable->rank = S_FOUR;
break;
default:
assert(false);
}
return attackable;
}
