Jegor.pl

Disclaimer:
I am not a doctor. This is not medical advice.
Everything described below was done at my own risk.



Recently I posted about using 10 mg torasemide.
This time I tested 20 mg.

From what I found:
20 mg torasemide ≈ 80 mg furosemide

The difference compared to 10 mg was immediately noticeable.



Timeline

Tracked for accuracy:


14:30 — 20 mg torasemide

14:15 — weak (pre-effect)
14:52 — very light
15:13 — good
15:21 — good
15:37 — weak
16:11 — good


Summary:
- Stronger than 10 mg
- More consistent
- Noticeably longer duration



Subjective Effects

Effect kicked in roughly ~2 hours after intake.
Overall felt “cleaner” than expected.

No:
- headache
- leg discomfort

Electrolytes (subjectively) felt stable.

Appetite suppression was noticeable:
- Ate at ~14:30 (2 slices pizza)
- No hunger afterwards



Club Observation (CL)

Later that night (~22–23), went out with mtn friends.
Was drunk asf, so take this part with a grain of salt.

Something I noticed:

Normally I get decent eye contact in social settings.
This time — almost none.

Despite:
- defined cheekbones
- sharp jawline
- no sunken eyes

At the same time, my hltn → lmtn friend:
- acne
- slightly bloated face

was getting noticeably more attention.

Not sure how to interpret this.

Possible explanations:
- randomness / alcohol factor
- social dynamics > looks
- or I’m just copemaxxing



Torasemide vs Furosemide

Torasemide feels superior.

Pros:
- smoother effect
- longer duration
- no noticeable discomfort

Cons:
- 2–3x more expensive

Still haven’t tested furosemide yet, but based on reports,
it seems harsher in terms of side effects.



Additional Notes

- High sodium intake before use → not recommended (ignored)
- Alcohol consumption → no unusual increase in urination beyond baseline



Future Plans

- 30 mg torasemide (~120 mg furosemide equivalent)
or
- 120 mg furosemide

Leaning towards staying with torasemide.



Conclusion


20 mg > 10 mg
Torasemide > Furosemide (my op)

Stronger
Longer
More stable


Still experimenting.

public class Main {
    public static void main(String[] args) {

    }
}///////////
abstract class Computer {
    final void wlacz(){
        System.out.println("wlacz");
    };
    public abstract String zmienProcesor();
    public abstract boolean czyMaEkranDotykowy();

}

//TIP To <b>Run</b> code, press <shortcut actionId="Run"/> or
// click the <icon src="AllIcons.Actions.Execute"/> icon in the gutter.

import java.awt.*;

public class Main {
    public static void main(String[] args) {

        Circle  circle = new Circle(10);
        Square square = new Square(10);

        System.out.println(square.calculateArea());
        System.out.println(circle.calculateArea());

    }
}////////////
abstract class Shape {
    public abstract double calculateArea();
    double a;

    public Shape(double a) {
        this.a = a;
    }
}
///////////
public class Square extends Shape{
    public double calculateArea() {
       return  a*a;

    };

    public Square(double a) {
        super(a);
    }
}
//////////
public class Circle extends Shape{
    public double calculateArea() {
        return  3.14 * (a*a);
    };

    public Circle(double a) {
        super(a);
    }
}

#include <iostream>

using namespace std;

int silnia1(int a)
{
    int sil=1;
    for(int i=2;i<=a;i++)
    {
        sil=sil*i;
    }
    return sil;
}

int silnia2(int a)
{
    if(a==0)
    {
        return 1;
    }
    else{
        return silnia2(a-1)*a;
    }
}

float potega(float a, int wykladnik)
{
    int wyn=1;
    for(int i=1;i<=wykladnik;i++)
    {
        wyn=wyn*a;
    }
    return wyn;

}

float potega2(float a, int wykladnik)
{
    if(a==0)
    {
        return 1;
    }
    else{
        return potega2(a,wykladnik-1)*a;
    }

}

int ciag(int n)
{

    for(int i=1; i<=20;i++)
    {
    if(n==1 || n==2)
    {
        return 1;
    }else{
        return ciag(n-1)+ciag(n-2);
    }
    }
}

