반응형


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    int testcase;
 
    cin>>testcase;
 
    int *arr3=new int[testcase];
    for(int i=0; i<testcase; i++)
    {
        cin>>arr3[i];
    }
    for(int i=0; i<testcase; i++)
    {
        int n=0;
        n=arr3[i];
 
        //for(int i=0;i<testcase;i++)
        //{
            int count=0;
            int num=0;
            int tmp=500;
            int bnum=0;
            int snum=0;
            
 
            int *arr=new int[n];
            
            
 
            for(int i=2;i<=n;i++)
            {
                arr[i]=i;
            }
 
            for(int i=2;i<n;i++)
            {
                for(int j=2;j<n;j++)
                {
                
                    if(arr[j]!=i && arr[j]%i==0)
                    {
                        arr[j]=0;
                    }
 
                }
            }
 
            for(int i=2;i<n;i++)
            {
                if(arr[i]!=0)
                {
                     //cout<<arr[i]<<endl;
                     count++;
                }
            }
 
            int *arr2=new int[count];
            int c=2;
            
            for(int j=0; j<count; j++)
            {
                for(int i=c;i<n;i++)
                {
                    if(arr[i]!=0)
                    {
                         arr2[j]=arr[i];
 
                         c=i+1;
                         break;
                         
                    }
                }
            }
 
            //for(int j=0;j<count; j++)
            //{
            //    cout<<arr2[j]<<endl;//arr[2]에 소수 0부터 순서대로 저장되있음
            //}
 
 
            for(int i=0;i<count;i++)
            {
                for(int j=0; j<count; j++)
                {
                    if(arr2[i]>=arr2[j]&&n-arr2[i]==arr2[j])
                    {    
                        num=arr2[i]-arr2[j];
                        if(tmp>num)
                        {
                            bnum=arr2[i];
                            snum=arr2[j];
                        }
                        tmp=num;
                    }
                }
            }
 
            cout<<snum<<" "<<bnum<<"\n";
        
        //}
    }    
}
cs
반응형
저작자표시 비영리 변경금지 (새창열림)

'알고리즘 > 알고리즘(c++)' 카테고리의 다른 글

백준[2751]_수 정렬하기2  (0) 2018.08.29
백준문제[2775번]_부녀회장이 될테야  (2) 2018.08.28
백준문제[4344]_평균은 넘겠지  (1) 2018.08.27
백준문제[1152]_단어의 개수  (1) 2018.08.27
백준문제[1205]_등수 구하기  (0) 2018.08.27

+ Recent posts

티스토리툴바