牛客多校第五场 A digits 2 签到

【牛客多校第五场 A digits 2 签到】的更多相关文章

牛客多校第五场 A digits 2 签到

题意: 给定一个n,输出一个数,要求这个数所有位之和整除n,并且这个数也整除n,并且位数不许多于1e4 题解: 把这个数n输出n遍. #include<iostream> using namespace std; int main(){ int t; scanf("%d",&t); while(t--){ int q; scanf("%d",&q); ;i<=q;i++)printf("%d",q); print…

牛客多校第五场 F take

链接:https://www.nowcoder.com/acm/contest/143/F来源:牛客网题目描述 Kanade has n boxes , the i-th box has p[i] probability to have an diamond of d[i] size. At the beginning , Kanade has a diamond of 0 size. She will open the boxes from 1-st to n-th. When she op…

牛客多校第五场 J：Plan

链接:https://www.nowcoder.com/acm/contest/143/J 来源:牛客网时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 There are n students going to travel. And hotel has two types room:double room and triple room. The price of a double…

牛客多校第五场-D-inv

链接:https://www.nowcoder.com/acm/contest/143/D来源:牛客网题目描述 Kanade has an even number n and a permutation b of all of the even numbers in [1,n] Let a denote an array [1,3,5....n-1] , now you need to find a permutation of [1,n] satisfy both a and b are s…

牛客多校第五场 F take 期望转化成单独事件概率（模板）树状数组

链接:https://www.nowcoder.com/acm/contest/143/F来源:牛客网 Kanade has n boxes , the i-th box has p[i] probability to have an diamond of d[i] size. At the beginning , Kanade has a diamond of 0 size. She will open the boxes from 1-st to n-th. When she open a…

牛客多校第五场 E room 二分图匹配 KM算法模板

链接:https://www.nowcoder.com/acm/contest/143/E来源:牛客网 Nowcoder University has 4n students and n dormitories ( Four students per dormitory). Students numbered from 1 to 4n. And in the first year, the i-th dormitory 's students are (x1[i],x2[i],x3[i],x4[…