anshi1551-CSDN博客

转载 [编程题]山寨金闪闪（面试题）

链接：https://www.nowcoder.com/questionTerminal/9363dcb83ca44c61a2c1a8f65aa722b8来源：牛客网金闪闪死后，红A拿到了王之财宝，里面有n个武器，长度各不相同。红A发现，拿其中三件武器首尾相接，组成一个三角形，进行召唤仪式，就可以召唤出一个山寨金闪闪。（例如，三件武器长度为10、15、20，可以召唤成功。若长度为...

2019-07-14 15:06:00 222

转载【小米oj】简单直接全排列

用c++ next_permutation函数就可以了。 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin)...

2019-05-05 20:37:00 115

转载【小米oj】寻找归一数字

骗分过样例， 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",...

2019-05-05 20:36:00 233

转载【小米oj】dreamstart 的催促

欧拉降幂，i^i过大可以%phi(10000019)(phi是欧拉函数，由于10000019是质数，所以直接%10000018就可以了)来降幂，然后快速幂就行了。 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y...

2019-05-05 20:35:00 104

转载【小米oj】打羽毛球的小爱同学

简单容斥，不过感觉一毛一样的题做过，可能是在多校？？？ 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin);...

2019-05-05 20:31:00 293

转载【小米oj】石头收藏家

经典背包#define mm(a) memset(a,0,sizeof(a));#define max(x,y) (x)>(y)?(x):(y)#define min(x,y) (x)<(y)?(x):(y)#define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);#def...

2019-05-05 20:30:00 101

转载【小米oj】优秀数字

#define mm(a) memset(a,0,sizeof(a));#define max(x,y) (x)>(y)?(x):(y)#define min(x,y) (x)<(y)?(x):(y)#define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);#define re...

2019-05-05 20:29:00 82

转载【小米oj】节约用电

由于前面的只会影响后面而后面不能影响前面，所以顺着暴力修改就行了，时间复杂度nlog(n)。 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen...

2019-05-05 20:28:00 192

转载【小米oj】在一个有序的经过旋转的数组里查找一个数

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 20:25:00 120

转载【小米oj】硬币排序

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 20:25:00 110

转载【小米oj】N!

n的阶乘末尾的0，是由2和5贡献的，所以本题就转换成了1~n中因子2和5出现的次数的较小次数。‘对于1~n这n个数，可以被2整除的有n/2（向下取整）个数，然后剩下n/2个大于0的数，一直递归直到n为0，然后记录一个sum就行了。对于5也是同样的道理。 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) ...

2019-05-05 20:22:00 83

转载【小米oj】跳跳看

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:28:00 73

转载【小米oj】数7游戏

由于符合要求的数还是相当密集的，所以本题可以采取暴力，如果范围扩到1e18则可以数位dp 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("...

2019-05-05 19:27:00 100

转载【小米oj】国王招驸马

基础dp 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",st...

2019-05-05 19:26:00 119

转载【小米oj】解救我 mi

堆栈的基本应用 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w"...

2019-05-05 19:25:00 91

转载【小米oj】小米兔跳格子

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:25:00 96

转载【小米oj】括号配对

堆栈的基本应用 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w"...

2019-05-05 19:24:00 93

转载【小米oj】构建短字符串

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:23:00 86

转载【小米oj】爬楼梯

斐波那契数列 f[0]=1,f[1]=1,f[n]=f[n-1]+f[n-2](x>=2) 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freop...

2019-05-05 19:22:00 83

转载【小米oj】第一个缺失正数

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:21:00 62

转载【小米oj】小米兔的轨迹

刘汝佳紫书上都有 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w...

2019-05-05 19:20:00 123

转载【小米oj】纯位数

时间复杂度本人没有证明，但是暴力交上去过了 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freop...

2019-05-05 19:19:00 97

转载【小米oj】 dreamstart 的催促

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:17:00 70

转载【小米oj】抢劫！

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:16:00 90

转载【小米oj】数数有几个岛

dfs 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",std...

2019-05-05 19:15:00 95

转载【小米oj】找出单独出现的数字II

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:15:00 107

转载【小米oj】出现频率最高的前 K 个元素

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:14:00 80

转载【小米oj】分糖果

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:13:00 153

转载【小米oj】需要多少个立方数

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:13:00 102

转载【小米oj】反向位整数

模拟 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdo...

2019-05-05 19:12:00 77

转载【小米oj】海盗分赃

背包#define mm(a) memset(a,0,sizeof(a));#define max(x,y) (x)>(y)?(x):(y)#define min(x,y) (x)<(y)?(x):(y)#define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);#defin...

2019-05-05 19:11:00 127

转载【小米oj】最少交换次数

求逆序对，可以树状数组，但是这题n^2也能过。。。 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); f...

2019-05-05 19:10:00 80

转载【小米oj】大胃王的烦恼

离散化+前缀和，也可以优先队列搞一搞 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen(...

2019-05-05 19:09:00 144

转载【小米oj】不一样的排序

线性筛+sort 1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w...

2019-05-05 19:08:00 90

转载【小米oj】找出旋转有序数列的中间值

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:07:00 48

转载【小米oj】找出单独出现的数字

1 #include <bits/stdc++.h> 2 3 using namespace std; 4 5 int n,x; 6 map<int,int>mp; 7 int main() 8 { 9 while(~scanf("%d",&x)){10 mp[x]++;11 ...

2019-05-05 19:04:00 63

转载【小米oj】A + B

1 #define mm(a) memset(a,0,sizeof(a)); 2 #define max(x,y) (x)>(y)?(x):(y) 3 #define min(x,y) (x)<(y)?(x):(y) 4 #define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);...

2019-05-05 19:03:00 75

转载浅谈个人对小米oj的评价

　　oj做的还不错，给人的第一感觉相当好，看着还蛮有趣的。oj上有不少题目，虽然好多题原型实在是太明显了，不过总体感觉还可以。只是有几点有些难受，就我个人的感觉列举一下：　　1，既然是给输入那就好好给，input给个字符串每次都要自己切，给n个整数也不给n，而且n还经常没有范围，导致有些题目写题手感非常差。　　2，部分题目不表明是单组还是多组数据，导致cin 和 whi...

2019-05-04 19:43:00 144

空空如也

空空如也