• 洛谷题单 【入门1】顺序结构


    1.B2002

    1. #include
    2. int main(void) {
    3. printf("Hello,World!");
    4. return 0;
    5. }

     2.B2025

    1. #include
    2. int main(void) {
    3. printf(" *\n ***\n*****\n ***\n *");
    4. return 0;
    5. }

    3.P1000

    1. #include
    2. int main(void) {
    3. printf(" ********\n ************\n ####....#.\n #..###.....##....\n ###.......###### ### ###\n ........... #...# #...#\n ##*####### #.#.# #.#.#\n ####*******###### #.#.# #.#.#\n ...#***.****.*###.... #...# #...#\n ....**********##..... ### ###\n ....**** *****....\n #### ####\n ###### ######\n##############################################################\n#...#......#.##...#......#.##...#......#.##------------------#\n###########################################------------------#\n#..#....#....##..#....#....##..#....#....#####################\n########################################## #----------#\n#.....#......##.....#......##.....#......# #----------#\n########################################## #----------#\n#.#..#....#..##.#..#....#..##.#..#....#..# #----------#\n########################################## ############\n");
    4. return 0;
    5. }

    4.P1001

    1. #include
    2. int main(void) {
    3. int a,b,sum;
    4. scanf("%d%d",&a,&b);
    5. sum=a+b;
    6. printf("%d",sum);
    7. return 0;
    8. }

    5.B2005

    1. #include
    2. int main(void) {
    3. char ch;
    4. scanf("%c",&ch);
    5. for(int i=0;i<3;i++){
    6. for(int j=2-i;j>0;j--)printf(" ");
    7. for(int j=0;j<2*i+1;j++)printf("%c",ch);
    8. printf("\n");
    9. }
    10. return 0;
    11. }

    6.5703

    1. #include
    2. int main(void) {
    3. int a,b,c;
    4. scanf("%d%d",&a,&b);
    5. c=a*b;
    6. printf("%d",c);
    7. return 0;
    8. }

    7.5704

    1. #include
    2. int main(void) {
    3. char c;
    4. scanf("%c",&c);
    5. c=c-32;
    6. printf("%c",c);
    7. return 0;
    8. }

    8.B5705

    1. #include
    2. int main(void) {
    3. char a,b,c,d,ch;
    4. scanf("%c%c%c%c%c",&a,&b,&c,&ch,&d);
    5. printf("%c%c%c%c%c",d,ch,c,b,a);
    6. return 0;
    7. }

    9.B5706

    1. #include
    2. int main(void) {
    3. double t,a;
    4. int n,b;
    5. scanf("%lf%d",&t,&n);
    6. a=t/n;
    7. b=2*n;
    8. printf("%.3f\n%d",a,b);
    9. return 0;
    10. }

    10.B5708

    1. #include
    2. #include
    3. int main(void) {
    4. double a,b,c,p,s;
    5. scanf("%lf%lf%lf",&a,&b,&c);
    6. p=(a+b+c)/2;
    7. s=sqrt(p*(p-a)*(p-b)*(p-c));
    8. printf("%.1f",s);
    9. return 0;
    10. }

    11.B5707

    1. #include
    2. int main(void) {
    3. int s,v,h,m,temp;
    4. scanf("%d%d",&s,&v);
    5. m=(s+v-1)/v+10;
    6. temp=8*60-m;
    7. if(temp>=0){
    8. }else{
    9. temp=-temp;
    10. temp=24*60-temp;
    11. }
    12. h=temp/60;
    13. m=temp%60;
    14. if(h<10)printf("0");
    15. printf("%d:",h);
    16. if(m<10)printf("0");
    17. printf("%d",m);
    18. return 0;
    19. }

    12.B2029

    1. #include
    2. int main(void) {
    3. int h,r,n;
    4. scanf("%d%d",&h,&r);
    5. double v;
    6. v=3.14*r*r*h;
    7. n=(20*1000+v-1)/v;
    8. printf("%d",n);
    9. return 0;
    10. }

    13.B1425

    1. #include
    2. int main(void) {
    3. int a,b,c,d,e,f,temp;
    4. scanf("%d%d%d%d",&a,&b,&c,&d);
    5. temp=(c*60+d)-(a*60+b);
    6. e=temp/60;
    7. f=temp%60;
    8. printf("%d %d",e,f);
    9. return 0;
    10. }

    14.B1421

    1. #include
    2. int main(void) {
    3. int a,b,c,temp;
    4. scanf("%d%d",&a,&b);
    5. temp=a*10+b;
    6. c=temp/(1*10+9);
    7. printf("%d",c);
    8. return 0;
    9. }

    15.P3954

    1. #include
    2. int main(void) {
    3. int a,b,c,temp;
    4. scanf("%d%d%d",&a,&b,&c);
    5. temp=a*0.2+b*0.3+c*0.5;
    6. printf("%d",temp);
    7. return 0;
    8. }

  • 相关阅读:
    跳房子 I
    LeetCode
    [附源码]Python计算机毕业设计Django校园运动会管理系统
    8.2模拟赛总结
    Kafka入门,这一篇就够了(安装,topic,生产者,消费者)
    Latex论文写作小技巧记录,不断更新
    瑞芯微RK3568|SDK开发之Buildroot编译
    利用Abp过滤器实现业务数据“回收站”功能
    Java并发编程--多线程间的同步控制和通信
    unity 点击3D物体
  • 原文地址:https://blog.csdn.net/Rhett_Butler0922/article/details/132646900