Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- void beolvas(double *,int p2);
- void monotone(double *, int p2);
- void relat(double *, int p2);
- int main(void)
- {
- double t[6];
- int i;
- int moncs;
- printf("Irja be az adatokat:\n");
- beolvas(t,6);
- monotone(t,6);
- relat(t,6);
- return 0;
- }
- void beolvas(double *p1, int p2)
- {
- int i;
- for(i=0;i<6;i++)
- {
- scanf("%lf", &p1[i]);
- }
- return;
- }
- void monotone(double *p1, int p2)
- {
- int j,moncs;
- moncs=0;
- for(j=0;j<6;j++)
- {
- if(p1[j]>p1[j-1])
- moncs=1;
- else moncs=0;
- }
- if(moncs==0)
- printf("Monoton csökkenõ\n");
- else printf("Nem monoton csökkenõ\n");
- return; }
- void relat(double *p1, int p2)
- {
- int k;
- double s=0;
- printf("%6.1lf\n", p1[0]);
- for (k=0;k<6;k++)
- s=p1[0]-p1[k];
- printf("%lf\n", s);
- return;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement