
Codeforces
_Shawn_Shawn_
If you shed tears when you miss the sun, you also miss the stars.
展开
-
Codeforces 1023 Bracket Subsequence
重点内容 #include <stdio.h> int main() { long long n, m, left, right; scanf ("%lld %lld",&n,&m); char s[n]; left = 0; right = 0; scanf ("%s", s); for (int ...原创 2018-08-21 11:46:32 · 258 阅读 · 0 评论 -
CodeForces - 978D - Almost Arithmetic Progression
#include<stdio.h> #include<math.h> #include<string.h> #define LL long long LL a[100009], b[100009], n, k, judge, p; //a为改变后的等差数列,b为输入的数组 int main() { while(~scanf("%lld",...原创 2018-09-12 19:57:17 · 310 阅读 · 0 评论 -
Codeforces Function Height
#include<stdio.h> #include<math.h> #include<string.h> #define LL long long LL n, k, t, m; int main() { while(~scanf("%lld %lld", &n, &k)){ t = k / n; ...原创 2018-09-12 21:13:11 · 280 阅读 · 0 评论 -
Codeforces #508 (Div. 2) A Equality
#include<stdio.h> #include<math.h> #include<string.h> #define LL long long LL n, minn, k; int a[27]; char s[100009]; int main() { while(~scanf("%lld %lld %s", &n, &am...原创 2018-09-13 20:23:49 · 225 阅读 · 0 评论 -
Codeforces #512 (Div. 2)A In Search of an Easy P
#include&lt;stdio.h&gt; #include&lt;stdlib.h&gt; #include&lt;math.h&gt; #include&lt;string.h&gt; #define LL long long int main() { int n, t, judge = 0; scanf("%d原创 2018-09-27 20:12:24 · 225 阅读 · 0 评论