Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- long long int n, m, fact = 1;
- vector<int> factor;
- int factDiv(int n, int m){
- if(n == 0) return m;
- for(int i = 1; i*i <= m; i++){
- while(m%i == 0){
- factor.push_back(i);
- m /= i;
- }
- }
- if(m > 1) factor.push_back(m);
- for(long long int i = 1; i <= n; i++){
- for(long long int j = 1; j <= factor.size(); j++){
- fact += ((i%factor[j])*(fact%factor[j]))%factor[j];
- }
- }
- return fact;
- }
- int main(){
- ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
- while(cin >> n >> m){
- if (n >= m ){
- cout << m << " divides " << n << "!" << endl;
- }else if(n < m && factDiv(n,m)== 0){
- cout << m << " divides " << n << "!" << endl;
- }else{
- cout << m << " does not divide " << n << "!" << endl;
- }
- fact = 1;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement