rcc-legacy/tests/sysy_lvX/053_prim.sy


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

//sample function of prim
int main(){
    int cnt, i, flag;
    cnt = 0;
    i = 2;
    flag = 1;
    while(i <= 100){
        flag = 1;
        int j = 2;
        while (j * j < i){
            if(i % j == 0){
                flag = 0;
                break;
            }
            j = j + 1;
        }
        if(flag == 1){
            cnt = cnt + 1;
        }
        i = i + 1;
    }
    return cnt;
}