| ID |
Problem |
Count |
| 5401 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 7, 3, 5, 9, 2, 0, 6, 1, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 7, 3, 5, 9, 7, 3, 5, 9, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2, 6, 6 and 6, using prime factorization. | 1 |
| 5402 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 1, 0, 8, 0, 9, 4, 4, 0, 1, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 0, 8, 0, 9, 1, 0, 8, 0, 9, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2, 6, 6 and 6, using prime factorization. | 1 |
| 5403 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 9, 1, 7, 9, 2, 2, 2, 2, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 9, 1, 7, 9, 9, 1, 7, 9, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2, 6, 7, 8, 7 and 8, using prime factorization. | 1 |
| 5404 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 2, 2, 1, 8, 8, 6, 5, 2, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 2, 2, 1, 8, 2, 2, 1, 8, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2, 6, 5 and 5, using prime factorization. | 1 |
| 5405 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 1, 0, 4, 9, 0, 8, 2, 0, 9, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 0, 4, 9, 0, 1, 0, 4, 9, 0, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2 and 6, using prime factorization. | 1 |
| 5406 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 6, 8, 8, 5, 1, 0, 4, 0, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 6, 8, 8, 5, 6, 8, 8, 5, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2, 6, 0 and 0, using prime factorization. | 1 |
| 5407 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 5, 9, 5, 8, 6, 4, 4, 2, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 9, 5, 8, 5, 9, 5, 8, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2, 6, 8 and 8, using prime factorization. | 1 |
| 5408 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 6, 7, 0, 7, 1, 4, 4, 0, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 6, 7, 0, 7, 6, 7, 0, 7, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2 and 6, using prime factorization. | 1 |
| 5409 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 1, 5, 1, 5, 5, 1, 0, 3, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 5, 1, 5, 1, 5, 1, 5, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2 and 6, using prime factorization. | 1 |
| 5410 | Find Greatest Common Divisor of 1, 5, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 7, 0, 4, 1, 2, 6, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 3, 0, 0, 0, 3, 0, 0, 0, 5, 0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 2 and 6, using prime factorization. | 1 |
| 5411 | Find Greatest Common Divisor of 70219952 and 45261, using Euclidean algorithm. | 1 |
| 5412 | Find Greatest Common Divisor of 221 and 153, using Euclidean algorithm. | 1 |
| 5413 | Find Greatest Common Divisor of 71 and 2, using Euclidean algorithm. | 1 |
| 5414 | Find Greatest Common Divisor of 108, 288 and 360, using prime factorization. | 1 |
| 5415 | Find Greatest Common Divisor of 108, 288 and 360, using repeated division. | 1 |
| 5416 | Find Greatest Common Divisor of 57842515 and 982374827, using Euclidean algorithm. | 1 |
| 5417 | Find Greatest Common Divisor of 57842515 and 928374827, using prime factorization. | 1 |
| 5418 | Find Greatest Common Divisor of 4 and 160, using prime factorization. | 1 |
| 5419 | Find Greatest Common Divisor of 361 and 1448, using prime factorization. | 1 |
| 5420 | Find Greatest Common Divisor of 256 and 96, using prime factorization. | 1 |
| 5421 | Find Greatest Common Divisor of 45 and 8, using prime factorization. | 1 |
| 5422 | Find Greatest Common Divisor of 45 and 8, using Euclidean algorithm. | 1 |
| 5423 | Find Greatest Common Divisor of 1320 and 252, using Euclidean algorithm. | 1 |
| 5424 | Find Greatest Common Divisor of 10 and 8, using Euclidean algorithm. | 1 |
| 5425 | Find Greatest Common Divisor of 819514390 and 869246761, using prime factorization. | 1 |
| 5426 | Find Greatest Common Divisor of 1, 868701542 and 914640655, using prime factorization. | 1 |
| 5427 | Find Greatest Common Divisor of 947820555 and 863589446, using prime factorization. | 1 |
| 5428 | Find Greatest Common Divisor of 192 and 18, using Euclidean algorithm. | 1 |
| 5429 | Find Greatest Common Divisor of 1 and 10, using prime factorization. | 1 |
| 5430 | Find Greatest Common Divisor of 7 and 10, using prime factorization. | 1 |
| 5431 | Find Greatest Common Divisor of 65537 and 3255854716, using prime factorization. | 1 |
| 5432 | Find Greatest Common Divisor of 65537 and 3255854716, using Euclidean algorithm. | 1 |
| 5433 | Find Greatest Common Divisor of 65537 and 3255854716, by listing out the factors. | 1 |
| 5434 | Find Greatest Common Divisor of 210 and 180, using prime factorization. | 1 |
| 5435 | Find Greatest Common Divisor of 270 and 180, using prime factorization. | 1 |
| 5436 | Find Greatest Common Divisor of 5200 and 180, using prime factorization. | 1 |
| 5437 | Find Greatest Common Divisor of 6, 12 and 0, using prime factorization. | 1 |
| 5438 | | 1 |
| 5439 | Find Greatest Common Divisor of 567, 87 and 269, using prime factorization. | 1 |
| 5440 | Find Greatest Common Divisor of 48 and 6, using prime factorization. | 1 |
| 5441 | Find Greatest Common Divisor of 48 and 6, using Euclidean algorithm. | 1 |
| 5442 | Find Greatest Common Divisor of 4480 and 2260, using prime factorization. | 1 |
| 5443 | Find Greatest Common Divisor of 442 and 208, using Euclidean algorithm. | 1 |
| 5444 | Find Greatest Common Divisor of 2352 and 1442, using Euclidean algorithm. | 1 |
| 5445 | Find Greatest Common Divisor of 252 and 198, using repeated division. | 1 |
| 5446 | Find Greatest Common Divisor of 19 and 141, using Euclidean algorithm. | 1 |
| 5447 | Find Greatest Common Divisor of 442 and 208, using prime factorization. | 1 |
| 5448 | Find Greatest Common Divisor of 18 and 27, using prime factorization. | 1 |
| 5449 | Find Greatest Common Divisor of 75 and 1000, using prime factorization. | 1 |
| 5450 | Find Greatest Common Divisor of 590 and 366, using prime factorization. | 1 |