fork download
copy 
  1. #include <iostream>
  2. #include <cstdio>
  3. #include <algorithm>
  4. #include <set>
  5. #include <cstring>
  6. #include <cstdlib>
  7. #include <cctype>
  8. #include <map>
  9. #include <string>
  10. #include <sstream>
  11. #include <vector>
  12. #include <queue>
  13. #include <stack>
  14. #include <cmath>
  15. #include <cassert>
  16.  
  17. #define repn( i , a , b ) for( int i = ( int ) a ; i < ( int ) b ; i ++ )
  18. #define rep( i , n ) repn( i , 0 , n ) 
  19. #define all( x )  x.begin() , x.end()
  20. #define rall( x ) x.rbegin() , x.rend()
  21. #define mp make_pair
  22. #define fst first
  23. #define snd second
  24. using namespace std;
  25.  
  26. typedef long long int64;
  27. typedef long double ldouble;
  28. typedef pair< int , int > pii;
  29.  
  30. const int MAXN = 1000005;	
  31. vector<int> G[MAXN];
  32. long double p[MAXN] = {0};
  33.  
  34. int main(){
  35. 	int N, M;
  36. 	int u, v;
  37. 	scanf("%d %d", &N, &M);
  38. 	if ( N >= MAXN ) while(1);
  39. 	while ( M-- ){
  40. 		scanf("%d %d", &u, &v);
  41. 		u--, v--;
  42. 		if ( u >= v ) while(1);
  43. 		if ( u < 0 || u >= N ) while(1);
  44. 		if ( v < 0 || v >= N ) while(1);
  45. 		G[u].push_back( v );
  46. 	}
  47. 	p[0] = 1.0;
  48. 	int S;
  49. 	for ( u=0; u < N; u++ ){
  50. 		S = (int) G[u].size();
  51. 		if ( S == 0 ){ 
  52. 		    printf("%.12Lf\n", p[u]); 
  53. 		    continue;
  54. 		}
  55. 		for ( int j=0; j < S; ++j ){
  56. 			v = G[u][j];
  57. 			p[v] += (p[u] / S);
  58. 		}
  59. 	}
  60. 	return 0;
  61. }
Success #stdin #stdout 0s 54296KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
0.000000000000
https://ideone.com/JRDJrM
language:
C++ (gcc 8.3)
created:
6 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!