#include <stdio.h> #include <stdlib.h> ]; int cmp(const void *a, const void *b) { return *(int*)a - *(int*)b; } int main() { int n,i,j,result; ) { i = result = ; nums[i] = n; ++i; while(scanf("%d",&n) && n) { nums[i] = n; ++i; } n = i; qsort(nums,i,]),cmp); ; i < n; ++i) { ; j < n; ++j) { && nums[j]%nums[i] == ) { ++result; break; } } } printf("%d\n",result); } }
相关文章
- 02-27poj 2976 Dropping tests 01分数规划
- 02-27poj 1200 Crazy Search(hash)
- 02-27poj2528(线段树+离散化)
- 02-272020 BIT冬训-二分三分快速幂矩阵 A - Expanding Rods POJ - 1905
- 02-27Frame Stacking POJ - 1128
- 02-27POJ 2949 Word Rings
- 02-27# Expanding Rods//POJ - 1905//二分
- 02-27Frame Stacking POJ - 1128
- 02-27POJ 2039 To and Fro(模拟)
- 02-27POJ 1528问题描述