http://acm.hdu.edu.cn/showproblem.php?pid=6313 题意 让你构造一个矩阵使得里面不存在四个顶点都为1的矩形,并且矩阵里面1的个数要>=85000 分析 来自https://blog.csdn.net/qq_37025443/article/details/81221008 先从25*25的构造看起 10000 01000 00100 00010 0000110000 00100 00001 01000 0001010000 00010 01000 00…

Hack It Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 548    Accepted Submission(s): 170Special Judge Problem Description Tonyfang is a clever student. The teacher is teaching he and other stu…

题意略. 思路:数论题. #include<bits/stdc++.h> using namespace std; ; const int maxn = p * p; ][maxn + ]; int main(){ printf(); ;x < maxn;++x){ int k = x / p; int b = x % p; ;i < p;++i){ int y = i * p + (k * i + b) % p; ans[x][y] = ; } } ;i < ;++i){…

2018 Multi-University Training Contest 2) HDU 6311 Cover HDU 6312 Game HDU 6313 Hack It HDU 6314 Matrix HDU 6315 Naive Operations HDU 6318 Swaps and Inversions…

又是道原题... (HDU 6313 Hack It , 多校 ACM 里面的题) 题目说构造一个 n * n 矩阵,染色点不得构成矩形...然后染色点个数至少 8 * n 然后我们生成一个数 m ,把矩阵分成 m * m 块 ,每块每行都至少要有 1 个 1 ,具体构造看代码: fp(i,0,m-1) fp(j,0,m-1) fp(k,0,m-1) s[m*i+j][m*k+(j*k+i)%m]=1; 证明的话要用循环加群...具体证明可以康这里 总的来说就是抄 hdu ACM 上那题的代码就…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5150 题目意思:就是直接求素数. 不过 n = 1,也属于答案范围!!只能说,一失足成千古恨啊----- #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> using namespace std; + ; int prime[maxn]; bool is_pri…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5105 题目意思:给出一个6个实数:a, b, c, d, l, r.通过在[l, r]中取数 x,使得这个函数 f(x)= |a∗x3+b∗x2+c∗x+d| 最大. 我一开始做的时候,很天真的认为数据量这么小,一个一个试,暴力搜就肯定能得到答案啦.但是一个很严重的问题是,x 没有说是实数还是整数,所以枚举根本不可行. 于是就联想到应该使用高中求一元三次方程的方法来做.我当时是直接从 f(l), f…

题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5264 pog loves szh I Description Pog has lots of strings. And he always mixes two equal-length strings. For example, there are two strings: "abcd" and "efgh". After mixing, a new string &q…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5504 GT and sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2223    Accepted Submission(s): 510 Problem Description You are given a sequen…

Minimum Cut Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=5452 Description Given a simple unweighted graph G (an undirected graph containing no loops nor multiple edges) with n nodes and m edges. Let T be a spa…