void nummaker(int now,int n) { if(flag) return; if(((n & 1) == 1) && (now == n / 2 + 2)) { int ans = combine(n); if(ifprime(ans) && ifin(ans)) fprintf(out,"%d\n",ans); return; } if(((n & 1) == 0) && (now == n / 2 + 1)) { int ans = combine(n); if(ifprime(ans) && ifin(ans)) fprintf(out,"%d\n",ans); return; } int i; for(i = 0;i <= 9;i++) { if(now == 1) if(i == 0 || ((i & 1) == 0)) continue; num[now] = i; num[n - now + 1] = i; nummaker(now + 1,n); } }
void test(string *s1, string *s2, int error_no) { if (!ifin(sym, s1)) { error(error_no); while (!(ifin(sym, s1) || ifin(sym, s2))) getsym(); } }