https://cn.vjudge.net/problem/Gym-101873E
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=4e3+9;
const int mod=1e9+7;
struct E
{
int to;
double w;
};
vector<E> g[maxn];
bool use[maxn];
bool vis[maxn];
double dis[maxn];
int n,m;
bool spfa(int u)
{
use[u]=1;
vis[u]=1;
for(auto x:g[u])
{
int v=x.to;
double w=x.w;
if(dis[v]<dis[u]+w)
{
dis[v]=dis[u]+w;
if(vis[v]||spfa(v)) return 1;
}
}
vis[u]=0;
return 0;
}
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a,b;
double c;
cin>>a>>b>>c;
g[a].pb({b,log(c)});
}
bool f=1;
for(int i=1;i<=n;i++)
{
for(int z=0;z<=n;z++) vis[z]=0,dis[z]=0;
if(!use[i])
{
if(spfa(i))
{
f=0;
break;
}
}
}
if(!f) cout<<"inadmissible\n";
else cout<<"admissible\n";
return 0;
}