제출 #97993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97993		brcode	새로운 문제 (POI11_sej)	C++14	21 / 100	161 ms	8500 KiB

sej

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int ans;
int total;
const int MAXN = 1e6;
int arr[MAXN];
bool common(int x){
    for(int i=1;i<=total;i++){
        if(arr[i]%x == 0){
            return false;
        }
       
    }
     return true;
}
int main() {
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=k;i++){
        cin>>arr[i];
    }
    for(int i=1;i<=k;i++){
        arr[i] = __gcd(n,arr[i]);
    }
    sort(arr+1,arr+k);
    for(int i=1;i<k;i++){
        if(arr[i]!=arr[i-1]){
            total++;
            arr[total] = arr[i];
        }
    }
  
    for(int i=1;i<=sqrt(arr[k]);i++){
        if(arr[k]%i == 0){
            
            if(common(i)){
                ans = n/i;
                break;
            }
            if(common(arr[k]/i)){
                ans = (n/arr[k]*i);
            }
        }
    }
    cout<<ans<<endl;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 0 / 7
• Subtask 5: 0 / 7
• Subtask 6: 0 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 7
• Subtask 9: 0 / 7
• Subtask 10: 0 / 7
• Subtask 11: 0 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 8
• Subtask 14: 0 / 8