吴贝贝的博客

#include int main() { char ch; int flag = 0, count = 0; int T, i; scanf("%d", &T); getchar(); for (i = 0; i < T; i++) { while ((ch = getchar()) != '\n') { if (ch == 'O') flag++;

#include #include #include double M(char x) { if (x == 'C') return 12.01; if (x == 'H') return 1.008; if (x == 'O') return 16.00; if (x == 'N') return 14.01; } int main() { char str[1

#include #include int main() { char ch; int arr[10] = { 0 }; int T, N, i, sum; scanf("%d", &T); while (T--) { scanf("%d", &N); for (i = 1; i <= N; i++) { sum = i; while (sum != 0)

#include #include int main() { int N, i, k; char ch, str[100]; scanf("%d", &N); getchar(); getchar(); while (N--) { scanf("%s", str); for (i = 1; i <= strlen(str); ++i) { if (strlen(s

#include #include const int N = 1005; const int M = 105; int first = 1; int n, m, cnt[M]; char dna[M][N]; void init() { scanf("%d%d", &m, &n); for (int i = 0; i < m; i++) scanf("%s", dna[i]); } vo

https://odzkskevi.qnssl.com/249e6049be24dee57a1c3b28ebf8f12d?v=1494220347 #include #include using namespace std; const int N = 3005; int a[N], v[N]; int main() { //freopen("in.txt", "r", stdin); //

https://odzkskevi.qnssl.com/7a6d79cc24549e28a9e58908bc151629?v=1493856790 #include #include int main() { int i, j; int len, base_len; char str[100000], base_str[100000]; while ((scanf("%s%s", s