AtCoder Beginner Contest 068 ABC C++&&python

这篇博客介绍了AtCoder Beginner Contest的编程比赛,涉及ABC系列的三个问题:A题是找到第N轮比赛的简称,B题要求找出1到N中能被2整除次数最多的一个数,C题则探讨了Snuke猫通过两次船只服务能否从岛1到达岛N的可能性。
摘要由CSDN通过智能技术生成

A - ABCxxx


Time limit : 2sec / Memory limit : 256MB

Score : 100 points

Problem Statement

This contest, AtCoder Beginner Contest, is abbreviated as ABC.

When we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.

What is the abbreviation for the N-th round of ABC? Write a program to output the answer.

Constraints

  • 100N999

Input

Input is given from Standard Input in the following format:

N

Output

Print the abbreviation for the N-th round of ABC.


Sample Input 1

Copy
100

Sample Output 1

Copy
ABC100

The 100th round of ABC is ABC100.


Sample Input 2

Copy
425

Sample Output 2

Copy
ABC425

Sample Input 3

Copy
999

Sample Output 3

Copy
ABC999
水题了

为了练练python所以拿python写的

python:

print('ABC'+input())
C++:

#include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    cout<<"ABC"<<n<<endl;
}


B - Break Number


Time limit : 2sec / Memory limit : 256MB

Score : 200 points

Problem Statement

Takahashi loves numbers divisible by 2.

You are given a positive integer N. Among the

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值