模拟
newhonor
可以不伟大,但不能卑微
展开
-
A B = C
http://acm.hdu.edu.cn/showproblem.php?pid=6646#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#...原创 2019-10-22 17:26:53 · 106 阅读 · 0 评论 -
Pocket Cube
http://acm.hdu.edu.cn/showproblem.php?pid=5983题意:问是否可以一步内还原2阶魔方;思路:画图标志每个位置把每次操作的下标写成一个环再左右换一下位置判断(虽然有重复操作但有图写起来也不难);坑:要每个面颜色都不一样!!题目没讲啊~~debug成狗;#include<algorithm>#include<set>...原创 2019-05-08 16:09:39 · 117 阅读 · 0 评论 -
A. Mental Rotation
https://codeforc.es/gym/102219/problem/A思路:模拟;#include<algorithm>#include<set>#include<cmath>#include<cstring>#include<iostream>#include<set>#include<...原创 2019-07-08 15:23:52 · 358 阅读 · 0 评论 -
F - Parentheses
https://codeforc.es/gym/101987#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include <map>#include <set>...原创 2019-08-06 18:32:33 · 282 阅读 · 0 评论 -
Citations Gym - 101853K
https://cn.vjudge.net/problem/Gym-101853K#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-09-05 22:22:00 · 250 阅读 · 0 评论 -
The Preliminary Contest for ICPC Asia Shenyang 2019 Texas hold'em Poker
https://nanti.jisuanke.com/t/41408每种牌赋予权值,注意多个13(剩余手牌相交)时超出最优先的组合(有对)的权值;#include<bits/stdc++.h>#define endl '\n'#define mem(a) memset(a,0,sizeof(a))#define debug cout<<1<<e...原创 2019-09-14 19:58:47 · 273 阅读 · 0 评论 -
How Much Memory Your Code Is Using? Gym - 101955J
https://cn.vjudge.net/problem/Gym-101955J#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-09-27 20:02:25 · 135 阅读 · 0 评论