哎,心血来潮想做CF,大晚上去买了根网线(被坑了= =#),晚上在寝室客厅做。第一次这么认真滴做,Q都木有上,整整做了俩小时。。。D题木有看,E题挂掉了,rating涨了20+才。。。桑心。
A题,好好读题,表示英语不好真的伤不起捏
转换的条件是,
1、全部大写
2、除了第一个小写其他都是大写
B题,求相反数的对数,0特判,其他没啥了。
C题,组合数啊,很容易分析,关键是怎么求,囧,直接算可能会超long long,做法就是质因数分解,质因数可以手动打表,没几个,然后分子分母消掉同样个数的质因数即可。
E题,我按模拟题做的。不可暴力。我的做法是,按行,列,左上到右下,左下到右上,这样统计个数。比如按行,同一行的皇后 存到这一行的邻接表里,然后统计每一行皇后的情况,注意一点就是,如果这一行的皇后在两端,那么要特判的,我2了,没判,直接做了,比较简单的做法是,求出来端点的俩值,很好算的,minx,miny,maxx,maxy,只要不是这俩,其他的攻击数都加2。算斜列的时候映射就不是N了,是2*N-1,因为斜列有2*N-1个,我算的左下到右上是把矩阵顺时针旋转90度后就和左上到右下做法一样了。旋转的话很简单,自己画下就知道了。
A
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <limits.h>
#include <string.h>
#include <string>
#include <algorithm>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define FOR(i,s,t) for(int i=(s); i<(t); i++)
#define BUG puts("here!!!")
#define STOP system("pause")
#define file_r(x) freopen(x, "r", stdin)
#define file_w(x) freopen(x, "w", stdout)
using namespace std;
bool allUpper(char *s, int len)
{
FOR(i, 0, len)
if( islower(s[i]) )
return false;
return true;
}
bool solve(char *s, int len)
{
if( allUpper(s, len) )
return true;
if( allUpper(s+1, len-1) && islower(s[0]) )
return true;
return false;
}
int main()
{
char s[110];
while( ~scanf("%s", s) )
{
int len = strlen(s);
bool change = solve(s, len);
if( change )
{
FOR(i, 0, len)
{
if( isupper(s[i]) )
s[i] = tolower(s[i]);
else
s[i] = toupper(s[i]);
}
}
puts(s);
}
return 0;
}
B
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <limits.h>
#include <string.h>
#include <string>
#include <algorithm>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define FOR(i,s,t) for(int i=(s); i<(t); i++)
#define BUG puts("here!!!")
#define STOP system("pause")
#define file_r(x) freopen(x, "r", stdin)
#define file_w(x) freopen(x, "w", stdout)
using namespace std;
const int MAX = 100010;
int a[100];
typedef __int64 LL;
int main()
{
int n, val;
while( ~scanf("%d", &n) )
{
memset(a, 0, sizeof(a));
FOR(i, 0, n)
{
scanf("%d", &val);
a[val+10] ++;
}
LL ans = 0;
FOR(i, 0, 11)
{
if( i == 10 )
ans += a[i]*1ll*(a[i]-1)/2;
else
ans += a[i]*1ll*a[-i+20];
}
printf("%I64d\n", ans);
}
return 0;
}
C
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <limits.h>
#include <string.h>
#include <string>
#include <algorithm>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define FOR(i,s,t) for(int i=(s); i<(t); i++)
#define BUG puts("here!!!")
#define STOP system("pause")
#define file_r(x) freopen(x, "r", stdin)
#define file_w(x) freopen(x, "w", stdout)
using namespace std;
typedef long long LL;
int pri[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
LL C(int n, int m)
{
if( m > n ) return 0;
if( m == n ) return 1;
int a[100], b[100];
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
int nn = n, mm = m;
FOR(i, m+1, n+1)
{
int t = i;
FOR(k, 0, 10)
while( t % pri[k] == 0 )
{
a[pri[k]]++;
t /= pri[k];
}
}
FOR(i, 2, n-m+1)
{
int t = i;
FOR(k, 0, 10)
while( t % pri[k] == 0 )
{
b[pri[k]]++;
t /= pri[k];
}
}
FOR(i, 2, 50)
if( a[i] > b[i] )
{
a[i] -= b[i];
b[i] = 0;
}
else
{
b[i] -= a[i];
a[i] = 0;
}
LL ans = 1;
FOR(i, 2, 50)
if( a[i] )
{
FOR(k, 0, a[i])
ans *= i;
}
FOR(i, 2, 50)
if( b[i] )
{
FOR(k, 0, b[i])
ans /= i;
}
return ans;
}
int main()
{
int n, m, t;
while( cin >> n >> m >> t )
{
LL ans = 0;
FOR(i, 4, t)
{
int nv = t - i;
ans += C(n, i) * 1ll * C(m, nv);
}
cout << ans << endl;
}
return 0;
}
E
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <limits.h>
#include <string.h>
#include <string>
#include <algorithm>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define FOR(i,s,t) for(int i=(s); i<(t); i++)
#define BUG puts("here!!!")
#define STOP system("pause")
#define file_r(x) freopen(x, "r", stdin)
#define file_w(x) freopen(x, "w", stdout)
using namespace std;
const int MAX = 200010;
int num[MAX];
struct NODE {
int id;
int x, y;
NODE *next;
};
NODE node[MAX], t[MAX], *p[MAX];
int len[MAX];
int cnt;
void init()
{
memset(len, 0, sizeof(len));
memset(p, 0, sizeof(p));
cnt = 0;
}
void solve(int mmax)
{
FOR(i, 0, mmax)
{
if( len[i] >= 2 )
{
NODE *head = p[i];
int k = 1;
int minx = MAX, maxx = 0, miny = MAX, maxy = 0;
while( head )
{
int id = head->id;
minx = min(minx, t[id].x);
maxx = max(maxx, t[id].x);
miny = min(miny, t[id].y);
maxy = max(maxy, t[id].y);
head = head->next;
}
head = p[i];
while( head )
{
int id = head->id;
if( t[id].x == minx && t[id].y == miny || t[id].x == maxx && t[id].y == maxy )
num[id]++;
else
num[id] += 2;
head = head->next;
}
}
}
}
int main()
{
int n, m;
while( ~scanf("%d%d", &n, &m) )
{
memset(num, 0, sizeof(num));
// 横条条
init();
FOR(i, 0, m)
{
scanf("%d%d", &t[i].x, &t[i].y);
node[cnt].id = i;
node[cnt].next = p[t[i].x];
p[t[i].x] = &node[cnt++];
len[t[i].x]++;
}
solve(MAX/2);
// 竖条条
init();
FOR(i, 0, m)
{
node[cnt].id = i;
node[cnt].next = p[t[i].y];
p[t[i].y] = &node[cnt++];
len[t[i].y]++;
}
solve(MAX/2);
//左上到右下
init();
FOR(i, 0, m)
{
if( t[i].x > t[i].y )
{
node[cnt].id = i;
node[cnt].next = p[t[i].x - t[i].y];
p[t[i].x - t[i].y] = &node[cnt++];
len[t[i].x - t[i].y]++;
}
else
{
node[cnt].id = i;
node[cnt].next = p[t[i].y - t[i].x + MAX/2];
p[t[i].y - t[i].x + MAX/2] = &node[cnt++];
len[t[i].y - t[i].x + MAX/2]++;
}
}
solve(MAX);
// 左下到右上
init();
FOR(i, 0, m)
{
int x = t[i].y, y = n - t[i].x + 1;
t[i].x = x; t[i].y = y;
if(t[i].x > t[i].y )
{
node[cnt].id = i;
node[cnt].next = p[t[i].x - t[i].y];
p[t[i].x - t[i].y] = &node[cnt++];
len[t[i].x - t[i].y]++;
}
else
{
node[cnt].id = i;
node[cnt].next = p[t[i].y - t[i].x + MAX/2];
p[t[i].y - t[i].x + MAX/2] = &node[cnt++];
len[t[i].y - t[i].x + MAX/2]++;
}
}
solve(MAX);
// 统计
int ans[10];
memset(ans, 0, sizeof(ans));
FOR(i, 0, m)
ans[num[i]]++;
FOR(i, 0, 8)
printf("%d ", ans[i]);
printf("%d\n", ans[8]);
}
return 0;
}