Alternative_19的博客

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 occupies 2 lines, and each line contains the informa...

#include<iostream>#include<vector>#include<algorithm>using namespace std;vector<int> v[100];int maxdepth = -1,book[105];void dfs(int index, int depth) { if (v[index].si...

题解：输出各位之和，用英文表达。#include<iostream>#include<vector>#include<algorithm>#include<string>using namespace std;int main() { string n; cin >> n; int sum=0; for (int ...

#include<iostream>#include<string>#include<stdio.h>using namespace std;int main() { int n; string lock, unlock,id; int min_in=24*60*60, max_out=-1; cin >> n; while (n...

#include<iostream>using namespace std;int main() { int n,k,now=0,sum=0; cin >> n; while (n--) { cin >> k; if (k > now) sum +=(k-now)* 6; if (k < now) sum += (now-k)...

要记得把数组开到最大。1005，2005.#include<iostream>#include <stdlib.h>using namespace std;int main() { int k, n; double aN, ans[2005] = { 0.0 }, arr[1005] = {0.0}; cin >> k; for (int ...

做题+看代码2h...debug半小时#include <iostream>#include <cctype>#include <algorithm>#include <cmath>#include<string>using namespace std;long long convert(string n, long l...