Codeforces Beta Round #12 (Div 2 Only)
2013-04-30 23:18
267 查看
点击打开链接
A
B
C
E
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN = 1010;
int mat[MAXN][MAXN];
int main(){
int n;
while(scanf("%d" , &n) != EOF){
memset(mat , 0 , sizeof(mat));
for(int i = 0 ; i < n-1 ; i++){
for(int j = 0 ; j < n-1 ; j++)
mat[i][j] = (i+j)%(n-1)+1;
}
//替换
for(int i = 0 ; i < n ; i++){
mat[i][n-1] = mat[i][i];
mat[n-1][i] = mat[i][i];
mat[i][i] = 0;
}
//输出
for(int i = 0 ; i < n ; i++){
printf("%d" , mat[i][0]);
for(int j = 1 ; j < n ; j++)
printf(" %d" , mat[i][j]);
printf("\n");
}
}
return 0;
}
A
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; char str[3][3]; bool isOk(){ for(int i = 0 ; i < 3 ; i++){ for(int j = 0 ; j < 3 ; j++){ if(str[i][j] != str[2-i][2-j]) return false; } } return true; } int main(){ while(gets(str[0])){ for(int i = 1 ; i < 3 ; i++) gets(str[i]); printf("%s\n" , isOk() ? "YES" : "NO"); } return 0; }
B
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int main(){ const int MAXN = 1000; bool ans; char nStr[MAXN] , mStr[MAXN]; while(gets(nStr)){ gets(mStr); int len = strlen(nStr); sort(nStr , nStr+len); int pos = 0; for(int i = 0 ; i < len ; i++){ if(nStr[i] != '0'){ pos = i; break; } } swap(nStr[pos] , nStr[0]); printf("%s\n" , !strcmp(nStr , mStr) ? "OK" : "WRONG_ANSWER"); } return 0; }
C
#include<map> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int N = 110; map<string , int>mp; int n , m , pos , num , price ; bool cmp(int a , int b){ return a > b; } int main(){ char str ; while(scanf("%d%d" , &n , &m) != EOF){ for(int i = 0 ; i < n ; i++) scanf("%d" , &price[i]); mp.clear(); pos = 1; for(int i = 0 ; i < m ; i++){ scanf("%s" , str); if(!mp[str]) mp[str] = pos++; num[mp[str]]++; } sort(price , price+n); sort(num+1 , num+1+pos , cmp); int minPrice , maxPrice; minPrice = maxPrice = 0; int k = 0; for(int i = 1 ; i <= pos ; i++) minPrice += price[k++]*num[i]; k = n-1; for(int i = 1 ; i <= pos ; i++) maxPrice += price[k--]*num[i]; printf("%d %d\n" , minPrice , maxPrice); } return 0; }
E
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN = 1010;
int mat[MAXN][MAXN];
int main(){
int n;
while(scanf("%d" , &n) != EOF){
memset(mat , 0 , sizeof(mat));
for(int i = 0 ; i < n-1 ; i++){
for(int j = 0 ; j < n-1 ; j++)
mat[i][j] = (i+j)%(n-1)+1;
}
//替换
for(int i = 0 ; i < n ; i++){
mat[i][n-1] = mat[i][i];
mat[n-1][i] = mat[i][i];
mat[i][i] = 0;
}
//输出
for(int i = 0 ; i < n ; i++){
printf("%d" , mat[i][0]);
for(int j = 1 ; j < n ; j++)
printf(" %d" , mat[i][j]);
printf("\n");
}
}
return 0;
}
相关文章推荐
- Codeforces Beta Round #87 (Div. 2 Only) A题
- Codeforces Beta Round #84 (Div. 2 Only) A题
- Codeforces Beta Round #83 (Div. 1 Only) E.Darts 凸多边形面积交
- Codeforces Beta Round #4 (Div. 2 Only)
- Codeforces Round #437 (Div. 2 C. Ordering Pizza 贪心 only two types of pizza
- 【CS Round #39 (Div. 2 only) B】Circle Elimination
- Codeforces Beta Round #86 (Div. 2 Only) E Double Happiness 素数筛法,费马平方和定理
- Codeforces Beta Round #86 (Div. 2 Only) B PFAST Inc.
- Codeforces Beta Round #75 (Div. 1 Only) B. Queue 线段树。单点更新
- Codeforces Beta Round #6 (Div. 2 Only) D. Lizards and Basements 2
- Round #6 (Div. 2 Only) (E )(RMQ+尺取法)
- Codeforces Beta Round #4 (Div. 2 Only) A. Watermelon
- Codeforces Beta Round #80 (Div. 1 Only) D. Time to Raid Cowavans 离线+分块
- Codeforces Round #249 (Div. 2 Only)(A-E)
- Codeforces Beta Round #74 (Div. 2 Only)——C
- Codeforces Beta Round #4 (Div. 2 Only) C. Registration system
- Codeforces Beta Round #93 (Div. 2 Only) A题
- Codeforces Beta Round #83 (Div. 1 Only) E.Darts 凸多边形面积交
- Codeforces Beta Round #6 (Div. 2 Only) A. Triangle 水题
- Codeforces Beta Round #9 (Div. 2 Only):B