猫史档案馆

用户:

程序员李某_com查看:2 回复:2 评论:2 创建时间:2021-04-23T22:26:01

因为1003肝了很久还是出bug，所以不公布

1000：

#include <iostream>

using namespace std;

int main()	
{
    int a,b;
	cin >> a >> b ;
	cout << a+b ;


	
	return 0;
}

1001：

#include <iostream>

using namespace std;

int main()
{
	cout <<"Hello,World!"<<endl;
	
	return 0;
 }

1002：

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

1004：

#include <bits/stdc++.h>
using namespace std;
int main(){
	char n;
	cin>>n;
	cout<<"  "<<n<<endl;
	cout<<" "<<n<<n<<n<<endl;
	cout<<n<<n<<n<<n<<n<<endl;
	
}

1005：

#include<bits/stdc++.h>
using namespace std;
int main(){
	int x,a,y,b;
	cin>>x>>a>>y>>b;
	
	double s =  (y*b-x*a)/(b-a);
	printf("%.2lf",s);
	return 0;
}

1006：

#include <iostream>
 
using namespace std;

int main()
{
	int a,b;
	cin >> a >> b;
    cout<< a+b;
	
	return 0;
	}

到时候我还会公布更多代码，敬请期待！

Alcala

好的，我也发一些

P1379

#include <cstdio>
#include <queue>
#include <set>
using namespace std;
struct node{
	int a[10], s;
}now; 
queue<node> Q; 
set<int> S; 
int aim[10] = {0, 1, 2, 3, 8, 0, 4, 7, 6, 5}; 
int main(){
	int i;
	for(i = 1;i <= 9;i++) now.a[i] = getchar() - '0'; 
	now.s = 0;
	Q.push(now); 
	while (!Q.empty()){
		for(i = 1;i <= 9;i++) now.a[i] = Q.front().a[i];
		now.s = Q.front().s;
		Q.pop(); 
		bool flag = true;
		for(i = 1;i <= 9;i++) if(now.a[i] != aim[i]) flag = false;
		if (flag){
			printf("%d",now.s);
			return 0;
		} 
		int id = 0;
		for(i = 1;i <= 9;i++) id = id * 10 + now.a[i];
		if(!S.empty() && S.count(id)) continue;
		else S.insert(id); 
		for(i = 1;i <= 9;i++) if (!now.a[i]) break;
		int ni = i;
		now.s++;
		if ((ni - 1) / 3 != 0){
			swap(now.a[ni],now.a[ni - 3]);
			Q.push(now);
			swap(now.a[ni],now.a[ni - 3]);
		}
		if ((ni - 1) / 3 != 2){
			swap(now.a[ni],now.a[ni + 3]);
			Q.push(now);
			swap(now.a[ni],now.a[ni + 3]);
		}
		if (ni % 3 != 1){
			swap(now.a[ni],now.a[ni - 1]);
			Q.push(now);
			swap(now.a[ni],now.a[ni - 1]);
		}
		if (ni % 3 != 0){
			swap(now.a[ni],now.a[ni + 1]);
			Q.push(now);
			swap(now.a[ni],now.a[ni + 1]);
		}
	}
	printf("-1"); 
	return 0;
}

P1182

#include<bits/stdc++.h>
using namespace std;
int n,m,a[100005],l,r,mid,ans;
inline bool check(int x){
    int tot = 0,num = 0;
    for(int i=1;i<=n;i++){
        if(tot + a[i] <= x)tot += a[i];
        else tot = a[i],num++;
    }
    return num >= m;
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= n;i++){
        scanf("%d",&a[i]);
        l = max(l,a[i]);
        r += a[i];
    }
    while(l <= r){
        mid = l + r >> 1;
        if(check(mid))l = mid+1;
        else r = mid - 1;
    }
    cout<<l<<endl;
    return 0;
}

P3397

#include<bits/stdc++.h>
using namespace std;
long long d[1010][1010],n,m;
int read(){
	int x = 0,w = 0;
	char ch = 0;
	while(!isdigit(ch)){
		w |= ch == '-';
		ch = getchar();
	}
	while(isdigit(ch)){
		x = (x << 3) + (x << 1) + (ch ^ 48);
		ch = getchar();
	}
	return w ? - x : x;
}
void write(int x){
	if(x < 0){
		putchar('-');
		x = -x;
	}
	if(x > 9) write(x/10);
	putchar(x % 10 + '0');
	return;
}
int main(){
	n = read();
	m = read();
	for(int i = 1;i <= m;i++){
		int x1 = read(),y1 = read(),x2 = read(),y2 = read();
		for(int x = x1;x <= x2;x++){
			for(int y = y1;y <= y2;y++){
				d[x][y]++;
			}
		}
	}
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= n;j++){
			write(d[i][j]);
			putchar(' '); 
		}
		putchar('\n');
	}
	return 0;
}

P1219

#include <bits/stdc++.h>
using namespace std;
bool flag[14];
int ans,n,a[14];
void dfs(int x){
	if(x > n){
		ans++;
		if(ans <= 3){
			for(int i = 1;i <= n;i++){
				cout<<a[i]<<" ";
			}
			cout<<endl;
		}
	}
	for(int i = 1;i <= n;i++){
		if(!flag[i]){
			bool djt = 0;
			for(int j = 1;j < x;j++){
				if(abs(a[j] - i) == abs(x - j)){
					djt = 1;
				}
			}
			if(djt) continue;
			flag[i] = 1;
			a[x] = i;
			dfs(x + 1);
			flag[i] = 0;
		}
	}
}
int main(){
	cin>>n;
	dfs(1);
	cout<<ans<<endl;
	return 0;
}

P6207

#include<bits/stdc++.h>

using namespace std;

int r,c,ax[13000],ay[13000],next1[4][2]={{0,1},{1,0},{0,-1},{-1,0}},book[130][90];
char farm[130][90];
bool f = false;
void dfs(int x,int y,int step){
    if(f) return;
	if(x < 1 || x > r || y < 1 || y > c) return;
	if(book[x][y]) return;
	if(farm[x][y] == '*') return;
	if(x == r && y == c){
		for(int i = 1;i < step;i++) printf("%d %d\n",ax[i],ay[i]);
		printf("%d %d",r,c);
		f = true;
		return;
	}
	ax[step] = x;ay[step] = y;
	book[x][y] = 1;
	for(int i =0;i<4;i++){
		dfs(x + next1[i][0],y + next1[i][1],step + 1);
	} 
	return;
}
int main()
{
	scanf("%d %d",&r,&c);
	for(int i = 1;i <= r;i++)
		for(int j = 1;j <= c;j++) cin>>farm[i][j];
	dfs(1,1,1);
	return 0;
}

P3131

#include<bits/stdc++.h>
using namespace std;
long long n,a,s,l[] = {0,-1,-1,-1,-1,-1,-1},r[7],maxa;
int main(){
	cin>>n;
	for(int i = 1;i <= n;i++){
		cin>>a;
		a %= 7;
		s += a;
		s %= 7;
		if(l[s] < 0) l[s] = i;
		r[s] = i;
	}
	for(int i = 0;i < 7;i++){
		maxa = max(maxa,r[i] - l[i]);
	}
	cout<<maxa<<endl;
	return 0;
}

一些水题

猫史档案馆

【c++一本通代码公布】1000-1006

回复