codeforces
Codeforces Round 976 (Div. 2)
A Find Minimum Operations
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t;
cin >> t;
- 要用二分搜不然會TLE只有20%(27-36行) 一開始少加37~38行結果只有90%（；´д｀）ゞ 100%版 #include <bits/stdc++.h> using namespace std; struct Meeting{ int start; int end; int p;
Jackis666 changed 7 months agoView mode
- 碳足跡數據整理(excel檔) https://docs.google.com/spreadsheets/d/1rRaupK8fVMW32LZ1LZX_NoY7gudWwFhNrjaJgI0R1-8/edit?gid=0#gid=0 碳足跡計算機程式碼 #include<Windows.h> #include<iostream> using namespace std; class carbon_calculate
