1879

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

struct kuai{ 
	int st, ed, th;
}f, x, ad;
int n, cnt, t[200002];
queue<kuai> q, q2;
bool used[200001]; 
int main(){
	freopen("fruit.in","r",stdin);
	freopen("fruit.out","w",stdout);
	scanf("%d", &n);
	for (int i = 1;i <= n;i ++) scanf("%d", &t[i]);
	t[n + 1] = !t[n];
	for (int i = 2, si = 1;i <= n + 1;i ++){
		if (t[i] != t[i - 1]) q.push((kuai){si, i - 1, t[i - 1]}), si = i; 
	}
	cnt = n;
	while (cnt){
		while (q.size()){
			f = q.front();
			q.pop();
			while (used[f.st] && f.st <= f.ed) f.st ++; 
			if (f.st > f.ed) continue;
			printf("%d ", f.st), cnt --;
			used[f.st] = 1; 
			if (f.ed == f.st) continue; 
			f.st ++;
			q2.push(f); 
		}
		putchar('\n');
		while (q2.size()){
			ad = q2.front();
			q2.pop();
			while (q2.size()){
				x = q2.front();
				if (x.th == ad.th){
					ad.ed = x.ed;
					q2.pop();
				}
				else break;
			}
			q.push(ad); 
		}
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
	
}

119

#include<bits/stdc++.h>
using namespace std;
int main() {
	long long n,x=0;
	cin>>n;
	while(n) {
		x=x+n%10;
		n/=10;
	}
	cout<<x;
	return 0;
}

3006

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

deque<int> d;
int a, b, c;

int x, front;
void input() {
	d.resize(8);
	for (int i = 0; i < 4; ++i) {
		cin >> d[i];
		d[i + 4] = d[i]; 
	}
	cin >> a >> b >> c;
}
void output(int n) {
	cout << "step" << n << ':';
	for (auto i : d) {
		cout << i << ' ';
	}
	cout << endl;
}
void move(int x = 0) {
	front = d.front();
	d.pop_front();
	if (x) {
		d.emplace(d.begin() + d.size() / 2, front); 
	} else {
		d.push_back(front); 
	}
}
void opt() {

	output(1);
	for (int i = 0; i < a; ++i) {
		move(); 
	}
	output(2);
	for (int i = 0; i < 3; ++i) {
		move(1); 
	}
	output(3);
	x = d.front(); 
	d.pop_front(); 
	output(4);
	for (int i = 0; i < b; ++i) {
		move(1);
	}
	output(5);
	if (c == 1) d.pop_front(); 
	else if (c == 2) d.pop_front(), d.pop_front(); 
	output(6);
	for (int i = 0; i < 7; ++i) {
		move();
	}
	output(7);
	while (d.size() > 1) {
		move(); 
		d.pop_front(); 
		output(8);
	}
}
int main() {
	input();
	opt();
	cout << x << ' ' << d[0] << endl;
	return 0;
}

80

#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int a[N];
int main(){
	int l;
	cin>>l;
	int ans=0;
	for(int i=1;i<l;i++){
		for(int j=i;j<l;j++){
			int k=l-i-j;
			if(k>=j){
				if(i+j>k&&i+k>j&&j+k>i){
					ans++;
				}
				if(i==j&&i==k&&j==k){
					ans--;
				}
			}
		}
	}
	cout<<ans;
	return 0;
}

828

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 110, INF = 0x3f3f3f3f;
int t, n = 8, m;
int tt, data[N][10];
int a[N], b[N], c[N], d[N];
// 每行/列一个
void dfs(int x) {
    if (x > n) {
        printf("No.%d\n", ++tt);
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++)
                printf("%d ", a[j] == i ? 1 : 0);
            puts("");
        }
        return;
    }
    for (int y = 1; y <= n; y++) {
        if (!b[y] && !c[x + y] && !d[x - y + 10]) {
            a[x] = y, b[y] = c[x + y] = d[x - y + 10] = 1;
            dfs(x + 1);
            b[y] = c[x + y] = d[x - y + 10] = 0;
        }
    }
}
int main() {
    dfs(1);  // 从第 1行开始放置
    return 0;
}

829

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 110, INF = 0x3f3f3f3f;
int t, n = 8, m;
int tt, data[N][10];
int a[N], b[N], c[N], d[N];
// 每行一个
void dfs(int x) {
    if (x > n) {
        ++tt;
        for (int i = 1; i <= n; i++)
            data[tt][i] = a[i];
        return;
    }
    for (int y = 1; y <= n; y++) {
        if (!b[y] && !c[x + y] && !d[x - y + 10]) {
            a[x] = y, b[y] = c[x + y] = d[x - y + 10] = 1;
            dfs(x + 1);
            b[y] = c[x + y] = d[x - y + 10] = 0;
        }
    }
}
int main() {
    dfs(1);  // 从第 1行开始放置
    cin >> t;
    while (t--) {
        cin >> m;
        for (int i = 1; i <= n; i++)
            cout << data[m][i];
        cout << "\n";
    }
    return 0;
}

83

#include<bits/stdc++.h>
using namespace std;
int main( ) {
	int a=1;
	for(int i=1;i<10;i++){
		a=(a+1)*2;
	}
	cout<<a;
	return 0;
}

素数环2

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=22;
int n,total,a[N],st[N];
bool isp(int n) {
	for(int i=2; i<=n/i; i++) if(n%i==0) return 0;
	return n>1;
}
void dfs(int u) {
	if(total>=10) exit(0);
	if(u>n) {
		if(a[1]!=1)return;
		if(isp(a[1]+a[n])) {
			++total;
			//cout<<++total<<":";
			for(int i=1; i<=n; i++) cout<<a[i]<<" "; cout<<endl; 
		} return;

		
	}
	for(int i=1; i<=n; i++) {
		if(!st[i]&&(u==1||isp(a[u-1]+i))) {
			st[i]=1,a[u]=i,dfs(u+1);
			st[i]=0;
		}
	}
}
int  main() {
	cin>>n;
	if(n%2!=0) return 0;
     dfs(1);
	//cout<<"total:"<<total<<endl;
	return 0;
}

