博客

#include <bits/stdc++.h>using namespace std;const int maxn = 1e5 + 5;char s[maxn];char t[maxn];int main() { scanf("%s", s + 1); printf("%s", s); int len = strlen(s + 1); for(...

You are given an integer array of length nn.You have to choose some subsequence of this array of maximum length such that this subsequence forms a increasing sequence of consecutive integers. In other...

题目描述序列a如下：a[0] = A;a[1] = B;a[i] = a[pp] * a[qq]; ( i>=2，pp = 向下取整(i/k1)，qq = 向下取整(i/k2) )有Q次询问，每次询问输入pos，请输出a[pos]%mod。输入第一行输入五个整数A，B，k1，k2，mod。第二行输入一个整数Q。接下来Q行每行输入一个整数pos。1<=A<=1001<=B&l...

How manyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4011    Accepted Submission(s): 1821 Problem DescriptionGive you n ( n < 1000...

#iostreamisalpha(ch); 小写字母返回2 大写字母返回1 其他返回0islower() || isupper() 返回 1 / 0tolower 字母转小写, 非字母不操作toupper 转大写#cstringstrncmp(a + i, b + j, n) 字符数组前几位比较#include <iostream>#include &lt...

#iostreamisalpha(ch); 小写字母返回2 大写字母返回1 其他返回0islower() || isupper() 返回 1 / 0tolower 字母转小写, 非字母不操作toupper 转大写#cstringb 复制到 a 后strcat(a, b);从 a 拷贝前len位到 bstrncpy(b, a, len)字符数组比较strncm...

D. Ghoststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGhosts live in harmony and peace, they travel the space without any pur...