Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- #include <math.h>
- 2. ZADATAK
- int main() {
- int a;
- scanf("%d", &a);
- int* p = &a;
- if (*p > 0) { *p = 2 * (*p); }
- else { *p = 0.5*(*p); }
- printf("%d", *p);
- return 0;
- }
- 3. ZADATAK
- int main() {
- int p[19], m;
- do { scanf("%d", &m); } while (m < 4 || m >= 19);
- int min, max;
- for (int i = 0; i < m; i++) {
- scanf("%d", (p + i));
- if (i == 0) { min = max = p[0]; }
- if (*(p + i) < min) { min = *(p + i); }
- if (*(p + i) > max) { max = *(p + i); }
- }
- printf("RAZLIKA = %d", max - min);
- return 0;
- }
- 4. ZADATAK
- float fx(float* p, int n) {
- float suma = 0;
- for (int i = 1; i <= (n - 1); i++) {
- suma += abs(i * (*(p + i)) * (*(p + i)) - 1.0);
- }
- printf("%f\n", suma);
- return suma;
- }
- int main() {
- float a[10];
- float y;
- for (int i = 0; i < 10; i++) {
- printf("%d. ELEMENT POLJA = ", i);
- scanf("%f", (a + i));
- }
- printf("%f", fx(a, 10));
- return 0;
- }
- 5. ZADATAK
- int main() {
- int p[18],m,max,sum=0,broj,rez;
- do { scanf("%d", &m); } while (m <= 3 || m > 18);
- for (int i = 0; i < m; i++) {
- printf("%d. ELEMENT POLJA = ",i);
- scanf("%d", p + i);
- broj = *(p + i);
- while (*(p + i) != 0) {
- sum += (*(p + i) % 10);
- *(p + i) = *(p + i) / 10;
- }
- if (i == 0) { max = sum; }
- if (sum > max) { max = sum; rez = broj; }
- sum = 0;
- }
- printf("MAX = %d", rez);
- return 0;
- }
- 6. ZADATAK
- int main() {
- int mala = 0;
- char a[101];
- fgets(a, 101, stdin);
- int y = fx(a);
- printf("%d", y);
- }
- int fx(char* p) {
- int mala = 0, velika = 0;
- for (int i = 0; i < 100; i++) {
- if (*(p + i) >= 'a' && *(p + i) <= 'z') { mala++; }
- if (*(p + i) >= 'A' && *(p + i) <= 'Z') { velika++; }
- }
- if (mala > velika) return -1;
- if (mala < velika) return 1;
- if ((mala == 0 && velika == 0) || (mala = velika)) return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement