fork download 
  1. #include <stdio.h>
  2. //課題８
  3. int main(void) {
  4. int J,M,E,Se,So;
  5. scanf("%d",&J);
  6. scanf("%d",&M);
  7. scanf("%d",&E);
  8. scanf("%d",&Se);
  9. scanf("%d",&So);
  10. int Jc,Mc,Ec,Sec,Soc;
  11. if(J<60)
  12. Jc=1;
  13. else
  14. Jc=0;
  15. if(M<60)
  16. Mc=1;
  17. else
  18. Mc=0;
  19. if(E<60)
  20. Ec=1;
  21. else
  22. Ec=0;
  23. if(Se<60)
  24. Sec=1;
  25. else
  26. Sec=0;
  27. if(So<60)
  28. Soc=1;
  29. else
  30. Soc=0;
  31. int R;
  32. R=Jc+Mc+Ec+Sec+Soc;
  33. if(R==0)
  34. printf("合格\n");
  35. else if(R==1)
  36. printf("再試\n");
  37. else if(R>=2)
  38. printf("不合格\n");
  39. double ave;
  40. ave=(J+M+E+Se+So)/5;
  41. printf("平均点%lf\n",ave);
  42. int max;
  43. if((J>=M)&&(J>=E)&&(J>=Se)&&(J>=So))
  44. max=J;
  45. if((M>=J)&&(M>=E)&&(M>=Se)&&(M>=So))
  46. max=M;
  47. if((E>=M)&&(E>=J)&&(E>=Se)&&(E>=So))
  48. max=E;
  49. if((Se>=M)&&(Se>=E)&&(Se>=J)&&(Se>=So))
  50. max=Se;
  51. if((So>=M)&&(So>=E)&&(So>=Se)&&(So>=J))
  52. max=So;
  53. printf("最大値%d\n",max);
  54.  
  55. int min;
  56. if((J<=M)&&(J<=E)&&(J<=Se)&&(J<=So))
  57. min=J;
  58. if((M<=J)&&(M<=E)&&(M<=Se)&&(M<=So))
  59. min=M;
  60. if((E<=M)&&(E<=J)&&(E<=Se)&&(E<=So))
  61. min=E;
  62. if((Se<=M)&&(Se<=E)&&(Se<=J)&&(Se<=So))
  63. min=Se;
  64. if((So<=M)&&(So<=E)&&(So<=Se)&&(So<=J))
  65. min=So;
  66. printf("最小値%d\n",min);
  67. }
  68.  
  69.  
Success #stdin #stdout 0s 5316KB
comments (?)
stdin 
92 80 72 67 88
stdout 
合格
平均点79.000000
最大値92
最小値67
https://ideone.com/8BZm6V
language:
C (gcc 8.3)
created:
18 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!