HDU 4889 Scary Path Finding Algorithm

HDU 4889 Scary Path Finding Algorithm

題意：

構造一幅圖 使題中給出的程序按該圖執行 最終變量doge大於輸入的C跳出

思路：

出題人思維簡直神了！ 實在是膜拜！ 借題解的圖：

按照圖中所畫 可以繼續向右延伸<喎?http://www.Bkjia.com/kf/ware/vc/" target="_blank" class="keylink">vcD4KPHA+zqq6ztXi0fm/ydLUo7+jvyAgzqq6zrHfyKjSqtXiw7TIoaO/o788L3A+CjxwPs/Iu9i08LXatv649s7KzOKjujwvcD4KPHA+yKG4usr9ysfOqsHLv8nS1LK7ts+1xMiluPzQwiAgwP3I58jnufvX38HLyc/D5rXELTTEx8z1sd8gIMTHw7TL/NPSsd+1xMv509C1477N09a/ydLU1Nm4/NDC0ru0ziAg1eLR+cq5uPzQwrTvtb3By9a4yv28trHwIKOoxuTKtb/J0tSw0cv509C1xCYjMjA1NDA7vNPJz9K7uPYmIzIwNTQwO0sgILK7uf3V4rj2S9K7tqjSqsihusOjoaOpPC9wPgo8cD6z/cHLuLrK/c3iztLDx7eiz9bK/dfWtrzKxzK1xLy4tM7D3SAgyOe5+87Sw8ewtDK9+NbGwLS/vMLHtcS7sCAgxL+1xL7Nyse3wNa5wcu9+M67ttTK/dfWtcS4ycjFICDV4r7Nysexo9akwcvI57n719/Byy04xMfM9bHfICDEx8O0y/vT0rHfy/nT0LXjtrzSu7aou+G4/NDCICCjqLzytaXLtdLyzqqyu7/JxNyxyC04u7nQoSAgzqrJtiAg0vLOqsO7vfjOu7Cho6GjqSAg1eK+zcrHztLOqsqyw7TLtcihSyYjMjA1NDA70ru2qNKqyKG6wyCjqNXitePO0rK7yLe2qCAg0vLOqr/JxNzJ1M6iuMTBy9K7teO149PJ09rK/dfWu/3A27a8u+Gy+sn607DP7L3hufu1xL34zrsgILK7uf0mIzQzOy0xv8nS1Ln9ICC1q8rHMTAwML7NV0HBy6GtICDH87TzyfG4+Nakw/ejoaOho6GjqTwvcD4KPHA+u9i08M3qtdq2/rj2zsrM4rXa0ru49s7KzOLSssO7yrLDtL/Jy7W1xMHLICC+zcrH0vLOqrHfyKi5udTstcS6wyAgyrm1w9K7uPa149TasbvJz8PmtcSx37j80MK68yAg09Kx37XEtePIq9KquPzQwjwvcD4KPHA+PGJyPgo8L3A+CjxwPrT6wuujujwvcD4KPHA+PHByZSBjbGFzcz0="brush:java;">#include int main() { int i,j; int f[33]={-1}; for(i=1;i<=30;i++) f[i]=f[i-1]*2; while(~scanf("%d",&i)) { puts("99 87"); for(i=1;i<30;i++) { printf("%d %d 0\n",i,i+30); printf("%d %d %d\n",i,i+1,f[29-i]); printf("%d %d %d\n",i+30,i+1,f[30-i]); } } return 0; }