content
stringlengths 19
11k
|
|---|
#include <stdio.h>
#define SWAP(a, b)
int N, L;
char str[102][102];
int idx[102];
int Sortstr(void);
int Strcmp(char * p, char * q);
int main(void)
{
int i;
scanf("%d %d", &N, &L);
for (i = 1; i <= N; i++)
{
scanf("%s", str[i]);
idx[i] = i;
}
Sortstr();
for (i = 1; i <=N; i++)
{
printf("%s", str[idx[i]]);
}
printf("\n");
return 0;
}
int Sortstr(void)
{
int tmp, i, j;
for (i = 1; i <= N - 1; i++)
{
for (j = i + 1; j <= N; j++)
{
if (Strcmp(str[idx[i]], str[idx[j]]) > 0)
{
tmp = idx[i];
idx[i] = idx[j];
idx[j] = tmp;
}
}
}
}
int Strcmp(char * a, char * b)
{
while (*a == *b)
{
if (!(*a)) return 0;
a++;
b++;
}
return (*a > *b) ? 1 : -1;
} |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
char nome[120][120];
int ord(const void* x, const void* y){
//const char *a = x, *b=y;
return strcmp(x,y);
}
int ord_indice(const void* x, const void* y){
const int *a = x, *b = y;
return strcmp(nome[*a],nome[*b]);
}
int main(){
int n,m;
scanf("%d %d",&n,&m);
int indice[n];
for(int i=0;i<n;i++){
scanf("%s",nome[i]);
indice[i]=i;
}
// ordenando as strings
//qsort(nome,n,sizeof(nome[0]),ord);
//ordenando o vetor de indices
qsort(indice,n,sizeof(indice[0]),ord_indice);
for(int i=0;i<n;i++)
printf("%s",nome[indice[i]]);
puts("");
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(){
int N, L;
char **S;
int i,j,mini;
int res;
int *check;
scanf("%d %d", &N, &L);
check = (int*)malloc(sizeof(int) * N);
S = (char**)malloc(sizeof(char*) * N);
for(i = 0; i<N; i++){
S[i] = (char*)malloc(sizeof(char) * (L+1));
}
for(i = 0; i<N; i++){
check[i] = 0;
scanf("%s",S[i]);
}
/*
for(i=0; i<N; i++)
printf("%s\n", S[i]);
*/
mini=0;
for(j=0; j<N; j++){
for(i =0; i<N; i++){
if(check[i] == 0){
res = strcmp(S[i],S[mini]);
if(res < 0)
mini = i;
}
}
// ここでminiはチェックされてない単語で最小のものを指して胃rる
printf("%s", S[mini]);
check[mini] = 1;
for(i=0; i<N; i++){
if(check[i] == 0){
mini = i;
break;
}
}
}
return 0;
}
|
#include <stdio.h>
#include<string.h>
int main(void){
int a,b;
int i,j;
scanf("%d %d",&a,&b);
char words[a][b+1];
char word[101];
for(i=0;i<a;i++)
{
scanf("%s",words[i]);
//printf("%s\n",words[i]);
}
for(i=0;i<a;i++)
{
for(j=i+1;j<a;j++)
{
if(strcmp(words[i],words[j])<0)
{
}
else if(strcmp(words[i],words[j])==0)
{
}
else
{
strcpy(word,words[i]);
strcpy(words[i],words[j]);
strcpy(words[j],word);
}
}
}
for(i=0;i<a;i++)
printf("%s",words[i]);
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
int N,L;
scanf("%d%d",&N,&L);
char S[105][105]={"\0"};
char s[105]={"\0"};
int num[105][105]={{0}};
// int Num[105]={0};
for(int i=0;i<N;i++)
{
scanf("%s",S[i]);
for(int j=0;j<L;j++)
num[i][j]=(int)S[i][j];
}
for(int i=0;i<N;i++)
{
int k=0;
for(int j=i+1;j<N;j++)
{
while(S[i][k]==S[j][k])
{
k++;
}
if((int)S[i][k]>(int)S[j][k])
{
strcpy(s,S[j]);
strcpy(S[j],S[i]);
strcpy(S[i],s);
}
k = 0;
}
}
for(int i=0;i<N;i++)
printf("%s",S[i]);
return 0;
}
|
#include <stdio.h>
#include <string.h>
#define MAXLENGTH 10009
#define SLENGTH 109
#define NUM 102
void dictionary_order(int n, char s[NUM][SLENGTH]);
int main(void){
int n,l,i;
char s[NUM][SLENGTH]={};
scanf("%d %d",&n,&l);
for(i=0;i<n;i++){
scanf("%s",s[i]);
}
dictionary_order(n,s);
printf("\n");
return 0;
}
void dictionary_order(int n,char s[NUM][SLENGTH]){
int i,j,disorder=1;
while(disorder==1){
disorder=0;
for(i=0;i<n-1;i++){
if(strcmp(s[i], s[i+1])>0){
char temp[SLENGTH]={};
for(j=0;s[i][j]!='\0';j++){
temp[j]=s[i][j];
}
for(j=0;s[i][j]!='\0';j++){
s[i][j]=s[i+1][j];
}
for(j=0;temp[j]!='\0';j++){
s[i+1][j]=temp[j];
}
}
}
for(i=0;i<n-1;i++){
if(strcmp(s[i],s[i+1])>0){disorder=1;}
}
}
for(i=0;i<n;i++){printf("%s", s[i]);}
} |
#include <stdio.h>
#include <string.h>
void swap(char *s1, char *s2)
{
char tmp[128];
strcpy(tmp, s1);
strcpy(s1, s2);
strcpy(s2, tmp);
}
int big(char *s1, char *s2, int len)
{
for (int i = 0; i < len; ++i) {
if (s1[i] > s2[i]) {
return 1;
}
if (s1[i] < s2[i]) {
return 0;
}
}
return 0;
}
int main(int argc, char **argv)
{
int n, l;
scanf("%d %d", &n, &l);
char s[128][128];
for (int i = 0; i < n; ++i) {
scanf("%s", s[i]);
}
for (int i = 0; i < n-1; ++i) {
for (int j = 0; j+1 < n-i; ++j) {
if (big(s[j], s[j+1], l)) {
swap(s[j], s[j+1]);
}
}
}
for (int i = 0; i < n; ++i) {
printf("%s", s[i]);
}
putchar('\n');
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
void sort(char **S, int N)
{
char *temp;
for (int i = 0; i <(N - 1); i++)
{
for (int j = (N - 1); i < j; j--)
{
for (int k = 0; S[i][k] || S[j][k]; k++)
{
if ((S[j][k] - S[i][k]) < 0)
{
temp = S[i];
S[i] = S[j];
S[j] = temp;
break;
}
else if ((S[j][k] - S[i][k]) > 0)
break;
}
}
}
}
int main(void)
{
int N;
int L;
char escape;
scanf("%d %d", &N, &L);
// printf("N:%d ",N);
// printf("L:%d\n",L);
char **S;
S = (char **)malloc(sizeof(char *) * (N + 1));
for (int i = 0; i < N; i++)
{
S[i] = (char *)malloc(L + 1);
}
S[N] = NULL;
for (int i = 0; i < N; i++)
{
if (i != 0)
scanf("%c", &escape);
scanf("%s", S[i]);
}
sort(S, N);
for (int i = 0; S[i]; i++)
printf("%s",S[i]);
free(S);
return (0);
}
|
#include<stdio.h>
#include<stdlib.h>
void swap(char **p, char **q){
char *a;
a = *p;
*p = *q;
*q = a;
}
int length(char *p){
int i = 0, L = 0;
while(p[i] != '\0'){
L++;
i++;
}
return 0;
}
int comp(int L,char *p, char *q){
/*if p < q, then return 1, else return 0*/
int i = 0;
while(i < L){
if(p[i] > q[i])return 1;
if(p[i] < q[i])break;
i++;
}
return 0;
}
int main(){
int i = 0, j = 0, n, L;
char *buf;
char **s;
s = (char **)malloc(sizeof(char *)*100);
*s = (char *)malloc(sizeof(char)*100);
scanf("%d %d", &n, &L);
for(i = 0; i < n; i++){
buf = (char *)malloc(sizeof(char) * 100);
scanf("%s", buf);
s[i] = buf;
}
for(i = 0; i < n; i++){
for(j = 0; j+i < n; j++){
if(comp(L, s[i], s[i+j] ) )swap(&(s[i]), &(s[i+j]));
}
}
for(i = 0; i < n; i++){
printf("%s", s[i]);
}
printf("\n");
return 0;
} |
#include <stdio.h>
#include <string.h>
void swap(char *a, char *b){
char temp[101];
strcpy(temp, a);
strcpy(a, b);
strcpy(b, temp);
}
void quickSort(char array[][101], int left, int right){
char pivot[101] = {0};
if(right - left <= 1)
return;
int pivotIdx = (left + right) / 2;
strcpy(pivot, array[pivotIdx]);
swap(array[pivotIdx], array[right-1]);
int i = left;
for(int j=left; j < right - 1; j++) {
if(strcmp(array[j], pivot) < 0) {
swap(array[i++], array[j]);
}
}
swap(array[i], array[right-1]);
quickSort(array, left, i);
quickSort(array, i + 1, right);
}
int main(void){
int n, l;
char str[100][101] = {{0}};
scanf("%d%d", &n, &l);
for(int i=0; i < n; i++) {
scanf("%s", &str[i]);
if(strlen(str[i]) != l)
return 1;
}
quickSort(str, 0, n);
for(int i=0; i < n; i++) {
printf("%s", str[i]);
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
void str_swap(char str1[],char str2[])
{
char str[128];
strcpy(str,str1);
strcpy(str1,str2);
strcpy(str2,str);
}
int dictionary(char str1[],char str2[])
{
int ans,i,len;
if(strlen(str1) < strlen(str2))
{
len = strlen(str1);
ans = 1;
}else
{
len = strlen(str2);
ans = 2;
}
for(i=0;i<len;i++)
{
if(str1[i]>str2[i])
{
ans = 2;
break;
}else if(str1[i]<str2[i])
{
ans = 1;
break;
}
}
return ans;
}
int main(void)
{
int num,len,i,j;
char str[128];
fgets(str,sizeof(str),stdin);
sscanf(str,"%d %d",&num,&len);
char matrix[num+2][len+2];
for(i=0;i<num;i++)
{
fgets(&matrix[i],len+2,stdin);
}
for(i=0;i<num-1;i++)
{
for(j=0;j<num-i-1;j++)
{
if(dictionary(&matrix[j],&matrix[j+1]) == 2)
{
str_swap(&matrix[j],&matrix[j+1]);
}
}
}
for(i=0;i<num;i++)
{
for(j=0;j<len;j++)
{
printf("%c",matrix[i][j]);
}
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int l;
int compare_char(const void*a, const void* b) {
return strncmp(*(char**)a, *(char**)b, l);
}
int main(void) {
char **input;
char *output;
int n;
char str[128];
int i;
char *p;
output = fgets(str, 128, stdin);
for(i=0;i<128;i++){
if(str[i] == ' '){
str[i] = '\0';
n = atoi(str);
l = atoi(&str[i+1]);
break;
}
}
input = malloc(n * sizeof(char*) + n * (l + 2));
output = malloc(n * (l+2));
for(i=0;i<n;i++){
input[i] = (char*)input + (n * sizeof(char*)) + (i * (l+2));
fgets(input[i], l + 2, stdin);
}
qsort(input, n, sizeof(char*), compare_char);
p = output;
for(i=0;i<n;i++){
p += snprintf(p, l+1, "%s", input[i]);
p--;
}
printf("%s\n", output);
free(input);
free(output);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int Compare(const char *s1, const char *s2);
int main (int argc, char *argv[]) {
int N, L, i, j, minj;
scanf("%d %d[^\n]", &N, &L);
if (N < 1 || N > 100 || L < 1 || L > 100) return -1;
char **S, *min, *result;
S = malloc(N * sizeof(char*));
min = malloc((L + 1) * sizeof(char));
result = malloc(N * (L + 1) * sizeof(char));
for (i = 0; i < N; i++) {
S[i] = malloc((L + 1) * sizeof(char));
if (scanf("%s[^\n]", S[i]) != 1) return -1;
}
strcpy(result, "");
for (i = 0; i < N; i++) {
minj = -1;
strcpy(min, "");
for (j = 0; j < N; j++) {
if (S[j] != NULL) {
if (Compare(min, S[j]) > 0 || !strcmp(min, "")) {
strcpy(min, S[j]);
minj = j;
}
}
}
strcat(result, min);
S[minj] = NULL;
}
printf("%s\n", result);
return 0;
}
int Compare(const char *s1, const char *s2) {
while (*s1 == *s2) {
if (*s1 == '\0')
return (0);
s1++;
s2++;
}
return (*s1 - *s2);
} |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char *string[101];
void choice_sort(int num, int length){
int i=0,j=0;
int min_index=0;
char *tmp=NULL;
for(i=0;i < num-1;i++){
min_index = i;
for(j= i + 1 ;j < num;j++){
if(strcmp(string[ min_index ] , string[ j ]) > 0){//s1 > s2
min_index = j;
}
}
//先頭に最大値をスワップ
tmp = string[i];
string[i] = string[min_index];
string[min_index] = tmp;
}
}
int main(int argc, char const *argv[]) {
int i=0;
char *ans=NULL;
int num=0;
int length=0;
scanf("%d %d", &num, &length);
ans = (char*)malloc(sizeof(char) * 101 * 101);
memset(ans, '\0',101 * 101);
for(i = 0; i < 101; i++) {
string[i] = (char *)malloc(sizeof(char) * 101);
memset( string[i], '\0', 101);
}
for(i=0;i<num;i++){
scanf("%s", string[i]);
}
choice_sort(num, length);
for(i=0;i<num;i++){
strcat(ans, string[i]);
//printf("%s\n",string[i] );
}
printf("%s\n", ans);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int num(){
char s[11];
int i, n;
for(i=0; i<sizeof(s); i++){
s[i] = getchar();
if(s[i] == ' ' || s[i] == '\n'){
s[i] = '\0';
break;
}
}
sscanf(s, "%d", &n);
return n;
}
int comp(char a[], char b[]){
int i=0;
while(a[i] != '\0'){
if(a[i] != b[i]){
return a[i] - b[i];
}
i++;
}
return 0;
}
void sort(char x[][101], int n){
int i, j;
char y[101];
for(i=n; i>1; i--){
for(j=0; j<=i-2; j++){
if(0 < comp(x[j], x[j+1])){
strcpy(y, x[j]);
strcpy(x[j], x[j+1]);
strcpy(x[j+1], y);
}
}
}
}
int main(void){
int n, l;
int i;
char s[100][101];
n = num();
l = num();
for(i=0; i<n; i++){
scanf("%s", s[i]);
}
sort(s, n);
for(i=0; i<n; i++){
printf("%s", s[i]);
}
printf("\n");
return 0;
} |
#include<stdio.h>
void sort(int left,int right);
int strcom(char *pword1,char *pword2);
char *pstr[100];
int main(){
int N,L;
int i,j;
char str[101];
scanf("%d %d",&N,&L);
char word[N*(L+1)];
for(i=0;i<N;i++){
scanf("%s",str);
for(j=0;j<L+1;j++){
word[(L+1)*i+j]=str[j];
}
pstr[i]=&word[(L+1)*i];
}
sort(0,N-1);
for(i=0;i<N;i++)printf("%s",pstr[i]);
}
void sort(int left,int right){
char *bor;
char *high[100],*low[100];
int i,h=0,l=0,len=right-left;
bor=pstr[left];
for(i=left+1;i<=left+len;i++){
if(strcom(bor,pstr[i])==1){
low[l++]=pstr[i];
}else if(strcom(bor,pstr[i])==-1){
high[h++]=pstr[i];
}
}
for(i=0;i<l;i++)pstr[i+left]=low[i];
for(i=0;i<len-h-l+1;i++)pstr[left+l+i]=bor;
for(i=0;i<h;i++)pstr[left+len-h+1+i]=high[i];
if(l>1)sort(left,left+l-1);
if(h>1)sort(right-h+1,right);
}
int strcom(char *pword1,char *pword2){
int i;
if(*pword1>*pword2)return 1;
else if(*pword1<*pword2)return -1;
else if(*pword1==*pword2){
if(*(pword1+1)!='\0')return strcom(pword1+1,pword2+1);
else return 0;
}
}
|
#include<stdio.h>
#include<stdlib.h>
int main(void){
int n,l;
char **s;
//char *com;
//int yoso=0;
int k;
k=scanf("%d %d",&n,&l);
s=calloc(n,sizeof(char*));
for(int i=0;i<n;i++){
s[i]=calloc(l+1,sizeof(char));
}
for(int i=0;i<n;i++){
k= scanf("%s",s[i]);
}
//com=calloc(l*n+1,sizeof(char));
//com[l*n]='\0';
int min;
for(int c=0;c<n;c++){
min=c;
for(int a=c+1;a<n;a++){
for(int i=0;i<l;i++){
int flag=0;
for(int j=0;j<i;j++){
if(s[min][j]==s[a][j]) flag++;
}
if((flag==i)&&(s[a][i]<s[min][i])){
min=a;
}
}
}/*
for(int i=0;i<l;i++){
com[yoso++]=s[m][i];
}*/
printf("%s",s[min]);
char sss[l+1];sss[l]='\0';
for(int i=0;i<l;i++){
sss[i]=s[c][i];
}
for(int i=0;i<l;i++){
s[c][i]=s[min][i];
}
for(int i=0;i<l;i++){
s[min][i]=sss[i];
}
}
//printf("%s",com);
free(s);
// free(com);
printf("\n");
return 0;
} |
#include<stdio.h>
int comp(int,int);
void downheap(int,int);
void swap(int,int);
int n,l;
char c[100][101];
int main(void){
int i;
scanf("%d%d",&n,&l);
for(i = 0;i < n;i++){
scanf("%s",c[i]);
}
for(i = (n - 2) / 2;i >= 0;i--){
downheap(i,n - 1);
}
for(i = n - 1;i > 0;i--){
swap(0,i);
downheap(0,i - 1);
}
for(i = 0;i < n;i++){
printf("%s",c[i]);
}
printf("\n");
return 0;
}
int comp(int i,int j){
int k = 0;
while(1){
if(c[i][k] > c[j][k]){
return 1;
}
if(c[i][k] < c[j][k]){
return 0;
}
if(k == l){
return 0;
}
k++;
}
}
void downheap(int i,int j){
int p = i,q;
while(1){
q = 2 * p + 1;
if(q > j){
break;
}
if(q != j){
if(comp(q + 1,q) == 1){
q++;
}
}
if(comp(p,q) == 1){
break;
}else{
swap(p,q);
}
p = q;
}
}
void swap(int i,int j){
char p;
int q;
for(q = 0;q < l;q++){
p = c[i][q]; c[i][q] = c[j][q]; c[j][q] = p;
}
return;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int sort_strings(int N, int L, char String[128][128]) {
//int sort_strings(int N, int L, char **String) {
int i, j;
int sorted;
char *temp;
char a[128];
sorted = 0;
while(sorted < N - 1) {
sorted = 0;
for(i = 0; i < N - 1; i += 1) {
for(j = 0; j < L; j += 1) {
if(String[i][j] > String[i + 1][j]) {
//switch
sprintf(a, "%s", String[i]);
sprintf(String[i], "%s", String[i + 1]);
sprintf(String[i + 1], "%s", a);
break;
} else if(String[i][j] == String[i + 1][j]) {
if(j == L - 1) {
sorted += 1;
}
continue;
} else {
sorted += 1;
break;
}
}
}
}
return 0;
}
int main(void) {
int i;
int N, L;
char String[128][128];
char result[16384];
char buf[128], *ch;
fgets(buf, sizeof(buf), stdin);
ch = strtok(buf, " ");
N = atoi(ch);
ch = strtok(NULL, " ");
L = atoi(ch);
for(i = 0; i < N; i += 1) {
String[i][0] = '0';
}
for(i = 0; i < N; i += 1) {
fgets(buf, sizeof(buf), stdin);
sprintf(String[i], "%s", strtok(buf, " "));
}
sort_strings(N, L, String);
for(i = 0; i < N; i += 1) {
sprintf(&(result[i * L]), "%s", String[i]);
}
printf("%s\n", result);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#define REP(i,n) for(i=0;i<n;i++)
//prototype declaration
int iin();
long long llin();
double din();
char cin();
void stin(char *s);
void iout(int i);
void llout(long long i);
void dout(double i);
void cout(char c);
void stout(char *s);
int gcd(int a, int b);
int lcm(int a, int b);
long long llgcd(long long a, long long b);
long long lllcm(long long a, long long b);
int asc(const void *a, const void *b);
int desc(const void *a, const void *b);
double to_deg(double rad);
//main function
int main() {
int N = iin(), L = iin();
char s[N][L];
int index[N];
int i, j, k;
REP(i,N) {
index[i] = i;
stin(s[i]);
}
for (i = 0; i < N; i++) {
for (j = i + 1; j < N; j++) {
if (strcmp(s[index[i]], s[index[j]]) > 0) {
// printf("i = %d, j = %d\n", i, j);
k = index[i];
index[i] = index[j];
index[j] = k;
}
}
}
REP(i,N) {
// printf("index = %d\n", index[i]);
REP(j,L) {
printf("%c", s[index[i]][j]);
}
}
printf("\n");
return 0;
}
//body function
int iin() {
int i;
scanf("%d", &i);
return i;
}
long long llin() {
long long i;
scanf("%lld", &i);
return i;
}
double din() {
double i;
scanf("%lf", &i);
return i;
}
char cin() {
char c;
scanf("%c", &c);
return c;
}
void stin(char *s) {
scanf("%s", s);
}
void iout(int i) {
printf("%d\n", i);
}
void llout(long long i) {
printf("%lld\n", i);
}
void dout(double i) {
printf("%lf\n", i);
}
void cout(char c) {
printf("%c\n", c);
}
void stout(char *s) {
printf("%s\n", s);
}
/*
int型の最大公約数
*/
int gcd(int a, int b) {
int r;
if (a < b) {
r = a;
a = b;
b = r;
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
/*
int型の最小公倍数
*/
int lcm(int a, int b) {
int r = llgcd(a, b);
a /= r;
return a * b;
}
/*
long long型の最大公約数
*/
long long llgcd(long long a, long long b) {
long long r;
if (a < b) {
r = a;
a = b;
b = r;
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
/*
long long型の最小公倍数
*/
long long lllcm(long long a, long long b) {
long long r = llgcd(a, b);
a /= r;
return a * b;
}
/*
int型の昇順用比較関数
*/
int asc(const void *a, const void *b) {
return *(int *)a - *(int *)b;
}
/*
int型の降順用比較関数
*/
int desc(const void *a, const void *b) {
return *(int *)b - *(int *)a;
}
/*
弧度法を度数法に
*/
double to_deg(double rad) {
return rad * 180.0 / (atan(1.0) * 4.0);
}
|
#include<stdio.h>
int main(){
int N,K,i,j,n;
scanf("%d %d",&N,&K);
int D[K];
for(i=0;i<K;i++)scanf("%d",&D[i]);
for(i=N;1;i++){
j=i;
while(j!=0){
for(n=0;n<K;n++){
if(j%10==D[n])break;
}
if(j%10==D[n])break;
j/=10;
}
if(j==0)break;
}
printf("%d",i);
return 0;
} |
#include<stdio.h>
int d[10]={0};
int han(int k){
int a;
while(k>0){
a=k%10;
if(d[a]==1) return 0;
k/=10;
}
return 1;
}
int main(){
int n,k,i;
scanf("%d%d",&n,&k);
for(int j=1;j<=k;j++){
scanf("%d",&i);
d[i]=1;
}
for(int j=n;;j++){
if(han(j)==1){
printf("%d",j);
return 0;
}
}
} |
#include <stdio.h>
int main(void)
{
const int N, K;
scanf("%d %d", &N, &K);
int no[10] = {0};
for(int i = 0; i < K; i++){
int d;
scanf("%d", &d);
no[d] = 1;
}
int i = N;
for(; i <= 10*N; i++){
int j = i;
while(j > 0 && !no[j%10]) j /= 10;
if(!j) break;
}
printf("%d", i);
return 0;
}
|
#include<stdio.h>
int n,ans=100000;
int ok[10]={0};
void dfs(int a){
if(a>=n){
ans=ans>a?a:ans;
return;
}
for(int i=0;i<=9;i++){
if(a==0&&i==0)continue;
if(ok[i]==0) dfs(a*10+i);
}
return;
}
int main(){
int k,i;
scanf("%d%d",&n,&k);
for(int j=1;j<=k;j++){
scanf("%d",&i);
ok[i]=1;
}
dfs(0);
printf("%d\n",ans);
return 0;
} |
#include <stdio.h>
#include <math.h>
int main(void){
char s[111],t[111],u[111];
int n,m,k,i,j,d[110],jd[110]={0};
scanf("%d%d",&n,&k);
for(i=0;i<k;i++){
scanf("%d",&d[i]);
jd[d[i]]=1;
}
for(i=n;i<=10*n;i++){
int j=i;
while(j>0){
if(jd[j%10]) break;
j/=10;
}
if(j<=0){
printf("%d\n",i);
return 0;
}
}
return 0;
} |
#include <stdbool.h>
#include <stdio.h>
int com(int n, int k, int* d) {
while (n > 0) {
for (int i = 0;i<k;i++) {
if (n % 10 == d[i]) {
return false;
}
}
n /= 10;
}
return true;
}
int main() {
int n, k, d[10];
scanf("%d%d", &n, &k);
for (int i = 0;i < k;i++) {
scanf("%d", &d[i]);
}
for (int i = n;;i++) {
if (com(i, k, &d[0])) {
printf("%d\n", i);
break;
}
}
} |
#include <stdio.h>
int min=100000;
int N, K;
int D[11];
int TMP;
void f(int m,int L){
if(L>5) return;
if(N<=m){
if(min>m){
min=m;
return;
}
}
for(int i=0;i<10;i++){
if(D[i]!=0)
continue;
TMP=i;
for(int j=0;j<L;j++)
TMP*=10;
f(m+TMP,L+1);
}
return;
}
int main(){
scanf("%d %d\n",&N,&K);
for(int i=0;i<K;i++){
scanf("%d",&TMP);
D[TMP]=1;
}
f(0,0);
printf("%d\n",min);
return 0;
} |
#include<stdio.h>
int main(){
int a[11],i,j,n,k,s,t=0,u=1;
int b[10];
a[0]=0;
scanf("%d %d",&n,&k);
for(i=0;i<10;i++)b[i]=1;
for(i=0;i<k;i++){scanf("%d",&s);b[s]=0;}
for(i=0;i<10;i++)if(b[i]){a[u]=i;u++;}
k=10-k;
for(i=0;i<5;i++)b[i]=0;
while(1){
t=a[b[0]]+a[b[1]]*10+a[b[2]]*100+a[b[3]]*1000+a[b[4]]*10000;
if(t>=n){printf("%d",t);return 0;}
b[0]+=1;
for(i=0;i<5;i++)if(b[i]>k){b[i]=1;b[i+1]++;}
}
} |
#include <math.h>
#define Rep(i,a,n)for(int i=(int)(a);i<(int)(n);i++)
#define rep(i,n)Rep(i,0,n)
#define Ma(x,y)(x>y?x:y)
int main(){
int n,k,t,all[6]={0},d[10]={0};
scanf("%d%d",&n,&k);
rep(i,k){scanf("%d",&t);d[t]++;}
if(n==1&&d[1]!=1){printf("1");return 0;}
t++;
Rep(i,2<n?n:2,1e5){
rep(j,log10(i)+1){
all[j]=(i%(int)pow(10,j+1))/(int)pow(10,j);
rep(x,10)if(d[all[j]])t=0;
}
if(t){printf("%d",i);return 0;}
t++;
}
} |
#include <stdio.h>
int Check(int N, int K, int D[K]){
int i, c;
while(N != 0){
c = N % 10;
for(i = 0;i < K;i++) if(c == D[i]) return 1;
N /= 10;
}
return 0;
}
void Do(int N, int K){
int i;
int D[K];
for(i = 0;i < K;i++) scanf("%d", &D[i]);
while(1){
if(Check(N, K, D) == 0){
printf("%d\n", N);
return;
}
N++;
}
}
int main(void){
int N, K;
scanf("%d %d", &N, &K);
Do(N, K);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(void){
int i=0, num[10], N, K, temp, flag = 1;
scanf("%d %d", &N, &K);
int d[K+1];
for(i=0; i<N; i++){
scanf("%d", &d[i]);
}
i = 0;
while(flag == 1){
flag = 0;
temp = N+i;
while(temp != 0 && flag == 0){
for(int k=0; k<K; k++){
if(d[k] == temp % 10){flag = 1;break;}
}
if(flag == 1) break;
temp = temp / 10;
}
i++;
}
printf("%d", N+i-1);
return 0;
} |
#include <stdio.h>
#define KIRAI 9
int money(int k, int D[], int payment);
int main(void){
int k,D[KIRAI]={},n,i,payment;
scanf("%d %d", &n, &k);
for(i=0;i<k;i++){scanf("%d", &D[i]);}
for(payment=n ;; payment++){
if(money(k,D,payment)==1){
break;
}
}
printf("%d\n",payment);
return 0;
}
int money(int k, int D[], int payment){
int keta,i;
while(payment>0){
keta=payment%10;
for(i=0;i<k;i++){
if(D[i]==keta){return 0;}
}
payment/=10;
}
return 1;
} |
#include <stdio.h>
#include <math.h>
int main(void){
int N, K, D[10], fase[6], keta=0, kane=0;
scanf("%d%d", &N, &K);
for(int i=0; i<K; i++) scanf("%d", &D[i]);
kane = N;
for(;N;N/=10){
fase[keta] = N%10;
for(int i=0; i<K; i++){
if(fase[keta]==D[i]) {
kane++;
N = 10*kane;
keta=-1;
break;
}
}
keta++;
}
printf("%d", kane);
return 0;
} |
#include <stdio.h>
int N, K;
int C[10], D;
int a[] = {10000, 1000, 100, 10, 1};
int ans;
void func(int L, int num)
{
int i;
if (ans != 0) return;
if (L >= 5)
{
if (num >= N) ans = num;
return;
}
if (N / a[L] == 0) func(L + 1, 0);
for (i = 0; i < 10; ++i)
{
if (C[i]) continue;
func(L + 1, num * 10 + i);
}
}
int main(void)
{
int i;
scanf("%d %d", &N, &K);
for (i = 0; i < K; ++i)
{
scanf("%d", &D);
C[D]++;
}
func(0, 0);
printf("%d\n", ans);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
int n,k,d,D[10];
int i,j;
scanf("%d %d",&n,&k);
for (i = 0; i < k; i++)
{
scanf("%d",&d);
D[d] = 1;
}
char ans[10];
int len;
while (1)
{
snprintf(ans,10,"%d",n);
len = strlen(ans);
for (i = 0; i < len; i++)
{
if(D[ans[i] - '0'] == 1)break;
}
if(i == len)break;
n++;
}
printf("%d",n);
}
|
#include <stdio.h>
int main(void)
{
int k, n, d[10], i, cnt=0, tmp, j, ans;
scanf("%d%d", &n, &k);
for(i=0;i<k;i++){
scanf("%d", &d[i]);
}
ans=n;
while(1){
tmp=ans;
while(tmp>0){
cnt=0;
j=tmp%10;
for(i=0;i<k;i++){
if(j==d[i]) break;
cnt++;
}
if(cnt==k) tmp=tmp/10;
else break;
}
if(tmp==0) break;
ans++;
}
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
int N, K;
int i;
int Dmask = 0;
int asumikana;
if (scanf("%d%d", &N, &K) != 2) return 1;
for (i = 0; i < K; i++) {
int D;
if (scanf("%d", &D) != 1) return 1;
Dmask |= 1 << D;
}
asumikana = N;
for (;;) {
int kitamuraeri = asumikana;
int ng = 0;
while (kitamuraeri > 0) {
if (Dmask & (1 << (kitamuraeri % 10))) {
ng = 1;
break;
}
kitamuraeri /= 10;
}
if (!ng) break;
asumikana++;
}
printf("%d\n", asumikana);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char N[4];
int flag, i, j, K, M, P=0, S, T, U;
scanf("%[0-9] %d%*c", &N, &K);
char D[K], *ptr;
for (i=0;i<K;i++) {
scanf("%[0-9]%*c", &D[i]);
}
char Di[4];
T = atoi(N);
while (1) {
flag = 0;
U = T;
for (i=4;i>=0;i--) {
Di[i] = U%10;
U /= 10;
if (!U) break;
}
for (;i<5;i++) {
if ((ptr = memchr(D, Di[i]+48, K)) != NULL) flag += 1;
}
if (!flag) break;
T++;
}
printf("%d\n", T);
return 0;
}
|
#include<stdio.h>
int main(void)
{
int n,k;
scanf("%d %d",&n,&k);
int d[20];
int count=0;
for(int i=0;i<k;i++){
scanf("%d",&d[i]);
}
int len=0;
int another_n=n;
while(another_n>0){
another_n/=10;
len++;
}
for(int i=n;i<100000;i++){
int tmp=i;
count=0;
while(tmp!=0){
for(int j=0;j<k;j++){
//printf("%d\n",i%10);
if(tmp%10==d[j]){
count++;
}
}
tmp/=10;
}
if(count==0){
printf("%d\n",i);
return 0;
}
}
return 0;
}
|
#include<stdio.h>
int main(){
int no=0,n,k,i,j,l,len,defalt;//n=金額,k=嫌いな数字の個数,i=for文用,j=for文用,
scanf("%d %d",&n,&k);
int d[k];
for(i=0;i<k;++i){
scanf("%d",&d[i]);
}
for(i=n;i>-1;i++){
defalt=i;
len=0;
//桁数計算
while(i>0.9){
i/=10;
len++;
}
len-=1;
i=defalt;
for(l=0;l<=len;l++){
for(j=0;j<k;j++){
if(i%10==d[j]){
no=1;
}
}
i/=10;
}
i=defalt;
if(no==0){
printf("%d",i);
return 0;
} else {
no=0;
}
}
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
int main()
{
int N,K,*D;
int m[5],tmp,con=0,flag=0,i=0,j=0;
scanf("%d %d",&N,&K);
D=(int*)malloc(sizeof(int)*K);
for(i=0;i<K;i++)
scanf("%d",&D[i]);
while(flag==0){
i=0,j=0;
con=0;
for(i=1;i<=10000;i*=10){
tmp=N/i;
if(tmp==0) break;
m[con]=tmp%10;
con++;
}
for(i=0;i<con;i++){
for(j=0;j<K;j++){
if(m[i]==D[j]){
N++;
break;
}
}
if(j!=K) break;
}
if(i==con&&j==K) flag=1;
}
printf("%d",N);
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
int search(int d,int* arr,int k){
int flag=0;
for(int i=0;i<k;i++){
if(d==arr[i]){
flag=1;
break ;
}
}
return flag;
}
int main(){
int n,k;
scanf("%d %d\n",&n,&k);
int arr[k];
int i;
for(i=0;i<k;i++){
scanf("%d ",&arr[i]);
}
int t=n;
int g,d,m=1;
while(m!=0){
g=t;
while(g!=0){
d=g%10;
m= search(d,&arr,k);
if(m==1){
break;
}
g=g/10;
}
if(m==0){
printf("%d\n",t);
exit(0);
}
else t++;
}
printf("-1");
return ;
} |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main() {
int N=0,K=0;
int D_num[10]={0};
char D[10]={'\0'};
char N_str[8]={'\0'};
int flag=0;
scanf("%d %d\n",&N,&K);
for(int i=0;i<K;i++) scanf("%d",&D_num[i]);
for(int i=0;i<K;i++) sprintf(&D[i],"%c",('0'+D_num[i]));
for(int i=N;i<100001;i++){
sprintf(N_str,"%d",i);
flag=0;
for(int j=0;N_str[j]!='\0';j++){
for(int k=0;k<K;k++){
if(N_str[j]==D[k]){
flag=1;
break;
}
}
if(flag==1) break;
}
if(flag==0) break;
}
printf("%s\n",N_str);
return 0;
} |
#include <stdio.h>
int main(void){
int N,K,i,k,l,num,dig;
int j=0,flag=0;
scanf("%d %d",&N,&K);
int A[K+1];
for(i=0;i<K;i++){
scanf("%d",&A[i]);
}
int D[5];
for(i=N;i<=100000;i++){
num=i;
while(num){
dig = num % 10;
D[j]=dig;
num = num / 10;
j++;
}
D[j]=100;
j=0;
//printf("%d%d%d%d%d\n",D[0],D[1],D[2],D[3],D[4]);
for(k=0;k<K;k++){
for(l=0;l<6;l++){
if(A[k]==D[l])flag=1;
}
}
if(flag==0)break;
flag=0;
}
printf("%d\n",i);
return 0;
}
|
#include <stdio.h>
#define true 1
#define false 0
int main(void){
int n=0,k=0;
int temp=0;
int flag=false;
int array[10]={0};
int count=0;
scanf("%d %d",&n,&k);
for(int i=0;i<k;i++){
scanf("%d",&temp);
array[temp]=1;
}
for(int i=n;i<100000;i++){
temp=i;
flag=true;
while(temp>0){
if(array[temp%10]==true){
flag=false;
break;
}
temp/=10;
}
if(flag==true){
count=i;
break;
}
}
printf("%d",count);
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <inttypes.h>
#include <stdbool.h>
bool contain(uint32_t n, const char *d)
{
char s[6];
for (; *d != '\0'; ++d) {
snprintf(s, sizeof(s), "%" PRIu32, n);
if (strchr(s, *d) != NULL) {
return true;
}
}
return false;
}
int main(void)
{
uint32_t n, k;
char d[10] = "";
scanf("%" SCNu32 " %" SCNu32, &n, &k);
for (uint32_t j = 0; j < k; ++j) {
char s[2];
scanf("%s", s);
strcat(d, s);
}
while (contain(n, d)) {
++n;
}
printf("%" PRIu32 "\n", n);
return 0;
}
|
#include <stdio.h>
#include <stdbool.h>
int n; /* 商品の金額 */
int k; /* 嫌いな数字の個数を指定 */
int k_array[10]; /* 嫌いな数を指定する */
bool num_chcek(int n){
while(n > 0){ /* 0より大きい間ループ */
for(int i = 0; i < k; i++){
if(n%10 == k_array[i]){ /* n/10の剰余 */
return false; /* 0 */
}
}
n /= 10; /* 桁ずらし */
}
return true; /* 1 */
}
int main(){
scanf("%d%d",&n,&k);
for(int i = 0;i < k; i++){
scanf("%d",&k_array[i]);
}
for(int i = n;;i++){
if(num_chcek(i)){ /* trueなら出力 */
printf("%d\n",i);
break;
}
}
} |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#define Rep(i,a,n)for(int i=(int)(a);i<(int)(n);i++)
#define rep(i,n)Rep(i,0,n)
typedef long long lld;
typedef long double Lf;
#define Ma(x,y) ((x)>(y)?(x):(y))
#define mi(x,y) ((x)<(y)?(x):(y))
int main() {
int n, k, t, all[6] = { 0 }, d[10] = { 0 };
scanf("%d%d", &n, &k);
rep(i, k) { scanf("%d", &t); d[t]++; }
if (n == 1 && d[1] != 1) { printf("1"); return 0; }
t++;
Rep(i, 2 < n ? n : 2, 1e9) {
rep(j, log10(i) + 1) {
all[j] = (i % (int)pow(10, j + 1)) / (int)pow(10, j);
rep(x, 10)if (d[all[j]])t = 0;
}
if (t) { printf("%d", i); return 0; }
t++;
}
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
int main(void){
int n,k;
scanf("%d%d",&n,&k);
int d[k];
for (int i=0; i<k; i++){
scanf("%d",&d[i]);
}
for (int i=0; i<k; i++){
if(n%10==d[i]){
n++;
i=-1;
} else if (n>=10 && (n/10)%10==d[i]) {
n++;
i=-1;
} else if (n>=100 && (n/100)%10==d[i]){
n++;
i=-1;
} else if (n>=1000 && (n/1000)%10==d[i]){
n++;
i=-1;
} else if (n>=10000 && (n/10000)%10==d[i]){
n++;
i=-1;
}
}
printf("%d\n",n);
return 0 ;
} |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int i, N, K, D[10];
scanf("%d %d", &N, &K);
for (i = 1; i <= K; i++) scanf("%d", &(D[i]));
int pay = N, d, digit[5] = {N % 10, N / 10 % 10, N / 100 % 10, N / 1000 % 10}, forbid[10] = {};
for (i = 1; i <= K; i++) forbid[D[i]] = 1;
for (d = 4; digit[d] == 0; d--);
while (1) {
for (i = 0; i <= d; i++) if (forbid[digit[i]] == 1) break;
if (i > d) break;
for (i = 0; i <= d; i++) if (digit[i] < 9) break;
if (i <= d) {
for (digit[i--]++; i >= 0; digit[i--] = 0);
} else {
digit[++d] = 1;
for (i--; i >= 0; digit[i--] = 0);
}
for (i = d, pay = 0; i >= 0; i--) pay = pay * 10 + digit[i];
}
printf("%d\n", pay);
fflush(stdout);
return 0;
} |
#include <stdio.h>
int Num[11];
int N, K;
int Flag;
int Min;
void DFS(int d, int s);
int main(void) {
int i, tmp, m, min;
Min = 987654321;
scanf("%d %d", &N, &K);
for (i = 0; i < 10; i++) {
scanf("%d", &tmp);
Num[tmp] = 1;
}
for (m = 1; Num[m]; m++);
if (Num[0] == 0) min = m * 10000;
else min = (m * 10000) + (m * 1000) + (m * 100) + (m * 10) + m;
DFS(1, 0);
if (Min != 987654321) printf("%d\n", Min);
else printf("%d\n", min);
return 0;
}
void DFS(int d, int s) {
int i;
if (Flag || s >= Min || d > 4) return;
s *= 10;
for (i = 0; i < 10; i++)
{
if (Num[i]) continue;
s += i;
if (s == N) { Flag = 1; Min = s; return; }
else if (s > N && s < Min) Min = s;
DFS(d + 1, s);
s -= i;
}
} |
#include<stdio.h>
int main(){
int n,i,num[5],k,flag,j,d[9];
scanf("%d %d",&n,&k);
for(i=0;i<k;i++)
scanf("%d",&d[i]);
for(i=n;i<=10*n;i++){
flag=1;
if(i>=10000){
num[4]=i/10000%10;
for(j=0;j<k;j++)
if(num[4]==d[j])
flag=0;
}
if(i>=1000){
num[3]=i/1000%10;
for(j=0;j<k;j++)
if(num[3]==d[j])
flag=0;
}
if(i>=100){
num[2]=i/100%10;
for(j=0;j<k;j++)
if(num[2]==d[j])
flag=0;
}
if(i>=10){
num[1]=i/10%10;
for(j=0;j<k;j++)
if(num[1]==d[j])
flag=0;
}
num[0]=i%10;
for(j=0;j<k;j++)
if(num[0]==d[j])
flag=0;
if(flag){
printf("%d\n",i);
break;
}
}
} |
#include <stdio.h>
int chk[10];
int nums[] = {1, 10, 100, 1000, 10000};
int possibleNum[10];
int N;
int K;
int jari;
int idx;
int min = 0x7fff0000;
void DFS(int L, int num)
{
int i;
if (L > jari)
{
if (num >= N && num < min) min = num;
if (num % nums[jari] >= N && num % nums[jari] < min) min = num % nums[jari];
return;
}
for (i = 0; i < idx; i++)
{
DFS(L + 1, num + possibleNum[i] * nums[L]);
}
}
void input(void)
{
int i;
int num;
scanf("%d %d", &N, &K);
for (i = 0; i < K; i++)
{
scanf("%d", &num);
chk[num] = 1;
}
for (i = 0; i < 10; i++)
{
if (chk[i]) continue;
possibleNum[idx++] = i;
}
num = N;
while(num)
{
jari++;
num /= 10;
}
}
int main(void)
{
input();
DFS(0, 0);
printf("%d\n", min);
return 0;
}
|
#include <stdio.h>
int Obsession(int num,int d[],int k){
int c;
for(c=0;c<k;c++){
if(num == d[c]){
return 1;
}
}
return 0;
}
int main(void){
int n,k,h,i,j,l,m,res;
int d[10];
scanf("%d %d",&n,&k);
for(i=0;i<k;i++){
scanf("%d",&d[i]);
}
for(h=0;h<10;h++){
for(i=0;i<10;i++){
for(j=0;j<10;j++){
for(l=0;l<10;l++){
for(m=0;m<10;m++){
if(Obsession(m,d,k)==1)continue;
res = m;
if(res>=n){
printf("%d\n",res);
return 0;
}
if(Obsession(l,d,k)==1)continue;
res += 10*l;
if(res>=n){
printf("%d\n",res);
return 0;
}
if(Obsession(j,d,k)==1)continue;
res += 100*j;
if(res>=n){
printf("%d\n",res);
return 0;
}
if(Obsession(i,d,k)==1)continue;
res += 1000*i;
if(res>=n){
printf("%d\n",res);
return 0;
}
if(Obsession(h,d,k)==1)continue;
res += 10000*h;
if(res>=n){
printf("%d\n",res);
return 0;
}
}
}
}
}
}
return 0;
} |
#include <stdio.h>
int N, K;
int Dis[11];
int Divider[5] = {10000, 1000, 100, 10, 1};
int main(void)
{
int i, tmp, min, max, min_not_zero;
int cnt = 1;
int flag = 0;
int idx = 0;
scanf("%d %d", &N, &K);
for (i = 0; i < K; i++)
{
scanf("%d", &tmp);
Dis[tmp] = 1;
}
tmp = N;
while (tmp /= 10) {
cnt++;
}
while (Dis[idx++]);
min = idx - 1;
idx = 1;
while (Dis[idx++]);
min_not_zero = idx - 1;
idx = 9;
while (Dis[idx--]);
max = idx + 1;
for (i = (4 - cnt) + 1; i <= 4; i++) tmp += (max * Divider[i]);
if (tmp < N)
{
tmp = min_not_zero * Divider[4-cnt];
for (i = (4 - cnt) + 1; i <= 4; i++)
{
tmp += min * Divider[i];
}
printf("%d\n", tmp);
return 0;
}
for (i = (4 - cnt) + 1; i <= 4; i++)
{
idx = 0;
if (flag) {printf("%d", min); continue;}
tmp = (N / Divider[i]) % 10;
while (Dis[tmp + idx++]);
idx--;
if (idx >= 1)
{
flag = 1;
Divider[i] = tmp + idx;
}
else Divider[i] = tmp;
if (Divider[i] == 10 && i != (4-cnt)) Divider[i] = 0;
printf("%d", Divider[i]);
}
printf("\n");
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int n,k;
int d[10];
char str[32];
int i;
char *p;
int cnt = 0;
int chk;
int dchk;
int ng;
int num;
int ddd;
p = fgets(str, 32, stdin);
for(i=0;i<32;i++){
if(str[i] == ' '){
str[i] = '\0';
n = atoi(str);
k = atoi(&str[i+1]);
break;
}
}
p = fgets(str, 32, stdin);
for(i=0;i<32;i++){
if(str[i] == ' '){
str[i] = '\0';
d[cnt++] = atoi(p);
p = &str[i + 1];
}
}
d[cnt] = atoi(p);
for(chk=n;;chk++) {
ng = 0;
num = chk;
i = 0;
while(num!=0){
ddd = num % 10;
num = num / 10;
for(dchk=0;dchk < k;dchk++) {
if(ddd == d[dchk]) {
ng = 1;
break;
}
}
if(ng) {
break;
}
}
if(!ng) {
break;
}
}
printf("%d\n", chk);
return 0;
}
|
#include <stdio.h>
#include<stdlib.h>
#include<string.h>
int N,K;
int *D;
void input(){
int i;
scanf("%d%d",&N,&K);
D=(int*)malloc(K);
for(i=0;i<K; i++) scanf("%d", &D[i]);
}
int judgement(int x){
int i, j=0;
for(i=0;i<K;i++){
if(x==D[i]) j=1;
}
if(j==1) return 0;
else return 1;
}
int main(){
int a[5];
int judge[5];
int pay;
int i;
input();
pay=N;
while(1){
a[4]=pay/10000, a[3]=(pay-a[4]*10000)/1000, a[2]=(pay-a[4]*10000-a[3]*1000)/100;
a[1]=(pay-a[4]*10000-a[3]*1000-a[2]*100)/10, a[0]=pay-a[4]*10000-a[3]*1000-a[2]*100-a[1]*10;
if(pay>=1e4){
for(i=0;i<5;i++) judge[i]=judgement(a[i]);
}else if(pay>=1e3){
for(i=0;i<4;i++) judge[i]=judgement(a[i]);
judge[4]=1;
}else if(pay>=1e2){
for(i=0;i<3;i++) judge[i]=judgement(a[i]);
judge[4]=1, judge[3]=1;
}else if(pay>=10){
for(i=0;i<2;i++) judge[i]=judgement(a[i]);
judge[4]=1, judge[3]=1,judge[2]=1;
}else{
for(i=0;i<1;i++) judge[i]=judgement(a[i]);
judge[4]=1, judge[3]=1,judge[2]=1,judge[1]=1;
}
if(judge[0]==0||judge[1]==0||judge[2]==0||judge[3]==0||judge[4]==0) pay++;
else break;
}
printf("%d\n", pay);
return 0;
} |
#include <stdio.h>
int main(void) {
int n,k,d;
scanf("%d %d", &n, &k);
int number_list[10];
for (int i = 0; i < 10; i++) {
number_list[i] = 0;
}
for (int i = 0; i < k; i++) {
scanf("%d", &d);
number_list[d]++;
}
int smallest;
for (int i = 0; i < 10; i++) {
if (number_list[i] == 0) {
smallest = i;
break;
}
}
int price = n;
int digits = 0;
while (price > 0) {
price /= 10;
digits++;
}
price = n;
int pay[digits+1];
pay[digits] = 0;
for (int i = 0; i < digits; i++) {
pay[i] = price%10;
price /= 10;
}
for (int i = digits-1; i >= 0; i--) {
if (number_list[pay[i]] == 1) {
for (int j = 0; j < i; j++) {
pay[j] = smallest;
}
while (number_list[pay[i]] == 1) {
if (pay[i] == 9) {
pay[i] = 0;
pay[i+1]++;
} else {
pay[i]++;
}
}
for (int j = i+1; j < digits; j++) {
while (number_list[pay[j]] == 1) {
if (pay[j] == 9) {
pay[j] = 0;
pay[j+1]++;
} else {
pay[j]++;
}
}
}
break;
}
}
if (pay[digits] != 0) {
while (number_list[pay[digits]] == 1) {
pay[digits]++;
}
}
int answer = 0;
for (int i = digits; i >= 0; i--) {
answer *= 10;
answer += pay[i];
}
printf("%d\n", answer);
return 0;
} |
#include <stdio.h>
int next_like(int a, int *likes){
int i;
for(i = a; i < 10; i++){
if(likes[i] != -1){
return i;
}
}
return -1;
}
int carry(int i, int *Ns, int *likes, int k){
if(i == k){
Ns[i] = next_like(1, likes);
return k + 1;
}
else{
if(next_like(Ns[i] + 1, likes) > Ns[i]){
Ns[i] = next_like(Ns[i] + 1, likes);
return k;
}
else{
Ns[i] = next_like(0, likes);
return carry(i + 1, Ns, likes, k);
}
}
}
int make_answer(int i, int *Ns, int *likes, int overflag, int k){
if(overflag == 1){
Ns[i] = next_like(0, likes);
if(i == 0){
return k;
}
else{
return make_answer(i - 1, Ns, likes, 1, k);
}
}
if(overflag == 0){
if(next_like(Ns[i], likes) > Ns[i]){
Ns[i] = next_like(Ns[i], likes);
if(i == 0){
return k;
}
else{
return make_answer(i - 1, Ns, likes, 1, k);
}
}
if(next_like(Ns[i], likes) == Ns[i]){
if(i == 0){
return k;
}
else{
return make_answer(i - 1, Ns, likes, 0, k);
}
}
if(next_like(Ns[i], likes) == -1){
int l = make_answer(i, Ns, likes, 1, k);
return carry(i + 1, Ns, likes, k);
}
}
}
int main(){
int N, K, D, i, k, min, likes[10] = {0, 1, 2, 3, 4, 5 ,6 ,7 ,8, 9};
scanf("%d%d", &N, &K);
for(i = 0; i < K; i++){
scanf("%d", &D);
likes[D] = -1;
}
int Ns[6];
for(k = 0; N != 0; k++, N /= 10){
Ns[k] = N % 10;
}
k = make_answer(k - 1, &Ns[0], &likes[0], 0, k);
int ans = 0;
for(i = k - 1; i >= 0; i--){
ans = 10 * ans + Ns[i];
}
printf("%d\n", ans);
return 0;
} |
#include <stdio.h>
int tenthousand(int price);
int thousand(int price);
int hundred(int price);
int ten(int price);
int main(void)
{
int n,k,i,j,price,tenth,th,hu,te,on,judge = 0;
int d[10];
scanf("%d %d",&n,&k);
for(i = 0;i < k;i++)
scanf("%d",&d[i]);
// printf("n = %d,k = %d\n",n,k);
//for(i = 0;i < k;i++)
// printf("dislike:%d\n",d[i]);
for(price = n;;price++)
{
tenth = tenthousand(price);
th = thousand(price - tenth * 10000);
hu = hundred(price - tenth*10000 - th * 1000);
te = ten(price - tenth * 10000 - th * 1000 - hu * 100);
on = price - tenth *10000 - th *1000 - hu * 100 - te * 10;
// printf("%d %d %d %d %d\n",tenth,th,hu,te,on);
//printf("start :judge = %d\n",judge);
if(tenth != 0)
for(j = 0;j < k;j++)
if(d[j] == tenth)
{
judge = 1;
break;
}
//printf("tenthousand:judge = %d\n",judge);
if( (judge == 0) && (tenth + th != 0) )
for(j = 0;j < k;j++)
if(d[j] == th)
{
judge = 1;
break;
}
//printf("thousand :judge = %d\n",judge);
if( (judge == 0) && (tenth + th + hu != 0) )
for(j = 0;j < k;j++)
if(d[j] == hu)
{
judge = 1;
break;
}
// printf("hundred :judge = %d\n",judge);
if( (judge == 0) && (tenth + th + hu + te != 0) )
for(j = 0;j < k;j++)
if(d[j] == te)
{
judge = 1;
break;
}
// printf("ten :judge = %d\n",judge);
if(judge == 0)
for(j = 0;j < k;j++)
if(d[j] == on)
{
judge = 1;
break;
}
// printf("one :judge = %d\n",judge);
if(judge == 0)
{
printf("%d\n",price);
break;
}
else if(judge == 1)
judge = 0;
}
return 0;
}
int tenthousand(int price)
{
int i;
for(i = 0;;i++)
if(price - i * 10000 < 0)
break;
return i - 1;
}
int thousand(int price)
{
int i;
for(i = 0;;i++)
if(price - i * 1000 < 0)
break;
return i - 1;
}
int hundred(int price)
{
int i;
for(i = 0;;i++)
if(price - i * 100 < 0)
break;
return i - 1;
}
int ten(int price)
{
int i;
for(i = 0;;i++)
if(price - i * 10 < 0)
break;
return i - 1;
}
|
#include <stdio.h>
int main(){
int a,n,k,i,ii,flag;
scanf("%d %d",&n,&k);
int d[9] ;
for(i = 0;i < 9;i++)
d[i] = 999;
int m = 0;
int t = n / 1000;
n = n % 1000;
int h = n / 100;
n = n % 100;
int z = n / 10;
n = n % 10;
int o = n ;
int gm = m;
int gt = t;
int gh = h;
int gz = z;
int r = 1;
for(i = 0;i < k;i++)
scanf("%d",&d[i]);
for(a = 0;a < k;a++){
for(i = 0;i < k;i++){
while(r == 1){
for(ii = 0;ii < k;ii++){
if(o == d[ii]){
o += 1;
if(o == 10){
o = 0;
z += 1;
}
r = 0;
break;
}
r = 2;
}
}
if(r == 2)
break;
if(o == d[i]){
o += 1;
r = 1;
}
}
}
r = 1;
if(z >= 1){for(a = 0;a < k;a++){
for(i = 0;i < k;i++){
if(z == 10){
z = 0;
h += 1;
}
while(r == 1){
for(ii = 0;ii < k;ii++){
if(z == d[ii]){
z += 1;
if(z == 10){
z = 0;
h += 1;
}
r = 0;
break;
}
r = 2;
}
}
if(r == 2)
break;
if(z == d[i]){
z += 1;
r = 1;
}
}
}
if(z != gz &&(d[0] != 0 && d[1] != 0 && d[2] != 0 && d[3] != 0 && d[4] != 0 && d[5] != 0 && d[6] != 0 && d[7] != 0 && d[8] != 0))
o = 0;
if(z != gz && o != 0 &&(d[0] != 1 && d[1] != 1&& d[2] != 1&& d[3] != 1&& d[4] != 1&& d[5] != 1 & d[6] != 1&& d[7] != 1&& d[8] != 1))
o = 1;
}
r = 1;
if(h >= 1){for(a = 0;a < k;a ++){
for(i = 0;i < k;i++){
if(h == 10){
h = 0;
t += 1;
}
while(r == 1){
for(ii = 0;ii < k;ii++){
if(h == d[ii]){
h += 1;
if(h == 10){
h = 0;
t += 1;
}
r = 0;
break;
}
r = 2;
}
}
if(r == 2)
break;
if(h == d[i]){
h += 1;
r = 1;
}
}
}
if(h != gh &&(d[0] != 0 && d[1] != 0 && d[2] != 0 && d[3] != 0 && d[4] != 0 && d[5] != 0 && d[6] != 0 && d[7] != 0 && d[8] != 0))
z = 0;
if(h != gh && z != 0 &&(d[0] != 1 && d[1] != 1&& d[2] != 1&& d[3] != 1&& d[4] != 1&& d[5] != 1 & d[6] != 1&& d[7] != 1&& d[8] != 1))
z = 1;
}
r = 1;
if(t >= 1){for(a = 0;a < k;a++){
for(i = 0;i < k;i++){
if(t == 10){
t = 0;
m += 1;
}
while(r == 1){
for(ii = 0;ii < k;ii++){
if(t == d[ii]){
t += 1;
if(t == 10){
t = 0;
m += 1;
}
r = 0;
break;
}
r = 2;
}
}
if(r == 2)
break;
if(t == d[i]){
t += 1;
r = 1;
}
}
}
if(t != gt &&(d[0] != 0 && d[1] != 0 && d[2] != 0 && d[3] != 0 && d[4] != 0 && d[5] != 0 && d[6] != 0 && d[7] != 0 && d[8] != 0))
h = 0;}
r = 1;
if(m >= 1){
for(a = 0;a < k;a++){
for(i = 0;i < k;i++){
while(r == 1){
for(ii = 0;ii < k;ii++){
if(m == d[ii]){
m += 1;
r = 0;
break;
}
r = 2;
}
}
if(r == 2)
break;
if(m == d[i]){
m += 1;
r = 1;
}
}
}
if(m != gm&&(d[0] != 0 && d[1] != 0 && d[2] != 0 && d[3] != 0 && d[4] != 0 && d[5] != 0 && d[6] != 0 && d[7] != 0 && d[8] != 0))
t = 0;}
printf("%d",m * 10000 + 1000 * t + 100 * h + 10 * z + 1 * o);
return 0;
} |
#include<stdio.h>
int main()
{
int N,K,D[11],i,s,E[11],a,b,c,d,e,T,p;
scanf("%d %d",&N,&K);
for(i=1;i<=K;i=i+1){scanf("%d ",&D[i]);}
s=0;
D[0]=0;
if(D[1]>=1){s=s+1;E[s]=0;}
for(i=0;i<=K;i=i+1)
{
if(D[i+1]-D[i]==2){s=s+1;E[s]=D[i]+1;}
if(D[i+1]-D[i]==3){s=s+2;E[s]=D[i]+2;E[s-1]=D[i]+1;}
if(D[i+1]-D[i]==4){s=s+3;E[s]=D[i]+3;E[s-1]=D[i]+2;E[s-2]=D[i]+1;}
if(D[i+1]-D[i]==5){s=s+4;E[s]=D[i]+4;E[s-1]=D[i]+3;E[s-2]=D[i]+2;E[s-3]=D[i]+1;}
if(D[i+1]-D[i]==6){s=s+5;E[s]=D[i]+5;E[s-1]=D[i]+4;E[s-2]=D[i]+3;E[s-3]=D[i]+2;E[s-4]=D[i]+1;}
if(D[i+1]-D[i]==7){s=s+6;E[s]=D[i]+6;E[s-1]=D[i]+5;E[s-2]=D[i]+4;E[s-3]=D[i]+3;E[s-4]=D[i]+2;
E[s-5]=D[i]+1;}
if(D[i+1]-D[i]==8){s=s+7;E[s]=D[i]+7;E[s-1]=D[i]+6;E[s-2]=D[i]+5;E[s-3]=D[i]+4;E[s-4]=D[i]+3;
E[s-5]=D[i]+2;E[s-6]=D[i]+1;}
if(D[i+1]-D[i]==9){s=s+8;E[s]=D[i]+8;E[s-1]=D[i]+7;E[s-2]=D[i]+7;E[s-3]=D[i]+6;E[s-4]=D[i]+4;
E[s-5]=D[i]+3;E[s-6]=D[i]+2;E[s-7]=D[i]+1;}
}
if(D[K]<9){s=s+9-D[K];for(p=0;p<9-D[K];p=p+1){E[s-p]=9-p;}}
if(E[1]>0)
{
E[0]=0;
if(N>=1000)
{
for(a=0;a<=10-K;a=a+1)
{
for(b=1;b<=10-K;b=b+1)
{
for(c=1;c<=10-K;c=c+1)
{
for(d=1;d<=10-K;d=d+1)
{
for(e=1;e<=10-K;e=e+1)
{
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N){T=10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e];}
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N)goto OUT;
}
}
}
}
}
}
OUT:
if(1000>N&&N>=100)
{
for(a=0;a<=10-K;a=a+1)
{
for(b=0;b<=10-K;b=b+1)
{
for(c=1;c<=10-K;c=c+1)
{
for(d=1;d<=10-K;d=d+1)
{
for(e=1;e<=10-K;e=e+1)
{
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N){T=10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e];}
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N)goto OUT2;
}
}
}
}
}
}
OUT2:
if(100>N&&N>=10)
{
for(a=0;a<=10-K;a=a+1)
{
for(b=0;b<=10-K;b=b+1)
{
for(c=0;c<=10-K;c=c+1)
{
for(d=1;d<=10-K;d=d+1)
{
for(e=1;e<=10-K;e=e+1)
{
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N){T=10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e];}
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N)goto OUT3;
}
}
}
}
}
}
OUT3:
if(10>N&&N>=1)
{
for(a=0;a<=10-K;a=a+1)
{
for(b=0;b<=10-K;b=b+1)
{
for(c=0;c<=10-K;c=c+1)
{
for(d=0;d<=10-K;d=d+1)
{
for(e=1;e<=10-K;e=e+1)
{
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N){T=10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e];}
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N)goto OUT4;
}
}
}
}
}
}
}
OUT4:
if(E[1]==0)
{
if(N>=1000)
{
for(a=1;a<=10-K;a=a+1)
{
for(b=1;b<=10-K;b=b+1)
{
for(c=1;c<=10-K;c=c+1)
{
for(d=1;d<=10-K;d=d+1)
{
for(e=1;e<=10-K;e=e+1)
{
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N){T=10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e];}
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N)goto OUT6;
}
}
}
}
}
}
OUT6:
if(1000>N&&N>=100)
{
for(a=1;a<=10-K;a=a+1)
{
for(b=1;b<=10-K;b=b+1)
{
for(c=1;c<=10-K;c=c+1)
{
for(d=1;d<=10-K;d=d+1)
{
for(e=1;e<=10-K;e=e+1)
{
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N){T=10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e];}
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N)goto OUT7;
}
}
}
}
}
}
OUT7:
if(100>N&&N>=10)
{
for(a=1;a<=10-K;a=a+1)
{
for(b=1;b<=10-K;b=b+1)
{
for(c=1;c<=10-K;c=c+1)
{
for(d=1;d<=10-K;d=d+1)
{
for(e=1;e<=10-K;e=e+1)
{
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N){T=10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e];}
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N)goto OUT8;
}
}
}
}
}
}
OUT8:
if(10>N&&N>=1)
{
for(a=1;a<=10-K;a=a+1)
{
for(b=1;b<=10-K;b=b+1)
{
for(c=1;c<=10-K;c=c+1)
{
for(d=1;d<=10-K;d=d+1)
{
for(e=1;e<=10-K;e=e+1)
{
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N){T=10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e];}
if(10000*E[a]+1000*E[b]+100*E[c]+10*E[d]+E[e]>=N)goto OUT9;
}
}
}
}
}
}
}
OUT9:
printf("%d\n",T);
return 0;
}
|
#define q(x,y)(f[x]*h[y]%m*h[(x)-(y)]%m)
const z=2e5,m=1e9+7;long long H,W,A,B,i=1,f[1<<18],g[1<<18],h[1<<18],r;
main(){
for(f[0]=g[1]=1;i<z;i++)f[i]=f[i-1]*i%m;
for(i=2;i<z;i++)g[i]=g[m%i]*(m-m/i)%m;
for(h[0]=i=1;i<z;i++)h[i]=h[i-1]*g[i]%m;
for(scanf("%d%d%d%d",&H,&W,&A,&B),i=0;i<W-B;i++)r=(r+q(A+i-1,i)*q(W-i+H-A-2,H-A-1))%m;
i=!printf("%d\n",r);
} |
#include<stdio.h>
int mbk(long long a,int n,int m){return n?(mbk((a*a)%m,n/2,m)*(n%2?a:1))%m:1;}
int inv(int a,int m){return mbk((long long)a,m-2,m);}
long long p[200010],q[200010],M=1e9+7;
long long aCb(int a,int b){
//printf("%d %d\n",a,b);
if(a<=b)return 1;
if(b==0)return 1;
return (p[a]*q[b])%M*q[a-b]%M;
}
int main(){
int h,w,a,b,i;
long long ans=0;
scanf("%d %d %d %d",&h,&w,&a,&b);
p[0]=1;
for(i=1;i<200005;i++)p[i]=(p[i-1]*i)%M;
for(i=0;i<200005;i++)q[i]=inv(p[i],M);
for(i=0;i<h-a;i++){
ans=(ans+(aCb(b-1+i,i)*aCb(h-i-1+w-b-1,h-i-1)%M))%M;
}
printf("%lld\n",ans);
return 0;
}
|
#include <stdio.h>
#define MAXN 200001
#define MOD 1000000007
long long f[MAXN], invf[MAXN];
int H, W, A, B;
long long ans;
long long modpow(long long x, long long y)
{
long long ret = 1LL;
while (y)
{
if (y & 1LL)
{
ret *= x;
ret %= MOD;
}
x *= x;
x %= MOD;
y >>= 1LL;
}
return ret;
}
long long nCr(int n, int r)
{
if (r == 0 || r == n) return 1;
return ((f[n] * invf[n-r] % MOD) * invf[r] % MOD);
}
int main(void)
{
int i;
scanf("%d %d %d %d", &H, &W, &A, &B);
f[0] = 1;
for (i = 1; i <= H + W; ++i)
{
f[i] = f[i-1] * i % MOD;
invf[i] = modpow(f[i], MOD-2);
}
for (i = B; i < W; ++i)
{
ans += nCr(H - A + i - 1, i) * nCr(A + W - i - 2, W - i - 1) % MOD;
}
printf("%lld\n", ans % MOD);
return 0;
} |
#include <stdio.h>
#define Mod 1000000007
long long div_mod(long long x, long long y, long long z)
{
if (x % y == 0) return x / y;
else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}
int main()
{
int H, W, A, B;
scanf("%d %d %d %d", &H, &W, &A, &B);
int i;
long long tmp[2], ans;
for (i = H + W - B - 2, tmp[0] = 1; i > H - 1; i--) tmp[0] = tmp[0] * i % Mod;
for (i = W - B - 1, tmp[1] = 1; i >= 2; i--) tmp[1] = tmp[1] * i % Mod;
tmp[0] = div_mod(tmp[0], tmp[1], Mod);
for (i = 1, ans = tmp[0]; i < H - A; i++) {
tmp[0] = tmp[0] * (B + i - 1) % Mod * (H - i) % Mod;
tmp[0] = div_mod(tmp[0], (long long)i * (H + W - B - i - 1) % Mod, Mod);
ans = (ans + tmp[0]) % Mod;
}
printf("%lld\n", ans);
fflush(stdout);
return 0;
} |
#include<stdio.h>
const int mod = 1e9 + 7;
void swap(long long* a, long long* b){
*a ^= *b;
*b ^= *a;
*a ^= *b;
}
long long inverse(long long x){
long long m = mod, u = 1, v = 0;
while(m){
long long t = x / m;
x -= t * m; swap(&x, &m);
u -= t * v; swap(&u, &v);
}
u %= mod;
if(u < 0) u += mod;
return u;
}
int main(){
long long H, W, A, B;
scanf("%lld%lld%lld%lld", &H, &W, &A, &B);
long long fact[H + W + 1];
fact[0] = 1;
for(int k = 1; k <= H + W; k++){
fact[k] = fact[k - 1] * k % mod;
}
long long move = 0;
for(long long j = B; j < W; j++){
move +=
fact[H - A - 1 + j] * inverse(fact[j] * fact[H - A - 1] % mod) % mod
* fact[W - j + A - 2] % mod * inverse(fact[W - j - 1] * fact[A - 1] % mod) % mod;
move %= mod;
}
printf("%lld\n", move);
return 0;
} |
#include <stdio.h>
#define MOD ((long long) 1e9 + 7)
#define N 200000
int ii[N + 1];
int mult(int a, int b) {
return (int) ((long long) a * b % MOD);
}
int power(int a, int b) {
int p;
if (b == 0)
return 1;
p = power(a, b / 2);
p = mult(p, p);
if (b % 2 == 1)
p = mult(p, a);
return p;
}
int choose(int n, int k) {
return k == 0 ? 1 : mult(mult(choose(n - 1, k - 1), n), ii[k]);
}
int inv(int a) {
return power(a, MOD - 2);
}
void init() {
int a;
for (a = 1; a <= N; a++)
ii[a] = inv(a);
}
int main() {
int h, w, a, b, i;
int ch1, ch2, cnt;
init();
scanf("%d%d%d%d", &h, &w, &a, &b);
h--, w--;
ch1 = choose(b - 1, b - 1);
ch2 = choose(w - b + h, w - b);
for (i = 0; i <= h - a; i++) {
cnt = (cnt + mult(ch1, ch2)) % MOD;
ch1 = mult(mult(ch1, b - 1 + i + 1), ii[i + 1]);
ch2 = mult(mult(ch2, ii[w - b + h - i]), h - i);
}
printf("%d\n", cnt);
return 0;
} |
#include <stdio.h>
long long mod=1000000007;
long long modp(long long d,long long p){
if (p==0){
return 1 ;
} else if (p==1){
return d%mod ;
} else if (p%2==0){
return ((modp(d,p/2)%mod)*(modp(d,p/2))%mod)%mod;
} else {
return ((modp(d,p/2)%mod)*(modp(d,p/2))%mod)*d%mod;
}
}
int main(void){
int h,w,a,b;
scanf("%d%d%d%d",&h,&w,&a,&b);
long long p[h+w],q[h+w],ans=0,tmp;
p[0]=1;
for (int i=1; i<h+w; i++){
p[i]=(i*p[i-1])%mod;
}
q[h+w-1]=modp(p[h+w-1],mod-2);
for (int i=h+w-2; i>=0; i--){
q[i]=q[i+1]*(i+1)%mod;
}
for (int i=b+1; i<=w; i++){
tmp=p[h-a-1+i-1]%mod;
tmp=(tmp*q[i-1])%mod;
tmp=(tmp*q[h-a-1])%mod;
tmp=(tmp*p[a-1+w-i])%mod;
tmp=(tmp*q[w-i])%mod;
tmp=(tmp*q[a-1])%mod;
ans=(ans+tmp)%mod;
}
printf("%lld\n",ans%mod);
return 0 ;
} |
#include <stdio.h>
typedef long long ll;
ll MOD = 1000000007ll;
ll combination(ll n,ll r);
void calc();
ll fact[200050];
int main() {
calc();
ll H, W, A, B;
scanf("%lld %lld %lld %lld",&H,&W,&A,&B);
ll i;
ll ans = 0;
for (i = 0; i <= H - A - 1; i++) {
ll a = combination(B+i-1,i);
a *= combination(H - 1 - i + W - 1 - B, W - 1 - B);
a %= MOD;
ans += a;
ans %= MOD;
}
printf("%lld\n",ans);
return 0;
}
ll mod_pow(ll a, ll n) {
ll s;
if (n == 0) { return 1; }
if (n == 1) { return (a%MOD); }
s = mod_pow(a, n / 2);
if (n % 2 == 0) {
return (s*s) % MOD;
}
else {
ll r = a;
r *= s;
r %= MOD;
r *= s;
r %= MOD;
return r;
}
}
ll combination(ll n, ll r) {
ll ret = fact[n];
ret *= mod_pow(fact[r], MOD - 2);
ret %= MOD;
ret *= mod_pow(fact[n-r], MOD - 2);
ret %= MOD;
return ret;
}
void calc() {
ll i;
ll r = 1;
fact[0] = 1;
for (i = 1; i <= 200010; i++) {
r *= i;
r %= MOD;
fact[i] = r;
}
} |
#include<stdio.h>
long long int kaijou[300005];
void k(long long int p)
{
long long int i;
kaijou[0] = 1;
for (i = 0; i < 300004; i++)
kaijou[i + 1] = (kaijou[i] * (i + 1)) % p;
return;
}
long long int modpow(long long int a, long long int n, long long int p)
{
if (n < 0)
return 0;
long long int res = 1;
while (n > 0)
{
if (n % 2 == 1)
res = (res * a) % p;
a = (a * a) % p;
n /= 2;
}
return res;
}
long long int modcmb(long long int n, long long int r, long long int p)
{
long long int res = kaijou[n];
res *= modpow(kaijou[r], p - 2, p);
res %= p;
res *= modpow(kaijou[n - r], p - 2, p);
res %= p;
return res;
}
int main()
{
long long int h, w, a, b;
scanf("%lld %lld %lld %lld", &h, &w, &a, &b);
long long int p = 1000000007;
k(p);
long long int ans = 0;
long long int i;
for (i = b + 1; i <= w; i++)
{
ans += modcmb(h - a + i - 2, i - 1, p) * modcmb(a + w - i - 1, a - 1, p);
ans %= p;
}
printf("%lld\n", ans);
return 0;
} |
#include <stdio.h>
typedef long long ll;
ll mod=1000000007ll;
ll f[2010101], rf[2010101];
ll inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (k) {
if (k & 1) res = (res * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
int i;
f[0] = 1;
for(i=1;i<2010101;i++){f[i] = (f[i - 1] * i) % mod;}
rf[2010101 - 1] = inv(f[2010101 - 1]);
for(i=2010101-2;i>=0;i--){
rf[i] = (rf[i + 1] * (i + 1)) % mod;
}
}
//---------------------------------------------------------------------------------------------------
ll C(int n, int k) {
if (k < 0 || n < k) return 0;
ll a = f[n]; // = n!
ll b = rf[n - k]; // = (n-k)!
ll c = rf[k]; // = k!
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
int main(){
init();
int H,W,A,B;
scanf("%d %d %d %d",&H,&W,&A,&B);
int i;
ll ans=0ll;
for(i=0;i<H-A;i++){
ll add=C(B-1+i,B-1)*C(H-1-B+W-1-i,W-1-B);
add%=mod;
ans+=add;
ans%=mod;
}
printf("%lld\n",ans);
return 0;
} |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MOD (long long)1000000007
int fact[200010], inv[200010], ifact[200010];
int main() {
int i;
long long exp, P;
fact[0] = 1;
inv[1] = 1;
ifact[0] = 1;
for (i=1;i<200010;i++) {
P = (long long)fact[i-1] * i;
fact[i] = P % MOD;
}
for (i=2;i<200010;i++) {
/* exp = 1000000005;
P = i;
while (exp>0) {
if (exp&2) {
P *= P;
P %= MOD;
}
exp>>=1;
}*/
inv[i] = (long long)inv[MOD%i]*(MOD-MOD/i)%MOD;
}
for (i=1;i<200010;i++) {
P = (long long)ifact[i-1] * inv[i];
ifact[i] = P % MOD;
}
// for (i=0;i<10;i++) printf("%d %d %d\n", fact[i], inv[i], ifact[i]);
int A, B, H, j, W;
long long T=0;
scanf("%d%d%d%d", &H, &W, &A, &B);
for (i=0;i<W-B;i++) {
P = (long long)fact[W-i+H-A-2];
P *= (long long)ifact[W-i-1]; P %= MOD;
P *= (long long)ifact[H-A-1]; P %= MOD;
P *= (long long)fact[A+i-1]; P %= MOD;
P *= (long long)ifact[A-1]; P %= MOD;
P *= (long long)ifact[i]; P %= MOD;
T += P; T %= MOD;
}
printf("%lld\n", T);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#define MAX_H 100000
#define MAX_W 100000
#define MAX_C 1000000007
long long H, W, A, B;
long long fact[MAX_H+MAX_W];
long long i_fact[MAX_H+MAX_W];
long long bin_pow(long long x){
long long n=MAX_C-2, p=x, y=1;
while (n>0) {
if (n%2==0){
p = ((long long)p*p) % MAX_C;
n = n/2;
} else {
y = ((long long)y*p) % MAX_C;
n--;
}
}
return y;
}
void set(){
long long i;
fact[0] = 1; i_fact[0] = 1;
for (i=1; i<=H+W-2; i++){
fact[i] = ((long long)fact[i-1] * i) % MAX_C;
i_fact[i] = bin_pow(fact[i]);
}
}
long long combi(long long n, long long r){
long long y;
y = (fact[n] * i_fact[r]) % MAX_C;
y = (y * i_fact[n-r]) % MAX_C;
return y;
}
int main(){
long long x, y, ans=0, i;
scanf("%lld%lld%lld%lld", &H, &W, &A, &B);
set();
x = B; y = H-A-1;
for (i=B; i<W; i++) {
ans += combi(H-A+i-1, i) * combi(W+A-i-2, A-1);
ans = ans % MAX_C;
}
printf("%lld\n", ans);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#define mod (int)(1e9 + 7)
typedef struct {
long long int s;
long long int l;
}pair;
int min(int a, int b){
if(a < b){
return a;
}
else{
return b;
}
}
pair inverse_sub(int a, int b){
pair h;
if(a == 1){
h.s = 1;
h.l = 0;
return h;
}
else{
pair g = inverse_sub(b % a, a);
h.s = g.l - (b / a) * g.s;
h.l = g.s;
return h;
}
}
long long int inverse(int a, int p){
int ans = inverse_sub(a, p).s;
if(ans >= 0){
return ans % p;
}
else{
return p + ans % p;
}
}
/*
//入力値が大きいとスタック領域が足りない
long long int combination(int n, int k){
if(k == 0){
return 1;
}
else{
return (combination(n - 1, k - 1) * ((n * inverse(k, mod)) % mod)) % mod;
}
}
*/
long long int combination(int n, int k){
int i;
long long int *comb = (long long int *)malloc(sizeof(long long int) * (k + 1));
comb[0] = 1;
for(i = 1; i <= k; i++){
comb[i] = (comb[i - 1] * (((n - k + i) * inverse(i, mod)) % mod)) % mod;
}
long long int ans = comb[k];
free(comb);
return ans;
}
int main(){
int H, W, A, B, i;
scanf("%d%d%d%d", &H, &W, &A, &B);
long long int ways, sum;
ways = combination(W - B + H - 2, min(W - B - 1, H - 1));
sum = ways;
for(i = 1; i <= H - A - 1; i++){
ways = (((((ways * (B - 1 + i)) % mod) * (H - i)) % mod) * ((inverse(i, mod) * inverse(W - B - 1 + H - i, mod)) % mod)) % mod;
sum = (sum + ways) % mod;
}
printf("%lld\n", sum);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#define MOD_BY 1000000007
int add(int a, int b) {
return a + b - MOD_BY * (a + b >= MOD_BY);
}
int sub(int a, int b) {
return b == 0 ? a : add(a, MOD_BY - b);
}
int mul(int a, int b) {
int r = 0;
while (b > 0) {
if (b & 1) r = add(r, a);
a = add(a, a);
b >>= 1;
}
return r;
}
int power(int a, int n) {
int r = 1;
while (n > 0) {
if (n & 1) r = mul(r, a);
a = mul(a, a);
n >>= 1;
}
return r;
}
int inv(int a) {
return power(a, MOD_BY - 2);
}
int divide(int a, int b) {
return mul(a, inv(b));
}
int nCr(int n, int r) {
int answer = 1;
int i;
if (r < 0 || n < r) return 0;
for (i = 0; i < r; i++) {
answer = mul(answer, n - i);
}
for (i = 2; i <= r; i++) {
answer = divide(answer, i);
}
return answer;
}
int main(void) {
int H, W, A, B;
int answer;
int ng1, ng2;
int* ng;
int i;
if (scanf("%d%d%d%d", &H, &W, &A, &B) != 4) return 1;
ng = malloc(sizeof(int) * B);
if (ng == NULL) return 2;
for (i = 0; i < B; i++) ng[i] = 1;
answer = nCr(add(H - 1, W - 1), H - 1);
ng1 = nCr((H - 1) - A, 0); /* NGエリアの最上部に上から来る方法 */
ng2 = nCr((A - 1) + ((W - 1) - (B - 1)), (W - 1) - (B - 1)); /* NGエリアの最上部からゴールに行く方法 */
for (i = 0; i < B; i++) {
ng[i] = mul(ng[i], ng1);
ng[B - 1 - i] = mul(ng[B - 1 - i], ng2);
/* (n+1)C(r+1) = nCr * (n+1) / (r+1) */
ng1 = divide(mul(ng1, ((H - 1) - A) + i + 1), i + 1);
ng2 = divide(mul(ng2, ((A - 1) + ((W - 1) - (B - 1))) + i + 1), ((W - 1) - (B - 1)) + (i + 1));
}
for (i = 0; i < B; i++) {
answer = sub(answer, ng[i]);
}
printf("%d\n", answer);
free(ng);
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<time.h>
#define MOD 1000000007
typedef struct node{int value;struct node* right;struct node* left;}node;
void swap(int* a,int* b){int c=*a;*a=*b;*b=c;}
int gcd(int a, int b){if(a<b){swap(&a,&b);}while(a%b!=0){int c=a%b;a=b;b=c;}return b;}
int* mid(int* a, int* b, int* c){if(*b<*a&&*a<*c){return a;}if(*a<*b&&*b<*c){return b;}return c;}
void sort(int is_ascending,int* a,int n){if(n<=1){return;}srand((unsigned int)time(NULL));int l=0,r=n-1;int* p=mid(a,a+n-1,a+(rand()%n));while(l<=r){if(is_ascending){while(*(a+l)<*p){l++;}while(*p<*(a+r)){r--;}}else{while(*(a+l)>*p){l++;}while(*p>*(a+r)){r--;}}if(r<=l){break;}swap(a+l,a+r);l++;r--;}sort(is_ascending,a,l);sort(is_ascending,a+r+1,n-r-1);}
int permutations(int n, int r){int a=n;for(int i=1;i<=r;i++){a*=n-i;}return a;}
unsigned long long int modinv(unsigned long long int a){
long long int b = MOD, u = 1, v = 0;
while(b > 0){
long long int t = a/b;
a -= t*b;
u -= t*v;
long long buf = a;
a = b;
b = buf;
buf = u;
u = v;
v = buf;
}
if(u<0){
u += MOD;
}
u = u%MOD;
return u;
}
long long fac[510000], finv[510000], inv[510000];
void init(){
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for(int i=2; i<510000; i++){
fac[i] = fac[i-1]*i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
finv[i] = finv[i-1] * inv[i] % MOD;
}
}
unsigned long long int combination(unsigned long long int n,unsigned long long int r){
if(r==0||r==n){
return 1;
}
if(r==1){
return n;
}
return fac[n] * (finv[r] * finv[n-r] % MOD) % MOD;
}
//int isPrime(int n){if(n==1){return 0;}if(n==2||n==3){return 1;}if(n%2==0||n%3==0){return 0;}for(int i=5;i*i<=n;i+=2){if(i%3==0){continue;}if(n%i==0){return 0;}}return 1;}
int main(){
unsigned long long int h, w, a, b;
scanf("%llu%llu%llu%llu", &h, &w, &a, &b);
unsigned long long int ans = 0;
init();
while(b < w){
ans += (((combination(b+h-a-1, b)%MOD) * (combination(a-1+w-b-1, a-1)%MOD))%MOD);
ans = ans%MOD;
b++;
}
printf("%llu", ans);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <time.h>
#define BASE_NUM 1000000007UL
#define MAX 200000UL
uint64_t test(uint64_t a, uint64_t b, uint64_t h, uint64_t w);
int main(void) {
int h,w,a,b;
char str[32];
char *p;
int i,cnt = 0;
p = fgets(str, 32, stdin);
for(i=0;i<32;i++){
if(str[i] == ' '){
str[i] = '\0';
if(cnt == 0) {
h = atoi(p);
p = &str[i+1];
} else if (cnt == 1) {
w = atoi(p);
p = &str[i+1];
} else {
a = atoi(p);
p = &str[i+1];
b = atoi(p);
break;
}
cnt++;
}
}
printf("%lu\n", test(a,b,h,w));
//struct timespec start ,end;
//
// printf("%lu\n", test(1,1,2,3));
// printf("%lu\n", test(3,4,10,7));
// printf("%lu\n", test(99999,99999,100000,100000));
//clock_gettime(CLOCK_REALTIME, &start);
// printf("%lu\n", test(44444,55555,100000,100000));
//clock_gettime(CLOCK_REALTIME, &end);
// printf("%lu sec\n", end.tv_sec - start.tv_sec);
return 0;
}
uint64_t *fac;
uint64_t *finv;
uint64_t powerb(uint64_t a, uint64_t b) {
uint64_t res = 1;
while(b > 0){
if(b & 1) res = (res * a) % BASE_NUM;
a = (a * a) % BASE_NUM;
b >>= 1;
}
return res;
}
void arrinit() {
uint64_t i;
fac = malloc(sizeof(uint64_t) * (MAX+1));
finv = malloc(sizeof(uint64_t) * (MAX+1));
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
for(i=1U;i<=MAX;i++){
fac[i] = (fac[i-1] * i) % BASE_NUM;
// finv[i] = powerb(fac[i], BASE_NUM - 2UL) % BASE_NUM;
}
finv[MAX] = powerb(fac[MAX], BASE_NUM-2UL);
for(i=MAX-1;i>1;i--){
finv[i] = (finv[i+1] * (i+1UL)) % BASE_NUM;
}
}
void arrfini() {
free(fac);
free(finv);
}
uint64_t ncrb(uint64_t n, uint64_t r, uint64_t base) {
return ((((fac[n] % base) * (finv[r] % base)) % base) * (finv[n-r] % base)) % base;
}
uint64_t test(uint64_t l1, uint64_t l2, uint64_t s1, uint64_t s2) {
uint64_t *arr;
uint64_t i,j;
uint64_t range;
uint64_t h1,h2;
uint64_t ret = 0;
arrinit();
range = s2 - l2;
arr = malloc(sizeof(uint64_t) * 2 * range);
h1 = l1;
h2 = s1 - l1;
for(i=0,j=(s2-1);i<range;i++,j--){
arr[i] = ncrb(h1+i-1,i,BASE_NUM) % BASE_NUM;
arr[range*2-i-1] = ncrb(h2+j-1,j, BASE_NUM) % BASE_NUM;
//if(i == 40000) {
// printf("ncr %lu %lu -> %lu\n", h1+i-1,i, arr[i]);
// printf("ncr %lu %lu -> %lu\n", h2+j-1,j, arr[range*2-i-1]);
//}
}
for(i=0;i<range;i++) {
ret += (arr[i] * arr[range*2-i-1]) % BASE_NUM;
}
arrfini();
free(arr);
return ret % BASE_NUM;
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h> // int64_t
#define max(a,b) ((a) > (b) ? (a) : (b))
#define min(a,b) ((a) > (b) ? (b) : (a))
int get_int2(int *a1, int *a2) {
scanf("%d %d", a1, a2);
return 0;
}
#define DIVISOR 1000000007
#define NUM_MAX 200000
// <arr[0]> <arr[1]> .. <arr[size-1]>
int fget_array(int *arr, int size) {
int i;
for(i = 0; i < size; i++) {
scanf("%d", &arr[i]);
}
return 0;
}
struct point2d {
int row;
int col;
};
struct pair {
int x;
int y;
};
struct pair gcdext(int a, int b) {
if(a==0) { return (struct pair){0, 1}; }
struct pair p = gcdext(b%a, a);
return (struct pair){p.y - (b/a)*p.x, p.x};
}
static int64_t factorial[NUM_MAX+1];
static int64_t inv_factorial[NUM_MAX+1];
void init_combi(int size) {
factorial[0] = factorial[1] = 1;
inv_factorial[0] = inv_factorial[1] = 1;
int i;
for(i = 2; i <= size; i++) {
factorial[i] = (factorial[i-1] * i)%DIVISOR;
struct pair p = gcdext(i, DIVISOR);
int inv = (p.x + DIVISOR)%DIVISOR;
inv_factorial[i] = (inv_factorial[i-1] * inv)%DIVISOR;
}
return;
}
int64_t calc_combi(int n, int k) {
if(k > n) return 0;
int64_t ans = 1;
ans = (ans * factorial[n])%DIVISOR;
ans = (ans * inv_factorial[n-k])%DIVISOR;
ans = (ans * inv_factorial[k])%DIVISOR;
return ans;
}
int64_t calc_routes(struct point2d p1, struct point2d p2) {
int rs = p2.row - p1.row;
int cs = p2.col - p1.col;
return calc_combi(rs+cs, rs);
}
int main(void) {
int rows, cols;
get_int2(&rows, &cols);
// edge
rows--; cols--;
int a, b;
get_int2(&a, &b);
init_combi(rows+cols);
int64_t ans = 0;
// usually, calc_combi(rows-1+cols-1, cols-1)
int r;
struct point2d boundary = (struct point2d){rows-a, b};
for(r = 0; r <= boundary.row; r++) {
int64_t res = 1;
// lefttop
struct point2d start1 = (struct point2d){0, 0};
struct point2d end1 = (struct point2d){r, boundary.col};
res = (res * calc_routes(start1, end1));
// rows-i-i
// rightbottom: rows-i, cols-b-1
struct point2d start2;
if(r == boundary.row) {
start2 = (struct point2d){r, boundary.col};
} else {
start2 = (struct point2d){r, boundary.col+1};
}
struct point2d end2 = (struct point2d){rows, cols};
res = (res * calc_routes(start2, end2))%DIVISOR;
#ifdef DEBUG
printf("topleft: (%d %d) -> (%d %d) ",
start1.row, start1.col,
end1.row, end1.col
);
printf("bottomright: (%d %d) -> (%d %d)",
start2.row, start2.col,
end2.row, end2.col
);
printf(" -> %lld\n", res);
#endif
ans = (ans + res)%DIVISOR;
}
printf("%d\n", (int)ans);
return 0;
} |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
// 内部定数
#define D_SIZE_MAX 100000 // 最大サイズ
#define D_MOD 1000000007 // 除数
// 内部変数
static int siH; // 高さ
static int siW; // 幅
static int siNgH; // 移動不可 - 高さ
static int siNgW; // 移動不可 - 幅
static long long sl1Fact[D_SIZE_MAX * 2 + 5]; // 階乗
static long long sl1PtnL[D_SIZE_MAX + 5]; // 高さ別パターン数 - 左側
static long long sl1PtnR[D_SIZE_MAX + 5]; // 高さ別パターン数 - 右側
// 内部変数 - テスト用
#ifdef D_TEST
static int siRes;
static FILE *szpFpT, *szpFpA;
#endif
// 階乗セット
int
fSetFact(
)
{
int i;
sl1Fact[0] = 1;
sl1Fact[1] = 1;
for (i = 2; i < siH + siW; i++) {
sl1Fact[i] = sl1Fact[i - 1] * (long long)i % (long long)D_MOD;
}
return 0;
}
// べき乗 - 取得
long long
fGetModPower(
long long plBase // <I> 基数
, int piIdx // <I> 指数
)
{
// 平方リスト - 作成
long long ll1Val[100];
ll1Val[0] = plBase;
int liCnt = 1;
int liIdx = 1;
while (piIdx > liIdx) {
ll1Val[liCnt] = ll1Val[liCnt - 1] * ll1Val[liCnt - 1] % (long long)D_MOD;
liCnt++;
liIdx += liIdx;
}
// べき乗 - 取得
long long llVal = 1;
while (piIdx > 0) {
if (piIdx >= liIdx) {
piIdx -= liIdx;
llVal = llVal * ll1Val[liCnt - 1] % (long long)D_MOD;
}
liCnt--;
liIdx /= 2;
}
return llVal;
}
// 高さ別パターン数セット
int
fSetPtn(
int piW // <I> 長さ(幅)
, long long *plpTo // <O> セット先
)
{
int i;
plpTo[1] = 1;
// nCr = n! / r! / (n-r)!
for (i = 2; i <= siH; i++) {
// n!
int liN = piW + i - 2;
plpTo[i] = sl1Fact[liN];
// r!
int liR = i - 1;
long long llRev = fGetModPower(sl1Fact[liR], D_MOD - 2);
plpTo[i] = plpTo[i] * llRev % (long long)D_MOD;
// (n-r)!
llRev = fGetModPower(sl1Fact[liN - liR], D_MOD - 2);
plpTo[i] = plpTo[i] * llRev % (long long)D_MOD;
}
return 0;
}
// 実行メイン
int
fMain(
int piTNo // <I> テスト番号 1～
)
{
int i;
char lc1Buf[1024], lc1Out[1024];
// テストファイルオープン
#ifdef D_TEST
sprintf(lc1Buf, ".\\Test\\T%d.txt", piTNo);
szpFpT = fopen(lc1Buf, "r");
sprintf(lc1Buf, ".\\Test\\A%d.txt", piTNo);
szpFpA = fopen(lc1Buf, "r");
siRes = 0;
#endif
// 高さ・幅・移動不可を取得
#ifdef D_TEST
fgets(lc1Buf, sizeof(lc1Buf), szpFpT);
#else
fgets(lc1Buf, sizeof(lc1Buf), stdin);
#endif
sscanf(lc1Buf, "%d%d%d%d", &siH, &siW, &siNgH, &siNgW);
// 階乗セット
fSetFact();
// 高さ別パターン数セット
fSetPtn(siNgW, sl1PtnL); // 左側
fSetPtn(siW - siNgW, sl1PtnR); // 右側
// 全パターン算出
long long llSum = 0;
for (i = 1; i <= siH - siNgH; i++) {
llSum += sl1PtnL[i] * sl1PtnR[siH - i + 1];
llSum %= (long long)D_MOD;
}
// 結果セット
sprintf(lc1Out, "%lld\n", llSum);
// 結果表示
#ifdef D_TEST
fgets(lc1Buf, sizeof(lc1Buf), szpFpA);
if (strcmp(lc1Buf, lc1Out)) {
siRes = -1;
}
#else
printf("%s", lc1Out);
#endif
// テストファイルクローズ
#ifdef D_TEST
fclose(szpFpT);
fclose(szpFpA);
#endif
// テスト結果
#ifdef D_TEST
if (siRes == 0) {
printf("OK %d\n", piTNo);
}
else {
printf("NG %d\n", piTNo);
}
#endif
return 0;
}
int
main()
{
#ifdef D_TEST
int i;
for (i = D_TEST_SNO; i <= D_TEST_ENO; i++) {
fMain(i);
}
#else
fMain(0);
#endif
return 0;
}
|
#include<stdio.h>
int main()
{
int n,sum=0,i,j,t;
scanf("%d",&n);
int l[2*n];
for(i=0;i<2*n;i++)
{
scanf("%d",&l[i]);
}
for(i=0;i<2*n;i++)
{
for(j=i+1;j<2*n;j++)
{
if(l[i]>l[j])
{
t=l[i];
l[i]=l[j];
l[j]=t;
}
}
}
for(i=2*n-2;i>=0;i-=2)
{
sum+=l[i];
}
printf("%d",sum);
return 0;
}
|
#include<stdio.h>
main(){
int N,i,j,S;
scanf("%d",&N);
int L[2*N];
for(i=0;i<2*N;i++)scanf("%d",&L[i]);
for(i=0;i<2*N-1;i++){
for(j=i+1;j<2*N;j++){
if(L[i]>L[j])S=L[i],L[i]=L[j],L[j]=S;
}
}
S=0;
for(i=0;i<N;i++)S+=L[2*i];
printf("%d",S);
return 0;
} |
#include <stdio.h>
int main(void){
int n,i,j,t,c=0;
scanf("%d",&n);
int l[n*2];
for(i=0;i<n*2;i++){
scanf("%d",&l[i]);
for(j=i;j>0;j--){
if(l[j]<l[j-1]){
t=l[j];
l[j]=l[j-1];
l[j-1]=t;
}
}
}
for(i=0;i<n*2;i+=2){
c+=l[i];
}
printf("%d",c);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a, const void *b){return *(int*)b - *(int*)a;}
int main(){
int N,i,L[200],ans=0;
scanf("%d",&N);
for(i=0;i<2*N;i++)scanf("%d",&L[i]);
qsort(L, 2*N, sizeof(int), compare_int);
for(i=0;i<N;i++)ans+=L[i*2+1];
printf("%d\n",ans);
} |
#include <stdio.h>
int main(void){
int i,j,x,l[200],a,tmp;
scanf("%d",&x);
scanf("%d",&l[0]);
for(i=1;i<=x*2-1;i++){
scanf("%d",&l[i]);
for(j=i;j>=1;j--){
if(l[j]<l[j-1]){
tmp=l[j];
l[j]=l[j-1];
l[j-1]=tmp;
}
else break;
}
}
a=0;
for(i=0;i<2*x;i+=2)
a+=l[i];
printf("%d",a);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int comp(const void *p1,const void *p2){
int n1,n2;
n1=*(const int *)p1;
n2=*(const int *)p2;
return n1-n2;
}
int main(void){
int N,L[200];
int i,j,k;
scanf("%d",&N);
N*=2;
for(i=0;i<N;i++) scanf("%d",L+i);
qsort(L,N,sizeof(L[0]),comp);
k=0;
for(i=0;i<N;i+=2) k+=L[i];
printf("%d\n",k);
return 0;
}
|
#include <stdio.h>
int sort(int x[],int l){
int i,j,k;
for(i=1;i<=l;i++){
for(j=l;j>=i+1;j--){
if(x[j-1]>x[j]){
k=x[j];
x[j]=x[j-1];
x[j-1]=k;
}
}
}
return 0;
}
int main(void) {
int a,i,s[1024],g=0;
scanf("%d",&a);
for(i=1;i<=2*a;i++){
scanf("%d",&s[i]);
}
sort(s,2*a);
for(i=1;i<=2*a-1;i+=2){
g+=s[i];
}
printf("%d\n",g);
return 0;
} |
#include<stdio.h>
#include<string.h>
#define N 165003
int arr[N];
int main(){
int a;
scanf("%d",&a);
int i;
for(i=0;i<a*2;i++){
scanf("%d",arr+i);
}
int w;
for(i=0;i<a*2;i++){
for(w=0;w<a*2;w++){
if(arr[w]<arr[w+1]){
int temp=arr[w];
arr[w]=arr[w+1];
arr[w+1]=temp;
}
}
}
int s=0;
for(i=0;i<(a*2)-1;i+=2){
s+=arr[i+1];
}
printf("%d",s);
} |
#include<stdio.h>
int main (){
int N=0,sum=0,i=0;
int L[200];
scanf("%d",&N);
for(int x=0;x<2*N;x++){
scanf("%d",&L[x]);
++i;
}
for(int y=0;y<i+1;y++){
for(int z=0;z<i-1;z++){
if(L[z]<L[z+1]){
sum=L[z];
L[z]=L[z+1];
L[z+1]=sum;
}
}
}
sum=0;
for(int y=0;y<i;y+=2){
sum+=L[y+1];
}
printf("%d\n",sum);
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
int s[201];
int n, sum;
void input(){
int i;
scanf("%d", &n);
for(i = 0; i < n*2; i++){
scanf("%d", s+i);
}
}
int cmp(const void* a, const void* b){
int av = *(int*)a, bv=*(int*)b;
return av-bv;
}
int min(int a, int b){
return a<b? a: b;
}
void calc(){
int i;
qsort(s, n*2, sizeof(int), &cmp);
for(i = 0; i < n; i++)
sum += min(s[i*2], s[i*2+1]);
}
void output(){
printf("%d\n", sum);
}
int main(){
input();
calc();
output();
}
|
#include<stdio.h>
int main(){
int n, i, j, k, work,sum=0;
int kushi[200]={};
scanf("%d",&n);
for(i=0;i<n*2;i++){
scanf("%d",&kushi[i]);
}
for(i=0;i<n*2;i++){
for(j=i+1;j<n*2;j++){
if(kushi[i]<kushi[j]){
work = kushi[i];
kushi[i] = kushi[j];
kushi[j] = work;
}
}
}
for(k=1;k<n*2;k+=2){
sum += kushi[k];
}
printf("%d",sum);
return 0;
} |
#include <stdio.h>
int main(){
int N,tmp,cnt;
int i,p,q;
scanf("%d", &N);
if(N<0 && N>100) return -1;
int L[N*2];
for( i=0; i<N*2; i++ ){
scanf("%d ",&L[i]);
if (L[i] < 0 || L[i] > 100 ){
return -1;
}
}
//降順ソート
for( p = 0; p <( N*2)-1; p++){
for(q = p + 1; q < (N*2); q++){
if(L[p] < L[q]){
tmp = L[p];
L[p] = L[q];
L[q] = tmp;
}
}
}
//最大数の和を求める
for( i= 0; i<N*2; i+=2 ){
cnt += L[i+1];
}
printf("%d",cnt);
return 0;
}
|
#include <stdio.h>
void bubblesort(int a[],int n);
int main(void){
int n,length[220]={},i,max=0;
scanf("%d",&n);
for(i=0;i<2*n;i++){
scanf("%d",&length[i]);
}
bubblesort(length,n);
for(i=0;i<2*n;i+=2){
max+=length[i];
}
printf("%d\n",max);
return 0;
}
void bubblesort(int a[],int n){
int i,j,t,f=0;
while(f==0){
f=1;
for(i=0;i<2*n-1;i++){
if(a[i]>a[i+1]){
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
for(j=0;j<2*n-1;j++){
if(a[j]>a[j+1]){
f=0;
}
}
}
}
} |
#include <stdio.h>
int N;
void swap(int *n1, int *n2){int tmp = *n1; *n1 = *n2; *n2 = tmp;}
void sort(int array[]);
int main(void)
{
int i, L[210], ans = 0;
scanf("%d", &N);
for (i = 0; i < 2 * N; i++){
scanf("%d", &L[i]);
}
sort(L);
for (i = 0; i < 2 * N; i += 2){
ans += L[i];
}
printf("%d\n", ans);
return 0;
}
void sort(int array[])
{
int i, j;
for (i = 2 * N - 1; i > 0; i--){
for (j = 0; j < i; j++){
if (array[j] > array[j + 1])
swap(&array[j], &array[j + 1]);
}
}
} |
#include <stdio.h>
#include <stdlib.h>
int c(const void* a,const void* b) {
int x=*(const int*)a;
int y=*(const int*)b;
if(x>y)return 1;
if(x<y)return -1;
return 0;
}
int main(void) {
int N;
int L[999];
int i;
int ans = 0;
if(scanf("%d",&N)!=1)return 1;
N*=2;
for(i=0;i<N;i++) {
if(scanf("%d",&L[i])!=1)return 1;
}
qsort(L,N,sizeof(*L),c);
for(i=0;i<N;i+=2) {
ans+=L[i];
}
printf("%d\n",ans);
return 0;
}
/*
a < b < c < d
a, b
c, d
a, c
b, d
a, d
b, c
最初はa,c、他はa,bなので最初がつよい
*/ |
#include <stdio.h>
#include <stdlib.h>
int compare_int(const void *a,const void *b){
return *(int*)a - *(int*)b;
}
int main(void){
/*
串が長い奴を多く使いたい？
ケース
(100,50,50,10)→10+50=6
(100,50,50,50,20,10)→10+50+50
短い奴は短い奴と組み合わせたい
短い順に並べて、奇数番目を足せばおk
*/
int N;
scanf("%d",&N);
int L[2*N+1];
int i;
int sum = 0;
L[0] = 101;
for(i=1;i<=2*N;i++){
scanf("%d",L+i);
}
qsort(L,2*N+1,sizeof(int),compare_int);
for(i=0;i<=N-1;i++){
sum = sum + L[i*2];
}
printf("%d",sum);
} |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef unsigned long long ull;
typedef signed long long sll;
#define N_MAX 100
int comp (const void *x, const void *y) {
return *(int*)x - *(int*)y;
}
int min (int x, int y) {
return (x < y) ? x : y;
}
int solve (void) {
return 0;
}
int main (void) {
int l[N_MAX * 2];
int n, i;
int answer;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &l[i*2], &l[i*2+1]);
}
qsort(l, n * 2, sizeof(int), comp);
answer = 0;
for (i = 0; i < n * 2; i += 2) answer += l[i];
printf("%d\n", answer);
return 0;
}
|
#include<stdio.h>
int main(void){
int N, L[200];
int ans = 0;
scanf("%d", &N);
//L[i]を昇順ソートしながら格納
for(int i = 0; i < 2*N; i ++){
int num;
scanf("%d", &num);
int place = 0;
if (i > 0){
while(place < i){
if (num < L[place]) break;
place ++;
}
for(int k = i; k >= place; k --){
L[k+1] = L[k];
}
}
L[place] = num;
}
for(int i = 0; i < 2*N; i += 2){
ans += L[i];
}
printf("%d\n", ans);
return 0;
} |
#include <stdio.h>
void sort(int a[], int n){
int b, i, j = 0, k = 1;//0~j-1 small j~k-1 equal k~i-1 big i~ unsorted
b = a[0];
if(n <= 1) return;
for (i = 1; i < n; i++) {
if(a[i] < b){
a[j] = a[i];
a[i] = a[k];
a[k] = b;
j++;
k++;
}else if(a[i] == b){
a[i] = a[k];
a[k] = b;
k++;
}
}
sort(a, j);
sort(a+k, n-k);
return;
}
void main() {
int n, ans = 0;
scanf("%d", &n);
int a[n*2];
for (int i = 0; i < n*2; i++) {
scanf("%d", a+i);
}
sort(a, n*2);
for (int i = 0; i < n; i++) {
ans += a[i*2];
}
printf("%d\n", ans);
return;
}
|
#include<stdio.h>
int main(){
int N;
// input N
scanf("%d",&N);
if (N < 0 || N > 100 ){
return 1;
}
int a[2*N];
// input Li until 2N
for (int i=0; i < 2*N; i++ ){
scanf("%d",&a[i]);
if (a[i] < 0 || a[i] > 100 ){
return 1;
}
}
// sort a[] from smallest to largest
int tmp;
for (int i=0; i<2*N; ++i) {
for (int j=i+1; j<2*N; ++j) {
if (a[i] > a[j]) {
tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
}
int sum=0;
// calculate sum
for (int i=0; i < 2*N; i++ ){
if ( i%2==0){
//printf ("%d ",a[i]);
sum+=a[i];
}
}
printf("%d\n", sum);
return 0;
} |
Subsets and Splits