1 C poziom 8-7 kyu
2 C poziom 7-6
#include <stdio.h> int potatoes(int p0, int w0, int p1) { return (w0*(100-p0))/(100-p1); } int main(void) { printf("%d\n",potatoes(99,100,98)); return 0; }
#include <string.h> #include <stdio.h> #include <stdlib.h> #include <stddef.h> char s[] = "abcd\nefgh\nijkl\nmnop"; char* vertMirror(char* strng) { int dl=strlen(strng); char *wynik=malloc(dl+1); for(int i=0;i<dl;i++) wynik[i]='X'; int n; for (int i=0;i<dl;i++) //find n if(strng[i]=='\n') { n=i; break; } for(int i=0;i<n;i++) //copy strng to wynik (not coping \n) { for(int j=0;j<n;j++) { wynik[i*n+i+j]=strng[(i*n+i+(n-1-j))]; //copy and reverse every n } } for(int i=1;i<=dl;i++) //put '\n' every 5(n+1) per starting n { int a=i%(n+1); if(!a) //printf("%d\n",i-1); wynik[i-1]='\n'; } wynik[dl]=0; return wynik; } char* horMirror(char* strng) { int dl=strlen(strng); char *wynik=malloc(dl+1); for(int i=0;i<dl;i++) wynik[i]='X'; int n; for (int i=0;i<dl;i++) //find n if(strng[i]=='\n') { n=i; break; } for(int i=0;i<n;i++) //copy strng to wynik (not coping \n) { for(int j=0;j<n;j++) { wynik[i*n+i+j]=strng[((n-1-i)*n+(n-1-i)+j)]; //copy and mirror grop of n } } for(int i=1;i<=dl;i++) //put '\n' every 5(n+1) per starting n { int a=i%(n+1); if(!a) //printf("%d\n",i-1); wynik[i-1]='\n'; } wynik[dl]=0; return wynik; } typedef char* (*generic_func_t) (char*); char* oper(generic_func_t f, char* s) { return f(s); } int main(void) { //printf("%s\n",vertMirror(s)); //printf("%s\n",horMirror(s)); printf("%s\n",oper(vertMirror,s)); return 0; }.
#include <string.h> #include <stdio.h> #include <stdlib.h> #include <stddef.h> char s[] = "abcdv\nefghv\nijklv\nmnopv\nkolev"; char *rot(char* strng) { int dl=strlen(strng); char *wynik=malloc(dl+1); char *wynik2=malloc(dl+1); int n; for (int i=0;i<dl;i++) //find n if(strng[i]=='\n') { n=i; break; } for(int i=0;i<n;i++) //copy strng to wynik (not coping \n) { for(int j=0;j<n;j++) { int aa=i*n+i+j; wynik[i*n+i+j]=strng[(i*n+i+(n-1-j))]; //copy and reverse every n } } for(int i=0;i<n;i++) //copy strng to wynik (not coping \n) { for(int j=0;j<n;j++) { wynik2[i*n+i+j]=wynik[((n-1-i)*n+(n-1-i)+j)]; //copy and mirror grop of n } } for(int i=1;i<=dl;i++) //put '\n' every 5(n+1) per starting n { int a=i%(n+1); if(!a) wynik2[i-1]='\n'; } wynik2[dl+1]=0; return wynik2; } char* selfieAndRot(char* strng) { int dl=strlen(strng); int n; for (int i=0;i<dl;i++) //find n if(strng[i]=='\n') { n=i; break; } int dlw=4*dl-(2*n-2); char *wynik=malloc(dlw+1); for (int i=0;i<dlw;i++) wynik[i]='X'; for(int i=0;i<n;i++) //copy strng to wynik (not coping \n) { for(int j=0;j<n;j++) { wynik[i*2*n+i+j]=strng[(i*n+i+j)]; //copy NO reverse every n } for(int k=0;k<n;k++) wynik[i*2*n+n+i+k]='.'; } for(int i=0;i<2*n;i++) //copy strng to wynik (not coping \n) AND mirror { for(int j=0;j<2*n;j++) { int aa=dlw-(i*n+i+j); wynik[dlw-(i*n+i+j)]=wynik[i*n+i+j]; //copy and mirror grop of n } } for(int i=1;i<=dlw;i++) //put '\n' every 5(n+1) per starting n { int a=i%(2*n+1); if(!a) wynik[i-1]='\n'; } wynik[dlw+1]=0; return wynik; } typedef char* (*generic_func_t) (char*); char* oper(generic_func_t f, char* s) { return f(s); } int main(void) { //printf("%s\n",rot(s)); //printf("%s\n",selfieAndRot(s)); printf("%s\n",oper(rot,s)); printf("%s\n",oper(selfieAndRot,s)); return 0; }
#include <stdio.h> #include <stdlib.h> //#include <string.h> #include <stdbool.h> bool solution(const char *string, const char *ending) { bool war=true; int dl1=strlen(string); int dl2=strlen(ending); if (dl2>dl1) return false; dl1-=1; dl2-=1; for (int i=dl2;i>=0;i--) { if(string[dl1--]!=ending[i]) war=false; } return war; } int main() { bool wynik=solution("abc","bc"); printf("wynik %d\n",wynik); wynik=solution("abc","d"); printf("wynik2 %d\n",wynik); return 0; }
#include <stdio.h> #include <stdlib.h> #include <stdbool.h> const int arr0[] = { 1,2,4,7,19 }; const int arr1[] = { 1,2,3,4,5 }; const int arr2[] = { 1,6,10,18,2,4,20 }; const int arr3[] = { 9,8,7,6,5,4,3,2,1 }; bool in_asc_order(const int *arr, size_t arr_size) { bool wyn=true; if (arr_size==1) return true; arr_size-=1; for (int i=0;i<arr_size;i++) { if(arr[i+1]<=arr[i]) wyn=false; } return wyn; } int main() { printf("wynik1= %d\n",in_asc_order(arr0,5)); printf("wynik1= %d\n",in_asc_order(arr1,5)); printf("wynik1= %d\n",in_asc_order(arr2,7)); printf("wynik1= %d\n",in_asc_order(arr3,9)); return 0; }
#include <stdio.h> #include <stdlib.h> #include <string.h> char *repeat_str(size_t count, char *src) { int dl=strlen(src); dl=count*dl; char* nowy=malloc(dl); strcpy(nowy,""); for (int i=0;i<count;i++) strcat(nowy,src); return nowy; } int main(void) { printf("%s\n",repeat_str(5,"ABC")); return 0; }.
#include <stdio.h> #include <string.h> #include <stdlib.h> const char *evil(int value) { unsigned int count = 0; while (value) { count += value & 1; value >>= 1; } if (count%2) return "It's Odious!"; else return "It's Evil!"; } int main(void) { printf("%s\n",evil(1)); printf("%s\n",evil(2)); printf("%s\n",evil(3)); printf("%s\n",evil(8)); printf("%s\n",evil(14)); return 0; }
#include <stdio.h> #include <string.h> #include <stdlib.h> int sumTriangularNumbers(int n) { if (n<=0) return 0; int temp[n]; for (int i=0;i<n;i++) temp[i]=i+1; int parzyste=n%2 ? 1:0; int m=n; m>>=1; int sum=temp[m]+temp[m-1]; sum=sum*(m+parzyste); int sum2=sum; m=n; for (int i=1;i<n;i++) { sum=sum-m; m=m-1; sum2=sum2+sum; } return sum2; } int main(void) { //printf("%d\n",sumTriangularNumbers(1)); //printf("%d\n",sumTriangularNumbers(2)); //printf("%d\n",sumTriangularNumbers(3)); //printf("%d\n",sumTriangularNumbers(4)); printf("%d\n",sumTriangularNumbers(4)); //printf("%d\n",sumTriangularNumbers(6)); //printf("%d\n",sumTriangularNumbers(7)); return 0; }
#include<stdio.h> #include<string.h> // friday and saturday are 0-terminated arrays, i.e. the last element (and only that) will be 0. int lostSheep(const int *friday, const int* saturday, int total) { int sum=0; while(*friday) { sum=sum+*friday; friday++; } while(*saturday) { sum=sum+*saturday; saturday++; } return total-sum; } int friday1[]={1,2,0}; int saturday1[]={3,4,0}; int friday2[]={3,1,2,0}; int saturday2[]={3,4,0}; int main(void) { printf("%d\n",lostSheep(friday1,saturday1,15)); printf("%d\n",lostSheep(friday2,saturday2,21)); return 0; }
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <stdbool.h> #include <stddef.h> char* remove_bang(char* s) { int dl=strlen(s); char *wynik = malloc(dl+1); int j=0; for (int i=0;i<dl;i++) { if (s[i]==33) wynik[j]='\0'; else { wynik[j++]=s[i]; wynik[j]='\0'; } } strcat(wynik,"!"); return wynik; } int main(void) { printf("%s\n",remove_bang("Hi!")); printf("%s\n",remove_bang("Hi!!!")); printf("%s\n",remove_bang("!Hi")); printf("%s\n",remove_bang("!Hi!")); printf("%s\n",remove_bang("Hi! Hi!")); printf("%s\n",remove_bang("Hi")); return 0; }
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <stdbool.h> #include <stddef.h> int tab1[]={6,2,1,8,10}; int tab2[]={1,1,11,2,3}; int sum(int* numbers, int numbersCount) { if (numbersCount==1) return 0; int temp; int zamiana=1; while(zamiana) { zamiana=0; for(int i=0;i<numbersCount-1;i++) { if (numbers[i]>numbers[i+1]) { temp=numbers[i]; numbers[i]=numbers[i+1]; numbers[i+1]=temp; zamiana=1; } } } temp=0; for (int i=1;i<numbersCount-1;i++) temp+=numbers[i]; return temp; } int main(void) { printf("%d\n",sum(tab1,5)); printf("%d\n",sum(tab2,5)); return 0; }
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <stdbool.h> #include <stddef.h> char * pofi(unsigned n) { static const char *solution[] = {"1","i","-1","-i"}; return solution[n % 4]; } int main() { printf("%s\n",pofi(0)); printf("%s\n",pofi(1)); printf("%s\n",pofi(2)); printf("%s\n",pofi(3)); printf("%s\n",pofi(4)); return 0; }
#include <string.h> #include <stdio.h> #include <stdlib.h> #include <stddef.h> size_t ResultCount=1; const char *string[] = { "home", "milk", "mercury", "fish", "melania" }; const char *quer = "me"; char ** word_search(const char *query,const char **strings,size_t count, size_t *pResultCount) { char **tablica=malloc(count); *pResultCount=0; for(int i=0;i<(int)count;i++) { if(strstr(strings[i],query)) { tablica[*pResultCount]=malloc(strlen(strings[i])+1); strcpy(tablica[*pResultCount],strings[i]); (*pResultCount)++; } } return tablica; } int main() { for (int i=0;i<ResultCount;i++) printf("%s \n", word_search(quer, string, sizeof(string)/sizeof(string[0]),&ResultCount)[i] ); return 0; }