fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. #include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read() (strtol(ipos,&ipos,10))
  23. #define sqr(x) ((x)*(x))
  24. #define pb push_back
  25. #define PS system("pause");
  26. typedef long long ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. int f[30][30],n,len,ans;
  34. void Work()
  35. {
  36. memset(f,55,sizeof f);
  37. scanf("%d",&n);
  38. rep(i,1,n)f[i][i]=0;
  39. rep(i,1,n-1)
  40. {
  41. scanf("%d",&len);
  42. f[i][i+1]=f[i+1][i]=len;
  43. }
  44. scanf("%d",&len);f[n][1]=f[1][n]=len;
  45. rep(k,1,n)rep(i,1,n)rep(j,1,n)if(i!=j&&i!=k&&j!=k)f[i][j]=min(f[i][j],f[i][k]+f[k][j]);
  46. rep(i,1,n)rep(j,i+1,n)rep(k,j+1,n)rep(l,k+1,n)
  47. if(f[i][j]==f[k][l]&&f[i][l]==f[j][k])ans++;
  48. cout<<ans<<endl;
  49. }
  50. int main()
  51. {
  52. // freopen((name+in).c_str(),"r",stdin);
  53. // freopen((name+out).c_str(),"w",stdout);
  54. // Init();
  55. Work();
  56. return 0;
  57. }
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty