Messages posted by: OP Magic Potato

@MOI

sakam detalno reshenie za zadacava deka ne go razbiram kodot od wikito

abe neznaev togash, inache mislev na ova:
queue<int> q[500];

dali ke moze pocetokot na regionalniot naptrevar da go premestite vo 13:00, bidejki povekjeto programeri imaat bogat socijalen zivot, ispolnet so zurkanje petok navecer do ranite utrinski casovi, po sto se razbira sledi doza spienje do nekade 12h

jas sum ma

abe pobarav da mi go smenat nickot na forumot, ama uste nemam odgovor.

ok, svativ

fala bujo, dolznik ti sum

kako i da e sakam da go reformuliram prashanjeto,
zosto na istata zadaca ovoj kod raboti:

a ovoj kod ne raboti:

Mi treba pomosh so zadacava:

Factorials
------------------------------------------------------------------------------------------------
The factorial of an integer N, written N!, is the product of all the integers from 1 through N inclusive. The factorial quickly becomes very large: 13! is too large to store in a 32-bit integer on most computers, and 70! is too large for most floating-point variables. Your task is to find the rightmost non-zero digit of n!. For example, 5! = 1 * 2 * 3 * 4 * 5 = 120, so the rightmost non-zero digit of 5! is 2. Likewise, 7! = 1 * 2 * 3 * 4 * 5 * 6 * 7 = 5040, so the rightmost non-zero digit of 7! is 4.

PROGRAM NAME: fact4

INPUT FORMAT

A single positive integer N no larger than 4,220.
SAMPLE INPUT (file fact4.in)

7
OUTPUT FORMAT

A single line containing but a single digit: the right most non-zero digit of N! .
SAMPLE OUTPUT (file fact4.out)

4

------------------------------------------------------------------------------------------------------

go najdov ovoj kod na internet:

kodot raboti, ama ne mi e bash jasno kako.

i dali ke moze nekoj da mi objasni zosto ovoj kod ne raboti:

kako so ima na svetska, da znaesh kolku boda imash uste pred krajot na natprevarot, ili del od test primetire da se testiraat uste koga ke go pratish kodot, kako sto e so prvata zadaca

da stavite tokeni na slednite on-site natprevari.

moze nekoj idejata za 4tata da mi ja objasni

sto ako nekoj ne e na vreme za pocetok na natprevarot? na pr vleguva na stranata na mendo vo 16:10, dali ke moze da gi vidi zadacite i da prakja reshenija?

od koj temi ke bidat? (dinamicko, grafovi, etc)

Dali tie sto bile na jboi imaat pokana za moi??

ok!!! xD

za cista sporedba, eve go mojot kod:

#include <iostream>
#include<algorithm>
using namespace std;

int main()
{
    int n;
    cin >> n;
    int br[n][8];
    for(int i=0;i<n;i++){//vnesuvam broevi
        cin >> br[i][0];
        int n1=br[i][0];
        for(int j=1;j<=n1;j++)cin >> br[i][j];
    }
    int k=1;
    int ma[300][300];
    for(int i=0;i<260;i++){// generiram matrica
        int q=i+1;
        for(int j=0;j<q;j++){
            ma[i][j]=k;
            k++;
        }
    }
    for(int i=0;i<n;i++){//gi pominuvam site inputi
        int niz[8];
        for(int j=1;j<=br[i][0];j++)niz[j-1]=br[i][j];
        sort(niz,niz+br[i][0]);//gi sortiram tockite;i so toa znam znam deka tockata so intdeks (i+1) e desno ili dolu od tockata i
        int k=1, xovi[6], yi[6];
        for(int l=0;l<br[i][0];l++){// gi baram koordinatite na tockite
            int m=0, n=0;
            while (ma[m][n]!=niz[l]){
                n = 0;
                while (ma[m][n]!=niz[l]&&n<m+1)n++;
                if(ma[m][n]!=niz[l])m++;
            }
            xovi[l]=m;
            yi[l]=n;
        }
        if(br[i][0]==3){// za triagolnik
            if(yi[0]==yi[1]&&xovi[1]==xovi[2]&&//dali tockite se povrzani
               yi[2]-yi[1]==xovi[1]-xovi[0]// dali se na ednakvo rastojanie; istoto e za drugite...
               )cout << "TRIAGOLNIK"<<endl;
            else if(xovi[0]==xovi[1]&&yi[2]==yi[1]&&yi[1]-yi[0]==xovi[2]-xovi[1])cout << "TRIAGOLNIK"<<endl;
            else cout << "NISTO"<<endl;
        }
        else if(br[i][0]==4){//za paralelogram
            if(xovi[0]==xovi[1]&&yi[0]==yi[2]&&xovi[2]==xovi[3]&&yi[1]==yi[3]&&yi[1]-yi[0]==xovi[2]-xovi[0]&&yi[3]-yi[2]==xovi[2]-xovi[0])cout << "PARALELOGRAM"<<endl;
            else if(xovi[0]==xovi[1]&&yi[1]==yi[2]&&xovi[2]==xovi[3]&&yi[1]-yi[0]==xovi[2]-xovi[1]&&yi[3]-yi[2]==xovi[2]-xovi[1])cout << "PARALELOGRAM"<<endl;
            else if(yi[0]==yi[1]&&xovi[1]==xovi[2]&&yi[2]==yi[3]&&xovi[1]-xovi[0]==yi[2]-yi[1]&&xovi[3]-xovi[2]==xovi[1]-xovi[0])cout << "PARALELOGRAM"<<endl;
            else cout << "NISTO"<<endl;
        }
        else if(br[i][0]==6){//za sestoagolnik
            if(xovi[0]==xovi[1]&&xovi[2]==xovi[3]&&xovi[4]==xovi[5]&&yi[0]==yi[2]&&yi[1]==yi[4]&&yi[3]==yi[5]&&yi[1]-yi[0]==yi[5]-yi[4]&&2*(yi[1]-yi[0])==(yi[3]-yi[2])&&2*(yi[1]-yi[0])==(xovi[4]-xovi[1])&&yi[1]-yi[0]==xovi[2]-xovi[0]&&yi[1]-yi[0]==xovi[5]-xovi[3])cout << "SESTOAGOLNIK"<<endl;
            else cout << "NISTO" <<endl;
        }
        else cout << "NISTO"<<endl;
    }
    return 0;
}