随笔分类 -  鸽巢原理

摘要：鸽巢原理。用long long 与scanf.#include<iostream>#include<fstream>using namespace std;int n,m;long long a[100001];int b[100001];void read(){ int i,j,k;// ifstream cin("in.txt"); while(cin>>m>>n){ if(m==0&&n==0) return ; for(i=1;i<=n;i++) { scanf("%d",&a 阅读全文

摘要：鸽巢原理#include<iostream>#include<fstream>using namespace std;int a[10001];int b[10001];int c[10001];int n;void read(){// ifstream cin("in.txt"); int i,j,k; int ans=0; cin>>n; for(i=1;i<=n;i++) cin>>a[i]; for(i=1;i<=n;i++) { b[i]=b[i-1]+a[i]; if(b[i]%n==0) { cout 阅读全文