A. Jeff and Digits(cf)

【A. Jeff and Digits(cf)】的更多相关文章

A. Jeff and Digits time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Jeff's got n cards, each card contains either digit 0, or digit 5. Jeff can choose several cards and put them in a line so…

cf A. Jeff and Digits

http://codeforces.com/contest/352/problem/A #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int n; ]; int main() { ,t2=; scanf("%d",&n); ; i<=n; i++) { scanf("%d",&a[i]); ) t1…

CF352A Jeff and Digits

Jeff's got n cards, each card contains either digit 0, or digit 5. Jeff can choose several cards and put them in a line so that he gets some number. What is the largest possible number divisible by 90 Jeff can make from the cards he's got? Jeff must…

B. Jeff and Periods(cf)

B. Jeff and Periods time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output One day Jeff got hold of an integer sequence a1, a2, ..., an of length n. The boy immediately decided to analyze the sequ…

『题解』Coderforces352A Jeff and Digits

更好的阅读体验 Portal Portal1: Codeforces Portal2: Luogu Description Jeff's got n cards, each card contains either digit 0, or digit 5. Jeff can choose several cards and put them in a line so that he gets some number. What is the largest possible number div…

codeforces A. Jeff and Digits 解题报告

题目链接:http://codeforces.com/problemset/problem/352/A 题目意思:给定一个只有0或5组成的序列,你要重新编排这个序列(当然你可以不取尽这些数字),使得这个序列尽可能地大,并且能被90除尽. 做这道题目,是多次调试本场比赛的B,完全不成功后回头再做的,一开始什么思路都没有,因为觉得是考纯数学,直接看B......怎么说,很大程度是靠直觉的.只知道,这个序列肯定是这种形式:5xx...0 或者像题目所说的特殊情况:0(不过前提是0的个数不为0).其他就…