B. Preparation for International Women's Day

传送门:http://codeforces.com/problemset/problem/1133/B

International Women's Day is coming soon! Polycarp is preparing for the holiday.

There are ? candy boxes in the shop for sale. The ?-th box contains ??candies.

Polycarp wants to prepare the maximum number of gifts for ?

girls. Each gift will consist of exactly two boxes. The girls should be able to share each gift equally, so the total amount of candies in a gift (in a pair of boxes) should be divisible by ?. In other words, two boxes ? and ? (?≠?) can be combined as a gift if ??+?? is divisible by ?.

How many boxes will Polycarp be able to give? Of course, each box can be a part of no more than one gift. Polycarp cannot use boxes "partially" or redistribute candies between them.

Input

The first line of the input contains two integers ?

and ? (1≤?≤2⋅105,1≤?≤100) — the number the boxes and the number the girls.

The second line of the input contains ?

integers ?1,?2,…,?? (1≤??≤109), where ?? is the number of candies in the ?-th box.

Output

Print one integer — the maximum number of the boxes Polycarp can give as gifts.

Examples

Input

Copy

7 2
1 2 2 3 2 4 10

Output

Copy

6

Input

Copy

8 2
1 2 2 3 2 4 6 10

Output

Copy

8

Input

Copy

7 3
1 2 2 3 2 4 5

Output

Copy

4

Note

In the first example Polycarp can give the following pairs of boxes (pairs are presented by indices of corresponding boxes):

  • (2,3)
  • ;
  • (5,6)
  • ;
  • (1,4)
  • .

So the answer is 6

.

In the second example Polycarp can give the following pairs of boxes (pairs are presented by indices of corresponding boxes):

  • (6,8)
  • ;
  • (2,3)
  • ;
  • (1,4)
  • ;
  • (5,7)
  • .

So the answer is 8

.

In the third example Polycarp can give the following pairs of boxes (pairs are presented by indices of corresponding boxes):

  • (1,2)
  • ;
  • (6,7)
  • .

So the answer is 4

.

#include<bits/stdc++.h>
using namespace std;
map<int,int>mp;
int n,k,x,ans;
int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>x;
        x%=k;
        if(mp[(k-x)%k])
            ans+=2,mp[(k-x)%k]--;
        else
            mp[x]++;
    }
    cout<<ans<<endl;
    return 0;
}

 

  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值