2019
2019所学知识
忆昔,仰优
Accepted
展开
-
巴蜀之危
话说天下大势,分久必合,合久必分。。。却道那魏蜀吴三国鼎力之时,多少英雄豪杰以热血谱写那千古之绝唱。古人诚不我欺,确是应了那句“一将功成万骨枯”。是夜,明月高悬。诸葛丞相轻摇羽扇,一脸愁苦。原来是日前蜀国战事吃紧,丞相彻夜未眠,奋笔急书,于每个烽火台写下安排书信。可想,这战事多变,丞相运筹 帷幄,给诸多烽火台定下不同计策,却也实属不易。谁成想这送信小厮竟投靠曹操,给诸葛丞相暗中使坏。这小厮将每...原创 2019-08-09 22:30:06 · 218 阅读 · 0 评论 -
排队买票求最短时间
Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as...原创 2019-08-03 20:06:59 · 1235 阅读 · 0 评论 -
so easy
题目连接思路:采用并查集对数据进行隐藏。代码:#include<iostream>#include<map>#include<cstdio>#include<cstdlib>typedef long long ll;using namespace std;map<int,int>f;//由于n很大,所以数组无法满足...原创 2019-11-10 10:34:44 · 147 阅读 · 0 评论 -
Cryptography(密码学)
题目链接题意:找到字符串a可以转换成字符串b的最小花费。难点:之前只敲过整数与整数之间带权值的题目,这是第一次接触字符与字符之间带权值的情况。PS:应该熟练并准确的掌握mapp的处理方法。#include<bits/stdc++.h>using namespace std;#define inf 0x3f3f3f3fint mapp[155][155];void f...原创 2019-08-30 21:13:26 · 349 阅读 · 0 评论 -
求矩形的总面积
Your input is a series of rectangles, one per line. Each rectangle is specified as two points(X,Y) that specify the opposite corners of a rectangle. All coordinates will be integers in the range 0 to ...原创 2019-08-03 21:26:26 · 726 阅读 · 0 评论 -
set基本用法
1.输出函数void print(set<int>s){ set<int>::iterator it;//set的遍历 int k=1;//输出格式的控制 for(it=s.begin();it!=s.end();it++) { if(k==1) cout<<*it; else...原创 2019-11-09 11:37:37 · 262 阅读 · 0 评论 -
Divples
题目连接题意:找到a的因数当中是b的倍数的数难点:超时题解:第一:学会使用set容器第二:学会简化 long long int 类型第三:学会使用C++的输入与输出#include<bits/stdc++.h>using namespace std;#define ll long long intint main(){ ll a,b; cin>...原创 2019-08-30 19:56:19 · 189 阅读 · 0 评论 -
You can say 11
Your job is, given a positive number N, determine if it is a multiple of eleven.InputThe input is a file such that each line contains a positive number. A line containing the number ‘0’ isthe end o...原创 2019-07-29 21:10:44 · 89 阅读 · 0 评论 -
KMP
转载的解析题目来源#include<stdio.h>#include<stdlib.h>#include<string.h>int a[1000001];int b[1000001];int next[1000001];int main(){ int n; scanf("%d",&n); for(int i=1...原创 2019-11-02 11:50:27 · 111 阅读 · 0 评论 -
Master of GCD
SDUT 2019 Autumn Team Contest 22nd Problem J. Master of GCDHakase has n numbers in a line. At first, they are all equal to 1. Besides, Hakase is interested in primes. She will choose a continuous s...原创 2019-11-01 20:40:22 · 159 阅读 · 0 评论 -
IncDec序列
题目链接题目解析链接(转载)难点解释:如果要保证所有的数一样的话,只需要保证差分数列第二个及其之后都是0均可。由于正负数可以相互抵消,所以min(pos,neg)剩余无法抵消的用b1,bn+1抵消均可。至于有几种方法举例说明:如果最后剩 3 -----> (0,3)(1,2)(,2,1)(,3,0) 这4种方案来选择 b1还是 bn+1题目来源AcWi...原创 2019-11-03 18:54:19 · 417 阅读 · 0 评论