problem:https://www.lydsy.com/JudgeOnline/problem.php?id=1000

This is my first code under Emacs!

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a,b;
int main()
{
scanf("%d%d",&a,&b);
printf("%d",a+b);
return ;
}

I think I have to write down how to write such a code as soon as possible in case that I forget how to use it again.

(Previous explaination:Because the failure of install sogoupinyin, I have to write this blog in English......)

Let's begin.

First, you need to install Linux in your computer which has a previous system(Win 7).

  After download Linux from the web of NOI,you have two choice.

  First, you can install Daemon tool to unzip the iso, then click "wubi.exe". By this you can get a twin-system.

  But I failed in this way.It stopped and I don't know how to exit it. Every time I exit by running out the power of my think pad.(Is this bad for think pad?)

  Then I download a Virtual Machine, VMware.

  At first I installed VM14. But it can't run(maybe because it's too advanced). After searching I installed VM 12.(workstation pro)

But there is still a problem. Seems like we need to allow the VT-X to support the Virtual Machine.

  You can push F2 at the time of turn on the computer. Remember push it as early as possible, ans push it continuously to make sure not to miss the time.

  Then turn to the "Security" or something.You can find the "virtual......", then change it from "enabled" to "abled".

  Oh! Now we can use the VMware! Use it to open the iso. Then what? I can't remember. After something we can run the Ubuntu!

The first thing you need to do is to change a desktop pictrue.

  Press left-up corner, the "system tools", the "first-select part"(Oh,it's just my translate.Don't mind it too much......), then you find the "outlook"!

How to install emacs?

  Open the terminal.By Ctrl+Alt+T or in the left-up corner, the "attachment", you can see the "terminal".

  Insert "sudo apt-get install emacs".Then it tells you to insert the password.Don't worry, it's just your password to open the system.Origin of 123456.

  It isn't visible when you insert the password. Just insert them and then press "return".

  Oh! Now we sucssfully installed the Emacs!!!

How to start emacs?

  Open the terminal. Insert "emacs". Then the emacs has been opened!

First you can read the introduction. It is the first blue one. Make your cursor there then press "return".

Yes, it's in chinese! Then you can read it.

After reading it, I feel like had known a lot. But I still don't know how to write a program.

What you need is this!https://blog.csdn.net/shuxiao9058/article/details/7633054

I do exactly following it. Then I wrote out my first code under emacs successfully!

Oh,how to copy it?https://www.cnblogs.com/CodeKnight/p/3927877.html

  Yeah, just by ctrl+space to choose and by Alt+w to copy.(Maybe it has been introduced in that introduction?)

So I can be accepted by bzoj in problem 1000.

All of this is just a beginning.

Something to study:

http://www.cnblogs.com/robertzml/archive/2010/03/31/1701374.html (But this is not something.)

https://blog.csdn.net/redguardtoo/article/details/7222501/ (And this is truly something looks advanced and great!)

bzoj 1000 A+B Problem (And also my first experience of Emacs)的更多相关文章

  1. BZOJ 1000: A+B Problem

    问题:A + B问题 描述:http://acm.wust.edu.cn/problem.php?id=1000&soj=0 代码示例: import java.util.Scanner; p ...

  2. BZOJ 1000 A+B Problem (I/O)

    #include<cstdio> int main(){ int a,b; scanf("%d%d",&a,&b); printf("%d&q ...

  3. 1000: A+B Problem(NetWork Flow)

    1000: A+B Problem Time Limit: 1 Sec  Memory Limit: 5 MBSubmit: 11814  Solved: 7318[Submit][Status][D ...

  4. [BZOJ 2301] [HAOI 2011] Problem b (莫比乌斯反演)(有证明)

    [BZOJ 2301] [HAOI 2011] Problem b (莫比乌斯反演)(有证明) 题面 T组询问,每次给出a,b,c,d,k,求\(\sum _{i=a}^b\sum _{j=c}^d[ ...

  5. 【BZOJ】3339: Rmq Problem & 3585: mex(线段树+特殊的技巧)

    http://www.lydsy.com/JudgeOnline/problem.php?id=3585 好神的题. 但是!!!!!!!!!!!!!!我线段树现在要开8倍空间才能过!!!!!!!!!! ...

  6. HDU 1000 A + B Problem(指针版)

    A + B Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To ...

  7. BZOJ 3339 && luogu4137 Rmq Problem / mex(莫队)

    P4137 Rmq Problem / mex 题目描述 有一个长度为n的数组{a1,a2,-,an}.m次询问,每次询问一个区间内最小没有出现过的自然数. 输入输出格式 输入格式: 第一行n,m. ...

  8. 【BZOJ】2301: [HAOI2011]Problem b(莫比乌斯+分块)

    http://www.lydsy.com/JudgeOnline/problem.php?id=2301 和这题不是差不多的嘛--[BZOJ]1101: [POI2007]Zap(莫比乌斯+分块) 唯 ...

  9. [POJ 1000] A+B Problem 经典水题 C++解题报告 JAVA解题报告

        A+B Problem Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 311263   Accepted: 1713 ...

随机推荐

  1. Spring_事务(2)

  2. 初入spring boot(四 )web项目

    1. 模板引擎 spring boot提供了大量的模板引擎,包括FreeMark.Groovy.Thymeleaf.Velocity等,但spring boot中推荐用Thymeleaf,因为Thym ...

  3. vs2017创建dotnetcore web项目,并部署到centos7上

    一.打开vs2017创建web项目 二.简单的创建项目后,发布项目 三. 在centos上创建webroot目录,将发布的项目文件复制到该目录下(本人用虚拟机测试) 四.在webroot目录下打开终端 ...

  4. sklearn学习笔记之岭回归

    岭回归 岭回归是一种专用于共线性数据分析的有偏估计回归方法,实质上是一种改良的最小二乘估计法,通过放弃最小二乘法的无偏性,以损失部分信息.降低精度为代价获得回归系数更为符合实际.更可靠的回归方法,对病 ...

  5. Memcached replace 命令

    Memcached replace 命令用于替换已存在的 key(键) 的 value(数据值). 如果 key 不存在,则替换失败,并且您将获得响应 NOT_STORED. 语法: replace ...

  6. NumPy排序、搜索和计数函数

    NumPy - 排序.搜索和计数函数 NumPy中提供了各种排序相关功能. 这些排序函数实现不同的排序算法,每个排序算法的特征在于执行速度,最坏情况性能,所需的工作空间和算法的稳定性. 下表显示了三种 ...

  7. scala学习手记30 - 闭包

    首先要弄白闭包的概念. 教材中的说法是:闭包是一种特殊的函数值,闭包中封闭或绑定了在另一个作用域或上下文中定义的变量.这里说闭包是一种特殊的函数值. 维基百科中的说法是:在计算机科学中,闭包(英语:C ...

  8. JNI_Z_10_Java的数组

    在Java中数组分为两种: (1).基本类型数组 (2).对象类型(Object[])的数组 (数组中存放的是指向Java对象中的引用) 一个能通用于两种不同类型数组的函数: GetArrayLeng ...

  9. Button实现图文混排

    Button实现图文混排 一.简介 本文介绍两种图文混排方式 1.android:drawableTop="@drawable/star"实现文字上有图片 当然有上下左右等等 2. ...

  10. 远程调用之RMI、Hessian、Burlap、Httpinvoker、WebService的比较

    一.综述 本文比较了RMI.Hessian.Burlap.Httpinvoker.WebService5这种通讯协议的在不同的数据结构和不同数据量时的传输性能. RMI是java语言本身提供的远程通讯 ...