**1051 - My-graph-同构图_mql1051.pdf-优快云博客

本文探讨了图论中My-graph的概念及其构造方法。My-graph是一种特殊类型的图，其逆图与其自身同构。文章提出了一种判断是否能构造具有n个节点的My-graph的方法，并给出了具体的实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1051 - My-graph

Time Limit：1s Memory Limit：64MByte

Submissions：351Solved：171

DESCRIPTION

In graph theory, the inverse of a graph $G$ is a graph $H$ on the same vertices such that two distinct vertices of $H$ are adjacent if and only if they are not adjacent in $G$ .
My-graph is the graph that it's inverse graph is an isomorphism graph of itself.

(This is a example of My-graph has 5 nodes).
Now comes the problem: Do you have a way to make a My-graph that has $n$ nodes?

INPUT

There are multiple test cases.The first line is a number T (

T \leq 100

), which means the number of cases.For each case, one integer

n (2 \leq n \leq 10^{4})

means the nodes you have initially.

OUTPUT

If you have at least one way to make it , please output "yes".If there is no way, output "no".

SAMPLE INPUT

2
2
5

SAMPLE OUTPUT

no
yes
code：
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int t,n,m,i,j;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		m=n*(n-1)/2;
		if(m%2==1)
		printf("no\n");
		else
		printf("yes\n");
	}
	return 0;
}