HDOJ 5223 GCD

题意：已知有n个数，其中有q次查询，已知每次查询的区间以及区间中的最大公约数，判断是否存在一个数列，满足每次查询的结果。如果有多个序列，输出和最小的一个，若还是有多个，输出任意一个序列

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5223

思路：枚举每个区间中的数，排序后判断是否存在同一区间有不同的gcd，若存在，则该序列不存在，若不存在，则每个数求出lcm，查询出原始序列。

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
13617861	2015-05-03 21:15:10	Accepted	5223	15MS	1612K	4186 B	G++	luminous11

/* 
***********************************************
*# @Author  : Luminous11 (573728051@qq.com)
*# @Date    : 2015-05-02 13:01:44
*# @Link    : http://blog.csdn.net/luminous11
*********************************************** 
*/

#include <algorithm>
#include <iostream>
#include <climits>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <deque>
#include <list>
#include <map>
#include <set>
//#include <unordered_map>
//#include <unordered_set>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define clr(a, v) memset( a , v , sizeof(a) )
#define RS(s) scanf ( "%s", s )
#define RDI(a) scanf ( "%d", &a )
#define RDII(a, b) scanf ( "%d%d", &a, &b )
#define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c )
#define PL() printf ( "\n" )
#define PI(a) printf ( "%d", a )
#define PIL(a) printf ( "%d\n", a )
#define PSL(s) printf ( "%s\n", s )
#define PII(a,b) printf ( "%d %d", a, b )
#define PIIL(a,b) printf ( "%d %d\n", a, b )
#define PIII(a,b,c) printf ( "%d %d %d", a, b, c )
#define PIIIL(a,b,c) printf ( "%d %d %d\n", a, b, c )
#define rep(i,m,n) for ( int i = m; i <  n; i ++ )
#define REP(i,m,n) for ( int i = m; i <= n; i ++ )
#define dep(i,m,n) for ( int i = m; i >  n; i -- )
#define DEP(i,m,n) for ( int i = m; i >= n; i -- )
#define repi(i,m,n,k) for ( int i = m; i <  n; i += k )
#define REPI(i,m,n,k) for ( int i = m; i <= n; i += k )
#define depi(i,m,n,k) for ( int i = m; i >  n; i += k )
#define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k )
//#pragma comment ( linker, "/STACK:1024000000,1024000000" )
using namespace std;
template <class T>
inline bool RD ( T &ret )
{
    char c;
    int sgn;
    if ( c = getchar(), c ==EOF )return 0; //EOF
    while ( c != '-' && ( c < '0' || c > '9' ) ) c = getchar();
    sgn = ( c == '-' ) ? -1 : 1;
    ret = ( c == '-' ) ? 0 : ( c - '0' );
    while ( c = getchar() , c >= '0' && c <= '9' ) ret = ret * 10 + ( c - '0' );
    ret *= sgn;
    return 1;
}
inline void PD ( int x )
{
    if ( x > 9 ) PD ( x / 10 );
    putchar ( x % 10 + '0' );
}
const double eps = 1e-10;
const double pi = acos(-1.0);
const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };
struct node{
    int x, y, cnt;
    node(){}
    node( int _x, int _y ) : x(_x), y(_y) {}
    node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {}
};
struct edge{
    int next, to, wei;
    edge(){}
    edge( int _next, int _to, int _wei ) : to(_to), wei(_wei) {}
};
node num[1005];
int p[1005];
bool cmp ( const node &a, const node &b )
{
    return a.x < b.x;
}
int lcm ( int x, int y )
{
    return x / __gcd ( x, y ) * y;
}
void calc ( int k )
{
    //cout << num[k].x << ' ' << num[k].y  << ' ' << num[k].cnt<< endl;
    for ( int i = num[k].x; i <= num[k].y; i ++ ){
        p[i] = lcm ( p[i], num[k].cnt );
    }
    //cout << "asldk\n";
}
int main()
{
    int T;
    scanf ( "%d", &T );
    while ( T -- ){
        int n, q;
        scanf ( "%d%d", &n, &q );
        for ( int i = 0; i < 1005; i ++ ){
            p[i] = 1;
        }
        for ( int i = 0; i < q; i ++ ){
            scanf ( "%d%d%d", &num[i].x, &num[i].y, &num[i].cnt );
        }
        sort ( num, num + q, cmp );
        //cout << "step2\n";
        calc ( 0 );
        bool flag = 1;
        for ( int i = 1; i < q; i ++ ){
            if ( num[i].x == num[i-1].x && num[i].y == num[i-1].y && num[i].cnt != num[i-1].cnt ){
                flag = 0;
                break;
            }
            calc ( i );
        }
        //cout << "step3\n";
        if ( flag ){
            for ( int i = 1; i <= n; i ++ ){
                if ( i != 1 )printf ( " " );
                printf ( "%d", p[i] );
            }
            printf ( "\n" );
        }
        else{
            printf ( "Stupid BrotherK!\n" );
        }
    }
    return 0;
}