陈鑫的专栏

这道题之前一直WA   主要是

#include #include using namespace std;int main(){ int a, b; while (cin >> a >> b){ if (a == 0 && b == 0) break; if (a==b&&b == 1) { cout << "0 1" << endl; continue;} int k; for (k = 1;;

#include #include #include using namespace std;void slove(char*,char*,int);int main(){ char pr[60], in[60]; string str1, str2; while (cin >> str1 >> str2){ strcpy(pr,str1.c_str()); strcpy

#include #include #include using namespace std;void slove(char*,char*,int);int main(){ char pr[60], in[60]; int T, n; string str; cin >> T; while (T--){ cin >> n; cin >> str; strcpy(p

#include #include #includeusing namespace std;struct Node{ int value, amout; Node(int a, int b):value(a),amout(b){}};int N, K;void slove();int main(){ while (cin >> N >> K,N,K){ slove()

#define _CRT_SECURE_NO_DEPRECATE#include #include #include using namespace std;struct Node{ int value; char suit; Node(int a, int b):value(a),suit(b){}};queueqn[13];void slove();int main

#include #include #include using namespace std;struct Node{ int value, time,priority; Node(int a, int b,int c):value(a),time(b),priority(c){} friend bool operator<(Node a, Node b){ if (a.pri

#include #include #include #include using namespace std;int adam[26], eve[26], n;void init();void func();int main(){ int N; cin >> N; while (N--){ cin >> n; getchar(); memset(adam, 0

#include #include #include #include #includeusing namespace std;#define N 210#define inf 100000bool vis[N];int n,flag;double dis[N][N];double length[N];struct Point{int x, y;}stone[N];double dijkstra(