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[... |
#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]... |
#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(... |
#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++)
... |
#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++)
... |
#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 ... |
#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]) {... |
#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;
}... |
#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... |
#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... |
#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... |
#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);
fo... |
#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(... |
#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
... |
#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[], c... |
#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]=&wor... |
#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]);
}
... |
#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--){
... |
#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... |
#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 ... |
#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);
... |
#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;
}
... |
#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){
... |
#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... |
#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);
... |
#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... |
#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... |
#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){
print... |
#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++){
... |
#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... |
#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... |
#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 + ... |
#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(... |
#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;
... |
#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... |
#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>=... |
#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){... |
#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;
fo... |
#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;
... |
#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;
in... |
#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<1000... |
#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++;... |
#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;
... |
#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 ... |
#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 */
}... |
#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... |
#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;
... |
#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-... |
#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 *... |
#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;... |
#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 % nu... |
#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++){... |
#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+... |
#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] =... |
#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 retur... |
#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) {
... |
#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_... |
#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... |
#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++)
sc... |
#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[... |
#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-... |
#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;
}
... |
#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 ... |
#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... |
#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 += ... |
#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 ... |
#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;... |
#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... |
#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;
whi... |
#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;
... |
#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;
... |
#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 l... |
#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_... |
#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;
}
r... |
#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 ... |
#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);
... |
#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]> .... |
#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; // 移動不可... |
#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(... |
#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;... |
#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... |
#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... |
#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;... |
#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... |
#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]... |
#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++)... |
#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;
whi... |
#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);
... |
#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)r... |
#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;
in... |
#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) ... |
#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;
... |
#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];
... |
#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 tm... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.