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. 11. Sohibjon Xoliqulov, , #191. Shifudan sovg'a

    uses crt;
    var n,x,y:integer;S:real;
    begin
    read(x,y,n);
    S:=(exp(exp(1/x)*ln(y)*n)*ln(2));
    write('s=',s:0:0);
    end. tekinxorla  ucun

  2. 13. Samandar Raimberdiyev , , #609. Invers

    [Mysql] Can't find record in 'task'
    [Query] SELECT CreatedOn FROM Task WHERE User_UID='8653' ORDER BY CreatedOn DESC LIMIT 1
    kod jonatsam sahifada shu chiqyapti adminlar qaravorilar

  3. 14. Samandar Raimberdiyev , , #609. Invers

    #include<iostream>
    #include<math.h>
    using namespace std;
    int main () {
    __int64 n,a[1000],k=0,b[1000],d=0;
    cin>>n;
    while(n>=1) {
    a[k]=n%2;
    n=n/2;
    k++;
    }

    for(int i=k; i<31; i++) {
    a[i]=0;
    }

    for(int i=0; i<31; i++) {
    if(a[i]==0)a[i]=1;
    else a[i]=0;
    }
    for(int i=30;i>=0; i--) {
    b[d]=a[i];
    d++;
    }
    long long s=0;
    for(int i=0; i<31; i++) {
    s+=b[i]*pow(2,31-1-i);
    }
    cout<<s;
    return 0;
    }

  4. 15. Obid Sindorov, , #247. Tub sonlar

    #include<bits/stdc++.h>
    using namespace std;
    long long n,s;
    int main()
    {
        cin >> n;
        bool x[n+1]={false};
        for(int i=2; i<=n; i++){
                if(x[i]==false){
                    s+=i;
                    for(int j=i*i; j<=n; j+=i){
                        a[j]=true;
                    }
                }
        }
        cout << s;
        return 0;
    }//eng sodda algoritimi tayim lemit bermaydi

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