- 博客(7)
- 收藏
- 关注
RSS订阅原创 Codeforces Round #711 (Div. 2) C. Planar Reflections
题目链接#include<bits/stdc++.h>using namespace std; int f[1005][1005];int mod = 1e9 + 7;int main() { int t, n, k; cin >> t; while (t--) { cin >>k >> n; for (int i = 1; i <= k; i++) { f[1][i] = 1; } for (int i = 1
2021-03-30 14:46:43
199
原创 2020-12-05 冬季pat甲级 D Chemical Equation
感觉这次pat考试最麻烦的题就是这个第四题了，所以决定留个代码记录下。题目大意：有n个反应物 ，编号分别为a1,a2……an（不一定是从1-n)再出给m个产物：b1, b2……bm现有k个反应式每一个反应式子 形如：b1 + b2 …… + bk = c， c为产物；问 ： 用所给出的n个反应物 怎样生成这m个产物 （每个反应物只能用一次，保证存在解）输出要求： 对于每个产物 bi， 输出其反应式：如：a1 + a2 …… + an -> bi;（若某反应物自己本身就是产物也是可
2020-12-05 18:03:50
842
1
原创 浙江大学软件学院2020年保研上机模拟练习
浙江大学软件学院2020年保研上机模拟练习7-1.Standard Form of Polynomial (20分)7-2.Distance of Triples (25分)7-3. Partial School Ranking (25分)7-4. Shopping With Coupons (30分)7-1.Standard Form of Polynomial (20分)Input3-1 4 -1output-2 -7 -4题目大意： 给定出n个数，让你计算(x-a1)(x-a2)(
2020-10-05 16:09:06
2567
原创 1087 All Roads Lead to Rome (30 分)
1087 All Roads Lead to Rome (30 分)Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happ...
2019-08-13 21:23:07
166
原创 1068 Find More Coins (30 分)
1068 Find More Coins (30 分)Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of...
2019-06-06 21:07:22
219
原创 PAT(甲级）1017 Queueing at Bank (25 分)
1017 Queueing at Bank (25 分)Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait...
2019-06-02 12:28:44
214
原创 PAT（甲级）1001 A+B Format (20 分)
1001 A+B Format (20 分)Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).Input Specif...
2019-06-02 12:05:40
179
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人