kyoma的博客

A - Bi-shoe and Phi-shoeTime Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1370 uDebugDescriptionBamboo Pole-vault is a massiv

我的做法是检查每个长度下每个点是否符合作为正方形的左上角的要求一下是代码，输出很容易PE#include #include #include using namespace std;struct unit{ bool right,down;};int main(){ unit bot[10][10]; int i,j,n,m,it,jt,k; c

没想到AC了好感动啊。。。前面的那道象棋蜜汁WA把我搞的身心俱疲，又见到一个和棋有关的题就怂了啊本来觉得会和象棋那题一样蜜汁WA的说，结果提交的时候看到presentation error整个心是紧了一下好吗！！简直是初恋的感觉啊！！结果这题输出及其坑爹。。。输出注意：1、打印有效点的时候每个点之间都有空格，但是最后一个点后面不能有2、每个回合之间有空行（这个想必大家都会注

题目描述你的弟弟刚做完了“100以内数的加减法”这部分的作业，请你帮他检查一下。每道题目（包括弟弟的答案）的格式为a+b=c或者a-b=c，其中a和b是作业中给出的，均为不超过100的非负整数；c是弟弟算出的答案，可能是不超过200的非负整数，也可能是单个字符"?"，表示他不会算。输入输入文件包含不超过100行，以文件结束符结尾。每行包含一道题目，格式保

C - Aladdin and the Flying CarpetTime Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1341 uDebugDescriptionIt's said that Aladd

Teacher BoTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 795    Accepted Submission(s): 443Problem DescriptionTeacher BoBo is

把一个序列每种情况考虑一遍明显是不可能的。。。。所以把每个数的数学期望抽出来算对于在1～n两端的数来说，它出现1的概率为：其中取1～n中两个数，这两个数一定一个大一个小，因此直有一种情况，剩下的其他位置全排列，除以总可能数。化简为1/2对于2～n－1位置的数来说，他们出现1的概率为：该式的意义为在1～n中取3个数字，三个数字要呈现中间大于两边的数的情况，因此两边

偶数个的字母要配合奇数个的字母直接上代码：#include #include #include #include #include #include #include #include #include #include using namespace std;const int maxn = 100005;int save[maxn];int main(){

#include #include #include #include #include using namespace std;long long g,l;int main(){ long long t,i; scanf("%lld",&t); while(t--){ scanf("%lld%lld",&g,&l); if(

#include #include #include #include #include #include #include #include #include #include using namespace std;const int maxn = 10000;int save[maxn];int gcd(int a,int b){ return b==0?

#include #include #include #include #include #include #include #include #include #include #define maxn 100005using namespace std;int save[maxn];long long gcd(long long a,long long b){

#include #include #include #include #include #include #include #include #include #include using namespace std;const int minn=1e-6;int pre[105];struct unit{ int u,v; double w;

#include #include #include #include #include #include #include #include #include #include using namespace std;int pre[105];struct unit{ int u,v,w; int k;}village[10005];bool comp

#include #include #include #include #include #include #include #include #include #include using namespace std;int pre[1005];bool is_root[1005];int find(int x){ int r=x; while(pre[

Problem DescriptionThere is once a king and queen, rulers of an unnamed city, who have three daughters of conspicuous beauty.The youngest and most beautiful is Psyche, whose admirers, neglecti

除法表达式时间限制：1000 ms  |  内存限制：65535 KB难度：3描述    给出一个这样的除法表达式：X1/X2/X3/···/Xk，其中Xi是正整数。除法表达式应当按照从左到右的顺序求和，例如表达式1/2/1/2的值为1/4。但是可以在表达式中嵌入括号以改变计算顺序，例如表达式(1/2)/(1/2)的值为1.输入首先输

使用拓展欧几里得算法使用了刘汝佳紫书上的拓展欧几里德程序，具体实现过程还是没怎么看懂。。。看懂了补上。该代码能解决一个等式问题：a*x+b*y=gcd(a,b)，该算式中a，b为已知量，下面代码能得出gcd（a，b），x，y书上的代码如下：void gcd_more(long long a,long long b,long long &d,long long &x,long lon

Solving OrderTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 352    Accepted Submission(s): 238Problem DescriptionWelcome to HDU

Problem DescriptionYou may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your program will read information about a collect

Problem DescriptionMatrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Sinc

Problem DescriptionThere is a complete binary tree with N nodes.The subtree of the node i has Ai nodes.How many distinct numbers are there of Ai? InputThere are multiple test cases,

Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 54997 Accepted: 20235DescriptionIn this problem, you have to analyze a particular sorti

Problem DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars t

sumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 493    Accepted Submission(s): 236Problem DescriptionGiven a sequence, you'

免费馅饼Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42016    Accepted Submission(s): 14452Problem Description都说天上不会掉馅饼，但有一天gameb

A Simple NimTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 677    Accepted Submission(s): 434Problem DescriptionTwo players tak

Ignatius and the Princess IVTime Limit: 1000MS Memory Limit: 32767KB 64bit IO Format: %I64d & %I64uSubmit StatusDescription"OK, you are not too bad, em... But y

Problem DescriptionAn array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the knumbers in

#include #include #include #include #include #include #include #include #include #include using namespace std;int pre[105];struct unit{ int u; int v; int w;}village [10005];b

刘汝佳上传的代码没耐心看。。。就大致照着书上写的思路写了一个。。。一开始发现全写错了耗了半天。。。定义一个pair，这个pair里有存两个队，字符串对和int对。每每读入一行的时候看看map中是否存在这个对。自己感觉坑就是，一行中可能存在重复的字符像这样：2 4a,b,a,ba,b,c,d第一行中存在两个字符串想等但列根本不想等的两对下面是代码：#include

Mishka and triptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Mishka is a great traveller and she v

、一开始用数组写，后来发现好傻逼啊。。。。直接用stringstream来为输入的句子去空格保存单词然后用vector来储存就行了啊。。用len数组来保存每列单词的最大长度下面是代码：#include #include #include #include #include #include #include using namespace std;vecto

Divide the SequenceTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 424    Accepted Submission(s): 234Problem DescriptionAlice ha

NanoApe Loves SequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 738    Accepted Submission(s): 334Problem DescriptionNan

1013: 冒险游戏(risk_ganme)时间限制: 2 Sec 内存限制: 2048 MB提交: 58 解决: 22[提交][状态][讨论版]题目描述河海组织一场冒险游戏,该游戏将场地分为N*M的方格,每个方格内均有一个关卡,要闯过每个关卡,都需要消耗一定数量的体力游戏的起点为(1,1) 终点为(N,M),每通过一关,可以选择右方或下方的一个关卡,顺利通过终点则挑战成功

A题：水。。直接代码：#include #include #include #include #include using namespace std;string save[1010];int main(){ int n,i,j; scanf("%d",&n); string t; int flag = false;

NanoApe Loves Sequence ⅡTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 1123    Accepted Submission(s): 498Problem Description

Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 52285    Accepted Submission(s): 22035Problem DescriptionMany year

饭卡Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23644    Accepted Submission(s): 8310Problem Description电子科大本部食堂的饭卡有一种很诡异的设计，即

B. Interesting drinktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy likes to rest after a hard wor