HDU 5211 Mutiple

最新推荐文章于 2021-03-30 20:21:45 发布

Calm微笑

最新推荐文章于 2021-03-30 20:21:45 发布

阅读量230

点赞数

分类专栏：数学题

本文链接：https://blog.csdn.net/yao1373446012/article/details/52662271

版权

数学题专栏收录该内容

141 篇文章 0 订阅

订阅专栏

Mutiple

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 915 Accepted Submission(s): 547

Problem Description

WLD likes playing with a sequence

a[1..N] . One day he is playing with a sequence of

N integers. For every index i, WLD wants to find the smallest index

F(i) ( if exists ), that

i<F(i)≤n , and

aF(i) mod

ai = 0. If there is no such an index

F(i) , we set

F(i) as 0.

Input

There are Multiple Cases.(At MOST

10 )

For each case:

The first line contains one integers

N(1≤N≤10000) .

The second line contains

N integers

a1,a2,...,aN(1≤ai≤10000) ,denoting the sequence WLD plays with. You can assume that all ai is distinct.

Output

For each case:

Print one integer.It denotes the sum of all

F(i) for all

1≤i<n

Sample Input

Sample Output

  
  
   
   6


   
   
    
    
     
     Hint
    
    F(1)=2
F(2)=0
F(3)=4
F(4)=0

Source

BestCoder Round #39 ($)

Recommend

hujie | We have carefully selected several similar problems for you: 5906 5905 5903 5902 5901

做题前一定要读清题。。。。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define INF 0xfffffff
using namespace std;
int a[11000],b[110000];
int main()
{
	int n,i,j,k,flag;
	while(scanf("%d",&n)!=EOF)
	{
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			b[a[i]]=i;
		}
		int ans=0;
		for(i=1;i<=n;i++)
		{
			k=INF;
			for(j=2;j*a[i]<=n;j++)
			{
				if(b[j*a[i]]&&b[j*a[i]]>i)
				{
					k=min(k,b[j*a[i]]);
				}
			}
			if(k!=INF)
			ans+=k;
		}
		printf("%d\n",ans);
	}
	return 0;
}