1908小丁的试验

最新推荐文章于 2022-12-27 11:59:09 发布

abao_

最新推荐文章于 2022-12-27 11:59:09 发布

阅读量345

点赞数

文章标签： output input

本文链接：https://blog.csdn.net/abao_/article/details/2488621

版权

小丁的试验

Time Limit: 1 Seconds Memory Limit: 32768 K

Total Submit:179 Accepted:51

Description

Description

In summer holiday of Grade 1,honghu was trainning at ZOJ too. There was one problem let him remember time and time again. Now it comes :)

小丁的老师给他布置了一个试验,有n个灯,编号为1,2,....n,对这n个灯做n次变化,第i(1<=i<=N)次使编号是i倍数的灯的状态发生改变(即从暗到亮或者从亮到暗),要求记录下最后灯的状态是暗的个数t.已知每一个灯初试状态都是暗的.由于小丁比较粗心,所以要求你对他给出的n和t做出判断,看是否正确.

Input

一个正整数T,表示数据的组数,接下去的T行,每一行有两个整数,表示n和t,其中2<=n<=500000,0<=t<=100000

Output

如果正确,输出YES,否则输出NO

Sample Input

2
4 2
10 6

Sample Output

YES
NO

#include<iostream.h>
int find(int n)
{	int i,j,k,t;
   i=3;j=5;k=1;
   while(i<n)
	   {
		   i=i+j;
		   j=j+2;
		   k++;
	   }
	   return n-k;
}

int main()
{
  int n,s,m;
  cin>>m;
  while(m--)
  {
    cin>>n>>s;
  
  if(s==find(n))
	  cout<<"YES"<<endl;
  else
	  cout<<"NO"<<endl;
  }
	return 0;
}