Fly tree huan patch 1 #5
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
完成了p01_runningLetter
luckymark
reviewed
Mar 15, 2021
| int main() | ||
| { | ||
| cin>>a; | ||
| /* for(int i=1;i<100;++i) |
| int main() | ||
| { | ||
| time_t start = clock(); | ||
| printf("2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997"); |
There was a problem hiding this comment.
直接输出答案自然是最快的。。。。。 ( * ^_^ * )
| { | ||
| time_t start = clock(); | ||
| //printf("2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997"); | ||
| for(int i=2;i<=n;++i) |
There was a problem hiding this comment.
这个是正常的写法 ( * ^_^ * )
PS：只不过写在了一起，改了注释进行提交
| //��100��Χ����֤��°ͺղ������ȷ�� | ||
| #include<bits/stdc++.h> | ||
| using namespace std; | ||
| int pr[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; |
| unsigned long long n; | ||
| int main() | ||
| { | ||
| cin>>n; |
There was a problem hiding this comment.
啊，我没把需求写清楚，这个题目是要求打印出移动的步骤，例如：
A->C
C->B
...
There was a problem hiding this comment.
9号上课时按要求写了新的，然后忘了在github上更新，(lll￢ω￢)
| printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n"); | ||
| printf("#��ǰ���й���%d�ֻ���\n",num); | ||
| for(int i=1;i<=num;++i) | ||
| cout<<"��"<<i<<"�֣�"<<s[i].mtype<<" "<<s[i].nums<<endl; |
| bool meql(char a[],char b[]) | ||
| { | ||
| for(int i=0;a[i]||b[i];++i) | ||
| if(a[i]!=b[i])return 0; |
| else | ||
| { | ||
| printf("#������.\n"); | ||
| printf("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n"); |
| FILE *fp=fopen("saved.txt","r"); | ||
| fscanf(fp,"%d",&num); | ||
| for(int i=1;i<=num;++i) | ||
| fscanf(fp,"%s%d",&s[i].mtype,&s[i].nums); |
| { | ||
| start(); | ||
| cin>>tmp; | ||
| while(tmp<1||tmp>4){printf("����ָ��\n#����������#\n");cin>>tmp;} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
完成了一部分。。