首页 > 其他分享 >2023.5.23每日总结

2023.5.23每日总结

时间:2023-05-23 19:47:12浏览次数:38  
标签:总结 none 2023.5 23 color text background font border

<%@ page import="wangzhan.Thesql" %>
<%@ page import="wangzhan.Pd_P_assignment" %>
<%@ page import="wangzhan.Pd_S_assignment" %>
<%@ page language="java" contentType="text/html; charset=UTF-8"

         pageEncoding="UTF-8"%>
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>教学管理平台</title>
    <style>
        body {
            font-family: Arial, sans-serif;
            background-color: #f7f7f7;
        }

        h1 {
            color: #333;
            text-align: center;
            margin-top: 50px;
        }

        table {
            margin: 0 auto;
            border-collapse: collapse;
            box-shadow: 0 0 20px rgba(0, 0, 0, 0.1);
            background-color: #fff;
        }

        th, td {
            padding: 30px;
            text-align: center;
            border: 1px solid #ddd;
            font-size: 17px;
        }

        th {
            background-color: #8b8989;
            color: #fff;
            font-size: 30px;
        }

        tr:nth-child(even) {
            background-color: #f2f2f2;
        }
        input{
            border: none;
            border-radius: 10px;
            height: 27px;
        }
        .submit{
            background-color: rgb(26, 131, 201);
            color: aliceblue;
            height: 50px;
            width: 90%;
        }
        .submit:active{
            background-color: rgb(166, 172, 175);
        }
        a{
            text-decoration: none;
            font-size: 20px;
            color: #3bc9e2;
        }
        /* 翻页选中样式 */
        .active {
            color: white;
            background-color: #007bff;
            border-radius: 0.25rem;
            padding: 0.5rem;
            text-decoration: none;
            margin-right: 10px;
        }

        /* 翻页未选中样式 */
        a.page-link {
            color: #007bff;
            text-decoration: none;
            margin-right: 10px;
        }
        #pagination{
            text-align: center;
        }
    </style>
</head>
<%
    Thesql thesql = new Thesql();
    request.setCharacterEncoding("UTF-8");
    String les="";
    String pu="";
    String stu="";
    les=request.getParameter("les");
    pu=request.getParameter("pu");
    stu=request.getParameter("stu");

    Pd_S_assignment pd[] = thesql.S_assignment_DimQuery("","","","","","",pu,les,stu);

    int itemsPerPage = 5;//每页展示多少条
    int totalItems = pd.length;//总共多少条
    int currentPage = request.getParameter("page") == null ? 1 : Integer.parseInt(request.getParameter("page"));
    int totalPages = (int) Math.ceil(totalItems / (double)itemsPerPage);
    int startItem = (currentPage - 1) * itemsPerPage + 1;
    int endItem = Math.min(startItem + itemsPerPage - 1, totalItems);
%>
<body>

<table>
    <tr>
        <form action="Browse_Sexperiment.jsp" method="post">
            <th>课程:<input type="text" name="les"></th>
            <th>名称:<input type="text" name="pu"></th>
            <th>学生:<input type="text" name="stu"></th>
            <th><input class="submit" type="submit"></th>
        </form>
    </tr>
    <% for (int i = startItem; i < endItem; i++) { %>
    <tr>
        <td><%=pd[i].getLesson_name()%></td>
        <td><%=thesql.P_assignment_query(pd[i].getPu_ass_id()).getType()%>:<%=pd[i].getPu_name()%></td>
        <td><%=pd[i].getStudent_name()%></td>
        <td><a href="Submit_experiment.jsp?exp_id=<%=pd[i].getId()%>
        &les_id=<%=thesql.P_assignment_query(pd[i].getPu_ass_id()).getLesson_id()%>">查看</a></td>
    </tr>
    <% }%>

</table>
<br>
<%
    if(!(les!=null)) les="";
    if(!(pu!=null)) pu="";
    if(!(stu!=null)) stu="";
