blob: a50524f7c306209f7efcc7968bd57fec8d52c314 (
plain) (
tree)
|
|
#include <stdio.h>
#include <stdlib.h>
int main (int argc, char ** argv) {
if (argc != 1+1) {
fprintf(stderr, "uporaba: %s <dolzina stranice kvadratne mreze>\nprimer za šahovnico: %s 8\n", argv[0], argv[0]);
return 1;
}
unsigned long int n = strtol(argv[1], NULL, 10);
unsigned long int x = 1;
unsigned long int y = 1;
unsigned long int s = 0;
for (x = 1; x <= n; x++)
for (y = 1; y <= n; y++)
s = s + x * y;
fprintf(stdout, "seštevek možnih pravokotnikov v mreži %lux%lu je %lu\n", n, n, s);
}
|