Yo`nalishlar
Hozirda online

Statistika

Masalalar soni: 909

Foydalanuvchilar soni: 8824

Jo'natishlar soni: 714631

Muhokama yozuvlari: 4541

Yangiliklar soni: 98

Yangiliklar izohlari: 1177


So'ngi izohlar

  1. 2. Maxmadiyorov Faxriddin , , #416. OYDT17

    #include<bits/stdc++.h>
    using namespace std;
    int main ()
    {
        deque<int> list;
        deque<int>::iterator it;
       string s; getline(cin, s);
       int k=s.size();
       for (int i=0; i<k; i++)
       {
           if (s[i]=='a')
           list.push_back(i+1);
       }
           for (it=list.begin(); it!=list.end(); it++)
           cout<<*it; }

  2. 3. Maxmadiyorov Faxriddin , , #413. OYDT14

    #include<bits/stdc++.h>
    using namespace std;
    int main ()
    {
        int array[1000];
        int n; cin>>n;
        for (int i=0; i<n; i++)
        cin>>array[i];
        sort(array, array+n);
        for (int i=0; i<n; i++)
        cout<<array[i]<<" ";
        cout<<endl;
        for (int i=n-1; i>=0; i--)
        cout<<array[i]<<" ";
    }
        

  3. 4. Mamurjon Mirzapulatov , , #478. Davriy son

    Var n,i,s:longint; label a1;
    begin
    read(n);s:=0;
    if n/2=trunc(n/2) then begin writeln('no');goto a1;end
      else
           for i:=1 to n do
              begin
               if n/i=trunc(n/i) then s:=s+1;
              end;
       begin
        if s=2 then writeln('yes') else writeln('no');
       end;

  4. 5. Mamurjon Mirzapulatov , , #449. TDT19

    Var n,i,s:longint; label a1;
    begin
    read(n);s:=0;
    if n/2=trunc(n/2) then begin writeln('no');goto a1;end
      else
           for i:=1 to n do
              begin
               if n/i=trunc(n/i) then s:=s+1;
              end;
       begin
        if s=2 then writeln('yes') else writeln('no');
       end;

  5. 6. Mamurjon Mirzapulatov , , #181. Orollar

    Var n,i,s:longint; label a1;
    begin
    read(n);s:=0;
    if n/2=trunc(n/2) then begin writeln('no');goto a1;end
      else
           for i:=1 to n do
              begin
               if n/i=trunc(n/i) then s:=s+1;
              end;
       begin
        if s=2 then writeln('yes') else writeln('no');
       end;

  6. 7. Mamurjon Mirzapulatov , , #418. OYDT19

    var n:integer; s,i:real;
    begin
    read (n);
    s:=0;
    i:=1;
    while i <=n do begin
    s:=s+(3*i*i*i+4*sqr (i)+5*i)/(i*i*i+sqr (i)+i);
    i:=i+1;
    end;
    writeln(s:0:2);
    end.

  7. #include<iostream>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    struct  biatlon{
    string s;
    int x,t,in,vaqt;


    };
    bool alm(biatlon s1, biatlon s2 ){
    return (s1.vaqt<s2.vaqt) || (s1.vaqt==s2.vaqt && s1.x<s2.x) || (s1.vaqt==s2.vaqt&&s1.x==s2.x&&s1.t>s2.t) ||(s1.vaqt==s2.vaqt&&s1.x==s2.x&&s1.t==s2.t&&s1.in<s2.in);
    }
    int main ()
    {
    biatlon a[100];
    int n,x,y;
    char f;
    cin>>n;
    for(int i=0;i<n;i++){
    cin>>a[i].s>>x>>f>>y>>a[i].x>>a[i].t;
    a[i].vaqt=60*x+y+200*a[i].x/(a[i].t*60);
    a[i].in=i;

    }
    sort(a,a+n,alm);
    for(int i=0;i<n;i++){
    cout<<a[i].s<<" ";
    if(a[i].vaqt/60>=10)cout<<a[i].vaqt/60;
    else cout<<0<<a[i].vaqt/60;
    cout<<":";
    if(a[i].vaqt%60>=10)cout<<a[i].vaqt%60;
    else cout<<0<<a[i].vaqt%60;
    cout<<" ";
    cout<<a[i].x<<"\n";

    }

    }

  8. #include <bits/stdc++.h>
    using namespace std;
    unsigned long long n,p=1,i=2,k;
    int main()
    {
    cin>>n;
    while(n!=1){
    while(n%i==0){
    n=n/i; k++;
    if(n%i!=0){
    p*=(pow(i,k+1)-1)*1./(i-1);
    }
    }k=0;
    i++;
    }cout<<p;
    }100% tug'risi

  9. 10. Nodir Qodirov, , #037. Tarmoqlanuvchi7

    #include <bits/stdc++.h>
    #include <stdio.h>
    using namespace std;

    int main()
    {
        int a,b;
        cin>>a>>b;
        if(a<=b) {a=0; cout<<a<<" "<<b;} else {cout<<a<<" "<<b;}
        return 0;
    }

Muhokamada qatnashish uchun dastlab tizimga kiring yoki ro`yxatdan o`ting!