Untitled
unknown
plain_text
2 years ago
898 B
4
Indexable
#include<iostream> using namespace std; int so_nhayxa, so_nhaygan; int n; int map[205][3]; int visit[205]; int binh(int x){ int result; result = x*x; return result; } int calculate(int x, int i){ if(binh(map[i][0]-map[x][0]) + binh(map[i][1]-map[x][1]) - binh()) } int Try(int i, int j){ front =rear =-1; visit[0]=0; while(!IsEmpty){ pop(); x=Q[front]; for(int i=0; i< n; i++){ if(i!=x){ int t = calculate(x,i); if(visit[i] > visit[x] + t) visit[i] = visit[x] + t; push(i); } } } } int main(){ //freopen("Text.txt", "r", stdin); int test; cin >> test; for(int tc= 1; tc <= test; tc++){ cin >> n; for(int i=0; i < n; i++){ for(int j= 0; j < 3; j++){ cin >> map[i][j]; } } for(int i=0; i < n; i++){ cout << "Case #" << tc << endl; cout << ans << endl; } return 0; }
Editor is loading...