zoukankan      html  css  js  c++  java
  • Backward Digit Sums(POJ 3187)

    Backward Digit Sums
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 5495   Accepted: 3184

    Description

    FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 <= N <= 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer number. They repeat this until only a single number is left. For example, one instance of the game (when N=4) might go like this: 

        3   1   2   4
    
    4 3 6
    7 9
    16
    Behind FJ's back, the cows have started playing a more difficult game, in which they try to determine the starting sequence from only the final total and the number N. Unfortunately, the game is a bit above FJ's mental arithmetic capabilities. 

    Write a program to help FJ play the game and keep up with the cows.

    Input

    Line 1: Two space-separated integers: N and the final sum.

    Output

    Line 1: An ordering of the integers 1..N that leads to the given sum. If there are multiple solutions, choose the one that is lexicographically least, i.e., that puts smaller numbers first.

    Sample Input

    4 16

    Sample Output

    3 1 2 4

    Hint

    Explanation of the sample: 

    There are other possible sequences, such as 3 2 1 4, but 3 1 2 4 is the lexicographically smallest.

    Source

    白书里面的例题,虽然要求搜索,但是next_permutation()都可以过。。
    题意:给定数字和,求原来的序列
    3   1   2   4
    
    4 3 6
    7 9
    16 给16,求3 1 2 4
     1 #include <cstdio>
     2 #include <algorithm>
     3 #include <cstring>
     4 #include <iostream>
     5 using namespace std;
     6 int n,a[15],sum,b[11][11];
     7 bool judge()
     8 {
     9     int i;
    10     for(i=0;i<n;i++)
    11         b[0][i]=a[i];
    12     int k=n-1,c=0;
    13     while(k--)
    14     {
    15         c++;
    16         for(i=0;i<k+1;i++)
    17             b[c][i]=b[c-1][i]+b[c-1][i+1];
    18     }
    19     //cout<<b[c][0]<<endl;;
    20     return b[c][0]==sum;
    21 }
    22 int main()
    23 {
    24     int i,j;
    25     while(scanf("%d%d",&n,&sum)!=EOF)
    26     {    
    27         for(i=0;i<n;i++)
    28             a[i]=i+1;
    29         do{
    30             if(judge())
    31                 break;
    32         }while(next_permutation(a,a+n));
    33         for(i=0;i<n;i++)
    34             printf("%d%c",a[i],i==(n-1)?'
    ':' ');
    35     }
    36 }
  • 相关阅读:
    linux同一客户端多个git账号的配置
    linux同一台机子上用多个git 账号
    执行ssh-add时出现Could not open a connection to your authentication agent
    国内常用NTP服务器地址及IP
    PHP双引号的隐患
    mysql 累加求和
    php实现Facebook风格的 time ago函数
    Mysql之数据库设计规范
    搭建Git服务器
    win7下如何根据端口号杀掉进程
  • 原文地址:https://www.cnblogs.com/a1225234/p/5150849.html
Copyright © 2011-2022 走看看