1411B - Fair Numbers - CodeForces Solution


brute force number theory *1000

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       long long n;
       cin>>n;
       while(true)
       {
           string s=to_string(n);
           bool flag=false;
           for(int i=0;i<s.size();i++)
           {
               long long d=s[i]-'0';
               if(d!=0 && n%d!=0)
               {
                   flag=true;
                   break;
               }
           }
           if(flag==true)
           {
               n++;
           }
           else
           {
               cout<<n<<endl;
               break;
           }
       }
    }
}




Comments

Submit
0 Comments
More Questions

768A - Oath of the Night's Watch
156C - Cipher
545D - Queue
459B - Pashmak and Flowers
1538A - Stone Game
1454C - Sequence Transformation
165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal