QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#418716#6652. 着色LinkWish#WA 13ms3676kbC++14793b2024-05-23 15:20:442024-05-23 15:20:45

Judging History

你现在查看的是最新测评结果

  • [2024-05-23 15:20:45]
  • 评测
  • 测评结果:WA
  • 用时:13ms
  • 内存:3676kb
  • [2024-05-23 15:20:44]
  • 提交

answer

//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si static inline
#define mp make_pair
#define fi first
#define se second
using namespace std;typedef long long ll;typedef __int128 li;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef const int ci;
typedef const ll cl;const int iinf=INT_MAX;const ll linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{
	
	void mian(){
		int n;
		cin>>n;
		for(int i=0;i<n;++i){
			for(int j=i+1;j<n;++j)cout<<9-__builtin_popcount(i^j);
			cout<<"\n";
		}
	}
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3676kb

input:

2

output:

8


result:

ok Accepted.

Test #2:

score: -100
Wrong Answer
time: 13ms
memory: 3616kb

input:

1000

output:

887877687767665877676657665655487767665766565547665655465545443877676657665655476656554655454437665655465545443655454435443433287767665766565547665655465545443766565546554544365545443544343327665655465545443655454435443433265545443544343325443433243323221877676657665655476656554655454437665655465545...

result:

wrong answer Output format error.