Codeforces Round 1030 (Div. 2)

Problem - A - Codeforces

构造题，构造下面的万能序列：
1（填0）(填1)0

来看代码：
 

#include <bits/stdc++.h>
using namespace std;int main()
{int t;cin>>t;while(t--){int n,k;cin>>n>>k;vector<int>arr(n);if(k==0){for(int i = 0;i<n;i++){cout<<0;}cout<<"\n";continue;}if(k==1){cout<<1;for(int i = 1;i<n;i++){cout<<0;}cout<<"\n";continue;}if(k==n){for(int i = 0;i<n;i++){cout<<1;}cout<<"\n";continue;}//正式开始arr[0] = 1;for(int i = 1;i<k;i++){arr[n-i-1] = 1;}for(int i = 0;i<n;i++){cout<<arr[i];}cout<<"\n";} 
}

Problem - B - Codeforces

解决方法：

来看代码：

#include <bits/stdc++.h>
using namespace std;int main()
{int t;cin>>t;while(t--){int n;cin>>n;cout<<2*n-1<<"\n";cout<<1<<" "<<1<<" "<<n<<"\n";for(int i = 2;i<=n;i++){cout<<i<<" "<<1<<" "<<i-1<<"\n";cout<<i<<" "<<i<<" "<<n<<"\n";} } 
}