495B - Modular Equations - CodeForces Solution


math number theory *1600

Please click on ads to support us..

C++ Code:

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define fr(i,a,b)  for(ll i=a;i<b;i++)
#define ll long long
#define cline cout<<endl

int main()
{
int a,b;
cin>>a>>b;

if(a==b){
    cout<<"infinity";
}
else if(a<b){
    cout<<0;
}
else{
   int x=0;

   for(int i=1;i*i<=(a-b);i++){

    if((a-b)%i==0){
                
                int y=(a-b)/i;
                if(i>b){
                    x++;
                }
                if(y>b && y!=i){
                    x++;
                }
   }

}
cout<<x;

}
 return 0;
}


Comments

Submit
0 Comments
More Questions

Book of Potion making
Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree