zoukankan      html  css  js  c++  java
  • 20210303第一次课下作业

    1~100的偶数和是?(素数还没会)

    答题

    <%@ page language="java" import="java.util.*" pageEncoding="ISO-8859-1"%>
    <%
    String path = request.getContextPath();
    String basePath = request.getScheme()+"://"+request.getServerName()+":"+request.getServerPort()+path+"/";
    %>
    
    <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
    <html>
      <head>
        <base href="<%=basePath%>">
        
        <title>My JSP 'index.jsp' starting page</title>
        <meta http-equiv="pragma" content="no-cache">
        <meta http-equiv="cache-control" content="no-cache">
        <meta http-equiv="expires" content="0">    
        <meta http-equiv="keywords" content="keyword1,keyword2,keyword3">
        <meta http-equiv="description" content="This is my page">
        <!--
        <link rel="stylesheet" type="text/css" href="styles.css">
        -->
      </head>
      
      <body>
        求1-100的偶数和?
        <hr>
        <br>
    </body>
    
    <%
        int a, sum = 0;
        for (a = 1; a <= 100; a++) {
            if (a % 2 == 0) {
                sum += a;
            }
        }
    %>
    
    1-100中间的偶数和是:
    <%=sum%>
    </html>

    百度后


    <%@ page language="java" import="java.util.*" pageEncoding="ISO-8859-1"%> 改为
    <%@ page language="java" contentType="text/html; charset=UTF-8" pageEncoding="UTF-8"%> (位于作业第一行)

  • 相关阅读:
    poj 2100 尺取法 一个数字拆成连续数字平方和
    poj 1011 dfs+剪枝
    CF-242-C bfs+stl
    hdu 1297 递推
    poj 2104 划分树模板
    poj 3842 全排列+筛素数+暴力
    hdu 1421 经典dp
    hdu 1069 最长上升子序列变形
    hdu 3496 二维费用的01背包
    nyoj 16 最长上升子序列变形
  • 原文地址:https://www.cnblogs.com/jiming123/p/14515401.html
Copyright © 2011-2022 走看看