BC15hdoj5082&&hdoj5083&&hdoj5084

最新推荐文章于 2022-03-25 16:42:22 发布
最新推荐文章于 2022-03-25 16:42:22 发布
阅读量572 收藏
点赞数
分类专栏： 杭电oj 模拟 文章标签： BC15hdoj5082hdoj5083
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/R1986799047/article/details/50757256
版权

Love

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 801    Accepted Submission(s): 484


Problem Description
There is a Love country with many couples of Darby and Joan in it. In order to commemorate their love, they will do some thing special when giving name to their offspring.  
When a couple want to give name to their offspring, they will firstly get their first names, and list the one of the male before the one of the female. Then insert the string “small” between their first names. Thus a new name is generated. For example, the first name of male is Green, while the first name of the female is Blue, then the name of their offspring is Green small Blue.
You are expected to write a program when given the name of a couple, output the name of their offsping.
 


 

Input
Multi test cases (about 10), every case contains two lines.  
The first line lists the name of the male.
The second line lists the name of the female.
In each line the format of the name is [given name]_[first name].
Please process to the end of file.

[Technical Specification]
3   ≤  the length of the name   ≤  20
[given name] only contains alphabet characters and should not be empty, as well as [first name].
 


 

Output
For each case, output their offspring’s name in a single line in the format [first name of male]_small_[first name of female].
 


 

Sample Input 
  
  

   
   Jim_Green
Alan_Blue
 


 

Sample Output 
  
  

   
   Green_small_Blue
 


 

Source
BestCoder Round #15
 


 

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<list>
#include<queue>
#include<vector>
using namespace std;
const int maxn=110;
char stra[maxn];
char strb[maxn];
int main()
{
    while(scanf("%s%s",stra,strb)!=EOF){
        bool sign=false;
        for(int i=0;i<strlen(stra);++i){
            if(sign)printf("%c",stra[i]);
            if(stra[i]=='_')sign=true;
        }
        printf("_small");
        for(int i=0;i<strlen(strb);++i){
            if(strb[i]=='_')sign=false;
            if(!sign)printf("%c",strb[i]);
        }
        printf("\n");
    }
    return 0;
}


 

Instruction

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 953    Accepted Submission(s): 227


Problem Description
Nowadays, Jim Green has produced a kind of computer called JG. In his computer, the instruction is represented by binary code. However when we code in this computer, we use some mnemonic symbols. For example, ADD R1, R2 means to add the number in register R1 and R2, then store the result to R1. But this instruction cannot be execute directly by computer, before this instruction is executed, it must be changed to binary code which can be executed by computer. Each instruction corresponds to a 16-bit binary code. The higher 6 bits indicates the operation code, the middle 5 bits indicates the destination operator, and the lower 5 bits indicates the source operator. You can see Form 1 for more details.
15 operation code(6 bits)109destination operator code(5 bits)54source operator code(5 bits)0Form 1


In JG system there are 6 instructions which are listed in Form 2.
instructionADD Ra,RbSUB Ra,RbDIV Ra,RbMUL Ra,RbMOVE Ra,RbSET RafunctionAdd the number in register Ra and Rb, then store the result to Ra.Subtract the number in register Ra to Rb, then store the result to Ra.Divide the number in register Ra by Rb, then store the result to Ra.Mulplicate the number in register Ra and Rb, then store the result to Ra.Move the number in register Rb to Ra.Set 0 to Ra.Form 2


Operation code is generated according to Form 3.
OperationADDSUBDIVMULMOVESETOperation code000001000010000011000100000101000110Form 3


Destination operator code and source operator code is the register code of the register which is related to.
There are 31 registers in total. Their names are R1,R2,R3…,R30,R31. The register code of Ri is the last 5 bits of the number of i in the binary system. For eaxample the register code of R1 is 00001, the register code of R2 is 00010, the register code of R7 is 00111, the register code of R10 is 01010, the register code of R31 is 11111.
So we can transfer an instruction into a 16-bit binary code easyly. For example, if we want to transfer the instruction ADD R1,R2, we know the operation is ADD whose operation code is 000001, destination operator code is 00001 which is the register code of R1, and source operator code is 00010 which is the register code of R2. So we joint them to get the 16-bit binary code which is 0000010000100010.
However for the instruction SET Ra, there is no source register, so we fill the lower 5 bits with five 0s. For example, the 16-bit binary code of SET R10 is 0001100101000000
You are expected to write a program to transfer an instruction into a 16-bit binary code or vice-versa.
 


 

