SDUT 个人赛
个人赛
sdut_you
这个作者很懒,什么都没留下…
展开
-
L - Sticky Situation(Gym 101490L)
#include <iostream> #include <algorithm> using namespace std; int main() { int n,i; long long int a[20020]; cin>>n; for(i=0; i<n; i++) { cin>>a[i]; } sort(a,a+n); int flag=0; for(i=0;..原创 2020-08-15 08:18:04 · 134 阅读 · 0 评论 -
G - Cutie Pie(Gym 101020G)
Consider a NxM small-letters grid. SVU asked you to check whether this grid is a Cutie Pie or not A grid is a cutie pie if you can find the word “pie” in any direction (vertical, horizontal, and radial). Your program should output “Cutie Pie!” if the grid原创 2020-08-13 10:31:53 · 221 阅读 · 0 评论 -
A - Window(Gym 101020A)
#include <stdio.h> #include <iostream> #include <algorithm> using namespace std; int main() { freopen("window.in","r",stdin);//下次一定会了!!! int t; long long int x,y; cin>>t; while(t--) { cin>>x&g..原创 2020-08-13 11:04:46 · 138 阅读 · 0 评论 -
I - Playing With Strings(Gym 101020I)
#include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> using namespace std; int main() { int t,n,i,j; char a[1010]; cin>>t; while(t--) { cin>>a; n=strlen(a)...原创 2020-08-13 11:50:05 · 97 阅读 · 0 评论 -
J - Good Coins(Gym 101020J)
#include <stdio.h> #include <iostream> #include <algorithm> using namespace std; int main() { int t,a,b,k; cin>>t; while (t--) { cin>>a>>b; if (a<b) { k=a; ..原创 2020-08-13 12:01:16 · 84 阅读 · 0 评论