Skip to main content
  1. Posts/

seerc 2014 D - Frame (傻逼题)

·1 min
Note: This article is available in Chinese only. 本文暂无英文版本。 View original

题目链接

思路:注意xy-(x-2)*(y-2)=2x+2y-4,一定被2整除。因此siz为2的也是合法的。这个比较容易忘掉。

其他的判定条件都很好想。具体见代码;

 1#include <cstdio>
 2#include <cstring>
 3#include <iostream>
 4#include <algorithm>
 5#include <vector>
 6#include <queue>
 7#include <set>
 8#include <map>
 9#include <string>
10#include <cmath>
11#include <cstdlib>
12#include <ctime>
13#define fst first
14#define sec second
15#define lson l,m,rt<<1
16#define rson m+1,r,rt<<1|1
17#define ms(a,x) memset(a,x,sizeof(a))
18typedef long long LL;
19#define pi pair < int ,int >
20#define MP make_pair
21using namespace std;
22const double eps = 1E-8;
23const int dx4[4]={1,0,0,-1};
24const int dy4[4]={0,-1,1,0};
25const int inf = 0x3f3f3f3f;
26int X,Y;
27bool ok( int a)
28{
29    if (a==2) return true;
30    if (X%a==0&&(Y-2)%a==0) return true;
31    if (Y%a==0&&(X-2)%a==0) return true;
32    if (X%a==1&&Y%a==1) return true;
33
34    return false;
35}
36int main()
37{
38 // freopen("in.txt","r",stdin);
39
40  while (~scanf("%d%d",&X,&Y))
41  {
42      int n;
43      scanf("%d",&n);
44      while (n--)
45      {
46          int x;
47          scanf("%d",&x);
48         // cout<<"x:"<<x<<endl;
49          if (ok(x)) puts("YES");
50          else puts("NO");
51      }
52  }
53return 0;
54}

Related

uva 152 Tree's a Crowd

·2 mins
题意:题意:给你一组三维空间中的点,每个点到其它点都有个距离,其中有个最小距离,如果这个最小距离小于10,就将对应的距离的点个数加1,最后输出距离为0,1,2…8,9的点的个数。(from 百度) 老实说,上面这题意也讲的不明不白,其实这题非常水,就是对每个点进行判断,找出和其他点最短的距离,在下标为该距离的数组上+1,最后输出数组下标0-9的数。 trick:其实最小距离大于9的就不用存放了,只要开个大小10的数组。(不会概括。。。抄的别人的)

codeforces #322 div 2 A. Vasya the Hipster(纱布题)

·1 min
A. Vasya the Hipster time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output One day Vasya the Hipster decided to count how many socks he had. It turned out that he had a red socks and b blue socks.

uva 489

·2 mins
In ``Hangman Judge,’’ you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are the same as the classic game of hangman, and are given as follows:

seerc 2014 A Banks (暴力)

·1 min
题目链接 题意:n个数围成一圈,对于负数可以进行magic操作,也就是取反,但是会影响到左右相邻的,加上这个负数。问最少进行多少次magic操作,使得所有数都是非负。