zngufeng的专栏

从0开始，递增每个人应有的份数，判断整数点，非整数点加1。 // Problem#: 10330 // Submission#: 2718942 // The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License // URI: http:/

int quick_pow(int a, int p) { if(p == 0) return 1; int ans = quick_pow(a, p/2); ans = ans*ans; if(p%2 == 1) ans = ans*a; return ans; }

for(i = 0; i < n; ++i) prime[i] = 1; prime[0] = 0; prime[1] = 0; for(i = 2; i <= sqrt(n); ++i) { if(prime[i]) { for(j = 2 * i; j <= n; j += i)

简单的字符串处理，使用struct和map，使得做起来十分简单 #include #include #include using namespace std; struct person { string name; string id; }; int main() { int n,i; map MJ; while(cin>>n&&n!=0)