int main()
{

    cout << silnia2(5)<< endl;
    cout << potega(5,3)<<endl;
    for(int i=1;i<=20;i++)
    {
     cout << float (ciag(i))/float (ciag(i+1))<< endl;
    }
    for(int i=1;i<=20;i++)
    {

    cout << ciag(i) << endl;

    }
    return 0;
}

#include <iostream>

using namespace std;

int silnia(int a)
{
    int sil=1;
    for(int i=2; i<=a; i++)
    {
        sil*=i;
    }
    return sil;
}

int silnia2(int n)
{
    if(n==0)
        return 1;
    return n*silnia2(n-1);
}

int main()
{
    cout<<silnia2(5);
    return 0;
}

#include <iostream>

using namespace std;

bool palindrom(string w)
{
    string odwrocony = "";
    for(int i=w.length()-1; i>=0; i--)
    {
        odwrocony += w[i];

    }
    if(w == odwrocony)
        return true;
        return false;
}

string odwroc(string w)
{

    string odwrocony = "";
    for(int i=w.length()-1; i>=0; i--)
    {
        odwrocony += w[i];

    }
    return odwrocony;

}

string najpalindrom(string w)
{
    string pali="";
    int z = 0;
    while(z!=w.length())
    {

    for(int i=0; i<w.length()-z;i++)
    {
        pali+=w[i];
    }
    if(palindrom(pali))
        return pali;
    else{
         z++;
         pali = "";
    }

    }

}


string szyfrowanie(string w)
{

    string reszta = "";
    string palindrom = najpalindrom(w);
    int d=palindrom.length();
    for(int i =d; i<w.length();i++)
    {
        reszta+=w[i];


    }
    string szyfr=odwroc(reszta)+w;
    return szyfr;
}

int main()
{
    //cout << najpalindrom("kaktus") << endl;
     cout << szyfrowanie("KAJAKARSTWO") << endl;
    return 0;
}

Notatka algorytmy tablice i stringi:
void selsort(int A[], int N){
for(int i=0; i<N-1 ;i++){
int k=i;
for(int j=i+1; j<N; j++){
if(A[j]<A[k]){
k=j
}}
int temp = A[i];
A[i] = A[k];
A[k] = temp;
}
}

string odwroc(string napis)
{
string wynik="";
for(int i = napis.length() - 1; i >=0; i--){
if(napis[i] != ' ')
{
wynik += napis[i];
}
}
return wynik;
}

bool palindromZdanie(string zdanie)
{
string bezSpacji = "";
for(int i=0; i< zdanie.length(); i++)
{
if(zdanie[i] != ' ')
{
bezSpacji += zdanie[i];
}
}
return bezSpacji == odwroc(bezSpacji);
}

string zdanie;
while(getline(plik,zdanie))
{
cout << zdanie << " -> ";

if(palindromZdanie(zdanie))
{
cout << "PALINDROM";
}
else
{
cout << "NIE PALINDROM";
}
cout << endl;
}

cin >> n;
int tab[n];
for(int i=0; i<n; i++){
    tab[i] = rand() % 51 + 10;
}
sortowaniePrzezWybieranie(tab, n);
  for (int i = 0; i < n; i++) {
        cout << tab[i] << " ";
    }
    cout << endl;

#include <iostream>

using namespace std;



string odwrot(string w)
{
    string odwrocony="";
    for(int i=w.length()-1;i>=0;i--)
    {
        odwrocony+=w[i];
    }
    return odwrocony;
}

bool palindrom(string w)
{
    if(w==odwrot(w))
    {
        return true;
    }
    else{
        return false;
    }
}

string najpalindrom(string w)
{
    string pali="";
    int z=0;
    while(z!=w.length()){
    for(int i=0;i<w.length()-z;i++)
    {
        pali+=w[i];
    }
    if(palindrom(pali)==true)
    {
        return pali;
    }
    else{
        z++;
        pali="";
    }
    }
}

int main()
{

    cout << najpalindrom("kaktus");

    return 0;
}