Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string>
- using namespace std;
- void qsort(string &tab, int min, int max)
- {
- if(min<max)
- {
- int min_min = min;
- for(int i=min+1;i<=max;i++)
- {
- if(tab[i]<tab[min])
- {
- swap(tab[++min_min],tab[i]);
- }
- }
- swap(tab[min],tab[min_min]);
- qsort(tab,min,min_min-1);
- qsort(tab,min_min+1,max);
- }
- }
- int main()
- {
- string tablica1, tablica2;
- int ile;
- scanf("%d",&ile);
- for(int i=0;i<ile;i++)
- {
- cin>>tablica1>>tablica2;
- qsort(tablica1,0,tablica1.length()-1);
- qsort(tablica2,0,tablica2.length()-1);
- if(tablica1==tablica2)
- {
- printf("TAK\n");
- }
- else
- {
- printf("NIE\n");
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement