zoukankan      html  css  js  c++  java
  • poj 2769 Reduced ID Numbers(memset使用技巧)

    Description

    T. Chur teaches various groups of students at university U. Every U-student has a unique Student Identification Number (SIN). A SIN s is an integer in the range 0 ≤ s ≤ MaxSIN with MaxSIN = 106-1. T. Chur finds this range of SINs too large for identification within her groups. For each group, she wants to find the smallest positive integer m, such that within the group all SINs reduced modulo m are unique.

    Input

    On the first line of the input is a single positive integer N, telling the number of test cases (groups) to follow. Each case starts with one line containing the integer G (1 ≤ G ≤ 300): the number of students in the group. The following G lines each contain one SIN. The SINs within a group are distinct, though not necessarily sorted.

    Output

    For each test case, output one line containing the smallest modulus m, such that all SINs reduced modulo m are distinct.

    Sample Input

    2
    1
    124866
    3
    124866
    111111
    987651
    

    Sample Output

    1
    8
    代码:
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    using namespace std;
    int t[310];
    bool vis[1000010];
    
    int main()
    {
        int n;
        scanf("%d",&n);
        while(n--)
        {
            int m,i,j;
            scanf("%d",&m);
            for(i=1;i<=m;i++)
                cin>>t[i];
            for(i=m;;i++)
            {
                memset(vis,false,i*sizeof(vis[0])); //时间172ms
                for(j=1;j<=m;j++)                   //memset(vis,false,sizeof(vis));    tle
                if(vis[t[j]%i]) break;
                else vis[t[j]%i]=true;
                if(j>m) break;
            }
            printf("%d
    ",i);
        }
        return 0;
    }
    


    
       
    
  • 相关阅读:
    CF869E The Untended Antiquity 解题报告
    Walk 解题报告
    CF911F Tree Destruction 解题报告
    P4397 [JLOI2014]聪明的燕姿
    洛谷 P2329 [SCOI2005]栅栏 解题报告
    洛谷 P3747 [六省联考2017]相逢是问候 解题报告
    set-erase
    set-empty
    set-empty
    set-end
  • 原文地址:https://www.cnblogs.com/mengfanrong/p/5162873.html
Copyright © 2011-2022 走看看