合肥生活安徽新聞合肥交通合肥房產生活服務合肥教育合肥招聘合肥旅游文化藝術合肥美食合肥地圖合肥社保合肥醫院企業服務合肥法律

        代寫CSC3100 Data Structures

        時間:2023-11-27  來源:合肥網hfw.cc  作者:hfw.cc 我要糾錯



        A. Requirements Code (**%)
        You can write your code in Java, Python, C, or C++. The time limit may vary among different languages, depending on the performance of the language. Your code must be a complete excutable program instead of only a function. We guarantee test data strictly compliance with the requirements in the description, and you do not need to deal with cases where the input data is invalid.
        Libraries in this assignment:
        • For C/C++, you can only include standard library.
        • For Java, you can only import java.util.*
        • For Python, you can only import standard library. In other words, you cannot import libraries such as numpy.
        We provide an example problem to illustrate the information above better.
        Report (10%)
        You also need to write a report in pdf type to explain the following: • What are the possible solutions for the problem?
        • How do you solve this problem?
        • Why is your solution better than others?
        Please note that the maximum number of pages allowed for your report is 5 pages.
        Remember that the report is to illustrate your thinking process. Keep in mind that your report is supposed to show your ideas and thinking process. We expect clear and precise textual descriptions in your report, and we do not recommend that you over-format your report.
        B. Example Problem: A + B Problem Description
        Given 2 integers A and B, compute and print A + B
        Input
        Two integers in one line: A, and B
        Output
        One integer: A + B
        Sample Input 1 Sample Output 1
        123
        Problem Scale & Subtasks
        For 100% of the test cases, 0 ≤ A,B ≤ 106
            1

        Solutions
        Java
        import java.util.*;
        public class Example {
        public static void main(String[] args) {
        int a, b;
        Scanner scanner = new Scanner(System.in); a = scanner.nextInt();
        b = scanner.nextInt();
        scanner.close();
        System.out.println(a + b);
        } }
        Python
        AB = input (). split ()
        A, B = int(AB[0]), int(AB[1]) print(A + B)
        C
        #include <stdio.h>
        int main(int argc, char *argv[]) {
        int A, B; scanf("%d%d", &A, &B); printf("%d\n", A + B); return 0;
        }
        C++
        #include <iostream >
        int main(int argc, char *argv[]) {
        int A, B;
        std::cin>> A >> B;
        std::cout<< A + B << std::endl; return 0;
        }
        C. Submission
        After finishing this assignment, you are required to submit your code to the Online Judge System (OJ), and upload your .zip package of your code files and report to BlackBoard.
        C.1 Online Judge
        Once you have completed one problem, you can submit your code on the page on the Online Judge platform (oj.cuhk.edu.cn, campus only) to gain marks for the code part. You can submit your solution of one problem for no more than 80 times.
        After you have submitted your program, OJ will test your program on all test cases and give you a grade. The grade of your latest submission will be regarded as the final grade of the corresponding problem. Each problem is tested on multiple test cases of different difficulty. You will get a part of the score even if your algorithm is not the best.
                2

        Note: The program running time may vary on different machines. Please refer to the result of the online judge system. OJ will show the time and memory limits for different languages on the corresponding problem page.
        If you have other questions about the online judge system, please refer to OJ wiki (campus network only). If this cannot help you, feel free to contact us.
        C.2 BlackBoard
        You are required to upload your source codes and report to the BlackBoard platform. You need to name your files according to the following rules and compress them into A1_<Student ID>.zip :
        A1_<Student ID>.zip
        |-- A1_P1_<Student ID>.java/py/c/cpp |-- A1_P2_<Student ID>.java/py/c/cpp |-- A1_Report_<Student ID>.pdf
        For Java users, you don’t need to consider the consistency of class name and file name. For example, suppose your ID is 123456789, and your problem 1 is written in Python, problem 2 is
        written in Java then the following contents should be included in your submitted A1_123456789.zip:
        A1_123456789.zip
        |-- A1_P1_123456789.py
        |-- A1_P2_123456789.java |-- A1_Report_123456789.pdf
        C.3 Late Submissions
        Submissions after Nov 24 2023 23:59:00(UTC+8) would be considered as LATE.
        The LATE submission page will open after deadline on OJ.
        Submisson time = max{latest submisson time for every problem, BlackBoard submisson time} There will be penalties for late submission:
        • 0–24 hours after deadline: final score = your score×0.8 • 24–72 hours after deadline: final score = your score×0.5 • 72+ hours after deadline: final score = your score×0
        FAQs
        Q: I cannot access to Online Judge.
        A: First, please ensure that you are using the campus network. If you are not on campus, please use the university VPN. Second, please delete cookies and refresh browser or use other browser. If you still cannot access to Online Judge, try to visit it via the IP address 10.26.200.13.
        Q: My program passes samples on my computer, but not get AC on OJ. A: Refer to OJ Wiki Q&A
        Authors
        If you have questions for the problems below, please contact: • Yige Jiang: 1210**233@link.cuhk.edu.cn
        • Ruiying Liu: ruiyingliu@link.cuhk.edu.cn
        3

        CSC3100 Data Structures Fall 2023 Programming Assignment 3
        Due: Nov 24 2023 23:59:00
        Assignment Link: http://oj.cuhk.edu.cn/contest/csc310023falla3 Access Code: 9v7Dxqet
        1 Node Distance(40% of this assignment) 1.1 Description
        You are given a tree with n nodes, where each edge in the tree has a corresponding weight denoting the length of each edge. The nodes in the tree are colored either black or white. Your task is to calculate the sum of distances between every pair of black nodes in the tree. Let B = {b1, b2, ...} a set of black nodes, then the answer is formulated as:
        |B|−1 |B|
        Ans= 􏰀 􏰀 dist(bi,bj)
        i=1 j =i+1
        where |B| denotes the number of the black nodes in the tree, and dist(bi,bj) is the length of the simple
        path from the i-th to j-th black node.
        Write a program to calculate the sum of distances on the tree between every pair of black nodes Ans
        in the given tree.
        1.2 Input
        The first line contains an integer n, representing the number of nodes in the tree.
        The second line contains n space-separated integers {c1,c2,...,ci,...,cn} where ci is either 0 or 1.
        ci = 1 indicates that the i-th node is black, and ci = 0 indicates that the i-th node is white.
        The following n − 1 lines, {l1, l2, . . . , lp, . . . , ln−1}, denoting the structure of the tree follow, each line lp contains 2 integers qp and wp, denoting an edge of length wp between the p + **th node and the qp-th node.
        1.3 Output
        Output the sum of distances for every pair of black nodes in the tree.
        Sample Input 1 Sample Output 1
        5 18 01111
        11
        12
        ** 31
            4

        This sample considers a tree with 5 nodes:
         The **st node is white, and 2-, 3-, 4-, 5-th nodes are black.
        The length of edge: (2-nd, **st): 1, (3-rd, **st): 2, (4-th, 3-rd): 2, (5-th, 3-rd): 1. Ans = ((1 + 2) + (1 + 2 + 2) + (1 + 2 + 1)) + (2 + 1) + 2 + 1 = 18.
        Sample Input 2 Sample Output 2
        9 96 010111111
        12
        13
        22 21 52 53 12 71
        Three additional large-scale samples are included in the provided files, namely, A samplecase1.in/.ans, A samplecase2.in/.ans and A samplecase3.in/.ans.
        Problem Scale & Subtasks
        For100%ofthetestcases,1≤n≤105,1≤qp−1 <p,1≤wp ≤1000
             Test Case No. **4
        5-7 8
        9 10
        Hint
        Constraints n ≤ 100
        n ≤ 1000 qp = p
        qp = 1
        No additional constraints
        1
        12
        23
        21
        45
          It can be proven that the given structure is definitely an unrooted tree.
        For C/C++ and Java users, an int type stores integers range from -2,1**,483,648 to 2,1**,483,6**. It may be too small for this problem. You need other data types, such as long long for C/C++ and long for Java. They store integers ranging from -9,223,372,036,854,775,808 to 9,223,372,036,854,775,807. Use scanf("%lld",&n) for C, cin>>n for C++ and n = scanner.nextLong() for Java to get the input n. And the other operations for long and long long are quite same as int.
        For Python users, if there occurs a RecusrionError, see here.
        5

        2 Price Sequence (50% of this assignment) 2.1 Description
        Mario bought n math books and he recorded their prices. The prices are all integers, and the price sequence is a = {a0 , a2 , ...ai , ..., an−1 } of length n (n ≤ 100000). Please help him to manage this price sequence. There are three types of operations:
        • BUY x: buyanewbookwithpricex,thusxisaddedattheendofa.
        • CLOSEST ADJ PRICE: output the minimum absolute difference between adjacent prices.
        • CLOSEST PRICE: output the absolute difference between the two closest prices in the entire se- quence.
        A total of m operations are performed (1 ≤ m ≤ 100000). Each operation is one of the three mentioned types. You need to write a program to perform given operations. For operations ”CLOSEST ADJ PRICE” and ”CLOSEST PRICE” you need to output the corresponding answers.
        2.2 Input
        The first line contains two integers n and m, representing the length of the original sequence and the number of operations.
        The second line consists of n integers, representing the initial sequence a.
        Following that are m lines, each containing one operation: either BUY x, CLOSEST ADJ PRICE, or
        CLOSEST PRICE (without extra spaces or empty lines).
        2.3 Output
        For each CLOSEST ADJ PRICE and CLOSEST PRICE command, output one line as the answer.
        Sample Input 1
        34
        719 CLOSEST_ADJ_PRICE BUY 2 CLOSEST_PRICE CLOSEST_ADJ_PRICE
        Sample Input 2
        6 12
        30 50 39 25 12 19 BUY 4 CLOSEST_PRICE
        BUY 14 CLOSEST_ADJ_PRICE CLOSEST_PRICE
        BUY 0 CLOSEST_PRICE
        BUY 30
        BUY 12 CLOSEST_PRICE
        BUY 20 CLOSEST_PRICE
        Sample Output 1
        6 1 6
        Sample Output 2
        5 7 2 2 0 0
                Two additional large-scale samples are included in the provided files, namely, B samplecase1.in/.ans and B samplecase2.in/.ans.
        6

        Problem Scale & Subtasks
        For 100% of the test cases, 2 ≤ n, m ≤ 1 × 105, 0 ≤ ai, x ≤ 1012
         Test Case No. **4
        5-6 7-9 10
        Hint
        Constraints
        n ≤ 103,m ≤ 103
        There is no CLOSEST PRICE operation
        ai and x are uniformly distributed at random within the range [0,1012] No additional constraints
          For C/C++ and Java users, an int type stores integers range from -2,1**,483,648 to 2,1**,483,6**. It may be too small for this problem. You need other data types, such as long long for C/C++ and long for Java. They store integers ranging from -9,223,372,036,854,775,808 to 9,223,372,036,854,775,807. Use scanf("%lld",&n) for C, cin>>n for C++ and n = scanner.nextLong() for Java to get the input n. And the other operations for long and long long 
        請加QQ:99515681 或郵箱:99515681@qq.com   WX:codehelp

        掃一掃在手機打開當前頁
      1. 上一篇:ECE1747H代做、代寫python,Java程序
      2. 下一篇:CS 2210編程代寫、Java程序語言代做
      3. 無相關信息
        合肥生活資訊

        合肥圖文信息
        急尋熱仿真分析?代做熱仿真服務+熱設計優化
        急尋熱仿真分析?代做熱仿真服務+熱設計優化
        出評 開團工具
        出評 開團工具
        挖掘機濾芯提升發動機性能
        挖掘機濾芯提升發動機性能
        海信羅馬假日洗衣機亮相AWE  復古美學與現代科技完美結合
        海信羅馬假日洗衣機亮相AWE 復古美學與現代
        合肥機場巴士4號線
        合肥機場巴士4號線
        合肥機場巴士3號線
        合肥機場巴士3號線
        合肥機場巴士2號線
        合肥機場巴士2號線
        合肥機場巴士1號線
        合肥機場巴士1號線
      4. 短信驗證碼 酒店vi設計 NBA直播 幣安下載

        關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網 版權所有
        ICP備06013414號-3 公安備 42010502001045

        51视频精品全部免费最新| 亚洲中文字幕久久精品无码喷水 | 国产偷国产偷精品高清尤物| 亚洲国产日韩a在线播放| 精品国产三上悠亚在线观看| 国产精品区一区二区三| 国产私拍福利精品视频网站| 97精品在线视频| 亚洲国产精品乱码一区二区| 国产小呦泬泬99精品| 国产精品99久久久久久宅男| 日韩人妻无码免费视频一区二区三区| 精品国产高清自在线一区二区三区| 国内精品久久久久影院老司| 精品国产乱子伦一区二区三区| 久久香蕉超碰97国产精品| 久久久久国产成人精品 | 2021久久精品免费观看| 久久国产乱子伦免费精品| 99国产精品免费视频观看| 乱色精品无码一区二区国产盗| 久久精品中文字幕| 久久久午夜精品理论片| 国产成人精品无码一区二区| 久久se精品一区二区| 精品免费tv久久久久久久| 国产午夜精品免费一区二区三区| 国自产精品手机在线观看视| 国产免费久久精品丫丫| 精品久久人人妻人人做精品| 精品国产福利盛宴在线观看| 国产偷伦精品视频| 精品水蜜桃久久久久久久| 久久精品国产一区二区| 中日韩精品电影推荐网站 | 国产精品一国产AV麻豆| 2021国产精品成人免费视频| 亚洲国产精品免费观看 | 亚洲国产精品成人| 国产成人高清精品免费观看| 国产精品爱搞视频网站|