Input
Multi test cases (about 50000), every case contains two lines.
First line contains a type sign, ‘0’ or ‘1’.  
‘1’ means you should transfer an instruction into a 16-bit binary code;
‘0’ means you should transfer a 16-bit binary code into an instruction.
For the second line.
If the type sign is ‘1’, an instruction will appear in the standard form which will be given in technical specification;  
Otherwise, a 16-bit binary code will appear instead.
Please process to the end of file.

[Technical Specification]
The standard form of instructions is  
ADD Ra,Rb
SUB Ra,Rb
DIV Ra,Rb
MUL Ra,Rb
MOVE Ra,Rb
SET Ra
which are also listed in the Form 2.
1≤a,b≤31
There is exactly one space after operation, and exactly one comma between Ra and Rb other than the instruction SET Ra. No other character will appear in the instruction.
 


 

Output
For type ‘0’，if the 16-bit binary code cannot be transferred into a instruction according to the description output “Error!” (without quote), otherwise transfer the 16-bit binary code into instruction and output the instruction in the standard form in a single line.
For type ‘1’, transfer the instruction into 16-bit binary code and output it in a single line.
 


 

Sample Input 
  
  

   
   1
ADD R1,R2
0
0000010000100010
0
1111111111111111
 


 

Sample Output 
  
  

   
   0000010000100010
ADD R1,R2
Error!
 


 

Source
BestCoder Round #15
 


 

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<queue>
#include<vector>
using namespace std;
const int maxn=10010;
char str[110];
char stra[110];
char strb[110];
char strc[110];
int main()
{
    int oper,i,j;
    while(scanf("%d",&oper)!=EOF){
        if(oper==1){
            scanf("%s",stra);
            if(strcmp(stra,"ADD")==0||strcmp(stra,"SUB")==0||strcmp(stra,"DIV")==0||strcmp(stra,"MUL")==0||strcmp(stra,"MOVE")==0){
                scanf("%s",strb);
                if(strcmp(stra,"ADD")==0)
                    printf("000001");
                else if(strcmp(stra,"SUB")==0)
                    printf("000010");
                else if(strcmp(stra,"DIV")==0)
                    printf("000011");
                else if(strcmp(stra,"MUL")==0)
                    printf("000100");
                else if(strcmp(stra,"MOVE")==0)
                    printf("000101");
                int a=0;
                for(i=0;i<strlen(strb);++i){
                    if(strb[i]>='0'&&strb[i]<='9'){
                        a=a*10+strb[i]-'0';
                    }
                    if(strb[i]==',')break;
                }
                for(int bit=4;bit>=0;--bit){
                    if(a&(1<<bit))printf("1");
                    else printf("0");
                }
                int b=0;
                for(j=i+1;j<strlen(strb);++j){
                    if(strb[j]>='0'&&strb[j]<='9'){
                        b=b*10+strb[j]-'0';
                    }
                }
                for(i=4;i>=0;--i){
                    if(b&(1<<i))printf("1");
                    else printf("0");
                }
                printf("\n");
            }
            else {
                scanf("%s",strb);
                printf("000110");
                int a=0;
                for(i=0;i<strlen(strb);++i){
                    if(strb[i]>='0'&&strb[i]<='9'){
                        a=a*10+strb[i]-'0';
                    }
                }
                for(i=4;i>=0;--i){
                    if(a&(1<<i))printf("1");
                    else printf("0");
                }
                printf("00000\n");
            }
        }
        else {
            scanf("%s",str);
            if(strlen(str)!=16){
                printf("Error!\n");
                continue;
            }
            int a=0;
            for(i=0;i<6;++i){
                stra[a++]=str[i];
            }stra[a]=0;
            int x=0,y=0;
            for(i=6,a=0;i<11;++i){
                strb[a++]=str[i];
                x=x+(str[i]-'0')*(1<<(5-a));
            }strb[a]=0;
            for(i=11,a=0;i<16;++i){
                strc[a++]=str[i];
                y=y+(str[i]-'0')*(1<<(5-a));
            }strc[a]=0;
            if(strcmp(stra,"000001")==0){
                if(x>=1&&x<=31&&y>=1&&y<=31){
                    printf("ADD R%d,R%d\n",x,y);
                }
                else printf("Error!\n");
            }
            else if(strcmp(stra,"000010")==0){
                if(x>=1&&x<=31&&y>=1&&y<=31){
                    printf("SUB R%d,R%d\n",x,y);
                }
                else printf("Error!\n");
            }
            else if(strcmp(stra,"000011")==0){
                if(x>=1&&x<=31&&y>=1&&y<=31){
                    printf("DIV R%d,R%d\n",x,y);
                }
                else printf("Error!\n");
            }
            else if(strcmp(stra,"000100")==0){
                if(x>=1&&x<=31&&y>=1&&y<=31){
                    printf("MUL R%d,R%d\n",x,y);
                }
                else printf("Error!\n");
            }
            else if(strcmp(stra,"000101")==0){
                if(x>=1&&x<=31&&y>=1&&y<=31){
                    printf("MOVE R%d,R%d\n",x,y);
                }
                else printf("Error!\n");
            }
            else if(strcmp(stra,"000110")==0){
                if(x>=1&&x<=31&&y==0){
                    printf("SET R%d\n",x);
                }
                else printf("Error!\n");
            }
            else printf("Error!\n");
        }
    }
    return 0;
}


 

