Submission #19987332
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
if(b == 0){
return a;
}
else{
return gcd(b, a % b);
}
}
int main(){
int M = 1000000;
int N, i, j, k;
scanf("%d", &N);
vector<int> A(N);
int minA = (int)(1e9);
for(i = 0; i < N; i++){
scanf("%d", &A[i]);
minA = min(minA, A[i]);
}
mt19937 get_rand_mt(rand());
shuffle(A.begin(), A.end(), get_rand_mt);
vector<int> s(M, 0);
int L = 1;
for(i = 0; i < N; i++){
/* printf("i = %d\n", i);
printf("s:");
for(j = 0; j < L; j++){
printf("%d ", s[j]);
}
printf("\n");
*/ for(j = 0; j < L; j++){
s[L + j] = gcd(s[j], A[i]);
}
sort(s.begin(), s.begin() + 2 * L);
/* for(j = 0; j < 2 * L; j++){
printf("%d ", s[j]);
}
printf("\n");
*/ for(j = 0, k = 0; k < 2 * L; j++){
s[j] = s[k];
while(k < 2 * L && s[j] == s[k]){
k++;
}
}
L = j;
}
int ans = 0;
for(i = 0; i < L; i++){
if(s[i] <= minA){
ans++;
}
}
printf("%d\n", ans - 1);
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | F - GCD or MIN |
| User | abc050 |
| Language | C++ (GCC 9.2.1) |
| Score | 0 |
| Code Size | 1034 Byte |
| Status | TLE |
| Exec Time | 2205 ms |
| Memory | 7204 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
16 | scanf("%d", &N);
| ~~~~~^~~~~~~~~~
./Main.cpp:20:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
20 | scanf("%d", &A[i]);
| ~~~~~^~~~~~~~~~~~~
Judge Result
| Set Name | Sample | All | ||||||
|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 600 | ||||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt |
| All | big_answer_00.txt, big_answer_01.txt, big_answer_02.txt, big_answer_03.txt, handmade_00.txt, handmade_01.txt, many_divisors_00.txt, primes_00.txt, primes_01.txt, primes_02.txt, primes_03.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, same_00.txt, same_01.txt, same_02.txt, same_03.txt, same_04.txt, same_05.txt, sample_01.txt, sample_02.txt, sample_03.txt, semiprimes_00.txt, semiprimes_01.txt, semiprimes_02.txt, semiprimes_03.txt, semiprimes_04.txt, semiprimes_05.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| big_answer_00.txt | TLE | 2205 ms | 7196 KiB |
| big_answer_01.txt | TLE | 2205 ms | 7180 KiB |
| big_answer_02.txt | TLE | 2205 ms | 7180 KiB |
| big_answer_03.txt | TLE | 2205 ms | 7192 KiB |
| handmade_00.txt | AC | 9 ms | 7084 KiB |
| handmade_01.txt | AC | 7 ms | 7096 KiB |
| many_divisors_00.txt | AC | 231 ms | 7188 KiB |
| primes_00.txt | AC | 374 ms | 7100 KiB |
| primes_01.txt | AC | 366 ms | 7108 KiB |
| primes_02.txt | AC | 178 ms | 7100 KiB |
| primes_03.txt | AC | 184 ms | 7204 KiB |
| random_00.txt | AC | 559 ms | 6976 KiB |
| random_01.txt | AC | 577 ms | 7044 KiB |
| random_02.txt | AC | 587 ms | 7040 KiB |
| random_03.txt | AC | 566 ms | 7152 KiB |
| random_04.txt | AC | 580 ms | 7188 KiB |
| random_05.txt | AC | 77 ms | 7044 KiB |
| random_06.txt | AC | 73 ms | 7100 KiB |
| random_07.txt | AC | 202 ms | 7188 KiB |
| random_08.txt | AC | 209 ms | 7192 KiB |
| random_09.txt | AC | 32 ms | 7152 KiB |
| same_00.txt | AC | 11 ms | 7112 KiB |
| same_01.txt | AC | 9 ms | 7200 KiB |
| same_02.txt | AC | 8 ms | 7104 KiB |
| same_03.txt | AC | 8 ms | 7036 KiB |
| same_04.txt | AC | 7 ms | 7100 KiB |
| same_05.txt | AC | 9 ms | 7008 KiB |
| sample_01.txt | AC | 13 ms | 7148 KiB |
| sample_02.txt | AC | 9 ms | 7104 KiB |
| sample_03.txt | AC | 10 ms | 7108 KiB |
| semiprimes_00.txt | AC | 444 ms | 7096 KiB |
| semiprimes_01.txt | AC | 313 ms | 7192 KiB |
| semiprimes_02.txt | AC | 309 ms | 6972 KiB |
| semiprimes_03.txt | AC | 170 ms | 7152 KiB |
| semiprimes_04.txt | AC | 280 ms | 7192 KiB |
| semiprimes_05.txt | AC | 29 ms | 7148 KiB |