m0_46485428的博客

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

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

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