hihoCoder Challenge 5 register

Ended

Participants:319

Verdict:Accepted
Submitted:2014-11-09 19:47:17

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<ctype.h>
#include<math.h>
using namespace std ;
typedef long long lld;
const int MAX = 512;
const lld MOD=1000000009 ;
double dp[MAX][MAX];
int a[MAX];
bool vis[MAX];
double c[MAX][MAX]={0};
int len[MAX];
int getlen(int r)
{
    int ret=0;
    while(!vis[r])
    {
        vis[r]=true;
        ret++;
        r=a[r];
    }
    return ret;
}
int main ()
{
    int n,k;
    int T,i,j;
    for(i=0;i<MAX;i++)
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX