Bestcoder 1st Anniversary

Topic Transfer: Bestcoder 1st Anniversary

1001

AC Code:

#include <map> #include <set> #include <cmath> #include <deque> #include <queue> #include <stack> #include <cstdio> #include <cctype> #include <string> #include <vector> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> #define LL long long#    Define INF 0x7fffffffusing namespace Std;int N, M, p, q;int main () {int T;    scanf ("%d", &t);        while (T--) {scanf ("%d%d%d", &n, &m, &p, &q);            if (q <= p) {int sum = n/m;            if (n% M > 0) sum + +;            int ans = sum * q;        printf ("%d\n", ans);            } else if (Q > P && ((Q * 1.0)/M < p)) {int sum = n/m;            int ans = sum * q;            if ((n% m) * p < Q) ans + = (n% m) * p;            else ans + = q;        printf ("%d\n", ans); } else if (Q > P && ((Q * 1.0)/M >= p)) {printf("%d\n", n * p); }} return 0;}

1002

AC Code:

#include <map> #include <set> #include <cmath> #include <deque> #include <queue> #include <stack> #include <cstdio> #include <cctype> #include <string> #include <vector> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> #define LL long long#  Define INF 0x7fffffffusing namespace Std;const char an[] = "Anniversary"; char s[105];int len;bool dfs (int a, int b, int c)    {int TB = b;            for (int i = A; I < Len && B < one; i + +) {if (s[i] = = An[b]) {int J; for (j = i; j < Len && B < One; J + +, B + +) {if (s[j]! = an[b]) break;//cout &L            t;< S[j];            }//cout << Endl;            if (b = = && C <= 2) return true;            if (Dfs (j, B, C + 1)) return true;            else {b = tb; }}} return false;}    int main () {int T; scanf ("%d ", &t);        while (T--) {scanf ("%s", s);        Len = strlen (s);        if (Dfs (0, 0, 0)) {printf ("yes\n");        } else {printf ("no\n"); }} return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Bestcoder 1st Anniversary