cf C. Divisible by Seven
2014-11-30 20:15
253 查看
http://codeforces.com/contest/376/problem/C
题意:给你一个大数最多含有10^6个数字,这里面必须含有1,6,8,9,然后重新排列找出一个能被6整除的数。
思路:1,6,8,9排列组成的四位数取余7为0,1,2,3,4,5,6;
所以可以这样排列前面的数是其它的数+1,6,8,9排列组成的数+多个0;
View Code
题意:给你一个大数最多含有10^6个数字,这里面必须含有1,6,8,9,然后重新排列找出一个能被6整除的数。
思路:1,6,8,9排列组成的四位数取余7为0,1,2,3,4,5,6;
所以可以这样排列前面的数是其它的数+1,6,8,9排列组成的数+多个0;
#include <cstdio> #include <cstring> #include <algorithm> #define maxn 1000010 using namespace std; char str[maxn]; int cnt[10]; int num[] = {1869,6198,1896,1689,1986,1968,1698}; int main() { for(int i=0; i<7; i++) { printf("%d\n",num[i]%7); } while(scanf("%s",str)!=EOF) { memset(cnt,0,sizeof(cnt)); int k=strlen(str); for(int i=0; i<k; i++) { cnt[str[i]-'0']++; } cnt[1]--; cnt[6]--; cnt[8]--; cnt[9]--; int c=0; for(int i=1; i<=9; i++) { for(int j=1; j<=cnt[i]; j++) { printf("%d",i); c=(c*10+i)%7; } } printf("%d",num[c]); for(int i=1; i<=cnt[0]; i++) { printf("0"); } printf("\n"); } return 0; }
View Code
相关文章推荐
- cf 376C - Divisible by Seven
- CodeForces - 376C~Divisible by Seven(思路)
- A. Divisible by Seven----打表暴力/数学思维
- Code forces 376 C Divisible by Seven
- codeforce 221 Div2 C - Divisible by Seven
- Codeforces Round #221 (Div. 2)-C. Divisible by Seven
- Codeforces Round #221 (Div. 2) C. Divisible by Seven(构造 大数除法 )
- C. Divisible by Seven
- Divisible by Seven CodeForces - 376C (数论)
- Divisible by Seven
- CF 843 A. Sorting by Subsequences
- CF 454B(Little Pony and Sort by Shift-序列位移后单调性判断及最小位移[水])
- URL 编码:CFURLCreateStringByAddingPercentEscapes
- URL 编码:CFURLCreateStringByAddingPercentEscapes
- 1. CountDiv 数数有几个 Compute number of integers divisible by k in range [a..b].
- IOS开发之CFURLCreateStringByAddingPercentEscapes--URL 编码
- URL编码CFURLCreateStringByAddingPercentEscapes使用(ARC)
- URL 编码:CFURLCreateStringByAddingPercentEscapes[转]
- CFURLCreateStringByAddingPercentEscapes
- Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in d