[BadVista Advocate] Linux for Newbies

Jacob Maynard indymaynard at maynard.homelinux.com
Fri Jul 13 14:06:31 EDT 2007


I hate to seem ignorant, but what language is this?

Jacob

> bool CONDITION (long long x) {
> 	long long int s = 0;
> 	for (int i = 0; i < n - 1; i++)
> 		s = A[i].y - x + s - (A[i + 1].x - A[i].x);
>
> 	if ((A[n - 1].y - x + s) >= 0)
> 		return 1;
> 	return 0;
> }
>
> tova 4udo e gre6no - ako a[i].y - x + s e po golqmo ot 0, no po malko
> ot A[i+1].x - A[i].x - t.e pri cqlata operaciq s stava otricatelno ti
> vse edno si imal dostatu4no riba no pak iska6 o6te ot sledva6tiq i go
> precakva6. Li4no az mislq 4e ne moje da re6i6 zada4ata samo s formula
> - trqbva i pone nqkakyv if (e moje i da moje bez no tova sys sigurnost
> e gre6no).
>
> P.S. Identaciqta ti e pod vsqkakva kritika, funkciqta nqma nujda da se
> kazva sys zvy4noto CONDITION - to po skoro na makrso mqzi - ako ima6 3
> bsrch-ta v edna zada4a kak 6te gi kry6tava6 :). Za6to pi6e6 using
> namespace std sled kato nqma6 ni6to C++ v koda?
>
> P.S.2 zada4ata ne vyrvi na nito edin test - daje se symnqvam za
> vhodniq no se nadqvam pone tam da si q proveril. Moje da nameri6
> uslovieto i testovete tuk:
> http://iskren.info/info-arh/HSIN/2005/National/day2/Juniors/
> /////////////////////////////////
> na circle ti vyrvqt do 6ti test, drugite davat segmentation fault (az
> sum na linux na win moje i da vyrvi). Zna4i qvno ne6to ograni4eniqta
> si oburkal (neznam i ne mi e rabota da ti opravqm re6enieto).
>
> Fix-vai i pra6tai :)
>
> Iskren
>
> _______________________________________________
> Advocate mailing list
> Advocate at badvista.org
> http://badvista.fsf.org/mailman/listinfo/advocate
>





More information about the Advocate mailing list