![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codeforces
编程小鱼
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #659 (Div. 2)(第1,2,4题)
B题#include <iostream>#include <cstdio>#include <cstring>using namespace std;int len[105];int p[210];int dp[105][40005];int main(){ int t; scanf("%d",&t); while(t--){ int n,k,l; memset(dp,0,sizeof(dp)); scanf("%d%d%d原创 2020-07-29 22:50:13 · 187 阅读 · 0 评论 -
Codeforces Round #644 (Div. 3)刷题小记
A题A题A题D题#include <iostream>#include <cstdio>#include <cmath>using namespace std;//找最大的约数 int main(){ int t; scanf("%d",&t); while(t--){ int a,b; scanf("%d%d",&a,&b); if(a<=b){ printf("1\n"); continue原创 2020-06-07 11:29:43 · 135 阅读 · 1 评论 -
Codeforces Round #642 (Div. 3)(F题待补充)
BIT-REVERSED-INCREMENT (A) i = A.length A[i] = A[i] + 1 if(A[i] == 1) return i = i - 1 while i ≥ 0 and A[i] == 1 do A[i] = 0 i = i – 1 if i ≥ 0 A[i] = 1原创 2020-05-30 21:48:32 · 199 阅读 · 0 评论