![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
错题本
king9666
这个作者很懒,什么都没留下…
展开
-
VJ简单数学 I 题 Hard Equation SDUT OJ 数论基础
此题是个板子题#include<bits/stdc++.h>using namespace std;typedef long long LL;typedef pair<LL, LL> pLL;typedef pair<LL, int> pli;ty原创 2019-02-19 11:26:54 · 475 阅读 · 0 评论 -
A - Calandar 2019 省赛补题
A - Calandar简单的模拟,找日期,签到题五个一循环#include<stdio.h>#include<iostream>#include<string>using namespace std;typedef long long ll;const string day[] = {"Monday", "Tuesday", "Wednes...原创 2019-05-14 20:31:28 · 300 阅读 · 0 评论 -
山东省ACM省赛M - Sekiro
M - Sekiro一道签到题,注意特0的时候为零,还有一个坑,就是当K大于31时,结果为1;#include<stdio.h>int main(){ long long n, k; int t, i; scanf("%d",&t); while(t--) { scanf("%lld %lld",&n,...原创 2019-05-15 09:39:44 · 382 阅读 · 0 评论 -
A - Live Love(规律模拟)
A - Live Love(规律模拟)插空的规律#include "stdio.h"#define LL long longint main(){ LL a, b, c, d, e, f, g; scanf("%lld",&a); while(a--) { scanf("%lld %lld",&b,&c); ...原创 2019-05-10 15:27:40 · 219 阅读 · 0 评论 -
K - XOR Clique(水题)
K - XOR Clique// Express parcels around the north gate?#include<stdio.h>#include "cstring"#include "iostream"#include "algorithm"using namespace std;#define ll long longll b[100];int ...原创 2019-05-10 15:45:12 · 253 阅读 · 0 评论 -
Problem A. Auxiliary Project
Problem A. Auxiliary ProjectInput file: auxiliary.in Time limit: 3 secondsOutput file: auxiliary.out Memory limit: 512 megabytesAnna has just finished her course project. She has a lot of seven-seg...原创 2019-05-07 23:58:28 · 260 阅读 · 0 评论 -
Problem I. Intelligence in Perpendicularia
Problem I. Intelligence in PerpendiculariaInput file: intel.in Time limit: 3 secondsOutput file: intel.out Memory limit: 512 megabytesThere are only two directions in Perpendicularia: vertical and ...原创 2019-05-07 23:59:35 · 191 阅读 · 0 评论 -
B - Terse princess
B - Terse princess«Next please», — the princess called and cast an estimating glance at the next groom.The princess intends to choose the most worthy groom, this is, the richest one. Whenever she se...原创 2019-05-17 07:42:30 · 134 阅读 · 0 评论 -
SDUT校赛补题 沉心十年(打印图形)
Time Limit: 1000 ms Memory Limit: 65536 KiBProblem Description今年是SDUTACM举办的第十一届校赛啦!今年校赛的参赛规模也是再创新高!在今天的赛场上与大家同台竞技的,还有50多个来自中小学的小朋友。十年风雨,我们曾经一起走过。现在让我们脚踏实地,一起奋斗下一个十年!现在请你使用’SDUTACM’这一个字符串,打印出只属于今天...原创 2019-05-30 20:19:38 · 137 阅读 · 0 评论 -
Codefoces 566 div2 B. Plus from Picture(模拟)
B. Plus from Picturetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a given picture with size原创 2019-06-13 00:30:45 · 324 阅读 · 0 评论 -
A - Ervin and Joker (简单博弈)
A - Ervin and JokerErvin and Joker are playing a game with rocks.Initially, there are N rocks, indexed from 1 to N. In one move, the player chooses at least 1and at most K consecutively indexed roc...原创 2019-06-02 11:27:35 · 366 阅读 · 0 评论 -
B. Array Stabilization cf div3 529
B. Array Stabilizationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array原创 2019-06-03 19:12:04 · 121 阅读 · 0 评论 -
F - GlitchBot VJ补题(模拟)
GlitchBotOne of our delivery robots is malfunctioning! The job of the robot is simple; it should follow a list of instructions in order to reach a target destination. The list of instructions is orig...原创 2019-06-20 20:50:45 · 292 阅读 · 0 评论 -
A - Birthday Cake VJ(计算几何 平面欧拉)
A - Birthday CakeOn his birthday, John’s parents made him a huge birthday cake! Everyone had a wonderful dinner, and now it’s time to eat the cake. There are nn candles on the cake. John wants to div...原创 2019-06-20 20:56:52 · 244 阅读 · 0 评论 -
I - Odd Gnome(签到题)
Odd Gnome本来是简单的签到题, 结果WA了两发才AC。简单的模拟,而不是找规律,所以…老老实实的做吧。解法: 分析样例的数据特点,然后就A了…a[i] > a[i + 1] && a[i] > a[i - 1] && a[i - 1] < a[i + 1] )或者 ( a[i - 1] < a[i + 1] &a...原创 2019-06-21 08:24:21 · 338 阅读 · 0 评论 -
E. 只有一端开口的瓶子 VJ补题
E. 只有一端开口的瓶子time limit per test1.0 smemory limit per test256 MBinputstandard inputoutputstandard output栈就是像 “只有一端开口的瓶子” 一样的数据结构,大家可以理解为一个头部固定的数组,无论是取出数字还是放入数字,你都只能在数组末尾那一端(称为栈顶)修改。非常喜欢数据结构的周...原创 2019-05-06 11:32:17 · 249 阅读 · 0 评论 -
CodeForces Gym 100735I 套大数版
给你三个数A,B,C,问你这三个数是否可以组成X+Y=Z的形式,每个数都能重复使用但是A B C都是小于等于1e100的#include<string>#include<iostream>#include<iosfwd>#include<cmath>#include<cstring>#include<stdlib.h&...原创 2019-05-05 10:14:26 · 177 阅读 · 0 评论 -
Triangles(VJ)补题
TrianglesAccept: 373 Submit: 1263Time Limit: 1000 mSec Memory Limit : 262144 KBProblem DescriptionThis is a simple problem. Given two triangles A and B, you should determine they are interse...原创 2019-04-12 09:40:34 · 232 阅读 · 0 评论 -
2018福建省赛Wand (VJ)
K - Wand(VJ)N wizards are attending a meeting. Everyone has his own magic wand. N magic wands was put in a line, numbered from 1 to n(Wand_i owned by wizard_i). After the meeting, n wizards will take...原创 2019-04-12 09:37:10 · 164 阅读 · 0 评论 -
日期的具体公式计算
蔡勒公式蔡勒(Zeller)公式,是一个计算星期的公式,随便给一个日期,就能用这个公式推算出是星期几。符号意义w:星期; w对7取模得:0-星期日,1-星期一,2-星期二,3-星期三,4-星期四,5-星期五,6-星期六c:世纪(注:一般情况下,在公式中取值为已经过的世纪数,也就是年份除以一百的结果,而非正在进行的世纪,也就是现在常用的年份除以一百加一;不过如果年份是公元前的年份且非整百数的...原创 2019-04-10 08:30:51 · 1147 阅读 · 0 评论 -
Cyclic Nacklace循环结(ZOJ)
Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10306 Accepted Submission(s): 4412Problem DescriptionCC always becomes ver...原创 2019-04-10 08:56:28 · 168 阅读 · 0 评论 -
G - Seven-Segment Display VJ(思维题)
G - Seven-Segment DisplayA seven segment display, or seven segment indicator, is a form of electronic display device for displaying decimal numerals that is an alternative to the more complex dot mat...原创 2019-04-15 10:55:44 · 143 阅读 · 0 评论 -
风王之瞳 VJ
风王之瞳如果莫名流泪,也许是失去了什么美好的回忆。伪装成人类少女夏弥的龙王耶梦加得曾在暗中默默观察了这个名叫楚子航的男孩很多年。后来,她以学妹的身份正面出现在楚子航身边,一边作战,一边还讲着白烂的吐槽。她将利爪刺进他的胸膛,他也将折刀送入她的心口,他们紧紧相拥,像是最亲密的恋人。他最终来到了她生活过的小屋,仰面躺在床上,阳光温软,但眼泪却没有止住。爱唱歌的女孩被埋在花下了,连带着她的野心、和谜...原创 2019-05-03 09:34:29 · 385 阅读 · 0 评论 -
G - Non-Prime Factors
G - Non-Prime FactorsIn many programming competitions, we are asked to find (or count the number of) Prime Factors of an integer i. This is boring. This time, let’s count the number of Non-Prime Fact...原创 2019-05-03 19:39:03 · 197 阅读 · 0 评论 -
欧拉筛 线性筛
埃氏筛(埃拉特斯特尼筛法)int visit[maxn];void Prime(){mem(visit,0); //初始化都是质数visit[0] = visit[1] = 1; //0 和 1不是质数for (int i = 2; i <= maxn; i++) {if (!visit[i]) { //如果i是素数,让i的所有倍数都不是质数...原创 2019-05-03 19:59:04 · 384 阅读 · 0 评论 -
计算几何
https://linxi99.gitee.io/20190211/ACM几何基础篇/转载 2019-05-03 20:03:42 · 126 阅读 · 0 评论 -
Bomb 数位DP HDU
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 26039 Accepted Submission(s): 9876Problem DescriptionThe counter-terrorists found a ...原创 2019-05-04 09:14:01 · 176 阅读 · 0 评论 -
Fibonacci POJ 3070
Fibonacci POJ 3070Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10096 Accepted: 7208DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n...原创 2019-05-04 10:06:21 · 248 阅读 · 0 评论 -
C. Sasha and a Bit of Relax CF
C. Sasha and a Bit of Relaxtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSasha likes programming. Once, during a very long contest, Sash...原创 2019-05-04 10:55:37 · 242 阅读 · 0 评论 -
概率 Coprime - Free Permutation
题意两个人玩游戏 互抽牌 相同可以消去 给你每个人手中牌的数目,问先手赢得概率思路题目说 一定含有一张鬼牌 分情况讨论鬼牌在自己手里还是在对方手里#include <bits/stdc++.h> using namespace std;char a[1000005];char b[1000005];double dp[1000005][3];int main()...原创 2019-05-04 10:58:59 · 220 阅读 · 2 评论 -
Trade VJ (java)
This is a very easy problem.ACMeow loves GTX1920. Now he has m RMB, but no GTX1920s. In the next n days, the unit price of GTX1920 in the ith day is Ci RMB. In other words, in the ith day, he can buy...原创 2019-05-04 11:01:06 · 208 阅读 · 0 评论 -
Bingo VJ补题
Bingo is a game of chance played by a group of players. Each player has his or her own bingo card with a 5-by-5grid of numbers. Each number appears at most once per card. The bingo caller calls out a...原创 2019-05-04 19:03:57 · 533 阅读 · 0 评论 -
I - ICPC Awards(字符串)
很简单的水签到,耽误很长时间,自闭…The ACM International Collegiate Programming Contest has been held in Vietnam for more than 10 years. The contest is a great chance for the students to meet new friends, broaden the...原创 2019-06-21 10:00:29 · 216 阅读 · 0 评论