也是一道AC比較高的
感覺最近只對簡單題有feel？
盯著難題看了很久我只是想到了夜宵。。
Time Limit: 1 Second Memory Limit: 32768 KB
Given an positive integer A (1 <= A <= 100), output the lowest bit of A. For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, so the output should be 2. Another example goes like this: given A = 88, we can write A in binary form as 1011000, so the lowest bit of A is 1000, so the output should be 8. (閱讀全文…)
前言
1.省赛题目作者有5人，出题数分别为fib(0),fib(1),fib(2),fib(3)和fib(4)
2.关于各项预测
赛前估计的难度顺序是L A B E G F H K J C I D
实际的难度顺序为L A B E G K F J H C I D，K的预测失败，其他差不多
赛前估计所有题目都有提交
Bingo
赛前估计通过做多的是L题
Bingo
赛前估计D没有队伍过，其他题都有队伍过
Bingo
赛前估计I只有一个队伍过
Bingo
赛前估计第一名10题
第一名11题
赛前估计第一名和第二名没有题数差距
题数目差距为2
赛前估计ZJU夺杯
Bingo
赛前估计ZJU金牌数为3或4
Bingo，三枚金牌
以下为简略的解题报告
(閱讀全文…)
正式註冊好ACM參賽帳號
話説
很沒品的四個隊伍名字
長征1號 長征2號。。。。。。長征4號
我暈倒。。。。。
希望這個戳戳的隊名可以給我們帶來戳戳的好運吧
XD
Time Limit: 1 Second Memory Limit: 32768 KB
In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China and Beijing Olympics is to be a festival for people all over the world as well.
The motto of Olympic Games is “Citius, Altius, Fortius”, which means “Faster, Higher, Stronger”.
In this problem, there are some records in the Olympic Games. Your task is to find out which one is faster, which one is higher and which one is stronger.
Input
——————————————————————————–
Time Limit: 1 Second Memory Limit: 32768 KB
——————————————————————————–
Cryptography deals with methods of secret communication that transform a message (the plaintext) into a disguised form (the ciphertext) so that no one seeing the ciphertext will be able to figure out the plaintext except the intended recipient. Transforming the plaintext to the ciphertext is encryption; transforming the ciphertext to the plaintext is decryption. Twisting is a simple encryption method that requires that the sender and recipient both agree on a secret key k, which is a positive integer.
The twisting method uses four arrays: plaintext and ciphertext are arrays of characters, and plaincode and ciphercode are arrays of integers. All arrays are of length n, where n is the length of the message to be encrypted. Arrays are origin zero, so the elements are numbered from 0 to n – 1. For this problem all messages will contain only lowercase letters, the period, and the underscore (representing a space).