zoukankan      html  css  js  c++  java
  • 1745 Divisibility

    Divisibility

    Time Limit: 1000MS Memory Limit: 10000K
    Total Submissions: 14084 Accepted: 4989
    Description

    Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us, for example, take the sequence: 17, 5, -21, 15. There are eight possible expressions: 17 + 5 + -21 + 15 = 16
    17 + 5 + -21 - 15 = -14
    17 + 5 - -21 + 15 = 58
    17 + 5 - -21 - 15 = 28
    17 - 5 + -21 + 15 = 6
    17 - 5 + -21 - 15 = -24
    17 - 5 - -21 + 15 = 48
    17 - 5 - -21 - 15 = 18
    We call the sequence of integers divisible by K if + or - operators can be placed between integers in the sequence in such way that resulting value is divisible by K. In the above example, the sequence is divisible by 7 (17+5±21-15=-14) but is not divisible by 5.

    You are to write a program that will determine divisibility of sequence of integers.
    Input

    The first line of the input file contains two integers, N and K (1 <= N <= 10000, 2 <= K <= 100) separated by a space.
    The second line contains a sequence of N integers separated by spaces. Each integer is not greater than 10000 by it’s absolute value.
    Output

    Write to the output file the word “Divisible” if given sequence of integers is divisible by K or “Not divisible” if it’s not.
    Sample Input

    4 7
    17 5 -21 15
    Sample Output

    Divisible
    Source

    Northeastern Europe 1999

    这是简单DP水题,WA了几次,初学的时候这个题还是有必要看看!!

    #include <cstdio> 
    #include <iostream>
    #include <cstring>
    #include <algorithm>
    #include <map>
    #include <cstdlib>
    using namespace std;
    #define mod(a) (a)<0? (-(a))%k:(a)%k  
    #define mem(a,b) memset((a),(b),sizeof(a));
    int dp[10005][105];	
    	int a[10005];
    
    int main(){
    //	freopen("test.txt","r",stdin);
    	mem(dp,0);
    	int n,k;
    	cin>>n>>k;
    	for(int i=1;i<=n;i++)
    		cin>>a[i];
    	dp[1][mod(a[1])]=1;
    	for(int i=2;i<=n;i++)
    		for(int j=0;j<k;j++)
    			if(dp[i-1][j])
    			{
    				dp[i][mod(j+a[i])]=1;
    				dp[i][mod(j-a[i])]=1;
    			}
    	if(dp[n][0]) cout<<"Divisible";
    	else cout<<"Not divisible";
        return 0;}
    
  • 相关阅读:
    systemverilog中堵塞和非堵塞事件以及同步
    Win 10最大的亮点不是免费而是人工智能
    STL源代码学习(vector篇)
    【金阳光測试】大话Android自己主动化測试--Android自己主动化系列(1)--金阳光于2013年4月份
    [PHP]怎样在SAE的CodeIgniter项目中隐藏掉index.php
    ubuntu 非长期支持版升级系统版本号(ssh登录情况适用)
    #26 Remove Duplicates from Sorted Array
    怎样建设内网网站
    scrollView and tableView
    关于Kingfisher--备用
  • 原文地址:https://www.cnblogs.com/lunatic-talent/p/12798996.html
Copyright © 2011-2022 走看看