校个人赛——02

原创 2016年05月31日 21:23:34

A - Infinite Sequence
Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

Vasya likes everything infinite. Now he is studying the properties of a sequence s, such that its first element is equal to a (s1 = a), and the difference between any two neighbouring elements is equal to c (si - si - 1 = c). In particular, Vasya wonders if his favourite integerb appears in this sequence, that is, there exists a positive integer i, such that si = b. Of course, you are the person he asks for a help.

Input

The first line of the input contain three integers ab and c ( - 109 ≤ a, b, c ≤ 109) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively.

Output

If b appears in the sequence s print "YES" (without quotes), otherwise print "NO" (without quotes).

Sample Input

Input
1 7 3
Output
YES
Input
10 10 0
Output
YES
Input
1 -4 5
Output
NO
Input
0 60 50
Output
NO


分类讨论

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<cmath> 
#include<algorithm>  
#define INF (1ll<<60)-1
using namespace std;
int my_max(int x,int y)  {return x>y?x:y;}
int my_min(int x,int y)  {return x>y?y:x;} 

int main()
{	
	long a,b,c,d,e;
	while(scanf("%ld %ld %ld",&a,&b,&c)!=EOF)
	{
		if(b>a) 
		{
			if(c<=0)   
			{
				printf("NO\n");
			}   
			else
			{
				e=(b-a)%c;
				if(e==0)  printf("YES\n");
				else      printf("NO\n"); 
			}
		}
		else  if(b<a)
		{
			if(c>=0)   
			{
				printf("NO\n");
			}   
			else
			{
				e=(b-a)%(-1*c);
				if(e==0)  		printf("YES\n");
				else           	printf("NO\n"); 
			}
			
		}
		else
		{
			printf("YES\n");
		}
	} 
	return 0; 
} 


注意事项:除数不能为0


B - Restoring Painting
Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was stolen while he was on duty. He doesn't want to be fired, so he has to quickly restore the painting. He remembers some facts about it.

  • The painting is a square 3 × 3, each cell contains a single integer from 1 to n, and different cells may contain either different or equal integers.
  • The sum of integers in each of four squares 2 × 2 is equal to the sum of integers in the top left square 2 × 2.
  • Four elements abc and d are known and are located as shown on the picture below.

Help Vasya find out the number of distinct squares the satisfy all the conditions above. Note, that this number may be equal to 0, meaning Vasya remembers something wrong.

Two squares are considered to be different, if there exists a cell that contains two different integers in different squares.

Input

The first line of the input contains five integers nabc and d (1 ≤ n ≤ 100 0001 ≤ a, b, c, d ≤ n) — maximum possible value of an integer in the cell and four integers that Vasya remembers.

Output

Print one integer — the number of distinct valid squares.

Sample Input

Input
2 1 1 1 2
Output
2
Input
3 3 1 2 3
Output
6


#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<cmath> 
#include<algorithm>  
#define INF (1ll<<60)-1
using namespace std;
int my_max(int x,int y)  {return x>y?x:y;}
int my_min(int x,int y)  {return x>y?y:x;} 

int main()
{	
	int n,a,b,c,d,j,count;
	while(scanf("%d %d %d %d %d",&n,&a,&b,&c,&d)!=EOF)
	{
		count=0;
			for(j=1;j<=n;j++)
			{
				sum=a+b+j;
				if(sum-a-c>n||sum-a-c<=0)  continue;
				if(sum-d-c>n||sum-d-c<=0)  continue;
				if(sum-b-d>n||sum-b-d<=0)  continue;
				count++ ;
			} 
		printf("%I64d\n",(long long)count*(long long)n);
	}
	return 0; 
} 

简单的数学小题:

注意其输出形式!!!

为long long 形式,而不是int 


版权声明:本文为博主原创文章,未经博主允许不得转载。

思维的体操——李白喝酒(2014年春蓝桥杯个人赛)

上周六去参加蓝桥杯,第一次参加比赛还真是有点小激动和小紧张,不过还好啦,虽然估计自己成绩可能不理想,但既然花了四个小时,就不能让自己毫无收获,心态上我更放得开了,我最擅长的是C,结果鬼使神差的报了ja...

省赛选拔赛——个人赛第二场

Rank 5,AC5道,全部1Y。 开场读错了A题,打了就交,直接WA。后来一路跟题,出了几个水题。刷完水题之后,卡在一道BFS上,浪费了不少时间,导致两道简单DP出得特别晚。后来卡D题的BFS,没有...
  • wcr1996
  • wcr1996
  • 2015年04月06日 23:21
  • 1180

省赛选拔赛——个人赛第三场

Rank 11。 打得不理想,开场23分钟跟了学长1Y了H题之后,再没出题。赛后补了两道能力之内的题。...
  • wcr1996
  • wcr1996
  • 2015年04月08日 19:50
  • 1149

省赛选拔赛——个人赛第一场

Rank 6,一共AC了6题,其中5道1Y。 感觉这场比赛打得还可以,能出的题都出了,就是一开始选题出现了问题,先去做了DP,导致很多水题出的晚了,时间上占了劣势,好在前5道题AC的题都是1Y,没有很...
  • wcr1996
  • wcr1996
  • 2015年04月06日 23:08
  • 1213

校招算法工程师常见面试题及答案总结02——SVM

SVM是很常考的一个机器学习基本算法,除了要知道其理论、优缺点、适用范围等,还要掌握其推导。本篇博客对SVM做概述,并分别介绍线性可分SVM、线性SVM、非线性SVM、SMO。...

基于S3C2440的嵌入式Linux驱动——AT24C02(EEPROM I2C接口)驱动解读

本文将介绍Linux中AT24C02驱动。AT24C02是一种EEPROM,使用I2C接口来访问。 在开发板中,使用I2C控制器0和AT24C02连接,这里就不给出原理图了,如需要,可以搜索TQ244...
  • yj4231
  • yj4231
  • 2014年01月12日 16:23
  • 8818
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:校个人赛——02
举报原因:
原因补充:

(最多只允许输入30个字)