Codeforces Round #132 (Div. 2) A题
2013-06-07 17:41
232 查看
这题相信大家看样例就能知道什么意思吧!直接暴力
#include <iostream>
#include <cstdio>
using namespace std;
int a[100],b[100];
int main()
{
int i,j,k,n,m;
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&m);
for(j=0; j<m; j++)
{
scanf("%d",&b[j]);
}
int maxn=0,sum=0;
for(i=0; i<n; i++)
{
for(j=0; j<m; j++)
{
if(b[j]%a[i]==0)
{
if(b[j]/a[i]==maxn)
++sum;
else if(b[j]/a[i]>maxn)
{
maxn=(b[j]/a[i]);
sum=1;
}
}
}
}
printf("%d\n",sum);
return 0;
}
#include <iostream>
#include <cstdio>
using namespace std;
int a[100],b[100];
int main()
{
int i,j,k,n,m;
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&m);
for(j=0; j<m; j++)
{
scanf("%d",&b[j]);
}
int maxn=0,sum=0;
for(i=0; i<n; i++)
{
for(j=0; j<m; j++)
{
if(b[j]%a[i]==0)
{
if(b[j]/a[i]==maxn)
++sum;
else if(b[j]/a[i]>maxn)
{
maxn=(b[j]/a[i]);
sum=1;
}
}
}
}
printf("%d\n",sum);
return 0;
}
相关文章推荐
- Codeforces Round #132 (Div. 2) D. Hot Days
- Hot Days Codeforces Round #132 (Div. 2) D(贪婪)
- Codeforces Round #132 (Div. 2) D. Hot Days
- Hot Days Codeforces Round #132 (Div. 2) D(贪心)
- Codeforces Round #132 (Div. 2)
- Codeforces Round #279 (Div. 2) C
- Codeforces Round #360 (Div. 2) -- C. NP-Hard Problem (DFS二分图染色法)
- Codeforces Round #189 (Div. 2) A. Magic Numbers
- Codeforces Round #189 (Div. 2)
- Codeforces Round #FF (Div. 2) A. DZY Loves Hash
- Codeforces Round #FF (Div. 2)
- Codeforces Round #279 (Div. 2) B
- Codeforces Round #366 (Div. 2) C list
- 【2-SAT】【并查集】ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) D. The Door Problem
- Codeforces Round #FF (Div. 2)C. DZY Loves Sequences
- Codeforces Round #190 (Div. 2)
- Codeforces Round #FF (Div. 二):C. DZY Loves Sequences
- Codeforces Round #401 (Div. 2) C. Alyona and Spreadsheet(暴力)
- 并查集Codeforces Round #134 (Div. 1), problem: (A) Ice Skating
- Codeforces Round #339 (Div. 2) A. Link/Cut Tree