1002 A+B for Polynomials
試著用python做了一點PAT甲級的題目，前幾題不難，比如1002 A+B for Polynomials，地址：https://pintia.cn/problem-sets/994805342720868352/problems/994805526272000000
python代碼也不長，40行不到就能解決。
但是提交之後的結果有些嚇人，耗時還能接受，內存接近3MB，相比這題的數據量這個內存占用太大了。
用C++重寫一份交上去，一對比就看出問題了
用C++的這一份內存和耗時都只有python的十分之一左右，所以……以後還是拿C++做題吧。
（代碼寫的太辣雞了還是不掛上來了）
1002 A+B for Polynomials
相關推薦
甲級1002 A+B for Polynomials (25)
指數 lines term ios esp printf contains n) lin 題目描述： This time, you are supposed to find A+B where A and B are two polynomials. Input Ea
PAT 甲級1002 A+B for Polynomials (25)
文本 please terms struct suppose 作者 notice opera and 1002. A+B for Polynomials (25) 時間限制 400 ms 內存限制 65536 kB 代碼長度限制 16000 B 判題程序 S
1002. A+B for Polynomials (25)
min nta 文本 sum 結果 color printf rms %d 1002. A+B for Polynomials (25) 時間限制 400 ms 內存限制 65536 kB 代碼長度限制 16000 B 判題程序 Standard 作者 C
PAT甲級 1002 A+B for Polynomials (25)（25 分）
pac list i++ lease find and for pan put 1002 A+B for Polynomials (25)（25 分） This time, you are supposed to find A+B where A and B are
PAT甲級1002.A+B for Polynomials (25)
font color str 修改 col problem ack 比較 out 題目鏈接：https://pintia.cn/problem-sets/994805342720868352/problems/994805526272000000 解題思路： 由
1002 A+B for Polynomials
這一 src image 做了 com sets 提交 分享圖片 bubuko 試著用python做了一點PAT甲級的題目，前幾題不難，比如1002 A+B for Polynomials，地址：https://pintia.cn/problem-sets/994805
1002 A+B for Polynomials （25 分）
This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each
【PAT甲級】1002 A+B for Polynomials
This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file cont
1002 A+B for Polynomials - 模擬
思路：普通模擬一下就ok 程式碼如下： #include<iostream> #include<cstdio> #include<algorithm> #include<string> #include<cstring> #incl
PAT 甲級 1002 A+B for Polynomials （25 分）
1002 A+B for Polynomials （25 分） This time, you are supposed to find A+B where A and B are two polynomials.
PAT 1002 A+B for Polynomials （25 分）Java實現
1. 題意 給兩個多項式，把它們加起來 樣例分析： A多項式 2 1 2.4 0 3.2 第一個2指得是2個非0係數項 然後的兩個數，1是項數，2.4是係數 最後兩個數，0是項數，3.2是係數 所以就有f(x) = 2.4x + 3.2 B多項式 2 2 1.5 1 0.5 f(x)
1002. A+B for Polynomials
PS：這道題上週日就寫好了，但是忘了發上來。 題解 題目是把兩個多項式相加再按格式輸出，我用的方法是用一個結構體陣列儲存指數和係數，其實就是一個順序連結串列。 這道題因為之前在陳越姥姥的資料結構課做過類似的，所以做起來思路很清晰。不過還是卡了一會兒，甚至找了別人的程式碼看。最終發現自己的思路有以下缺
(甲) 1002 A+B for Polynomials
This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one test case.
PAT (Advanced Level) Practice 1002 A+B for Polynomials （25 分）
This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case
PAT 甲級 1002 A+B for Polynomials
Description This time, you are supposed to find A+B where A and B are two polynomials. Input Each input file contains multiple test
PAT (Advanced Level) 1002 A+B for Polynomials （25 分）
1002 A+B for Polynomials （25 分） This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input
1002 A+B for Polynomials （25 分）（簡單的PAT甲級題目）
我要考甲級！！！ This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one t
【PAT-A】1002. A+B for Polynomials 寫題記錄
思路： 第一次輸入原樣輸入，第二次輸入時，直接將相同指數的係數相加，並查詢有沒有已存在的指數，統計係數為0的個數。 因為佇列無法直接刪除係數為0的項，故0項最後輸出的時候再處理。 注意最後的格式 PS.題目有個瑕疵，未說明指數是否按降序輸入與輸出，因此最開始構思時想的是用優先佇列。
PAT (Advanced Level) Practice 1002 A+B for Polynomials （25 分）（C++）（甲級）
1002 A+B for Polynomials （25 分） This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input
PTA-1002——A+B for Polynomials
題目： This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contai