HeHe

Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 331    Accepted Submission(s): 132


Problem Description
M=⎛⎝⎜⎜⎜⎜⎜⎜⎜⎜⎜tn−1tn−2tn−3⋮t1t0tntn−1tn−2⋮t2t1tn+1tntn−1⋮t3t2⋯⋯⋯⋱⋯⋯t2∗n−3t2∗n−4t2∗n−5⋮tn−1tn−2t2∗n−2t2∗n−3t2∗n−4⋮tntn−1⎞⎠⎟⎟⎟⎟⎟⎟⎟⎟⎟

You are expected to write a program to point out some elements of   M∗M .
 


 

Input
Multi test cases (about 100), every case occupies two lines.
The first line contains an integer n.
Then second line contain 2*n-1 integers   t0,t1,t2,t3,…,t2∗n−4,t2∗n−3,t2∗n−2  separated by exact one space.
The third line contains an integer m, indicates the number of query.
Next m lines will give queries
r0r1r2⋮rm−1c0c1c2⋮cm−1
For   r0,c0  the program will query the element of   M∗M  which locates in the   rth0  row,   cth0  column. For   ri,ci(0<i<m) , assume that the answer of   i−1th query is ANS, the program will query the element of   M∗M  which locates in   ((ri+ANS)%n)th  row,   ((ci+ANS)%n)th  column.
Please process to the end of file.
[Technical Specification]
1≤n≤1000
0≤ti≤100
0≤ri,ci≤n−1
1≤m≤100000
 


 

Output
For each case，output the sum of the answer of each query.
 


 

Sample Input 
  
  

   
   3
1 2 3 1 2
2
0 0
1 2
4
10 5 7 2 10 5 7
3
1 2
3 0
2 1
2
1 2 3
4
0 0
0 1
1 0
1 1
 


 

Sample Output 
  
  

   
   23
348
22

   
   

    
    

     
     Hint
    
    
$\quad\  \text{For the first case }M = \begin{pmatrix}
3 & 1 & 2\\ 
2 & 3 & 1\\ 
1 & 2 & 3
\end{pmatrix}$

$\text{For the second case }M = \begin{pmatrix}
2 & 10 & 5 & 7\\ 
7 & 2 & 10 & 5\\ 
5 & 7 & 2 & 10\\ 
10 & 5 & 7 & 2
\end{pmatrix}$
 


 

Source
BestCoder Round #15


标程讲的哪种方法还不会只会这个较为简单的方法时间复杂度较高数据强的话可能超时

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<list>
#include<queue>
#include<vector>
using namespace std;
const int maxn=1010;
long long num[maxn<<1];
int main()
{
    int n,m,i,j,k;
    while(scanf("%d",&n)!=EOF){
        for(i=0;i<=2*n-2;++i){
            scanf("%lld",&num[i]);
        }
        scanf("%d",&m);
        int ans=0,x,y;
        long long sum=0;
        while(m--){
            scanf("%d%d",&x,&y);
            x=(x+ans)%n;y=(y+ans)%n;
            ans=0;
            for(i=0;i<n;++i){
                ans=ans+num[n-1-x+i]*num[n-1+y-i];
            }
            sum+=ans;
        }
        printf("%lld\n",sum);
    }
    return 0;
}


 

