15 条题解

  • 1
    @ 2025-4-11 15:42:59

    import math for i in range(2,100): m=i flag=True for j in range(2,int(math.sqrt(m+0.005))+1): if m%j==0: flag=False break if flag: print(m)

    • 1
      @ 2025-4-9 11:51:53

      def check(x): if x1 or x0: return "NO" else: for i in range(2,x): if x%i0: return "NO" return "YES" for a in range(2,101): if check(a)"YES": print(a)

      • 1
        @ 2025-4-9 11:49:29
        a=[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]
        for i in range(0,25):
            print(a[i])
            
        
        
        • 1
          @ 2025-4-4 21:19:14

          a = 0 for i in range(2,100): for m in range(2,i): if i%m == 0: a = 1 if a == 0: print(i) a = 0

          • 0
            @ 2025-4-20 17:10:36
            b=0
            for i in range(2,101):
                for a in range(1,i+1):
                    if i%a==0:
                        b+=1
                if b==2:
                    print(i)
                b=0
            
            • 0
              @ 2025-4-15 15:51:38

              我复活了

              • 0
                @ 2025-4-9 12:00:47

                def check(x): if x1 or x0: return "NO" else: for i in range(2,x): if x%i==0: return "NO" return "YES"

                for a in range(2,101): if check(a)=="YES": print(a)

                • 0
                  @ 2025-4-9 12:00:12

                  def check(x): if x1 or x0: return "NO" else: for i in range(2,x): if x%i==0: return "NO" return "YES"

                  for a in range(2,101): if check(a)=="YES": print(a)

                  • 0
                    @ 2025-4-9 11:56:02

                    春暖花开谈恋爱,不如信息学竞赛

                    def zxw(x):
                        for i in range(2,x):
                            if x%i==0:
                                return 0
                        return 1
                    for j in range(2,101):
                        if zxw(j)==True:
                            print(j)
                    
                    
                    • 0
                      @ 2025-3-10 15:58:57

                      我是郑诚的好父亲

                      • 0
                        @ 2025-3-1 14:44:25
                        a=[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]
                        for i in range(0,25):
                            print(a[i])
                            
                        
                        • 0
                          @ 2025-2-19 14:06:58

                          import math for i in range(2,100): m=i flag=True for j in range(2,int(math.sqrt(m+0.005))+1): if m%j==0: flag=False break if flag: print(m)

                          • -1
                            @ 2025-3-4 15:08:14

                            #include<bits/stdc++.h> using namespace std;

                            int main(){ cout<<2<<endl<<3<<endl<<5<<endl<<7<<endl<<11<<endl<<13<<endl<<17<<endl<<19<<endl<<23<<endl<<29<<endl<<31<<endl<<37<<endl<<41<<endl<<43<<endl<<47<<endl<<53<<endl<<59<<endl<<61<<endl<<67<<endl<<73<<endl<<78<<endl<<79<<endl<<83<<endl<<89<<endl<<97<<endl; return 0; }

                          • -1
                            @ 2025-2-25 14:57:45

                            助力100题 #include <bits/stdc++.h>

                            using namespace std;

                            int main() {

                            int f1 = 1;
                            
                            for (int i = 2; i <= 100; i++) {
                                f1 = 1;
                                for (int j = 2; j <= i; j++) {
                                    if (i % j == 0 && j != i) {
                                        f1 = 0;
                                    }
                                }
                                if (f1 == 1)
                                    cout << i << endl;
                            }
                            
                            
                            return 0;
                            

                            }

                            • -2
                              @ 2025-3-4 15:35:21

                              666

                              • 1

                              d029: 求出2-100之间的所有质数(素数)

                              信息

                              ID
                              36
                              时间
                              1000ms
                              内存
                              128MiB
                              难度
                              7
                              标签
                              递交数
                              4271
                              已通过
                              1145
                              上传者