#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <windows.h>
const int _DELAY = 300;
void set_cursor_position(int row, int col)
{
COORD coord;
coord.X = col;
coord.Y = row;
SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), coord);
}
void set_left_top(int *start_row, int *start_col, const int finish_row, const int finish_col)
{
while (true)
{
Sleep(_DELAY);
set_cursor_position(*start_row, *start_col);
printf("1");
*start_row = *start_row - 1;
*start_col = *start_col - 1;
if (*start_row < finish_row)
{
*start_row = *start_row + 1;
*start_col = *start_col + 2;
break;
}
if (*start_col < finish_col)
{
*start_col = *start_col + 1;
break;
}
}
}
void set_right_bottom(int *start_row, int *start_col, const int finish_row, const int finish_col)
{
while (true)
{
Sleep(_DELAY);
set_cursor_position(*start_row, *start_col);
printf("0");
*start_row = *start_row + 1;
*start_col = *start_col + 1;
if (*start_col > finish_col)
{
*start_row = *start_row - 2;
*start_col = *start_col - 1;
break;
}
if (*start_row > finish_row)
{
*start_row = *start_row - 1;
break;
}
}
}
int main()
{
printf("*** MATRIX RESOLUTION ***\n\n");
int rows;
printf("ROWS: ");
scanf("%d", &rows);
int padding_top = rows + 4;
int padding_left = 2;
int cols;
printf("COLS: ");
scanf("%d", &cols);
cols = cols + padding_left;
bool direction = true;
int start_row = padding_top;
int start_col = padding_left;
while (start_row != (padding_top - rows) + 1 || start_col != cols)
{
if (direction)
{
set_left_top(&start_row, &start_col, (padding_top - rows) + 1, padding_left);
}
else
{
set_right_bottom(&start_row, &start_col, padding_top, cols - 1);
}
direction = !direction;
}
padding_top = padding_top + 1;
set_cursor_position(padding_top, 0);
return 0;
}ужоснах
n, k = map(int, input().split())
if n == 0:
result = 0
elif k == 0:
result = 1
else:
result = n
for _ in range(1, k):
if result < 1000000000:
result *= n
else:
result = -1
break
print(result)Как тебе такое, Илон Маск?
#include <bitset>
#include <iostream>
int main() {
const int mask = 0xFFFFFFFF;
int a = 12345678;
std::cout << std::bitset<32>(a) << std::endl;
int p = 9;
std::cout << std::bitset<32>(a & (mask << 9 - 1)) << std::endl;
return 0;
}
// 00000000101111000110000101001110
// 00000000101111000110000100000000
k = 3
s = 'ШКОЛА'
print(''.join(s[k:] + s[:k])[::-1]) # ОКШАЛ
# возможно стоит еще добавить такое, если k будет больше чем длина строки
print(''.join(s[k % len(s):] + s[:k % len(s)])[::-1]) # ОКШАЛk, зачем в коде ее заменять на a?b=str(input()).upper() - зачем переводить в верхний регистр?
<?php
function normalize($num)
{
while ($num % 10 == 0)
{
$num = intdiv($num, 10);
}
return ($num % 100);
}
$k = 50; // k! = 30414093201713378043612608166064768844377641568960512000000000000
$result = 1;
for ($i = 2; $i <= $k; $i++)
{
$result = normalize($result * $i);
}
echo $result % 10; // 2function onEdit(e) {
var range = e.range;
var sheet = range.getSheet();
var names = ['Расход 09.19', 'Расход 10.19', 'Расход 11.19', 'Расход 12.19', 'Расход 01.20', 'Расход 02.20'];
if (names.indexOf(sheet.getName()) == -1) {
return false;
}
var col = range.getColumn();
var row = range.getRow();
var offset = 2;
if ((col > 4) && ((col - 5) % 3 == 0)) {
if (range.offset(0, offset).getValues() == '') {
sheet.getRange(row, col + offset).setValue(Utilities.formatDate(new Date(), 'GMT+03:00', 'HH:mm'));
}
}
}from itertools import product
A = [1, 2]
B = [8, 9, 14]
print(list(product(A, B))) # [(1, 8), (1, 9), (1, 14), (2, 8), (2, 9), (2, 14)]