Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- zadaca 4
- 1.
- #include <stdio.h>
- #define e 0.0001
- #define br_el 5
- double eksponent(double a,int n){
- int i;
- double suma=a;
- for(i=0;i<n-1;i++){
- suma*=a;
- }
- return suma;
- }
- int main() {
- double nizx[br_el],nizy[br_el];
- double a,b,h,suma=0,temp;
- int i,n,br=0;
- printf("Unesite prvu tacku intervala: ");
- scanf("%lf",&a);
- if(a<=0||a>100){
- printf("Nedozvoljena vrijednost!");
- return 0;
- }
- printf("Unesite drugu tacku intervala: ");
- scanf("%lf",&b);
- if(a>b||b<=0||b>100||(a==b)){
- if(b<=0){
- printf("Nedozvoljena vrijednost!");
- }
- else printf("Neispravan interval!");
- return 0;
- }
- printf("Unesite eksponent: ");
- scanf("%d",&n);
- if(n<-10||n>10){
- printf("Neispravan eksponent!");
- return 0;
- }
- printf("Unesite korak diskretizacije: ");
- scanf("%lf",&h);
- temp = a; //sve sa a
- i=0;
- do{
- if(i<4){
- nizx[i]=a;
- nizy[i]=eksponent(a,n);
- }
- suma += eksponent(a,n);
- a += h;
- if(b-a<e){
- nizx[br_el-1]=a-h;
- nizy[br_el-1]=eksponent(a-h,n);
- }
- br++; // za ispis
- i++;
- }while(b-a>e);
- printf("Korak x y = f(x)\n");
- printf("----------------------------------\n");
- for(i=0;i<5;i++){
- if(nizx[i]<e) continue;
- if(i<4)
- printf("%5d. %lf %15.5lf\n",i+1,nizx[i],nizy[i]);
- else if(i==4 && br>4){
- printf("(...)\n");
- printf("%5d. %lf %15.5lf\n",br,nizx[i],nizy[i]);
- }
- }
- printf("----------------------------------\n");
- printf("P(x^%d)[%g,%g]= %.6lf (dx=%g)",n,temp,b,suma*h,h);
- return 0;
- }
- 2. ne treba ti
- 3.
- #include <stdio.h>
- #define broj_el 200
- #define e 0.0001
- #include <math.h>
- int main()
- {
- int c=0,i,j;
- double dc,lc,uc;
- double niz[broj_el] = {0.00};
- while(c<=0||c>100) {
- printf("Unesite broj clanova niza: ");
- scanf("%d",&c);
- }
- printf("Unesite niz: ");
- for(i=0; i<c; i++) {
- scanf("%lf",&niz[i]);
- }
- for(i=0; i<c; i++) {
- if(c==199)
- break;
- if((fabs(niz[i+1]-2*niz[i])<e)&&(i!=c-1)) {
- dc=niz[i+1];
- lc=niz[i];
- uc=(dc+lc)/2;
- for(j=c; j>i+1; j--) {
- niz[j]=niz[j-1];
- }
- niz[i+1]=uc;
- c++;
- }
- }
- printf("Nakon ubacivanja niz glasi: \n");
- for(i=0; i<c; i++) {
- printf("%g ",niz[i]);
- }
- int br[10] = {0};
- int cifra;
- for(i=0; i<c; i++) {
- cifra=((int)(niz[i]*10))%10;
- br[cifra]++;
- }
- for(i=0; i<10; i++) {
- if(br[i]!=0)
- printf("\nCifra %d se ponavlja %d puta.",i,br[i]);
- }
- return 0;
- }
- 4.
- #include <stdio.h>
- #include <math.h>
- #define duzina 25
- #define e 0.00000001
- int main() {
- double jelovnik[duzina];
- double kombo[25][25] = {{0}};
- int racun[100];
- double temp,snizenje=0,maxracun=0;
- int i=1,j=0,r=0,maxi,maxj,k1,k2,x=1;
- char flush;
- for(i=0;i<duzina;i++){
- scanf("%lf",&jelovnik[i]);
- if(jelovnik[i]<0)
- i--;
- }
- do{
- printf("Unesite kombinaciju: ");
- scanf("%d",&k1);
- if(k1==0) break;
- scanf("%d %lf",&k2,&temp);
- if((temp>=(jelovnik[k1-1]+jelovnik[k2-1])) || (kombo[k1-1][k2-1]!=0 && kombo[k2-1][k1-1]!=0) || k1==k2){
- printf("Neispravna kombinacija!\n");
- }
- else
- {
- kombo[k1-1][k2-1]=temp;
- kombo[k2-1][k1-1]=temp;
- }
- }while(k1!=0);
- do{
- printf("Unesite racun: ");
- for(i=0;i<100;i++){
- scanf("%d",&racun[i]);
- if(i==0 && racun[i]==0)
- return 0;
- if(racun[i]==0)
- break;
- if(jelovnik[racun[i]-1]<e){
- printf("Jelo nije u ponudi\nUnesite racun: ");
- for(i=0;i<r;i++){
- racun[i]=0;
- }
- do{
- flush=getchar();
- }while((flush!='\0')&&(flush!='\n'));
- }
- r++;
- }
- for(i=0;i<r;i++){
- maxracun += jelovnik[racun[i]-1];
- }
- for(i=0;i<r;i++){
- snizenje=0;
- if(racun[i]<0) continue;
- for(j=i+1;j<r;j++){
- if(racun[j]<0 || (kombo[racun[i]-1][racun[j]-1])<e) continue;
- if(fabs(jelovnik[racun[i]-1]+jelovnik[racun[j]-1]-kombo[racun[i]-1][racun[j]-1])>snizenje){
- snizenje = jelovnik[racun[i]-1]+jelovnik[racun[j]-1]-kombo[racun[i]-1][racun[j]-1];
- maxi=i;
- maxj=j;
- }
- }
- maxracun-=snizenje;
- racun[maxi]=-2;
- racun[maxj]=-2;
- }
- printf("Ukupan iznos racuna je: %.2lf KM\n",maxracun);
- maxracun=0;
- r=0;
- }while(x!=0);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement