| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1344097 | stone | Gingerbread (BOI25_gcd) | C++20 | 74 ms | 1492 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
int a[N];
int n;
bool FLAG=0;
void fun(int idx, int t){
if(idx==n){
int g=0;
for(int i=0;i<n;i++){
g=__gcd(a[i],g);
}
if(g==1)FLAG=1;
return;
}
for(int i=0;i<=t;i++){
a[idx]+=i;
fun(idx+1,t-i);
a[idx]-=i;
}
}
signed main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<1000;i++){
fun(0,i);
if(FLAG){
cout<<i;
return 0;
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
