SPJ
  • 板块P1329 数列
  • 楼主xiaolilsq
  • 当前回复10
  • 已保存回复10
  • 发布时间2020/5/17 22:29
  • 上次更新2023/11/7 02:14:42
查看原帖
SPJ
230249
xiaolilsq楼主2020/5/17 22:29

rt。

spj如下:

#include "testlib.h"
using namespace std;
int a[100][100];
int main(int argc,char** argv){
	registerTestlibCmd(argc,argv);
	int n=inf.readInt(),S=inf.readInt();
	int ta=ans.readInt(),tb=ouf.readInt();
	if(ta!=ta){
		quitf(_wa,"Your answer is wrong, read %d, expect %d.",tb,ta);
		return 0;
	}
	if(ta>100)ta=100;
	for(int i=0;i<ta;++i){
		int sm=0;
		for(int j=0;j<n;++j){
			a[i][j]=ouf.readInt();
			sm+=a[i][j];
		}
		if(sm!=S){
			quitf(_wa,"Your plan is wrong.");
			return 0;
		}
	}
	for(int i=0;i<ta;++i){
		for(int j=i+1;j<ta;++j){
			int k;
			for(k=0;k<n;++k){
				if(a[i][k]!=a[j][k]){
					break;
				}
			}
			if(k==n){
				quitf(_wa,"Your plan isn't unique.");
				return 0;
			}
		}
	}
	quitf(_ok,"Your answer is correct.");
	return 0;
}

@chen_zhe

2020/5/17 22:29
加载中...