Summer summary (II)

This week, I didn't brush the questions too much , Every day A There are not many questions , But this week, I sorted out some knowledge points , Wrote some notes , Because every time I look at the problem solution, I find that I don't have too many knowledge points , It's always stuck , So this week will focus on knowledge points first . But I found out , After reading the title, the solution , After the whole code is completely understood , Write it yourself , This time one-time A The possibility is very, very large , The latest questions 1A There's a high probability that . This week I want to write two topics that I have been thinking about for a long time ：

1、P1808 Word classification

A question that feels very skilled , Try it first sort Function sorts the input string , Then put the sorted string into set Collection （ To borrow set Set off the weight ）, Last set The number of elements in is the answer .

#include<bits/stdc++.h>

using namespace std;

set<string> words;

int main(){

 int t;

 string temp;

 cin>>t;

 while(t--){

  cin>>temp;

  sort(temp.begin(),temp.end());

  words.insert(temp); }

 cout<<words.size()<<endl;

 return 0;

}

2、P1029    The problem of maximum common divisor and minimum common multiple

Refer to the code idea of the problem solution , You can see that no matter which one P,Q They are all satisfied P × Q = x 0 × y 0 , Then we can use one q Express y 0 Divide x 0 Value （ If it's not divisible , Output 0）, And then from 2 Start looking at q What number can I divide by , Use one ans recorded , The final answer is ans Of 2 Power , Here imitate the way of the boss , Shift one delegate left 2 To the power of .  

#include<iostream>

using namespace std;

int x, y;

int main() {

 cin >> x >> y;

 if ((y%x) != 0) {

  cout << 0 << endl;}

 else {

  int q

  q= y / x;

  int begin = 2;

  int ans = 0;

  while (q > 1) {

   if ((q%begin) == 0) {

    ans++;

    while ((q%begin) == 0) {

     q /= begin;}

   }

   begin++;

  }

  cout << (1 << ans) << endl;

 }

 return 0;

}

The next week will focus on questions , come on. ！