https://qna.c-programming.allos.gr/ 2026-05-06T16:18:49+00:00 https://qna.c-programming.allos.gr/ https://qna.c-programming.allos.gr/lib/tpl/dokuwiki/images/favicon.ico text/html 2024-04-24T15:31:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://qna.c-programming.allos.gr/doku.php?id=qna:lab-session:code1&rev=1713972664&do=diff #include <stdio.h> void printFactors(int n) { for ( int factor = 2; factor <= n/(double)factor; factor++ ) { while (n % factor == 0) { n /= factor; printf("%d ", factor); } } if (n > 1) { printf("%d ", n); } printf("\n"); return; } int main() { printFactors(60); return 0; } text/html 2024-04-24T15:34:01+00:00 Anonymous (anonymous@undisclosed.example.com) https://qna.c-programming.allos.gr/doku.php?id=qna:lab-session:code2&rev=1713972841&do=diff #include <stdio.h> int findInArray( double value, int N, double a[N] ) { for (int i = 0; i < N; ++i) { if (a[i] == value) { return i; } } return -1; } int main() { double X[] = {1.2, 3.4, 5.6, 7.8}; double someValue = 3.4; int index = findInArray(someValue, 4, X); printf("Found at position %d, value %lf\n", index, someValue); return 0; } text/html 2024-04-24T15:40:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://qna.c-programming.allos.gr/doku.php?id=qna:lab-session:code3&rev=1713973229&do=diff #include <stdio.h> #include <math.h> double ypoteinousa(double a, double b) { return sqrt( a*a + b*b ); } void proveUnitCycle() { double f = M_PI / 4; printf("%lf\n", ypoteinousa( sin(f), cos(f) ) ); } int main() { proveUnitCycle(); return 0; } text/html 2024-04-25T10:10:01+00:00 Anonymous (anonymous@undisclosed.example.com) https://qna.c-programming.allos.gr/doku.php?id=qna:lab-session:code4&rev=1714039801&do=diff #include <stdio.h> int main() { char i, j, k, l; printf("%i %i %i %i\n", i,j,k,l); i=126; printf("%i\n", i); i++; printf("%i\n", i); i++; printf("%i\n", i); printf("%% => %d\n", 15 % 8); return 0; } text/html 2024-04-25T10:17:30+00:00 Anonymous (anonymous@undisclosed.example.com) https://qna.c-programming.allos.gr/doku.php?id=qna:lab-session:code5&rev=1714040250&do=diff #include <stdio.h> #define BEGIN { #define END } #define ONEpTHREE 1+3 #define PRODok(x,y) ((x)*(y)) #define PRODbad(x,y) (x*y) const int OnePlusThree = 1+3; int main() BEGIN printf("Result: %d\n", PRODok(ONEpTHREE, 2+4)); // Προσοχή! Η παραπάνω παράσταση γίνεται ((1+3)*(2+4)) πριν το build printf("Result: %d\n", PRODbad(ONEpTHREE, 2+4)); // Προσοχή! Η παραπάνω παράσταση γίνεται (1+3*2+4) πριν το build printf("Result: %d\n", PRODbad(OnePlusThree, 2+4)); // Προσοχή! Η… text/html 2024-04-25T10:22:11+00:00 Anonymous (anonymous@undisclosed.example.com) https://qna.c-programming.allos.gr/doku.php?id=qna:lab-session:code6&rev=1714040531&do=diff #include <stdio.h> #include <stdbool.h> int main() { bool isRed = true; bool isBad = false; printf("%d kai %d\n", isRed, isBad); } text/html 2024-04-25T11:13:27+00:00 Anonymous (anonymous@undisclosed.example.com) https://qna.c-programming.allos.gr/doku.php?id=qna:lab-session:code7&rev=1714043607&do=diff #include <stdio.h> int main() { int x = 123; int hlp; if (x > 10) { hlp = x; } else { hlp = 0; } int a = hlp + x; // ή απλούστερα (και δε χρειάζεται και η βοηθητική μεταβλητή) int b = (x>10?x:0)+x; } text/html 2024-04-25T11:22:30+00:00 Anonymous (anonymous@undisclosed.example.com) https://qna.c-programming.allos.gr/doku.php?id=qna:lab-session:code8&rev=1714044150&do=diff #include <stdio.h> int howManyTimes() { static int counter = 0; return ++counter; } int main() { printf("Function has been called %d times\n", howManyTimes()); printf("Function has been called %d times\n", howManyTimes()); printf("Function has been called %d times\n", howManyTimes()); printf("Function has been called %d times\n", howManyTimes()); printf("Function has been called %d times\n", howManyTimes()); return 0; }