C/C++
文章平均质量分 77
csdn_PatrickStar
这个作者很懒,什么都没留下…
展开
-
DNA Sorting
Problem:DNA SortingLanguage:C#include <stdio.h>struct DNA{ char sequences[50]; int measure;};void bubble(struct DNA row[],int number,struct DNA temp){ int i,j;原创 2018-11-05 22:23:29 · 244 阅读 · 0 评论 -
Mike and palindrome
Problem:Mike and palindromeLanguage:C#include <stdio.h>#include <string.h>int main(){ char s[15]; gets(s); int n=strlen(s); int count=0; int i; for(i=原创 2018-11-06 14:07:57 · 267 阅读 · 1 评论 -
Find Amir
Problem:Find AmirLanguage:C#include <stdio.h>int main(){ int n; scanf("%d",&n); if(n%2) printf("%d",n/2);原创 2018-11-06 14:11:14 · 106 阅读 · 0 评论 -
Gotta Catch Em' All!
Problem:Gotta Catch Em’ All!Language:C#include <stdio.h>#include <string.h>char letter[100000];int main(){ gets(letter); int B=0,a=0,b=0,l=0,r=0,u=0,s=0; i原创 2018-11-06 13:59:05 · 423 阅读 · 0 评论 -
Secret Combination
Problem:Secret CombinationLanguage:C#include <stdio.h>#include <string.h>char number[1010];char answer[1010];void button1(int length){ int i;原创 2018-11-06 14:13:25 · 355 阅读 · 0 评论 -
Memory and Trident
Problem: Memory and TridentLanguage:C#include <stdio.h>#include <string.h>#include <math.h>int main(){原创 2018-11-06 14:33:44 · 129 阅读 · 0 评论 -
Petya and Exam
Problem:Petya and ExamLanguage:C#include <stdio.h>#include <string.h>#include <stdbool.h&原创 2018-11-06 14:43:05 · 180 阅读 · 0 评论 -
Bash's Big Day
Problem:Bash’s Big DayLanguage:C#include <stdio.h>#include <string.h>#define N 100010int main(){ int n; scanf("%d",&am原创 2018-11-06 14:45:49 · 275 阅读 · 0 评论 -
Pasha and Phone
Problem:Pasha and PhoneLanguage:C#include <stdio.h>#define N 100010long long range(int k){ int i; long long range=1; for(i=1;i<=k;i++) { range*=10; } return range;原创 2018-11-06 14:48:16 · 200 阅读 · 0 评论 -
Find The Bone
Problem:Find The BoneLanguage:C#include <stdio.h>#include <stdbool.h>#include <string.h>#define N 1000010原创 2018-11-06 14:52:20 · 191 阅读 · 0 评论 -
Ohana Cleans Up
Problem:Ohana Cleans UpLanguage:C#include <stdio.h>#include <string.h>int max(int ans,int sum){ int max; if(ans<sum) max=sum; else max=ans; return max;}原创 2018-11-06 14:55:03 · 146 阅读 · 0 评论 -
Covered Path
Problem:Covered PathLanguage:C#include <stdio.h>int main(){ int v1,v2; scanf("%d%d",&v1,&v2); int t,d; scanf(&原创 2018-11-06 14:58:07 · 187 阅读 · 0 评论 -
X - 487-3279
Problem:X - 487-3279Describe:Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can ca...原创 2018-11-07 16:19:59 · 349 阅读 · 0 评论 -
Pasha and Stick
Problem:Pasha and StickLanguage:C#include <stdio.h>int main(){ int n; scanf("%d",&n); int group=n/4; if(n%2||n<5) group=0原创 2018-11-06 14:04:52 · 145 阅读 · 0 评论 -
Vitaly and Night
Problem:Vitaly and NightLanguage:C#include <stdio.h>int main(){ int n,m; int i; int count=0; int left,right; scanf("%d%d",&n,&a原创 2018-11-06 14:02:00 · 165 阅读 · 0 评论 -
Maya Calendar
Problem:Maya CalendarLanguage :C#include <stdio.h>#include <string.h>char *Haab[]={"pop","n原创 2018-11-05 22:30:25 · 287 阅读 · 0 评论 -
Toy Cars
Problem:Toy CarsLanguage:C#include <stdio.h>int main(){ int n; while(scanf("%d",&n)!=EOF) { int i,j; int array[110][1原创 2018-11-05 22:36:27 · 434 阅读 · 0 评论 -
Perfect Permutation
Problem:Perfect PermutationLanguage:C# include <stdio.h>int main(){ int n; int i; scanf("%d",&n); if(n%2) printf("-1&am原创 2018-11-06 14:16:01 · 211 阅读 · 0 评论 -
Kyoya and Photobooks
Problem:Kyoya and PhotobooksLanguage:C# include <stdio.h>#include <string.h>int main(){ char s[21]; gets(s); int n=strlen(s); int ans=(n+1)*原创 2018-11-06 14:18:30 · 150 阅读 · 0 评论 -
Equidistant String
Problem:Equidistant StringLanguage:C#include <stdio.h>#include <string.h>int main(){ char s1[100010],s2[100010]; scanf("%s%s",s1原创 2018-11-06 14:21:16 · 196 阅读 · 0 评论 -
Bear and Finding Criminals
Problem:Bear and Finding CriminalsLanguage:C#include <stdio.h>int main(){ int n,index; int city[101]; scanf("%d%d",&n,&index)原创 2018-11-06 14:27:19 · 160 阅读 · 0 评论 -
Bear and Five Cards
Problem:Bear and Five CardsLanguage:C#include <stdio.h>int min(int a,int b){ int min; if(a<b) min=a; else min=b; return min;}int main(){ int card[101]={0原创 2018-11-05 23:30:15 · 188 阅读 · 0 评论 -
Bear and Raspberry
Problem:Bear and RaspberryLanguage:C#include <stdio.h>int main(){ int n,c; int i; int a[101]; int max,temp; scanf("%d%d",&n,&am原创 2018-11-06 13:38:43 · 127 阅读 · 0 评论 -
Tavas and Nafas
Problem:Tavas and NafasLanguage:C#include <stdio.h>char *array1[]={"zero","one","two&原创 2018-11-06 13:43:40 · 274 阅读 · 0 评论 -
Memory and Crow
Problem:Memory and CrowLanguage:C#include <stdio.h>int main(){ int n; int i; int a[100000]; scanf("%d",&n); for(i=0;i<n;原创 2018-11-06 13:47:47 · 164 阅读 · 0 评论 -
Sasha and Sticks
Problem:Sasha and SticksLanguage:C#include <stdio.h>int main(){ long long int n,k; scanf("%I64d%I64d",&n,&k); if((n/k)%2) p原创 2018-11-06 13:50:52 · 206 阅读 · 0 评论 -
Bear and Strings
Problem:Bear and StringsLanguage:C#include <stdio.h>#include <string.h>int main(){ char s[5001]; gets(s); int n=strlen(s); int temp=0,ans=0; for(int i=0;原创 2018-11-06 14:29:59 · 138 阅读 · 0 评论 -
Ignatius and the Princess IV
Problem:Ignatius and the Princess IVDescription:“OK, you are not too bad, em… But you can never pass the next test.” feng5166 says.“I will tell you an odd number N, and then N integers. There will ...原创 2018-12-07 22:41:20 · 100 阅读 · 0 评论