12 2017 档案
摘要:```BFS``` ```正解就是乱搞系列``` ```cpp #include #include char G[50][50]; bool mk[50][50][10001]; struct QueueNode { int x, y, cur, dist; QueueNode (int x = 0, int y = 0, int cur = 0, int dist = 0): ...
阅读全文
摘要:cpp include include include int main() { int p, a, b, c, d, n; scanf("%d%d%d%d%d%d", &p, &a, &b, &c, &d, &n); double maxans = p (sin(a + b) + cos(c +
阅读全文
摘要:cpp include include using std::sort; define kN 1000000 struct vv { int a, b; vv(int a = 0, int b = 0): a(a), b(b) {} }p[kN], q[kN]; bool cmp1(vv xx, v
阅读全文
摘要:cpp include using std::cin; using std::cout; using std::endl; struct treenode { int val; treenode lc, rc; treenode(int val = 0): val(val), lc(NULL), r
阅读全文
摘要:cpp include include include int main() { int d, k; std::cin d k; int r[257], p[257]; for (int i = 1; i r[i] p[i]; static long long f[257][257]; memset
阅读全文
摘要:``` include include using std::cin; using std::cout; int main() { int n, m; cin n m; bool G[26][26]; while (n ) { char a, b; cin a b; G[a 'a'][b 'a']
阅读全文
摘要:LA上的题目居然和原题有差别!变成了多组数据 下面这个程序是按原题写的 cpp include include include int main() { int n, t; std::cin n t; double d[1000], s[1000]; for (int i = 0; i d[i] s
阅读全文

浙公网安备 33010602011771号