随笔分类 - ACM~~CoderForces
摘要：#include #include #include #include using namespace std;typedef pair Point;int n,m;void clockwise_rotate(Point &cell, int x){ for(int i = 0; i > n >> m >> x >> y >> z >> p; x %=4; y %=2; z %= 4; int tmp_n = n,tmp_m = m; for(int i = 0 ; i > cellX >> cellY
阅读全文
摘要：#include #include #include using namespace std;const int num = 6;const int item[] = {1,2,3,4,6,12};int main(){ int t; cin >> t; for(int i = 0 ; i > character; vector result; for(int j = 0 ; j = a) break; } if(col < b) result.push_back(a); } ...
阅读全文
摘要：#include #include #include #include #include using namespace std;int main(){ int n,m; cin >> n >> m; set distance; bool flag = true; for(int i = 0 ; i > rectangle; int dwarf_pos = rectangle.find('G'); int candy_pos = rectangle.find('S'); int dist = candy_pos - d...
阅读全文
摘要：#include #include #include #include using namespace std;int main(){ int n; cin >> n; vector board(n); int cnt = 0; for(int i = 0 ; i > board[i]; } for(int i = 1 ; i < n-1; i ++ ){ for(int j = 1 ; j < n-1; j ++ ){ if(board[i][j] == '#' && board[i-1][j] == '#' &a
阅读全文
摘要：#include #include #include #include using namespace std;int main(){ int n; cin >> n; vector x(n,0); for(int i = 0 ; i > x[i]; } bool flag = true; while(flag){ flag = false; sort(x.begin(),x.end()); for(int i = n - 1; i >=1; i -- ){ if(x[i]-x[i-...
阅读全文
摘要：#include #include #include using namespace std;int main(){ int n,d; cin >> n >>d; vectora(n); for(int i = 0; i >a[i]; int m; cin >> m; sort(a.begin(),a.end()); int sum = 0; if(m <=n){ for(int i = 0 ; i < m; ++ i) sum+=a[i]; } else{ for(int i ...
阅读全文
摘要：#include #include using namespace std;int main(){ int n,k,cnt = 0; cin >> n >>k; for( int i = 0 ; i goodNum(k+1,0); cin >> a; while(a){ if(a%10= k +1) cnt++; } cout<<cnt<<endl; return 0;}
阅读全文
摘要：#include #include #include using namespace std;int main(){ int n; cin >> n; vector a(n); for(int i = 0 ; i > a[i]; int maxlen = 0; if(n == 1) maxlen = 1; else if(n == 2) maxlen = 2; else{ maxlen = 2; int l = 0, r =1; for(int i = 2; i < n; ++ i){ ...
阅读全文
摘要：1 #include 2 #include 3 #include 4 5 using namespace std; 6 7 int check(int a, int b){ 8 if(a - b > 0 )return 1; 9 else if(a-b > n;16 vector x(n);17 for(int i = 0; i > x[i];18 int i;19 for( i = 3; i = n) cout<<"no"<<endl;34 }
阅读全文
摘要：1 #include 2 #include 3 #include 4 5 using namespace std; 6 7 int main(){ 8 int n; 9 cin >> n;10 string words = "> tmp;13 words +=tmp+"> message;17 if(message.length() = message.length()){cout<<"no"<<endl; return 0;}23 else ++i;24 }25 cout<<"...
阅读全文
摘要：1 #include 2 #include 3 4 using namespace std; 5 6 int main(){ 7 int m,sum = 0; 8 cin >> m ; 9 vector c(m+1,0);10 for(int i = 1; i > c[i];sum+=c[i];}11 int x,y,firstPart = 0, secondPart = 0,firstIndex = 0, secondIndex =0;12 cin >> x >> y;13 for(firstIndex = 0,secon...
阅读全文
摘要：#include using namespace std;int main(){ int k,d; cin >> k >>d; if(d==0) { k > 1 ? (cout<<"No solution"<<endl):(cout<<0<<endl); } else{ cout<<d; for(int i = 1 ; i < k; ++ i) cout<<0; cout<<endl; }}
阅读全文
摘要：#include #include using namespace std;int main(){ int n,m; cin >> n >> m; int minCorrectTime =1000, maxCorrectTime = 0, minWrongTime = 1000,tmp; for(int i = 0 ; i > tmp; minCorrectTime = min(tmp,minCorrectTime); maxCorrectTime = max(tmp,maxCorrectTime); } for(int i =...
阅读全文
摘要：因为数字只含有5或0，如果要被90整除的话必须含有0，否则输出-1 如果含有0的话，就只需考虑组合的数字之和是9的倍数，只需要看最大的5的个数能否被9整数#include #include using namespace std;int main(){ int n; cin >> n; int numOfZero = 0, numOfFive = 0,tmp; for(int i = 0 ; i >tmp; ( tmp == 5 ) ? (++numOfFive) : (++numOfZero); } if(numOf...
阅读全文
摘要：#include #include #include using namespace std;int main(){ int n; cin >> n; vector a(n); for(int i = 0 ; i >a[i]; sort(a.begin(),a.end()); swap(a[0],a[n-1]); for(int i = 0 ; i < n; ++i) cout<<a[i]<<" "; cout<<endl; return 0;}
阅读全文
摘要：注意题目的数字最大是7 而能整除的只有 1,2,3,4,6,故构成的组合只能是1,2,4 或1,2,6或1,3,6，故分别统计1,2,3,4,6的个数，然后再分配 1 #include 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 int main(){ 9 int n;10 cin >> n ;11 vector a1,a2,a3,a4,a6;12 int tmp;13 for(int i = 0 ; i >tmp;15 if(tmp != 1 &...
阅读全文
摘要：1 #include 2 #include 3 using namespace std; 4 5 int main(){ 6 int r,c; 7 cin >>r>>c; 8 vector row(r,false),col(c,false); 9 char ch;10 for(int i = 0 ; i > ch;13 if(ch == 'S') row[i] = col[j] = true;14 }15 }16 int cnt = 0;17 for(int i = 0 ; i < ...
阅读全文
摘要：1 #include 2 #include 3 4 using namespace std; 5 6 int main(){ 7 int n,m; 8 cin >> n >> m; 9 vector flag(n+1,false);10 for(int i = 0 ; i > a>>b;13 flag[a]=flag[b]=true;14 }15 int centerPoint = 0;16 for(int i = 1 ; i <= n ; i ++ ){17 if(!flag[i]){18 ...
阅读全文
摘要：#include #include #include using namespace std;int main(){ int n,m; cin >> n >> m; cout<<n+m-1<<endl; for(int i = 1; i <= m ; i ++) cout<<1<<" "<<i<<endl; for(int i = 2; i <= n; i ++ ) cout<<i<<" "<<m<<
阅读全文
摘要：#include #include #include #include using namespace std;int main(){ long long n; cin >>n; while(n){ if(n%10 == 1) n/=10; else if(n%100 == 14 ) n/=100; else if(n%1000 == 144) n/=1000; else { cout<<"NO"<<endl;return 0;} } cout<<"YES"<<endl; return 0;}
阅读全文
浙公网安备 33010602011771号