k_koris的博客

这个方法很奇妙了，智商还是在线..#include<iostream>#include<cmath>using namespace std;int main(){ int n,m; while(cin>>n>>m) { int k=m%n; int a[105],q=0; for(int i=0;i<n;i++) { cin&...

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;int main(){ int k,oddsum,sum2,aveans,ans,maxscore,f1,f2,f3,f4,f5,a[1005]; double ave; ...

#include<iostream>#include<string>using namespace std;void index(int k){ switch (k){ case 0:cout<<"ling";break;   case 1:cout<<"yi";break;  case 2:cout<<"er&quo

#include<iostream>using namespace std;int ans;int digui(int n){ if(n==1) return ans; else if(n%2==0) { ans++; digui(n/2); } else if(n%2==1) { ans++; digui((3*n+1)/2); }}int main(){ int n; ...

用结构体数组排序发现原来写c循环感觉是多么的low比。。。#include<iostream>#include<string>#include<algorithm>using namespace std;struct Node{ string name; string snumber; int score;}node[1005]; bool cmp(const ...

早晚被自己蠢哭了怎么办。。。#include<iostream>#include<string>#include <iomanip>using namespace std;int main(){ int n; cin>>n;    for(int k=0;k<n/100;k++)    cout<<"B";    for(int k..

没有用什么筛法 感觉记了比赛也还是不会写那么多..#include<iostream>#include<cmath>using namespace std;bool isPrime(int n){ if(n==1 ||n==0) return false; if(n==2) return true; int tmp =(int)sqrt((double)n); for...

结构体数组排序了解一下 /* qq:1239198605 ctgu_yyf */#include<iostream>#include<cstdio>#include<string>#include<vector>#include<queue>#include<stack>#includ...