Submission

Score: 0

User: anonymous

Problemset: Internal Order

Language: cpp

Time: 0.000 second

Submitted On: 2026-10-08 16:43:08

#include <bits/stdc++.h>
using namespace std;
	struct godtham{
		string name;
		int altar
	};

int main(){
	int n;cin >> n;
	godtham god; 
	for(int i=0;i<4;i++) 
	{
		cin >> god[i].name;
		god[i].altar = i+1;
	}
	
	for(int i = 0;i<3;i++){
		for(int j =i+1;j<4;j++)
		{
			if(god[i].name > god[j].name)swap(god[i],god[j]);
		}
	}
	
	int order[4];
	
	for(int i=0;i<4;i++){
		int pos = (k-1+i)%4;
		order[i] = god[pos].altar;
	}
	
	int pos[5];
	
	for(inti = 0;i<4;i++){
		pos[order[i]] = i + 1;
	}
	
	bool omega;
	bool mu;
	bool xi;
}