随笔分类 - 蓝桥杯
摘要："结点选择" cpp / 首先这道题输入的边的两端的结点不是上一行的结点的权值，而是 结点的序号，其次，这道题并没有说这个树是二叉树并且也没有说边左 边的结点就是父亲结点，右边的结点就是孩子结点，所以这道题树的存 储用无向图来存储。 关于算法就是树形规划：从叶子结点往上到根节点进行动态规划， 利用d
阅读全文
摘要："K好数" cpp / 不难的动态规划 / include include using namespace std; int main(){ int k, l; int dp[105][105]; cin k l; memset(dp, 0, sizeof(dp)); for(int i=1; i
阅读全文
摘要："最大最小公倍数" cpp include using namespace std; / getlcd()求两个数的最大公约数 / long long int getlcd(long long int a, long long int b){ return (a%b==0?b:getlcd(b, a
阅读全文
摘要："区间k大数查询" cpp include include include using namespace std; bool cmp(const int& a, const int& b){ return a b; } int main(){ int n; cin n; vector vi(n+1
阅读全文
摘要："Eurodiffusion" cpp / 并未完全AC / include include include using namespace std; int c;//国家数目(即货币数目) int cas=0;//测试组数 const int motif=1000000; struct CTR{/
阅读全文
摘要："P0505" n!=1 2 3 4 ....... (n 1) n, n!末尾的0的是由因子2和5造成的。 可以这么想，先将1到n每个数做关于2和5的因数分解，其实想法十分简单就是在计算阶乘时将所有因数2和5都不乘进去。而是用a,b分别记录2的个数和5的个数。 ans记录的是n!末尾非零的数字，初
阅读全文
摘要："素因子去重" cpp include include include using namespace std; bool isprime(long long int n){ if(n==1) return false; for(int i=2; i n; set s; while(!isprime
阅读全文
摘要："时间转换" cpp include using namespace std; int main(){ int t; cin t; cout
阅读全文
摘要："字符串对比" cpp include include using namespace std; int main(){ string s1, s2; cin s1 s2; if(s1==s2) cout
阅读全文
摘要："分解质因数" cpp include include include include using namespace std; vector vi(10001); int main(){ int a, b; cin a b; for(int i=2; i::iterator it=vi[i].be
阅读全文
摘要："矩形面积交" cpp include include using namespace std; int main(){ double m1, n1, m2, n2, a1, b1, a2, b2, d1=0, d2=0; cin m1 n1 m2 n2 a1 b1 a2 b2; if(m1 m2)
阅读全文
摘要："矩阵乘法" cpp include include using namespace std; int n, m; vector Mul(vector t1, vector t2){ vector temp(n, vector(n, 0)); for(int i=0; i QuickMul(vect
阅读全文
摘要："完美的代价" cpp / 提示：是考的贪心策略 / include using namespace std; int main(){ int n, flag=0, cnt=0; cin n; string str; cin str; for(int i=0; i=i; j ){ if(j==i){
阅读全文
摘要："数的读法" cpp include include include using namespace std; string p[]={"ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu", "shi", "bai", "qi
阅读全文
摘要："Sine之舞" cpp include include include using namespace std; int main(){ int n; cin n; vector A(n+1,""); for(int i=1; i0; j ){ str="sin("+str+")"; if(j 1
阅读全文
摘要："FJ的字符串" cpp include include using namespace std; int main(){ string str=""; int N; cin N; for(int i=0; i
阅读全文
摘要："芯片测试" cpp / 根据题意可知，如果是坏芯片则对应的列中除了对角线位置处所有的0的个数一定大于1的个数，又非好即坏 / include include using namespace std; int main(){ int n, flag=0; cin n; vector vi(n+1,
阅读全文
摘要："龟兔赛跑预测" cpp / 根据题目这里的时间一定是整数，且题目说了l一定是v1和v2的整数倍 / include using namespace std; int main(){ int v1, v2, t, s, l, s1=0, s2=0, sec=0, t1, t2, tag1=0, ta
阅读全文
摘要："回形取数" / 逆时针读数，但每读过一个就标志已读 / include include using namespace std; int main(){ int m, n, cnt=1, x=0, y=0, flag=0; cin m n; vector M(m, vector(n, 0)), v
阅读全文
摘要："2n皇后问题" cpp include include using namespace std; int cnt = 0, n; vector vi(9, vector(9,0) ); //储存棋盘 vector row1(9, 0), row2(9, 0), md1(19, 0), md2(19
阅读全文
浙公网安备 33010602011771号