程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> HDU 2841 Visible Trees£¨ÊýÂÛ£©

HDU 2841 Visible Trees£¨ÊýÂÛ£©

編輯：C++入門知識

HDU 2841 Visible Trees£¨ÊýÂÛ£©

ÌâÄ¿´óÒâ£º¸øÄãÒ»¸öm*nµÄ·½格£¬·½格´Ó£¨1£¬1£©¿ªÊ¼¡£Ã¿¸öµãÉÏÓÐÒ»¿ÃÊ÷£¬È»ºóÈÃÄã´Ó(0,0)µãÏòÏÂ¿´£¬ÎÊÄãÄÜ¿´¼û¼¸¿ÅÊ÷¡£

½âÌâË¼Â·£ºÈç¹ûÄãµÄÊÓÏß±»ºóÃæµÄÊ÷ºÍµ²×¡µÄ»°ÒÔºóÔÚÕâÌõÏßÉÏµÄÊ÷ÄãÊÇ¶¼¿´²»¼ûµÄ°¡¡£µ²×¡µÄ»°¾ÍÊÇÕâ¸öÐ¡µÄ·½格ÄÚ¶Ô½ÇÏßµÄÁ¬Ïß¹ý¶¥µã£¬ÈçÍ¼£º

½¨ÉèAÎª(0,0)Èç¹ûBÄÜÕÚµ²×¡C£¬ÄÇÃ´BÓëC×é³ÉµÄ¾ØÐÎÖÐnx, mxÊÇ²»»¥ÖÊµÄ¡£<†·Ÿ"http://www.Bkjia.com/kf/ware/vc/" target="_blank" class="keylink">vcD4KPHA+y/nS1Hi00zG/qsq8w7a+2W7I57n7bdbQxLPSu8/u0+t4u6XWysTHw7S+zbvh09DSu7j2JiMyNjY4NDvX08/Uyr6z9sC0o6zL+dLU1eLA79Do0qrV0rXEyscxLW7W0NPrw7a+2bXEeLul1sq1xLj2yv2ho9XiwO+1xLuwztLDx7/J0tTTw7W9t9a94tbK0vLK/aOsyLu689PD17TMrNG5y/W9+NDQyN2z4qOsx/Oz9m7W0NPreLul1sq1xLj2yv2hozwvcD4KPHA+UFOjus7StPrC68Dvw+bQtLXEbqOsbdPr1eLA773iys21xG6jrG3Kx7e0uf3AtLXEoaM8L3A+CjxwPjxicj4KPC9wPgo8cD48L3A+CjxoMT4KVmlzaWJsZSBUcmVlczwvaDE+CjxzdHJvbmc+VGltZSBMaW1pdDogMjAwMC8xMDAwIE1TIChKYXZhL090aGVycykgICAgTWVtb3J5IExpbWl0OiAzMjc2OC8zMjc2OCBLIChKYXZhL090aGVycyk8YnI+ClRvdGFsIFN1Ym1pc3Npb24ocyk6IDE1NTYgICAgQWNjZXB0ZWQgU3VibWlzc2lvbihzKTogNjQ1PGJyPgo8L3N0cm9uZz48YnI+Cjxicj4KClByb2JsZW0gRGVzY3JpcHRpb24KClRoZXJlIGFyZSBtYW55IHRyZWVzIGZvcm1pbmcgYSBtICogbiBncmlkLCB0aGUgZ3JpZCBzdGFydHMgZnJvbSAoMSwxKS4gRmFybWVyIFNoZXJsb2NrIGlzIHN0YW5kaW5nIGF0ICgwLDApIHBvaW50LiBIZSB3b25kZXJzIGhvdyBtYW55IHRyZWVzIGhlIGNhbiBzZWUuPGJyPgo8YnI+CklmIHR3byB0cmVlcyBhbmQgU2hlcmxvY2sgYXJlIGluIG9uZSBsaW5lLCBGYXJtZXIgU2hlcmxvY2sgY2FuIG9ubHkgc2VlIHRoZSB0cmVlIG5lYXJlc3QgdG8gaGltLgoKIAo8YnI+CgpJbnB1dAoKVGhlIGZpcnN0IGxpbmUgY29udGFpbnMgb25lIGludGVnZXIgdCwgcmVwcmVzZW50cyB0aGUgbnVtYmVyIG9mIHRlc3QgY2FzZXMuIFRoZW4gdGhlcmUgYXJlIG11bHRpcGxlIHRlc3QgY2FzZXMuIEZvciBlYWNoIHRlc3QgY2FzZSB0aGVyZSBpcyBvbmUgbGluZSBjb250YWluaW5nIHR3byBpbnRlZ2VycyBtIGFuZCBuKDEgodwgbSwgbiCh3CAxMDAwMDApCgogCjxicj4KCk91dHB1dAoKRm9yIGVhY2ggdGVzdCBjYXNlIG91dHB1dCBvbmUgbGluZSByZXByZXNlbnRzIHRoZSBudW1iZXIgb2YgdHJlZXMgRmFybWVyIFNoZXJsb2NrIGNhbiBzZWUuCgogCjxicj4KClNhbXBsZSBJbnB1dAoKPHByZSBjbGFzcz0="brush:java;">2 1 1 2 3
Sample Output

1
5

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define eps 1e-8
#define M 1000100
#define LL long long
//#define LL long long
#define INF 0x3f3f3f
#define PI 3.1415926535898
#define mod 1000000007


const int maxn = 100010;

using namespace std;

struct node
{
    int num[8];
    int ans;
} p[maxn];

int f[maxn];
int k[maxn];
int t;
void prime()
{
    t = 0;
    memset(f, 0, sizeof(f));
    for(int i = 2; i <= maxn-5; i++)
    {
        if(!f[i]) k[t++] = i;
        for(int j = 0; j < t; j++)
        {
            if(i*k[j] > maxn-5) break;
            f[i*k[j]] = true;
            if(i%k[j] == 0) break;
        }
    }
}


LL judge(int n, int x)
{
    LL cnt = 0;
    for(int i = 0; i < (1<<(p[x].ans)); i++)
    {
        int ss = 0;
        int sx = 1;
        for(int j = 0; j < p[x].ans; j++)
        {
            if((1<>T;
    while(T--)
    {
        scanf("%d %d",&n, &m);
        LL sum = n;
        for(int i = 2; i <= m; i++) sum += judge(n, i);
        cout<