hdu 2101 A B Problem Too 数论,如何巧妙解决?

2026-04-19 23:411阅读0评论SEO问题
  • 内容介绍
  • 文章标签
  • 相关推荐

本文共计372个文字,预计阅读时间需要2分钟。

hdu 2101 A B Problem Too 数论,如何巧妙解决?

markdownA+B问题有如下限制:- 时间限制:3000/1000 MS (Java/其他)- 内存限制:32768/32768 K (Java/其他)- 总提交次数:8373- 接受提交次数:6277- 题目描述:这是一个A+B问题,但稍有不同...

A + B Problem Too

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8373 Accepted Submission(s): 6277

Problem Description

This problem is also a A + B problem,but it has a little difference,you should determine does (a+b) could be divided with 86.For example ,if (A+B)=98,you should output no for result.

Input

Each line will contain two integers A and B. Process to end of file.

Output

For each case, if(A+B)%86=0,output yes in one line,else output no in one line.

Sample Input

1 18600 8600

hdu 2101 A B Problem Too 数论,如何巧妙解决?

Sample Output

noyes

Source

​​HDU 2007-6 Programming Contest​​

Recommend

xhd

思路:(10*a+b)%c=((a%c)*10+b)%c;

#include<iostream>using namespace std;const int mm=100010;char s[mm],ss[mm];int main(){ int ans,anss; while(cin>>s>>ss) { ans=anss=0; for(int i=0;s[i]!='\0';i++) { ans=(ans*10+s[i]-'0')%86; } for(int i=0;ss[i]!='\0';i++) anss=(anss*10+ss[i]-'0')%86; ans=(ans+anss)%86; if(ans)cout<<"no\n"; else cout<<"yes\n"; }}

本文共计372个文字,预计阅读时间需要2分钟。

hdu 2101 A B Problem Too 数论,如何巧妙解决?

markdownA+B问题有如下限制:- 时间限制:3000/1000 MS (Java/其他)- 内存限制:32768/32768 K (Java/其他)- 总提交次数:8373- 接受提交次数:6277- 题目描述:这是一个A+B问题,但稍有不同...

A + B Problem Too

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8373 Accepted Submission(s): 6277

Problem Description

This problem is also a A + B problem,but it has a little difference,you should determine does (a+b) could be divided with 86.For example ,if (A+B)=98,you should output no for result.

Input

Each line will contain two integers A and B. Process to end of file.

Output

For each case, if(A+B)%86=0,output yes in one line,else output no in one line.

Sample Input

1 18600 8600

hdu 2101 A B Problem Too 数论,如何巧妙解决?

Sample Output

noyes

Source

​​HDU 2007-6 Programming Contest​​

Recommend

xhd

思路:(10*a+b)%c=((a%c)*10+b)%c;

#include<iostream>using namespace std;const int mm=100010;char s[mm],ss[mm];int main(){ int ans,anss; while(cin>>s>>ss) { ans=anss=0; for(int i=0;s[i]!='\0';i++) { ans=(ans*10+s[i]-'0')%86; } for(int i=0;ss[i]!='\0';i++) anss=(anss*10+ss[i]-'0')%86; ans=(ans+anss)%86; if(ans)cout<<"no\n"; else cout<<"yes\n"; }}