zoukankan      html  css  js  c++  java
  • codeforces round #234B(DIV2) C Inna and Huge Candy Matrix

    #include <iostream>
    #include <vector>
    #include <algorithm>
    #include <utility>
    
    using namespace std;
    
    typedef pair<int,int> Point;
    
    int n,m;
    
    void clockwise_rotate(Point &cell, int x){
        for(int i = 0; i < x; ++ i){
            int tmp = cell.first;
            cell.first = cell.second;
            cell.second = n-tmp + 1;
            swap(n,m);
        }
    }
    
    void horizontal_rotate(Point &cell, int y){
        if(y==1) cell.second = m - cell.second +1;
    }
    
    int main(){
        int x,y,z,p;
        cin >> n >> m >> x >> y >> z >> p;
        x %=4; y %=2; z %= 4;
        int tmp_n = n,tmp_m = m;
        for(int i = 0 ; i <  p; ++ i){
            n = tmp_n; m =tmp_m;
            int cellX,cellY;
            cin >> cellX >> cellY;
            Point cell = make_pair(cellX,cellY);
            clockwise_rotate(cell,x);
            horizontal_rotate(cell,y);
            clockwise_rotate(cell,4-z);
            cout<<cell.first<<" "<<cell.second<<endl;
        }
        return 0;
    }
  • 相关阅读:
    php的echo和print
    面向对象进阶:命名空间和组合
    初识面向对象
    模块和包
    异常处理
    常用模块(random,os,json,pickle,shelve)
    闭包函数
    re模块和正则表达式
    常用模块
    匿名函数
  • 原文地址:https://www.cnblogs.com/xiongqiangcs/p/3590753.html
Copyright © 2011-2022 走看看