Submission #884460

#	Time	Username	Problem	Language	Result	Execution time	Memory
884460		lalig777	Sirni (COCI17_sirni)	C++14	0 / 140	5100 ms	1884 KiB

sirni

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;


int main(){
	int n;
	cin>>n;
	vector<int>cards(n);
	vector<int>minimums(n, 1e9);
	for (int i=0; i<n; i++) cin>>cards[i];
	sort(cards.begin(), cards.end());
	int ans=0;
	for (int i=0; i<n; i++){
		for (int j=i+1; j<n; j++){
			if (cards[j]%cards[i]==0){
				minimums[i]=0;
				minimums[j]=0;
			}else{
				int mini=min(cards[j]%cards[i], cards[i]);
				minimums[i]=min(minimums[i], mini);
				minimums[j]=min(minimums[j], mini);
			}
		}ans+=minimums[i];
	}cout<<ans<<endl;
    return 0;
}

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