XJTU Summer Holiday Test 1(Divisibility by Eight-8的倍数)
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
cid=82382#status//C/0" class="ui-button ui-widget ui-state-default ui-corner-all ui-button-text-only" style="display:inline-block; position:relative; padding:0px; margin-right:0.1em; vertical-align:middle; overflow:visible; text-decoration:none; font-family:Verdana,Arial,sans-serif; font-size:1em; border:1px solid rgb(211,211,211); background-color:rgb(227,228,248); color:rgb(85,85,85)">Status
Description
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove any digit at all) so that the result contains at least one digit, forms a non-negative integer, doesn't have leading zeroes and is divisible by 8.
After the removing, it is forbidden to rearrange the digits.
If a solution exists, you should print it.
Input
The single line of the input contains a non-negative integer n. The representation of number n doesn't contain any leading zeroes
and its length doesn't exceed 100 digits.
Output
Print "NO" (without quotes), if there is no such way to remove some digits from number n.
Otherwise, print "YES" in the first line and the resulting number after removing digits from number n in the second line. The printed number must be divisible
by 8.
If there are multiple possible answers, you may print any of them.
Sample Input
3454
YES
344
10
YES
0
111111
NO
8*125=1000 故一个数是8的倍数当且仅当它末尾3个数是8的倍数
所以答案最多有3位,暴力就可以
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (100000+10)
typedef long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
char s[MAXN];
int main()
{
// freopen("I.in","r",stdin);
// freopen(".out","w",stdout); scanf("%s",s);
char *pch=strstr(s,"AB");
if (pch!=NULL&&strstr(pch+2,"BA")!=NULL)
{
cout<<"YES"<<endl;
return 0;
}
pch=strstr(s,"BA");
if (pch!=NULL&&strstr(pch+2,"AB")!=NULL)
{
cout<<"YES"<<endl;
return 0;
}
cout<<"NO"<<endl; return 0;
}
最新文章
- [笔记]HAproxy reload config file with uninterrupt session
- [数据科学] 从text, json文件中提取数据
- sh 测试网段在线主机
- #ifndef _LED_H #endif啥意思?
- css 中content内容特殊形状
- Windows Azure Storage图形界面管理工具
- ajax 跨域 headers JavaScript ajax 跨域请求 +设置headers 实践
- archlinux安装图形界面
- (C#基础) byte[] 之初始化, 赋值,转换。
- markdown常用html标签
- SCALA表达示简例
- poj1200Crazy Search (哈希)
- 测试Data ORM的性能
- [国嵌攻略][137][DM9000网卡驱动编程]
- 【JavaWeb】JDBC连接MySQL数据库
- 【面试】吃透了这些Redis知识点,面试官一定觉得你很NB(干货 | 建议珍藏)
- 【洛谷P1313 计算系数】
- 14、使用csv和excel存储豆瓣top250电影信息
- ListBox设置背景色无效的问题。 listview类似
- (网页)thinkpad 笔记本开机看看坏了没?