#include iostream#include cmathusing namespace std;int main(){int n;cinn;if(n==1){cout2;return 0;}int k=1;for(int i=3;i=100000;i+=2){int f=1;for(int j=2;j=sqrt(i);j++){if(i%j==0){f=0;break;}}if(f) k++;else continue;if(k==n) {couti;break;}}r

点我呐

#include iostream#include cmathusing namespace std;int main(){ //素数筛算法:先找出100000以内的所有质数 int a[100000]={}; for(int i=2;i=sqrt(100000);i++){ if(a[i]==0){ for(int j=i*i;j=100000;j+=i){ if(a[j]==0) a[j]=1; } } }//-

点我呐

#include iostream#include cstdio#include cmath#include cstringusing namespace std;int main(){ int sum=0; int day; cinday; for(int i=0;i5000;i++){ for(int j=0;j=i;j++){ sum+=i+1; day--; if(day==0) {coutsum; return 0;} } } return 0;}

点我呐

#includeiostreamusing namespace std;int main(){int a,b,c;cinabc;int sum=0;for(int x=0;x=1000;x++){if(a*xc) break;if((c-a*x)%b==0) sum++;}coutsum;return 0;}

点我呐

#include bits/stdc++.husing namespace std;int main() { int a,b,c; cinabc; int n=0; for(int x=0;x1000;x++){ for(int y=0;y1000;y++){ if(a*x+b*y==c) n++; } } coutn;return 0;}

点我呐

#include iostream#include cmathusing namespace std;int a[605];int main() { int n,x,w,id; cinnw; for(int p=1;p=n;p++){ scanf("%d", id=max(1,(int)floor(1.0*p*w/100)); a[x]++; int sum=0; for(int j=600;j=0;j--){ sum+=a[j]; if(sum=id){ printf("%

点我呐

#include bits/stdc++.h#define B 3#define ULL unsigned long long#define maxn 500010using namespace std;char s[maxn];int a[maxn],b[maxn],N;ULL ah[maxn],bh[maxn],n[maxn],cnt=0;int judge(int pos,int d){//pos字串中空位置,d距离中空的字符

点我呐

#includebits/stdc++.husing namespace std;int getchs(char c){return c-'a'+1;}int n;int jz=29;int mod=1000000007;string s;vectorlong long hashhz(string s){ vectorlong long HS(400005,0);long long jzs=1;for(int i=s.size()-1;i=0;i--){HS[s.size()

点我呐

#includeiostream#includemap#includestringusing namespace std;int main(){ int n; char c[207]; string d; cinn; mapstring,intm; while(cind){ cin.ignore(); if(d=="add"){ cin.getline(c,207); m[c]=1; } if(d=="find"){ cin.getline(c,207); if(m.find

点我呐

#include bits/stdc++.husing namespace std;int n,j,ne[1000101];long long sum;string s;void get_next(){ for(int i=1;in;i++) { while (js[i]!=s[j]){ j=ne[j];} if(s[i]==s[j]){ j++;} ne[i+1]=j; }}int main(){ cinns; j=0; get_next(); for(int i=1;i=

点我呐