%>
<div id="pagination">
    <%-- 显示翻页链接 --%>
    <%--    &les=<%=les%>&pu=<%=pu%>&stu=<%=stu%>--%>
    <a href="?page=<%= Math.max(1, currentPage - 1) %>&les=<%=les%>&pu=<%=pu%>&stu=<%=stu%>" <%= currentPage == 1 ? "class=\"disabled page-link\"" : "class=\"page-link\"" %> >&laquo; 上一页</a>
    <% for (int i = 1; i <= totalPages; i++) { %>
    <a href="?page=<%= i %>&les=<%=les%>&pu=<%=pu%>&stu=<%=stu%>" <%= i == currentPage ? "class=\"active\"" : "class=\"page-link\"" %> ><%= i %></a>
    <% } %>
    <a href="?page=<%= Math.min(currentPage + 1, totalPages) %>&les=<%=les%>&pu=<%=pu%>&stu=<%=stu%>" <%= currentPage == totalPages ? "class=\"disabled page-link\"" : "class=\"page-link\"" %> >下一页 &raquo;</a>
</div>

</body>>
</html>

 

标签:总结,none,2023.5,23,color,text,background,font,border
From: https://www.cnblogs.com/wllovelmbforever/p/17426173.html

相关文章

  • 5.23
    #include<stdio.h>voidmain(){intinteger,i,max,min,sum;max=-32768;min=32767;sum=0;for(i=0;i<10;i++){printf("Inputnumber%d:",i);scanf("%d",&integer);sum+=integer;if(integer>max)max=integer;if(integer<min)min=intege......
  • 编程一小时2023.5.23
    1.#include<iostream>#include<cstring>#include<algorithm>usingnamespacestd;chartran(charc){return(int)(c-'A'-4)>0?(c-5):(c+21);}stringsd,str,ed,eof="ENDOFINPUT";intmain(){strings;while(getline(ci......
  • 5月23日打卡
    例5-7常成员函举例代码部分: #include<iostream>usingnamespacestd;classR{private:intr1,r2;public:R(intr1,intr2):r1(r1),r2(r2){}voidprint();voidprint()const;};voidR::print(){cout<<r1<<":"&l......
  • 5.23打卡
    #include<bits/stdc++.h>usingnamespacestd;constfloatPI=3.141593;constfloatFENCE_PRICE=35;constfloatCONCRETE_PRICE=20;classCircle{public:Circle(floatr);floatcircumference();floatarea();private:......
  • 个人总结
    对于开课目标:对于手机上的小游戏仅仅绘制了游戏的界面xml,但由于androidstdio配置问题,导致项目被删除(当时的博客也说明了此事),也和老师当面讲清了这件事。《构建之法》这本书提出的五个问题是:如何将部分整合为一个具有执行力的整体?如何在持续改进的环境中,构建一个有效的......
  • 2023.5.21学习内容 多态、接口、泛型、反射
    下午1.了解CSS响应式布局和兼容性问题2.浏览IDEA使用手册并修改Maven仓库设置3.复习强化JavaSE的多态、接口、泛型、反射知识importorg.junit.Test;importtest.Hello;importjava.lang.reflect.Field;importjava.util.ArrayList;importjava.util.LinkedList;import......
  • 十大经典排序算法总结
    排序算法可以分为:内部排序:数据记录在内存中进行排序。外部排序:因排序的数据很大,内存不能容纳全部的排序记录,在排序过程中需要访问外存。常见的内部排序算法有:插入排序、希尔排序、选择排序、冒泡排序、归并排序、快速排序、堆排序、基数排序、计数排序、桶排序。其中比较类......
  • poj-2362
    //132K141MSC++withbeginSearchPos#include<cstdio>#include<cstring>#include<cstdlib>usingnamespacestd;intcmp(constvoid*a,constvoid*b)//降序{return*(longlong*)b-*(longlong*)a;}longlongfourEdgeLeng......
  • poj-2371
    //524K63MSC++#include<cstdio>#include<cstring>#include<cstdlib>intcmp(constvoid*a,constvoid*b){return*((int*)a)-*((int*)b);}usingnamespacestd;constintMAX=100001;intarray[MAX];intdataBaseSiz......
  • poj-1023
    //184K0MSC++#include<cstdio>#include<cstring>usingnamespacestd;charNP[65];//-1:n,1:pcharstr[80];chardigitUsed[80];charbinaryExpression[80];intcaseNum;intlength;longlongval;voidsolve(longlongval){l......