int main(int argc, char* argv[]) { int m; int n; scanf("%d",&m); scanf("%d",&n); change_num(m, n); printf("Change m&n is %d %d", *m, *n); return 0; }
int main(int argc,char** argv) { int radix,num; while(scanf("%d",&num)&&num>0) { scanf("%d",&radix); change_num(num,radix); if(is_prime(re2num(p,radix))) printf("Yes\n"); else printf("No\n"); } return 0; }
bool search_signature( const PHARDCODE hard_code, const int hard_number, const unsigned int start_addr, const unsigned int over_addr ) { bool if_success = false; const int kSearch_Size = 0x1000; unsigned int image_base = start_addr; for (size_t i = 0; i < hard_number; i++){ auto signature = hard_code[i].sign_str; if (signature == nullptr){ hard_code[i].if_sign_success = true; continue; } if (!hard_code[i].if_signedtrue_success) { hard_code[i].if_sign_success = false; continue; } int signature_len = strlen(signature) / 2; unsigned char* chars = new unsigned char[signature_len]; unsigned char* ignore = new unsigned char[signature_len]; memset(ignore, 0, signature_len); for (int i = 0; i < signature_len; i++) { chars[i] = change_num(signature + i * 2, 2, &ignore[i]); } auto search_addr = search_byte(start_addr, over_addr, chars, ignore, signature_len); if (search_addr) { hard_code[i].if_sign_success = true; } if (chars) delete[]chars; if (ignore) delete[]ignore; } return if_success; }
void dfs(int x, int y){ int cur = change_num(block[map[x][y - 1]].right, block[map[x - 1][y]].bottom); for (int i = 0; i < cnt[cur]; i++){ if (vis[list[cur][i]]) continue; if (x == n && y == m){ if (block[list[cur][i]].right + block[list[cur][i]].bottom) continue; ok = 1; return; } else if (x == n){ if (block[list[cur][i]].right == 0 || block[list[cur][i]].bottom) continue; vis[list[cur][i]] = 1; map[x][y] = list[cur][i]; dfs(x, y + 1); } else if (y == m){ if (block[list[cur][i]].right || block[list[cur][i]].bottom == 0) continue; vis[list[cur][i]] = 1; map[x][y] = list[cur][i]; dfs(x + 1, 1); } else{ if (block[list[cur][i]].right == 0 || block[list[cur][i]].bottom == 0) continue; vis[list[cur][i]] = 1; map[x][y] = list[cur][i]; dfs(x, y + 1); } vis[list[cur][i]] = 0; if (ok) return; } }