nih gw share dkit codingan yg gw pny,, PAS bgt nih bwt ank2 TI,, trutama yg bru msup,, hehe.. #include<stdio.h> #include<conio.h> void main() { int kolom,baris,n,spasi; do { clrscr(); gotoxy(15,2); printf("Program Persegi Ajaib Punyaku"
#include <stdio.h> #include <limits.h> #include <iostream> #include <windows.h> using namespace std; // Number of vertices in the graph #define V 5 // A utility function to find the vertex with minimum key value, from // the set of vertices not yet included in MST int m