Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
ამოცანა#3-------From adjacency matrix to the list of edges.
#include <iostream> using namespace std; int i, j, n, val, flag; int main() { scanf("%d", &n); flag = 1; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { scanf("%d", &val); if (i > j) continue; if (val) printf("%d %d\n", i, j), flag = 0; } } if (flag) puts(""); return 0; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
creating triangle using nested loop
ახარისხება~ფინალური
Szukanie elementu w niemalejąco posortowanej tablicy używając wyszukiwania binarnego
sample
FindMedian
dijkstra
StackQuiz
insertion_sort
MergeDoubLinArr
project
Please log in to post a comment.