hdu 1562 Guess the number

本文介绍了一种猜数字游戏的算法实现,通过给定的三个整数a、b、c,在1000到9999范围内找到满足特定条件的最小数字x。详细解析了算法流程,并给出了具体的代码实现。
Problem Description
Happy new year to everybody!
Now, I want you to guess a minimum number x betwwn 1000 and 9999 to let
(1) x % a = 0;
(2) (x+1) % b = 0;
(3) (x+2) % c = 0;
and a, b, c are integers between 1 and 100.
Given a,b,c, tell me what is the number of x ?
 


 

Input
The number of test cases c is in the first line of input, then c test cases followed.every test contains three integers a, b, c.
 


 

Output
For each test case your program should output one line with the minimal number x, you should remember that x is between 1000 and 9999. If there is no answer for x, output "Impossible".
 


 

Sample Input
2 44 38 49 25 56 3
 


 

Sample Output
Impossible 2575

 

#include<iostream>
using namespace std;
int main()
{
 int cas,a,b,c,s,t,temp,i;
 cin>>cas;
 while(cas--)
 {
  cin>>a>>b>>c;
  for(i=1000;i<=9999;i++)
  {
  if( i%a==0 && (i+1)%b==0 && (i+2)%c==0)
   break;  
  }
  if(i<10000)
   cout<<i<<endl;
  else
   cout<<"Impossible"<<endl;
 }
 return 0;
}

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值