weixin_43140251的博客

原题：A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a prime.Now given any two positive integers NNN (<10

原题：Suppose a bank has NNN windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:The space inside the yellow line in front of each window is

原题：It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other highways to keep the rest of th

原题：源代码：#include<iostream>#include<string>#include<cmath>using namespace std;string n1, n2;int tag, radix;int resradix = -1;long to10(string s, int r){ long res = 0; for(int i = s.length() - 1; i >= 0; i --){ in

原题目：To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algrbra), and E - English. At the mean time, we encourage students by em

原题：源代码：#include<iostream>#include<stdio.h>using namespace std;int main(){ double game[3][3]; char c[3] = {'W', 'T', 'L'}; double profit = 1; int tagj[3]; for(int i = 0; i < 3; i ++){ double max = -1;

原题目：源代码：#include<iostream>#include<vector>#include<stdio.h>#include<cmath>using namespace std;struct Ploy{ int n; float a;};float res[1000005];vector<Ploy> x, y;int main(){ int k1, k2; cin>>k1;

原题：源代码：#include<iostream>using namespace std;int main(){ int n; cin>>n; int timelist[n]; for(int i = 0; i < n; i ++) cin>>timelist[i]; int sum = 0; int now = 0; for(int i = 0; i < n; i ++){

原题：思路：dp核心代码：if(num[i] > num[i] + dp[i - 1]) dp[i] = num[i]; else dp[i] = num[i] + dp[i - 1]; if(dp[i] > max){ ma = i; max = dp[i]; }源代码：#include<iostream>using namespace std;int main(){ int N; cin>>N; int n = N;

原题目：源代码：#include<iostream>#include<stdio.h>#include<string>#include<algorithm>using namespace std;struct Time{ int hours; int minutes; int seconds;};struct Person{ string id; Time comein; Time comeou

原题：源代码：#include<iostream>#include<vector>#include<string>using namespace std;string invert[10] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};int main(){ string n; vector<int> num;

原题：题目大意：一个树，n个节点，m个非叶节点，求出每一层叶节点数。源代码：#include<iostream>#include<queue>using namespace std;int tree[105][105]; //规模不大，直接用数组存树int tchild[105]; //每个节点的孩子数int vis[105]; //访问标志int n, m; //n结点数，m非叶结点数queue<int> q;

原题：源代码：在这里插入代码片已AC：易失分点：

（第一时间的思路，未优化）原题目：源代码：#include<iostream>#include<vector>#include<stdio.h>using namespace std;struct P{ int n; double a;};int main(){ vector<P> x, y, sum; int k; cin >> k; while(k --){ P

源代码：#include<iostream> #include<cmath> using namespace std; int main(){ int x, y, sum; cin>>x>>y; sum = x+y; bool pt = true; if(sum < 0){ pt = false; sum = -sum; } bool flag = false; if(sum >= 1000) flag = true; if(!flag){ if