1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"CodeViewer"] 1c:T526,#include #include #include using namespace std; int n, m; vector upper[501]; vector lower[501]; bool visited[501]; int k; void travel_upper(int x) //short->tall { for(int i=0;ishort { for(int i=0;i>n>>m; for(int i=0;i>a>>b; upper[a].push_back(b); lower[b].push_back(a); } int ans=0; int x, y; for(int i=1;i<=n;i++) { memset(visited, 0, sizeof(visited)); visited[i]=1; k=1; travel_upper(i); x=k; memset(visited, 0, sizeof(visited)); visited[i]=1; k=1; travel_lower(i); y=k; if(x+y-1==n) ans++; //자기 자신은 두번 셈 -> -1 해주기 } cout<

코드 #2389