7466. 팩토리얼과 최대공약수

Factorial by Sumana Chamrunworakiat from the Noun Project

#include<iostream>
using namespace std;

int main(){
	int T;
    cin>>T;
    for(int t=1; t<=T; t++){
    	cout<<"#"<<t<<" ";
        int N, K;
        cin>>N>>K;
        int result=1;
        if(N>=K){
        	result=K;
        }
        else{
        	for(int i=N; i>0; i--){
            	if(K%i==0){
                	result*=i;
                    K/=i;
                }
            }
        }
        cout<<result<<endl;
    }
    return 0;
}

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWnghFyq9eMDFAQU&categoryId=AWnghFyq9eMDFAQU&categoryType=CODE

SW Expert Academy

본 문제는 swexpertacademy의 7466 문제입니다.