Kirill And The Game CodeForces - 842A

CodeForces - 842A

需要将除法改换成乘法进行计算

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 
 4 int main() {
 5     long long l,r,x,y;
 6     long long  k;
 7     while(~scanf("%lld %lld %lld %lld %lld",&l,&r,&x,&y,&k)) {
 8         
 9         int flag = 0;
10         for(int i = x;  i <= y; i++) {
11             if(  l <= i*k && i*k <= r ) {
12                 flag = 1;
13                 break;
14             }
15         }
16         if(flag) 
17             cout<<"YES"<<endl;
18         else 
19             cout<<"NO"<<endl;
20     }
21     return 0;
22 }

在写这种题目的时候

    1.使用 long long

     2.把除法改换成乘法

转载于:https://www.cnblogs.com/jj81/p/8964521.html

用C语言解决下列问题:Kirill wants to weave the very beautiful blanket consisting of n×m of the same size square patches of some colors. He matched some non-negative integer to each color. Thus, in our problem, the blanket can be considered a B matrix of size n×m consisting of non-negative integers. Kirill considers that the blanket is very beautiful, if for each submatrix A of size 4×4 of the matrix B is true: A11⊕A12⊕A21⊕A22=A33⊕A34⊕A43⊕A44, A13⊕A14⊕A23⊕A24=A31⊕A32⊕A41⊕A42, where ⊕ means bitwise exclusive OR Kirill asks you to help her weave a very beautiful blanket, and as colorful as possible! He gives you two integers n and m . Your task is to generate a matrix B of size n×m , which corresponds to a very beautiful blanket and in which the number of different numbers maximized. Input The first line of input data contains one integer number t (1≤t≤1000 ) — the number of test cases. The single line of each test case contains two integers n and m (4≤n,m≤200) — the size of matrix B . It is guaranteed that the sum of n⋅m does not exceed 2⋅105 . Output For each test case, in first line output one integer cnt (1≤cnt≤n⋅m) — the maximum number of different numbers in the matrix. Then output the matrix B (0≤Bij<263) of size n×m . If there are several correct matrices, it is allowed to output any one. It can be shown that if there exists a matrix with an optimal number of distinct numbers, then there exists among suitable matrices such a B that (0≤Bij<263) .
03-10
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值