飘摇的尘土
关注
专栏目录
HDOJ2010
wusai233的博客
10-22 568
1.“水仙花数”是指一个三位数，它的各位数字的立方和等于其本身，比如：153=1^3+5^3+3^3。现在要求输出所有在m和n范围内的水仙花数 。   输入数据有多组，每组占一行，包括两个整数m和n（100 2.根据i题目的要求，需要将获得的三位数拆分成个，十，百，再经过计算判断然后输出。 3.写好前面代码之后在写拆分的方法： a = i / 100; b = (i - a * 100
BestCoder 的两道水题 HDU 4989 4990
u011481752的专栏
09-08 853
寻人启事：2014级新生看过来！ Summary Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 127    Accepted Submission(s): 91 Problem Descriptio
HDOJ 5184 Brackets 卡特兰数扩展
码代码的猿猿
03-19 985
既求从点(0,0)只能向上或者向右并且不穿越y=x到达点(a,b)有多少总走法... 有公式: C(a+b,min(a,b))-C(a+b,min(a,b)-1)  ///  折纸法证明卡特兰数: http://blog.sina.com.cn/s/blog_6917f47301010cno.html Brackets Time Limit: 2000/1000 MS
BC22hdoj5142&&hdoj5143&&hdoj5144
走一步再走一步
03-02 529
NPY and FFT Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 771    Accepted Submission(s): 469 Problem Description A boy named NPY
BC18hdoj5104&&hdoj5105&&hdoj5106
走一步再走一步
02-29 421
Primes Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2014    Accepted Submission(s): 926 Problem Description Given a numb
BC11hdoj5054&&hdoj5055&&hdoj5056&&hdoj5057
走一步再走一步
02-22 406
Alice and Bob Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 699    Accepted Submission(s): 508 Problem Description Bob and Alice
BC9hdoj4993&&hdoj4994
走一步再走一步
02-22 464
Revenge of ex-Euclid Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 654    Accepted Submission(s): 380 Problem Description In arit
BC16&&hdoj5086&&hdoj5087
走一步再走一步
02-28 377
Revenge of Segment Tree Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1474    Accepted Submission(s): 526 Problem Description In
BC23&&hdoj5146&&hdoj5147
走一步再走一步
03-04 401
Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 887    Accepted Submission(s): 473 Problem Description   Today we have a nu
bc19&&hdoj5108&&hdoj5109
走一步再走一步
03-01 402
Alexandra and Prime Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1632    Accepted Submission(s): 557 Problem Description
判断两条线段是否相交
ONE MORE TRY
04-22 7224
YES!
杭电OJ_2033——人见人爱A+B（c语言解析）
student_hwj的博客
12-11 1646
题目 传送门 人见人爱A+B Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 78249 Accepted Submission(s): 50746 Problem Description HDOJ上面已经有10来道A+B的题目了，相信这些题目曾经是大家的最爱，希望今天的这个A+B能给大家带来好运，也希望这个题目能唤起大家对ACM曾经的热爱。
最长公共子串
weixin_53235736的博客
03-25 3741
最长公共子串
codeforces228ABC
走一步再走一步
06-22 4642
A. Fox and Number Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Fox Ciel is playing a game with numbe
codeforces362（div2）ABC
走一步再走一步
07-28 3775
A. Pineapple Incident time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Ted has a pineapple. This pineapple is
cf350div2ABCD1D2E
走一步再走一步
05-06 1792
A. Holidays time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output On the planet Mars a year lasts exactly n days (
省赛
走一步再走一步
06-15 1371
表达式求值 时间限制：1000 ms  |  内存限制：65535 KB 难度：3 描述假设表达式定义为: 1. 一个十进制的正整数 X 是一个表达式。 2. 如果 X 和 Y 是 表达式，则 X+Y, X*Y 也是表达式; *优先级高于+. 3. 如果 X 和 Y 是 表达式，则 函数 Smax(X,Y)也是表达式,其值为:先分别求出 X ,Y 值的各位数字之和，再从中选最大数
UESTC第七届ACM趣味程序设计竞赛第四场（正式赛）
走一步再走一步
01-16 1274
Memory Time Limit: 3000/1000MS (Java/Others)     Memory Limit: 65535/65535KB (Java/Others) Submit  Status 小x和小h是好盆友，小h从小体弱多病，而且还非常健忘，于是把自己平时吃的n瓶药都给小x等人保管。 某一天由于雾都的pm2.5爆表，小h的慢性呼吸道疾病
cf327Bcf152B152C
走一步再走一步
05-10 1010
B. Hungry Sequence time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Iahub and Iahubina went to a date at a lu
HDOJ题目源码大全
资源摘要信息:"HDOJ（Higher Difficulty Online Judge）是一个在线编程题库，专注于提供较高难度的算法和编程题目。它为程序员和算法爱好者提供了一个平台，以在线提交代码的方式解决各种编程难题，从而锻炼和提升...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值