content
stringlengths
19
11k
#include <stdio.h> int main() { int coins; scanf("%d",&coins); int arr[coins]; int max_coin=0; int max=0; for (int i=0; i<coins; i++) { int add; scanf("%d",&add); arr[i]=add; if (max_coin<add) max_coin=add; } int hist[max_coin]; for (int i=0; i<max_coin; i++) hist[i]=0; for (int i=0; i<coins; i++) { hist[arr[i]-1]++; } for (int i=0; i<max_coin; i++) { if (hist[i]>max) max=hist[i]; } printf("%d",max); return 0; }
#include <stdlib.h> #include <stdio.h> #include <assert.h> int sort(int A[]); int main(){ int A[100] = {0}; int x, next; scanf("%d", &x); for(int i = 0; i < x; i++) { scanf("%d", &next); A[next-1] += 1; } printf("%d", sort(A)); return 0; } int sort(int A[]) { for(int i = 1; i < 100; i++) { for(int j = i - 1; j >= 0 && A[j+1] < A[j]; j--) { int tmp = A[j+1]; A[j+1] = A[j]; A[j] = tmp; } } return A[99]; }
#include<stdio.h> int ara[1000]; int main() { int i,j,min,temp,t,count; while(~scanf("%d",&t)) { for(i=0;i<t;i++) { scanf("%d",&ara[i]); } for(i=0;i<t;i++) { min=i; for(j=i;j<t;j++) { if(ara[j]<ara[min]) { min=j; } } temp=ara[i]; ara[i]=ara[min]; ara[min]=temp; } min=1; for(i=1;i<t;i++) { count=1; while(ara[i]==ara[i-1]) { count++; i++; } if(count>min)min=count; } printf("%d\n",min); } return 0; }
#include <stdio.h> int main(int argc, char const *argv[]) { int n; int ai[100]; int repai[100]; int compteur = 0 ; int max; scanf("%d",&n); for (int i = 0 ; i < n ; i++) { scanf("%d",&ai[i]); } for (int i = 0 ; i < n ; i++) { for ( int j = 0 ; j < n ; j++) { if (ai[i] == ai[j]) { compteur+= 1 ; } } repai[i] = compteur; compteur = 0; } max = repai[0]; for (int i = 0 ; i < n ; i++) { if (max<repai[i]) { max =repai[i]; } } printf("%d\n",max ); return 0; }
#include <stdio.h> int main() { // your code goes here int k; scanf("%d",&k); int a[k],b[101]={0}; for(int j=0;j<k;++j){ scanf("%d",&a[j]); } for(int j=0;j<k;++j){ int cnt=0; for(int m=j+1;m<k;++m){ if(a[j]!=-1&&a[j]==a[m]){ cnt++; a[m]=-1; } } b[j]=cnt; } int big=b[0]; for(int i=0;i<k;++i) if(big<b[i]) big=b[i]; if(big==0) printf("1"); else printf("%d",big+1); return 0; }
#include <stdio.h> int main() { int n,i,large,k,j,swap; scanf("%d",&n); int x[n]; int y[101]; for(i=0; i<n; i++) { scanf("%d",&x[i]); } for(i=0; i<101; i++) { y[i]=0; } for(i=0; i<n; i++) { k=x[i]; y[k]++; } for(i=0; i<100; i++) { for(j=0; j<100-i; j++) { if(y[j]>y[j+1]) { swap=y[j]; y[j]=y[j+1]; y[j+1]=swap; } } } printf("%d",y[100]); }
#include <stdio.h> int count_dig(int [],int,int); int main() { int num,i,max_sum=0; scanf("%d",&num); if(num==0) printf("%d",max_sum); else { int arr[num]; for(i=0;i<num;i++) scanf("%d",&arr[i]); for(i=0;i<num;i++) { if(count_dig(arr,num,i)>max_sum) max_sum=count_dig(arr,num,i); } printf("%d",max_sum); } } int count_dig(int arr[],int num,int index) { int i,cnt=1; for(i=index+1;i<num;i++) { if(arr[i]==arr[index]) cnt++; } return cnt; }
#include <stdio.h> #include <stdint.h> #define SIZE 100 int main(void) { uint8_t coin_counters[SIZE] = {0}; unsigned short coins; scanf("%hu", &coins); uint8_t most_common_coin_counter = 0; for (uint8_t i = 0; i < coins; ++i) { unsigned short curr_coin; scanf("%hu", &curr_coin); ++coin_counters[curr_coin - 1]; if (most_common_coin_counter < coin_counters[curr_coin - 1]) most_common_coin_counter = coin_counters[curr_coin - 1]; } printf("%hu", (unsigned short)most_common_coin_counter); return 0; }
#include <stdio.h> #include <stdlib.h> #define max 100+1 int main() { int i,j,coin,coins[max],vegal,temp; scanf("%d",&coin); for(i=0;i<coin;i++) { scanf("%d",&coins[i]); } for(i=0;i<coin;i++) { vegal=1; for(j=i+1;j<coin;j++) { if(coins[i]==coins[j]) vegal++; } coins[i]=vegal; } for(i=0;i<coin-1;i++) { if(coins[i+1]<coins[i]) { temp=coins[i+1]; coins[i+1]=coins[i]; coins[i]=temp; } } printf("%d",coins[coin-1]); return 0; }
#include<stdio.h> int main() { int a,b,i,j,ar[50000],temp,s=1,z[50000],v=0,max; scanf("%d",&a); for(i=0;i<a;i++) { scanf("%d",&ar[i]); } for(i=0;i<a-1;i++) { for(j=0;j<a-i-1;j++) { if(ar[j]>ar[j+1]) { temp=ar[j]; ar[j]=ar[j+1]; ar[j+1]=temp; } } } for(i=0;i<a-1;i++) { if(ar[i]==ar[i+1]) s++; if(ar[i]!=ar[i+1]) { z[v]=s; v++; s=1; } } max=z[0]; for(i=1;i<v;i++) { if(z[i]>max) max=z[i]; } if(max>s) printf("%d",max); else printf("%d",s); }
#include<stdio.h> int count(int count1,int count2) { if(count1>count2) { return count1; } else { return count2; } } int no_poc(int arr[],int n) { int i,j; int count1=0; int count2=0; for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(arr[j]==arr[i]) { count1+=1; } } count2=count(count1,count2); count1=0; } return count2; } main() { int n; scanf("%d",&n); int arr[n]; { for(int i=0;i<n;i++) { scanf("%d",&arr[i]); } } int pocket; pocket=no_poc(arr,n); printf("%d",pocket); }
#include <stdio.h> #include <stdlib.h> //CODED BY SAYEM MD. NAFI int main() { int NUMBER, *COIN, POCKET = 1, COUNT = 1, I, J; scanf("%d", &NUMBER); COIN = (int *) malloc (sizeof(int) * NUMBER); for(I = 0; I < NUMBER; I++) { scanf("%d", &COIN[I]); } for(I = 0; I < NUMBER; I++) { for(J = 0; J < NUMBER; J++) { if (I == J) continue; else if(COIN[I] == COIN[J]) { COUNT++; } } if(COUNT > POCKET) { POCKET = COUNT; } COUNT = 1; } printf("%d\n", POCKET); return 0; }
#include <stdio.h> typedef struct{ int number; int amount; } stat; int main(){ int n,i,j,z = 0,ketemu = 0; scanf("%d",&n); int coins[n]; stat statistic[n]; for(i=0;i<n;i++){ scanf("%d",&coins[i]); statistic[i].number = 0; statistic[i].amount = 0; } for(i=0;i<n;i++){ ketemu = 0; for(j=0;j<z;j++){ if(statistic[j].number == coins[i]){ statistic[j].amount += 1; ketemu = 1; } } if(ketemu == 0){ statistic[z].number = coins[i]; statistic[z].amount = 1; z += 1; } } int max = statistic[0].amount; for(i=0;i<z;i++){ if(statistic[i].amount > max){ max = statistic[i].amount; } } printf("%d", max); return 0; }
// http://codeforces.com/contest/1003/problem/0 #include <stdio.h> int Max(int * arr, int arr_size); int Coins[101] = {0}; int main(void){ int n = 0, index = 0, pockets = 0, coin = 0; scanf("%d", &n); getc(stdin); while(index < n){ scanf("%d", &coin); Coins[coin]++; index++; } pockets = Max(Coins, 101); printf("%d\n", pockets); return 0; } int Max(int * arr, int arr_size){ int index = 0, max_so_far = 0; for(index = 0; index < arr_size; index++){ if(arr[index] > max_so_far){ max_so_far = arr[index]; } } return max_so_far; }
#include<stdio.h> #include<conio.h> int main() { int a,i,temp,j; int counter=-1; int max=0; scanf("%d",&a); int c[a]; for(i=0;i<a;i++) { scanf("%d",&c[i]); } for(i=0;i<a;i++) { temp=c[i]; for(j=0;j<a;j++) { if(temp==c[j]) counter++; } if(counter==0) counter=-1; else { if(counter>=max) { max=counter+1; counter=-1; } else counter=-1; } } if(max==0){ printf("1"); } else printf("%d",max); }
#include<stdio.h> int main() { int n[100]; int a,sum=0; scanf("%d",&a); if(a>100) { return 0; } if(a<=100) { int j=0; int t=0; int n[a]; int i,k=0,l=0,s,d=0,m; for(i=0;i<a;i++) { scanf("%d",&n[i]); } for(i=0;i<a;i++) { j=n[i]; l=0; for(k=0;k<a;k++) { s=n[k]; if(j==s) { l++; } } if(l>d) { m=l; d=l; } } printf("%d",m); } }
#include<stdio.h> #include<stdlib.h> int main(){ int cnum,break1=1; int *coin; scanf("%d",&cnum); int pocket[cnum-1]; coin=(int *)malloc(cnum*sizeof(int)); for(int i=0;i<cnum;i++){ scanf("%d",&coin[i]); } for(int i=1;i<=cnum;i++){ int pocketvalue=1; for(int j=0;j<i;j++){ if(*(coin+i)==*(coin+j)){ pocketvalue++; pocket[i-1]=pocketvalue; } else pocket[i-1]=pocketvalue; } } for(int i=0;i<cnum;i++){ if(pocket[i]>pocket[i+1] && i<cnum-1){ pocket[i]=pocket[i]+pocket[i+1]; pocket[i+1]=pocket[i]-pocket[i+1]; } } printf("%d",pocket[cnum-1]); return 0; }
/****************************************************************************** Online C Compiler. Code, Compile, Run and Debug C program online. Write your code in this editor and press "Run" button to compile and execute it. *******************************************************************************/ #include <stdio.h> int main() { unsigned short n; scanf("%hu",&n); unsigned short a[100]; for(unsigned register short i=0; i<100; i++){a[i]=0;} while(n--) { unsigned short x; scanf("%hu",&x); ++a[x-1]; } unsigned register short max=a[0]; for(unsigned register short i=1; i<100; i++){max=(max<a[i])*a[i]+(max>=a[i])*max;} printf("%hu\n",max); return 0; }
#include <stdio.h> int main() { int a, n, b[10000], i, max, curco, tem, an, j; scanf("%d", &a); for (i = 0; i < a; i++) { scanf("%d", &b[i]); } for (i = 0; i < a; i++) { for (j = i + 1; j < a; j++) { if (b[i] > b[j]) { tem = b[i]; b[i] = b[j]; b[j] = tem; } } } curco = 1; max = 1; an = b[0]; for (i = 1; i < a; i++) { if (b[i] == b[i - 1]) curco += 1; else { if (curco > max) {max = curco;} curco = 1; } } if (curco > max) {max = curco;} printf("%d", max); return 0; }
#include<stdio.h> void merge(int a[],int s,int m,int e); void mergesort(int a[],int s,int e) { int m; if(s<e) { m=(s+e)/2; mergesort(a,s,m); mergesort(a,m+1,e); merge(a,s,m,e); } } void merge(int a[],int s,int m,int e) { int i,j=0,n1,n2,k; n1=m-s+1; n2=e-m; int l[n1],r[n2]; for(i=0;i<n1;i++) l[i]=a[s+i]; for(i=0;i<n2;i++) r[i]=a[m+1+i]; i=0; k=s; while(i<n1 && j<n2) { if(l[i]<r[j]) { a[k]=l[i]; i++; k++; } else { a[k]=r[j]; j++; k++; } } while(i<n1) { a[k]=l[i]; i++; k++; } while(j<n2) { a[k]=r[j]; j++; k++; } } int main(n) {scanf("%d",&n); int i,c=1,m=1,a[n]; for(i=0;i<n;i++) scanf("%d",&a[i]); mergesort(a,0,n-1); for(i=0;i<n-1;i++) { //printf("%d-> %d\n",a[i],c); if(a[i+1]==a[i]) c++; else if(c>m) { m=c; c=1; } else c=1; } if(c>m) m=c; printf("%d",m); }
#include <stdio.h> #include <stdlib.h> int main() { int i, j, nbrCoins, nbrPockets = 1, value_already_present_count = 0; scanf("%d", &nbrCoins); int *coin_value = (int *)malloc(nbrCoins * sizeof(int)); for (i = 0; i < nbrCoins; i++) { scanf("%d", &(*(coin_value + i))); value_already_present_count = 0; for (j = 0; j < i; j++) { if (*(coin_value + i) == *(coin_value + j)) { //printf("%d = %d\n", *(coin_value + i), *(coin_value + j)); value_already_present_count++; } } if (value_already_present_count == nbrPockets) { nbrPockets++; } } printf("%d\n", nbrPockets); free(coin_value); return 0; } // End of main
#include <stdio.h> int main() { int arr[100], freq[100]; int size, i, j, count; /* Input size of array */ //printf("Enter size of array: "); scanf("%d", &size); /* Input elements in array */ //printf("Enter elements in array: "); for(i=0; i<size; i++) { scanf("%d", &arr[i]); /* Initially initialize frequencies to -1 */ freq[i] = -1; } for(i=0; i<size; i++) { count = 1; for(j=i+1; j<size; j++) { /* If duplicate element is found */ if(arr[i]==arr[j]) { count++; /* Make sure not to count frequency of same element again */ freq[j] = 0; } } /* If frequency of current element is not counted */ if(freq[i] != 0) { freq[i] = count; } } int m=0; /* * Print frequency of each element */ //printf("\nFrequency of all elements of array : \n"); for(i=0; i<size; i++) { if(freq[i]>m) m=freq[i]; } printf("%d",m); return 0; }
#include<stdio.h> #include<stdlib.h> #include<string.h> void insertion_sort ( int* A , int n) { for( int i = 0 ;i < n ; i++ ) { /*storing current element whose left side is checked for its correct position .*/ int temp = A[ i ]; int j = i; /* check whether the adjacent element in left side is greater or less than the current element. */ while( j > 0 && temp < A[ j -1]) { // moving the left side element to one position forward. A[ j ] = A[ j-1]; j= j - 1; } // moving current element to its correct position. A[ j ] = temp; } } int main() { int n; scanf("%d",&n); int arr[n]; for(int i=0;i<n;i++) { scanf("%d",&arr[i]); } insertion_sort(&arr[0], n); // printf("Printed sorted array:\n"); // for(int i=0;i<n;i++) // { // printf("%d ",arr[i]); // } // printf("\n\n"); int max=1; int temp=0; for(int i=0;i<n;i++) { int count=1; temp=arr[i]; int j=i+1; while(arr[j]==temp) { // printf("For i: %d, checking arr[%d]\n",i,j); count++; // printf("count:%d\n\n",count); j++; } if(count>max) { max=count; } i+=(count-1); } printf("%d",max); return 0; }
#include <stdio.h> #include <stdlib.h> typedef struct heap { int data[101]; // save the num -> rank int num[101]; // save the cnt of number int rank[101]; // save rank -> num int n; }heap; heap *node; heap *init_node() { heap *root = (heap *)malloc(sizeof(heap)); root->n = 0; for (int i = 0; i < 101; i++) { root->num[i] = 0; root->data[i] = -1; root->rank[i] = 100000; } return root; } void max_heap(int i) { while (node->num[node->rank[(i-1)/2]] < node->num[node->rank[i]] && i > 0) { #ifdef mai printf ("i = %d, i-1/2 = %d\n", node->rank[i], node->rank[(i-1)/2]); #endif // mai int tmp = node->rank[i]; node->rank[i] = node->rank[(i-1)/2]; node->rank[(i-1)/2] = tmp; node->data[node->rank[(i-1)/2]] = (i-1)/2; node->data[node->rank[i]] = i; i = (i-1)/2; } return; } int main () { int n; scanf ("%d", &n); node = init_node(); for (int i = 0; i < n; i++) { int data; scanf ("%d", &data); node->num[data]++; if (node->data[data] == -1) { node->data[data] = node->n; node->rank[node->n] = data; node->n++; } #ifdef mai printf ("data = %d, num = %d\n", data, node->num[data]); #endif // mai max_heap(node->data[data]); } printf ("%d", node->num[node->rank[0]]); return 0; }
/*#include<stdio.h> int main() { char a[15]; int n; int i,num=0; scanf("%d",&n); getchar(); while(n--){ gets(a); for(i=0;a[i]!='\0';i++){ if(a[i]=='7'){ num++; } } printf("%d\n",num); num=0; } }*/ /*#include<stdio.h> int main() { int n; scanf("%d",&n); int m; int i; int j; char a[1000][30]; int b[1000][2]; for(i=1;i<=n;i++){ scanf("%d",&m); getchar(); for(j=1;j<=m;j++){ gets(a[j]); scanf("%d",&b[j][0]); } for(j=1;j<=m;j++){ printf("%d=%d",j,b[j][0]); puts(a[j]); } } } */ /*#include<stdio.h> int main() { int a[21][2]; int t; int i; int cnt; scanf("%d",&t); while(t--){ int n,m; scanf("%d %d",&n,&m); for(i=0;i<n;i++){ a[i][0]=i; a[i][1]=0; } cnt=0; int j; i=0; while(cnt!=n){ j++; i=(++i)%n; j-=a[i][1]; if(j%m==0){ printf("%d",a[i][0]); a[i][1]=1; cnt++; if(cnt!=n){ printf(" "); } } } printf("\n"); } } */ #include<stdio.h> int main() { int a[100][2]; int n; int number; int i; while(scanf("%d",&n)!=EOF){ for(i=0;i<n;i++){ a[i][1]=0; } scanf("%d",&a[0][0]); a[0][1]++; n--; int cn=1; while(n--){ scanf("%d",&number); int cntcnt=0; for(i=0;i<cn;i++){ if(number==a[i][0]){ cntcnt=1; a[i][1]++; break; } } if(cntcnt==0){ a[cn][0]=number; a[cn][1]++; cn++; } } /*{ for(i=0;i<cn;i++){ printf("%d have %d ge\n",a[i][0],a[i][1]); } }*/ int cntcnt; cntcnt=0; //number cntcnt�����޹ء� number=1; for(i=0;i<cn;i++){ if(a[i][1]>cntcnt){ number=a[i][0]; cntcnt=a[i][1]; } } printf("%d\n",cntcnt); } }
#include<stdio.h> int main(){ int a,i,j,n; scanf("%d",&a); int dizi[a],dizim[100]; for(i=0;i<100;i++){ dizim[i]=0 ; } for(i=0;i<a;i++){ scanf("%d",&dizi[i]); switch(dizi[i]){ case 1 : dizim[0]=dizim[0]+1 ; break ; case 2 : dizim[1]=dizim[1]+1 ; break ; case 3 : dizim[2]=dizim[2]+1 ; break ; case 4 : dizim[3]=dizim[3]+1 ; break ; case 5 : dizim[4]=dizim[4]+1 ; break ; case 6 : dizim[5]=dizim[5]+1 ; break ; case 7 : dizim[6]=dizim[6]+1 ; break ; case 8 : dizim[7]=dizim[7]+1 ; break ; case 9 : dizim[8]=dizim[8]+1 ; break ; case 10 : dizim[9]=dizim[9]+1 ; break ; case 11 : dizim[10]=dizim[10]+1 ; break ; case 12 : dizim[11]=dizim[11]+1 ; break ; case 13 : dizim[12]=dizim[12]+1 ; break ; case 14 : dizim[13]=dizim[13]+1 ; break ; case 15 : dizim[14]=dizim[14]+1 ; break ; case 16 : dizim[15]=dizim[15]+1 ; break ; case 17 : dizim[16]=dizim[16]+1 ; break ; case 18 : dizim[17]=dizim[17]+1 ; break ; case 19 : dizim[18]=dizim[18]+1 ; break ; case 20 : dizim[19]=dizim[19]+1 ; break ; case 21 : dizim[20]=dizim[20]+1 ; break ; case 22 : dizim[21]=dizim[21]+1 ; break ; case 23 : dizim[22]=dizim[22]+1 ; break ; case 24 : dizim[23]=dizim[23]+1 ; break ; case 25 : dizim[24]=dizim[24]+1 ; break ; case 26 : dizim[25]=dizim[25]+1 ; break ; case 27 : dizim[26]=dizim[26]+1 ; break ; case 28 : dizim[27]=dizim[27]+1 ; break ; case 29 : dizim[28]=dizim[28]+1 ; break ; case 30 : dizim[29]=dizim[29]+1 ; break ; case 31 : dizim[30]=dizim[30]+1 ; break ; case 32 : dizim[31]=dizim[31]+1 ; break ; case 33 : dizim[32]=dizim[32]+1 ; break ; case 34 : dizim[33]=dizim[33]+1 ; break ; case 35 : dizim[34]=dizim[34]+1 ; break ; case 36 : dizim[35]=dizim[35]+1 ; break ; case 37 : dizim[36]=dizim[36]+1 ; break ; case 38 : dizim[37]=dizim[37]+1 ; break ; case 39 : dizim[38]=dizim[38]+1 ; break ; case 40 : dizim[39]=dizim[39]+1 ; break ; case 41 : dizim[40]=dizim[40]+1 ; break ; case 42 : dizim[41]=dizim[41]+1 ; break ; case 43 : dizim[42]=dizim[42]+1 ; break ; case 44 : dizim[43]=dizim[43]+1 ; break ; case 45 : dizim[44]=dizim[44]+1 ; break ; case 46 : dizim[45]=dizim[45]+1 ; break ; case 47 : dizim[46]=dizim[46]+1 ; break ; case 48 : dizim[47]=dizim[47]+1 ; break ; case 49 : dizim[48]=dizim[48]+1 ; break ; case 50 : dizim[49]=dizim[49]+1 ; break ; case 51 : dizim[50]=dizim[50]+1 ; break ; case 52 : dizim[51]=dizim[51]+1 ; break ; case 53 : dizim[52]=dizim[52]+1 ; break ; case 54 : dizim[53]=dizim[53]+1 ; break ; case 55 : dizim[54]=dizim[54]+1 ; break ; case 56 : dizim[55]=dizim[55]+1 ; break ; case 57 : dizim[56]=dizim[56]+1 ; break ; case 58 : dizim[57]=dizim[57]+1 ; break ; case 59 : dizim[58]=dizim[58]+1 ; break ; case 60 : dizim[59]=dizim[59]+1 ; break ; case 61 : dizim[60]=dizim[60]+1 ; break ; case 62 : dizim[61]=dizim[61]+1 ; break ; case 63 : dizim[62]=dizim[62]+1 ; break ; case 64 : dizim[63]=dizim[63]+1 ; break ; case 65 : dizim[64]=dizim[64]+1 ; break ; case 66 : dizim[65]=dizim[65]+1 ; break ; case 67 : dizim[66]=dizim[66]+1 ; break ; case 68 : dizim[67]=dizim[67]+1 ; break ; case 69 : dizim[68]=dizim[68]+1 ; break ; case 70 : dizim[69]=dizim[69]+1 ; break ; case 71 : dizim[70]=dizim[70]+1 ; break ; case 72 : dizim[71]=dizim[71]+1 ; break ; case 73 : dizim[72]=dizim[72]+1 ; break ; case 74 : dizim[73]=dizim[73]+1 ; break ; case 75 : dizim[74]=dizim[74]+1 ; break ; case 76 : dizim[75]=dizim[75]+1 ; break ; case 77 : dizim[76]=dizim[76]+1 ; break ; case 78 : dizim[77]=dizim[77]+1 ; break ; case 79 : dizim[78]=dizim[78]+1 ; break ; case 80 : dizim[79]=dizim[79]+1 ; break ; case 81 : dizim[80]=dizim[80]+1 ; break ; case 82 : dizim[81]=dizim[81]+1 ; break ; case 83 : dizim[82]=dizim[82]+1 ; break ; case 84 : dizim[83]=dizim[83]+1 ; break ; case 85 : dizim[84]=dizim[84]+1 ; break ; case 86 : dizim[85]=dizim[85]+1 ; break ; case 87 : dizim[86]=dizim[86]+1 ; break ; case 88 : dizim[87]=dizim[87]+1 ; break ; case 89 : dizim[88]=dizim[88]+1 ; break ; case 90 : dizim[89]=dizim[89]+1 ; break ; case 91 : dizim[90]=dizim[90]+1 ; break ; case 92 : dizim[91]=dizim[91]+1 ; break ; case 93 : dizim[92]=dizim[92]+1 ; break ; case 94 : dizim[93]=dizim[93]+1 ; break ; case 95 : dizim[94]=dizim[94]+1 ; break ; case 96 : dizim[95]=dizim[95]+1 ; break ; case 97 : dizim[96]=dizim[96]+1 ; break ; case 98 : dizim[97]=dizim[97]+1 ; break ; case 99 : dizim[98]=dizim[98]+1 ; break ; case 100 : dizim[99]=dizim[99]+1 ; break ; } } for (i = 0; i < 99 ; i++){ for (j = 0; j < 99-i; j++){ if (dizim[j] > dizim[j+1]) { n=dizim[j]; dizim[j]=dizim[j+1]; dizim[j+1]=n;}}} printf("%d",dizim[99]); }
#include<stdio.h> int main() { int a,b,c,x,i,j,k; scanf("%d%d%d",&a,&b,&x); c=x/2; if(x%2==0&&x/2!=a) { c=c-1; a=a-1; printf("0"); } for(i=0;i<c;i++) { printf("10"); } a=a-c; b=b-c; for(j=0;j<b;j++) { printf("1"); } for(k=0;k<a;k++) { printf("0"); } printf("\n"); }
#include <stdio.h> #define swap(a,b) do{char t_=a;a=b;b=t_;}while(0) int main() { int n1, n2, x; char c1='0', c2='1'; scanf("%d %d %d",&n1, &n2, &x); if(n1<n2) { swap(n1, n2); swap(c1, c2); } int t = x/2; while(t--) putchar(c1), putchar(c2); n1-=x/2, n2-=x/2; if(x&1) { while(n1--) putchar(c1); while(n2--) putchar(c2); } else { while(n2--) putchar(c2); while(n1--) putchar(c1); } }
#include <stdio.h> #include <stdlib.h> int war(const void* a, const void*b) { return(*(int*)a-*(int*)b); } int main() { int a, b, x, m; scanf("%d%d%d", &a, &b, &x); m=1; x++; if(b>a)m=0; while(a+b>0) { if(x>1){x--; m=1-m;} else { if(m==0 && a==0){m=1; x--;} if(m==1 && b==0){m=0; x--;} } printf("%d", m); if(m==0)a--; if(m==1)b--; } return 0; }
#include <stdio.h> int a,b,x,i,j; char str[2222]; int main(){ scanf("%i%i%i",&a,&b,&x); if(a>b) str[i++]='0', j=0, a--; else str[i++]='1', j=1, b--; while(x--){ if(j%2) str[i++]='0', a--; else str[i++]='1', b--; j++; } char tmp = str[i-1]; i--; if(str[i-1]=='0') while(a--) str[i++]='0'; else while(b--) str[i++]='1'; if(tmp=='0') while(a--) str[i++]='0'; else while(b--) str[i++]='1'; str[i]=tmp; printf("%s\n", str); }
#include <stdio.h> #define Gg printf("¹ù¸ç"); #define T(a,b,c) printf("{ (%d) (%d) (%d) }",a,b,c); int main() { int a,b,x,flag=1; scanf("%d %d %d",&a,&b,&x); if(a<b) {int t=a;a=b;b=t;flag=0;} if(x%2==0){ printf("%d",1-flag);a--; while(x-2){ printf("%d%d",flag, 1-flag); x-=2,a--,b--; } while(b) printf("%d",flag),b--; while(a) printf("%d",1-flag),a--; } else { for(int i=0;i<a-1-x/2;i++) printf("%d",1-flag); for(int i=0;i<x/2+1;i++) printf("%d%d",1-flag,flag); for(int i=0;i<b-1-x/2;i++) printf("%d",flag); } return 0; }
#include<stdio.h> int a,b,x; char r[207]; void run(){ int i,j,t; while(scanf("%d%d%d",&a,&b,&x)!=EOF){ j=1; if(a>b){ t=a; a=b; b=t; j=0; } if(x%2==1){ for(i=0;i<(x-1)/2;i++){ printf("%d%d",j,1-j); } for(i=0;i<b-(x-1)/2;i++){ printf("%d",j); } for(i=0;i<a-(x-1)/2;i++){ printf("%d",1-j); } printf("\n"); continue; } for(i=0;i<x/2;i++){ printf("%d%d",j,1-j); } for(i=0;i<a-x/2;i++){ printf("%d",1-j); } for(i=0;i<b-x/2;i++){ printf("%d",j); } printf("\n"); } } main(){ #ifndef ONLINE_JUDGE freopen("4943b_min.in","rb",stdin); freopen("4943b_.out","wb",stdout); #endif run(); return 0; }
#include <stdio.h> int main(){ int a,b,x,k=0; scanf("%d%d%d",&a,&b,&x); char* arr=(char*)malloc((a+b+1)*sizeof(char)); if(a>=b) { while(x>0) { arr[k++]='0'; a--; x--; if(x==0) break; arr[k++]='1'; b--; x--; } } else { while(x>0) { arr[k++]='1'; b--; x--; if(x==0) break; arr[k++]='0'; a--; x--; } } if(arr[k-1]=='0') { while(a>0) { arr[k++]='0'; a--; } while(b>0) { arr[k++]='1'; b--; } } else { while(b>0) { arr[k++]='1'; b--; } while(a>0) { arr[k++]='0'; a--; } } arr[k]='\0'; printf("%s",arr); return 0; }
#include<stdio.h> int main() { int a, b, x, n, m, i, j, t=0; char s[300],tem,c,tm; scanf("%d%d%d",&a,&b,&x); if(a>b){ t=1; m=b; } else{ m=a; } n=a+b; for (i=1;i<=n;i++){ if(t==1){ if (b>0){ s[i-1]='1'; b--; } else s[i-1]='0'; } else { if (a>0){ s[i-1]='0'; a--; } else s[i-1]='1'; } } s[i-1]='\0'; // puts(s); for (i=2;i<=x;i++){ if(i%2==0){ tem=s[n-1]; c=s[0]; for (j=0;j<n-1;j++){ tm=s[1+j]; s[j+1]=c; c=tm; } s[0]=tem; } else{ c=s[0]; for (j=0;j<m;j++){ tm=s[1+j]; s[j+1]=c; c=tm; } s[0]=s[m]; m++; } } s[n]='\0'; puts(s); return 0; }
#include <stdio.h> #include <math.h> #include <string.h> int main(int argc, char const *argv[]) { int a,b,x; scanf("%d %d %d",&a,&b,&x); int flag=0; if (a>=b) { if (x%2==0) { a=a-1; x=x-1; flag=1; } for (int i = 0; i < (a-x/2); ++i) { printf("0"); } for (int j = 0; j < (x/2); ++j) { printf("10"); } for (int i = 0; i < (b-x/2); ++i) { printf("1"); } if (flag==1) { printf("0"); } } else { if (x%2==0) { b=b-1; x=x-1; flag=1; } for (int i = 0; i < (b-x/2); ++i) { printf("1"); } for (int j = 0; j < (x/2); ++j) { printf("01"); } for (int i = 0; i < (a-x/2); ++i) { printf("0"); } if (flag==1) { printf("1"); } } return 0; }
#define _USE_MATH_DEFINES #include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> #include <ctype.h> #include <stdbool.h> #include <float.h> #include <limits.h> #include <malloc.h> #include <memory.h> #include <complex.h> #include <errno.h> #include <time.h> #define Max(X,Y) ((X)>(Y) ? (X) : (Y)) #define Min(X,Y) ((X)<(Y) ? (X) : (Y)) #define MOD 998244353 #define N 105 int i,a,b,c,t,i; char t1,t2; int main() { scanf("%d %d %d",&a,&b,&c); if (b>a) { t=a; a=b; b=t; t1='1'; t2='0'; } else { t1='0'; t2='1'; } t=c>>1; if (c&1) { for (i=1;i<=b-t;i++) printf("%c",t2); for (i=1;i<=t;i++) printf("%c%c",t1,t2); for (i=1;i<=a-t;i++) printf("%c",t1); } else { for (i=1;i<=t;i++) printf("%c%c",t1,t2); for (i=1;i<=b-t;i++) printf("%c",t2); for (i=1;i<=a-t;i++) printf("%c",t1); } return 0; }
#include<stdio.h> int main(){ int i,j,c,a,b,x; scanf("%d%d%d",&a,&b,&x); if(x%2==1){ c = (x+1)/2; i = a-c; j = b-c; while(i--){ printf("0"); } while(c--){ printf("01"); } while(j--){ printf("1"); } }else{ c = x/2; if(a>=c+1){ i = a-c-1; j = b-c; while(i--){ printf("0"); } while(c--){ printf("01"); } while(j--){ printf("1"); } printf("0"); }else{ j = b-c-1; i = a-c; while(j--){ printf("1"); } while(c--){ printf("10"); } while(i--){ printf("0"); } printf("1"); } } return 0; }
#include<stdio.h> int main(){ int a,b,x; int A,B; scanf("%d %d %d",&a,&b,&x); int arr[210]={0}; if(x%2==1){ A=a-(x+1)/2; B=b-(x+1)/2; if(A==0 && B==0){ for(int i=0;i<a+b;){ arr[i]=0; arr[i+1]=1; i=i+2; } } if(A!=0 || B!=0){ for(int i=0;i<A;i++){ arr[i]=0; } for(int j=A;j<A+x;){ arr[j]=0; arr[j+1]=1; j=j+2; } for(int k=A+x;k<a+b;k++){ arr[k]=1; } } } else{ A=a-(x/2); B=b-(x/2); if(A==0 && B!=0){ for(int i=0;i<x;){ arr[i]=1; arr[i+1]=0; i=i+2; } for(int j=x;j<(x+B);j++){ arr[j]=1; } } else if(B==0 && A!=0){ for(int i=0;i<x;){ arr[i]=0; arr[i+1]=1; i=i+2; } for(int j=x;j<x+A;j++){ arr[j]=0; } } else if(A!=0 && B!=0){ for(int i=0;i<x;){ arr[i]=0; arr[i+1]=1; i=i+2; } for(int j=x;j<x+B;j++){ arr[j]=1; } for(int k=x+B;k<a+b;k++){ arr[k]=0; } } } for(int i=0;i<(a+b);i++){ printf("%d",arr[i]); } }
#include <stdio.h> #define N 200 void fill(int el_one, int *num_of_el_one, int el_two, int *num_of_el_two, int *arr, int maxit) { for (int i = 1; i <= maxit; i++, arr[0] += 1) { if (i % 2) { *num_of_el_one -= 1; arr[i] = el_one; continue; } *num_of_el_two -= 1; arr[i] = el_two; } } void pnumbers(int num, int quant) { for (int i = 0; i < quant; i++) printf("%d", num); } void print_two_ranges(int num1, int quant1, int num2, int quant2) { pnumbers(num1, quant1); pnumbers(num2, quant2); } void printAnswer(int *arr, int zero, int one) { for (int i = 1; i <= arr[0]; i++) printf("%d", arr[i]); if (arr[arr[0]]) print_two_ranges(1, one, 0, zero); else print_two_ranges(0, zero, 1, one); } int main() { int zero, one, x; int arr[N] = {0}; scanf("%d%d%d", &zero, &one, &x); if (zero >= one) fill(0, &zero, 1, &one, arr, x); else fill(1, &one, 0, &zero, arr, x); printAnswer(arr, zero, one); return 0; }
#include <stdio.h> #define MAX_LEN 200 void Print(char ch, int count) { while (count > 0) { printf("%c", ch); count -= 1; } } int main() { int zeros, ones, switches; scanf("%d%d%d", &zeros, &ones, &switches); char str[MAX_LEN + 5]; str[0] = '\0'; int index = 0; while (switches > 1) { str[index] = '0'; str[index + 1] = '1'; str[index + 2] = '\0'; index += 2; switches -= (index == 2 ? 1 : 2); zeros -= 1; ones -= 1; if (ones <= 0 || zeros <= 0) { break; } } if (switches == 0) { Print('0', zeros); printf("%s", str); Print('1', ones); } else if (switches == 1) { if (zeros == 0) { Print('1', ones); printf("%s", str); } else { printf("%s", str); Print('1', ones); Print('0', zeros); } } else { printf("%s", str); Print('0', zeros); Print('1', ones); } return 0; }
#include<stdio.h> int main() { int a,b,x,i,p,q,r; scanf("%d %d %d",&a,&b,&x); if(a>=b) { p=(x+1)/2; q=b-p; r=a-p-1; for(i=1;i<=r;i=i+1) { printf("0"); } if((x+1)%2==0 && r+1>0) { printf("0"); } printf("01"); for(i=1;i<=q;i=i+1) { printf("1"); } for(i=1;i<=(p-1);i=i+1) { printf("01"); } if((x+1)%2!=0) { printf("0"); } } else if(a<b) { p=(x+1)/2; q=a-p; r=b-p-1; for(i=1;i<=r;i=i+1) { printf("1"); } if((x+1)%2==0 && r+1>0) { printf("1"); } printf("10"); for(i=1;i<=q;i=i+1) { printf("0"); } for(i=1;i<=(p-1);i=i+1) { printf("10"); } if((x+1)%2!=0) { printf("1"); } } }
#include <stdio.h> static int a, b, x; static char out[203]; int main(void) { int i; scanf("%d %d %d", &a, &b, &x); char ZERO, ONE; if (a < b) { int tmp = a; a = b; b = tmp; ZERO = '1'; ONE = '0'; } else { ZERO = '0'; ONE = '1'; } for (i = 0; i < x; i++) { if (i % 2) { out[i] = ONE; b --; } else { out[i] = ZERO; a --; } } if (out[i-1] == ONE) { while (b--) out[i++] = ONE; while (a--) out[i++] = ZERO; } else { while (a--) out[i++] = ZERO; while (b--) out[i++] = ONE; } out[i++] = '\n'; out[i++] = '\0'; fputs(out, stdout); return 0; }
#include <stdio.h> #include <stdlib.h> int main() { int ones, zeros, ind; scanf("%d %d %d", &zeros, &ones, &ind); char *s = malloc((ones + zeros + 1) * sizeof(char)); int k = 0, flag = 1, n = ones + zeros; char prev; k = 1; if (ind % 2 == 0 && zeros >= ones) { s[0] = '0'; zeros--; prev = '0'; } else { s[0] = '1'; ones--; prev = '1'; } while (k < n) { if (ind >= 2 && prev == '1') { s[k] = '0'; prev = '0'; zeros--; } else if (ones && ind != 1) { if (ones) { s[k] = '1'; prev = '1'; ones--; } } else { if (prev == '1') { while (ones) { s[k] = '1'; ones--; k++; } while (zeros) { s[k] = '0'; zeros--; k++; } } else { while (zeros) { s[k] = '0'; zeros--; k++; } while (ones) { s[k] = '1'; ones--; k++; } } break; } if ((s[k] == '0' && s[k - 1] == '1') || (s[k] == '1' && s[k - 1] == '0')) { ind--; } k++; } s[k] = '\0'; printf("%s", s); free(s); return 0; }
#include <stdio.h> #include <stdlib.h> int main() { int a, b, y; scanf("%d %d %d", &a, &b, &y); int n0, n1; n0 = 0; n1 = 0; int x = y; int printed1 = 0; if (a > b) { printed1 = 0; } else { printed1 = 1; } if (x != 1) { while (x > 0) { if (printed1 == 0) { printf("0"); n0++; x--; printed1 = 1; } else { printf("1"); n1++; x--; printed1 = 0; } } } // if (printed1 == 0) { for (int i = 0; i < b - n1; i++) { printf("1"); } for (int i = 0; i < a - n0; i++) { printf("0"); } } else { for (int i = 0; i < a - n0; i++) { printf("0"); } for (int i = 0; i < b - n1; i++) { printf("1"); } } //printf("\n%d %d %d %d", a, b, n0, n1); return 0; }
#include <stdio.h> #include <stdlib.h> #include <math.h> int main() { int m,p,i,n,t,a1=0,b1=0,a; scanf("%d%d%d",&n,&m,&p); if(n<m) { int a=1; for(i=1;i<=p;i++) { printf("%d",a); if(a) a1++; else b1++; a=a==1?0:1; } if(a==0) { for(i=1;i<=m-a1;i++) printf("1"); for(i=1;i<=n-b1;i++) printf("0"); } else { for(i=1;i<=n-b1;i++) printf("0"); for(i=1;i<=m-a1;i++) printf("1"); } } else { int a=0; for(i=1;i<=p;i++) { printf("%d",a); if(a) a1++; else b1++; a=a==1?0:1; } if(a==0) { for(i=1;i<=m-a1;i++) printf("1"); for(i=1;i<=n-b1;i++) printf("0"); } else { for(i=1;i<=n-b1;i++) printf("0"); for(i=1;i<=m-a1;i++) printf("1"); } } return 0; }
#include<stdio.h> #include<string.h> #include<stdlib.h> int main(){ int a,b,x; scanf("%d%d%d",&a,&b,&x); int n=a+b; char str[n+1]; str[n]='\0'; int groups=x+1,i=0; int k=0; if(a>b){ while(groups>2){ if((k%2)==0){ str[i++]='0'; a--; groups--; k++; }else{ str[i++]='1'; b--; groups--; k++; } } if(str[i-1]=='0'){ for(int count=0;count<b;count++){ str[i++]='1'; } for(int count=0;count<a;count++){ str[i++]='0'; } }else{ for(int count=0;count<a;count++){ str[i++]='0'; } for(int count=0;count<b;count++){ str[i++]='1'; } } }else{ while(groups>2){ if((k%2)==0){ str[i++]='1'; b--; groups--; k++; }else{ str[i++]='0'; a--; groups--; k++; } } if(str[i-1]=='0'){ for(int count=0;count<b;count++){ str[i++]='1'; } for(int count=0;count<a;count++){ str[i++]='0'; } }else{ for(int count=0;count<a;count++){ str[i++]='0'; } for(int count=0;count<b;count++){ str[i++]='1'; } } } printf("%s\n",str); return 0; }
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> #include <stdbool.h> int A, B, X, count = 0; int main() { scanf("%i %i %i", &A, &B, &X); char string[A + B + 1]; string[A + B] = '\0'; if(A >= B) { for(int i = 0; i < A; i++) { string[i] = '0'; } for(int i = A; i < A + B; i++) { string[i] = '1'; } } else { for(int i = 0; i < B; i++) { string[i] = '1'; } for(int i = B; i < A + B; i++) { string[i] = '0'; } } count++; int loc_0, loc_1; if(A>=B) { loc_0 = 1; loc_1 = A; } else { loc_0 = 1; loc_1 = B; } while(count < X) { //Increments by 2 by replacing 0 with 1 from second to last 0 int temp = string[loc_0]; string[loc_0] = string[loc_1]; string[loc_1] = temp; count += 2; loc_0 += 2; loc_1++; } count = 0; for(int i = 0; i < A + B - 1; i++) { if(string[i] != string[i + 1]) { count++; } } //If X is even if(count > X) { int temp = string[0]; string[0] = string[1]; string[1] = temp; } printf("%s", string); exit(0); }
#include<stdio.h> #include<math.h> int main() { int a,b,x; scanf("%d %d %d",&a,&b,&x); int d=a+b; int i; char arr[d]; if(x%2==0) { if(a>b) { for(i=0;i<(a-(x/2));i++) arr[i]=0; int l=i; for(l=i;l<=(i+b-(x/2));l++) { arr[l]=1; } int k=l; for(k=l;k<d;k+=2) { arr[k]=0; if(k+1<d) arr[k+1]=1; } } else{ for(i=0;i<(b-(x/2));i++) arr[i]=1; int l=i; for(l=i;l<=(i+a-(x/2));l++) { arr[l]=0; } int k=l; for(k=l;k<d;k+=2) { arr[k]=1; if(k+1<d) arr[k+1]=0; } } } else{ for(i=0;i<(a-(x/2));i++) arr[i]=0; int l=i; for(l=i;l<(i+b-x/2);l++) { arr[l]=1; } int k=l; for(k=l;k<d;k+=2) { arr[k]=0; if(k+1<d) arr[k+1]=1; } } int q; for(q=0;q<d;q++) { printf("%d",arr[q]); } return 0; }
#include<stdio.h> #include<string.h> int main() { int i,j,k,l,c,n,m,x,y,z; scanf("%d%d%d",&n,&z,&x); char a[n+z+1]; if(n>=z) { if(x%2!=0) { k=(x/2)+1; for(i=0;i<z-k;i++) { a[i]='1'; } c=0; for(i=z-k;i<z+k;i++) { if(c%2==0) { a[i]='1'; c++; } else { a[i]='0'; c++; } } for(i=z+k;i<n+z;i++) { a[i]='0'; } a[n+z]='\0'; printf("%s",a); } else { a[0]='0'; k=(x/2); for(i=1;i<z-k+1;i++) { a[i]='1'; } c=1; for(i=z-k+1;i<z+k+1;i++) { if(c%2!=0) { a[i]='1'; c++; } else { a[i]='0'; c++; } } for(i=z+k+1;i<n+z;i++) { a[i]='0'; } a[n+z]='\0'; printf("%s",a); } } ///////////////////////////////////////////////////////// else { if(x%2!=0) { k=(x/2)+1; for(i=0;i<n-k;i++) { a[i]='0'; } c=0; for(i=n-k;i<n+k;i++) { if(c%2==0) { a[i]='0'; c++; } else { a[i]='1'; c++; } } for(i=n+k;i<n+z;i++) { a[i]='1'; } a[n+z]='\0'; printf("%s",a); } else { a[0]='1'; k=(x/2); for(i=1;i<n-k+1;i++) { a[i]='0'; } c=1; for(i=n-k+1;i<n+k+1;i++) { if(c%2!=0) { a[i]='0'; c++; } else { a[i]='1'; c++; } } for(i=n+k+1;i<n+z;i++) { a[i]='1'; } a[n+z]='\0'; printf("%s",a); } } return 0; }
#include<stdio.h> #include<string.h> int main() { int a,b,x,i,r=0,p=0,q=0,l; scanf("%d %d %d",&a,&b,&x); char str[201]; if(x>=2) { for(i=0;i<a+b;i++) { if(i==0){ if(a>1 && 2*a!=x) {str[i]='0'; printf("%c",str[i]); p++;} else { str[i]='1'; printf("%c",str[i]); q++; } } else { if(str[i-1]=='0') { str[i]='1'; printf("%c",str[i]); q++; r++; if(r==x-1) {l=i; break;} } else { str[i]='0'; printf("%c",str[i]); p++; r++; if(r==x-1) { l=i; break; } } } } if(str[l]=='0') { int g,h; g=a-p; h=b-q; while(g--) { printf("0"); } while(h--) { printf("1"); } } else { int g,h; g=a-p; h=b-q; while(h--) { printf("1"); } while(g--) { printf("0"); } } } else { while(a--) printf("0"); while(b--) printf("1"); } return 0; }
#include <stdio.h> #include <string.h> #include <stdbool.h> #include <assert.h> #define clr(ar) memset(ar, 0, sizeof(ar)) #define read() freopen("lol.txt", "r", stdin) bool visited[3][101][101][202], dp[3][101][101][202]; bool F(int l, int a, int b, int x){ if (x < 0) return false; if (a == 0 && b == 0) return (x == 0); if (visited[l][a][b][x]) return dp[l][a][b][x]; bool res = false; if (a){ if (l == 0) res |= F(0, a - 1, b, x); else res |= F(0, a - 1, b, x - 1); } if (b){ if (l == 1) res |= F(1, a, b - 1, x); else res |= F(1, a, b - 1, x - 1); } visited[l][a][b][x] = true; return (dp[l][a][b][x] = res); } bool backtrack(int l, int a, int b, int x){ if (x < 0) assert(0); if (a == 0 && b == 0){ puts(""); return; } if (a){ if (l == 0 && F(0, a - 1, b, x)){ putchar('0'); return backtrack(0, a - 1, b, x); } if (l != 0 && F(0, a - 1, b, x - 1)){ putchar('0'); return backtrack(0, a - 1, b, x - 1); } } if (b){ if (l == 1 && F(1, a, b - 1, x)){ putchar('1'); return backtrack(1, a, b - 1, x); } putchar('1'); return backtrack(1, a, b - 1, x - 1); } assert(0); } int main(){ int a, b, x; while (scanf("%d %d %d", &a, &b, &x) != EOF){ clr(visited); assert(F(2, a, b, x + 1)); backtrack(2, a, b, x + 1); } return 0; }
#include<stdio.h> int smaller(int a,int b) {if(a<b) return a; else return b;} int MAX(int a,int b) { if(a==b) return a*2-1; else return (smaller(a,b))*2; } int check(char *a) { int i=0,n=0; while((*(a+i+1))!='\0') { if((*(a+i))!=(*(a+i+1))) n++; i++; } return n; } void swap(char *a,char *b) {int c=*a; *a=*b; *b=c;} void solution(int a,int b,int x) { char ans[a+b+1]; int n=a+b,i,t; int done0=0; int done1=0; for(i=0;i<=n;i++) ans[i]='\0'; if(x==1) { for(i=0;i<a;i++) printf("0"); for(i=0;i<b;i++) printf("1"); printf("\n"); return; } if(x==MAX(a,b)) { if(a==b) { for(i=0;i<a;i++) printf("01"); printf("\n"); return; } if(a>b) { for(i=0;i<b;i++) printf("01"); for(;i<a;i++) printf("0"); printf("\n"); return; } else { for(i=0;i<a;i++) printf("10"); for(;i<b;i++) printf("1"); printf("\n"); return; } } if(a>b) { for(i=0,t=0;i<x;i++) { ans[t++]='0'; done0++; if(x==check(ans)) break; ans[t++]='1'; done1++; if(x==check(ans)) break; } for(i=0;i<a-done0+1;i++) printf("0"); for(i=0;i<b-done1+1;i++) printf("1"); for(i=2;ans[i];i++) { printf("%c",ans[i]); } printf("\n"); return; } else { for(i=0,t=0;i<x;i++) { ans[t++]='1'; done1++; if(x==check(ans)) break; ans[t++]='0'; done0++; if(x==check(ans)) break; } for(i=0;i<b-done1+1;i++) printf("1"); for(i=0;i<a-done0+1;i++) printf("%d",0); for(i=2;ans[i];i++) { printf("%c",ans[i]); } printf("\n"); return; } return; } int main() { int a,b,x; scanf("%d%d%d",&a,&b,&x); getchar(); solution(a,b,x); return 0; }
#include <stdio.h> #include <stdlib.h> int main(){ int a,b,x; scanf("%d %d %d",&a,&b,&x); int n = a+b; int count = 1; int arr[x+1]; int i; if(x>=(a+b)){ return 0; } else if(a>b){ if(x > (2*b)){ return 0; } int zeroCount=1; int oneCount=0; int flag = 0; arr[0]=flag; while(count != (x+1)){ if(flag == 1){ flag =0; zeroCount++; } else{ flag =1; oneCount++; } arr[count]=flag; count ++; } if(arr[x] == 1){ for(i=0;i<(a-zeroCount);i++){ printf("0"); } for(i=0;i<=x;i++){ printf("%d",arr[i]); } for(i=0;i<(b -oneCount);i++){ printf("1"); } } else{ for(i=0;i<(a-zeroCount);i++){ printf("0"); } printf("%d",arr[0]); for(i=0;i<(b-oneCount);i++){ printf("1"); } for(i=1;i<=x;i++){ printf("%d",arr[i]); } } } else if(a<=b){ if(a!=b){ if(x > (2*a)){ return 0 ; } } if(a==b){ if(x > (2*a - 1)){ return 0; } } // printf("I am here"); int zeroCount=0; int oneCount=1; int flag = 1; arr[0]=flag; while(count != (x+1)){ if(flag == 1){ flag = 0; zeroCount = zeroCount +1; } else{ flag =1; oneCount = oneCount +1; } arr[count]=flag; count ++; } //printf("%d\n",oneCount); //printf("%d\n",zeroCount); if(arr[x] == 0){ for(i=0;i<(b-oneCount);i++){ printf("1"); } //printf("\n"); for(i=0;i<=x;i++){ printf("%d",arr[i]); } //printf("\n"); for(i=0;i<(a-zeroCount);i++){ printf("0"); } } else{ for(i=0;i<(b-oneCount);i++){ printf("1"); } printf("%d",arr[0]); for(i=0;i<(a-zeroCount);i++){ printf("0"); } for(i=1;i<=x;i++){ printf("%d",arr[i]); } } } return 0; }
/*#include<stdio.h> int main() { char a[15]; int n; int i,num=0; scanf("%d",&n); getchar(); while(n--){ gets(a); for(i=0;a[i]!='\0';i++){ if(a[i]=='7'){ num++; } } printf("%d\n",num); num=0; } }*/ /*#include<stdio.h> int main() { int n; scanf("%d",&n); int m; int i; int j; char a[1000][30]; int b[1000][2]; for(i=1;i<=n;i++){ scanf("%d",&m); getchar(); for(j=1;j<=m;j++){ gets(a[j]); scanf("%d",&b[j][0]); } for(j=1;j<=m;j++){ printf("%d=%d",j,b[j][0]); puts(a[j]); } } } */ /*#include<stdio.h> int main() { int a[21][2]; int t; int i; int cnt; scanf("%d",&t); while(t--){ int n,m; scanf("%d %d",&n,&m); for(i=0;i<n;i++){ a[i][0]=i; a[i][1]=0; } cnt=0; int j; i=0; while(cnt!=n){ j++; i=(++i)%n; j-=a[i][1]; if(j%m==0){ printf("%d",a[i][0]); a[i][1]=1; cnt++; if(cnt!=n){ printf(" "); } } } printf("\n"); } } */ /* 1 1 2*1-1 qian 2 1 2*1 zhong 3 2 2*2-1 qian 4 2 2*2 5 3 6 3 a=0 b=1 010100011111111*/ #include<stdio.h> int main() { int a,b,c; int i,j,k; int aa,bb; int number[201]; while(scanf("%d %d %d",&a,&b,&c)!=EOF){ if(a>b){ if(c%2==0){ //1 2 2 101 bb=c/2; for(i=0;i<2*bb;i+=2){ number[i]=0;printf("%d",number[i]); number[i+1]=1;printf("%d",number[i+1]); } for(j=i;j<i+(b-bb);j++){ number[j]=1;printf("%d",number[j]); } for(k=j;k<j+(a-i/2);k++){ number[k]=0;printf("%d",number[k]); } { printf("\n"); /*for(i=0;i<a+b;i++){ printf("%d ",number[i]); }*/ } }else{ //3 2 3 1 0 1 1 0 0 0 bb=(c+1)/2; for(i=0;i<2*(bb-1);i+=2){ number[i]=1;printf("%d",number[i]); number[i+1]=0;printf("%d",number[i+1]); } for(j=i;j<i+b-(bb-1);j++){ number[j]=1;printf("%d",number[j]); } for(k=j;k<j+a-(bb-1);k++){ number[k]=0;printf("%d",number[k]); } printf("\n"); } }else{ int t; t=a; a=b; b=t; if(c%2==0){ //1 2 2 101 bb=c/2; for(i=0;i<2*bb;i+=2){ number[i]=1;printf("%d",number[i]); number[i+1]=0;printf("%d",number[i+1]); } for(j=i;j<i+(b-bb);j++){ number[j]=0;printf("%d",number[j]); } for(k=j;k<j+(a-i/2);k++){ number[k]=1;printf("%d",number[k]); } { printf("\n"); /*for(i=0;i<a+b;i++){ printf("%d ",number[i]); }*/ } }else{ //3 2 3 1 0 1 1 0 0 0 bb=(c+1)/2; for(i=0;i<2*(bb-1);i+=2){ number[i]=0;printf("%d",number[i]); number[i+1]=1;printf("%d",number[i+1]); } for(j=i;j<i+b-(bb-1);j++){ number[j]=0;printf("%d",number[j]); } for(k=j;k<j+a-(bb-1);k++){ number[k]=1;printf("%d",number[k]); } printf("\n"); } } } }
#include <stdio.h> int main() { int n,k,i,j;double t,sum[10000]={0},max=0; scanf("%d %d",&n,&k); for(i=1;i<=n;i++)scanf("%lf",&t),sum[i]=sum[i-1]+t; max = sum[n]/n; for(j=k;j<=n;j++)for(i=j;i<=n;i++)max = max<(sum[i]-sum[i-j])/j?(sum[i]-sum[i-j])/j:max; printf("%.9f",max); }
#include<stdio.h> double max(double a,double b){ double t; t=a; if(b>t){ t=b; } return t; } int main(){ int n,k,i,j; scanf("%d%d",&n,&k); int a[n];a[0]=0;double ans=0; for(i=1;i<=n;i++){ scanf("%d",&a[i]); a[i]=a[i]+a[i-1]; } for(i=0;i<=n;i++){ for(j=i+k;j<=n;j++){ ans=max(ans,1.0*(a[j]-a[i])/(j-i)); } } printf("%lf",ans); }
#include <stdlib.h> #include <stdio.h> int main(void) { double ans = 0, sum = 0, a[5005], s[5005]; int n, k; s[0] = 0; scanf("%d%d", &n, &k); int i, j, m; for (i = 0; i < n; i++) { scanf("%lf", &a[i]); s[i+1] = s[i] + a[i]; } for (;k <= n; k++) { for (i = 0; i <= n-k; i++) { sum = s[i+k] - s[i]; sum /= k; ans = (ans >= sum)? ans : sum; } } printf("%lf\n", ans); return 0; }
#include <stdio.h> int n,k,i,tmp,pre, prefix[5555], *arr=&prefix[3]; long double max= -1; int main(){ for(scanf("%i%i",&n,&k);i<n;i++) { scanf("%i", &tmp); arr[i]=tmp+arr[i-1]; } for(int i=k ; i<=n ; i++) { for(int j=0; j<=n-i ; j++) { if((1.0*(arr[j+i-1]-arr[j-1])/i ) > max ) max = 1.0*(arr[j+i-1]-arr[j-1])/i; } } printf("%.15Lf\n", max); }
#include <stdio.h> int main(void) { int n,k,num[5001],cum[5001]={0}; double max=0, con[5001],temp; int i,j; scanf("%d%d%d",&n,&k,&num[0]); cum[0]=num[0]; for(i=1;i<n;++i){ scanf("%d",&num[i]); cum[i] = cum[i-1]+num[i]; } cum[-1]=0; for(i=0;i<n;++i){ for(j=i+k-1;j<n;++j){ temp = ((cum[j]-cum[i-1])*1.0)/(j-i+1); //printf("%lf ",temp); if(temp>max) max=temp; } } //for(i=0;i<n;++i) printf("\n%d ",cum[i]); printf("%.13f",max); return 0; }
#include <stdio.h> #include <stdlib.h> double sum[10000]; int main() { double n, k, i, j, m; scanf("%lf%lf", &n, &k); n++; m=-100; for(i=1; i<n; i++) { scanf("%lf", &sum[(int)i]); sum[(int)i]+=sum[(int)i-1]; } for(i=k; i<n; i++) { for(j=i; j<n; j++) { if((sum[(int)j]-sum[(int)j-(int)i])/i>m)m=(sum[(int)j]-sum[(int)j-(int)i])/i; } } printf("%.15lf", m); return 0; }
#include<stdio.h> int main() { double n, k; double num[5000]={0,}, sum[5000]={0,}; scanf("%lf %lf", &n, &k); for(int i=0; i<n; i++) scanf("%lf", &num[i]); for(int i=k; i<=n; i++){ int ssum=0; for(int j=0; j<i; j++){ ssum+=num[j]; } sum[i]=ssum; for(int j=0; j<n-i; j++){ ssum=ssum-num[j]+num[j+i]; if(sum[i]<ssum) sum[i]=ssum; } } double max=0; for(int i=k; i<=n; i++){ if(max<sum[i]/(double)i){ max=sum[i]/(double)i; } } printf("%lf", max); }
#include <stdio.h> int main(){ int i, k, n, temp[5000], sum[5001], c, dlina,nachalo ; float max, z; scanf("%d%d", &n, &k); for(i=0; i < n; ++i){ scanf("%d", &temp[i]); } c = 0; for(i=0; i < n; ++i){ c += temp[i]; sum[i+1] = c; } sum[0]=0; max = 0; for(dlina = n; dlina >= k; dlina--){ for( nachalo = 1; nachalo+dlina-1 <= n;nachalo++){ z =(sum[nachalo+dlina-1]-sum[nachalo-1])/(float)dlina; if (max < z){ max = z; } } } printf("%f", max); return 0; }
#include <stdio.h> int A[5001]; int main() { int n, k, a; scanf("%d %d", &n, &k); for(int i = 1; i <= n; ++i) { scanf("%d", &a); A[i] = A[i - 1] + a; } int max = 1; int maxLen = 1; for(int i = 1; i <= n; ++i) { for(int j = i + k - 1; j <= n; ++j) { if((long long)max * (j - i + 1) < (long long)maxLen * (A[j] - A[i - 1])) { max = A[j] - A[i - 1]; maxLen = j - i + 1; } } } printf("%f\n", 1.0 * max / maxLen); return 0; }
#include<stdio.h> int n,k; int a[5005]; void Nhap() { scanf("%d %d",&n,&k); for(int i=1; i<=n; i++) scanf("%d",&a[i]); a[0]=0; for(int i=1; i<=n; i++) a[i]+=a[i-1]; } void XuLi() { int tmp; double kq,maxx=0; for(int i=0; i<=n; i++) { for(int j=i+k; j<=n; j++) { tmp=a[j]-a[i]; kq=(double)tmp/(j-i); // printf("%f\n",kq); if(kq>maxx) maxx=kq; } } printf("%.15f",maxx); } int main() { // init(); Nhap(); XuLi(); }
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> int main() { int n, k; int a[5000]; int subsum[5001]; long double max = 0; scanf("%d %d", &n, &k); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); } subsum[0] = 0; for (int i = 1; i <= n; i++) { subsum[i] = subsum[i - 1] + a[i-1]; } for (; k <= n; k++) { for (int m = k; m <= n; m++) { if ((long double)(subsum[m] - subsum[m - k]) / k > max) { max = (long double)(subsum[m] - subsum[m - k]) / k; } } } printf("%Lf", max); return 0; }
#include<stdio.h> #include<string.h> #define sc(x) {register char c7=getchar(),v7=1;for(x=0;c7<48||c7>57;c7=getchar())if(c7==45)v7=-1;for(;c7>=48&&c7<=57;x=(x<<1)+(x<<3)+c7-48,c7=getchar());x*=v7;} int a[5678], _s[5678], *s = _s+1; int main() { int n, k, now, i, j, ub, up, cnt; double avr, sum; sc(n)sc(k) for(i=0; i<n; i++) { sc(a[i]) s[i] = s[i-1]+a[i]; } int p=1, max=0; for(i=k; i<=n; i++) for(j=0; j<=n-i; j++) { int t=s[j+i-1]-s[j-1]; if((double)t/i>(double)max/p) max=t,p=i; } printf("%.8lf\n",1.0*max/p); }
#include <stdio.h> int main(){ long int n, k,p,u; scanf("%ld %ld",&n,&k); long int a[n]; for(p = 0; p < n; p++) { scanf("%ld ",&a[p]); } double mx=0.0; for(p = 0; p < n; p++) { long int s=0; for(u=p; u < n; u++) { s += a[u]; if((u - p) + 1 >= k) { double avg; avg=(double)s/(double)((u-p)+1); mx = (mx > avg) ? mx : avg; } } } printf("%.7f", mx); return 0; }
#include <stdio.h> #define MAX(x,y) x>y?x:y int t[5001]; long long p[5001]; int main(void) { // your code goes here int days; scanf("%d",&days); int max_sum=0; double max=0; double tmp=0;//tmp max int k; scanf("%d",&k); t[0]=0; p[0]=0; int i=1; for(;i<=days;i++) { scanf("%d",&t[i]); //input p[i]=p[i-1]+t[i];//prefix sum array } int j=k; for(;j<=days;j++) { for(i=0;i<=days-j;i++) { max_sum= MAX(max_sum,p[i+j]-p[i]); } tmp= (double)max_sum/j; max= MAX(max,tmp); } printf("%0.10f\n",max); return 0; }
#include<stdio.h> #define lint long long lint a[10005]; lint n, k; lint query(lint l, lint r) { lint res = 0; for( l+=n, r+=n; l<r; l>>=1, r>>=1 ) { if( l&1 ) res += a[l++]; if( r&1 ) res += a[--r]; } return res; } int main() { scanf("%lld%lld", &n, &k); for( lint i=0; i<n; ++i ) scanf("%lld", a+n+i); for( lint i=n-1; i>0; --i ) a[i] = a[i<<1] + a[i<<1|1]; lint an = 0, ad = 1; for( lint i=k; i<=n; ++i ) for( lint j=0; j+i <= n; ++j ) { // an*i, query(j, j+i)*ad lint t = query(j, j+i); if( an*i < t*ad ) an = t, ad = i; } printf("%.8Lf\n", ((long double)an)/((long double)ad)); }
#include <stdio.h> int main() { int j, n, k, a[5500], i, sum, m; double max = -1, t; scanf("%d %d", &n, &k); for( i = 0;i < n;i++ ) scanf("%d", &a[i]); for( i = 0;i < n - k + 1;i++ ) { sum = 0; for( j = i;j < k + i;j++ ) { sum += a[j]; t = 1.0 * sum / k; if( t > max ) max = t; } for( m = 1;j < n;j++,m++ ) { sum += a[j]; t = 1.0 * sum / (k + m); if( t > max ) max = t; } } printf("%.15f\n", max); }
#include<stdio.h> int arr[5001]; int prefix[5001]; int n, k; int i, j; int main() { scanf("%d", &n); scanf("%d", &k); prefix[0]=arr[0] = 0; for (i = 1; i <= n; i++) { scanf("%d", &arr[i]); prefix[i] = prefix[i - 1]+ arr[i]; // printf("%d ", prefix[i]); } // printf("\n"); double avg = 0; double max = 0; for (i = 1; i <= n - k + 1; i++) { int tmpk = k; while (i+tmpk-1<=n) { avg=(double)(prefix[i + tmpk - 1] - prefix[i-1]) / tmpk; // printf("k:%d avg : %.2f\n",tmpk, avg); if (avg > max) max = avg; // printf("max : %.2f\n", max); tmpk++; } } printf("%.10f\n", max); }
#include <stdio.h> #define MAX(a, b) ((a) > (b) ? (a) : (b)) static int k; static int n; static int A[5000]; int main(void) { int i, j; int sum; double avg; scanf("%d %d", &n, &k); for (i = 0; i < n; i++) { scanf("%d", &A[i]); } avg = 0.0; for (i = 0; i <= n - k; i++) { sum = 0; for (j = i; j < n; j++) { sum += A[j]; if (j - i + 1 >= k) avg = MAX(avg, (double) sum / (j-i+1)); } } printf("%.12lf\n", avg); return 0; }
#include<stdio.h> int main() { int i,j,n,k,flag; double a[5001],chu,max=0,sum; scanf("%d%d",&n,&k); for(i=0;i<n;i++) scanf("%lf",&a[i]); /* for(i=0;i<n;i++) printf("%.0f ",a[i]); printf("\n");*/ for(i=0;i<n;i++) { sum=0; flag=0; for(j=i;j<n;j++) { sum+=a[j]; /*printf("sum=%.0f\n",sum);*/ flag+=1; /* printf("flag=%d\n",flag);*/ if(flag>=k) { chu=sum/(flag*1.0); /* printf("chu=sum/(flag*1.0)=%.0f/(%d*1.0)\n",sum,flag); printf("赋值前max=%.15f\n",max);*/ if(chu>max) max=chu; /* printf("赋值后max=%.15f\n",max);*/ } } } printf("%.15f",max); return 0; }
#include<stdio.h> double max(double*a, int n); int main() { int n,k,i=0,count,j=0,c=0; int a[5005]; double arif=0; double MAXI=-10; scanf("%d%d",&n,&k); for(i=0;i<n;i++) scanf("%d",&a[i]); count=k; i=0; /*while((count<=n)&&(i<n)) { if(c<count) { arif+=a[i]; i++; c++; } if(c==count) { arif=arif/count; if(arif>MAXI) MAXI=arif; c=0; arif=0; if(i<n) i=i-count+1; } if(i>=n) { i=0; count++; } }*/ for(i=0;i<n;i++) { arif=0; for(j=i;j<n;j++) { arif+=a[j]; if(j-i+1>=k) { if(arif/(j-i+1)>MAXI) MAXI=arif/(j-i+1); } } } printf("%.15f\n",MAXI); return 0; }
#include<stdio.h> #include<stdlib.h> int n, k, a[5001]; int total[5001]; double ans = 0.0; double cal(int start, int step){ return (total[start+step-1]-total[start-1])/(step*1.0); } int main(){ scanf("%d%d",&n,&k); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } total[0]=0; total[1]=a[1]; for(int i=2;i<=n;i++){ total[i]=total[i-1]+a[i]; } for(int i=k;i<=n;i++){ for(int j=1;j+i-1<=n;j++){ double temp=cal(j,i); // printf("%d",temp) ans=temp>ans?temp:ans; } } printf("%lf",ans); // system("pause"); return 0; }
#include<stdio.h> #include<string.h> #include<stdlib.h> double calc_hiv(int *arr,int i,int k); int main(){ int n,k; scanf("%d%d",&n,&k); int arr[n]; for(int i=0;i<n;i++){ scanf("%d",&arr[i]); } double hiv=0; double sum=0,temphiv=0; for(int i=0;i<n;i++){ sum=0; for(int j=i;j<n;j++){ sum+=arr[j]; if((j-i+1)>=k){ temphiv=sum/(j-i+1); if(temphiv>hiv){ hiv=temphiv; } } } } printf("%.9lf\n",hiv); return 0; } double calc_hiv(int *arr,int i,int k){ double res; double sum=0; for(int count =0;count<k;count++){ sum=sum+arr[i+count]; } res = sum/k; return res; }
// C. Intense Heat // https://codeforces.com/problemset/problem/1003/C #include <stdio.h> int main(void) { int i, j; int days, min_days; int temperature[10000]; int psum[10000]; double average = 0; double intense_hit = 0; scanf("%d %d", &days, &min_days); temperature[0] = 0; psum[0] = 0; for (i = 1; i <= days; i++) { scanf("%d", &temperature[i]); psum[i] = psum[i - 1] + temperature[i]; } for (i = min_days; i <= days; i++) { for (j = 0; j <= days - i; j++) { average = ((double)psum[j + i] - psum[j]) / i; if (average > intense_hit) intense_hit = average; } } printf("%f", intense_hit); return 0; }
#include <stdio.h> int main() { int n,a[10000],k; scanf("%d%d",&n,&k); for(int i=0;i<n;i++) scanf("%d",&a[i]); double maxi=0.0; int psum[n+1]; for(int i=0;i<=n;i++) psum[i]=0; for(int i=1;i<=n;i++) { psum[i]=psum[i-1]+a[i-1]; // cout<<psum[i]<<" "; } //cout<<endl; for(int i=k;i<=n;i++) { for(int z=i-k;z>=0;z--) { //cout<<psum[i]-psum[z]; double curr=(double)(((psum[i]-psum[z])))/(double)(i-z); if(curr>maxi) maxi=curr; } } // int precision = std::numeric_limits<double>::max_digits10; //std::cout << std::setprecision(precision) << maxi << std::endl; printf("%0.16f",maxi); return 0; }
#include<stdio.h> #define SIZE 5010 int tree[SIZE * 8]; int start_i, tree_size; double ans = 0; int make_tree(int cur_idx) { if (cur_idx >= start_i) { return tree[cur_idx]; } return tree[cur_idx] = make_tree(cur_idx * 2) + make_tree(cur_idx * 2 + 1); } int getSum(int cur_idx, int ql, int qr, int cl, int cr) { if ((ql<=cl && qr>=cr)) return tree[cur_idx]; if (qr<cl || ql>cr) return 0; int mid = (cl + cr) / 2; return getSum(cur_idx * 2, ql, qr, cl, mid) + getSum(cur_idx * 2 + 1, ql, qr, mid + 1, cr); } int main() { int n, k; scanf("%d %d", &n, &k); for (start_i = 1; start_i < n; start_i *= 2); tree_size = start_i * 2; for (int i = 0; i < n; i++) { scanf("%d", &tree[start_i + i]); } make_tree(1); for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) if (j - i + 1 >= k) { double avg = getSum(1, i, j, 1, start_i) / (double)(j - i + 1); if (avg > ans) { ans = avg; } } } printf("%lf\n", ans); return 0; }
#include <stdio.h> #include <stdlib.h> int main() { int n; int *a; int k; int sum_k = 0; float result = 0; scanf("%d %d", &n, &k); a = (int *)(malloc(sizeof(int) * n)); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); if (i < k) { sum_k += a[i]; } } //printf("%d\n", sum_k); int max = sum_k; //int number = k; int tmp; float tmp_result = 0; while (k <= n) { tmp = sum_k; max = tmp; // printf("%d: ", tmp); for (int i = 1; i <= n - k; i++) { tmp -= a[i-1]; tmp += a[i + k -1]; if (tmp > max) { max = tmp; } // printf("%d %d %d\n", i, tmp, max); } // printf("%d %d %d\n", max, k, sum_k); if((tmp_result = (float)max / (float)k) > result){ result = tmp_result; } sum_k += a[k++]; } //printf("%d %d", max, number); printf("%f", result); }
#include<stdio.h> #include<stdbool.h> int main() { long long int n,k,i,j,count; double avg,sum=0,max=0; scanf("%lld %lld",&n,&k); long int a[n]; for(i=0;i<n;i++) scanf("%ld",a+i); for(j=k;j<=n;j++) { sum=0; for(i=0;i<=n-k;i++) { if(i==0) { count=0; long int p=i; while(count<k) { sum+=a[p]; count++; p++; } avg=sum/k; // printf("sum=%f %f\n",sum,avg); if(avg>max) max=avg; } else { sum=sum-a[i-1]+a[i+k-1]; avg=sum/k; // printf("sum=%f %f\n",sum,avg); if(avg>max) max=avg; } } k+=1; // printf("k=%d",k); } printf("%.20f",max); return 0; }
//求前缀和可提高本题的运行效率 //Version 2018年8月6日17:02:18 #include<stdio.h> int main() { int n,k,i,t; double a[5000],sum[5000],p,ans=0; scanf("%d%d",&n,&k); getchar(); for(i=0;i<n;i++) { scanf("%lf",a+i); sum[i]=sum[i-1]+a[i]; } getchar(); for(i=0;i<n;i++) for(t=k;t<=n;t++) { if(i+t-1>=n) break; if(i==0) p=(sum[i+t-1]-0)/t; else p=(sum[i+t-1]-sum[i-1])/t; if(p>ans) ans=p; } printf("%lf",ans); return 0; } /*#include<iostream> #include<cstdio> #include<cstdlib> #include<algorithm> using namespace std; int main() { int n,k; double a[5000],sum[5000],p,ans=0; int i,t,m; scanf("%d%d",&n,&k); getchar();sum[0]=0; for(i=0;i<n;i++) { scanf("%lf",a+i); if(i==0) sum[1]=a[i]; else sum[i+1]=sum[i]+a[i]; //printf("%lf\n",sum[i]); } getchar(); //system("pause"); if(k==1) { sort(a,a+n); printf("%lf\n",a[n-1]); return 0; } m=n-k; //for(auto &v:sum) //{ // cout<<v<<endl; // if(&v==sum+n-1) // break; //} //system("pause"); double L,R; for(i=1;i<=n;i++) { for(t=k;t<=n;t++) { if(i+t-1>n) break; if(i-1==0) { R=((double)(0)); L=sum[i+t-1]; //if(i+t-1>n) break; } else { R=sum[i-1]; L=sum[i+t-1]; } p=L-R; p/=((double)t); if(p>ans) ans=p; } } printf("%lf",ans); return 0; }*/ /*int main() { int n,k,i,m,t,d; double a[5000],ans=-1,p; scanf("%d%d",&n,&k); getchar(); for(i=0;i<n;i++) scanf("%lf",a+i); getchar(); if(k==1) { sort(a,a+n); printf("%lf\n",a[n-1]); return 0; } m=n-k; for(i=0;i<=m;i++) { for(d=k;d<k+n-1;d++) { for(p=0,t=0;t<d;t++) p+=a[i+t]; p/=((double)d); //printf("p=%lf\n",p); if(p>ans) { //printf("%lf,%lf\n",p,ans); ans=p; } //if(d>k+10) //{ // d=k+n-10; // continue; //} } } for(p=0,i=0;i<n;i++) p+=a[i]; p/=((double)n); if(p>ans) ans=p; printf("%lf",ans); }*/ /*#include<iostream> #include<cstdio> #include<algorithm> using namespace std; double a[100000]; int main() { int n,k,i,m,t,d; double ans=-1,p; scanf("%d%d",&n,&k); getchar(); for(i=0;i<n;i++) scanf("%lf",a+i); getchar(); if(k==1) { sort(a,a+n); printf("%lf\n",a[n-1]); return 0; } m=n-k; for(i=0;i<=m;i++) { for(d=k;d<k+n-1;d++) { for(p=0,t=0;t<d;t++) p+=a[i+t]; p/=((double)d); //printf("p=%lf\n",p); if(p>ans) { //printf("%lf,%lf\n",p,ans); ans=p; } } } for(p=0,i=0;i<n;i++) p+=a[i]; p/=((double)n); if(p>ans) ans=p; printf("%lf",a[-1]); }*/
#include <stdlib.h> #include <stdio.h> #include <math.h> int min (int x, int y) { return (x < y)? x : y; } int main(void) { int n, q, a; int cnt[31] = {0}; scanf("%d%d", &n, &q); int i; for (i = 0; i < n; i++) { scanf("%d", &a); ++cnt[(int)log2((double) a)]; } while(q--) { int b; scanf("%d", &b); int ans = 0; for (i = 30; i >= 0 && b > 0; i--) { int tmp = min(floor((double)b/(pow(2, i))), cnt[i]); ans += tmp; b -= (pow(2, i)) * tmp; } ans = (b > 0) ? -1 : ans; printf("%d\n", ans); } return 0; }
#include <stdio.h> #include <math.h> struct info{ int i; int j; } a[31]; int min (int a, int b) { return a < b ? a : b; } int main () { int n, q, x, i, cnt, t; scanf("%d%d", &n, &q); for (i = 0; i <= 30; i++) { a[i].i = pow(2, i); } while (n--) { scanf("%d", &x); for (i = 0; i <= 30; i++) { if(x == a[i].i) { ++a[i].j; } } } while (q--) { scanf("%d", &x); for (i = 30, cnt = 0; i >= 0; i--) { if (x >= a[i].i) { t = x / a[i].i; t = min (t, a[i].j); x -= t * a[i].i; cnt += t; } } printf("%d\n", x? -1 : cnt); } }
#include <stdio.h> #include <string.h> int arr[33],check[33],Q[33],ans,tmp,i,z,x,n,q; int tst(int p, int n){ if(p<0) return 0; if(check[p]>=n) {ans+=n; check[p]-=n; return 1;} else { ans+=check[p]; n-= check[p]; check[p]=0; tst(p-1, n*2);} } int main(){ for(scanf("%i%i",&n,&q);i<n;i++){ scanf("%i", &tmp); arr[31-__builtin_clz(tmp)]++; } while(q--){ memset(Q, 0, sizeof(Q)); for(int i=0;i<33;i++) check[i]=arr[i]; scanf("%i", &z); while(z){ x =31-__builtin_clz(z); if(!tst(x, 1)) {ans=-1; break;} z&= ~(1<<x); } printf("%i\n", ans); ans=0; } }
#include <stdio.h> int CNT[33]; int P2(int a) { int ret=0; while(a^1) { a>>=1; ++ret; } return ret; } int N,P; void Input() { scanf("%d %d",&N,&P); int wi; for(wi=1;wi<=N;++wi) { int c; scanf("%d",&c); ++CNT[P2(c)]; } } int min(int a,int b){return a>b?b:a;} void AC() { int wi,wia; for(wi=1;wi<=P;++wi) { int K; scanf("%d",&K); int ans=0; for(wia=31;wia>=0;--wia) { int go=min(CNT[wia],K/(1<<wia)); ans+=go; K-=(1<<wia)*go; } if(K) puts("-1"); else printf("%d\n",ans); } } int main() { Input(); AC(); return 0; }
#include<stdio.h> #include<stdlib.h> int a[200007],n,q; int x[32]; void cat(int b){ int i,j,r; r=0; for(i=31;i>=0;i--){ j=b/(1LL<<i); if(j>x[i]){ j=x[i]; } r+=j; b-=(1LL<<i)*j; } if(b>0){ printf("-1\n"); return; } printf("%d\n",r); } void run(){ int i,j,b; while(scanf("%d%d",&n,&q)!=EOF){ for(i=0;i<n;i++){ scanf("%d",&a[i]); } for(i=0;i<32;i++){ x[i]=0; } for(i=0;i<n;i++){ for(j=0;j<32;j++){ if(a[i]==(1LL<<j)){ x[j]++; break; } } } for(i=0;i<q;i++){ scanf("%d",&b); cat(b); } } } main(){ #ifndef ONLINE_JUDGE //freopen("4943d_min.in","rb",stdin); freopen("4943d.in","rb",stdin); freopen("4943d_.out","wb",stdout); #endif run(); return 0; }
#include <stdio.h> #include <stdlib.h> #include <math.h> int main() { int n, q, i, x; int *coins = calloc(32, sizeof(int)); scanf("%d%d", &n, &q); int *queries = malloc(q * sizeof(int)); for (i = 0; i < n; i++) { scanf("%d", &x); coins[(int)log2(x)]++; } for (i = 0; i < q; i++) { scanf("%d", &queries[i]); } int sum, m = 31, max = 0; unsigned long long count = 0; for (i = 31; i >= 0; i--) { if (coins[i] > 0) { max = i; break; } } for (i = 0; i < q; i++) { m = max; int s; x = queries[i]; int ind = pow(2, m); while (x > 0) { s = x / ind; if (s > coins[m]) { s = coins[m]; } if (s > 0) { x = x - ind*s; count += s; } m--; ind = pow(2, m); if (m < 0) break; } if (x == 0) { printf("%I64d\n", count); } else { printf("-1\n"); } count = 0; } free(coins); return 0; }
#include <stdio.h> int log2(long x) { int res = 0; while (x >>= 1) res++; return res; } void tobin(long x, int *b) { for (int i = 0; i < 32; i++) b[i] = 0; int i = 0; while (x) { b[i] = x & 1; x >>= 1; i++; } } int query(int *a, long x, int *b) { int p = 0, i = log2(x), res = 0; tobin(x, b); while (i >= 0) { p *= 2; if (b[i]) p++; if (a[i] > p) { res += p; p = 0; } else { res += a[i]; p -= a[i]; } i--; } if (p) return -1; return res; } int main() { int a[32] = {0}; int n, q; scanf("%d %d", &n, &q); long coin; for (int i = 0; i < n; i++) { scanf("%ld", &coin); a[log2(coin)]++; } long x; int b[32] = {0}; for (int i = 0; i < q; i++) { scanf("%ld", &x); printf("%d\n", query(a, x, b)); } return 0; }
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> #include <stdbool.h> int N, Q, powers[35], queries[200001]; int minimum(int input) { int amt = 0; int powe = (int)log2(input), avail = -1; for(int i = powe; i >= 0; i--) { if(powers[i] > 0) { avail = i; break; } } if(avail == -1) return -1; while(avail >= 0) { int sub = input / (int)pow(2, avail); if(powers[avail] < sub) { input -= powers[avail] * (int)pow(2, avail); amt += powers[avail]; } else { input -= sub * (int)pow(2, avail); amt += sub; } avail--; } if(input == 0) { return amt; } else { return -1; } } int main() { scanf("%i %i", &N, &Q); for(int i = 0; i < 35; i++) { powers[i] = 0; } for(int i = 0; i < N; i++) { int temp; scanf("%i", &temp); powers[(int)log2(temp)]++; } for(int i = 0; i < Q; i++) { scanf("%i", &queries[i]); } for(int i = 0; i < Q; i++) { printf("%i\n", minimum(queries[i])); } }
#include<stdio.h> int n,d,k; void cat(){ int i,j; long long l,r; if(n<=d){ printf("NO\n"); return; } r=1; l=k; for(i=1;i*2-1<=d;i++){ j=d-(i*2-1); if(n-j-r<=l/k){ break; } j--; if(j>=0&&n-j-r>l/k&&n-j<=r+l){ break; } r+=l; l*=k-1; } if(i*2-1>d){ printf("NO\n"); return; } if(j>0&&k==1){ printf("NO\n"); return; } printf("YES\n"); if(n==1){ return; } printf("%d %d\n",1,2); for(i=2;i<n-j;i++){ printf("%d %d\n",(i-2)/(k-1)+1,i+1); } for(;i<n;i++){ printf("%d %d\n",i,i+1); } } void run(){ while(scanf("%d%d%d",&n,&d,&k)!=EOF){ cat(); } } main(){ #ifndef ONLINE_JUDGE freopen("4943e_min.in","rb",stdin); freopen("4943e_.out","wb",stdout); #endif run(); return 0; }
#define _USE_MATH_DEFINES #include <stdio.h> #include <math.h> #include <stdlib.h> #include <string.h> #include <ctype.h> #include <stdbool.h> #include <float.h> #include <limits.h> #include <malloc.h> #include <memory.h> #include <complex.h> #include <errno.h> #include <time.h> #define Max(X,Y) ((X)>(Y) ? (X) : (Y)) #define Min(X,Y) ((X)<(Y) ? (X) : (Y)) #define Swap(X,Y) (X=X^Y,Y=X^Y,X=X^Y) #define EPS 1e-7 #define MOD 998244353 #define N 400005 int n,d,k,i,sum,c,tot; long long tt,a[N],b[N],s[N]; void hunter(int x,int y) { int i,t; if (x>c||!sum) return; t=x==1 ? k-2 : k-1; for (i=1;i<=t;i++) if (sum) { printf("%d %d\n",y,++tot); sum--; hunter(x+1,tot); } else return; } int main() { scanf("%d %d %d",&n,&d,&k); sum=n-d-1; for (i=1;i<=d+2>>1;i++) a[i]=i-1; for (i=1+(d+2>>1);i<=d+1;i++) a[i]=d+1-i; for (i=2,b[1]=s[1]=k-2;i<=d+2>>1;i++) { b[i]=b[i-1]*(k-1)%N; s[i]=s[i-1]+b[i]; } for (i=2,tt=0;i<=d;i++) tt+=s[a[i]]; if (tt<sum||sum<0) { puts("NO"); exit(0); } puts("YES"); for (i=1;i<=d;i++) printf("%d %d\n",i,i+1); for (i=2,tot=d+1;i<=d;i++) { c=a[i]; hunter(1,i); } return 0; }
#include<stdio.h> #include<stdlib.h> #define MAXVERS 500000 typedef struct Edge{ int adjver; int isVisited; struct Edge *next; }Edge; typedef struct Vertex{ int degree; int dist; // the distence between the vertex and the nearest end of diameter. struct Edge *edgelist; }Vertex; Vertex vertex[MAXVERS]; int nVers; int nowVer; int diameter; int maxDegree; void addEdge(int ver,int adjver) { Edge *edge; edge = (Edge*)malloc(sizeof(Edge)); edge->adjver = adjver; edge->isVisited = 0; edge->next = vertex[ver].edgelist; vertex[ver].edgelist = edge; } int getDiameter(void) { for(nowVer=1; nowVer<diameter; nowVer++){ if(vertex[nowVer].degree < maxDegree && vertex[nowVer+1].degree < maxDegree){ addEdge(nowVer,nowVer+1); //addEdge(nowVer+1,nowVer); vertex[nowVer].degree++; vertex[nowVer+1].degree++; vertex[nowVer].dist = (nowVer-1 < diameter-nowVer) ? (nowVer-1):(diameter-nowVer); }else{ return 0; } } vertex[diameter].dist = 0; return 1; } int begin=2; int findVer(void) { int v; for(v = begin; v <= nowVer; v++){ if(vertex[v].dist > 0 && vertex[v].degree < maxDegree){ return v; } } return 0; } int getTree(void) { int v; while(nowVer < nVers){ v = findVer(); //find the vertex that could extend. if(v == 0){ return 0; } //printf("nowVer=%d,v=%d\n",nowVer,v); nowVer++; vertex[v].degree++; vertex[nowVer].degree++; vertex[nowVer].dist = vertex[v].dist-1; if(vertex[v].degree == maxDegree){ begin = v+1; } addEdge(v,nowVer); //addEdge(nowVer,v); } return 1; } int visit(int ver,int adjver) { Edge *edge; edge = vertex[ver].edgelist; while(edge!=NULL){ if(edge->adjver == adjver && !edge->isVisited){ return 0; } edge = edge->next; } return 1; } void print(void) { printf("YES\n"); int v; Edge *edge; for(v=1; v<=nVers; v++){ edge = vertex[v].edgelist; while(edge!=NULL){ //if(!edge->isVisited && !visit(edge->adjver,v)){ printf("%d %d\n",v,edge->adjver); // edge->isVisited = 1; //} edge = edge->next; } } } int main(void) { scanf("%d%d%d",&nVers,&diameter,&maxDegree); diameter++; if(nVers < diameter){ printf("NO"); return 0; } if(!getDiameter()){ printf("NO"); return 0; } if(!getTree()){ printf("NO"); return 0; } print(); return 0; }
#include<stdio.h> int main(){ int n,d; while(scanf("%d %d",&n,&d)!=EOF){ int i,a[1005],b[1005]; for(i=1;i<=n;i++){ scanf("%d",&a[i]); } int s=2; for(i=1;i<=n-1;i++){ if(a[i]+d<a[i+1]-d) s=s+2; else if(a[i]+d==a[i+1]-d) s=s+1; } printf("%d\n",s); } }
#include<stdio.h> int main() { int m,c; long long b,n,a[105]; scanf("%d%lld",&m,&n); c=1; for(int i=1;i<=m;i++) { scanf("%lld",&a[i]); } for(int i=2;i<=m;i++) { b=a[i]-a[i-1]; if(b>2*n) c=c+2; if(b==2*n) c=c+1; } printf("%d",c+1); return 0; }
#include<stdio.h> int main() { int n,d,a,b,s=2; int i; scanf("%d %d",&n,&d); scanf("%d",&a); for( i=1; i<n; i++) { scanf("%d",&b); if(b-a-2*d>0) s+=2; if(b-a-2*d==0) s+=1; a=b; } printf("%d",s); }
#include <stdio.h> int main() { int n; long int d,i,a,b,count=2; scanf("%d %ld",&n,&d); scanf("%ld",&a); for(i=1;i<n;i++) { scanf(" %ld",&b); if((b-a)==(2*d)) { count = count +1; } else if((b-a)>=(2*d)) { count = count +2; } a=b; } printf("%ld",count); }
# include <stdio.h> long long int arr[101]; int main(void){ int n; long long int d,count=2; scanf("%d %lld",&n,&d); for (int i=0;i<n;i++){ scanf("%lld",&arr[i]); } for (int i=0;i<n-1;i++){ if (arr[i]+d<arr[i+1]-d) count+=2; else if (arr[i]+d==arr[i+1]-d) count++; } printf("%lld\n",count); return 0; }
#include<stdio.h> #include<stdlib.h> int main() { int n,d,o= 2 ; scanf("%d%d",&n,&d); int h [n]; for (int i = 0 ;i < n ; i++) scanf("%d",&h[i]); for (int i = 0 ; i < n-1 ; i++) { if (abs(h [i] - h[i+1] )> 2*d) { o+= 2; } else if (abs(h [i] - h[i+1]) == 2*d) { o++; } } printf ("%d\n",o); }
#include <stdio.h> #include <stdlib.h> int main(void){ long n,d; long i,j,z=2; long *a; scanf("%ld%ld",&n,&d); a=(long *)malloc(n*sizeof(long)); for(i=0;i<n;i++) scanf("%ld",&a[i]); for(i=0;i<n-1;i++){ j=i+1; if(a[j]-a[i]>2*d) z+=2; if(a[j]-a[i]==2*d) z++; } printf("%ld",z); return 0; }