hcCuriosity的博客

1003：Mine SweeperAC代码#include <bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++)#define T int t ;cin >> t;while(t--)using namespace std ;typedef long long ll;typedef unsigned long long ull;const int maxn = 50;const int INF = 0x3

1003：Clockwise or Counterclockwise叉乘：#include <bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++) #define T int t ;cin >> t;while(t--)using namespace std ;typedef long long ll;typedef unsigned long long ull;inline ll gcd(ll a,ll b

1009：Increasing and Decreasing下面是AC代码：#include <bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++) #define T int t ;cin >> t;while(t--)using namespace std ;typedef long long ll;typedef unsigned long long ull;inline ll gcd(ll a,

A:Permutation#include <bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++) #define T int t ;cin >> t;while(t--)using namespace std ;typedef long long ll;typedef unsigned long long ull;ll p ;inline ll gcd(ll a,ll b){return b == 0? a

A：Groundhog and 2-Power Representation链接题意：朴素的递归思想，模拟从里到外去括号的过程，加上高精度即可ACdef x(a): return 2**astr = input()str = str.replace("2(","x(")print(eval(str))I：The Crime-solving Plan of Groundhog题意： 给出n个1-9之间的数字，组成两个正整数（不含前导零）求出乘积的最小值。思路：只有在一个数字乘上一

传送门A.同源这题只需要两个for循环暴力模拟就可以过了但是有没有大佬在下面讲解一下原理，为什么只要循环到10就能跑出来。。直接上AC代码：#include <bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++) #define T int t ;cin >> t;while(t--)using namespace std ;typedef long long ll;typedef unsigned lo

I Interesting Computer Game题意：有两个数组a , b , 第i步可以从ai bi 中选取一个数，求出最多能获取几个不同的数字 。下面直接上AC代码：并查集+离散化#include <bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++) #define T int t ;cin >> t;while(t--)using namespace std ;typedef long lo

HDU Equal Sentences （2020杭电多校训练第四场1005）HDU Equal Sentences废话不多说直接上AC代码#include <bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++) #define T int t ;cin >> t;while(t--)using namespace std ;typedef long long ll;typedef unsigned lon

HDU Parentheses Matching 2020 第三场 1009杭电OJ6799Problem DescriptionGiven a string P consisting of only parentheses and asterisk characters (i.e. “(”, “)” and “"), you are asked to replace all the asterisk characters in order to get a balanced parenthesi