【CJOJ】Contest4 - A+B Series-白红宇

【CJOJ】Contest4 - A+B Series

阅读量：6436 次

发布时间：2019-06-23

本文共 1776 字，大约阅读时间需要 5 分钟。

Position:

A经典题目

// 
     
       - Sun Oct  9 15:28:01 2016// This file is made by YJinpeng，created by XuYike's black technology automatically.// Copyright (C) 2016 ChangJun High School, Inc.// I don't know what this program is.#include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           
            #include 
            
             #pragma GCC push_options#pragma GCC optimize ("O2")#define MOD 1000000007#define INF 1e9#define IN inline#define RG registerusing namespace std;typedef long long LL;typedef long double LB;const int MAXN=100010;const int MAXM=100010;inline int max(int &x,int &y) { return x>y?x:y;}inline int min(int &x,int &y) { return x
             
              '9')&&ch!='-')ch=getchar(); if(ch=='-')q=1,ch=getchar(); while(ch>='0'&&ch<='9')w=w*10+ch-'0',ch=getchar(); return q?-w:w;}int main(){ LL a=gi(),b=gi(); cout<

B

C交互式

// 
     
       - Sun Oct  9 15:28:01 2016// This file is made by YJinpeng，created by XuYike's black technology automatically.// Copyright (C) 2016 ChangJun High School, Inc.// I don't know what this program is.#include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           
            #include 
            
             #include "plus.h"#define MOD 1000000007#define INF 1e9#define IN inline#define RG registerusing namespace std;typedef long long LL;typedef long double LB;const int MAXN=100010;const int MAXM=100010;inline int max(int &x,int &y) { return x>y?x:y;}inline int min(int &x,int &y) { return x
             
              '9')&&ch!='-')ch=getchar(); if(ch=='-')q=1,ch=getchar(); while(ch>='0'&&ch<='9')w=w*10+ch-'0',ch=getchar(); return q?-w:w;}int solve(){ LL a=getA(),b=getB(); return a+b;}