第一题

#include<bits/stdc++.h>
using namespace std;
int main(){
    int a,b,c,d,f,g;
    cin>>a>>b>>c>>d>>f>>g;
    cout<<a<<" "<<b<<" "<<(g-b);
    
    
}

第二题

#include<bits/stdc++.h>
using namespace std;
int main(){
    double k,n=0,i=1;
    cin>>k;
    while(n<=k){
        n+=(1/i);
        i++;
    }
    cout<<i-1;
    
}

第三题

#include<bits/stdc++.h>
using namespace std;
int main(){
	int s=0;
    char c;
	while(cin>>c)s+=c-'0';
	cout<<s;
	return 0;
}

第四题

#include<bits/stdc++.h>
using namespace std;
bool is_palindrome(string s) {
    int left = 0, right = s.size()-1;
    while(left < right) {
        if(s[left] != s[right]) {
            return false;
        }
        left++; right--;
    }
    return true;
}
int main(){
    int n;
    cin >> n;
    string k = "";
    while(n--){
        string m;
        cin >> m;
        if(q(m)){
            if(k == "" || m.size() > k.size() || (m.size() == k.size() && m > k)){
                k = m;
            }
        }
    }
    cout << k << endl;
    return 0;
}

第五题

#include <bits/stdc++.h>
#define DEBUG(var) cout << "[DEBUG]" << #var << " = " << var << endl
using namespace std;

int main() {
  int n;
  scanf("%d", &n);
  if (n % 2 == 1) {
    printf("-1\n");
    return 0;
  }
  int time = 30;
  while (n > 0 && time >= 0) {
    int t = 1 << time;
    if (n >= t) {
      printf("%d ", t);
      n -= t;
    }
    time--;
  }

  return 0;
}

第六题

#include <bits/stdc++.h>	
using namespace std;
int n,m,c,s;
int main()
{
    cin>>n;
    c=m=1;
    for(int i=1;i<=n;i++)
    {
        s+=c;
        m--;
        if(m==0)
        {
            c++;
            m=c;
        }
    }
    cout<<s;	
    return 0;	
}

第七题

#include<bits/stdc++.h>
using namespace std;

int L,R,x,ans;           
int main(){
    scanf("%d%d",&L,&R);
    for(int i=L;i<=R;i++){
        x=i;
        while(x>0){
            if(x%10==2)ans++;
            x/=10;
        }
    }
    cout<<ans;
    return 0;
}

第八题

#include <bits/stdc++.h>
#define DEBUG(var) cout << "[DEBUG]" << #var << " = " << var << endl
using namespace std;

struct Node {
  int bd;
  int zd;
} dp[1000007];
int arr[1000007];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
  }
  for (int i = 1; i <= n; i++) {
    if (i == 1) {
      dp[i].bd = 0;
      dp[i].zd = arr[i];
    } else {
      dp[i].bd = min(dp[i - 1].zd, dp[i - 2].zd);
      dp[i].zd = min(dp[i - 1].bd, dp[i - 1].zd) + arr[i];
    }
  }
  cout << min(dp[n].bd, dp[n].zd) << endl;

  return 0;
}