4 条题解

  • 0
    @ 2025-12-9 15:20:41

    #include<bits/stdc++.h> using namespace std; long long n,f[200],b[200],c[200],s; void dfs(int deep){ if(deep>n){ s++; return; } for (int i=1;i<=n;i++){ bool p=1; for(int j=max(1,deep-2);j<deep;j++) if(f[j]-ji-deep||f[j]+jdeep+i){p=0;break;} for(int j=1;j<deep;j++) if(f[j]==i){p=0;break;} if(p){ f[deep]=i; dfs(deep+1); } } } int main(){ cin>>n; dfs(1); cout<<s; }

    • 0
      @ 2025-12-8 15:28:32

      #include<bits/stdc++.h> using namespace std; long long n,fx[5]={0,-1,1,0,0},fy[5]={0,0,0,-1,1},s,mx,m; bool f[1005][1005]; char a[1005][1005]; void dfs(int x,int y){ for(int i=1;i<=4;i++){ int tx=x+fx[i]; int ty=y+fy[i]; if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&f[tx][ty]0&&a[tx][ty]''){ f[tx][ty]=1; s++; dfs(tx,ty); } } } int main(){ cin>>m>>n; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>a[i][j]; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(a[i][j]==''&&f[i][j]==0){ s=1; f[i][j]=1; dfs(i,j); mx=max(mx,s); } } } cout<<mx; }

      • 0
        @ 2025-11-29 11:46:55

        ruaoj 再出几道题 thanks

        • 0
          @ 2025-11-24 15:05:26

          C :

          #include <stdio.h>
          int main()
          {
          int a,b;
          while(scanf("%d %d",&a, &b) != EOF)
          printf("%d\n",a+b);
          return 0;
          }
          

          C++ :

          #include <iostream>
          using namespace std;
          int main() {
              int a,b;
              while (cin >> a >> b) {
                  cout << a+b << endl;
              }
          	return 0;
          }
          
          

          Pascal :

          var 
            a,b:longint;
          begin
            while not(eof) do
               begin
                 readln(a,b);
                 writeln(a+b);
               end;
          end.
          

          Java :

          import java.util.*;
          public class Main {
          	public static void main(String args[]) {
          		Scanner cin = new Scanner(System.in);
          		int a, b;
          		while (cin.hasNext()) {
          			a = cin.nextInt(); 
          			b = cin.nextInt();
          			System.out.println(a + b);
          		}
          	}
          }
          

          Python :

          import sys
          for line in sys.stdin:
              a = line.split()
              print int(a[0]) + int(a[1])
          

          PHP :

          <?php
          echo "6\n30";
          ?>
          

          Perl :

          #! /usr/bin/perl -w
          while(<>){
            chomp;
            ($a,$b)=split(/\s/,$_);
            printf "%d\n",$a+$b;
          }
          

          C# :

          using System;
          using System.Collections.Generic;
          using System.Linq;
          using System.Text;
          using System.IO;
          
          namespace ConsoleApplication3
          {
              class Program
              {
                  static void Main(string[] args)
                  {
                      string s ;
                      for (; ; ) 
                      {
                          s = Console.ReadLine();
                          if (s == null)
                              break;
                          string[] words = new string[2];
                          words = s.Split(new char[] { ' ' });
                          Console.WriteLine("{0}", int.Parse(words[0]) + int.Parse(words[1]));
                      }
                  }
              }
          }
          
          • 1

          信息

          ID
          370
          时间
          2000ms
          内存
          32MiB
          难度
          8
          标签
          递交数
          14
          已通过
          7
          上传者