滑雪

#include<bits/stdc++.h>
using namespace std;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
int n,m,a[201][201],s[201][201],ans;
bool use[201][201];
int dfs(int x,int y){
    if(s[x][y])return s[x][y];
    s[x][y]=1;
    for(int i=0;i<4;i++)
    {  int xx=dx[i]+x;
       int yy=dy[i]+y;
       if(xx>0&&yy>0&&xx<=n&&yy<=m&&a[x][y]>a[xx][yy]){
       	  dfs(xx,yy);
          s[x][y]=max(s[x][y],s[xx][yy]+1);
       }
    }
    return s[x][y];
}
int main()
{	
   scanf("%d%d",&n,&m);
   for(int i=1;i<=n;i++)
     for(int j=1;j<=m;j++)
       scanf("%d",&a[i][j]);
    for(int i=1;i<=n;i++)
      for(int j=1;j<=m;j++)
        ans=max(ans,dfs(i,j));
    printf("%d",ans);
    return 0;
}

2010

#include<bits/stdc++.h>
using namespace std;
int main(){
	string n,m;
	cin>>n>>m;
	if(n=="A"){
		if(m=="A"){
			cout<<"A O";
		}else if(m=="B"){
			cout<<"A B AB O";
		}else if(m=="AB"){
			cout<<"A B AB";
		}else if(m=="O"){
			cout<<"A O";
		}
	}else if(n=="B"){
		if(m=="A"){
			cout<<"A B AB O";
		}else if(m=="B"){
			cout<<"B O";
		}else if(m=="AB"){
			cout<<"A B AB";
		}else if(m=="O"){
			cout<<"B O";
		}
	}else if(n=="AB"){
		if(m=="A"){
			cout<<"A B AB";
		}else if(m=="B"){
			cout<<"A B AB";
		}else if(m=="AB"){
			cout<<"A B AB";
		}else if(m=="O"){
			cout<<"A B";
		}
	}else if(n=="O"){
		if(m=="A"){
			cout<<"A O";
		}else if(m=="B"){
			cout<<"B O";
		}else if(m=="AB"){
			cout<<"A B";
		}else if(m=="O"){
			cout<<"O";
		}
	}
	return 0;
}

70

#include<bits/stdc++.h>
using namespace std;
int main() {
	int a,n=3,c=0;
	cin>>a;
	for(int i=1; i<=a; i++) {
		n+=2;
		c++;
	}
	c-=1;
	int d=3,b=c;
	for(int i=a; i>=1; i--) {
		while(c>0) {
			cout<<" ";
			c--;
		}
		b--;
		c=b;
		for(int x=1; x<=d; x++) {
			cout<<"*";
		}
		d+=2;
		cout<<endl;
	}
	return 0;
}

71

#include<bits/stdc++.h>
using namespace std;
int main() {
	int a,n=1,c=0;
	cin>>a;
	for(int i=1; i<a; i++) {
		n+=2;
	}
	c=1;
	c--;
	int d=n,b=c;
	for(int i=a; i>=1; i--) {
		while(c>0) {
			cout<<" ";
			c--;
		}
		b++;
		c=b;
		for(int x=1; x<=d; x++) {
			cout<<"*";
		}
		d-=2;
		cout<<endl;
	}
	return 0;
}

72

#include<bits/stdc++.h>
using namespace std;
int main() {
	int a,n=1,c=0;
	cin>>a;
	a++;
	for(int i=1; i<a; i++) {
		n+=2;
	}
	c=1;
	c--;
	int d=n,b=c;
	for(int j=1;j<=a-1;j++){
	for(int i=1;i<=a-j;i++){
		cout<<" ";
	}
	for(int k=1;k<=2*j-1;k++){	
		cout<<"*";
	}
	cout<<endl;
}
	for(int i=a; i>=1; i--) {
		while(c>0) {
			cout<<" ";
			c--;
		}
		b++;
		c=b;
		for(int x=1; x<=d; x++) {
			cout<<"*";
		}
		d-=2;
		cout<<endl;
	}
	return 0;
}

73

#include<iostream>
using namespace std;
int main( ) {
int n,x=1;
cin>>n;
for(int j=1;j<=n;j++){
	for(int i=1;i<=n-j;i++){
		cout<<" ";
	}
	for(int k=1;k<=2*j-1;k++){	
		cout<<x;
		x++;
	}
	cout<<endl;
	x=1;
}
	return 0;
}

2892

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+100000;
bool cmp(int a,int b){return a>b;}
int n,m,k;
int a[N],b[N];
int ans,kk;
signed main() 
{
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++) cin>>a[i],ans+=a[i];
	for(int i=1;i<=m;i++) cin>>b[i],ans+=b[i];
	sort(a+1,a+n+1,cmp);
	int minn=min(n,m);
	for(int i=1;i<=minn;i++) if(a[i]>k) ans+=a[i],kk++;
	ans+=k*(minn-kk);
    return cout<<ans,0;
}

#define ll long long

https://www.cnblogs.com/zouwangblog/articles/11346906.html

https://zouwang.vip/

独步天下，吾心自洁，无欲无求，如林中之象。

个人博客园笔记：

1.第一阶段：语言基础与程序思维

2.第二阶段：语言高级与数学思维

3.第二阶段后知识巩固练题

4.第三阶段：数据结构与算法入门

5.穿插训练：数学