EhAb AnD gCd CodeForces

Posted acmloser

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了EhAb AnD gCd CodeForces相关的知识,希望对你有一定的参考价值。

原题链接
考察:思维
思路:
  我是菜狗,连A题都不会.这道题实际就是1和n-1.

Code

#include <iostream> 
using namespace std;
int n;
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		printf("%d %d\\n",1,n-1);
	}
	return 0;
}

以上是关于EhAb AnD gCd CodeForces的主要内容,如果未能解决你的问题,请参考以下文章

Codeforces 862C - Mahmoud and Ehab and the xor

CF1174E Ehab and the Expected GCD Problem(DP,数论)

codeforces 862C. Mahmoud and Ehab and the xor

Codeforces Round #563 (Div. 2)C. Ehab and a Special Coloring Problem

Codeforces Round #525 (Div. 2)A. Ehab and another construction problem

E - Mahmoud and Ehab and the bipartiteness CodeForces - 862B (dfs黑白染色)