Codeforces Beta Round #1

来源：互联网发布：速成韩语知乎编辑：程序博客网时间：2024/06/05 05:11

点击打开链接

#include<iostream>#include<cstdio>using namespace std;long long  n , m , a;int main(){   long long  sum;   while(cin>>n>>m>>a){      long long x , y;      x = n%a == 0 ? n/a : n/a+1;      y = m%a == 0 ? m/a : m/a+1;      sum = x*y;      cout<<sum<<endl;   }   return 0;}

#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<cmath>using namespace std;#define MAXN 200int n;int main(){       char str[MAXN] , tmp[MAXN];   char c1 , c2 , c3 , c4;   int x , y;   scanf("%d" , &n);   while(n--){      scanf("%s" , str);            int len = strlen(str);      int mark = 0;      for(int i = 1 ; i < len ; i++){         if(isdigit(str[i]) && isalpha(str[i-1]))           mark++;      }      if(mark == 2){                 sscanf(str , "R%dC%d" , &y , &x);                int pos = 0;         while(x){           int num = (x-1)%26;           tmp[pos++] = num+'A';           x = (x-1)/26;        }        for(pos-- ; pos >= 0 ; pos--)           printf("%c" , tmp[pos]);        printf("%d\n" , y);      }      else{        int i;        x = y = 0;            for(int i = 0 ; i < len ; i++){           if(isdigit(str[i]))              y = y*10+str[i]-'0';           else              x = x*26+(str[i]-'A'+1);        }        printf("R%dC%d\n" , y , x);      }   }   return 0;}