co-ict的博客
co-ict · 共 2 篇文章
#174div2B. Cows and Poker Game
这题比较简单 #include<iostream> #include<algorithm> #include<list> #include<cstdio> #include<stack> #include<string> #include<cstring> #define MAXN 200005 using namespace std; char s[maxn]; bool A[maxn],AI[maxn],F[maxn]; int main(){ long n,x1=0,x2=0,x3=0; scanf("%ld",&n); char x; scanf("%c",&x); for(int …
2013-04-01 19:59 · CodeForces · 评论(0)
#174div2A.Cows and Primitive Roots
A.Cows and Primitive Roots 题意,给定一个素数p(2 2000),要求1<=x<p,x-1,x^2-1,..x^(p-2)-1都不能被p整除,但x^(p-1)-1能整除p,要统计这样的x有多少个 思路,由于此题p值比较小,于是我是用快速幂取模(经典分治算法),直接计算幂,看是不是满足条件 #include<iostream> #include<algorithm> #include<list> #include<cstdio> #include<stack> #include<string> #include<cstring> #define MAXN 100005…
2013-04-01 19:55 · CodeForces · 评论(0)