【杂题】 HDOJ 4959 Poor Akagi
来源:互联网 发布:网络公司简介模板图片 编辑:程序博客网 时间:2024/05/16 13:55
就是个暴力啊。。。比赛的时候逗比了,没写出来T.T
#include <iostream> #include <queue> #include <stack> #include <map> #include <set> #include <bitset> #include <cstdio> #include <algorithm> #include <cstring> #include <climits> #include <cstdlib>#include <cmath>#include <time.h>#define maxn 8005#define maxm 8005#define eps 1e-10#define mod 998244353#define INF 999999999#define lowbit(x) (x&(-x))#define mp mark_pair#define ls o<<1#define rs o<<1 | 1#define lson o<<1, L, mid #define rson o<<1 | 1, mid+1, R typedef long long LL;//typedef int LL;using namespace std;LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}// headbool check(LL x){LL a[2], now;a[0] = a[1] = 0;now = 0;while(x) {a[now] += x%10;x /= 10;now ^= 1;}if(a[0] - a[1] == 3) return true;else return false;}int main(void){LL _, a, b, ok, i;while(scanf("%I64d", &_)!=EOF) {while(_--) {scanf("%I64d%I64d", &a, &b);ok = 0;for(i = a; i <= b; i++)if(i % 11 == 3 && !check(i)) {ok = 1;break;}if(ok) printf("%I64d\n", i);else printf("-1\n");}}return 0;}
0 0
- 【杂题】 HDOJ 4959 Poor Akagi
- HDU 4959 / BC 5D Poor Akagi
- [hdu 4959]Poor Akagi 数论(卢卡斯数,二次域运算,等比数列求和)
- HDOJ 4957 Poor Mitsui(小数高精度)
- poor
- share poor
- Poor China
- How the Poor Die
- API GetCurrentTime Poor felld1
- 穷忙族working poor
- 1022 Poor contestant Prob
- my ability is poor!
- Rich and Poor
- Poor Guy Has Came
- Chromebook for Poor Devs
- HDU-4957-Poor Mitsui
- HDU 4956 Poor Hanamichi
- hdu4956 Poor Hanamichi
- HDU-4957-Poor Mitsui
- 直接拿来用!最火的Android开源项目整理
- sqlcipher加密数据库
- hdu 4956 Poor Hanamichi BestCoder Round #5(数学题)
- LUA闭包
- 【杂题】 HDOJ 4959 Poor Akagi
- 反向索引
- 端口及端口映射
- 一个高性能RPC框架原理剖析
- 直接拿来用!最火的Android开源项目(一)
- TCP连接——三次握手和四次分手
- 人生就是一场马拉松
- 对 Data Race Free 的理解
- SQL Server 2014索引