zoukankan      html  css  js  c++  java
  • 变态的HelloWorld

    public static void main(String[] args) {
            int i, n[] = {
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << (1 >> 1))) + ((1 << 1) << (1 << 1))),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1) << (1 << 1))
                            + ((1 << 1) << (1 << (1 >> 1))) + (1 << (1 >> 1))),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1) << (1 << (1 >> 1))) - ((1 << 1) << (1 << (1 >> 1)))),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1) << (1 << (1 >> 1))) - ((1 << 1) << (1 << (1 >> 1)))),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1) << (1 << (1 >> 1))) - (1 << (1 >> 1))),
                    (((1 << 1) << (1 << 1) << (1 << 1))
                            + ((1 << 1) << (1 << 1) << (1 << (1 >> 1))) - ((1 << 1) << (1 << (1 >> 1)))),
                    ((1 << 1) << (1 << 1) << (1 << 1)),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1)) - (1 << (1 >> 1))),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1) << (1 << (1 >> 1))) - (1 << (1 >> 1))),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1) << (1 << (1 >> 1))) + (1 << 1)),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1) << (1 << (1 >> 1))) - ((1 << 1) << (1 << (1 >> 1)))),
                    (((1 << 1) << (1 << 1) << (1 << 1) << (1 << 1))
                            - ((1 << 1) << (1 << 1) << (1 << 1)) + ((1 << 1) << (1 << (1 >> 1)))),
                    (((1 << 1) << (1 << 1) << (1 << 1)) + (1 << (1 >> 1))),
                    (((1 << 1) << (1 << 1)) + ((1 << 1) << (1 << (1 >> 1))) + (1 << (1 >> 1))) };
            for (i = (1 >> 1); i < (((1 << 1) << (1 << 1))
                    + ((1 << 1) << (1 << (1 >> 1))) + (1 << 1)); i++)
                System.out.print((char) n[i]);
        }

    c版本原文:http://coolshell.cn/articles/914.html

  • 相关阅读:
    题解 CF1156A 【Inscribed Figures】
    P1352 没有上司的舞会 题解
    厦门大学附属实验中学第五次OI模拟赛(XDFZOI5)比赛须知
    属于自己的期中考总结
    做题笔记 【模板】字符串哈希
    2018 总结
    做题笔记 图的遍历 P3916
    做题笔记 Splitting into digits CF1104A
    LIS (nlogn)
    标准正交基
  • 原文地址:https://www.cnblogs.com/xirtam/p/3145545.html
Copyright © 2011-2022 走看看