This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//For-33 | |
var n, i, tmp_1, tmp_2, fibnumer, should_break: integer; | |
begin | |
readln(n); | |
tmp_1:=1; tmp_2:=1; | |
if (n=1) then begin writeln(1); should_break:=1; end; | |
if (n=2) then begin write(1,' ', 1);; should_break:=1; end; | |
if (should_break <> 1) then | |
for i:=3 to n do | |
begin |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
EBVKAPIRequest *another_request = [[EBVKAPIRequest alloc] initWithMethodName: @"status.get" | |
parameters: [NSDictionary dictionaryWithObject: @"1" | |
forKey: @"uid"] | |
responseFormat: EBXMLFormat]; | |
EBVKAPIResponse *response = [another_request sendRequestWithToken: token]; | |
if (response) { | |
if (response.response) { | |
NSLog(@"Pavel's status is '%@'", [response.response objectForKey: @"text"]); | |
} else { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var arr: array [1..10000] of integer; | |
n, i : integer; | |
begin | |
readln(n); | |
for i:=1 to n do | |
read(arr[i]); | |
for i:= 1 to (n div 2) do | |
begin | |
arr[n-i+1]:= arr[n-i+1] + arr[i]; | |
arr[i]:= arr[n-i+1] - arr[i]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
type tagstype = array [1..5] of string; | |
var i,k,m, count, tags_count, max_popularity : longint; | |
title, tmp, site: string; | |
c: char; | |
tags: tagstype; | |
{ --------- } | |
function tagPreferred(tagname:string; alltags: tagstype; count: integer): integer; | |
var i: integer; | |
begin | |
for i:=1 to 5 do |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Вчера, заезжая в налоговую инспекцию что бы подать декларацию по УСН за прошлый год. Моя инспектор приняв декларацию (и даже толком не посмотрев ее), сказала: «Еще, вам нужно к Павлу Петровичу*». | |
Нужно — значит нужно, пойдемте. | |
Зайдя в кабинет к Павлу Петровичу и взглянув на его стол сразу было понятно о чем дальше пойдет реч — на столе лежали распечатки всех транзакций по моему электронному кошельку EasyPay с 2006 по 2008 год (кошелек был давно заброшен т.к. система не самая удобная для работы, да и комиссия в 2% не может радовать). | |
Павел Петрович* покапался в недрах стола, извлек бланк объяснения: | |
— Здравствуйте. | |
— Здравствуйте. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
type tagstype = array [1..5] of string; | |
var i,k,m, count, tags_count, max_popularity : longint; | |
title, tmp, site: string; | |
c: char; | |
tags: tagstype; | |
function tagPreferred(tagname:string; alltags: tagstype; count: integer): integer; | |
var i, a: integer; | |
begin |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
type tagstype = array [1..5] of string; | |
var i,k,m, count, tags_count, max_popularity, s, sk : longint; | |
title, tmp, site: string; | |
c: char; | |
tags: tagstype; | |
function tagPreferred(tagname:string; alltags: tagstype; count: integer): integer; | |
var i, a: integer; | |
begin |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var i, k, q, w, h, line, tmp: integer; | |
sum_1, sum_2 : array [1..50] of integer; | |
begin | |
assign(INPUT, 'Input.txt'); | |
reset(INPUT); | |
assign(OUTPUT, 'Output.txt'); | |
rewrite(OUTPUT); | |
readln(w,h); | |
k:=1; | |
line:=1; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{--- 23 ---} | |
var matrix: array [1..15000, 1..15000] of integer; | |
maxs: array [1..15000] of integer; | |
m, n, tmp, i, k : integer; | |
begin | |
readln(m,n); | |
for i:=1 to m do | |
begin | |
maxs[i]:=0; | |
for k:=1 to n do |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var source: string; | |
i, k, flag: integer; | |
c: char; | |
begin | |
readln(source); | |
for i:= 1 to length(source) do | |
begin | |
flag:=0; | |
for k:= (i+1) to length(source) do |
OlderNewer